Trending ▼   ResFinder  

PUNJAB TECHNICAL UNIVERSITY MCA - II (SEM 3) MAY 2008 : Data Structures

2 pages, 27 questions, 0 questions with responses, 0 total responses,    0    0
mca_india
   		+Fave Message
ProfileTimelineUploadsQ & A
 Home > mca_india >

Formatting page ...

Roll No. ...................... Total No. of Questions : 13] [Total No. of Pages : 02 Paper ID [A0512] (Please fill this Paper ID in OMR Sheet) B.Sc. (IT) (MCA - 202/302) (O) (S05) (Sem. - 3rd ) DATA STRUCTURES Time : 03 Hours Maximum Marks : 75 Instruction to Candidates: 1) 2) Section - A is Compulsory. Attempt any Nine questions from Section - B. Section - A (15 2 = 30) Q1) a) What is meant by complexity of algorithm? b) What are the different data structure operations? c) Briefly discuss operations of stacks. d) What are advantages of linked lists? e) How is memory allocation of a 2-D array done? f) Differentiate complete binary tree and extended binary tree. g) What is the complexity of binary search tree? h) What is the difference between in-order and post-order traversing? i) Differentiate between tree and graph. j) What is the advantage of binary search algorithm? k) List applications of graph. l) How many edges are there in a complete graph with n nodes? m) What is the complexity of heap sort algorithm? n) What is the difference between breadth first search and depth first search? o) What is direct graph? D-545 P.T.O.

Formatting page ...

 

  Print intermediate debugging step

Show debugging info


 

Additional Info : Mca - II (sem 3) May 2008 Question Paper - Data Structures
Tags : mca exam papers, mca question papers, ignou mca question papers, ptu mca question papers, mca sample question paper, mca mumbai university question papers, mca exam syllabus, mca exam question paper, online mca exam papers, online mca exam preparation, mumbai university mca question papers, ignou university mca question papers  

© 2010 - 2024 ResPaper. Terms of ServiceContact Us Advertise with us

 

mca_india chat