9053615
Pregunta 1
Pregunta
Naming convention for variable is followed in company because ____.
Respuesta
-
A. it enhances readability
-
B. it allows to work without conflicts
-
C. it enhances the efficiency
-
D. all of the above
Pregunta 2
Pregunta
The true and false values represent ____.
Respuesta
-
A. logical data
-
B. numeric data
-
C. character data
-
D. alphanumeric data
Pregunta 3
Pregunta
Following operator distinguishes equation from expression
Respuesta
-
A. +, -, *, /
-
B. < or >
-
C. Logical operators
-
D. Assignment Operator
Pregunta 4
Pregunta
Following are called logical operators
Respuesta
-
A. +, -, *, /
-
B. <, >, <=, >=
-
C. AND, OR, NOT
-
D. \, MOD
Pregunta 5
Pregunta
Evaluate 5*(x+y)-4*y/(z+6) where x = 2, y = 3, and z = 6
Respuesta
-
A. 1
-
B. 24
-
C. 5
-
D. 10
Pregunta 6
Pregunta
Evaluate a-2>b where a=6, b = 8
Respuesta
-
A. False
-
B. True
-
C. 6
-
D. 7
Pregunta 7
Pregunta
Evaluate for a = 5, b = 4, c = 3, d = 12 for the equation E = a*b+d/c
Respuesta
-
A. 40
-
B. 24
-
C. 10
-
D. 10.66
Pregunta 8
Pregunta
Evaluate for the equation e = 5*a\d*(b+1) where a = 5, b = 4, c = 3, d = 12
Respuesta
-
A. 10
-
B. 24
-
C. 0
-
D. 10
Pregunta 9
Pregunta
The most important reason for including a destructor in a class is:
Respuesta
-
A. To print a message for debugging purposes
-
B. To store information about an object before it goes out of scope
-
C. To free up resources allocated by that class
-
D. To reset the original object's pointer to NULL
-
E. To make your TA happy
Pregunta 10
Pregunta
Which of the following name does not relate to stacks?
Respuesta
-
A. FIFO lists
-
B. LIFO list
-
C. Piles
-
D. Push-down lists
Pregunta 11
Pregunta
Which of the following data structure is linear type?
Respuesta
-
A. Strings
-
B. Lists
-
C. Queues
-
D. All of above
Pregunta 12
Pregunta
An algorithm that calls itself directly or indirectly is known as
Respuesta
-
A. Sub algorithm
-
B. Recursion
-
C. Polish notation
-
D. Traversal algorithm
Pregunta 13
Pregunta
The help menus or user manuals are the part of ____.
Respuesta
-
A. Program
-
B. Algorithm
-
C. Internal Documentation
-
D. External Documentation
Pregunta 14
Pregunta
The correctness and appropriateness of ___ solution can be checked very easily.
Respuesta
-
A. algorithmic solution
-
B. heuristic solution
-
C. random solution
-
D. none of these
Pregunta 15
Pregunta
Memorization is
Respuesta
-
A. To store previous results for future use
-
B. To avoid this unnecessary repetitions by writing down the results of recursive calls and looking them up again if we need them later
-
C. To make the process accurate
-
D. None of the above
Pregunta 16
Pregunta
The time complexity of linear search is _____.
Respuesta
-
A. O(1)
-
B. O(log(n))
-
C. O(n)
-
D. O(n log(n))
Pregunta 17
Pregunta
The time complexity of binary search is _____.
Respuesta
-
A. O(1)
-
B. O(log(n))
-
C. O(n)
-
D. O(n log(n))
Pregunta 18
Pregunta
What is the asymptotic runtime for traversing all nodes in a binary search tree with n nodes and printing them in order?
Respuesta
-
A. O(n log(n))
-
B. O(n)
-
D. O(log(n))
-
E. O(n^2)
Pregunta 19
Pregunta
The number of nodes in a complete binary tree of height h is
Respuesta
-
A. 2^(h+1) - 1
-
B. 2*(h+1) - 1
-
C. 2*(h+1)
-
D. (h+1)^2 - 1
Pregunta 20
Pregunta
Divide-and-conquer as breaking the problem into a small number of
Respuesta
-
A. Pivot
-
B. Sieve
-
C. Smaller sub problems
-
D. Selection
Pregunta 21
Pregunta
The sub problems in Divide and Conquer are considered to be
Respuesta
-
A. Distinct
-
B. Overlapping
-
C. Large size
-
D. Small size
Pregunta 22
Pregunta
For the sieve technique we solve the problem,
Respuesta
-
A. recursively
-
B. mathematically
-
C. precisely
-
D. accurately
Pregunta 23
Pregunta
The sieve technique works in ____ as follows
Respuesta
-
A. phases
-
B. numbers
-
C. integers
-
D. routines
Pregunta 24
Pregunta
The sieve technique is a special case, where the number of sub problems is just
Respuesta
-
A. 5
-
B. many
-
C. 1
-
D. few
Pregunta 25
Pregunta
The reason for introducing Sieve Technique algorithm is that it illustrates a very important special case of,
Respuesta
-
A. divide-and-conquer
-
B. decrease and conquer
-
C. greedy nature
-
D. 2-dimension Maxima
Pregunta 26
Pregunta
Sieve Technique applies to problems where we are interested in finding a single item from a larger set of ____
Respuesta
-
A. n items
-
B. phases
-
C. pointers
-
D. constant
Pregunta 27
Pregunta
In Sieve Technique we do not know which item is of interest
Respuesta
- True
- False
Pregunta 28
Pregunta
For the Sieve Technique we take time
Respuesta
-
A. T(nk)
-
B. T(n / 3)
-
C. n^2
-
D. n/3
Pregunta 29
Pregunta
How many passes are required to sort a file of size n by bubble sort method?
Respuesta
-
A. N2
-
B. N
-
C. N-1
-
D. N/2
Pregunta 30
Pregunta
The worst-case time complexity of Bubble Sort is ____.
Respuesta
-
A. O(n2)
-
B. O(log n)
-
C. O(n)
-
D. O(n log(n))
Pregunta 31
Pregunta
Which of the following sorting procedures is the slowest?
Respuesta
-
A. Quick sort
-
B. Heap sort
-
C. Shell sort
-
D. Bubble sort
Pregunta 32
Pregunta
For i = 1 to n-1 do --> For j = 1 to n-1-i do --> If (a[j+1] < a[j]) then swap a[j] and a[j+1]. Given code is for
Respuesta
-
A. Bubble sort
-
B. Insertion sort
-
C. Quick Sort
-
D. Selection Sort
Pregunta 33
Pregunta
How many number of comparisons are required in insertion sort to sort a file if the file is sorted in reverse order?
Respuesta
-
A. N2
-
B. N
-
C. N-1
-
D. N/2
Pregunta 34
Pregunta
How many number of comparisons are required in insertion sort to sort a file if the file is already sorted?
Respuesta
-
A. N2
-
B. N
-
C. N-1
-
D. N/2
Pregunta 35
Pregunta
Which of the following sorting methods would be most suitable for sorting a list which is almost sorted?
Respuesta
-
A. Bubble Sort
-
B. Insertion Sort
-
C. Selection Sort
-
D. Quick Sort
Pregunta 36
Pregunta
!!!
Suppose we are sorting an array of eight integers using some quadratic sorting algorithm. After four iterations of the algorithm's main loop, the array elements are ordered as shown here: 2 4 5 7 8 1 3 6
Respuesta
-
A. Insertion sort
-
B. Selection sort
-
C. Either of a and b
-
D. None of the above
Pregunta 37
Pregunta
The running time of insertion sort is
Respuesta
-
A. O(n^2)
-
B. O(n)
-
C. O(log(n))
-
D. O(n log(n))
Pregunta 38
Pregunta
A sort which compares adjacent elements in a list and switches where necessary is ____.
Respuesta
-
A. insertion sort
-
B. heap sort
-
C. quick sort
-
D. bubble sort
Pregunta 39
Pregunta
A sort which iteratively passes through a list to exchange the first element with any element less than it and then repeats with a new first element is called
Respuesta
-
A. insertion sort
-
B. selection sort
-
C. heap sort
-
D. quick sort
Pregunta 40
Pregunta
The way a card game player arranges his cards as he picks them one by one can be compared to
Respuesta
-
A. Quick sort
-
B. Merge sort
-
C. Insertion sort
-
D. Bubble sort
Pregunta 41
Pregunta
Which among the following is the best when the list is already sorted?
Respuesta
-
A. Insertion sort
-
B. Bubble sort
-
C. Merge sort
-
D. Selection sort
Pregunta 42
Pregunta
As part of the maintenance work, you are entrusted with the work of rearranging the library books in a shelf in proper order, at the end of each day. The ideal choice will be
Respuesta
-
A. Bubble sort
-
B. Insertion sort
-
C. Selection sort
-
D. Merge sort
Pregunta 43
Pregunta
When is insertion sort a good choice for sorting an array?
Respuesta
-
A. Each component of the array requires a large amount of memory.
-
B. The processor speed is fast.
-
C. Each component of the array requires a small amount of memory.
-
D. The array has only a few items out of place.
Pregunta 44
Pregunta
Suppose we are sorting an array of ten integers using a some quadratic sorting algorithm. After four iterations of the algorithm's main loop, the array elements are ordered as shown here: 1 2 3 4 5 0 6 7 8 9. Which statement is correct? (Note: Our selection sort picks largest items first)
Respuesta
-
A. The algorithm might be either selection sort or insertion sort.
-
B. The algorithm is neither selection sort nor insertion sort.
-
C. The algorithm might be selection sort, but could not be insertion sort.
-
D. The algorithm might be insertion sort, but could not be selection sort.
Pregunta 45
Pregunta
A list of n strings, each of length n, is sorted into lexicographic order using the merge-sort algorithm. The worst case running time of this computation is
Respuesta
-
A. O (n log(n))
-
B. O (n^2 log(n))
-
C. O (n^2 + log(n))
-
D. O (n^2)
Pregunta 46
Pregunta
The worst-case time complexity of Merge Sort is ____.
Respuesta
-
A. O(n^2)
-
B. O(log n)
-
C. O(n)
-
D. O(n log(n))
Pregunta 47
Pregunta
Suppose we need to sort a list of employee records in ascending order, using the social security number (a 9-digit number) as the key (i.e., sort the records by social security number). If we need to guarantee that the running time will be no worse than n*log(n), which sorting methods could we use?
Respuesta
-
A. mergesort
-
B. quicksort
-
C. insertion sort
-
D. Either mergesort or quicksort
-
E. None of these sorting algorithms guarantee a worst-case performance of n log n or better
Pregunta 48
Pregunta
How much time merge sort takes for an array of numbers?
Respuesta
-
A. T(n^2)
-
B. T(n)
-
C. T(log n)
-
D. T(n log(n))
Pregunta 49
Pregunta
Merge sort makes two recursive calls. Which statement is true after these recursive calls finish, but before the merge step?
Respuesta
-
A. The array elements form a heap.
-
B. None of the above.
-
C. Elements in each half of the array are sorted amongst themselves.
-
D. Elements in the first half of the array are less than or equal to elements in the second half of the array.
Pregunta 50
Pregunta
What is the worst-case time for merge sort to sort an array of n elements?
Respuesta
-
A. O(n)
-
B. O(n log(n))
-
C. O(log(n))
-
D. O(n)
Pregunta 51
Pregunta
In quick sort, the number of partitions into which the file of size n is divided by a selected record is
Respuesta
-
A. n
-
B. n - 1
-
C. 2
-
D. n/2
Pregunta 52
Pregunta
The worst-case time complexity of Quick Sort is ____.
Respuesta
-
A. O(n^2)
-
B. O(log(n))
-
C. O(n)
-
D. O(n log(n))
Pregunta 53
Pregunta
The algorithm like Quick sort does not require extra memory for carrying out the sorting procedure. This technique is called ____.
Respuesta
-
A. in-place
-
B. stable
-
C. unstable
-
D. in-partition
Pregunta 54
Pregunta
In quick sort, the number of partitions into which the file of size n is divided by a selected record is
Respuesta
-
A. n
-
B. n - 1
-
C. 2
-
D. None of the above
Pregunta 55
Pregunta
The total number of comparisons made in quick sort for sorting a file of size n, is
Respuesta
-
A. O(n log(n))
-
B. O(n^2)
-
C. n(log(n))
-
D. None of the above
Pregunta 56
Pregunta
Quick sort efficiency can be improved by adopting
Respuesta
-
A. non-recursive method
-
B. insertion method
-
C. tree search method
-
D. None of the above
Pregunta 57
Pregunta
For the improvement of efficiency of quick sort the pivot can be
Respuesta
-
A. the first element
-
B. the mean element
-
C. the last element
-
D. None of the above
Pregunta 58
Pregunta
Quick sort is the fastest available method of sorting because of
Respuesta
-
A. low over head
-
B. O(n log(n)) comparisons
-
C. low overhead and also O(n log(n)) comparisons
-
D. None of the above
Pregunta 59
Pregunta
Quick sort is
Respuesta
-
A. Stable & in place
-
B. Not stable but in place
-
C. Stable but not in place
-
D. Some time stable & some times in place
Pregunta 60
Pregunta
One example of in place but not stable algorithm is
Respuesta
-
A. Merger Sort
-
B. Quick Sort
-
C. Continuation Sort
-
D. Bubble Sort
Pregunta 61
Pregunta
In Quick Sort Constants hidden in T(n log n) are
Respuesta
-
A. Large
-
B. Medium
-
C. Small
-
D. Not Known
Pregunta 62
Pregunta
The running time of quick sort depends heavily on the selection of
Respuesta
-
A. No of inputs
-
B. Arrangement of elements in array
-
C. Size o elements
-
D. Pivot elements
Pregunta 63
Pregunta
!!!!!!
Here is an array which has just been partitioned by the first step of quick sort: 3, 0, 2, 1, 5, 4, 7, 9, 8. Which of these elements could be the pivot?
Respuesta
-
A. 2
-
B. 7
-
C. 0
-
D. 5
Pregunta 64
Pregunta
Quick sort is solved using
Respuesta
-
A. Divide and conquer
-
B. Greedy Programming
-
C. Dynamic Programming
-
D. Branch and bound
Pregunta 65
Pregunta
The worst-case time complexity of Selection Exchange Sort is ____.
Respuesta
-
A. O(n^2)
-
B. O(log n)
-
C. O(n)
-
D. O(n log(n))
Pregunta 66
Pregunta
Straight selection sort is basically a method of repeated
Respuesta
-
A. interchange
-
B. searching
-
C. position adjustment
-
D. None of the above
Pregunta 67
Pregunta
Number of selections required to sort a file of size N by straight selection requires
Respuesta
-
A. n-1
-
B. log(n)
-
C. O(n^2)
-
D. None of the above
Pregunta 68
Pregunta
For sorting a file of size n by straight selection sort, the number of comparisons made in the first pass is
Respuesta
-
A. n
-
B. n - 1
-
C. n(n - 1)/2
-
D. None of the above
Pregunta 69
Pregunta
""
In the analysis of Selection algorithm, we eliminate a constant fraction of the array with each phase; we get the convergent ____ series in the analysis
Respuesta
-
A. linear
-
B. arithmetic
-
C. geometric
-
D. exponent
Pregunta 70
Pregunta
??
In the analysis of Selection algorithm, we make a number of passes, in fact it could be as many as,
Respuesta
-
A. T(n)
-
B. T(n/2)
-
C. log n
-
D. n/2 + n/4
Pregunta 71
Pregunta
??
Analysis of Selection algorithm ends up with
Respuesta
-
A. T(n)
-
B. T(1/1 + n)
-
C. T(n/2)
-
D. T(n/2 + n)
Pregunta 72
Pregunta
The analysis of Selection algorithm shows the total running time is indeed ____ in n,
Respuesta
-
A. arithmetic
-
B. geometric
-
C. linear
-
D. orthogonal
Pregunta 73
Pregunta
How many elements do we eliminate in each time for the Analysis of Selection algorithm?
Respuesta
-
A. n/2 elements
-
B. n/2 + n elements
-
C. n/4 elements
-
D. 2n elements
Pregunta 74
Pregunta
In a selection sort of n elements, how many times is the swap function called in the complete execution of the algorithm?
Respuesta
-
A. 1
-
B. n-1
-
C. n log(n)
-
D. n^2
Pregunta 75
Pregunta
Selection sort and quick sort both fall into the same category of sorting algorithms. What is this category?
Respuesta
-
A. Interchange sorts
-
B. Average time is quadratic.
-
C. O(n log n) sorts
-
D. Divide-and-conquer sorts
Pregunta 76
Pregunta
Slow sorting algorithms run in
Respuesta
-
A. T(n^2)
-
B. T(n)
-
C. T(log(n))
Pregunta 77
Pregunta
A sort technique is said to be stable when the original relative order of records with equal keys are retained after sorting.
Respuesta
- True
- False
Pregunta 78
Pregunta
The three factors contributing to the sort efficiency considerations are the efficiency in coding, machine run time and the space requirement for running the procedure.
Respuesta
- True
- False
Pregunta 79
Pregunta
The correct order of the efficiency of the following sorting algorithms according to their overall running time comparison is
Respuesta
-
A. Insertion > Selection > Bubble
-
B. Insertion > Bubble > Selection
-
C. Selection > Bubble > Insertion
-
D. Bubble > Selection > Insertion
Pregunta 80
Pregunta
In which order we can sort?
Respuesta
-
A. increasing order only
-
B. decreasing order only
-
C. increasing order or decreasing order
-
D. both at the same time
Pregunta 81
Pregunta
Which sorting algorithm is faster
Respuesta
-
A. O(n log(n))
-
B. O(n^2)
-
C. O(n+k)
-
D. O(n^3)
Pregunta 82
Pregunta
Continuation sort is suitable to sort the elements in range 1 to k
Respuesta
-
A. K is Large
-
B. K is not known
-
C. K may be small or large
-
D. K is small
Pregunta 83
Pregunta
In stable sorting algorithm.
Respuesta
-
A. If duplicate elements remain in the same relative position after sorting
-
B. One array is used
-
C. More than one arrays are required
-
D. Duplicating elements not handled
Pregunta 84
Pregunta
Which may be a stable sort?
Respuesta
-
A. Merger
-
B. Insertion
-
C. Both above
-
D. None of the above
Pregunta 85
Pregunta
An in place sorting algorithm is one that uses ___ arrays for storage
Respuesta
-
A. Two dimensional arrays
-
B. More than one array
-
C. No Additional Array
-
D. None of the above
Pregunta 86
Pregunta
We do sorting to
Respuesta
-
A. keep elements in random positions
-
B. keep the algorithm run in linear order
-
C. keep the algorithm run in (log n) order
-
D. keep elements in increasing or decreasing order
Pregunta 87
Pregunta
Sorting is one of the few problems where provable ____ bonds exits on how fast we can sort
Respuesta
-
A. upper
-
B. lower
-
C. average
-
D. log n
Pregunta 88
Pregunta
In in-place sorting algorithm is one that uses arrays for storage
Respuesta
-
A. An additional array
-
B. No additioanal array
-
C. Both of above may be true according to algorithm
-
D. More than 3 arrays of one dimension
Pregunta 89
Pregunta
Which may be stable sort
Respuesta
-
A. Bubble sort
-
B. Insertion sort
-
C. Both of above
-
D. None of above
Pregunta 90
Pregunta
The operation of processing each element in the list is known as
Respuesta
-
A. sorting
-
B. merging
-
C. inserting
-
D. traversal
Pregunta 91
Pregunta
Other name for directed graph is
Respuesta
-
A. Direct graph
-
B. Digraph
-
C. Dir-graph
Pregunta 92
Pregunta
Binary trees with threads are called as
Respuesta
-
A. Threaded trees
-
B. Pointer trees
-
C. Special trees
-
D. Special pointer trees
Pregunta 93
Pregunta
Graph G is ____ if for any pair u, v of nodes in G there is a path from u to v or path from v to u.
Respuesta
-
A. Leterally connected
-
B. Widely Connected
-
C. Unliterally connected
-
D. Literally connected
Pregunta 94
Pregunta
In Binary trees nodes with no successor are called
Respuesta
-
A. End nodes
-
B. Terminal nodes
-
C. Final nodes
-
D. Last nodes
Pregunta 95
Pregunta
A connected graph T without any cycles is called
Respuesta
-
A. free graph
-
B. no cycle graph
-
C. non cycle graph
-
D. circular graph
Pregunta 96
Pregunta
Trees are said ____ if they are similar and have same contents at corresponding nodes.
Respuesta
-
A. Duplicate
-
B. Carbon copy
-
C. Replica
-
D. Copies
Pregunta 97
Pregunta
Every node N in a binary tree T except the root has a unique parent called the ____ of N.
Respuesta
-
A. Antecedents
-
B. Predecessor
-
C. Forerunner
-
D. Precursor
Pregunta 98
Pregunta
In a graph if E=(u,v) means
Respuesta
-
A. u is adjacent to v but v is not adjacent to u
-
B. e begins at u and ends at v
-
C. u is processor and v is successor
-
D. both b and c
Pregunta 99
Pregunta
Sequential representation of binary tree uses
Respuesta
-
A. Array with pointers
-
B. Single linear array
-
C. Two dimentional arrays
-
D. Three dimentional arrays
Pregunta 100
Pregunta
In a graph if e=[u,v], Then u and v are called
Respuesta
-
A. End points of e
-
B. Adjacent nodes
-
C. Neighbours
-
D. All of the above
Pregunta 101
Pregunta
TREE[1]=NULL indicates tree is
Respuesta
-
A. Overflow
-
B. Underflow
-
C. Empty
-
D. Full
Pregunta 102
Pregunta
A binary tree whose every node has either zero or two children is called
Respuesta
-
A. complete binary tree
-
B. binary search tree
-
C. extended binary tree
-
D. data structure
Pregunta 103
Pregunta
Linked representation of binary tree needs ____ parallel arrays.
Respuesta
-
A. 4
-
B. 2
-
C. 3
-
D. 5
Pregunta 104
Pregunta
The depth of complete binary tree is given by
Respuesta
-
A. D(n) = n log(n)
-
B. D(n) = n log(n)+1
-
C. D(n) = log(n)
-
D. D(n) = log(n)+1
Pregunta 105
Pregunta
In a 2-tree, nodes with 0 children are called
Respuesta
-
A. Exterior node
-
B. Outside node
-
C. Outer node
-
D. External node
Pregunta 106
Pregunta
Which indicates pre-order traversal?
Respuesta
-
A. Left sub-tree, Right sub-tree and root
-
B. Right sub-tree, Left sub-tree and root
-
C. Root, Left sub-tree, Right sub-tree
-
D. Right sub-tree, root, Left sub-tree
Pregunta 107
Pregunta
In a extended-binary tree nodes with 2 children are called
Respuesta
-
A. Interior node
-
B. Domestic node
-
C. Internal node
-
D. Inner node
Pregunta 108
Pregunta
A terminal node in a binary tree is called
Respuesta
-
A. Root
-
B. Leaf
-
C. Child
-
D. Branch
Pregunta 109
Pregunta
The post order traversal of binary tree is DEBFCA. Find out the pre order traversal.
Respuesta
-
A. ABFCDE
-
B. ADBFEC
-
C. ABDECF
-
D. ABDCEF
Pregunta 110
Pregunta
While converting binary tree into extended binary tree, all the original nodes in binary tree are
Respuesta
-
A. Internal nodes on extended tree
-
B. External nodes on extended tree
-
C. Vanished on extended tree
-
D. Intermediate nodes on extended tree
Pregunta 111
Pregunta
The in-order traversal of tree will yield a sorted listing of elements of tree in
Respuesta
-
A. binary trees
-
B. binary search trees
-
C. heaps
-
D. binary heaps
Pregunta 112
Pregunta
In a binary tree, certain null entries are replaced by special pointers which point to nodes higher in the tree for efficiency. These special pointers are called
Respuesta
-
A. Leaf
-
B. Branch
-
C. Path
-
D. Thread
Pregunta 113
Pregunta
In a head tree
Respuesta
-
A. values in a node is greater than every value every value in left sub tree and smaller than right sub tree.
-
B. values in a node is greater than every value in children of it.
-
C. conditions.
-
D. terms.
Pregunta 114
Pregunta
The in order traversal of tree will yield a sorted listing of elements of tree in
Respuesta
-
A. Binary trees
-
B. Binary search trees
-
C. Merging
-
D. AVL Trees
Pregunta 115
Pregunta
In a graph if e=(u,v) means
Respuesta
-
A. u is adjacent to v but v is not adjacent to u.
-
B. e begins at u and ends at v
-
C. u is node and v is an edge.
-
D. both u and v are edges.
Pregunta 116
Pregunta
A binary tree whose every node has either zero or two children is called
Respuesta
-
A. Complete binary tree
-
B. Binary Search tree
-
C. Extended binary tree
-
D. E2 tree
Pregunta 117
Pregunta
If every node u in G is adjacent to every other node v in G,A graph is said to be
Respuesta
-
A. isolated
-
B. complete
-
C. finite
-
D. strongly connected
Pregunta 118
Pregunta
The post order traversal of a binary tree is DEBFCA. Find out the pre order Traversal.
Respuesta
-
A. ABFCDE
-
B. ADBFEC
-
C. ABDECF
-
D. ABDCEF
Pregunta 119
Pregunta
In a graph if e=[u,v], then u and v are called
Respuesta
-
A. endpoints of e
-
B. adjacent nodes
-
C. neighbours
-
D. all of the above
Pregunta 120
Pregunta
In-order traversing a tree resulted E A C K F H D B G; the pre-order traversal would return.
Respuesta
-
A. FAEKCDBHG
-
B. FAEKCDHGB
-
C. EAFKHDCBG
-
D. FEAKDCHBG
Pregunta 121
Pregunta
In linked representation of Binary trees LEFT[k] contains the ____ of at the node N, where k is the location.
Respuesta
-
A. Data
-
B. Location and left child
-
C. Right child address
-
D. Null value
Pregunta 122
Pregunta
If every node u in G adjacent to every other node v in G, A graph is said to be
Respuesta
-
A. isolated
-
B. complete
-
C. finite
-
D. strongly connected
Pregunta 123
Pregunta
Three standards ways of traversing a binary tree T with root R
Respuesta
-
A. Prefix, infix, postfix
-
B. Pre-process, in-process, post-process
-
C. Pre-traversal, in-traversal, post-traversal
-
D. Pre-order, in-order, post-order
Pregunta 124
Pregunta
A graph is said to be ____ if every node u in G is adjacent to every other node v in G.
Respuesta
-
A. Absolute
-
B. Entire
-
C. Inclusive
-
D. Complete
Pregunta 125
Pregunta
In threaded binary tree ____ points to higher nodes in tree.
Respuesta
-
A. Info
-
B. Root
-
C. Threads
-
D. Child
Pregunta 126
Pregunta
A graph is said to be ____ if its edges are assigned data.
Respuesta
-
A. Tagged
-
B. Marked
-
C. Weighted
-
D. Sticked
Pregunta 127
Pregunta
If node N is a terminal node in a binary tree then its
Respuesta
-
A. Right tree is empty
-
B. Left tree is empty
-
C. Both left & right sub trees are empty
-
D. Root node is empty
Pregunta 128
Pregunta
A directed graph is ____ if there is a path from each vertex to every other vertex in the digraph.
Respuesta
-
A. Weakly connected
-
B. Strongly Connected
-
C. Tightly Connected
-
D. Linearly Connected
Pregunta 129
Pregunta
In the ____ traversal we process all of a vertex's descendants before we move to an adjacent vertex.
Respuesta
-
A. Depth First
-
B. Breadth First
-
C. With First
-
D. Depth Limited
Pregunta 130
Pregunta
State True of False. (I) Network is a graph that has weights or costs associated with it. (II) An undirected graph which contains no cycles is called a forest. (III) A graph is said to be complete if there is no edge between every pair of vertices.
Respuesta
-
A. True, False, True
-
B. True, True, False
-
C. True, True, True
-
D. False, True, True
Pregunta 131
Pregunta
The number of comparisons done by sequential search is
Respuesta
-
A. (N/2)+1
-
B. (N+1)/2
-
C. (N-1)/2
-
D. (N+2)/2
Pregunta 132
Pregunta
In ____, search start at the beginning of the list and check every element in the list.
Respuesta
-
A. Linear search
-
B. Binary search
-
C. Hash Search
-
D. Binary Tree search
Pregunta 133
Pregunta
State True or False. (I) Binary search is used for searching in a sorted array. (II) The time complexity of binary search is O(logn).
Respuesta
-
A. True, False
-
B. False, True
-
C. False, False
-
D. True, True
Pregunta 134
Pregunta
Which of the following is not the internal sort?
Respuesta
-
A. Insertion Sort
-
B. Bubble Sort
-
C. Merge Sort
-
D. Heap Sort
Pregunta 135
Pregunta
State True or False. (I) An undirected graph which contains no cycles is called forest. (II) A graph is said to be complete if there is an edge between every pair of vertices.
Respuesta
-
A. True, True
-
B. False, True
-
C. False, False
-
D. True, False
Pregunta 136
Pregunta
A graph is said to be ____ if the vertices can be split into two sets V1 and V2 such there are no edges between two vertices of V1 or two vertices of V2.
Respuesta
-
A. Partite
-
B. Bipartite
-
C. Rooted
-
D. Bisects
Pregunta 137
Pregunta
In a queue, the initial values of front pointer f rare pointer r should be ____ and ____ respectively.
Respuesta
-
A. 0 and 1
-
B. 0 and -1
-
C. -1 and 0
-
D. 1 and 0
Pregunta 138
Pregunta
In a circular queue the value of r will be
Respuesta
-
A. r=r+1
-
B. r=(r+1)% [QUEUE_SIZE - 1]
-
C. r=(r+1)% QUEUE_SIZE
-
D. r=(r-1)% QUEUE_SIZE
Pregunta 139
Pregunta
Which of the following statement is true? (I) Using singly linked lists and circular list, it is not possible to traverse the list backwards. (II) To find the predecessor, it is required to traverse the list from the first node in case of singly linked list.
Respuesta
-
A. I-only
-
B. II-only
-
C. Both I and II
-
D. None of both
Pregunta 140
Pregunta
The advantage of ____ is that they solve the problem if sequential storage representation. But disadvantage in that is they are sequential lists.
Respuesta
-
A. Lists
-
B. Linked Lists
-
C. Trees
-
D. Queues
Pregunta 141
Pregunta
What will be the value of top, if there is a size of stack STACK_SIZE is 5
Respuesta
-
A. 5
-
B. 6
-
C. 4
-
D. None
Pregunta 142
Pregunta
____ is not the operation that can be performed on queue.
Respuesta
-
A. Insertion
-
B. Deletion
-
C. Retrieval
-
D. Traversal
Pregunta 143
Pregunta
There is an extra element at the head of the list called a
Respuesta
-
A. Antinel
-
B. Sentinel
-
C. List header
-
D. List head
Pregunta 144
Pregunta
A graph is a collection of nodes, called ____ And line segments called arcs or ____ that connect pair of nodes.
Respuesta
-
A. vertices, edges
-
B. edges, vertices
-
C. vertices, paths
-
D. graph node, edges
Pregunta 145
Pregunta
A ____ is a graph that has weights of costs associated with its edges.
Respuesta
-
A. Network
-
B. Weighted graph
-
C. Both A and B
-
D. None A and B
Pregunta 146
Pregunta
In general, the binary search method needs no more than ____ comparisons.
Respuesta
-
A. [log2n]-1
-
B. [logn]+1
-
C. [log2n]
-
D. [log2n]+1
Pregunta 147
Pregunta
In depth first search algorithm the number of recursive calls we have to make are
Respuesta
-
A. 2
-
B. 1
-
C. 6
-
D. depends on the graph
Pregunta 148
Pregunta
In a graph if e=(u,v) means
Respuesta
-
A. u is adjacent to v but v is not adjacent to u
-
B. e begins at u and ends at v
-
C. u is processor and v is successor
-
D. both b and c
Pregunta 149
Pregunta
Heap is defined to be a
Respuesta
-
A. complete binary tree
-
B. binary tree
-
C. tree structure
-
D. None of the above
Pregunta 150
Pregunta
In a Max heap the largest key is at
Respuesta
-
A. the root
-
B. a leaf
-
C. a node
-
D. None of the above
Pregunta 151
Pregunta
In heap sort the input is arranged in the form of a
Respuesta
-
A. heap
-
B. tree
-
C. queue
-
D. None of the above
Pregunta 152
Pregunta
Heap sort is found to be very efficient
Respuesta
-
A. with regard to storage requirement
-
B. in time consumption
-
C. regarding overheads involved
-
D. None of the above
Pregunta 153
Pregunta
For the heap sort, access to nodes involves simple ____ operations
Respuesta
-
A. arithmetic
-
B. binary
-
C. algebraic
-
D. logarithmic
Pregunta 154
Pregunta
A (an) ____ is a left-complete binary tree that conforms to the heap order
Respuesta
-
A. heap
-
B. binary tree
-
C. binary search tree
-
D. array
Pregunta 155
Pregunta
For the heap sort we store the tree nodes in
Respuesta
-
A. level-order traversal
-
B. in-order traversal
-
C. pre-order traversal
-
D. post-order traversal
Pregunta 156
Pregunta
One of the clever aspects of heaps is that they can be stored in arrays without using any ____.
Respuesta
-
A. pointers
-
B. constants
-
C. variables
-
D. functions
Pregunta 157
Pregunta
Assuming that the hash function for a table works well, and the size of the hash table is reasonably large compared to the number of items in the table, the expected (average) time needed to find an item in a hash table containing n items is
Respuesta
-
A. O(1)
-
B. O(log(n))
-
C. O(n log(n))
-
D. O(n)
Pregunta 158
Pregunta
The six-step solution for the problem can be applied to problems (I) with Algorithmic solution or (II) with Heuristic solution
Respuesta
-
A. Only I
-
B. Only II
-
C. Both I and II
-
D. Neither I nor II
Pregunta 159
Pregunta
____ solution requires reasoning built on knowledge and experience
Respuesta
-
A. Algorithmic Solution
-
B. Heuristic Solution
-
C. Random Solution
-
D. None of these
Pregunta 160
Pregunta
The branch of computer that deals with heuristic types of problem is called ____.
Respuesta
-
A. system software
-
B. real time software
-
C. artificial intelligence
-
D. none of these
Pregunta 161
Pregunta
___ is the first step in solving the problem
Respuesta
-
A. Understanding the Problem
-
B. Identify the Problem
-
C. Evaluate the Solution
-
D. None of these
Pregunta 162
Pregunta
___ is the last step in solving the problem
Respuesta
-
A. Understanding the Problem
-
B. Identify the Problem
-
C. Evaluate the Solution
-
D. None of these
Pregunta 163
Pregunta
Following is true for understanding of a problem
Respuesta
-
A. Knowing the knowledgebase
-
B. Understanding the subject on which the problem is based
-
C. Communication with the client
-
D. All of the above
Pregunta 164
Pregunta
While solving the problem with computer the most difficult step is ____.
Respuesta
-
A. describing the problem
-
B. finding out the cost of the software
-
C. writing the computer instructions
-
D. testing the solution
Pregunta 165
Pregunta
The main measure for efficiency algorithm are ____.
Respuesta
-
A. Processor and Memory
-
B. Size and Capacity
-
C. Data and Space
-
D. Time and Space
Pregunta 166
Pregunta
What does the algorithmic analysis count?
Respuesta
-
A. The number of arithmetic and the operations that are required to run the program
-
B. The number of lines required by the program
-
C. The number of seconds required by the program to execute
-
D. None of these
Pregunta 167
Pregunta
!!!
Examples of O(1) algorithms are ____.
Respuesta
-
A. Multiplying two numbers
-
B. Assigning some value to a variable
-
C. Displaying some integer on console
-
D. All of the above
Pregunta 168
Pregunta
Examples of O(n^2) algorithms are ____.
Respuesta
-
A. Adding of two Matrices
-
B. Initializing all elements of matrix by zero
-
C. Both A and B
-
D. Neither A nor B
Pregunta 169
Pregunta
The complexity of three algorithms is given as: O(n), O(n^2) and O(n^3). Which should execute slowest for large value of n?
Respuesta
-
A. O(n)
-
B. O(n^2)
-
C. O(n^3)
-
D. All will execute in same time.
Pregunta 170
Pregunta
There are four algorithms A1, A2, A3, A4 to solve the given problem with the order log(n), nlog(n), log(log(n)), n/log(n). Which is the best algorithm?
Respuesta
-
A. A1: log(n)
-
B. A2: n log(n)
-
C. A3: log(log(n))
-
D. A4: n/log(n)
Pregunta 171
Pregunta
Express the formula (n-1)*(n-5) in terms of big-Oh notation
Respuesta
-
A. O(1)
-
B. O(log(n))
-
C. O(n)
-
D. O(n^2)
Pregunta 172
Pregunta
Which of the following case does not exist in complexity theory?
Respuesta
-
A. Best case
-
B. Worst case
-
C. Average case
-
D. Null case
Pregunta 173
Pregunta
The concept of order Big-Oh is important because
Respuesta
-
A. It can be used to decide the best algorithm that solves a given problem
-
B. It determines the maximum size of a problem that can be solved in a given amount of time
-
C. It is the lower bound of the growth rate of algorithm
-
D. Both A and B
Pregunta 174
Pregunta
The recurrence relation capturing the optimal execution time of the Towers of Hanoi problem with n discs is
Respuesta
-
A. T(n) = 2T(n - 2) + 2
-
B. T(n) = 2T(n - 1) + n
-
C. T(n) = 2T(n/2) + 1
-
D. T(n) = 2T(n - 1) + 1
Pregunta 175
Pregunta
The space factor when determining the efficiency of algorithm is measured by
Respuesta
-
A. Counting the maximum memory needed by the algorithm
-
B. Counting the minimum memory needed by the algorithm
-
C. Counting the average memory needed by the algorithm
-
D. Counting the maximum disk space needed by the algorithm
Pregunta 176
Pregunta
The time factor when determining the efficiency of algorithm is measured by
Respuesta
-
A. Counting microseconds
-
B. Counting the number of key operations
-
C. Counting the number of statements
-
D. Counting the kilobytes of algorithm
Pregunta 177
Pregunta
A large department store has its own charge card. The policy for a customer to charge an item is that the customer must have a valid charge card and either a balance of less than Rs.500 or a charge of less than Rs.50.
Respuesta
-
A. ChargeCard AND (Balance < 500 OR Amount < 50)
-
B. ChargeCard OR (Balance < 500 AND Amount < 50)
-
C. ChargeCard OR (Balance < 500 OR Amount < 50)
-
D. ChargeCard AND (Balance < 500 AND Amount < 50)
Pregunta 178
Pregunta
If Total complexity after analysis is (5n^3 + 10n^2 + 100n + 400log(n) + 10), the Big-Oh complexity is
Respuesta
-
A. O(n^2)
-
B. O(n^3)
-
C. O(n log(n))
-
D. O(n^2 log(n))
Pregunta 179
Pregunta
In Strassen's Multiplication Algorithm the T(n) is
Respuesta
-
A. 7T(n) + bn^2
-
B. 7T(n/2) + bn^2
-
C. 8T(n/2) + bn^2
-
D. 7T(n/2) + bn
Pregunta 180
Pregunta
T(n) = 4T(n/2) + n, then in Big Oh Notation it is
Respuesta
-
A. O (n2)
-
B. O(4)
-
C. O(n)
-
D. O(log(n))
Pregunta 181
Pregunta
In T(n) = a * T(n/b) + f(n), "a" refers to
Respuesta
-
A. Size of sub problem
-
B. Number of sub problems
-
C. Size of the problem
-
D. Time to combine solutions
Pregunta 182
Pregunta
O(f(n)) minus O(f(n)) is equal to
Respuesta
-
A. Zero
-
B. A constant
-
C. f(n)
-
D. O(f(n))
¿Quieres crear tus propios Tests gratis con GoConqr? Más información.