Data Structures

The process of accessing data stored in a serial access memory is similar to manipulating data on a/an:

• Array

• Binary Tree

• Heap

• Stack

Which of the following data structures CANNOT store the non-homogeneous data elements?

• Array

• Pointers

• Records

• Stack

In a binary tree, certai null entries are replaced by special pointers which point to nodes higher in the tree for efficiency. These special pointers are called:

• Branch

• Leaf

• Path

• Thread

Which of the following is NOT a type of queue?

• Circular Queue

• Ordinary Queue

• Priority Queue

• Single ended Queue

In priority queue, insertion and deletion takes place at:

• Front, rear end

• Only at Rear end

• Only at front end

• Any position

Which of the following data structure store the homogeneous data elements>?

• Arrays

• Lists

• Pointers

• Records

Each data item in a record may be a group item composed of sub-items; those items which are indecomposable are called:

• Atoms

• elementary items

• scalars

• all of the above

Which of the following data structure allows deletions at both ends of the list but insertion at only one end.

• Input restricted dequeuer

• output restricted dequeuer

• priority queue

• stack

The number of binary trees with 3 nodes which when traversed in post order gives the sequence A,B,C is?

• 3

• 5

• 7

• 9

The average case occurs in linear search algorithm when:

• Item is somewhere in the middle of the array

• Item is not in the array at all

• Item is the last element in the array

• When item is the last element in the array or is not there at all.