Scribd
Upload
184 views

Data Structure Using C++

The document is a past examination paper for a data structures course. It contains 8 questions across two parts on various data structure topics: - Part A covers dynamic memory allocation in C++, linear lists, linked lists, diagonal matrices, Towers of Hanoi problem, stacks, queues, and image labeling. - Part B covers dictionary abstract data types, hash tables, binary trees and their traversals, heaps, leftist trees, histograms, binary search trees, and B-trees. Students are instructed to answer 5 full questions by selecting at least 2 from each part.

Uploaded by

Rohit Chandran
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
184 views

Data Structure Using C++

The document is a past examination paper for a data structures course. It contains 8 questions across two parts on various data structure topics: - Part A covers dynamic memory allocation in C++, linear lists, linked lists, diagonal matrices, Towers of Hanoi problem, stacks, queues, and image labeling. - Part B covers dictionary abstract data types, hash tables, binary trees and their traversals, heaps, leftist trees, histograms, binary search trees, and B-trees. Students are instructed to answer 5 full questions by selecting at least 2 from each part.

Uploaded by

Rohit Chandran
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

.

,
For More Question Papers Visit - www.pediawikiblog.com

USN 10EcrrE761

Seventh Semester B.E. Degree Examination, Dec.2016/Jan.2017

m
Data Structures Using C++

Time: 3 hrs. Max. Marks: 100

co
Note: Answer FIVE full questions, selecting
at least TWO questions from each part.

PART-A

g.
1 a. How dynamic memory allocation is performed in C++? Explain with suitable examples.
Vl (06 Marks)
'"
b. What is linear list? Write the abstract class specification of a linear list. (06 Marks)

lo
c. In linked list representation explain the class "chain", define member function for header,
for the class chain. (08 Marks)

2 a.
b.
ib
Write a C++ program to illustrate the class diagonal matrix.
Explain row major and column major mapping with a suitable example.
(12 Marks)
(08 Marks)
ik
3 a. Write a program to explain the concept of Towers of Hanoi problem, using recursive method
and using stacks. (10 Marks)
b. Write a C++ program for abstract class stack and explain. Write a program to explain the
concept of parenthesis matching. (10 Marks)
w

4 a. What are the abstract data type of queue? Write a C++ program to explain push and pop
methods oflinked queue. (08 Marks)
ia

b. Write a program to explain and implement image-component labeling with an example.


(12 Marks)
ed

PART-B
5 a. Give abstract data type specification for dictionary. Explain the method of sorted chain using
skip list representation. (12 Marks)
b. Develop the C++ class for has table to perform search and insert operation. (08 Marks)
.p

6 a. Define binary trees. State and prove any three properties of binary trees. (08 Marks)
b. Explain with C++ program the four traversal methods of binary tree. (12 Marks)
w

7 a. What is Max Heap? Write a program to initialize a max heap. (10 Marks)
b. Define height biased leftist tree. Write a C++ program to illustrate melding of two leftist
w

trees. (10 Marks)

8 a. What is histogramming? Write a C++ program to demonstrate simple histogramming.


w

(08 Marks)
o
-0 b. Write a program to insert an element with key K in a binary search tree. (08 Marks)
Z c. Define B- Tree of order m. List out the properties if the B- Tree is not empty. (04 Marks)
;::
~
o
0-
E *****

For More Question Papers Visit - www.pediawikiblog.com

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy