Analysis of Algorithms and Computational Complexity
Analysis of Algorithms and Computational Complexity
231. The minimum number of edges in a connected cyclic graph on n vertices is
- n - 1
- n
- n + 1
- none of these
232. The post fix expression for the infix expression A + B * (C + D)/F + D * E is
- AB + CD + *F/D + E*
- ABCD + *F/+DE*+
- A * B + CD/F*DE ++
- A + *BCD/F * DE++
233. In a circularly linked list organization; insertion of a record involves the modification of
- no pointer
- 1 pointer
- 2 pointers
- 3 pointers
234. Stack is useful for implementing
- radix sort
- breadth first search
- recursion
- depth first search
237. The process of accessing data stored in a tape is similar to manipulating data on a
- stack
- queue
- list
- heap
238. The maximum degree of any vertex in a simple graph with n vertices is
- n
- n - 1
- n + 1
- 2n - 1
239. the number of edges in a regular graph of degree d and n vertices is
- maximum of n, d
- n + d
- nd
- nd/2