TEST YOUR BASICS IN DATA STRUCTURES

Stack follows what principle
1. First in first out
2. First in last out
3. Last in last out
4. Last in first out
Which of the following is not the type of queue ?
1. Priority queue
2. Circular queue
3. Single ended queue
4. Ordinary queue
A graph is a collection of nodes, called...... And line segments called arcs or..................... that connect pair of nodes.
1. vertices, paths
2. vertices, edges
3. graph node, edges
4. edges, vertices
In which traversal we process all of a vertex’s descendants before we move to an adjacent vertex.
1. Depth Limited
2. Width First
3. Breadth First
4. Depth First
To represent hierarchical relationship between elements, which data structure is suitable?
1. Graph
2. Tree
3. Dequeue
4. stack
Which of the following is true about stack ADT
1. Elements can be added at only one end
2. Last inserted elemented is deleted first
3. Top pointer always point to the last element of the stack
4. Stack is a linear data structure
Which among the following are applications of queues ?
1. Job Scheduling
2. Used in parsing
3. Evaluation of expressions
4. airline routing
This data structure allows deletions at both ends of the list but insertion at only one end.
1. DEqueue
2. Priority queue
3. Input restricted DEqueue
4. output restricted DEqueue
Convert the expression to the postfix form (a+b)*c-d/e
1. ab+c*de-/
2. ab+c*de/-
3. abc*+d-e/
4. abc*de/-+
If a queue is implemented with a linked list, keeping track of a front node and a rear node with two reference variables. Which of these reference variables will change during an insertion into anEMPTY queue ?
1. Only front changes
2. both change
3. Only rear change
4. neither changes

TEST YOUR BASICS IN DATA STRUCTURES

Quiz