www.pdfquestion.in

Name of the University : Alagappa University
Degree : B.Sc
Department : Computer Science
Subject Code/Name : Programming in C And Data Structures
Semester : I
Document Type : Model Question Papers/Previous Exams Question Papers
Website : alagappauniversity.ac.in

Download Model/Sample Question Paper : Nov 2010 : https://www.pdfquestion.in/uploads/alagappauniversity.ac.in/3978.-B.Sc.COMPUTER%20SCIENCE%20CBCS.pdf

Alagappa University Programming in C Questions Papers

Time : 3 Hours
Maximum : 75 Marks
Part A :

Related : Alagappa University Unix And Programming B.Sc Model Question Papers : www.pdfquestion.in/4026.html

Answer all questions. :
1. What is constant – Mention its types.
2. What is the purpose of Break Statement –
3. How one dimensional arrays are declared –
4. Can addresses of memory locations be stored – If so, where –
5. What are the uses of structure data type –
6. What are the different modes of files –
7. Convert the infix expression into reverse Polish notation.
8. Write the advantages of linked list.
9. What is the maximum number of nodes on a binary tree of level i –
10. Give the outcome of preorder traversal of a binary tree.

Part B : (5 × 5 = 25)
Answer all questions.
11. (a) Explain the switch statement with an example. (Or)
(b) Describe the bit-wise operators available in C.
12. (a) What is character array ? How will you initialize a character array ? (Or)
(b) Differentiate between static and dynamic memory allocation.
13. (a) Explain a self-referential structure. (Or)
(b) How can you open and close a file ?
14. (a) Describe the basic operations performed on queue. (Or)
(b) Write an algorithm to insert a node at the front of the linked list.
15. (a) Explain the linked representation of a binary tree. (Or)
(b) Write an algorithm for pest order traversal.

Part C : (3 × 10 = 30)
Answer any three questions.
16. Describe the different storage classes available in C.
17. Write a program in C to find the product of two matrices.
18. Write a program in C to copy the content of one file to another.
19. What is stack ? Describe the operations performed on stack. Also write the algorithm for the same.
20. Describe the applications of trees.

Programming In C++ & Algorithms

(CBCS—2008 onwards)
Duration : 3 Hours
Maximum : 75 Marks
Section – A (10 × 2 = 20)
Answer all questions.
1. What is the class ?
2. How do you define constant pointer ?
3. What is dynamic constructor ?
4. What are general format of copy constructor ?
5. What is private member inheritance ?
6. What are the rules for virtual function ?
7. Define : Depth–First–Search algorithm.
8. What is meant by selection sorting ?
9. What is coin changing problem ?
10. What is the longest–common–subsequence problem ?

Section – B : (5 × 5 = 25)
Answer all questions.
11. (a) How can you define member functions ? Explain it. (Or)
(b) Discuss the memory management operators.
12. (a) What is destructor ? Explain it with an example. (Or)
(b) What is the role of copy constructors ? Give a program for it.
13. (a) Write a program to overload ‘*’ operator to perform scalar multiplication of a vector using friend function. (Or)
(b) Explain with example, the virtual functions.
14. (a) Explain the binary search. (Or)
(b) Describe the quicksort knapsack algorithm.
15. (a) Explain the continuous knapsack algorithm. (Or)
(b) Discuss the Floyal and Warshall algorithm.

Section – C : (3 × 10 = 30)
Answer any three questions.
16. Briefly describe the control structures available in C++.
17. Write a C++ program to implement construtor concept for student details.
18. Explain the operator overloading wi th an example.
19. What is backtracking algorithm ? Write a C++ program for the same algorithm.
20. Write Dijkstra’s algorithm and implement it using C++.

Database Management System

(CBCS—2008 onwards)
Duration : 3 Hours
Maximum : 75 Marks
Section – A (10 × 2 = 20)
Answer all questions.
1. Define Database.
2. Name any two entities and its attributes in a Banking system.
3. What is meant by functional dependency ?
4. List any two features for designing relational database.
5. How the networks are classified ?
6. When a database is Interquery parallelism ?
7. Define Schema.
8. What is meant by an object ?
9. Define Trigger.
10. Give the function of a Cursor.

Section – B : (5 × 5 = 25)
Answer all the questions.
11. (a) Mention the purpose of having database system. (Or)
(b) List the design issues related with E-R diagram.
12. (a) With an example, discuss on First Normal Form. (Or)
(b) Explain the concept of mul ti valued dependencies.
13. (a) List the characteristics of parallel systems. (Or)
(b) How homogeneous database differs from heterogeneous database ?
14. (a) Explain the concept of data integrity. (Or)
(b) Give the purpose of Indexing.
15. (a) With an example, show how queries are answered in SQL. (Or)
(b) Discuss on any five built-in functions in SQL