Andhra University 2004 B.Sc Computer Science - Question Paper

Andhra University Model Paper
B.Sc Degree 2nd Year (Computer Science)

Time: three hours
Max. Marks: 100

Instructions
ans any 5 ques.
ques. No. one is compulsory.
All ques. carry equal marks.

1.
a) elaborate Memory Management Operators.
b) discuss kind Cast Operators.
c) What is Pointer.
d) What is Inheritance.
e) What is Abstract Base Class.
f) What is Time Complexity.
g) describe Complete Binary Tree.
h) What is a Graph.
i) Write any 2 Applications of Stacks

2.Differentiate ranging from Object Oriented Programming Languages and Structured Programming Languages and State the advantages and disadvantages for using Object Oriented Programming Languages.

3. define Security Constraints in C++

4. discuss Polymorphism and Dynamic Binding

5. discuss the Algorithm for Inserting an element into doubly Linked List and Circular Linked List.

6. a) What is the difference ranging from recursion and iteration? discuss with example.
b) Implement Queue using I) Arrays II) Linked List

7.
a) elaborate the applications of Binary Trees?
b) Write a program to create Binary Tree and display the contents of the tree using inorder tree traversal techniques.

8.
a) Write the algorithm for Prim's Minimal Spanning Tree
b) Write an algorithm that takes an adjacency matrix and return one if the graph is connected, returns 0 otherwise.

Earning:   Approval pending.