Users Also Read

Read MCQ's/Objective questions

MCQ's Search Engine

Important Question

ASP.NET

Basic Computer Knowledge

Basic of Linux/Unix

C Language

C# Programming

C++ Programming

Computer Graphics

Computer Hardware

Computer Networking

Computer Security - Cyber crime & Laws

Database Management System

Digital Computer Electronics

HTML

Important File Extensions

Imp. Shortcut Keys used in Computer

Internet, Web & Email

Java - Concepts and Its Programming

Language Processors

Management Information System (MIS)

MS Access

MS Excel

MS Word

Operating System

Oracle, SQL & PL/SQL

PHP Basic

Power Point

Programming Languages

Software Engineering

System Analysis and Design (SAD)

System software & compiler design

Tally

VB.NET

Visual Basic

**Home⇒ Computer Engineering⇒ Data structures and algorithms**

:- You can add tough questions into
your favourite list for second revision. Note |

Q1 ⇒ An ADT is defined to be a mathematical model of a user-defined type along with the collection of all ____________ operations on that modelPrimitive[other wrong options] [Discuss in forum] Structured Cardinality Assignment |

Q2 ⇒ Which of the following algorithms solves the all-pair shortest path problem?Floyd's algorithm[other wrong options] [Discuss in forum] Prim's algorithm Dijkstra's algorithm Warshall's algorithm |

Q3 ⇒ The running time of an algorithm T(n),where 'n' is the input size, of a recursive algorithm is given as follows.is given by T(n) =c + T(n - 1), if n > 1 d, if n ≤ 1 The order of this algorithm isn[other wrong options] [Discuss in forum] n+1 n-1 n*1 |

Q4 ⇒ The concept of order (Big O) is important becauseall of the above[other wrong options] [Discuss in forum] it can be used to decide the best algorithm that solves a given problem it determines the maximum size of a problem that can be solved in a given system, in a given amount of time none of these |

Q5 ⇒ The order of an algorithm that finds whether a given Boolean function of 'n' variables, produces a 1 isconstant[other wrong options] [Discuss in forum] linear exponential logarithmic |

Q6 ⇒ Which of the following is useful in traversing a given graph by breadth first search?Queue[other wrong options] [Discuss in forum] set List stacks |

Q7 ⇒ Which of the following need not to be a binary tree ?B-Tree[other wrong options] [Discuss in forum] Heap AVL-Tree Search tree |

Q8 ⇒ Which of the following data structure may give overflow error,even though the current number of element in it is less than its size?Circular queue[other wrong options] [Discuss in forum] Simple queue Priority Queues None of these |

Q9 ⇒ Which of the following is a collection of items into which items can be inserted arbitrarity and from which only the smallest item can be removed?Ascending priority queue[other wrong options] [Discuss in forum] Fifo queue Descending priority queue None of these |

Q10 ⇒ Representation of data structure in memory is known as:Abstract data type[other wrong options] [Discuss in forum] Recursive File structure Storage structure |

Q11 ⇒ The time required to search an element in a linked list of length n isO(n)[other wrong options] [Discuss in forum] O(1) 0 (n2) O(log2 n) |

Q12 ⇒ Which of the following sorting algorithm has the worst time complexity of n log(n)?Heap sort[other wrong options] [Discuss in forum] Quick sort Selection sort Insertion sort |

Q13 ⇒ An algorithm is made up of 2 modules Ml and M2. If order of M1 is f(n) and M2 is g(n) then the order of the algorithm ismax (f (n) ,g (n))[other wrong options] [Discuss in forum] f (n) + g (n) f (n) x g (n ) min (f (n) ,g (n) ) |

Q14 ⇒ Which of the following is false ?For a serial search to work, the data in the array must be arranged in either alphabetical or numerical order[other wrong options] [Discuss in forum] A serial search begins with the first array element A serial search is useful when the amount of data that must be search is small A serial search continues searching, element by element, either until a match is found or until the end of the array is encountered |

Q15 ⇒ The average search time of hashing, with linear probing will be less if the load factoris far less than one[other wrong options] [Discuss in forum] equals one is far greater than one none of these |

Q16 ⇒ The time complexity of an algorithm T(n), where n is the input size, is given by T( n) = T( n - 1) + 1/n if n > 1 The order of this algorithm islog n[other wrong options] [Discuss in forum] n n+1 n-1 |

Q17 ⇒ Which of the following best describes sorting ?Arranging the data (record) in some given order[other wrong options] [Discuss in forum] Adding a new record to the data structure Finding the location of the record with a given key Accessing and processing each record exactly once |

Q18 ⇒ If the binary search algorithm determines that the search argument is in the lower half of the array, which of the following statements will, set the appropriate variable to the appropriate value?start Sub = middle Sub + 1;[other wrong options] [Discuss in forum] stop Sub = middle Sub - 1; stop Sub = middle Sub + 1. start Sub = middle Sub - 1; |

Q19 ⇒ The minimum number of colors needed to color a graph having n (>3) vertices and 2 edges is2[other wrong options] [Discuss in forum] 1 3 4 |

Q20 ⇒ The average successful search time for sequential search on 'n' items is(n+1)/2[other wrong options] [Discuss in forum] n/2 (n-1)/2 log (n)+1 |

Or |