Data Structures

Abstract Data Types Algorithms Binary Heaps & Binary Search trees Graphs Hashing Linked Lists Queues Sorting & Searching Stacks Trees

C Programming MCQ Compiler Design Computer Graphics Computer Networks Computer Organization Architecture Data Mining Data Warehousing MCQ Database MCQ Digital Logic Mathematical Logic Object Oriented Programming Operating System Soft Computing Software Engineering MCQ Theory Of Computation MCQ Unix Web Technology Windows Programming MCQ

Data Structures - Algorithms

The concept of order (Big O) is important because

A.	it can be used to decide the best algorithm that solves a given problem
B.	it determines the maximum size of a problem that can be solved in a given system, in a given amount of time
C.	Both(a) and (b)
D.	none of the above
	Answer Report Discuss
	Option: C Explanation : Click on Discuss to view users comments. Write your comments here: Updating your Comments.. Updating your Comments..

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 is

A.	log n
B.	n
C.	n²
D.	nⁿ
	Answer Report Discuss
	Option: A Explanation : Click on Discuss to view users comments. Write your comments here: Updating your Comments.. Updating your Comments..

A text is made up of the characters a, b, c, d, e each occurring with the probability .12, .4, .15, .08 and .25 respectively. The optimal coding technique will have the average length of

A.	2.15
B.	3.01
C.	2.3
D.	1.78
	Answer Report Discuss
	Option: A Explanation : Using Hoffman's algorithm, code for a is 1111; b is 0; c is 110; d is 1110; e is 10. Average code length is 4 x.12 + 1 x .4 + 3 x.15 + 4 x.08 + 2 x.25 = 2.15 Click on Discuss to view users comments. raj said: (3:04am on Wednesday 5th June 2013) if code for a is 1111 then it must be multiplied by 15 i.e .12x15 refer link http://www.siggraph.org/education/materials/HyperGraph/video/mpeg/mpegfaq/huffman_tutorial.html Write your comments here: Updating your Comments.. Updating your Comments..

The running time of an algorithm is given by

T(n) = T(n - 1) + T(n - 2) - T(n - 3), if n > 3

n, otherwise.

A.	n
B.	log n
C.	nⁿ
D.	n²
	Answer Report Discuss
	Option: A Explanation : Let us find what is T(4), T(5), T(6) is. T( 4) = T(3) + T(2) - T(1) = 3 + 2 - 1 = 4 T(5) = T(4) + T(3) - T(2) = 4 + 3 - 2 = 5 T(6) = T(5) + T(4) - T(3) = 5 + 4 - 3 = 6 By induction it can be proved that T(n) = n. Hence order is n. Click on Discuss to view users comments. Write your comments here: Updating your Comments.. Updating your Comments..

10:

The order of an algorithm that finds whether a given Boolean function of 'n' variables, produces a 1 is

A.	constant
B.	linear
C.	logarithmic
D.	exponential
	Answer Report Discuss
	Option: A Explanation : Let T(1) = T(2) = T(3) = k (say). Then T(4) = k + k - k = k T(5) = k+ k- k= k. By mathematical induction it can be proved that T(n) = k, a constant. Click on Discuss to view users comments. Write your comments here: Updating your Comments.. Updating your Comments..

Sample Online Test

Computer System Architecture Test I/O Operations in C Operating System Unit Test 7 Unix Online Test 3 Sets & Relations Online Unit Test Trees

UGC NET Paper 1 UGC NET Computer Science UGC NET Exam GATE Exam Aptitude Viva Questions General Knowledge Computer Questions Online Test

Data Structures - Algorithms

Sample Online Test

Suggest an improvement

Data Structures quiz questions with answers

Data Structures exam questions answers

Data Structures MCQ questions Answers

Data Structures MCQ

Data Structure MCQ Pdf Download