Data Structures
This test consists of multiple choice questions related to data structure concept for computer science students and gate aspirants.
Questions
What is the mean of 'MAX' term in the syntax below?
typedef struct stack{ int data[MAX]; int top;}stack;
- It defines the maximum value of the elements in the stack.
- It defines the maximum size of the stack.
- It defines the number of integer values.
- It defines the number of elements in the stack.
- Both (2) and (4).
Serving requests of a single shared resource and transferring data asynchronously is an example of ___ data structure?
- Stack
- Queue
- Array
- Tree
- None of the above
What will be the pre-order traversal of the given in-order traversal of tree SQTPURV?
- PQSTRUV
- PQSTRVU
- TQSPRUV
- TSQPRUV
- None of the above
Which of the following field in the doubly linked list contains the address of the first element of the list?
- Previous pointer field
- Next pointer field
- Information field of the node
- Tail
- Head
Which of the following is not a true statement?
- A binary search tree is represented by the linked list using pointers.
- In linked list representation of binary tree, the left pointer points to the data field of the next node.
- A binary search tree should have data field in the linked list representation.
- Doubly linked list can be used to represent the binary search tree.
- None of the above
Which of the following is/are not a true statement(s)?
- A binary search tree may be empty.
- In a binary search tree, the left and right subtree of the root are also binary search trees.
- A binary search tree can be represented using linked list.
- A binary search tree can be represented using a array.
- None of the above
Which of the following value will be represented by the previous pointer field in the doubly linked list, if there is no preceding element in the list?
- Zero
- Null
- Void
- It does not return any value if the preceding element is absent
- None of the above
Which of the following will be the sentinel value for front variable for the underflow condition of queue?
- 0
- 1
- - 1
- Null
- None of the above
Which of the following field in the doubly linked list should be Null in case of empty linked list?
- prev
- next
- head
- tail
- both (3) and (4)
A priority queue can be implemented by using ____?
- Linked list
- Heap
- Multiple queues
- All of the above
- Only (2) and (3)
Elements can be added and removed from the either end in ____?
- Priority queue
- Deque
- Linear queue
- Circular queue
- None of the above
What is the mean of shape property of a heap data structure?
- It means that the node, which is the smallest of all its children, is called min heap.
- It means that the node, which is the largest of all its children, is called max heap.
- It means that the heap is a completely or nearly complete binary tree.
- Both (2) and (3)
- None of the above
Which of the following has hierarchical representation of data structure?
- Stack
- Tree
- Queue
- Graph
- Both (2) and (4)
Which of the following is a false statement?
- A data structure is a logical representation of a particular data.
- Stack and queue are linear data structures.
- A heap is called a binary tree.
- Data structures also have merging operation.
- None of the above
Which of following stack operation returns a Boolean value?
- push()
- pop()
- size()
- isEmpty()
- peek()