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