Q.1
What is a data structure?
  • A method of arranging data
  • A way of keeping data without an order?
  • A "stack" only
  • There is no formal definition for "Data Structure"
Q.2
Which of the following data structure is linear type?
  • Stack
  • Array
  • Queue
  • All of the above
Q.3
Which of the following is the most widely used external memory data structure?
  • a) AVL tree
  • b) B-tree
  • c) Red-black tree
  • d) Both AVL tree and Red-black tree
Q.4
A variant of linked list in which last node of the list points to the first node of the list is?
  • Singly linked list
  • Doubly linked list
  • Circular linked list
Q.5
Example of non linear data structure
  • Array
  • Tree
  • Queue
  • Stack
Q.6
Suppose we are sorting an array of eight integers using quick sort, and we have just finished the first partitioning with the array looking like this:2 5 1 7 910Identify the correct statement?
  • Neither the 7 nor the 9 is the pivot.
  • The pivot could be either the 7 or the 9.
  • The pivot is not the 7, but it could be the 9.
  • The pivot could be the 7, but it is not the 9.
Q.7
Which of the following applications may use a stack?
  • A parentheses balancing program
  • Tracking of local variables at run time
  • Compiler Syntax Analyzer
  • Data Transfer between two asynchronous process
Q.8
A complete binary tree with 5 levels has how many nodes? (Root is Level 1)
  • Op 1: 15
  • Op 2: 25
  • Op 3: 63
  • Op 4: 31
Q.9
What is the data structure used to perform recursion?
  • Array
  • Stack
  • Queue
  • Linked list
Q.10
A struct is typically a ____ data structure.
  • simple
  • linked
  • heterogeneous
  • dynamic
Q.11
A terminal node in a binary tree is called __________
  • Root
  • Branch
  • Child
  • Leaf
Q.12
Which among the below specified condition is applicable if the Queue is non - empty?
  • a. rear > front
  • b. rear < front
  • c. rear = front
  • d. Unpredictable
Q.13
A tree sort is also known as__________ sort.
  • quick
  • heap
  • shell
  • selection
Q.14
Which of the following principle does queue use?
  • LIFO
  • FIFO
  • Linear
  • Ordered
Q.15
Entries in a stack are “ordered”. What is the meaning of this statement?
  • A collection of stacks is sortable
  • Stack entries may be compared with the ‘<‘ operation
  • The entries are stored in a linked list
  • There is a Sequential entry that is one by one
Q.16
TREE[1]=NULL indicates is _____________
  • Overflow
  • Empty
  • Underflow
  • Full
Q.17
Which of the following data structure is non linear type?
  • Stack
  • Queue
  • Tree
  • Liked list
Q.18
A tree is composed of ____ connected by edges or lines.
  • Fruit
  • Leaf Node
  • Root Node
  • Nodes
Q.19
To measure Time complexity of an algorithm Big O notation is used which:
  • A. describes limiting behaviour of the function
  • B. characterises a function based on growth of function
  • C. upper bound on growth rate of the function
  • D. all of the mentioned
Q.20
In ____________ data structure, the data items are arranged in a linear sequence.
  • linear
  • non linear
  • both a and b
  • all of above
0 h : 0 m : 1 s