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