Data Structures and Algorithms
(MidQuiz-1,Quiz-2&Midterm Exam)
Question 1
Question text
The complexity of linear search algorithm.
Question 2
Question text
State True or False for internal sorting algorithms.
i. Internal sorting are applied when the entire collection if data to be sorted is small enough that the sorting can take place within main memory.
ii. The time required to read or write is considered significant in evaluating the performance of internal sorting.
Question 3
Question text
_____________ order is the best possible for array sorting algorithm which sorts n item.
Question 4
Question text
The worst case occurs in linear search algorithm when ________________.
Question 5
Question text
The complexity of merge sort algorithm.
Question 6
Question text
Which of the following is not the required condition for binary search algorithm?
Question 7
Question text
The complexity of sorting algorithm measures the __________ as a function of the number n of items to be shorter.
Question 8
Question text
___________ sorting algorithm is frequently used when n is small, where n is the total number of elements.
Question 9
Question text
The average case occurs in linear search algorithm _______________.
Question 10
Question text
The method used by card sorter.
Question 1
Question text
This is a terminal node in a binary tree.
Question 2
Question text
A connected graph T without any cycles is called a ____________.
Question 3
Question text
State True or False for internal sorting algorithms.
i. Internal sorting are applied when the entire collection if data to be sorted is small enough that the sorting can take place within main memory.
ii. The time required to read or write is considered significant in evaluating the performance of internal sorting.
Question 4
Question text
This is a binary tree whose every node has either zero or two children.
Question 5
Question text
The complexity of merge sort algorithm.
Question 6
Question text
The average case occurs in linear search algorithm _______________.
Question 7
Question text
In a graph, if e=[u,v], then u and v are called _______________
Question 8
Question text
Which indicates pre-order traversal?
Question 9
Question text
___________ sorting algorithm is frequently used when n is small, where n is the total number of elements.
Question 10
Question text
The worst case occurs in linear search algorithm when ________________.
Question 2
Question text
The complexity of linear search algorithm.
Question 5
Question text
Graph G is _____________ if for any pair u, v of nodes in G, there is a path from u to v or path from v to u.
Question 7
Question text
Another name for directed graph.
Question 8
Question text
_____________ order is the best possible for array sorting algorithm which sorts n item.
Question 1
Question text
In a graph, if E=(u,v), it means _____________.
Question 2
Question text
The complexity of sorting algorithm measures the __________ as a function of the number n of items to be shorter.
Question 3
Question text
A connected graph T without any cycles is called ________________.
Question 4
Question text
The complexity of linear search algorithm.
Question 5
Question text
Another name for directed graph.
Question 6
Question text
Graph G is _____________ if for any pair u, v of nodes in G, there is a path from u to v or path from v to u.
Question 7
Question text
Which of the following is not the required condition for binary search algorithm?
Question 8
Question text
The method used by card sorter.
Question 9
Question text
The depth of complete binary tree is given by ________________.
Question 10
Question text
_____________ order is the best possible for array sorting algorithm which sorts n item.
Question 1
Question text
Graph G is _____________ if for any pair u, v of nodes in G, there is a path from u to v or path from v to u.
Question 2
Question text
A pointer variable which contains the location at the top element of the stack.
Question 3
Question text
The term push and pop is related to _____________.
Question 4
Question text
New nodes are added to the ________ of the queue.
Question 5
Question text
In linked lists, there are no NULL links in ______________
Question 6
Question text
This is the insertion operation in the stack.
Question 7
Question text
The retrieval of items in a stack is ___________ operation.
Question 8
Question text
The complexity of linear search algorithm.
Question 9
Question text
This form of access is used to add/remove nodes from a stack.
Question 10
Question text
Linked lists are best suited _____________________.
Question 11
Question text
Which is the pointer associated with the stack?
Question 12
Question text
A connected graph T without any cycles is called a ____________.
Question 13
Question text
This is a linear list in which insertions and deletions are made to form either end of the structure.
Question 14
Question text
This is a binary tree whose every node has either zero or two children.
Question 15
Question text
Which of the following names does not relate to stacks?
Question 16
Question text
Which of the following is two way lists?
Question 17
Question text
The worst case occurs in linear search algorithm when ________________.
Question 18
Question text
___________ sorting algorithm is frequently used when n is small, where n is the total number of elements.
Question 19
Question text
State True or False for internal sorting algorithms.
i. Internal sorting are applied when the entire collection if data to be sorted is small enough that the sorting can take place within main memory.
ii. The time required to read or write is considered significant in evaluating the performance of internal sorting.
Question 20
Question text
This refers to a linear collection of data items.
Question 21
Question text
In linked representation of stack, the null pointer of the last node in the list signals _____________________.
Question 22
Question text
In a linked list, the ____________ contains the address of next element in the list.
Question 23
Question text
Each node in singly linked list has _______ fields.
Question 24
Question text
The situation when in a linked list START=NULL is ____________________.
Question 25
Question text
The dummy header in linked list contains ____________________.
Question 26
Question text
Which is the pointer associated with the availability list?
Question 27
Question text
The elements are removal from a stack in _________ order.
Question 28
Question text
Which of the following is an application of stack?
Question 29
Question text
In a graph, if E=(u,v), it means _____________.
Question 30
Question text
The complexity of merge sort algorithm.
Question 31
Question text
The method used by card sorter.
Question 32
Question text
The average case occurs in linear search algorithm _______________.
Question 33
Question text
The depth of complete binary tree is given by ________________.
Question 34
Question text
This is the term used to delete an element from the stack.
Question 35
Question text
Which indicates pre-order traversal?
Question 36
Question text
A linear list in which the pointer points only to the successive node.
Question 37
Question text
This may take place only when there is some minimum amount or no space left in free storage list.
Question 38
Question text
Another name for directed graph.
Question 39
Question text
A linear list in which the last node points to the first node.
Question 40
Question text
A connected graph T without any cycles is called ________________.
Question 41
Question text
This indicates the end of the list.
Question 42
Question text
The operation of processing each element in the list is known as ________________.
Question 43
Question text
_____________ order is the best possible for array sorting algorithm which sorts n item.
Question 44
Question text
In a graph, if e=[u,v], then u and v are called _______________
Question 45
Question text
The term used to insert an element into stack.
Question 46
Question text
Each node in a linked list must contain at least ___________________.
Question 47
Question text
This is a terminal node in a binary tree.
Question 48
Question text
What happens when you push a new node onto a stack?
Question 49
Question text
This form of access is used to add and remove nodes from a queue.
Question 50
Question text
In linked representation of stack, ___________ fields hold the elements of the stack.