Practice Test: Question Set - 02
1. State True or False.
(i) An
undirected graph which contains no cycles is called forest.
(ii) A graph
is said to be complete if there is an edge between every pair of vertices.
2. A ________ is a graph that has weights of costs associated with its edges.
3. ________ is not an operation performed on linear list
- (A) True, True
- (B) False, True
- (C) False, False
- (D) True, False
2. A ________ is a graph that has weights of costs associated with its edges.
- (A) Network
- (B) Weighted
graph
- (C) Both A and B
- (D) None A and B
3. ________ is not an operation performed on linear list
(i) Insertion
(ii) Deletion
(iii) Retrieval
(iv) Traversal
4. A data structure where elements can be added or removed at either end but not in the middle is called ________
5. When does top value of the stack changes?
6. A ________ does not keep track of address of every element in the list.
7. Which if the following is/are the levels of implementation of data structure
8. _______ is not the component of data structure.
9. Which of the following data structure can’t store the non-homogeneous data elements?
10. To represent hierarchical relationship between elements, which data structure is suitable?
Show and hide multiple DIV using JavaScript
View All Answers
Next Tests:
- (A) Only i, ii
and iii
- (B) Only i and
ii
- (C) All of the
above
- (D) None of the
above
4. A data structure where elements can be added or removed at either end but not in the middle is called ________
- (A) Linked lists
- (B) Stacks
- (C) Queues
- (D) Dequeue
5. When does top value of the stack changes?
- (A) Before
deletion
- (B) While
checking underflow
- (C) At
the time of deletion
- (D) After
deletion
6. A ________ does not keep track of address of every element in the list.
- (A) Stack
- (B) String
- (C) Linear array
- (D) Queue
7. Which if the following is/are the levels of implementation of data structure
- (A) Abstract
level
- (B) Application
level
- (C) Implementation
level
- (D) All
of the above
8. _______ is not the component of data structure.
- (A) Operations
- (B) Storage
Structures
- (C) Algorithms
- (D) None
of above
9. Which of the following data structure can’t store the non-homogeneous data elements?
- (A) Arrays
- (B) Records
- (C) Pointers
- (D) Stacks
10. To represent hierarchical relationship between elements, which data structure is suitable?
- (A) Deque
- (B) Priority
- (C) Tree
- (D) Graph
Next Tests: