IndiaStudyCenter.com

Need help about a course?
Visit CollegeZones.com

Colleges & Universities | Distance Education | Admission Notifications | Entrance Exams | Course Syllabus | Question Papers
Home / Test Papers / IGNOU / CS04 Data Structures through C and PASCAL
CS04 Data Structures through C and PASCAL December 2005
Ask a question
Print this page
IGNOU CS-04

CS-04 Test Papers

IGNOU MCA

About IGNOU MCA Course

IGNOU MCA Syllabus

IGNOU MCA Assignments

IGNOU MCA Test Papers

IGNOU Programs

IGNOU

Courses, Admissions & Eligibility

January / July 2010 Admissions

Admission Procedure & Schedule

Colleges, Faculties & Departments

Who's Who at the University

Re-Admission Procedure

Study Centres in India

Partner Institutions outside India

Syllabus

IGNOU Test Papers (by Course)

IGNOU Test Papers (by Paper code)

IGNOU Exam Timetables

Assignments

Notifications, Circulars & Announcements 2009

Events, Seminars & Workshops

Examination Results

IGNOU Improvement tests

Admission to Post Graduate Certificate in Oral Implantology and Post Graduate Certificate in Endodontics

Test Papers / Previous Question Papers of IGNOU CS04 Data Structures through C and PASCAL

PGDCA / MCA (I Yr)
Term-End Examination

December, 2005

CS04 : Data Structures through "C" and "PASCAL"

Time: 2 hours
Maximum Marks: 60

Note : There are five questions in this paper Question No. 1 is compulsory. Answer any three questions from the rest. All algorithms should be written nearer to 'C' or Pascal Language.

1. (a) Write an algorithm to multiply two polynomials using linked list. (8)

(b) Let T be a binary tree with height h and n nodes. Show that log(n + 1)- 1 < = h < = (n - 1)/2. For which values of n and h can the above lowest upper bounds of h be attained equality. (7)

(c) Write an algorithm to implement the bubble sort and sort the following list in ascending order using bubble sort : (7)
13, 24, 5, 19, 2, 17, 4

(d) List any three disadvantages of sequential file organization. (3)

(e) Write an algorithm to insert a node before a given node in a linked list. (5)

2. (a) Write an algorithm to convert the following infix expression to the postfix expression and illustrate the position of stack after each step : (7)
z + (y*x-(w/v ↑ u)*t)*s

(b) Write a recursive algorithm for two way merge sort. (3)

3. (a) Find the postorder traversal of the tree given below : (3)
-----DIAGRAM-----

(b) Write an algorithm for insertion and deletion of elements in a Queue. (7)

4. (a) Write an algorithm for the breadth first traversal of a graph. (4)

(b) Write an algorithm to insert a node into a Binary Search Tree. (6)

5. (a) What is Drect File organization ? Explain any two advantages of Drect File organization over Sequential File organization. (4)

(b) Write an algorithm for performing Binary Search. What is the condition to perform Binary Search ? (6)

Note: The above courses are picked automatically by the website for indicative purpose only. However, students are requested to check with the University for the similarity of the course or for any other information in regard to the course.

Most popular pages

Business Schools - Engineering Colleges - Medical & Nursing Admissions - BEd in Distance mode - Journalism & Media Studies - IGNOU - IGNOU Question Papers

Search this site

Enter a detailed keyword. Ex: Question Papers of IGNOU MCA Ist Semester