# DATA STRUCTURE - Computer Science Online Tests

## Data Structure: Basics

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

## Data Structure Test 4

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

## Data Structure: Sorting

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

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

## Data Structure Test 1

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

## Data Structure: Complexity

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

## Sorting, Infix Postfix

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

## Data Structure Test 2

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

## Binary Tree and Graphs

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

## Data Structure Test 3

Question 1: Pick the odd one out ...

## Elementary Data Structure

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

## Data Structure Test 4

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

## Data Structure: Graph

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

## Hashing

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

## DAA: Complexity

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

## Algorithms

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