Sreenidhi Institute of Science & Technology A 10

(An Autonomous Institution)

Code No: 101CS01/111CS01
B. TECH. I – Year II – Semester Examinations, January, 2013 (Supplementary)
DATA STRUCTURES AND C++ (Common to all branches)
Time: 3 Hours Max. Marks : 70
Note : No additional answer sheets will be provided.
Part-A (Objective Type)
Max.Marks:20
ANSWER ALL QUESTIONS.
1. Define the term Abstract Data Type (ADT).
2. Define a graph and a digraph.
3. Explain double ended queue.
4. Explain principle difference between malloc and calloc.
5. List the operators which cannot be overloaded.
6. Explain push and pop operations of a stack.
7. What is a complete binary tree?
8. What is the difference between a friend function of a class and member function of a
class.
9. What is a function overloading.
10. Explain default constructor.
Part – B
Max. Marks: 50
ANSWER ANY FIVE QUESTIONS. EACH QUESTION CARRIES 10 MARKS.
1. a) Write a C program to implement stack operations with arrays. [6]
b) What are the applications of stacks? [4]
2. a) Discuss the advantages of one over the other between doubly linked list and
singly linked lists? Explain with examples. [5]
b) Explain constructors and destructors in C++. [5]
3. Write a C++ program to create a complex number class with the following operations.
i) Addition ii) Subtraction iii) Multiplication iv) Display complex number
4. a) Write a program to create a binary search tree and recursive traversal
methods for in-order, preorder and post - order traversals? [5]
b) Construct binary search tree using list of numbers : 4,5,1,2,9,7,3,6,10,12,11. [ 5 ]
5. Write an algorithm for minimum spanning tree for a graph and explain with a couple of
examples.
6. a) What is an inheritance explain different types of inheritances. [5]
b) Write a function template called swap for swapping for two numbers. [5]
7. Write a C functions to implement inorder traversal tree of a binary tree without using
recursion.
8. a) Explain merge sort with example? [6]
b) Write the differences between structured and OOPS. [4]
-- 00 -- 00 --

Page 1 of 1