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
1-Dont try to cram or spend more time here just read it fast and cover syllabus then practice MCQ's cheptor of same topic to check your progress. . |
2-Wrong options are also given but dont concentrate there, Right answer is in bold format. |
Q21 ⇒ The way a card game player arranges his cards as he picks them up one by one, is an example of insertion sort [other wrong options] [Discuss in forum] merge sort bubble sort selection sort |
Q22 ⇒ Queues serve major role in Simulation of limited resource allocation [other wrong options] [Discuss in forum] Simulation of arbitrary linked list Simulation of recursion All of above |
Q23 ⇒ You are asked to sort 15 randomly generated numbers. You should prefer Bubble sort [other wrong options] [Discuss in forum] Quick sort Selection sort Insertion sort |
Q24 ⇒ What is the postfix form of the following prefix expression -A/B*C$DE ABCDE$*/- [other wrong options] [Discuss in forum] A-BCDE$*/ ABC$ED*/- A-BCDE$*/- |
Q25 ⇒ The time complexity of linear search algorithm over an array of n elements is O(n) [other wrong options] [Discuss in forum] 0 (n2) O (log2 n) O(n log2 n) |
Q26 ⇒ If memory for the run-time stack is only 150 cells(words), how big can N be in Factorial(N) before encounterring stack overflow? 26 [other wrong options] [Discuss in forum] 13 31 45 |
Q27 ⇒ The postfix equivalent of the prefix * + a b - c d is ab+cd-* [other wrong options] [Discuss in forum] ab + cd * - ab + - cd * ab cd + - * |
Q28 ⇒ Using the standard algorithm, what is the time required to determine that a number n is prime ? Linear time [other wrong options] [Discuss in forum] Constant time Quadratic time Logarithmic time |
Q29 ⇒ Stack A has the entries a,b,c(with a on top). Stack B is empty.An entry popped out of stack A can be printed immediately or pushed to stack B.An entry popped out of the stack B can only be printed. In c a b [other wrong options] [Discuss in forum] b c a b a c c b a |
Q30 ⇒ A full binary tree with n leaves contains 2n - 1 nodes [other wrong options] [Discuss in forum] n nodes log2n nodes 2n+1 nodes |
Q31 ⇒ Which of the following sorting method is stable ? Straight insertion sort [other wrong options] [Discuss in forum] Shell sort Heap sort Binary insertion sort |
Q32 ⇒ An item that is read as input can be either pushed to a stack and later popped and printed, or printed directly. Which of the following will be the output if the input is the sequence of items 1, 2, 3 3, 4, 5, 2, 1 [other wrong options] [Discuss in forum] 1, 5, 2, 3, 4 3, 4, 5, 1, 2 5, 4, 3, 1, 2 |
Q33 ⇒ Number of possible binary trees with 3 nodes is 5 [other wrong options] [Discuss in forum] 7 9 11 |
Q34 ⇒ The average successful search time taken by binary search on a sorted array of 10 items is 2.9 [other wrong options] [Discuss in forum] 2.7 2.8 3 |
Q35 ⇒ A binary tree of depth "d" is an almost complete binary tree if both (a) and (b) [other wrong options] [Discuss in forum] for any node each leaf in the tree is either at level None of these |
Q36 ⇒ Which of the following sorting methods will be the best if number of swappings done, is the only measure of efficienty? Selection sort [other wrong options] [Discuss in forum] Quick sort Bubble sort Insertion sort |
Q37 ⇒ B+- trees are preferred to binary trees in databases because Disk access is much slower than memory Access [other wrong options] [Discuss in forum] Disk capacities are greater than memory capacities Disk data transfer rates are much less than memory data transfer rates All of above |
Q38 ⇒ Which of the following types of expressions does not require precedence rule when evaluated? More than one of these [other wrong options] [Discuss in forum] Prefix expression Full parenthesized infix expression Partially parenthesized infix expression |
Q39 ⇒ In eveluating the arithmetic expression 2*3-(4+5),using stacks to evaluate its equivalent postfix form, which of the following stack configuration is not possible? 9 3 2 [other wrong options] [Discuss in forum] 4 6 9 6 5 4 6 |
Q40 ⇒ Stack is useful for implemeting both (a) and (b) [other wrong options] [Discuss in forum] recursion depth first search breadth first search |
Or |