Data Structure & Algorithms Questions and Answers
Practice ModeShowing 10 of 77 questions
Q1
Each data item in a record may be a group item composed of sub-items; those items which are indecomposabe are called
Answer: Option D
Q2
Which of the following statement is false ?
Answer: Option C
Q3
Binary search algorithm cannot be applied to
Answer: Option D
Q4
When new data are to be inserted into a data structure, but there is no available space; this situation is usually called
Answer: Option D
Q5
When new data are to be inserted into a data structure, but there is no available space; this situation is usually called
Answer: Option D
Q6
The situation when in a linked list START=NULL is
Answer: Option A
Q7
The following i two-way list
Answer: Option D
Q8
The following name does not relate to stacks
Answer: Option A
Q9
In a binary tree, certain null entries are replaced by special pointers which point to nodes higher in tree for efficiency. These special pointers are called
Answer: Option D
Q10
In a graph if e=(u, v) means
Answer: Option C