Trending ▼   ResFinder  

PUNJAB TECHNICAL UNIVERSITY MCA - II (SEM 3) SEP 2010 : 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) MCA (302) (S05) (O) (LE) (Sem. - 3rd) DATA STRUCTURES Time : 03 Hours Maximum Marks : 75 Instruction to Candidates: 1) Section - A is Compulsory. 2) Attempt any Nine questions from Section - B. Section - A Q1) (15 2 = 30) a) What is a Queue? Write applications of queue. b) Define link list. How it is represented in memory. c) What is a data structure? Give example. d) Compare single and double linked list. e) Discuss mathematical notations used for algorithms complexity. f) Discuss the sequential representation of a tree. g) What kinds of rotations are possible in an AVL tree? h) What are AVL trees? Write main properties of AVL trees. i) What is a heap? How elements are inserted in a heap? j) How you can delete a node from an existing binary tree. k) Distinguish between linear and binary search techniques. l) Discuss the concept of merge sort. m) Discuss Quick sort. n) o) A-530 Differentiate between BFS and DFS. Define Graph. How it is represented in memory? P.T.O. Section - B Q2) (9 5 = 45) What do you mean by stack? Explain various operations of stack. Q3) Write an algorithm to insert a new node after a given location in the one-way link list. Q4) Explain the algorithmic complexity and time space trade off. Q5) Compare array and linked list data structures. Q6) Write algorithm for heap sort and explain the same with example. Q7) Compare contiguous and linked memory representation of binary tree. Q8) Write algorithms to insert a new node in a given binary tree. Q9) What is a binary tree? Explain binary tree traversals with the help of an example. Q10) Explain the Dijkstra s shortest path algorithm with the help of an example. Q11) Write an algorithm for Selection sort and discuss the same with the help of an example. Q12) What is hashing? Discuss various hash functions with example. Q13) Explain the binary search algorithm using a suitable example. kbkb A-530 2

Formatting page ...

 

  Print intermediate debugging step

Show debugging info


 

Additional Info : Mca - II (sem 3) September 2010 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 - 2025 ResPaper. Terms of ServiceContact Us Advertise with us

 

mca_india chat