stud
bud
Sign up
Log in
Home
Library
Explore
SAT
More
Duplicate of Data Structures Flashcards | StudBud
Explore
/
Duplicate of Data Structures
Duplicate of Data Structures
30 terms
·
StudBud Administration
Quiz for Event
Flashcards
30 cards
F
Practice quiz
P
Host live
L
Questions
30
Answers
1
Best Data structure for storing an address book
Tries
Queues
Linked List
B+ Tree
2
Preorder traversal sequence of a BST is 30,20,10,15,25,23,39,35,42 .Postorder is ?
15, 10, 23, 25, 20, 35, 42, 39, 30
15, 20, 10, 23, 25, 42, 35, 39, 30
15, 10, 25, 23, 20, 42, 35, 39, 30
10, 20, 15, 23, 25, 35, 42, 39, 30
3
Find the time Complexity
O(N)
O(N^3 )
O(N log N)
O(N^2 )
4
Arranging a pack of cards by picking one by one is an example of
Bubble Sort
Heap Sort
Insertion sort
Quick Sort
5
Postfix of this infix expression : (((3+6)*(2-4))+7)
36247+-*+
36+24-*7+
362+-47*+
36+247-*
6
What value does function mystery return when called with a value of 4?
1
4
0
24
7
From the following which is not return optimal solution
Dynamic programming
Branch and bound
Backtracking
Branch and bound
8
Which of the following data structure can't store the non-homogeneous data elements?
Arrays
Records
Pointers
Stacks
9
Which sorting algorithn is faster :
O(n+k)
O(n^3)
O(nlogn)
O(n^2)
10
Which of the following algorithm design technique is used in the quick sort algorithm?
Divide and conquer
Backtracking
Greedy method
Dynamic programming
11
Tower of hanoi is a classic example of
B but not A
Both A & B
recursive approach
divide and conquer
12
A mathematical-model with a collection of operations defined on that model is called
Data Structure
Abstract Data Type
Algorithm
Primitive Data Type
13
While deleting nodes from a binary heap, ---____node is replaced by the last leaf in the tree.
right leaf
root
left leaf
cycle
14
What is the result of the following operationTop (Push (S, X))
X
null
None Of These
S
15
A queue has configuration a,b,c,d. To get configuration d,c,b,a. One needs a minimum of
3 deletion and 3 additions
3 deletion and 2 additions
2 deletion and 3 additions
2 deletion and 2 additions
16
Best Data Structure for compression of the .jpeg and .mp3 file-formats
Syntax Tree
B Tree
Huffman Coding Tree
Binary Tree
17
The Thetha notation is
Reflexive
Symmetric
(a), (b) and (c) above.
Transitive
18
Which of the following abstract data types can be used to represent a many to many relation?
Graph
Queue
Plex
Tree
19
In a stack the command to access nth element from the top of the stack S will be
None of the above
S [Top-n]
S [Top+n]
S [Top-n-1]
20
Which of the following is useful in traversing a given graph by breadth first search?
Set
Queue
List
Stack
21
4 algorithms A,B,C,D solves a problem with
log
(n), log
log
(n), n
log
(n), n.The best algorithm is
C
D
B
A
22
A variable P is called pointer if
P can store only memory addresses
P points to the address of first element
P contain the element and the address of element
P contains the address of an element
23
An empty list is the one which has no
Both a and b
Nodes
Data
Address
24
The order of an algorithm that finds if a given boolean function of 'n' variable returns '1' is
Linear
Exponential
Logarithmic
Constant
25
Which algorithm solves all pair shortest path problem
Prim's algorithm
Floyd-Warshall's algorithm
Bellman-Ford algorithm
Dijkastra's algorithm
26
The time factor when determining the efficiency of algorithm is measured by
Counting the number of statements
Counting the number of key operations
Counting microseconds
Counting the kilobytes of algorithm
27
What is the output of following :
None of These
Compile Time error
Hello World!
Hello World! Hello World!
28
Which of the below factors does not affect the efficiency of lookup operations in a hash table?
Number of buckets in the hash table
Number of buckets in the hash table
Size of elements stored in the hash table
Number of elements stored in the hash table
29
What is the minimum number of nodes that a binary tree can have?
Two
Zero
One
None
30
The goal of hashing is to produce a search that takes
O(log n ) time
O(n2 ) time
O(n log n ) time
O(1) time
