DSA quiz

Which of the following sorting algorithms can be used to sort a random linked list with minimum time complexity?

• Insertion sort

• Quick sort

• Heap sort

• Merge sort

Answer explanation

In the worst case, the number of comparisons needed to search a singly linked list of length n for a given element is..

• log(2*n)

• n\2

• log(2*n)-1

• n

Let P be a singly linked list. Let Q be the pointer to an intermediate node x in the list. What is the worst-case time complexity of the best known algorithm to delete the node Q from the list?

• O(n)

• O(log2n)

• O(log n)

• O(1)

The minimum number of stacks needed to implement a queue is

• 3

• 2

• 1

• 0

Answer explanation

Which of the following correctly declares an array?

• int sparks[20];

• int spark;

• sparks{20};

• array sparks[20];

Answer explanation

Stack A has the entries a, b, c (with a on top). Stack B is empty. An entry popped out of stack A can be printed immediately or pushed to stack B. An entry popped out of the stack B can be only be printed. In this arrangement, which of the following permutations of a, b, c are not possible?

• b a c

• b c a

• c a b

• a b c

The five items: A, B, C, D, and E are pushed in a stack, one after other starting from A. The stack is popped four items and each element is inserted in a queue. The 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

• A

• B

• C

• D

The size of the array should always be _____

• POSITIVE

• NEGATIVE

• WHOLE NUMBER

• REAL NUMBER

Which of these methods of class String is used to obtain the length of the String object?

• get()

• sizeof()

• lenghtof()

• lenght()

In a circular linked list, the last node points to the____

• i don't know

• tail node

• first node

• middle pointer