Sandipani Technical Campus Faculty of Engineering

Second year computer Engineering Subject: Data Structure Date: 20/09/2012 Assignment No.1 1. 2. 3. 4. 5. 6. Define recursion. Write a program of factorial given number using recursion. Write a function in C which will return function prototype structural pointer. Explain abstract data type. Define & show representation of two dimensional array in memory. Define & show representation of array in memory. What is need of Data Structure for programming language & also discuss primitive & non primitive data structure 7. Using data file write a program to accept a 30 numbers from keyboard & store them into a file. Again read the numbers for data file & store odd & even numbers into two separate files. 8. Write a program C program for addition of two complex number. 9. Explain function with call by value & call by reference. 10.Write a short note on pointer.

LAST DATE OF SUBMISSION 01/10/2012

Sandipani Technical Campus Faculty of Engineering

Second year computer Engineering Subject: Data Structure Date: 20/09/2012 Assignment No. 2 1. 2. 3. 4. 5. Explain priority with suitable example. Write a program to implement stack application conversion infix to postfix. Compare stack implementation using array & linked list. Write an algorithm for infix to postfix. Convert follow infix string to postfix. Infix = P+(Q*R-(S/TU)*V)*W 6. Explain any application of stack with example. 7. Write a c program to perform following operation on stack. a. Push b. Pop c. Display 8. Write a program in C for circular Queue operation. a. Insertion b. deletion c. Traverse 9. What are queues? Explain basic operation that can be performed on queue. 10.Write a program to perform following operation on queue. a. Insert b. Delete c. Display

LAST DATE OF SUBMISSION 10/10/2012

Sandipani Technical Campus Faculty of Engineering

Second year computer Engineering Subject: Data Structure Date: 25/09/2012 Practical Assignment Unit I 1. For any new data type define data structure in C.(e.g. Complex number, Polynomials) and write a program in C for its arithmetic. 2. Create new file in write mode & open another file in read mode and copy second file into first file. 3. Implement stack data structure and its operation (PUSH & POP) 4. Implement an application of stack, conversation of prefix to postfix expression and conversation of infix to postfix expression. 5. Implement circular queue and double ended queue using arrays.

LAST DATE OF SUBMISSION 01/10/2012