Copiar e Editar

D

Descrição

Quiz sobre D, criado por Dina Kim em 23-05-2017.
Dina Kim
Quiz por Dina Kim, atualizado more than 1 year ago
Dina Kim
Criado por Dina Kim aproximadamente 7 anos atrás
109
3
0

Resumo de Recurso

Questão 1

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

Questão 2

Questão
The true and false values represent ____.
Responda
  • A. logical data
  • B. numeric data
  • C. character data
  • D. alphanumeric data

Questão 3

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

Questão 4

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

Questão 5

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

Questão 6

Questão
Evaluate a-2>b where a=6, b = 8
Responda
  • A. False
  • B. True
  • C. 6
  • D. 7

Questão 7

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

Questão 8

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

Questão 9

Questão
The most important reason for including a destructor in a class is:
Responda
  • 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

Questão 10

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

Questão 11

Questão
Which of the following data structure is linear type?
Responda
  • A. Strings
  • B. Lists
  • C. Queues
  • D. All of above

Questão 12

Questão
An algorithm that calls itself directly or indirectly is known as
Responda
  • A. Sub algorithm
  • B. Recursion
  • C. Polish notation
  • D. Traversal algorithm

Questão 13

Questão
The help menus or user manuals are the part of ____.
Responda
  • A. Program
  • B. Algorithm
  • C. Internal Documentation
  • D. External Documentation

Questão 14

Questão
The correctness and appropriateness of ___ solution can be checked very easily.
Responda
  • A. algorithmic solution
  • B. heuristic solution
  • C. random solution
  • D. none of these

Questão 15

Questão
Memorization is
Responda
  • 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

Questão 16

Questão
The time complexity of linear search is _____.
Responda
  • A. O(1)
  • B. O(log(n))
  • C. O(n)
  • D. O(n log(n))

Questão 17

Questão
The time complexity of binary search is _____.
Responda
  • A. O(1)
  • B. O(log(n))
  • C. O(n)
  • D. O(n log(n))

Questão 18

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

Questão 19

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

Questão 20

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

Questão 21

Questão
The sub problems in Divide and Conquer are considered to be
Responda
  • A. Distinct
  • B. Overlapping
  • C. Large size
  • D. Small size

Questão 22

Questão
For the sieve technique we solve the problem,
Responda
  • A. recursively
  • B. mathematically
  • C. precisely
  • D. accurately

Questão 23

Questão
The sieve technique works in ____ as follows
Responda
  • A. phases
  • B. numbers
  • C. integers
  • D. routines

Questão 24

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

Questão 25

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

Questão 26

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

Questão 27

Questão
In Sieve Technique we do not know which item is of interest
Responda
  • True
  • False

Questão 28

Questão
For the Sieve Technique we take time
Responda
  • A. T(nk)
  • B. T(n / 3)
  • C. n^2
  • D. n/3

Questão 29

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

Questão 30

Questão
The worst-case time complexity of Bubble Sort is ____.
Responda
  • A. O(n2)
  • B. O(log n)
  • C. O(n)
  • D. O(n log(n))

Questão 31

Questão
Which of the following sorting procedures is the slowest?
Responda
  • A. Quick sort
  • B. Heap sort
  • C. Shell sort
  • D. Bubble sort

Questão 32

Questão
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
Responda
  • A. Bubble sort
  • B. Insertion sort
  • C. Quick Sort
  • D. Selection Sort

Questão 33

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

Questão 34

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

Questão 35

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

Questão 36

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

Questão 37

Questão
The running time of insertion sort is
Responda
  • A. O(n^2)
  • B. O(n)
  • C. O(log(n))
  • D. O(n log(n))

Questão 38

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

Questão 39

Questão
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
Responda
  • A. insertion sort
  • B. selection sort
  • C. heap sort
  • D. quick sort

Questão 40

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

Questão 41

Questão
Which among the following is the best when the list is already sorted?
Responda
  • A. Insertion sort
  • B. Bubble sort
  • C. Merge sort
  • D. Selection sort

Questão 42

Questão
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
Responda
  • A. Bubble sort
  • B. Insertion sort
  • C. Selection sort
  • D. Merge sort

Questão 43

Questão
When is insertion sort a good choice for sorting an array?
Responda
  • 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.

Questão 44

Questão
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)
Responda
  • 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.

Questão 45

Questão
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
Responda
  • A. O (n log(n))
  • B. O (n^2 log(n))
  • C. O (n^2 + log(n))
  • D. O (n^2)

Questão 46

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

Questão 47

Questão
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?
Responda
  • 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

Questão 48

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

Questão 49

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

Questão 50

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

Questão 51

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

Questão 52

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

Questão 53

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

Questão 54

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

Questão 55

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

Questão 56

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

Questão 57

Questão
For the improvement of efficiency of quick sort the pivot can be
Responda
  • A. the first element
  • B. the mean element
  • C. the last element
  • D. None of the above

Questão 58

Questão
Quick sort is the fastest available method of sorting because of
Responda
  • 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

Questão 59

Questão
Quick sort is
Responda
  • A. Stable & in place
  • B. Not stable but in place
  • C. Stable but not in place
  • D. Some time stable & some times in place

Questão 60

Questão
One example of in place but not stable algorithm is
Responda
  • A. Merger Sort
  • B. Quick Sort
  • C. Continuation Sort
  • D. Bubble Sort

Questão 61

Questão
In Quick Sort Constants hidden in T(n log n) are
Responda
  • A. Large
  • B. Medium
  • C. Small
  • D. Not Known

Questão 62

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

Questão 63

Questão
!!!!!! 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?
Responda
  • A. 2
  • B. 7
  • C. 0
  • D. 5

Questão 64

Questão
Quick sort is solved using
Responda
  • A. Divide and conquer
  • B. Greedy Programming
  • C. Dynamic Programming
  • D. Branch and bound

Questão 65

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

Questão 66

Questão
Straight selection sort is basically a method of repeated
Responda
  • A. interchange
  • B. searching
  • C. position adjustment
  • D. None of the above

Questão 67

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

Questão 68

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

Questão 69

Questão
"" 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
Responda
  • A. linear
  • B. arithmetic
  • C. geometric
  • D. exponent

Questão 70

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

Questão 71

Questão
?? Analysis of Selection algorithm ends up with
Responda
  • A. T(n)
  • B. T(1/1 + n)
  • C. T(n/2)
  • D. T(n/2 + n)

Questão 72

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

Questão 73

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

Questão 74

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

Questão 75

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

Questão 76

Questão
Slow sorting algorithms run in
Responda
  • A. T(n^2)
  • B. T(n)
  • C. T(log(n))

Questão 77

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

Questão 78

Questão
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.
Responda
  • True
  • False

Questão 79

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

Questão 80

Questão
In which order we can sort?
Responda
  • A. increasing order only
  • B. decreasing order only
  • C. increasing order or decreasing order
  • D. both at the same time

Questão 81

Questão
Which sorting algorithm is faster
Responda
  • A. O(n log(n))
  • B. O(n^2)
  • C. O(n+k)
  • D. O(n^3)

Questão 82

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

Questão 83

Questão
In stable sorting algorithm.
Responda
  • 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

Questão 84

Questão
Which may be a stable sort?
Responda
  • A. Merger
  • B. Insertion
  • C. Both above
  • D. None of the above

Questão 85

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

Questão 86

Questão
We do sorting to
Responda
  • 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

Questão 87

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

Questão 88

Questão
In in-place sorting algorithm is one that uses arrays for storage
Responda
  • 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

Questão 89

Questão
Which may be stable sort
Responda
  • A. Bubble sort
  • B. Insertion sort
  • C. Both of above
  • D. None of above

Questão 90

Questão
The operation of processing each element in the list is known as
Responda
  • A. sorting
  • B. merging
  • C. inserting
  • D. traversal

Questão 91

Questão
Other name for directed graph is
Responda
  • A. Direct graph
  • B. Digraph
  • C. Dir-graph

Questão 92

Questão
Binary trees with threads are called as
Responda
  • A. Threaded trees
  • B. Pointer trees
  • C. Special trees
  • D. Special pointer trees

Questão 93

Questão
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.
Responda
  • A. Leterally connected
  • B. Widely Connected
  • C. Unliterally connected
  • D. Literally connected

Questão 94

Questão
In Binary trees nodes with no successor are called
Responda
  • A. End nodes
  • B. Terminal nodes
  • C. Final nodes
  • D. Last nodes

Questão 95

Questão
A connected graph T without any cycles is called
Responda
  • A. free graph
  • B. no cycle graph
  • C. non cycle graph
  • D. circular graph

Questão 96

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

Questão 97

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

Questão 98

Questão
In a graph if E=(u,v) means
Responda
  • 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

Questão 99

Questão
Sequential representation of binary tree uses
Responda
  • A. Array with pointers
  • B. Single linear array
  • C. Two dimentional arrays
  • D. Three dimentional arrays

Questão 100

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

Questão 101

Questão
TREE[1]=NULL indicates tree is
Responda
  • A. Overflow
  • B. Underflow
  • C. Empty
  • D. Full

Questão 102

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

Questão 103

Questão
Linked representation of binary tree needs ____ parallel arrays.
Responda
  • A. 4
  • B. 2
  • C. 3
  • D. 5

Questão 104

Questão
The depth of complete binary tree is given by
Responda
  • A. D(n) = n log(n)
  • B. D(n) = n log(n)+1
  • C. D(n) = log(n)
  • D. D(n) = log(n)+1

Questão 105

Questão
In a 2-tree, nodes with 0 children are called
Responda
  • A. Exterior node
  • B. Outside node
  • C. Outer node
  • D. External node

Questão 106

Questão
Which indicates pre-order traversal?
Responda
  • 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

Questão 107

Questão
In a extended-binary tree nodes with 2 children are called
Responda
  • A. Interior node
  • B. Domestic node
  • C. Internal node
  • D. Inner node

Questão 108

Questão
A terminal node in a binary tree is called
Responda
  • A. Root
  • B. Leaf
  • C. Child
  • D. Branch

Questão 109

Questão
The post order traversal of binary tree is DEBFCA. Find out the pre order traversal.
Responda
  • A. ABFCDE
  • B. ADBFEC
  • C. ABDECF
  • D. ABDCEF

Questão 110

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

Questão 111

Questão
The in-order traversal of tree will yield a sorted listing of elements of tree in
Responda
  • A. binary trees
  • B. binary search trees
  • C. heaps
  • D. binary heaps

Questão 112

Questão
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
Responda
  • A. Leaf
  • B. Branch
  • C. Path
  • D. Thread

Questão 113

Questão
In a head tree
Responda
  • 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.

Questão 114

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

Questão 115

Questão
In a graph if e=(u,v) means
Responda
  • 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.

Questão 116

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

Questão 117

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

Questão 118

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

Questão 119

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

Questão 120

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

Questão 121

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

Questão 122

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

Questão 123

Questão
Three standards ways of traversing a binary tree T with root R
Responda
  • 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

Questão 124

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

Questão 125

Questão
In threaded binary tree ____ points to higher nodes in tree.
Responda
  • A. Info
  • B. Root
  • C. Threads
  • D. Child

Questão 126

Questão
A graph is said to be ____ if its edges are assigned data.
Responda
  • A. Tagged
  • B. Marked
  • C. Weighted
  • D. Sticked

Questão 127

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

Questão 128

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

Questão 129

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

Questão 130

Questão
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.
Responda
  • A. True, False, True
  • B. True, True, False
  • C. True, True, True
  • D. False, True, True

Questão 131

Questão
The number of comparisons done by sequential search is
Responda
  • A. (N/2)+1
  • B. (N+1)/2
  • C. (N-1)/2
  • D. (N+2)/2

Questão 132

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

Questão 133

Questão
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).
Responda
  • A. True, False
  • B. False, True
  • C. False, False
  • D. True, True

Questão 134

Questão
Which of the following is not the internal sort?
Responda
  • A. Insertion Sort
  • B. Bubble Sort
  • C. Merge Sort
  • D. Heap Sort

Questão 135

Questão
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.
Responda
  • A. True, True
  • B. False, True
  • C. False, False
  • D. True, False

Questão 136

Questão
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.
Responda
  • A. Partite
  • B. Bipartite
  • C. Rooted
  • D. Bisects

Questão 137

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

Questão 138

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

Questão 139

Questão
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.
Responda
  • A. I-only
  • B. II-only
  • C. Both I and II
  • D. None of both

Questão 140

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

Questão 141

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

Questão 142

Questão
____ is not the operation that can be performed on queue.
Responda
  • A. Insertion
  • B. Deletion
  • C. Retrieval
  • D. Traversal

Questão 143

Questão
There is an extra element at the head of the list called a
Responda
  • A. Antinel
  • B. Sentinel
  • C. List header
  • D. List head

Questão 144

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

Questão 145

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

Questão 146

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

Questão 147

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

Questão 148

Questão
In a graph if e=(u,v) means
Responda
  • 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

Questão 149

Questão
Heap is defined to be a
Responda
  • A. complete binary tree
  • B. binary tree
  • C. tree structure
  • D. None of the above

Questão 150

Questão
In a Max heap the largest key is at
Responda
  • A. the root
  • B. a leaf
  • C. a node
  • D. None of the above

Questão 151

Questão
In heap sort the input is arranged in the form of a
Responda
  • A. heap
  • B. tree
  • C. queue
  • D. None of the above

Questão 152

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

Questão 153

Questão
For the heap sort, access to nodes involves simple ____ operations
Responda
  • A. arithmetic
  • B. binary
  • C. algebraic
  • D. logarithmic

Questão 154

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

Questão 155

Questão
For the heap sort we store the tree nodes in
Responda
  • A. level-order traversal
  • B. in-order traversal
  • C. pre-order traversal
  • D. post-order traversal

Questão 156

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

Questão 157

Questão
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
Responda
  • A. O(1)
  • B. O(log(n))
  • C. O(n log(n))
  • D. O(n)

Questão 158

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

Questão 159

Questão
____ solution requires reasoning built on knowledge and experience
Responda
  • A. Algorithmic Solution
  • B. Heuristic Solution
  • C. Random Solution
  • D. None of these

Questão 160

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

Questão 161

Questão
___ is the first step in solving the problem
Responda
  • A. Understanding the Problem
  • B. Identify the Problem
  • C. Evaluate the Solution
  • D. None of these

Questão 162

Questão
___ is the last step in solving the problem
Responda
  • A. Understanding the Problem
  • B. Identify the Problem
  • C. Evaluate the Solution
  • D. None of these

Questão 163

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

Questão 164

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

Questão 165

Questão
The main measure for efficiency algorithm are ____.
Responda
  • A. Processor and Memory
  • B. Size and Capacity
  • C. Data and Space
  • D. Time and Space

Questão 166

Questão
What does the algorithmic analysis count?
Responda
  • 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

Questão 167

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

Questão 168

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

Questão 169

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

Questão 170

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

Questão 171

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

Questão 172

Questão
Which of the following case does not exist in complexity theory?
Responda
  • A. Best case
  • B. Worst case
  • C. Average case
  • D. Null case

Questão 173

Questão
The concept of order Big-Oh is important because
Responda
  • 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

Questão 174

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

Questão 175

Questão
The space factor when determining the efficiency of algorithm is measured by
Responda
  • 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

Questão 176

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

Questão 177

Questão
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.
Responda
  • 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)

Questão 178

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

Questão 179

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

Questão 180

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

Questão 181

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

Questão 182

Questão
O(f(n)) minus O(f(n)) is equal to
Responda
  • A. Zero
  • B. A constant
  • C. f(n)
  • D. O(f(n))

Quer criar seus próprios Quizzes gratuitos com a GoConqr? Saiba mais.

Semelhante

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
animal and plant cells
david doran
chapter 15
SN15
Developmental Psychology - Chapter 9
kylie-jamieson
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.
. .
Explore a Biblioteca