Model Viva Questions for “ Data Structure lab”
1. Define searching process.
Searching is the process of finding an element within the list of elements.
2. How many types of searching are there?
There are basically two types of searching:-Linear search and Binary search.
3. Why binary search method is more efficient than liner search?
It is because less time is taken by binary search to search an element from the sorted list of
elements.
4. Explain the sorting.
Sorting is arranging the elements of a list in either ascending or in descending order.
5. What are the different types of sortings in data structures ?
1> bubble sort 2> selection sort 3> insertion sort 4> quick sort 5> radix sort 6> merge sort 7>
heap sort.
6. What is an array & how many types of arrays are there?
An array is a collection of homogeneous elements.
Types of array: One-Dimentional array, Two-Dimentional array, Multi-Dimentional array.
7. How can be declared an array?
data_type var_name[ Expression];
8. How many types of implementation of a two-dimentional array?
1. Row-major implementation 2. Column-major implementation
9. What are the operations of array?
Insertion, Deletion, Traversing, Searching, Sorting and display.
10. What is a stack?
Stack is an ordered collection of elements like array. It is logically a last in first out (LIFO)
11. What are the operations performed on stack?
Push for insertion and pop for deletion.
12. How stacks are implemented?
Stacks are implemented in two ways: static implementation –array
Dynamic implementation –pointers.
13. Define “Top of stack”
Pointer indicating the top element of the stack.
1
14. Is stack a primitive or non primitive data structure ?
Non primitive data structure.
15. Define queue.
Queue is an homogeneous collection of elements. It is logically a first in first out (FIFO) type of
list. Queue means a line.
16. In how many ways queue is implemented?
Queues can be implemented in two ways: 1. static implementation (using array)
2. dynamic implementation (using pointers)
17. What is the rear end in a queue?
In a queue new elements are added at one end called the rear end .
18. What is a front end?
The existing elements in a queue are deleted from an end called the front end.
19. What are the different types of queues?
The different types of queues are: 1. circular queue 2. double ended queue 3. priority queue.
20. What is the full form of dequeue?
DEQUEUE : Double ended queue. It is another form of queue in which both insertion and
deletion are performed at the either end.
21. What is th use of Circular Queue?
A Circular Queue overcomes the problem of unutilized space in
linear Queue implemented as Array.
22. Define linked list.
Linked list are special list of some data elements linked to one another .The logical ordering is
represented by having each element pointing to the next element. Each element is called a node.
23. What does a node ?
Node has two parts: INFO – it stores the information and POINTER – which points to the next
element.
24. What are the different types of linked list?
Linked list are of four types: 1. singly linked list 2. doubly linked list 3. circular linked list 4.
circular doubly linked list.
25. What are the different operations performed on a linked list?
Basic operations are: creation, insertion, deletion , traversing, searching and display.
2
26. A doubly linked list contains how many fields?
Doubly linked list consists of three fields:
Data : contains the information
Next: contains the address of the next node
Prev: contains the address of the previous node
27. What is a tree?
A tree is a non linear data structure in which items are arranged in a sequence. It is a finite set of
one or more data items.
28. What is a root in a tree?
A root is the first node in the hierarchical arrangement of data items.
29. Who are called siblings in a tree?
The children nodes of a given parent node are called siblings.
30. What is a graph?
A graph G consists of a set V of vertices (nodes) and a set E of edges. G= (V,E) is a finite and
non empty set of vertices.
