stud
bud
Sign up
Log in
Home
Library
Explore
SAT
More
1st quiz Flashcards | StudBud
Explore
/
1st quiz
1st quiz
20 terms
·
StudBud Administration
·
8 plays
Quiz for Event
Flashcards
20 cards
F
Practice quiz
P
Host live
L
Questions
20
Answers
1
A mathematical-model with a collection of operations defined on that model is called
Primitive Data Type
Algorithm
Data Structure
Abstract Data Type
2
Tower of hanoi is a classic example of
Both A & B
recursive approach
divide and conquer
B but not A
3
An empty list is the one which has no
Nodes
Both a and b
Address
Data
4
4 algorithms A,B,C,D solves a problem with
log
(n), log
log
(n), n
log
(n), n.The best algorithm is
D
A
B
C
5
Find the time Complexity
O(N)
O(N^3 )
O(N log N)
O(N^2 )
6
The goal of hashing is to produce a search that takes
O(n2 ) time
O(1) time
O(n log n ) time
O(log n ) time
7
Which of the following algorithm design technique is used in the quick sort algorithm?
Greedy method
Backtracking
Dynamic programming
Divide and conquer
8
What is the output of following :
None of These
Compile Time error
Hello World!
Hello World! Hello World!
9
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
10
While deleting nodes from a binary heap, ---____node is replaced by the last leaf in the tree.
root
left leaf
right leaf
cycle
11
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
12
Which of the following data structure can't store the non-homogeneous data elements?
Arrays
Pointers
Stacks
Records
13
Which algorithm solves all pair shortest path problem
Bellman-Ford algorithm
Prim's algorithm
Floyd-Warshall's algorithm
Dijkastra's algorithm
14
A queue has configuration a,b,c,d. To get configuration d,c,b,a. One needs a minimum of
2 deletion and 3 additions
2 deletion and 2 additions
3 deletion and 2 additions
3 deletion and 3 additions
15
Which of the following is useful in traversing a given graph by breadth first search?
Queue
List
Stack
Set
16
What value does function mystery return when called with a value of 4?
0
24
4
1
17
Arranging a pack of cards by picking one by one is an example of
Heap Sort
Bubble Sort
Quick Sort
Insertion sort
18
Which sorting algorithn is faster :
O(nlogn)
O(n+k)
O(n^3)
O(n^2)
19
A variable P is called pointer if
P points to the address of first element
P contains the address of an element
P can store only memory addresses
P contain the element and the address of element
20
- What is the worst case run-time complexity of binary search algorithm
B - Ο(nlog n)
n2
C - Ο(n3)
D - Ο(n)
