Need help about a course?
Visit CollegeZones.com
| Need help about a course? |
| Home / University Assignments / IGNOU / MCA / CS 4 - Data Structures through C and Pascal / MCA(1)-04/TMA/05 |
Ask a question Print this page |
| Data Structures Study Guides |
|
Data Structures Study Guides |
Course Code : CS-4
Course Title : Data Structures through C and Pascal
Assignment Number : MCA(1)-04/TMA/2005
Maximum Marks : 10Last date of Submission : 15 th April, 2005
This is a Tutor Marked Assignment. There are two questions in this assignment. Answer all questions. Each carries 5 marks. You may use illustrations and diagrams to enhance explanations.
Question 1: Write a program in ‘C’ language that accepts a binary tree as input and reverses the left and right children of each node.
Question 2: Write a program in ‘C’ language that will accept a Graph as input and prints the minimum cost spanning tree.
Business Schools - Engineering Colleges - Medical & Nursing Admissions - BEd in Distance mode - Journalism & Media Studies - IGNOU
Enter a detailed keyword. Ex: IGNOU MCA Course Eligibility Criteria