Kopieren und bearbeiten

D

Beschreibung

Quiz am D, erstellt von Dina Kim am 23/05/2017.
Dina Kim
Quiz von Dina Kim, aktualisiert more than 1 year ago
Dina Kim
Erstellt von Dina Kim vor mehr als 7 Jahre
114
3
0

Zusammenfassung der Ressource

Frage 1

Frage
Naming convention for variable is followed in company because ____.
Antworten
  • A. it enhances readability
  • B. it allows to work without conflicts
  • C. it enhances the efficiency
  • D. all of the above

Frage 2

Frage
The true and false values represent ____.
Antworten
  • A. logical data
  • B. numeric data
  • C. character data
  • D. alphanumeric data

Frage 3

Frage
Following operator distinguishes equation from expression
Antworten
  • A. +, -, *, /
  • B. < or >
  • C. Logical operators
  • D. Assignment Operator

Frage 4

Frage
Following are called logical operators
Antworten
  • A. +, -, *, /
  • B. <, >, <=, >=
  • C. AND, OR, NOT
  • D. \, MOD

Frage 5

Frage
Evaluate 5*(x+y)-4*y/(z+6) where x = 2, y = 3, and z = 6
Antworten
  • A. 1
  • B. 24
  • C. 5
  • D. 10

Frage 6

Frage
Evaluate a-2>b where a=6, b = 8
Antworten
  • A. False
  • B. True
  • C. 6
  • D. 7

Frage 7

Frage
Evaluate for a = 5, b = 4, c = 3, d = 12 for the equation E = a*b+d/c
Antworten
  • A. 40
  • B. 24
  • C. 10
  • D. 10.66

Frage 8

Frage
Evaluate for the equation e = 5*a\d*(b+1) where a = 5, b = 4, c = 3, d = 12
Antworten
  • A. 10
  • B. 24
  • C. 0
  • D. 10

Frage 9

Frage
The most important reason for including a destructor in a class is:
Antworten
  • 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

Frage 10

Frage
Which of the following name does not relate to stacks?
Antworten
  • A. FIFO lists
  • B. LIFO list
  • C. Piles
  • D. Push-down lists

Frage 11

Frage
Which of the following data structure is linear type?
Antworten
  • A. Strings
  • B. Lists
  • C. Queues
  • D. All of above

Frage 12

Frage
An algorithm that calls itself directly or indirectly is known as
Antworten
  • A. Sub algorithm
  • B. Recursion
  • C. Polish notation
  • D. Traversal algorithm

Frage 13

Frage
The help menus or user manuals are the part of ____.
Antworten
  • A. Program
  • B. Algorithm
  • C. Internal Documentation
  • D. External Documentation

Frage 14

Frage
The correctness and appropriateness of ___ solution can be checked very easily.
Antworten
  • A. algorithmic solution
  • B. heuristic solution
  • C. random solution
  • D. none of these

Frage 15

Frage
Memorization is
Antworten
  • 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

Frage 16

Frage
The time complexity of linear search is _____.
Antworten
  • A. O(1)
  • B. O(log(n))
  • C. O(n)
  • D. O(n log(n))

Frage 17

Frage
The time complexity of binary search is _____.
Antworten
  • A. O(1)
  • B. O(log(n))
  • C. O(n)
  • D. O(n log(n))

Frage 18

Frage
What is the asymptotic runtime for traversing all nodes in a binary search tree with n nodes and printing them in order?
Antworten
  • A. O(n log(n))
  • B. O(n)
  • D. O(log(n))
  • E. O(n^2)

Frage 19

Frage
The number of nodes in a complete binary tree of height h is
Antworten
  • A. 2^(h+1) - 1
  • B. 2*(h+1) - 1
  • C. 2*(h+1)
  • D. (h+1)^2 - 1

Frage 20

Frage
Divide-and-conquer as breaking the problem into a small number of
Antworten
  • A. Pivot
  • B. Sieve
  • C. Smaller sub problems
  • D. Selection

Frage 21

Frage
The sub problems in Divide and Conquer are considered to be
Antworten
  • A. Distinct
  • B. Overlapping
  • C. Large size
  • D. Small size

Frage 22

Frage
For the sieve technique we solve the problem,
Antworten
  • A. recursively
  • B. mathematically
  • C. precisely
  • D. accurately

Frage 23

Frage
The sieve technique works in ____ as follows
Antworten
  • A. phases
  • B. numbers
  • C. integers
  • D. routines

Frage 24

Frage
The sieve technique is a special case, where the number of sub problems is just
Antworten
  • A. 5
  • B. many
  • C. 1
  • D. few

Frage 25

Frage
The reason for introducing Sieve Technique algorithm is that it illustrates a very important special case of,
Antworten
  • A. divide-and-conquer
  • B. decrease and conquer
  • C. greedy nature
  • D. 2-dimension Maxima

Frage 26

Frage
Sieve Technique applies to problems where we are interested in finding a single item from a larger set of ____
Antworten
  • A. n items
  • B. phases
  • C. pointers
  • D. constant

Frage 27

Frage
In Sieve Technique we do not know which item is of interest
Antworten
  • True
  • False

Frage 28

Frage
For the Sieve Technique we take time
Antworten
  • A. T(nk)
  • B. T(n / 3)
  • C. n^2
  • D. n/3

Frage 29

Frage
How many passes are required to sort a file of size n by bubble sort method?
Antworten
  • A. N2
  • B. N
  • C. N-1
  • D. N/2

Frage 30

Frage
The worst-case time complexity of Bubble Sort is ____.
Antworten
  • A. O(n2)
  • B. O(log n)
  • C. O(n)
  • D. O(n log(n))

Frage 31

Frage
Which of the following sorting procedures is the slowest?
Antworten
  • A. Quick sort
  • B. Heap sort
  • C. Shell sort
  • D. Bubble sort

Frage 32

Frage
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
Antworten
  • A. Bubble sort
  • B. Insertion sort
  • C. Quick Sort
  • D. Selection Sort

Frage 33

Frage
How many number of comparisons are required in insertion sort to sort a file if the file is sorted in reverse order?
Antworten
  • A. N2
  • B. N
  • C. N-1
  • D. N/2

Frage 34

Frage
How many number of comparisons are required in insertion sort to sort a file if the file is already sorted?
Antworten
  • A. N2
  • B. N
  • C. N-1
  • D. N/2

Frage 35

Frage
Which of the following sorting methods would be most suitable for sorting a list which is almost sorted?
Antworten
  • A. Bubble Sort
  • B. Insertion Sort
  • C. Selection Sort
  • D. Quick Sort

Frage 36

Frage
!!! 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
Antworten
  • A. Insertion sort
  • B. Selection sort
  • C. Either of a and b
  • D. None of the above

Frage 37

Frage
The running time of insertion sort is
Antworten
  • A. O(n^2)
  • B. O(n)
  • C. O(log(n))
  • D. O(n log(n))

Frage 38

Frage
A sort which compares adjacent elements in a list and switches where necessary is ____.
Antworten
  • A. insertion sort
  • B. heap sort
  • C. quick sort
  • D. bubble sort

Frage 39

Frage
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
Antworten
  • A. insertion sort
  • B. selection sort
  • C. heap sort
  • D. quick sort

Frage 40

Frage
The way a card game player arranges his cards as he picks them one by one can be compared to
Antworten
  • A. Quick sort
  • B. Merge sort
  • C. Insertion sort
  • D. Bubble sort

Frage 41

Frage
Which among the following is the best when the list is already sorted?
Antworten
  • A. Insertion sort
  • B. Bubble sort
  • C. Merge sort
  • D. Selection sort

Frage 42

Frage
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
Antworten
  • A. Bubble sort
  • B. Insertion sort
  • C. Selection sort
  • D. Merge sort

Frage 43

Frage
When is insertion sort a good choice for sorting an array?
Antworten
  • 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.

Frage 44

Frage
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)
Antworten
  • 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.

Frage 45

Frage
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
Antworten
  • A. O (n log(n))
  • B. O (n^2 log(n))
  • C. O (n^2 + log(n))
  • D. O (n^2)

Frage 46

Frage
The worst-case time complexity of Merge Sort is ____.
Antworten
  • A. O(n^2)
  • B. O(log n)
  • C. O(n)
  • D. O(n log(n))

Frage 47

Frage
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?
Antworten
  • 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

Frage 48

Frage
How much time merge sort takes for an array of numbers?
Antworten
  • A. T(n^2)
  • B. T(n)
  • C. T(log n)
  • D. T(n log(n))

Frage 49

Frage
Merge sort makes two recursive calls. Which statement is true after these recursive calls finish, but before the merge step?
Antworten
  • 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.

Frage 50

Frage
What is the worst-case time for merge sort to sort an array of n elements?
Antworten
  • A. O(n)
  • B. O(n log(n))
  • C. O(log(n))
  • D. O(n)

Frage 51

Frage
In quick sort, the number of partitions into which the file of size n is divided by a selected record is
Antworten
  • A. n
  • B. n - 1
  • C. 2
  • D. n/2

Frage 52

Frage
The worst-case time complexity of Quick Sort is ____.
Antworten
  • A. O(n^2)
  • B. O(log(n))
  • C. O(n)
  • D. O(n log(n))

Frage 53

Frage
The algorithm like Quick sort does not require extra memory for carrying out the sorting procedure. This technique is called ____.
Antworten
  • A. in-place
  • B. stable
  • C. unstable
  • D. in-partition

Frage 54

Frage
In quick sort, the number of partitions into which the file of size n is divided by a selected record is
Antworten
  • A. n
  • B. n - 1
  • C. 2
  • D. None of the above

Frage 55

Frage
The total number of comparisons made in quick sort for sorting a file of size n, is
Antworten
  • A. O(n log(n))
  • B. O(n^2)
  • C. n(log(n))
  • D. None of the above

Frage 56

Frage
Quick sort efficiency can be improved by adopting
Antworten
  • A. non-recursive method
  • B. insertion method
  • C. tree search method
  • D. None of the above

Frage 57

Frage
For the improvement of efficiency of quick sort the pivot can be
Antworten
  • A. the first element
  • B. the mean element
  • C. the last element
  • D. None of the above

Frage 58

Frage
Quick sort is the fastest available method of sorting because of
Antworten
  • 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

Frage 59

Frage
Quick sort is
Antworten
  • A. Stable & in place
  • B. Not stable but in place
  • C. Stable but not in place
  • D. Some time stable & some times in place

Frage 60

Frage
One example of in place but not stable algorithm is
Antworten
  • A. Merger Sort
  • B. Quick Sort
  • C. Continuation Sort
  • D. Bubble Sort

Frage 61

Frage
In Quick Sort Constants hidden in T(n log n) are
Antworten
  • A. Large
  • B. Medium
  • C. Small
  • D. Not Known

Frage 62

Frage
The running time of quick sort depends heavily on the selection of
Antworten
  • A. No of inputs
  • B. Arrangement of elements in array
  • C. Size o elements
  • D. Pivot elements

Frage 63

Frage
!!!!!! 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?
Antworten
  • A. 2
  • B. 7
  • C. 0
  • D. 5

Frage 64

Frage
Quick sort is solved using
Antworten
  • A. Divide and conquer
  • B. Greedy Programming
  • C. Dynamic Programming
  • D. Branch and bound

Frage 65

Frage
The worst-case time complexity of Selection Exchange Sort is ____.
Antworten
  • A. O(n^2)
  • B. O(log n)
  • C. O(n)
  • D. O(n log(n))

Frage 66

Frage
Straight selection sort is basically a method of repeated
Antworten
  • A. interchange
  • B. searching
  • C. position adjustment
  • D. None of the above

Frage 67

Frage
Number of selections required to sort a file of size N by straight selection requires
Antworten
  • A. n-1
  • B. log(n)
  • C. O(n^2)
  • D. None of the above

Frage 68

Frage
For sorting a file of size n by straight selection sort, the number of comparisons made in the first pass is
Antworten
  • A. n
  • B. n - 1
  • C. n(n - 1)/2
  • D. None of the above

Frage 69

Frage
"" 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
Antworten
  • A. linear
  • B. arithmetic
  • C. geometric
  • D. exponent

Frage 70

Frage
?? In the analysis of Selection algorithm, we make a number of passes, in fact it could be as many as,
Antworten
  • A. T(n)
  • B. T(n/2)
  • C. log n
  • D. n/2 + n/4

Frage 71

Frage
?? Analysis of Selection algorithm ends up with
Antworten
  • A. T(n)
  • B. T(1/1 + n)
  • C. T(n/2)
  • D. T(n/2 + n)

Frage 72

Frage
The analysis of Selection algorithm shows the total running time is indeed ____ in n,
Antworten
  • A. arithmetic
  • B. geometric
  • C. linear
  • D. orthogonal

Frage 73

Frage
How many elements do we eliminate in each time for the Analysis of Selection algorithm?
Antworten
  • A. n/2 elements
  • B. n/2 + n elements
  • C. n/4 elements
  • D. 2n elements

Frage 74

Frage
In a selection sort of n elements, how many times is the swap function called in the complete execution of the algorithm?
Antworten
  • A. 1
  • B. n-1
  • C. n log(n)
  • D. n^2

Frage 75

Frage
Selection sort and quick sort both fall into the same category of sorting algorithms. What is this category?
Antworten
  • A. Interchange sorts
  • B. Average time is quadratic.
  • C. O(n log n) sorts
  • D. Divide-and-conquer sorts

Frage 76

Frage
Slow sorting algorithms run in
Antworten
  • A. T(n^2)
  • B. T(n)
  • C. T(log(n))

Frage 77

Frage
A sort technique is said to be stable when the original relative order of records with equal keys are retained after sorting.
Antworten
  • True
  • False

Frage 78

Frage
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.
Antworten
  • True
  • False

Frage 79

Frage
The correct order of the efficiency of the following sorting algorithms according to their overall running time comparison is
Antworten
  • A. Insertion > Selection > Bubble
  • B. Insertion > Bubble > Selection
  • C. Selection > Bubble > Insertion
  • D. Bubble > Selection > Insertion

Frage 80

Frage
In which order we can sort?
Antworten
  • A. increasing order only
  • B. decreasing order only
  • C. increasing order or decreasing order
  • D. both at the same time

Frage 81

Frage
Which sorting algorithm is faster
Antworten
  • A. O(n log(n))
  • B. O(n^2)
  • C. O(n+k)
  • D. O(n^3)

Frage 82

Frage
Continuation sort is suitable to sort the elements in range 1 to k
Antworten
  • A. K is Large
  • B. K is not known
  • C. K may be small or large
  • D. K is small

Frage 83

Frage
In stable sorting algorithm.
Antworten
  • 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

Frage 84

Frage
Which may be a stable sort?
Antworten
  • A. Merger
  • B. Insertion
  • C. Both above
  • D. None of the above

Frage 85

Frage
An in place sorting algorithm is one that uses ___ arrays for storage
Antworten
  • A. Two dimensional arrays
  • B. More than one array
  • C. No Additional Array
  • D. None of the above

Frage 86

Frage
We do sorting to
Antworten
  • 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

Frage 87

Frage
Sorting is one of the few problems where provable ____ bonds exits on how fast we can sort
Antworten
  • A. upper
  • B. lower
  • C. average
  • D. log n

Frage 88

Frage
In in-place sorting algorithm is one that uses arrays for storage
Antworten
  • 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

Frage 89

Frage
Which may be stable sort
Antworten
  • A. Bubble sort
  • B. Insertion sort
  • C. Both of above
  • D. None of above

Frage 90

Frage
The operation of processing each element in the list is known as
Antworten
  • A. sorting
  • B. merging
  • C. inserting
  • D. traversal

Frage 91

Frage
Other name for directed graph is
Antworten
  • A. Direct graph
  • B. Digraph
  • C. Dir-graph

Frage 92

Frage
Binary trees with threads are called as
Antworten
  • A. Threaded trees
  • B. Pointer trees
  • C. Special trees
  • D. Special pointer trees

Frage 93

Frage
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.
Antworten
  • A. Leterally connected
  • B. Widely Connected
  • C. Unliterally connected
  • D. Literally connected

Frage 94

Frage
In Binary trees nodes with no successor are called
Antworten
  • A. End nodes
  • B. Terminal nodes
  • C. Final nodes
  • D. Last nodes

Frage 95

Frage
A connected graph T without any cycles is called
Antworten
  • A. free graph
  • B. no cycle graph
  • C. non cycle graph
  • D. circular graph

Frage 96

Frage
Trees are said ____ if they are similar and have same contents at corresponding nodes.
Antworten
  • A. Duplicate
  • B. Carbon copy
  • C. Replica
  • D. Copies

Frage 97

Frage
Every node N in a binary tree T except the root has a unique parent called the ____ of N.
Antworten
  • A. Antecedents
  • B. Predecessor
  • C. Forerunner
  • D. Precursor

Frage 98

Frage
In a graph if E=(u,v) means
Antworten
  • 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

Frage 99

Frage
Sequential representation of binary tree uses
Antworten
  • A. Array with pointers
  • B. Single linear array
  • C. Two dimentional arrays
  • D. Three dimentional arrays

Frage 100

Frage
In a graph if e=[u,v], Then u and v are called
Antworten
  • A. End points of e
  • B. Adjacent nodes
  • C. Neighbours
  • D. All of the above

Frage 101

Frage
TREE[1]=NULL indicates tree is
Antworten
  • A. Overflow
  • B. Underflow
  • C. Empty
  • D. Full

Frage 102

Frage
A binary tree whose every node has either zero or two children is called
Antworten
  • A. complete binary tree
  • B. binary search tree
  • C. extended binary tree
  • D. data structure

Frage 103

Frage
Linked representation of binary tree needs ____ parallel arrays.
Antworten
  • A. 4
  • B. 2
  • C. 3
  • D. 5

Frage 104

Frage
The depth of complete binary tree is given by
Antworten
  • A. D(n) = n log(n)
  • B. D(n) = n log(n)+1
  • C. D(n) = log(n)
  • D. D(n) = log(n)+1

Frage 105

Frage
In a 2-tree, nodes with 0 children are called
Antworten
  • A. Exterior node
  • B. Outside node
  • C. Outer node
  • D. External node

Frage 106

Frage
Which indicates pre-order traversal?
Antworten
  • 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

Frage 107

Frage
In a extended-binary tree nodes with 2 children are called
Antworten
  • A. Interior node
  • B. Domestic node
  • C. Internal node
  • D. Inner node

Frage 108

Frage
A terminal node in a binary tree is called
Antworten
  • A. Root
  • B. Leaf
  • C. Child
  • D. Branch

Frage 109

Frage
The post order traversal of binary tree is DEBFCA. Find out the pre order traversal.
Antworten
  • A. ABFCDE
  • B. ADBFEC
  • C. ABDECF
  • D. ABDCEF

Frage 110

Frage
While converting binary tree into extended binary tree, all the original nodes in binary tree are
Antworten
  • A. Internal nodes on extended tree
  • B. External nodes on extended tree
  • C. Vanished on extended tree
  • D. Intermediate nodes on extended tree

Frage 111

Frage
The in-order traversal of tree will yield a sorted listing of elements of tree in
Antworten
  • A. binary trees
  • B. binary search trees
  • C. heaps
  • D. binary heaps

Frage 112

Frage
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
Antworten
  • A. Leaf
  • B. Branch
  • C. Path
  • D. Thread

Frage 113

Frage
In a head tree
Antworten
  • 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.

Frage 114

Frage
The in order traversal of tree will yield a sorted listing of elements of tree in
Antworten
  • A. Binary trees
  • B. Binary search trees
  • C. Merging
  • D. AVL Trees

Frage 115

Frage
In a graph if e=(u,v) means
Antworten
  • 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.

Frage 116

Frage
A binary tree whose every node has either zero or two children is called
Antworten
  • A. Complete binary tree
  • B. Binary Search tree
  • C. Extended binary tree
  • D. E2 tree

Frage 117

Frage
If every node u in G is adjacent to every other node v in G,A graph is said to be
Antworten
  • A. isolated
  • B. complete
  • C. finite
  • D. strongly connected

Frage 118

Frage
The post order traversal of a binary tree is DEBFCA. Find out the pre order Traversal.
Antworten
  • A. ABFCDE
  • B. ADBFEC
  • C. ABDECF
  • D. ABDCEF

Frage 119

Frage
In a graph if e=[u,v], then u and v are called
Antworten
  • A. endpoints of e
  • B. adjacent nodes
  • C. neighbours
  • D. all of the above

Frage 120

Frage
In-order traversing a tree resulted E A C K F H D B G; the pre-order traversal would return.
Antworten
  • A. FAEKCDBHG
  • B. FAEKCDHGB
  • C. EAFKHDCBG
  • D. FEAKDCHBG

Frage 121

Frage
In linked representation of Binary trees LEFT[k] contains the ____ of at the node N, where k is the location.
Antworten
  • A. Data
  • B. Location and left child
  • C. Right child address
  • D. Null value

Frage 122

Frage
If every node u in G adjacent to every other node v in G, A graph is said to be
Antworten
  • A. isolated
  • B. complete
  • C. finite
  • D. strongly connected

Frage 123

Frage
Three standards ways of traversing a binary tree T with root R
Antworten
  • 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

Frage 124

Frage
A graph is said to be ____ if every node u in G is adjacent to every other node v in G.
Antworten
  • A. Absolute
  • B. Entire
  • C. Inclusive
  • D. Complete

Frage 125

Frage
In threaded binary tree ____ points to higher nodes in tree.
Antworten
  • A. Info
  • B. Root
  • C. Threads
  • D. Child

Frage 126

Frage
A graph is said to be ____ if its edges are assigned data.
Antworten
  • A. Tagged
  • B. Marked
  • C. Weighted
  • D. Sticked

Frage 127

Frage
If node N is a terminal node in a binary tree then its
Antworten
  • A. Right tree is empty
  • B. Left tree is empty
  • C. Both left & right sub trees are empty
  • D. Root node is empty

Frage 128

Frage
A directed graph is ____ if there is a path from each vertex to every other vertex in the digraph.
Antworten
  • A. Weakly connected
  • B. Strongly Connected
  • C. Tightly Connected
  • D. Linearly Connected

Frage 129

Frage
In the ____ traversal we process all of a vertex's descendants before we move to an adjacent vertex.
Antworten
  • A. Depth First
  • B. Breadth First
  • C. With First
  • D. Depth Limited

Frage 130

Frage
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.
Antworten
  • A. True, False, True
  • B. True, True, False
  • C. True, True, True
  • D. False, True, True

Frage 131

Frage
The number of comparisons done by sequential search is
Antworten
  • A. (N/2)+1
  • B. (N+1)/2
  • C. (N-1)/2
  • D. (N+2)/2

Frage 132

Frage
In ____, search start at the beginning of the list and check every element in the list.
Antworten
  • A. Linear search
  • B. Binary search
  • C. Hash Search
  • D. Binary Tree search

Frage 133

Frage
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).
Antworten
  • A. True, False
  • B. False, True
  • C. False, False
  • D. True, True

Frage 134

Frage
Which of the following is not the internal sort?
Antworten
  • A. Insertion Sort
  • B. Bubble Sort
  • C. Merge Sort
  • D. Heap Sort

Frage 135

Frage
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.
Antworten
  • A. True, True
  • B. False, True
  • C. False, False
  • D. True, False

Frage 136

Frage
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.
Antworten
  • A. Partite
  • B. Bipartite
  • C. Rooted
  • D. Bisects

Frage 137

Frage
In a queue, the initial values of front pointer f rare pointer r should be ____ and ____ respectively.
Antworten
  • A. 0 and 1
  • B. 0 and -1
  • C. -1 and 0
  • D. 1 and 0

Frage 138

Frage
In a circular queue the value of r will be
Antworten
  • A. r=r+1
  • B. r=(r+1)% [QUEUE_SIZE - 1]
  • C. r=(r+1)% QUEUE_SIZE
  • D. r=(r-1)% QUEUE_SIZE

Frage 139

Frage
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.
Antworten
  • A. I-only
  • B. II-only
  • C. Both I and II
  • D. None of both

Frage 140

Frage
The advantage of ____ is that they solve the problem if sequential storage representation. But disadvantage in that is they are sequential lists.
Antworten
  • A. Lists
  • B. Linked Lists
  • C. Trees
  • D. Queues

Frage 141

Frage
What will be the value of top, if there is a size of stack STACK_SIZE is 5
Antworten
  • A. 5
  • B. 6
  • C. 4
  • D. None

Frage 142

Frage
____ is not the operation that can be performed on queue.
Antworten
  • A. Insertion
  • B. Deletion
  • C. Retrieval
  • D. Traversal

Frage 143

Frage
There is an extra element at the head of the list called a
Antworten
  • A. Antinel
  • B. Sentinel
  • C. List header
  • D. List head

Frage 144

Frage
A graph is a collection of nodes, called ____ And line segments called arcs or ____ that connect pair of nodes.
Antworten
  • A. vertices, edges
  • B. edges, vertices
  • C. vertices, paths
  • D. graph node, edges

Frage 145

Frage
A ____ is a graph that has weights of costs associated with its edges.
Antworten
  • A. Network
  • B. Weighted graph
  • C. Both A and B
  • D. None A and B

Frage 146

Frage
In general, the binary search method needs no more than ____ comparisons.
Antworten
  • A. [log2n]-1
  • B. [logn]+1
  • C. [log2n]
  • D. [log2n]+1

Frage 147

Frage
In depth first search algorithm the number of recursive calls we have to make are
Antworten
  • A. 2
  • B. 1
  • C. 6
  • D. depends on the graph

Frage 148

Frage
In a graph if e=(u,v) means
Antworten
  • 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

Frage 149

Frage
Heap is defined to be a
Antworten
  • A. complete binary tree
  • B. binary tree
  • C. tree structure
  • D. None of the above

Frage 150

Frage
In a Max heap the largest key is at
Antworten
  • A. the root
  • B. a leaf
  • C. a node
  • D. None of the above

Frage 151

Frage
In heap sort the input is arranged in the form of a
Antworten
  • A. heap
  • B. tree
  • C. queue
  • D. None of the above

Frage 152

Frage
Heap sort is found to be very efficient
Antworten
  • A. with regard to storage requirement
  • B. in time consumption
  • C. regarding overheads involved
  • D. None of the above

Frage 153

Frage
For the heap sort, access to nodes involves simple ____ operations
Antworten
  • A. arithmetic
  • B. binary
  • C. algebraic
  • D. logarithmic

Frage 154

Frage
A (an) ____ is a left-complete binary tree that conforms to the heap order
Antworten
  • A. heap
  • B. binary tree
  • C. binary search tree
  • D. array

Frage 155

Frage
For the heap sort we store the tree nodes in
Antworten
  • A. level-order traversal
  • B. in-order traversal
  • C. pre-order traversal
  • D. post-order traversal

Frage 156

Frage
One of the clever aspects of heaps is that they can be stored in arrays without using any ____.
Antworten
  • A. pointers
  • B. constants
  • C. variables
  • D. functions

Frage 157

Frage
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
Antworten
  • A. O(1)
  • B. O(log(n))
  • C. O(n log(n))
  • D. O(n)

Frage 158

Frage
The six-step solution for the problem can be applied to problems (I) with Algorithmic solution or (II) with Heuristic solution
Antworten
  • A. Only I
  • B. Only II
  • C. Both I and II
  • D. Neither I nor II

Frage 159

Frage
____ solution requires reasoning built on knowledge and experience
Antworten
  • A. Algorithmic Solution
  • B. Heuristic Solution
  • C. Random Solution
  • D. None of these

Frage 160

Frage
The branch of computer that deals with heuristic types of problem is called ____.
Antworten
  • A. system software
  • B. real time software
  • C. artificial intelligence
  • D. none of these

Frage 161

Frage
___ is the first step in solving the problem
Antworten
  • A. Understanding the Problem
  • B. Identify the Problem
  • C. Evaluate the Solution
  • D. None of these

Frage 162

Frage
___ is the last step in solving the problem
Antworten
  • A. Understanding the Problem
  • B. Identify the Problem
  • C. Evaluate the Solution
  • D. None of these

Frage 163

Frage
Following is true for understanding of a problem
Antworten
  • A. Knowing the knowledgebase
  • B. Understanding the subject on which the problem is based
  • C. Communication with the client
  • D. All of the above

Frage 164

Frage
While solving the problem with computer the most difficult step is ____.
Antworten
  • A. describing the problem
  • B. finding out the cost of the software
  • C. writing the computer instructions
  • D. testing the solution

Frage 165

Frage
The main measure for efficiency algorithm are ____.
Antworten
  • A. Processor and Memory
  • B. Size and Capacity
  • C. Data and Space
  • D. Time and Space

Frage 166

Frage
What does the algorithmic analysis count?
Antworten
  • 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

Frage 167

Frage
!!! Examples of O(1) algorithms are ____.
Antworten
  • A. Multiplying two numbers
  • B. Assigning some value to a variable
  • C. Displaying some integer on console
  • D. All of the above

Frage 168

Frage
Examples of O(n^2) algorithms are ____.
Antworten
  • A. Adding of two Matrices
  • B. Initializing all elements of matrix by zero
  • C. Both A and B
  • D. Neither A nor B

Frage 169

Frage
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?
Antworten
  • A. O(n)
  • B. O(n^2)
  • C. O(n^3)
  • D. All will execute in same time.

Frage 170

Frage
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?
Antworten
  • A. A1: log(n)
  • B. A2: n log(n)
  • C. A3: log(log(n))
  • D. A4: n/log(n)

Frage 171

Frage
Express the formula (n-1)*(n-5) in terms of big-Oh notation
Antworten
  • A. O(1)
  • B. O(log(n))
  • C. O(n)
  • D. O(n^2)

Frage 172

Frage
Which of the following case does not exist in complexity theory?
Antworten
  • A. Best case
  • B. Worst case
  • C. Average case
  • D. Null case

Frage 173

Frage
The concept of order Big-Oh is important because
Antworten
  • 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

Frage 174

Frage
The recurrence relation capturing the optimal execution time of the Towers of Hanoi problem with n discs is
Antworten
  • 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

Frage 175

Frage
The space factor when determining the efficiency of algorithm is measured by
Antworten
  • 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

Frage 176

Frage
The time factor when determining the efficiency of algorithm is measured by
Antworten
  • A. Counting microseconds
  • B. Counting the number of key operations
  • C. Counting the number of statements
  • D. Counting the kilobytes of algorithm

Frage 177

Frage
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.
Antworten
  • 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)

Frage 178

Frage
If Total complexity after analysis is (5n^3 + 10n^2 + 100n + 400log(n) + 10), the Big-Oh complexity is
Antworten
  • A. O(n^2)
  • B. O(n^3)
  • C. O(n log(n))
  • D. O(n^2 log(n))

Frage 179

Frage
In Strassen's Multiplication Algorithm the T(n) is
Antworten
  • A. 7T(n) + bn^2
  • B. 7T(n/2) + bn^2
  • C. 8T(n/2) + bn^2
  • D. 7T(n/2) + bn

Frage 180

Frage
T(n) = 4T(n/2) + n, then in Big Oh Notation it is
Antworten
  • A. O (n2)
  • B. O(4)
  • C. O(n)
  • D. O(log(n))

Frage 181

Frage
In T(n) = a * T(n/b) + f(n), "a" refers to
Antworten
  • A. Size of sub problem
  • B. Number of sub problems
  • C. Size of the problem
  • D. Time to combine solutions

Frage 182

Frage
O(f(n)) minus O(f(n)) is equal to
Antworten
  • A. Zero
  • B. A constant
  • C. f(n)
  • D. O(f(n))
Zusammenfassung anzeigen Zusammenfassung ausblenden

Möchten Sie mit GoConqr kostenlos Ihre eigenen Quiz erstellen? eigenen Mehr erfahren.

ähnlicher Inhalt

Anatomy & Physiology
Yan Yan Dela Cru
Insectos
Angel Oswaldo
responding to change
gfhgfhg gfhgfhg
teaching daily activities vocabulary
raheeq saleh
UNIIIIIIT 5: Ancient Egyptian Gods
Mr Intifada
ESTADÍSTICA DESCRIPTIVA
Ana Valeria Santander
chapter 15
SN15
animal and plant cells
david doran
NMS Semester 2 Set 1 Quiz - The brain, hearing, taste and olfaction.
. .
NMS Semester 2 Set 2 Quiz - Anti-depressants, anti-psychotics, anxiolytics and control of pain.
. .
NMS Semester 2 Set 4 Quiz - The Hypothalamus
. .
Bibliothek durchsuchen