IGNOU MCA CS04 - Data Structures through C and Pascal MCA(1)-04/TMA/2008 Assignments

Course Code : CS-04
Course Title : Data Structures through C and Pascal
Assignment Number : MCA(1)-04/TMA/2008
Maximum Marks : 10
Last Date of Submission : 15th April, 2008

This is a Tutor Marked Assignment. There are four questions in this assignment. Answer all questions. Each question carries 2 ½ marks. You may use illustrations and diagrams to enhance explanations.

Question 1: Write a program in ‘C’ language to implement a stack using linked list. Show both the PUSH and POP operations. Illustrate the algorithm with the help of an example.

Question 2: What are priority Queues? Write a program in ‘C’ language to implement a priority queues?

Question 3: Write an algorithm to add two polynomials using linked list.

Question 4: Draw a Binary Search Tree for the following sequence of numbers. Also, show the Traversing of the tree in Preorder, Inorder and Postorder.

47, 35, 78, 23, 89, 115, 98, 39, 41, 56, 69, 48