Practice Test: Question Set - 03
1. Match the following.
(a)
Completeness (i) How long does it take to find a solution
(b) Time
Complexity (ii) How much memory need to perform the search.
(c) Space
Complexity (iii) Is the strategy guaranteed to find the solution when there in
one.
2. What will be the value of top, if there is a size of stack STACK_SIZE is 5
3. Any node is the path from the root to the node is called
4. Which of the following data structure store the homogeneous data elements?
5. Which of the following data structure is linear type?
6. Each node in a linked list has two pairs of _______ and _______
7. _______ level is where the model becomes compatible executable code
8. _______ is very useful in situation when data have to stored and then retrieved in reverse order.
9. Which of the following data structure is linear type?
10. In a queue, the initial values of front pointer f rare pointer r should be _______ and ________ respectively.
Show and hide multiple DIV using JavaScript
View All Answers
Next Tests:
- (A) a-iii, b-ii,
c-i
- (B) a-i, b-ii, c-iii
- (C) a-iii, b-i, c-ii
- (D) a-i, b-iii, c-ii
2. What will be the value of top, if there is a size of stack STACK_SIZE is 5
- (A) 5
- (B) 6
- (C) 4
- (D) None
3. Any node is the path from the root to the node is called
- (A) Successor
node
- (B) Ancestor
node
- (C) Internal
node
- (D) None of the
above
4. Which of the following data structure store the homogeneous data elements?
- (A) Arrays
- (B) Records
- (C) Pointers
- (D) Lists
5. Which of the following data structure is linear type?
- (A) Array
- (B) Tree
- (C) Graphs
- (D) Hierarchy
6. Each node in a linked list has two pairs of _______ and _______
- (A) Link
field and information field
- (B) Link
field and avail field
- (C) Avail
field and information field
- (D) Address
field and link field
7. _______ level is where the model becomes compatible executable code
- (A) Abstract
level
- (B) Application
level
- (C) Implementation
level
- (D) All of the
above
8. _______ is very useful in situation when data have to stored and then retrieved in reverse order.
- (A) Stack
- (B) Queue
- (C) List
- (D) Link list
9. Which of the following data structure is linear type?
- (A) Graph
- (B) Trees
- (C) Binary tree
- (D) Stack
10. In a queue, the initial values of front pointer f rare pointer r should be _______ and ________ respectively.
- (A) 0 and 1
- (B) 0 and -1
- (C) -1 and 0
- (D) 1 and 0
Next Tests: