PTU B.Tech Computer 3rd Sem Paper 2012 Data Structures and Programming Methodology

PTU B.Tech Computer 3rd Semester Paper 2012 Data Structures and Programming Methodology Punjab Technical University Exam 2012 3rd Sem Data Structures and Programming Methodology Test September and March Question Paper Free Download Punjab Technical University Data Structures and Programming Methodology Question Papers 2012 PTU B.Tech Computer 3rd Semester Question Paper 2012 for all students Previous Year old Past Papers of PTU B.Tech Computer 3rd Sem Paper 2012 Data Structures and Programming Methodology Punjab Technical University September 2012 and March 2012 Exam B.Tech Computer 3rd Semester Sample Model Question Papers Free Download PDF

Data Structures and Programming Methodology

a) Define recursion. Which data structure is used to implement recursion?
b) Distinguish between BFS and DFS.
c) Define header link list. What is its advantage?
d) Discuss the sequential memory representation of binary trees.
e) What are priority queues? How they are implemented?
0 Write down the advantages and limitations of arrays.
g) What are variable length records.
h) Define a set. Discuss basic operations on set.
i) What are complete graph. Write any two applications of complete graph.
j) What is a queue. Discuss operations on queue.

Download PTU B.Tech 3rd Sem Paper Data Structures and Programming Methodology 2012

Similar Pages

 Others Pages..

PTU B.Tech Computer 3rd Sem Paper 2012 Data Structures and Programming Methodology


Click Here to Comment


Submit your review

Updated: June 15, 2013 — 9:20 am
CbseSamplePapers.org © 2013