DATA STRUCTURE - Computer Science Online Tests

Data Structure: Basics

Question 1: Which one is not divide and conquer algorithm ...

104 Comments. 2319 views since Sep 28, 2008

Data Structure Test 4

Question 1: A Linked list can grow and shrink in size dynamically at _______ ...

19 Comments. 543 views since Jun 3, 2009

Data Structure: Sorting

Question 1: The best sorting methods if no of swappings done, is the only measure of efficiency is ...

6 Comments. 412 views since Sep 10, 2008

Data Structure: Trees

Question 1: The smallest number of key that will force a B-tree of order 3 to have a height 3 is ...

5 Comments. 350 views since Sep 11, 2008

Data Structure Test 1

Question 1: Which among the following doesn?t work like a stack ...

6 Comments. 298 views since Aug 30, 2008

Data Structure: Complexity

Question 1: Quick sort’s worstcase Space complexity is…. ...

7 Comments. 245 views since Sep 30, 2008

Sorting, Infix Postfix

Question 1: The _________ sort divides the array into and unsorted sublists. ...

9 Comments. 215 views since Jul 5, 2008

Data Structure Test 2

Question 1: Construction of a Huffman tree requires the data structures ...

3 Comments. 214 views since Aug 30, 2008

Binary Tree and Graphs

Question 1: No of edges in a n-vertex complete graph is given by ...

7 Comments. 189 views since Aug 19, 2008

Data Structure Test 3

Question 1: Pick the odd one out ...

6 Comments. 186 views since Aug 30, 2008

Elementary Data Structure

Question 1: Which of the following is the feature of stack ...

6 Comments. 182 views since Aug 19, 2008

Data Structure Test 4

Question 1: Which of the following is not a data type group? , , Character & ...

10 Comments. 181 views since Apr 5, 2009

Data Structure: Graph

Question 1: What is true for the complete bipartite graphs K(3,3) and K(2,4) ? ...

3 Comments. 138 views since Sep 10, 2008

Hashing

Question 1: In perfect hashing techniques, if the worst case number of memory access required to perform a search in ______ time. ...

0 Comments. 102 views since Aug 21, 2008

DAA: Complexity

Question 1: T(n)=9T(n/3)+n ...

3 Comments. 89 views since Aug 22, 2008

Algorithms

Question 1: The Hamiltonian- path-problem can be solved in polynomial time on ...

1 Comments. 87 views since Aug 19, 2008