Need help about a course?
Visit CollegeZones.com
| Need help about a course? |
|
Home / University/College Assignments / IGNOU / MCA / MCS04 - Data Structures through C and Pascal CS04 - MCA(1)-04/TMA/06 |
Ask a question Print this page |
| Data Structures Study Guides |
|
Data Structures Study Guides |
Course Code : CS-04
Assignment Number : MCA(1)-04/TMA/06
Maximum Marks: 10
Last Date of Submission : 15th April, 2006
This is a Tutor Marked Assignment. There are two questions in this assignment. Answer all questions. Each question carries 5 marks. You may use illustrations and diagrams to enhance explanations.
Question 1: Write a program in 'C' language for the creation of a Binary tree. After creation is complete, it should print the preorder, postorder and inorder traversal outputs of the binary tree.
Question 2: Write a program in 'C' language for the non-recursive implementation of quick sort.
Business Schools - Engineering Colleges - Medical & Nursing Admissions - BEd in Distance mode - Journalism & Media Studies - IGNOU
Enter a detailed keyword. Ex: Indira Gandhi National Open University MCA Course Eligibility Criteria