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