V.S.B. ENGINEERING COLLEGE, KARUR. Academic Year: (ODD Semester) Department of Computer Science and Engineering

Transcription

1 V.S.B. ENGINEERING COLLEGE, KARUR Academic Year: (ODD Semester) Department of Computer Science and Engineering Question Bank (2013 Regulations) S.No. Name of the Subject / Lab Semester Page No. 1 Programming and data structures - I I 2 1

2 QUESTION BANK UNIT I PART - A 1.What are Keywords? 2.What is the difference between if and while statement? 3.What is the difference between while loop and do while loop? 4.What will happen when you access the array more than its dimension? 5.Write the limitations of getchar( ) and sacnf( ) functions for reading strings. 6.What is the output of the programs given below? 7.Distinguish between Call by value Call by reference. 8.What is the difference between while(a) And while(!a)? 9.Why we don t use the symbol & symbol, while reading a String throughscanf() 10.What is the difference between static and auto storage classes? 11.Define delimiters in C. 12.Differentiate break and continue statement. 13.Distinguish between while..do and do..while statement in C. 14.Compare switch( ) and nestedif statement. 15.Give the syntax for the for loop statement 16.What is the use of sizeof( ) operator? 17.What are global variable in C? 18.Write a program to swap the values of two variables. 19.What is an array? 20.What is a Pointer? How a variable is declared to the pointer? 21.What are the uses of Pointers? 22.How can you return more than one value from a function? 23.What are the main elements of an array declaration? 24.List the header files in C language. 25.What are the pre-processor directives? 26.Classify the functions based on arguments and return values. 27.Define pre-processor in C. 28. Define Macro in C. 1.Explain about the various decision making statements in C language. 2.Explain the control statements in c. 3.What are functions? Explain the types of functions in detail with an example program for each type. 4.Define arrays. Explain the array types with an example program for each type Arrays 5.What are pointers? When and why they are used? Explain in detail with sample programs. 6.Explain function pointers with example. 7.Explain the various operators in c with suitable example. UNIT II PART A 1.Define structure. 2.What is meant by structure template? 3.Write the syntax for structure declaration and definition 2

3 4.Define union. 5.Write the syntax for union declaration and definition. 6.How structures are initialized? 7.What are nested structures? 8.What is meant by array of structure? 9.What is structure assignment? 10.How do you reference a structure member? 11.Differentiate structure and union. 12.Differentiate structure and arrays. 13.What are the advantages of union over structure? 14.Write the syntax for pointers to structure. 15.What is a file? 16.Write the syntax for file declaration. 17.What are file modes? 18.Write the syntax to open a file. 19.What is the significance of fclose() function? 20.What are the steps for using a file? 21.What are the functions of text files in stdio library? 22.What are the file pointers of stdlib.h? 23.What are the types of files? 24.What are the features of binary files? 25.What are the functions to access files randomly? 1.Explain the different modes in which a file can be opened. 2.Explain the functions fscanf, fprintf, fgets, fputs, getw, putw, getc, putc, fread, fwrite, feof, ferror,fseek,ftell,rewind with example. 3.Explain structures with an example 4.Explain union with an example 5.Discuss about the file handling concepts in C 6.Explain ways to read and write data from a file UNIT III PART A 1.What is a data structure? 2.Why do we need data structures? 3.List some common data structures. 4.How data structures are classified? 5.Differentiate linear and non-linear data structure. 6.Define ADT(Abstract Data Type) 7.Mention the features of ADT. 8.Define List ADT 9.What are the ways of implementing linked list? 10.What are the types of linked lists? 11.What are benefits of ADT? 12.When singly linked list can be represented as circular linked list? 13.When doubly linked list can be represented as circular linked list? 14.Where cursor implementation can be used? 3

4 15.List down the applications of List. 16.What are the advantages of linked list? 17.Mention the demerits of linked list 18.How the polynomial is represented using linked lists? 19.What are the operations performed in list? 20.What are the merits and demerits of array implementation of lists? 20.What is a circular linked list? 22.What is meant by an abstract data type? 23.Advantages and Disadvantages of array. 24.What is the need for the header? 25.Define Polynomial ADT 1.Explain the various operations of the list ADT with examples 2.Write the program for array implementation of lists 3.Write a C program for linked list implementation of list. 4.Explain the operations of singly linked lists 5.Explain the operations of doubly linked lists 6.How polynomial manipulations are performed with lists? Explain the operations. UNIT IV PART - A 1.Define Stack. 2.What are the operations of the stack? 3.Write the routine to push a element into a stack. 4.How the operations performed on linked list implementation of stack? 5.What are the applications of stack? 6.What are the methods to implement stack in C? 7.How the stack is implemented by linked list? 8.Write the routine to pop a element from a stack. 9.Define queue. 10.What are the operations of a queue? 11.Write the routine to insert a element onto a queue. 12.What are the types of queue? 13.Define double ended queue 14.What are the methods to implement queue in C? 15. How the queue is implemented by linked list? 16. Write the routine to delete a element from a queue 17.What are the applications of queue? 18.Define circular queue 19.What are push and pop operations? 20.What are enqueue and dequeue operations? 21.Write down the algorithm for solving Towers of Hanoi problem? 22.What are the different ways to implement list? 23.What are the postfix and prefix forms of the expression? 24.Explain the usage of stack in recursive algorithm implementation? 25.How do you test for an empty queue? 4

5 Part B 1.Explain Stack ADT and its operations 2.Explain linked list implementation of stacks 3.Explain the applications of Stacks 4.Explain how to evaluate arithmetic expressions using stacks 5.Explain queue ADT 6.Program for array based implementation of queues 7.Explain linked list implementation of queues 8.Application of Queue Data Structure UNIT V PART A 1.Define sorting 2.Mention the types of sorting 3.What do you mean by internal and external sorting? 4.Define bubble sort 5.How the insertion sort is done with the array? 6.What are the steps for selection sort? 7.What is meant by shell sort? 8.What are the steps in quick sort? 9.Define radix sort 10.What are the advantages of insertion sort 11.Define searching 12.Mention the types of searching 13.What is meant by linear search? 14.What is binary search? 15.Define hashing function 16.What is open addressing? 17.What are the collision resolution methods? 18.Define separate chaining 19.What are the types of sorting available in C? 20.What is the basic idea of shell sort? 21.What is the purpose of quick sort and advantage? 22.List out the different types of hashing functions? 23.What is the purpose of quick sort and advantage? 24.What is the purpose of quick sort and advantage? 25.Define hash table? 1.Explain the sorting algorithms 2.Explain the searching algorithms 3.Explain hashing 4.Explain open addressing 5.Write a C program to sort the elements using bubble sort. 5