D

Naming convention for variable is followed in company because ____.

The true and false values represent ____.

Following operator distinguishes equation from expression

Following are called logical operators

Evaluate 5*(x+y)-4*y/(z+6) where x = 2, y = 3, and z = 6

Evaluate a-2>b where a=6, b = 8

Evaluate for a = 5, b = 4, c = 3, d = 12 for the equation E = a*b+d/c

Evaluate for the equation e = 5*a\d*(b+1) where a = 5, b = 4, c = 3, d = 12

The most important reason for including a destructor in a class is:

Which of the following name does not relate to stacks?

Which of the following data structure is linear type?

An algorithm that calls itself directly or indirectly is known as

The help menus or user manuals are the part of ____.

The correctness and appropriateness of ___ solution can be checked very easily.

Memorization is

The time complexity of linear search is _____.

The time complexity of binary search is _____.

What is the asymptotic runtime for traversing all nodes in a binary search tree with n nodes and printing them in order?

The number of nodes in a complete binary tree of height h is

Divide-and-conquer as breaking the problem into a small number of

The sub problems in Divide and Conquer are considered to be

For the sieve technique we solve the problem,

The sieve technique works in ____ as follows

The sieve technique is a special case, where the number of sub problems is just

The reason for introducing Sieve Technique algorithm is that it illustrates a very important special case of,

Sieve Technique applies to problems where we are interested in finding a single item from a larger set of ____

For the Sieve Technique we take time

How many passes are required to sort a file of size n by bubble sort method?

The worst-case time complexity of Bubble Sort is ____.

Which of the following sorting procedures is the slowest?

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

How many number of comparisons are required in insertion sort to sort a file if the file is sorted in reverse order?

How many number of comparisons are required in insertion sort to sort a file if the file is already sorted?

Which of the following sorting methods would be most suitable for sorting a list which is almost sorted?

!!!
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

The running time of insertion sort is

A sort which compares adjacent elements in a list and switches where necessary is ____.

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

The way a card game player arranges his cards as he picks them one by one can be compared to

Which among the following is the best when the list is already sorted?

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

When is insertion sort a good choice for sorting an array?

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)

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

The worst-case time complexity of Merge Sort is ____.

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?

How much time merge sort takes for an array of numbers?

Merge sort makes two recursive calls. Which statement is true after these recursive calls finish, but before the merge step?

What is the worst-case time for merge sort to sort an array of n elements?

In quick sort, the number of partitions into which the file of size n is divided by a selected record is

The worst-case time complexity of Quick Sort is ____.

The algorithm like Quick sort does not require extra memory for carrying out the sorting procedure. This technique is called ____.

In quick sort, the number of partitions into which the file of size n is divided by a selected record is

The total number of comparisons made in quick sort for sorting a file of size n, is

Quick sort efficiency can be improved by adopting

For the improvement of efficiency of quick sort the pivot can be

Quick sort is the fastest available method of sorting because of

Quick sort is

One example of in place but not stable algorithm is

In Quick Sort Constants hidden in T(n log n) are

The running time of quick sort depends heavily on the selection of

!!!!!!
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?

Quick sort is solved using

The worst-case time complexity of Selection Exchange Sort is ____.

Straight selection sort is basically a method of repeated

Number of selections required to sort a file of size N by straight selection requires

For sorting a file of size n by straight selection sort, the number of comparisons made in the first pass is

""
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

??
In the analysis of Selection algorithm, we make a number of passes, in fact it could be as many as,

??
Analysis of Selection algorithm ends up with

The analysis of Selection algorithm shows the total running time is indeed ____ in n,

How many elements do we eliminate in each time for the Analysis of Selection algorithm?

In a selection sort of n elements, how many times is the swap function called in the complete execution of the algorithm?

Selection sort and quick sort both fall into the same category of sorting algorithms. What is this category?

Slow sorting algorithms run in

The correct order of the efficiency of the following sorting algorithms according to their overall running time comparison is

In which order we can sort?

Which sorting algorithm is faster

Continuation sort is suitable to sort the elements in range 1 to k

In stable sorting algorithm.

Which may be a stable sort?

An in place sorting algorithm is one that uses ___ arrays for storage

We do sorting to

Sorting is one of the few problems where provable ____ bonds exits on how fast we can sort

In in-place sorting algorithm is one that uses arrays for storage

Which may be stable sort

The operation of processing each element in the list is known as

Other name for directed graph is

Binary trees with threads are called as

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.

In Binary trees nodes with no successor are called

A connected graph T without any cycles is called

Trees are said ____ if they are similar and have same contents at corresponding nodes.

Every node N in a binary tree T except the root has a unique parent called the ____ of N.

In a graph if E=(u,v) means

Sequential representation of binary tree uses

In a graph if e=[u,v], Then u and v are called

TREE[1]=NULL indicates tree is

A binary tree whose every node has either zero or two children is called

Linked representation of binary tree needs ____ parallel arrays.

The depth of complete binary tree is given by

In a 2-tree, nodes with 0 children are called

Which indicates pre-order traversal?

In a extended-binary tree nodes with 2 children are called

A terminal node in a binary tree is called

The post order traversal of binary tree is DEBFCA. Find out the pre order traversal.

While converting binary tree into extended binary tree, all the original nodes in binary tree are

The in-order traversal of tree will yield a sorted listing of elements of tree in

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

In a head tree

The in order traversal of tree will yield a sorted listing of elements of tree in

In a graph if e=(u,v) means

A binary tree whose every node has either zero or two children is called

If every node u in G is adjacent to every other node v in G,A graph is said to be

The post order traversal of a binary tree is DEBFCA. Find out the pre order Traversal.

In a graph if e=[u,v], then u and v are called

In-order traversing a tree resulted E A C K F H D B G; the pre-order traversal would return.

In linked representation of Binary trees LEFT[k] contains the ____ of at the node N, where k is the location.

If every node u in G adjacent to every other node v in G, A graph is said to be

Three standards ways of traversing a binary tree T with root R

A graph is said to be ____ if every node u in G is adjacent to every other node v in G.

In threaded binary tree ____ points to higher nodes in tree.

A graph is said to be ____ if its edges are assigned data.

If node N is a terminal node in a binary tree then its

A directed graph is ____ if there is a path from each vertex to every other vertex in the digraph.

In the ____ traversal we process all of a vertex's descendants before we move to an adjacent vertex.

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.

The number of comparisons done by sequential search is

In ____, search start at the beginning of the list and check every element in the list.

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).

Which of the following is not the internal sort?

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.

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.

In a queue, the initial values of front pointer f rare pointer r should be ____ and ____ respectively.

In a circular queue the value of r will be

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.

The advantage of ____ is that they solve the problem if sequential storage representation. But disadvantage in that is they are sequential lists.

What will be the value of top, if there is a size of stack STACK_SIZE is 5

____ is not the operation that can be performed on queue.

There is an extra element at the head of the list called a

A graph is a collection of nodes, called ____ And line segments called arcs or ____ that connect pair of nodes.

A ____ is a graph that has weights of costs associated with its edges.

In general, the binary search method needs no more than ____ comparisons.

In depth first search algorithm the number of recursive calls we have to make are

In a graph if e=(u,v) means

Heap is defined to be a

In a Max heap the largest key is at

In heap sort the input is arranged in the form of a

Heap sort is found to be very efficient

For the heap sort, access to nodes involves simple ____ operations

A (an) ____ is a left-complete binary tree that conforms to the heap order

For the heap sort we store the tree nodes in

One of the clever aspects of heaps is that they can be stored in arrays without using any ____.

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

The six-step solution for the problem can be applied to problems (I) with Algorithmic solution or (II) with Heuristic solution

____ solution requires reasoning built on knowledge and experience

The branch of computer that deals with heuristic types of problem is called ____.

___ is the first step in solving the problem

___ is the last step in solving the problem

Following is true for understanding of a problem

While solving the problem with computer the most difficult step is ____.

The main measure for efficiency algorithm are ____.

What does the algorithmic analysis count?

!!!
Examples of O(1) algorithms are ____.

Examples of O(n^2) algorithms are ____.

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?

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?

Express the formula (n-1)*(n-5) in terms of big-Oh notation

Which of the following case does not exist in complexity theory?

The concept of order Big-Oh is important because

The recurrence relation capturing the optimal execution time of the Towers of Hanoi problem with n discs is

The space factor when determining the efficiency of algorithm is measured by

The time factor when determining the efficiency of algorithm is measured by

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.

If Total complexity after analysis is (5n^3 + 10n^2 + 100n + 400log(n) + 10), the Big-Oh complexity is

In Strassen's Multiplication Algorithm the T(n) is

T(n) = 4T(n/2) + n, then in Big Oh Notation it is