Data Structures

College Name: MLR INSTITUTE OF TECHNOLOGY
Department: COMPUTER SCIENCE AND ENGINEERING

Subject: DATA STRUCTURES Name of the Faculty: Mr. ARAVIND KUMAR N
Unit No: 1
Minimum Questions 50
Passage Question Count Question Id DifficultyLevel QuestionType Randomize Options
1 1 4 SingleCorrectAnswer 1
79 79 4 SingleCorrectAnswer
he Faculty: Mr. ARAVIND KUMAR N
Year/Sem: I-Year/ II Sem
Question
Linked lists are best suited
The operation of processing each element in the list is known as
The situation when in a linked list START=NULL is
Each node in singly linked list has........ Fields.
Which of the following is two way lists?
Which is the pointer associated with the availability list?
Value of first linked list index is
In linked lists there are no NULL links in
Each node in a linked list must contain at least
The dummy header in linked list contain
In a linked list the .......... field contains the address of next element in the list.
LLINK is the pointer pointing to the
........... refers to a linear collection of data items.
A run list is
A ...... indicates the end of the list.
A ... is a linear list in which insertions and deletions are made to from either end of the structure.
Indexing the ........ element in the list is not possible in linked lists.
A linear list in which the pointer points only to the successive node is
.......... may take place only when there is some minimum amount(or) no space left in free storage list.
A linear list in which the last node points to the first node is
To insert a new node in linked list free node will be available in
A singly linked list is also called as
A ..... list is a header list where the node points back to the header node.
A doubly linked list has .......... pointers with each node.
Header linked lists are frequently used for maintaining__ in memory.
The pointer that points to the first node in the list is
Two-way list may be maintained in memory by means of
A doubly linked list is also called as
The list that requires two pointer variables FIRST and LAST is called
If the availability list is null, then the condition is said to be
The list which has its own pointer is called
Which of the following is two way lists?
A ..... is a header list where the last node contains the null pointer.
RLINK is the pointer pointing to the
A ............. is a header list where the last node points back to the header node.
In a linked list, insertion can be done as
In a two-way lists each node is divided into .......parts.
The disadvantage in using a circular linked list is
Which of the following conditions checks available free space in avail list?
A linear list in which each node has point to the predecessor and successors nodes is called
The recurrence relation that arises in relation with the complexity of binary search is
The running time T(n), where `n' is the input size of a recursive algorithm is given as followsT(n)=c+T(n-1),if n>1 d, if n
The concept of order(Big O) is important because
The concept of order(Big O) is important because
The time complexity of an algorithm T(n), where n is the input size is given byT(n)=T(n-1)+/n, if n>1 =1 otherwise The orde
The running time of an algorithm is given byT(n)=T(n- 1)+T(n-2)-T(n-3), if n>3 = n otherwise .The order of this algorithm is
If n=4,then the value of O(log n) is
If n=4,then the value of O( n2) is
The average time complexity of insertion sort is
The running time of an algorithm is given byT(n)=T(n-1)+T(n-2)-T(n-3), if n>3 = n otherwise .What should be the relation b
The memory address of the first element of an array is called
Which of the following data structures are indexed structures?
Which of the following data structure can't store the non-homogeneous data elements?
Which if the following is/are the levels of implementation of data structure
Which of the following name does not relate to stacks?
The term "push" and "pop" is related to the
Two main measures for the efficiency of an algorithm are
Which of the following case does not exist incomplexity theory
Which of the following data structure is not linear data structure?
is very useful in situation when data have to stored and then retrieved in reverse order.
. Is a pile in which items are added at one end and removed from the other.
In a linked list with n nodes, the time taken to insert an element after an element pointed by some pointer is
A mathematical-model with a collection of operations defined on that model is called
Representation of data structure in memory is known as:
Which of the following data structure can't store the non-homogeneous data elements?
A doubly linked list has .......... pointers with each node.
A linear list in which each node has point to the predecessor and successors nodes is called ........
What will be the value of top, if there is a size of stack STACK_SIZE is 5
In which data structure direct or random access not possible?
In a doubly linked list traversing comes to a halt at:
Deletion of a node in linked list involves keeping track of address of node which comes immediately
In linked list representation, a node contains at least -
Underflow condition in linked list may occur when attempting to
To find out maximum element in a list of n numbers, one needs at least
In a circular linked list
Which of the following operations is performed more efficiently by doubly linked list than by singly linked list?
In worst case, the number of comparison need to search a singly linked list of length n for a given element is
Linked lists are not suitable to for the implementation of?
In circular linked list, insertion of node requires modification of?
In linked list each node contain minimum of two fields. One field is data field to store the data second field is?
What would be the asymptotic time complexity to add a node at the end of singly linked list, if the pointer is initially pointin
What would be the asymptotic time complexity to add an element in the linked list?
What would be the asymptotic time complexity to insert an element at the second position in the linked list?
A variant of linked list in which last node of the list points to the first node of the list is?
What kind of linked list is best to answer question like What is the item at position n?
A variant of the linked list in which none of the node contains NULL pointer is?
What happens when you push a new node onto a stack?
Which of the following is non-liner data structure?
Which of the following data structure is linear type?
Which of the following is not the part of ADT description?
Answer OptionA
B for relatively permanent collections of data
D sorting
A Underflow.
A 2
D Grounded header list
B FIRST
A 0
C single linked list
B Three fields
A first record of the actual data.
A Link field.
A predecessor node.
A List.
A small batches of records from a file.
B Guard
C circular queue
A middle.
C doubly linked list
D Memory management
B singly linked list
B Available list
B linked list
A Circular header
C 0
A Polynomials
A FIRST
B Queues
C linked list
D Circular list
B nil block
C pointer list
D Grounded header list
A grounded header list
A successor node
B rounded header list
D beginning
C 1
A it is possible to get into infinite loop
A Avail=Null
C singly linked list
A T(n)=T(n/2)+k, where k is constant
B n2
A it can be used to decide the best algorithm that solves a given problem
B it can not be used to decide the best algorithm that solves a given problem
A log n
A n
B 1
B 4
A O(n2)
A T(1)=T(2)=T(3)
D floor address
A linear arrays
A Arrays
D Abstract level
A FIFO lists
C array
C Processor and memory
D Best case
D Arrays
A Stack
B Stack
A 0 (1)
B Data Structure
B recursive
A Arrays
C 0
C singly linked list
C 5
D Array
A null
A after the node that is to be deleted
C node address field, data field
C insert a new node when there is no free space for it
B n comparisons
B Components are all linked together in some sequential manner.
A Deleting a node whose location in given
D log n
D Insertion sort
B One pointer
C Pointer to character
C O(1)
B O(1)
A O(1)
C Singly linked list
D Singly linked list
C Singly linked list
A The new node is placed at the front of the linked list
D Stacks
D Graph
D Data
OptionB
for the size of the structure and the data in the structure are constantly changing.
merging
Overflow
4
Circular header list
AVAIL.
1
linear doubly linked list
Two fields.
last record of the actual data
Next element field
successor node
Tree
number of elements having same value
Sentinel.
random of queue
first
circular linked list
Recycle bin
circular linked list.
Avail list
one way chain
Grounded header
1
Binomial
AVAIL
Linear arrays
one way chain
Header list
availability list underflow
self pointer
Circular header list
bottom header list
predecessor node
circular header list
end
2
last node points to fist node.
Null=Avail
T(n)=2T(n/2)+k, where k is constant
n
It determines the minimum size of a problem that can be solved in a given system, in a given amount of time
It determines the maximum size of a problem that can be solved in a given system, in a given amount of time.
n
log n
2
16
O(n)
T(1)+T(3)=2T(2)
foundation address
linked lists
Records
Application level
LIFO list
lists
Complexity and capacity
Worst case
Linked lists
Queue
Queue
0 (log n)
Abstract Data Type
abstract data type
Records
1
6
String
front
before the node that is to be deleted
node number, data field
delete a non-existent node in the list
n-1 comparisons
There is no beginning and no end.
Searching of an unsorted list for a given item
n/2
Radix sort
Two pointer
Pointer to integer
O(n)
O(n)
O(n)
Doubly linked list
Doubly linked list
Doubly linked list
The new node is placed at the back of the linked list
List
Trees
Operations
OptionC
data structure
inserting
Houseful
1
Linked list with header and trailer nodes
TOP
-1
circular linked list.
Four fields
pointer to the last record of the actual data
Start field
head node
Graph
number of records
End pointer
dequeue.
last
singly linked list.
Garbage collection.
doubly linked list
Free node list
two way chain
Two way header
2
Trinomial
TOP
Non linear arrays
two way chain
One way list
availability list overflow
free pool
Linked list with header and trailer nodes
down header list
head node
common header list
middle
3
time consuming
Avail=Max stack
doubly linked list
T(n)=T(n/2)+log(n)
n3
It is the lower bound of the growth rate of the algorithm
It is the lower bound of the growth rate of the algorithm
n2
nn
4
64
O(1)
T(1)-T(3)=T(2)
first address
both of above
Pointers
Implementation level
Piles
stacks
Time and space
Average case
Both of above
List
List
0 (n)
Primitive Data Type
storage structure
Pointers
2
doubly linked list
4
Set
rear
afetr the middle node
next address field, information field
delete a node in empty list
n(n-1) comparisons
Components are arranged hierarchically.
Inverting a node after the node with given location
log2n-1
Polynomial manipulation
Three pointer
Pointer to node
(n)
O(n2)
O(n2)
Circular linked list
The new node is placed at the middle of the linked list
Strings
Binary tree
Both of the above
OptionD
for none of above situation
traversal.
Saturated
3
List traversed in two directions.
REAR
2
linked list
Five fields
middle record of the actual data
Info field
last node
Node
number of files in external storage
Last pointer
priority
any where
None of the above
None of the above
None of the above
Memory space list
right link
One way header
3
Quadratic equation
REAR
Stacks
right link
Two way list
memory loss
own pointer
None of the above
dropped header list
last node
forward header list
all of the above
4
requires more memory space.
Avail=Top
linear linked list
T(n)=T(n/2)+n
nn
It is the average bound of the growth rate of the algorithm
It is the average bound of the growth rate of the algorithm
nn
n2
8
512
O(log n)
T(1)+T(2)=T(3)
base address
none of above
None
All of the above
Push-down lists
all of above
Data and space
Null case
None of above
Link list
None of the above
0 (n 1og n)
Algorithm
file structure
Stacks
3
linear linked list
None
Linked list
rear-1
None of the above
none of the above
insert a new node in the empty list
2n-1 comparisons
Forward and backward traversal within the list is permitted.
Traversing a list to process each node
n
Binary search
None
Node
(1)
None
None
Multiply linked list
Array implementation of linked list
None
No Changes happens
Trees
Stack
None of the above
Subject: DATA STRUCTURES
Unit No: 2
Passage Question Count Question Id DifficultyLevel QuestionType
Name of the Faculty: Mr. ARAVIND KUMAR N
Randomize Options
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
Question
In liked representation of stack ....... holds the elements of the stack.
In the linked representation of the stack ......... behaves as the top pointer variable of stac
In linked representation of stack the null pointer of the last node in the list signals ..........
What happens when you push a new node onto a stack?
The retrieval of items in a stack is ........... operation
Which is the pointer associated with the stack?
The elements are removal from a stack in .......... order.
The insertion operation in the stack is called .........
A pointer variable which contains the location at the top element of the stack is called .....
Which of the following is an application of stack?
...... is the term used to insert an element into stack.
The postfix form of the expression (A+ B)*(C*D- E)*F / G is?
The data structure required to check whether an expression contains balanced parenthesis
The postfix form of A*B+C/D is?
What is the result of the following operation Top (Push (S,X)).
The result of evaluating the postfix expression 5, 4, 6, +, *, 4, 9, 3, /, +, * is?
Which of the following statement(s) about stack data structure is/are NOT correct?
The type of expression in which operator succeeds its operands is?
If the elements A, B, C and D are placed in a stack and are deleted one at a time, in
Which Data Structure is used to perform Recursion?
Whats happen if base condition is not defined in recursion ?
The data structure required to evaluate a postfix expression is
Using Pop (S1,Item),Push(S1, Item), Getlist(Item), Pop(S2,Item), and the variables S1,S2(s
In eveluating the arithmetic expression 2*3-(4+5),using stacks to evaluate its equivalent p
Stack can't be used to
Stack is useful for implementing
The postfix equivalent of the prefix * + a b - c d is
Which one of the following is an application of Stack Data Structure?
Which of the following is true about linked list implementation of stack?
To evaluate an expression without any embedded function calls
The result evaluating the postfix expression 10 5 + 60 6 / * 8 is
Stack consists of...?
The following sequence of operation is performed on stack : push(1),push(2),pop,push(1),p
Postfix form of following expression. D + (E * F)
Stack data structure cannot be used for
Insertion and Deletion operation in Queue is known as ?
In a priority queue, insertion and deletion takes place at ..................
What is the postfix form of the following prefix *+abcd
Which data structure is needed to convert infix notation to postfix notation?
Which of the following operations is performed more efficiently by doubly linked list than b
The prefix form of A-B/ (C * D ^ E) is,
The largest element of an array index is called its
The equivalent prefix expression for the following infix expression (A+B)-(C+D*E)/F*G is
Stack can be implemented using _________ and ________ ?
Insertion and Deletion operation in Queue is known as ?
Stack data structure cannot be used for
Which of the following is not the type of queue?
A data structure where elements can be added or removed at either end but not in the mid
Which is/are the application(s) of stack
Answer
A
C
B
A
B
C
A
B
A
D
A
A
A
B
A
B
C
C
B
B
B
B
A
D
D
C
A
D
D
A
C
A
A
B
B
B
D
A
D
A
C
C
A
C
B
B
B
D
D
OptionA
INFO fields
Stop pointer
Beginning of the stack
The new node is placed at the front of the linked list
push
FIRST
Reverse
insert
Top
finding factorial
Push
AB+ CD*E - FG /**
Stack
*AB/CD+
X
600
Stack data structure can be implemented using linked list
Infix Expression
ABCD
Queue
Stack underflow
Queue
All possible stacks with A,B,C,D,E and F
4 6
Evaluate an arithmetic expression in postfix form
Radix
ab+cd-*
Managing function calls
In push operation, if new nodes are inserted at the beginning of linked list, then in pop ope
One stack is enough
284
Register
2,2,1,1,2
EF * D+
Implementation of Recursive Function
Push and Pop
front, rear end
ab+cd*
Branch
Deleting a node whose location in given
-/*^ACBDE
lower bound.
-+AB*/+C*DEFG
Array and Binary Tree
Push and Pop
Implementation of Recursive Function
Ordinary queue
linked lists
Function calls
OptionB
TOP fields
Begin pointer
Bottom of the stack
The new node is placed at the back of the linked list
pop
FRONT
Hierarchical
push
Last
tower of Hanoi
Pull
AB + CD* E - F **G /
Queue
AB*CD/+
Null
350
New node can only be added at the top of the stack
pre fix Expression
DCBA
Stack
Stack Overflow
Stack
No possible stacks with A,B,C,D,E and F
5 4 6
Implement recursion
Breadth first search
ab cd + - *
The stock span problem
In push operation, if new nodes are inserted at the end, then in pop operation, nodes mus
Two stacks are needed
213
RAM
2,2,1,2,2
DEF * +
Allocation Resources and Scheduling
Enqueue and Dequeue
only at rear end
abc+*
Queue
Searching of an unsorted list for a given item
-ABCD*^DE
range.
/-+AB*+C*DEFG
Linked List and Graph
Enqueue and Dequeue
Allocation Resources and Scheduling
Single ended queue
stacks
Large number Arithmetic
OptionC
LINK fields
Start pointer
Middle of the stack
The new node is placed at the middle of the linked list
access
TOP
Alternative
pop
Final
infix to postfix
Pop
AB + CD* E - *F *G /
Array
A*BC+/D
S
650
Stack is the FIFO data structure
postfix Expression
DCAB
Linked List
None of these
Array
Exact and only those stacks which can be produced with S1 alone
9 6
Convert a given arithmetic expression in infix form to its evaluate postfix for
Recursion
ab + cd * -
Arithmetic expression evaluation
Both of the above
As many stacks as the height of the expression tree are needed
142
ROM
2,1,2,2,1
DEF +*
Reversing string
Insert and Delete
only at front end
ab+*cd
Tree
Inverting a node after the node with given location
-A/B*C^DE
upper bound.
-/+AB*+CDE*FG
Array and Linked Lis
Insert and Delete
Reversing string
Circular queue
queues
Evaluation of arithmetic expressions
OptionD
NULL fields
Avail pointer
In between some value
No Changes happens
access
REAR
Sequential
top
End
all of the above
Pump
AB + CDE * - * F *G /
Tree
ABCD+/*
None
588
The last node at the bottom of the stack has a NULL link
None
ABDC
Tree
Both a and b
linked list
Twice as many stacks as can be produced with S1 alone
9 3 2
Allocate resources(like CPU)by the operating system
none of those
ab + - cd *
All of the above
None of the above
A Turing machine is needed in the general case
71
CPU
2,1,2,2,2
EFD *+
Evaluation of string in postfix form
None
any position
ab+*cd
Stack
Traversing a list to process each node
-A/BC*^DE
All of these.
-+AB*/+CDE*FG
Queue and Linked List
None
Evaluation of string in postfix form
Priority queue
dequeue
All of the above
Subject: DATA STRUCTURES Name of the Faculty: Mr. ARAVIND KUMAR N
Unit No: 3
Passage Question Count Question Id DifficultyLevel QuestionType Randomize Options
culty: Mr. ARAVIND KUMAR N
Question
When new data are to be inserted into a data structure, but there is no available space; this situation is usually called
When there are no elements in Circular queue if you try to delete the element from this queue ; this situation is usually called
Which of the following is two way list?
Let the following circular queue can accommodate maximum six elements with the following data front=2 rear=4 queue= ________: L,
If the elements A, B, C and D are placed in a circular queue and are deleted one at a time, in what order will they be removed?
In the array implementation of circular queue, which of the following operation take worst case linear time?
If the MAX_SIZE is the size of the array used in the implementation of circular queue. How is rear manipulated while inserting an element
If the MAX_SIZE is the size of the array used in the implementation of circular queue, array index start with 0, front point to the first elem
A circular queue is implemented using an array of size 10. The array index starts with 0, front is 6, and rear is 9. The insertion of next ele
If the MAX_SIZE is the size of the array used in the implementation of circular queue, array index start with 0, front point to the first elem
A data structure in which elements can be inserted or deleted at/from both the ends but not in the middle is?
Suppose a circular queue of capacity (n-1) elements is implemented with an array of n elements. Assume that the insertion and deletion
Consider the following operations along with ENQUEUE and DEQUEUE operations queues, where k is a global parameter. Multiqueue(Q)
The use of pointers to refer elements of a data structure in which elements are logically adjacent is ....
Which of the following statement is false?
A linear list of elements in which deletion can be done from one end (front) and insertion can take place only at the other end (rear) is kn
The another name of dequeue is .........
The operations that can be done in a circular queue is/are .....
Which of the following is not the type of queue?
An array of size MAX_SIZE is used to implement a circular queue. Front, Rear, and count are tracked. Suppose front is 0 and rear is MAX_S
Answer OptionA
B underflow
A underflow
D grounded header list
A
front = 2 rear = 5 queue=_____; L,M,N,O,______
A ABCD
D Insertion
C rear=(rear%1)+MAX_SIZE
B Front=rear= -1
A 0
B Front=rear=0
C Queue
A Full: (REAR+1)mod n == FRONT Empty: REAR==FRONT
A (n)
B pointers
C Arrays are dense lists and static data structure.
A Queue
C divided queue
D Insert from the front end
B Ordinary queue
D Zero
OptionB
overflow
overflow
circular header list
front = 3 rear = 5 queue = L, M, N, O, ___
DCBA
Deletion
rear=rear%(MAX_SIZE+1)
Front=(rear+1)%MAX_SIZE
7
Front= rear=-1
One
Full: (REAR+1)mod n == FRONT Empty: (FRONT+1) mod n == REAR
(n + k)
linked allocation
Data elements in linked list need not be stored in adjacent space in memory
Stack
distributed queue
Delete from front end
Special queue
One
OptionC
housefull
housefull
linked list with header and trailer nodes
front = 3 rear = 4 queue = ______; L, M, N, O, ___
DCAB
To empty a queue
rear=(rear+1)%MAX_SIZE
Rear=front+1
9
Front=rear+1
MAX_SIZE-1
Full: REAR==FRONT Empty: (REAR+1) mod n==FRONT
(nk)
stack
Pointers store the next data element of a list.
Tree
double ended queue
Display queue contents
Priority queue
MAX_SIZE-1
OptionD
saturated
saturated
none of above
front = 2 rear = 4 queue = L, M, N, O, ___
ADBC
None
rear=rear+(1%MAX_SIZE)
Rear=(front+1)%MAX_SIZE
10
Front=(rear+1)%MAX_SIZE
MAX_SIZE
Full: (FRONT+1)mod n==REAR Empty: REAR==FRONT
(n2)
queue
Linked lists are collection of the nodes that contain information part and next pointer.
Linked list
design queue
All of the above
Circular queue
MAX_SIZE
Unit No: 4
Randomize Options
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
Question
Which of the following sorting methods would be most suitable for sorting a list which is al
Which of the following sorting algorithm is stable
Which of the following is not the required condition for binary search algorithm?
The complexity of the average case of an algorithm is
Which of the following is not a limitation of binary search algorithm?
The best average behavior is shown by
You have to sort a list L consisting of a sorted list followed by a few random elements. W
The quick sort algorithm exploit _________ design technique
The total number of companions required to merge 4 sorted files containing 15, 3, 9 and 8
You have an array of n elements. Suppose you implement quick sort by always choosing th
A sorting technique is called stable if:
The maximum number of comparisons needed to sort 7 items using radix sort is (assume e
You are asked 15 randomly generated numbers. You should prefer
Which of the following sorting algorithms does not have a worst case running time comple
Which of the following is not a correct statement
Which of the following algorithms exhibits the unusual behavior that, minimum numbers o
You want to check whether a given set of items is sorted. Which of the following sorting me
The way a card game player arranges his cards as he picks them up one by one , is an exa
Which of the following sorting algorithm has the worst time complexity of nlog(n)?
Which of the following sorting methods sorts a given set of items that is already in sorted o
Which of the following sorting methods will be the best if number of swapping done, is the
As part of the maintenance work, you are entrusted with the work of rearranging the librar
Sorting is not useful for
A machine took 200 sec to sort 200 names, using bubble sort. In 800 sec. it can approxima
A machine needs a minimum of 100 sec. to sort 1000 names by quick sort. The minimum t
A sorting method with _ _ _ _ _ _ _ _ is the most efficient method
The average successful search time for sequential search on 'n' items is
Merge sort uses
Which of the following algorithm design technique is used in the quick sort algorithm?
The average successful search time taken by binary search on a sorted order array of 10 it
The number of swapping needed to sort the numbers 8,22,7,9,31,19,5,13 in an ascending
Given two sorted list of size 'm' and 'n' respectively. The number of comparisons needed b
For merging two sorted lists of sizes m and n into a sorted list of size m+n, requires _ _ _ _
A sorting technique that guarantees , that records with the same primary key occurs in the
The average number of comparisons performed by the merge sort algorithm , in merging t
If the number of record to be sorted large and the key is short, then ...... sorting can be effi
The total number of comparisons in a bubble sort is ....
If the number of record to be sorted large and the key is long, then ...... sorting can be effic
The easiest sorting is ........
The complexity of selection sort is .......
Answer
A
D
C
A
D
A
D
C
D
A
B
A
A
B
D
C
C
C
A
B
B
B
B
A
B
A
C
A
C
D
D
C
C
A
A
C
A
C
D
B
OptionA
Bubble Sort
insertion sort.
The list must be sorted
Much more complicated to analyze than that of worst case
must use a sorted array
Quick Sort
Bubble sort
Greedy
66
O(n2)
it takes O ( n log n) time
280
. bubble sort
Insertion sort
internal sorting is used if the number of items to be sorted is very large
Heap tree
bubble sort
bubble sort
Heap sort
Heap sort
bubble sort
bubble sort
report generation
400
50.2 sec
O(log n)
n/2
divide and conquer strategy
Dynamic programming
2.6
11
mxn
O(m)
stable
3-Aug
Merge
O(n logn)
Merge
quick sort
O(n)
OptionB
Insertion Sort
bubble sort.
there should be the direct access to the middle element in any sublist
Much more simpler to analyze than that of worst case
requirement of sorted array is expensive when a lot of insertion and deletions are needed
Merge Sort
Selection sort
Dynamic programming
39
O(nLogn)
It maintains the relative order of occurrence of nondistinct elements
40
quick sort
merge sort
External sorting is used if the number of items to be sorted is very large
Radix sort
selection sort
selection sort
Quick sort
Quick sort
insertion sort
insertion sort
minimizing the storage needed
800
6.7 sec
O(n)
(n-1)/2
backtracking approach
Backtracking
2.7
12
maximum of m,n
O(n)
consistent
5-Aug
Heap
O(2n)
Heap
shell sort
O(n2)
OptionC
Selection Sort
quick sort.
There must be mechanism to delete and/or insert elements in list
Sometimes more complicated and some other times simpler than that of worst case
there must be a mechanism to access middle element directly
Insertion Sort
Quick sort
Divide and Conquer
15
(nLogn)
It uses divide and conquer paradigm
47
merge sort
quick sort
External sorting needs auxiliary storage
Binary insertion sort
insertion sort
insertion sort
Insertion sort
Insertion sort
selection sort
selection sort
making searching easier and efficient
750
72.7 sec
O(1)
(n+1)/2
heuristic approach
Divide and conquer
2.8
13
minimum of m,n
O(m+n)
external
7-Nov
Radix
O(n2)
Quick
heap sort
O(n logn)
OptionD
Quick Sort
heap sort.
none of above
None or above
binary search algorithm is not efficient when the data elements are more than 1000.
Heap Sort
Insertion sort
Backtracking
33
O(n3)
The maximum number of nodes in a binary tree of height h is (2 -1)(The height of the root
38
heap sort
Bubble sort
Internal sorting needs auxiliary storage
Selection sort
merge sort
merge sort
Selection sort
Selection sort
heap sort
heap sort
responding to queries easily
1600
11.2 sec
O(n2)
log(n)+1
heuristic approach
Greedy method
2.9
14
m+n-1
O(log(m)+log(n))
Linear
16-Jan
Bubble
O(n)
Bubble
selection sort
O(logn)
Unit No: 5
Randomize Options
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
Question
To represent hierarchical relationship between elements, which data structure is suitable?
A binary tree whose every node has either zero or two children is called
The depth of a complete binary tree is given by
A binary tree can easily be converted into q 2-tree
B Trees are generally
A binary tree in which if all its levels except possibly the last, have the maximum number of n
One can convert a binary tree into its mirror image by traversing it in
The number of leaf nodes in a complete binary tree of depth d is
A B-tree of minimum degree t can maximum _____ pointers in a node.
One of the major drawback of B-Tree is the difficulty of traversing the keys sequentially.
A full binary tree with 2n+1 nodes contain
A full binary tree with n leaves contains
When inorder traversing a tree resulted E A C K F H D B G; the preorder traversal would return
The in order traversal of tree will yield a sorted listing of elements of tree in
The process of accessing data stored in a serial access memory is similar to manipulating dat
The height of a BST is given as h. Consider the height of the tree as the no. of edges in the lo
The no of external nodes in a full binary tree with n internal nodes is?
The difference between the external path length and the internal path length of a binary tree
Suppose a binary tree is constructed with n nodes, such that each node has exactly either ze
Which of the following statement about binary tree is CORRECT?
Suppose we have numbers between 1 and 1000 in a binary search tree and want to search fo
In full binary search tree every internal node has exactly two children. If there are 100 leaf no
Which type of traversal of binary search tree outputs the value in sorted order?
Suppose a complete binary tree has height h>0. The minimum no of leaf nodes possible in te
A 2-3 is a tree such that a) All internal nodes have either 2 or 3 children b) All path from r
If a node having two children is to be deleted from binary search tree, it is replaced by its
A binary search tree is formed from the sequence 6, 9, 1, 2, 7, 14, 12, 3, 8, 18. The minimum
In a full binary tree, every internal node has exactly two children. A full binary tree with 2n+1
the run time for traversing all the nodes of a binary search tree with n nodes and printing the
When a binary tree is converted in to an extended binary tree, all the nodes of a binary tree i
If n numbers are to be sorted in ascending order in O(nlogn) time, which of the following tree
If n elements are sorted in a binary search tree. What would be the asymptotic complexity to
If n elements are sorted in a balanced binary search tree. What would be the asymptotic com
The minimum number of elements in a heap of height h is
The maximum number of elements in a heap of height h is
A threaded binary tree is a binary tree in which every node that does not have right child has
In which of the following tree, parent node has a key value greater than or equal to the key va
A binary tree T has n leaf nodes. The number of nodes of degree 2 in T is
A binary search tree is generated by inserting in order the following integers: 50, 15, 62, 5, 2
Consider the following rooted tree with the vertex P labeled as root The order in
Answer OptionA
C Deque
A Complete binary tree
D Dn = n log2n
D by replacing each empty sub tree by a new internal node
D very deep and narrow
A full binary tree
C inorder
A 2d
D t1
A True
B n leaf nodes
C n nodes.
B FAEKCDBHG
B Binary trees
D Heap
B 2h-1 -1
B n
D 1
B (n+1)/2
C Every binary tree is either complete or full
C 2, 252, 401, 398, 330, 344, 397, 363
C 25
B Pre-order
C 2h -1
A or D 4
B In-order predecessor
D 3
B n leaf node
B O(nlg(n))
A Internal nodes
D Binary tree
C O(1)
B O(1)
B 2h+1
A 2h+1 -1
B Pre-order successor
D Binary search tree
B log2n
B (4, 7)
A SQPTRWUV
OptionB
Priority
Binary search tree
Dn = n log2n+1
by inserting an internal nodes for non-empty node
very wide and shallow
AVL tree.
preorder
2d1+1
2t1
0
n non-leaf nodes
log n 2 nodes.
. FAEKCDHGB
Binary search trees
Binary Tree
2h+1 -1
n+1
n
(n-1)/2
Every complete binary tree is also a full binary tree
924, 220, 911, 244, 898, 258, 362, 363
49
In-order
2h -1 + 1
5
In-order successor
6
n internal nodes
O(n)
External nodes
Binary search tree
O(logn)
O(logn)
2h
2h
In-order successor
Threaded binary tree
n-1
(7, 4)
SQPTURWV
OptionC
Tree
Extended binary tree
Dn = log2n
by inserting an external nodes for non-empty node
very deep and very wide
threaded tree.
postorder
2d+1+1
2t
cant say
n-1 leaf nodes
2n 1 nodes.
EAFKHDCBG
Heaps
Array
2h +1
2n
n+1
n/2 -1
Every full binary tree is also a complete binary tree
925, 202, 911, 240, 912, 245, 258, 363
99
Post-order
2h -1
6
Pre-order predecessor
8
n-1 leaf nodes
O(n)
Root nodes
Max-heap
O(n)
O(n)
2h -1
2h -1
In-order predecessor
Complete binary tree
n
(8, 3)
SQPTWUVR
OptionD
All of above
None of above
Dn = log2n+1
by replacing each empty sub tree by a new external node
cannot say
complete binary tree.
any order
2d+1
t
None of the above
n-1 non-leaf nodes
n 2 nodes.
FEAKDCHBG
None of above
Stack
2h-1 +1
2n + 1
2n
(n+1)/2 -1
A binary tree cannot be both complete and full
2, 399, 387, 219, 266, 382, 381, 278, 363
101
None
2h +1
7
None
11
n-1 internal nodes
O(log(n))
None
Min-heap
O(nlogn)
O(nlogn)
2h-1
2h -1
Post-order successor
Max-heap
2n
(3, 8)
SQPTRUWV

Data Structures

Uploaded by

Document Information

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Data Structures

Uploaded by

Copyright:

Available Formats

College Name: MLR INSTITUTE OF TECHNOLOGY

Department: COMPUTER SCIENCE AND ENGINEERING

You might also like