FDS-CS8393 BME MODEL QP2.doc
This document contains a model examination for a Computer Science and Engineering subject with 3 parts: Part A contains 10 short answer questions covering topics like the differences between an interpreter and compiler, modulo and sizeof operators, advantages of pointers, structure definition, dequeue data structure, evaluating expressions using a stack, defining binary trees and ways to represent them, defining graphs and ways to represent them, and the time complexity of quicksort and binary search. Part B contains 5 long answer or program questions covering multiplying 3x3 matrices, sorting algorithms and writing a sorting program, storage classes in C with an example, implementing an employee payroll system using unions, implementing stacks and queues using linked lists, operations on singly linked lists, representing binary
FDS-CS8393 BME MODEL QP2.doc
- 1. SMK FOMRA INSTITUTE OF TECHNOLOGY Department of Computer Science and Engineering Sub. Name:FDS Sub. Code: EC8393 Max. Marks: 100 Time: 3 hrs Department: BME Sem/Year: 04/II Date: -06-2021 MODEL EXAMINATION Answer ALL Questions Part A – ( marks) 1. Difference between interpreter and compiler? 2. What is a Modulo Operator? What is the use of sizeof( ) operator? 3. What are the advantages of using pointers in a program? 4. Give syntax for structure definition. 5. What is a DEQUEUE? 6. Evaluate the value of the expression ab+c*d- using stack. 7. Define Binary tree. What are the two ways of representing binary tree? 8. What is a graph? List the two ways to represent a graph 9. What is the time complexity of Quick sort and Binary search 10. Set the drawbacks of insertion sort. Part B – (5 X 13 = 65 marks) 11. Write a C program to multiply two 3*3 matrices. OR What is sorting? Write short notes on its types. Write a Program to Sort a set of numbers. 12. Explain various storage classes used in C with example program in detail. OR Write algorithm and a C program using unions, to prepare the employee pay roll of a company. 13. Explain linear linked implementation of stack and queue. OR Implement insertion, deletion and search operations in singly linked list. 14. How can binary trees be represented using arrays? Write algorithm for finding Kth element, inserting and deleting an element in binary tree with example program. OR With necessary algorithms, explain the two graph traversalmethods. Demonstrate with examples. 15. Write a C code and explain the implementation of linear search algorithm with an example. OR Define Heap Sort. Write the algorithm for heap sort procedures. Part C – (1 X 15 = 15 marks) 16. Explain in detail the concept of pointer in C language.