PTU MCA 3rd Sem Paper 2009 Data Structures

PTU MCA 3rd  Semester Paper 2009 Data Structures  Punjab Technical University Exam 2009 3rd  Sem Data Structures Test September and March Question Paper Free Download Punjab Technical University Data Structures Question Papers 2009 PTU MCA  3rd  Semester Question Paper 2009 for all students Previous Year old Past Papers of PTU MCA  3rd  Sem Paper 2009 Data Structures Punjab Technical University September 2009 and March 2009 Exam MCA  3rd  Semester Sample Model Question Papers Free Download PDF

Data Structures
Time :- 3 Hours
Maximum Marks :- 75

1)  What is meant by complexity of algorithm?
2)  What are the different data structure operations?
3)  Briefly discuss operations of stacks.
4)  What are advantages of linked lists?
5)  How is memory allocation of a 2—D array done’?
6)  Differentiate complete binary tree and extended binary tree.
7)  What is the complexity of binary search tree?
8)  What is the difference between in-order and post-order traversing’?

Download PTU MCA 3rd  Sem  Data Structures Question Paper 2009

Similar Pages

Click Here for Latest Papers  Recent Updated Pages

PTU MCA 3rd  Sem Paper 2009 Data Structures


Click Here to Comment


Submit your review

Updated: June 14, 2013 — 2:13 pm
CbseSamplePapers.org © 2013