Analysis of Algorithms and Computational Complexity Questions and Answers
Practice ModeShowing 10 of 239 questions
Q1
The variables which can be accessed by all modules in a program, are known as
Answer: Option D
Q2
In what kind of storage structure for strings, one can easily insert, delete, concatenate and rearrange substrings ?
Answer: Option C
Q3
which of the following operations is performed more efficiently by doubly linked list than by linear linked list
Answer: Option A
Q4
A linear list in which elements can be added or removed at either end of but not in the middle is known as
Answer: Option B
Q5
A binary tree in which if all its levels except possibly the last, have the maximum number of nodes and all the nodes at the last level appear as far left as possible, is known as
Answer: Option D
Q6
A list of integers is read in, one at a time, and a binary search tree is constructed. Next the tree is traversed and the integers are printed. Which traversed would result in a printout which duplicates the original order of the list of integers?
Answer: Option D
Q7
The five items : A,B,C,D, and E are pushed in a stack, one after the other starting from A. The stack is popped four times and each element is inserted in a que. Then two elements are deleted from the queue and pushed back on the stack. Now one item is popped from the stack. The popped item is
Answer: Option D
Q8
If each node in a tree has value greater than every value in its left subtree and has value less than every value in its right subtree, the tree is known as
Answer: Option C
Q9
Which of the following sorting procedure is the slowest
Answer: Option D
Q10
Which of the following is a tabular listing of contents of certain registers and memory locations at different times during the execution of a program ?
Answer: Option B