VALLIAMMAI ENGINEERING COLLEGE

Transcription

1 VALLIAMMAI ENGINEERING COLLEGE SRM Nagar, Kattankulathur 0 0 DEPARTMENT OF INFORMATION TECHNOLOGY & COMPUTER SCIENCE AND ENGINEERING QUESTION BANK II SEMESTER CS0 PROGRAMMING AND DATA STRUCTURES I (Common to IT & CSE) Regulation 01 Academic Year 01 1 Prepared by Mr. R.Umanesan, Assistant Professor/IT) Ms. R.Shanthi, Assistant Professor/IT) Mr. G.Vivekanandan, Assistant Professor/GE)

2 VALLIAMMAI ENGINEERING COLLEGE SRM Nagar, Kattankulathur 0 0. DEPARTMENT OF INFORMATION TECHNOLOGY_& COMPUTER SCIENCE AND ENGINEERING SUBJECT QUESTION BANK : CS0 PROGRAMMING AND DATA STRUCTURES I SEM / YEAR: II / I UNIT I - C PROGRAMMING FUNDAMENTALS- A REVIEW Conditional statements Control statements Functions Arrays Preprocessor - Pointers - Variation in pointer declarations Function Pointers Function with Variable number of arguments PART - A Q.N o Questions BT Level Competence 1 List out the Conditional and Control statements in C. What is a preprocessor? Give any two examples. What is a pointer to pointer? 4 What are the primitive data types in C? What are function pointers in C? Explain with example. Define an array and give an example. Give an example on call by reference. 8 Give two examples for C preprocessors with syntax. Differentiate iteration and recursion. 10 Distinguish between library function and user defined function. Calculate the output of the following program: int k; 11 int num = 0; k = num>? (num<= 10? 100:00):00; printf ( "k = %d\n", k ); 1 Show the pointer variable initialization with an example. 1 Illustrate the structure of a C Program. Differentiate between a while and do..while statement. 1 1 Analyze the following code and predict the output: for(i=0;i<10;i++) { if(!(i/)) continue; printf( %d \t,i); } With the help of printf function, Explain how C handles functions with variable number of arguments. 1 Compare the working of array and Functions. BTL- Evaluating R.U, R.S & G.V CS0-PDS I Page

3 18 Summarize the working of pointers. BTL- Evaluating 1 Develop a simple C program using functions. BTL- Creating 0 Develop a simple C program using pointers. BTL- Creating 1 PART - B a. Describe the conditional statements available in C with an example. (8) b. Describe the loop statements available in C with an example. (8) Describe about pointers, and how the pointer variables are declared with an example. (4+1) Label the structure of C program and explain in detail.(+10) Distinguish between the following: i. Actual and Formal arguments. () ii. Global and Local variables. () iii. Automatic and Static variables. () iv. Scope and Visibility of variables. () v. & operator and * operator. (4) Describe the ways of passing parameters to functions with an example. (8 + 8) a. Analyze and Write a Function that returns a pointer to the maximum value of an array of double s.if the array is empty return NULL. Double *maximum(double *a,int size); (8) b. Analyze and Write a C Program to find all the roots of a Quadratic equation. (8) a. Analyze and write a C Program using function to check if the given input number is Palindrome or not.(8) b. Explain the C Preprocessor operators, each with an example that is used to create Macros.(8) Illustrate and explain about the following with an example. i. Function with number of arguments. (8) ii. Function with pointers. (8) a. Write and explain a C program to find the unique elements in an array using a function unique. The function takes the array as a parameter and prints the unique elements. (8) b. Write and explain a C Program to print the Fibonacci numbers without using recursion. (8) Create a C Program to multiply two matrices that are represented as pointers. Use a function to the function multiply which takes the two matrices as parameters and prints the result of the multiplication. (1) a. Illustrate the various control structures used in C with suitable example. (10) b. Write a C program to implement the following string handling functions using function & pointers. () i. strlen( ) ii. strcat( ) iii. strcpy( ) BTL- BTL- Evaluating Creating R.U, R.S & G.V CS0-PDS I Page

4 1 1 Describe the following : a. Write a C program to print the Fibonacci series using recursion () b. Write a C program with functions & pointers to add two matrixes and return the resultant matrix to the calling function. (10) Explain the array types with an example program for each type. (1) a. Describe in detail about the Preprocessors in C. (8) b. Develop a C program to print the even numbers between 1 to 100. (8) UNIT II - C PROGRAMMING ADVANCED FEATURES Structures and Unions - File handling concepts File read write binary and Stdio - File Manipulations Q.N o Questions PART - A BT Level Competence 1 What is an array of structure and give an example. What is slack byte? What is a file? List out the file handling functions. 4 What are the common uses of rewind() and ftell() functions? List the similarities and differences between structure and union. What is a pointer variable and what are the uses of pointer variable? Distinguish between getc() and getw(). 8 Distinguish getchar() and putchar(). Give the applications in which unions rather than structures can be used. 10 Distinguish between fread() and fwrite(). 11 Show the working of a syntax as given below: Fread(&my_record,sizeof(struct rec),1,ptr_myfile); 1 Illustrate the need of union in C. 1 Illustrate the need of structures in C. When a program is terminated, all the files used by it are automatically closed. Analyze why it is then necessary to close a file during execution of the program. 1 Point out the modes of operation used in file. 1 Compare fseek() and ftell() function. R.U, R.S & G.V CS0-PDS I Page 4

5 1 Will the following declaration work. Explain with justification for your answer: Struct Student { int rollno = 1; BTL- Evaluating float marks [] = {,0,); char gender; }; 18 Compare and Evaluate the working of structures and union. BTL- Evaluating 1 Develop a simple C program using Structures. BTL- Creating 0 Develop a Simple C Program using file modes. BTL- Creating PART - B Explain and Describe the following: i. Structure (8) ii. Union. (8) Explain and describe the string handling functions with examples. (1) Describe the following file manipulation functions with examples. a) rename() () b) freopen() () c) remove() () d) tmpfile(void) (4) e) fflush() () Distinguish between the following functions. a) getc() and getch() (4) b) scanf() and fscanf() (4) c) printf() and fprintf() (4) d) feof() and ferror() (4) Compare and Contrast structures and unions with an example program. (1) Illustrate and explain a C program to copy the contents of one file into another. (1) Explain the different file manipulations with a suitable program. (1) Analyze and design a structure student record to contain name, DOB, total marks obtained. Develop a program to read data for 10 students in a class and list them rank-wise. (4+1) a. Write and explain a C program that uses functions to perform the following operations using structure. (1) 1. Reading a complex number. Writing a complex number. Addition of two complex numbers 4. Multiplication of two complex numbers. b. Summarize the advantages and disadvantages of structures and unions in C Programming. (4) BTL- Evaluating R.U, R.S & G.V CS0-PDS I Page

6 10 a. Develop and Perform the following to manipulate file handling using C. (1) 1. Define an input file handle called input_file, which is a pointer to a type FILE..Using input_file, open the file results.dat for read mode. Write C statements which tests to see if input_file has opened the data file successfully if not, print an error message and exit the program. 4. Write a C Code which will read a line of characters (terminated by a \n) from input_file into a character array Called buffer. NULL terminate the buffer upon reading a \n..close the file associated with input-file b. Develop a C program to display the contents of a file on a screen. (4) BTL- Creating a. Discuss about the file handling concepts in C. (8) b. Explain different ways to read data from a file. (8) Explain a structure data type named date containing three integer members day, month and year. Develop an interactive modular program to perform the following tasks: 1. To read the data into structure members by a function. (8). To print the date in the following format: April 1, 011 by a second function. (8) Describe the functions fscanf, fprintf, fgets, fputs, getw, putw, getc, putc, fread, fwrite, feof, ferror, fseek, ftell, rewind with an example. (1) Illustrate a C program to create the employee database and to perform the manipulations such as adding a record, deleting a record, updating a record. (1) UNIT III - LINEAR DATA STRUCTURES LIST Abstract Data Types (ADTs) List ADT array-based implementation linked list implementation singly linked lists- circularly linked lists- doubly-linked lists applications of lists Polynomial Manipulation All operation (Insertion, Deletion, Merge, Traversal) Q.N o Questions PART - A BT Level Competence 1 Define ADT. Give any two examples. What are the postfix and prefix forms of the expression: A + B* (C D) / (P R) List out the areas in which data structures are applied extensively. 4 Define non linear data structure. What are the types of linked list? List out the advantage of circular linked list. Distinguish between linear and non linear data structures. 8 Clearly distinguish between linked lists and arrays. Mention their relative advantages and disadvantages. Differentiate arrays and linked lists. R.U, R.S & G.V CS0-PDS I Page

7 10 Give an example for linked list application. 11 Binary search cannot be performed on a linked list. Examine. 1 Illustrate the use of linked list with an example. 1 Show the ways in which list ADT can be implemented. Compare calloc() and realloc() function and mention its application in linked list. 1 Analyze and write a find routine in array implementation. 1 Analyze and write the array representation of a polynomial: p(x) = 4x +x +x+ 1 Should arrays or linked lists be used for the following types of applications? Support your justification. 1. Many search operations in sorted list. BTL- Evaluating. Many search operations in Unsorted list. 18 Compare singly linked list with circular linked list. BTL- Evaluating 1 Develop a simple C Program to modify a node in a linked list. BTL- Creating 0 Develop an algorithm for insertion operation in a singly linked list. BTL- Creating PART - B 1 4 Explain and describe the following: i. Applications of lists. (8) ii. Polynomial manipulation. (8) What is a linked list? Describe the suitable routine segments for any four operations. (+) List an algorithm to perform insertion and deletion on a doubly linked list. (8+8) (i) Describe the insertion and deletion procedures for cursor based linked lists.(8) (ii) Give an algorithm for the deletion and reverse operations on doubly linked list. (8) Describe the creation of a doubly linked list and appending the list. Give relevant coding in C. (1) Write a C Program to demonstrate an addition, subtraction and multiplication operations on polynomial using a linked list. (++) Analyze and write C code for circular linked list with create, insert, delete, display operations using structure pointer. ( ) 8 Explain the application of linked list in detail. (1) Consider an array A[1: n] Given a position, write an algorithm to insert an element in the Array. If the position is empty, the element is inserted easily. If the position is already occupied the element should be inserted with the minimum number of shifts. (Note: The elements can shift to the left or to the right to make the minimum number of moves). (1) Design a nested structure and explain how the structure members are accessed in a nested structure with suitable example. (1) Explain the various operations of the list ADT with examples. (1) BTL- BTL- Evaluating Creating R.U, R.S & G.V CS0-PDS I Page

8 1 1 Illustrate how polynomial manipulations are performed with lists? Explain the operations. (4+1) Explain the steps involved in insertion and deletion into a singly linked list. (8+8) Describe a C program for linked list implementation of list. (1) UNIT IV - LINEAR DATA STRUCTURES STACKS, QUEUES Stack ADT Evaluating arithmetic expressions- other applications- Queue ADT circular queue implementation Double ended Queues applications of queues Q.N o Questions PART - A BT Level Competence 1 Define stack and queue. Define double ended queue. List the applications of a queue. 4 What are the applications of priority queue? List any four applications of stack? What is circular queue? Given the prefix for an expression. Write its postfix: -*-+abc/ef-g/hi 8 Circular queue is better than standard linear queue, Why? Describe how the following "infix" expression is evaluated with the help of stack : * ( + ) - 1 / 4 10 Distinguish between singly and doubly linked lists. 11 Classify the different types of queues. 1 Illustrate the difference between a queues and linked lists 1 with Complete an example. a routine to display the contents of queue. Analyze and write a routine to check whether the queue is full or empty. 1 Point out the advantage of representing stack using a linked list than array. 1 Point out the rules followed during the infix to postfix conversions. 1 For railway reservation the queue data structure is preferred Justify. BTL- Evaluating 18 Compare the working of stack and queue data structure. BTL- Evaluating 1 0 Develop an algorithm for inserting a new element into the stack. Develop an algorithm for deleting an element in a double ended queue. PART - B BTL- BTL- Creating Creating 1 Briefly describe the operations of queue with examples. (1) Describe about stack ADT in detail. Explain any one application of stack. (10+) Describe about queue ADT in detail. Explain any one application of queue with suitable example. (10+) R.U, R.S & G.V CS0-PDS I Page 8

9 4 a. Give an algorithm for push and pop operations on stack using a linked list. (8) b. Discuss about addition and deletion operations performed on a circular queue with necessary algorithms. (8) a. Describe the process of postfix expression evaluation with an example. (8) b. Describe the process of conversion from infix expression to postfix expression using stack. (8) a. Write a C Program that checks if expression is correctly parenthesized using stack and illustrate with an example. (1) b. Write the function to examine whether the stack is full() or empty(). (4) Analyze and write a C program to implement queue functions using arrays and macros. (1) 8 Explain prefix, infix and postfix expressions with an example. (1) Write an algorithm to convert an infix expression to a postfix expression. Trace the algorithm to convert the infix expression (a+b)*c/d+e/f to a postfix expression. Justify BTL- Evaluating the need for Infix and Postfix expression. (1) 10 Develop an algorithm to perform the four operations in a double ended queue that is implemented as an array. (1) BTL- Creating 11 Explain circular queue and its implementation. (1) 1 Explain array based implementation of stacks. (8) Explain linked list implementation of stacks. (8) Explain the enqueue and dequeue operations on double ended 1 queues. (8+8) Describe with an example how to evaluate arithmetic expressions using stacks. (1) UNIT V - SORTING, SEARCHING AND HASH TECHNIQUES Sorting algorithms: Insertion sort - Selection sort - Shell sort - Bubble sort - Quick sort - Merge sort - Radix sort Searching: Linear search Binary Search Hashing: Hash Functions Separate Chaining Open Addressing Rehashing Extendible Hashing PART - A Q.N o Questions BT Level Competence 1 What is hashing? Define extendible hashing. What is meant by internal and external sorting? Give any two examples for each type. 4 Name the applications of linear and binary search techniques. Describe the complexity of bubble sort. Identify the advantage of shell sort over insertion sort. Give the time complexities of bubble sort and quick sort. 8 Predict the fastest sorting algorithm, justify. Predict the fastest searching algorithm, Justify. R.U, R.S & G.V CS0-PDS I Page

10 10 Distinguish between linear and binary search technique. 11 Classify the different sorting methods. 1 Illustrate the time complexity of insertion sort with an example. 1 Which hashing technique is best and illustrate with an example? Compare internal and external sorting. 1 Point out the advantages of using quick sort. 1 Compare the working of linear and binary search techniques. 1 Select the best sorting method out of the following - insertion sort, quick sort and merge sort and give BTL- Evaluating justification. 18 Summarize the open addressing hashing method with an example. BTL- Evaluating 1 Develop an algorithm for a quick sort. BTL- Creating 0 Develop a simple C Program for a linear search. BTL- Creating PART - B 1 4 Describe how the divide and conquer technique is implemented in binary search. (1) Describe the algorithm for Insertion sort and sort the following array:,, 44, 11, 88,,, (1) List the different types of hashing techniques? Explain them in detail with an Example. (8+8) a. Interpret the result of inserting the keys,,,, 11, 1, 1,, 4 into an initially empty extendible hashing data structure with M =. (8) b. Discuss the running time of Divide-and-Conquer Merge sort algorithm. (8) Sort the sequence, 1, 4, 1,,,,, using Insertion sort and Describe the routine. (1) Write an algorithm to sort a set of N numbers using quick sort. Demonstrate the algorithm for the following set of numbers: 88,11,,44,,,,,4,10. (8+8) Explain the various collision resolution techniques in detail with an example. (1) 8 Compare the different Sorting methods and discuss about each method in a very detailed Manner. (1) a. Sort the given integers and Explain the intermediate results using shell sort:,1,,,1,4,,,40,. (8) BTL- Evaluating b. Write and Explain a C code to sort an integer array. (8) 10 a. Create a C Code to perform a binary Search. (8) b. Develop an algorithm for Merge sort with an example. (8) BTL- Creating 11 Illustrate a C program to sort the elements using bubble sort. (1) 1 Explain in detail about separate chaining. (1) 1 Explain the rehashing technique with suitable example. (1) Describe the open addressing and chaining methods of collusion resolution techniques in hashing. (1) R.U, R.S & G.V CS0-PDS I Page 10