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 / University of Madras / ICE / Degree / BCA / Data Structures using C Ask a question
Print this page
University of Madras (UoM)

University of Madras (UoM)

Syllabus

Test Papers

Permission for writing BE/BTech/BArch/ME Exams

Join Discussions
Join Discussions on University of Madras (UoM)
Data Structures using C
Data Structures using C

OCTOBER 2003
U/IC 14674/NCL

Time: Three hours
Maximum: 100 marks

PART A - (5 x 8 = 40 marks)
Answer any FIVE questions.
All questions carry equal marks.

1. Write a C program to read the value of sales of three items by four sales representatives and print the following.

(a) Total values of sales by each girl
(b) Total value of each item sold
(c) Grand total of sales of all items by all girls.

2. Describe various storage classes of variables.

3. Describe the syntax of structure definition in C? Explain how the members of the structure can be accessed with structure variables and with pointers.

4. Explain the syntax and usage of get C, put C, get W, put W functions.

5. Convert the following infix expressions to postfix and prefix form:

(a) aTbTc+d*eTa
(b) a+b*c/d-d
(c) aT'b+cTd*e.

6. Write C functions to insert and delete elements from a queue.

7. Write an algorithm to add an element into a sorted list.

8. What is a binary tree? Write algorithms for traversals of binary trees.

PART B - (3 x 20 = 60 marks)

Answer any THREE questions.
All questions carry equal marks.

9. (a) Write a C program that uses a function to sort an array of integers. (10)

(b) Write note on dynamic memory allocation. Discuss on its implementation in C with examples. (10)

10. (a) Write a C program to read a set of strings into an array and check whether a given string is present. (10)

(b) Explain the preprocessor directives # define, # include, # ifflef, # if with examples. (10)

11. (a) Write algorithms to push, pop element and to determine whether the stack is empty. (10)

(b) Suggest a suitable storage representation for a lower triangular matrix in a single dimensional array. Write its addressing function. (10)

12. Describe representation of polynomials in a linked list. Write algorithms to add 2 polynomials and to multiply a polynomial with a constant. (20)

13. Describe representation of graphs. Write algorithms for graph traversal. (20)
Most popular pages

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

Search this site

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