PESIT Bangalore South Campus Department of MCA Course Information for

1. GENERAL INFORMATION: PESIT Bangalore South Campus Department of MCA Course Information for Data Structures Using C(13MCA21) Academic Year: 2015 Semester: II Title Code Duration (hrs) Lectures 48 Hrs 13MCA21 Seminars 4 Hrs Total 52 Hrs Data Structures Using C 2. PRE REQUIREMENT STATEMENT: Student should know the basics of C concepts and pointers 3. COURSE RELEVANCE: This course provides the students with a comprehensive introduction to how the abstractions can be made concrete by using a programming language as t contains the control structures necessary to make programs readable and allows basic data structures such as stacks, linked lists and trees to be implemented in a variety of ways 4. FACULTY DETAILS: Faculty Name: Mrs.Jeny Jijo Department : MCA Room Number: 518 Phone Number: 9739024993 Mail-id :jens4u@gmail.com Contact Hours : College Hours Consultation Time: By E-Mail 5. VENUE AND HOURS/WEEK: All lectures will normally be held in 500,501 and 506, 5 th Floor. Lecture Hours/week: 4Hrs All the laboratory sessions will be held in Room 500 & 506, V Floor. Laboratory Hours/week: 2Hrs

6. MODULE MAP: Class Theme Topics to be covered 1 Meaning of information 2 ADT,Sequences 3 Unit 1 ADT for Varying Char strings 4 Datatypes 5 Introduction to Pointers & data structures 6 Data Structures Arraya as ADT 7 Implementing 1-D array 8 Array as Parameters 9 Character Strings 10 Character strings contd 11 Primitive operations,egsamples 12 Unit 2 Stack ADT,push pop operations 13 Infix,postfix and prefix operations 14 The Evaluation of postfix exp,definition 15 Stack Conversions of expressions 16 Application of stack 17 Exceptional conditions 18 Expressions evaluations 19 Factorial,natural numbers multiplication Unit 3 20 Fibonacci,Binary search 21 Algorithms and definitions Recursion 22 Towers of Hanoi % of portions covered Chapter Cumulative Wise 8% 8% 12% 19% 19% 38% 23 ADT of queue 24 Operations of queue 25 Priority queue, Implementation 26 Linked list and operations 27 Unit 4 Stack implementation as linked list 28 Queue implementation as linked list Queues and 29 List operations Lists 30 Array implementation of list 31 Dynamic allocation of variables 32 Circular lists,applications of linked lists 33 Doubly linked list 34 Applications of other lists 35 Bubble sort 36 Quick sort 37 38 Unit 5 Selection sort Binary Tree sort 39 Sorting Heap sort 40 Insertion & shell sort 41 Address calculation sort 42 Radix & merge sort 43 Unit 6 Sequential and ordered search 44 Indexed and Interpolation search 12% 50% 12% 86% 14% 100%

45 Searching Binary search tree, operations 46 Hashing 47 Hash functions 48 Unit 7 Tree traversals, 49 Binary search operations, 50 AVL trees & operations 51 Binary Trees Red-Black Trees 52 Threaded Binary trees 8% 8% 7. RECOMMENDED BOOKS/JOURNALS/WEBSITES Text Books: 1. Data Structures Using C and C++ by Yedidyah Langsam and Moshe J. Augensteinand Aaron M Tenanbanum, 2nd Edition, Pearson Education Asia, 2002. Reference Books: 1. Data Structures and Algorithm Analysis in C, Mark Allen Weiss, 2nd Edition, Pearson Education Aisa, 1997. 2. Richard F Giberg and Behrouz A Forouzan: Data Structures A Pseudo code Approach with C, 2nd Edition, Cengage Learning 3. Robert Kruse, C L Tondo, Bruce Leung and Shashi Mogalla: Data Structure s and Program Design in C, 2nd Edition, Pearson Education 8 ASSIGNMENTS- The students has to submit 2 assignments, one before first internal and the second one before second internal exam Assignment -1 1) Explain TOWERS OF HANOI application with respect to stack. Bring out the solution to the tower of Hanoi problem for n=5 2) Convert the infix expression to postfix form Q= A+ (B*C (D/E F)*G) *H 3) Convert the postfix expression to infix form (A+B) / (C * D) Assignment 2 1) Sort the following array of elements using merge sort 35, 10, 15, 45, 25, 20, 50, 30, 40 2) Sort the following array of elements using quick sort 45, 36, 15 92, 35, 71

10 THEORY ASSESSMENT WRITTEN EXAMINATION Paper Structure No. Of Questions 8 Main Questions No. of questions to be answered 5 Exam date Paper Duration 3 Hrs Total Marks 100 Pass Marks 40 CONTINUOUS ASSESSMENT Parameters Weighting (%) Assignment(s): 5 Marks (10%) Seminar(s): 5 Marks (10%) Class Test(s): 5 Marks (10%) Overall 5 Marks (10%) Performance: Test(s): 30 Marks (60%) Total Marks: 50 Marks QUESTION BANK REVIEW OF STRUCTURES AND POINTERS, INTRODUCTION TO SPECIAL FEATURES OF C OBJECTIVE Usage of structures, unions - a conventional tool for handling a group of logically related items. Unions - sharing of memory. Pointers - the real power of C. 1. What are structures? 2 2. Explain how the structures are useful by giving various examples. 4 3. Bring out the differences between structures and unions. 4 4. What is a pointer and why is it used? 4 5. With an example explain how bit fields can be defined in C. 4 6. What are enumerated data types? Explain with an example 4 7. List the various kinds of pre-processor statements. 4 8. What is the difference between macros and inline functions? 4 9. Explain the differences between malloc() and calloc() functions used for memory allocation 4

10. What is type casting? Give an example. 4 11. What are register variables? Where are they used? 4* 12. Why Macro is Need? Explain the conditional Macros with example. 5* 13. With the help of suitable example explain command line arguments 5* 14. Write a short note on Enumeration. 6* 15. Explain the storage classes. 6 16. What are macros? List few macros used in C. 6 17. What is union? How is it different from structure? With suitable example show how union is declared and used in C? 6* 18. What is a Macro definition? Write a C program to print the cube of a given number using a Macro definition. 6* 19. What do you understand by dynamic memory allocation? Explain any three functions that support dynamic allocation? 6* 20. What are bit wise operators? Give example for each operator 6 21. Write a program to copy contents of a file to other using command line arguments. 8 22. Write a program to merge the contents of a file to other using command line arguments. 8 23. What is the difference between macros and inline functions? 8 24. What are command line arguments? Write a C program to copy contents of a file to another file. 8* 25. What are the command line arguments? Write a C program to accept the file name and text through command line arguments? Create a file with text and print the text on the screen 8* 26. Show the output of the following assuming a = 4, b = 3, c = 10 a) d = a & b b) d = a/b c) d = a^b d) d = ~c e) d = a >> 2 f) d = a << 2 9* 27. What are files? Create a file called sem.txt to store semester performances of all branches. Also display the semester and the branch, which has performed the best. 10 28. Create a file for storing employee database. To this file include operations to add new employees, delete employees and search for a particular employee. 10 29. Explain the various access modes used for files in C. 10 30. Write a C program to copy the contents of one file into another 10* 31. Explain the bit wise operators with examples used in C. 10* 32. What are Macros? Explain with an example. 10* 33. Explain call by value and call by reference. Give two examples. Define formal and actual

parameters. 10* 34. What are pre-processor directives? Explain any two operations that can be done using preprocessor directives. 10* 35. Create a structure pointed by a pointer variable and allocate memory using malloc() and calloc() separately. Execute the code and note your observations. 10 -------------------------------------------------------------------------------------------------------------------- STACK OBJECTIVE: The most important concept in data structures. To study the prominent role in the area programming is stack. To expertise into a concrete and valuable tool in problem solving. 36 Define stack. Explain the implementation of various stack operations using structures. 4 37 Define stack. Explain the implementation of various stack operations using singly linked list. 4 38 Define stack. Explain implementation of various stack operations using doubly linked list. 4 39 Explain how the stack is used in parameter passing. 4* 40 Write the prefix and postfix form of the following infix expressions a) ((A + B) * C - (D-E)) $(F+G) b) (A+B)*(C+D-E)*F 4 41 Write a C function to convert a valid arithmetic infix expression into its equivalent postfix expression. Stack implementation is to be assumed 4* 43 Show the detailed concept of the stack to evaluate the following positive expression 632-5*+1^7+ * 4 44 Write short notes on dynamic stack representation. 5* 45 Show the detailed contents of the stack and trace of the algorithm to evaluate the given postfix expression 123+*321-+* 5* 46 What is a stack? How it can be represented in "C" using arrays? 6* 47 What is a stack? Give examples to show the operations of stack. 6 48 Define Stack as a data structure and discuss its applications 6* 49 Obtain prefix and postfix expression (A+B)*(C+D)$(A+B) A+B*C-D/E*H (A+B^C^D)*(E+F/D) 6* 50 What is stack? List the applications of stack. Write a C function to insert an element on the

top of stack. 6* 51 Implement the stack using arrays. 8 52 List the various ways of representing the arithmetic expressions by giving suitable examples 8 53 Show the detailed contents of the stack for given postfix expression to evaluate 6 2 3 + - 3 8 2 / + * 2 $ 3 + 10* 54. List applications of stack. Using stack write an algorithm to determine if a given string is palindrome and print suitable message as output. 10* 55. Implement stack using static and dynamic memory allocation. Discuss the relative merits of these two implementations. 10* 56. Write a program to check whether a given expression is a valid postfix expression or not. If valid evaluate a 33333333333. Given postfix expression otherwise display a suitable message. 10 57 Write a program to check whether a given expression is a valid prefix expression or not. If valid evaluate a given prefix expression otherwise display a suitable message. 10 58 Write an algorithm to convert a given infix expression into postfix expression. 10 59 Write an algorithm to convert a given infix expression into prefix expression. 10 60 Write an algorithm for converting infix expression to post-fix expression. Trace the algorithm indicating content of stack for expression (a-b)/(c*d)+e. 10* 61 Show that, how stack operations takes place for the conversion of infix to postfix expression. ((A-(B+C)) *D) $(E+F) 10* 62 Convert the following infix expression into a postfix expression (((A/(B*C))+(D*E))-(A*C)) A$B*C-D+E/F/(G+H) 10* 63 Write an algorithm to implement a stack of size N using an array. The elements in the stack are to be integers. The operations to be supported are PUSH, POP and DISPLAY. Take into account the exceptions of Stack overflow and underflow. 10* 64 What is STACK? Explain operation performed on STACK. Discuss how the stack structure can be used for Tower of Hanoi problem. 12* RECURSION OBJECTIVE: Recursion the most powerful and one of the best programming tools of data structures. Advantages and disadvantages of the same. Applications. 65 What is recursion? 2

66 What is a recursive definition? Indicate its properties? 4* 67 What is recursion? Give the properties of a recursive definition of an algorithm. What are its advantages? 5* 68 What is a recursion? Compare the recursive programs with iterative programs. 6* 69 Write a note on Efficiency of Recursion. 6* 70 Write a "C" recursive program to solve the tower of Hanoi problem. Give the trace for 3 disks. 8* 71 What is recursion? Explain with an example 8* 72 Bring out the differences between recursion and iteration. 8 73 Write a program to find GCD of 2 nos. using iterative and recursive techniques 8 74 Write a program to find the following using recursion: i) Factorial of a given number ii) Fibonacci series up to a given number 8 75 Write a program to solve the towers of Hanoi problem 8 76 Define recursion. Write a recursive program to find the GCD of two numbers. 8* 77 Write recursive c routines i) For computing the binomial coefficient of k term of an n degree polynomial ii) That accepts a non negative decimal integer as a parameter and writes out Its binary representation. 8+8* 78 What is recursion? Discuss an example which can be represented both recursively and iteratively. 8* 79 Write recursive function for: i) Fibonacci series for nth number ii) Printing number in reverse order (6+6)* 80 Write a recursive C function to find the n Fibonacci number. Explain with an example 10* QUEUES AND LISTS OBJECTIVE: a. QUEUES: To make a considerable exhaustive study of yet another data structure QUEUE. To study various forms of implementation techniques of the Queues and their different types. To study the applications. b. LISTS:

To study exhaustive about lists viz. singly linked list, doubly linked list, circular list, circular doubled linked list, their implementation techniques and applications. QUEUES 81 Distinguish between Ordinary queues and Circular queues. 4* 82 What are the advantages and disadvantages of linked lists over arrays? 4* 83 Define Priority queues and explain. 4* 84 Write a routine to insert an element in a ordinary queue. 8* 85 Write a note on a Priority queues. 8* 86 Write a program to implement a linear queue using arrays. 8 87 Write a program to implement a circular queue using arrays. 8 88 Write a program to implement a double-ended queue using arrays. 8 89 A circular queue has a size of 5 and has 3 elements 10,40 and 20,where F=2 and R=4. After inserting 50 and 60,what is value of F and r. Trying to insert 30 at this stage what will happen? Delete 2 elements from the queue and insert 100. Show the sequences of steps with necessary diagrams with the value of F and R. 8* 90 Write a C Program to perform the following operations on a queue Insert Delete Display 8* 91 Write a c function i) to insert an element at the rear end of a queue ii) to delete an element from the front end of the queue 10* 92 What is circular queue? Write C program to implement circular queue using arrays with operations of INSERT (), DELETE () and DISPLAY (). 10* LISTS 93 Understanding list operations like concatenation, searching for a node etc. 8 94 Understanding the array implementation of list 8 95 What is a SLL? Write a program to implement stack as a singly linked list. 8 96 Write a program to create an on ordered link list. 8 97 Write an algorithm to find whether a given list is ordered or not. 8 98 Write a recursive search routine to search for a node in a SLL. 8 99 Write a program to find for a particular node (either the position or info of the node can be

given) in a SLL. 8 100 Write an algorithm to concatenate two lists (assume both are existing) 8 101 What do you understand by a linked list? Write a C function SEARCH (F, X) that accepts a printer P to a list of integers and an integer X, and returns a pointer to a node containing X, if it exists, and the NULL pointer otherwise. 8* 102 What is a single linked list? Explain with an example how a single linked list can be used for sorting a set of N numbers. 8* 103 What are different types of linked list? Write a C function to count number or elements present in single linked list. 10* 104 Write advantages of doubly linked list over singly linked list. Write C function that will insert a given integer value into an ordered doubly linked list. 10* 105 Write a C function to a. To count number of nodes using singly linked list b. To concatenate two singly linked list, and then to sort the resultant list c. To reverse direction of singly linked list(as shown below) Start Start 12* 106 Explain merging of two lists which have been represented as i) Array ii) Linked list 12* 107 Write a program to represent a polynomial of single variable using linked list and perform the following functions a. Evaluation of polynomial b. Display the polynomial 12* DOUBLY LINKED LIST 108 Knowing the doubly linked list definition and its implementation 6 109 Write a program to find for a particular node (either the position or info of the node can be given) in a DLL circular 6 110 What are the advantages and disadvantages of doubly linked list? Also give its applications. 6* 111 Write a C function to insert and delete a node from the front end in case of doubly linked list. 8*

CIRCULAR LIST 112 Implement a circular SLL with the header node containing the total no of nodes in the list. The node itself consists of student details like reg no, name, marks etc. 6 A B C D D C B A 113 What are the advantages of circularly linked list over a linear list? Write a c routine that concatenates two circular lists. 6* 114 Write C functions to perform the following operations: a. Create a circular single linked list b. Display Circular single linked list 8* TREES OBJECTIVE: To study exhaustively regarding a tree, types of trees and focus only on BST (Binary search tree). To study the implementation of BST. About applications. 115 What is binary tree? 2 116 What are the differences between strictly binary tree and complete binary tree 4 117 What are the two conditions under which a binary tree becomes an almost complete binary tree? 4 118 Discuss the applications of trees 4* 119 Explain with suitable example the following traversals of a tree i) Preorder and ii) In order 4* 120 Give examples to show the father, son, and descendent and ascendant nodes of a binary tree. 6 121 Given the following traversals In order: E I C F J B G D K H L A Preorder: A B C E I F J D G H K L Construct a Binary Tree 6* 122 What is a TREE? Define the following a. Ancestor b. Descendants of node with respect to the TREE 6*

123 Explain various type of tree traversal with simple example. 6* 124 Write C functions for following tree traversals i) Inorder ii) Preorder iii) Post order 6* 125 What is binary search tree? Create a BST. 8 126 Explain the different methods of representation of binary trees in "C". 8* 127 Write recursive C routines to traverse a binary tree in different ways. Assume the dynamic node representation of a binary tree 8* 128 Define the following a. Strict binary tree b. Almost complete binary tree c. Ordered tree d. Right in threaded binary tree 8* 129 Construct a binary tree for the expression A + ( B-C)*(E+F)/G and draw the diagram showing each step. 8* 130 Explain one-way and two-way threading of binary trees 8* 131 Implement the sequential representation of a binary search tree 10 132 Write an algorithm to traverse the tree using father field 10 133 List the various tree traversal techniques giving examples 10 134 Implement the recursive tree traversal of in, pre and post order traversals 10 135 Write an algorithm for the iterative tree traversal. 10 136 What is a threaded binary tree? 10 137 Implement the in order threaded binary tree. 10 138 Define the following terms with appropriate sketches a) Tree b) Directed tree c) Ordered tree d) Binary tree e) Spanning tree 10 139 Explain the different methods of binary tree representation 10* 140 Write an output after traversing of a given tree by i) in order ii) Preorder traversing methods 10* 141 Write an algorithms for deleting node in a binary search tree for all the three cases 12* 142 Write a "C" program to I) Create; and ii) traverse a binary tree in three orders. 12* 143 Write a C Function to create expression TREE using postfix expression, and discuss how a

postfix expression can be transformed to its equivalent prefix expression 12*