Lectureship in Computer Science-Quiz#2(Prof. Dr. Hafiz Shehzad)

 Which of these best describes an array?

 A linear collection of data elements where the linear node is given by means of pointer is called?

 A linear list of elements in which deletion can be done from one end (front) and insertion can take place only at the other end (rear) is known as a ?

 A queue follows __________

 A data structure in which elements can be inserted or deleted at/from both the ends but not in the middle is?

 In simple chaining, what data structure is appropriate?

 Which of the following is false about a doubly linked list?

 What is an AVL tree?

 Every AVL is _________________

If numbers 5, 222, 4, 48 are inserted in a queue, which one will be removed first?

What is an AVL tree?

Given an empty AVL tree, how would you construct AVL tree when a set of numbers are given without performing any rotations?

Which one of the following operations removes top value of the stack?

Suppose currentNode refers to a node in a linked list (using the Node class with member variables called data and nextNode). What statement changes currentNode so that it refers to the next node?

Consider the following sequence of push operations in a stack:

stack.push(‘7’)

stack.push(‘8’)

stack.push(‘9’)

stack.push(‘10’)

stack.push(‘11’)

stack.push(‘12’)

Inorder has ________ pattern.

Divide-and-conquer as breaking the problem into a small number of

What is the worst case complexity of bubble sort?

The operation for adding an entry to a stack is traditionally called

Binary Search is an algorithm of searching, used with the ______ data.