Sikkim-Manipal University of Health Medical and Technological Sciences (SMUHMTS) 2008-1st Sem M.C.A Computer Assignment s - Question Paper

MCA II Semester (Revamped) Assignments for August 2008 Session

MC0068 – 01
Marks –60
DATA STRUCTURES USING C

No of Credits: 04 Book ID: B0701

1. You are asked to store university Register-Numbers of all 100 students of MCA-II semester in your Learning Centre. Which data kind do you use? What is its syntax? (5 Marks)
2. You are asked to store Names of all 100 students of MCA-II semester in your Learning Centre. Which data kind do you use? What is its syntax?
(5 Marks)

3. Let us say your Learning Centre decides to store all the 3 kinds of learner data:
a. Register-Number
b. Name
c. Age
In a single data type, which is the most suitable data type? provide its syntax
(5 Marks)


4. Say All the Learning Centre codes of SMU are stored in an array called LC
If SMU is a variable pointing to base address of LC, write a simple program to print all the LC codes stored in variable LC
(10 Marks)

5. You have a container with only 1 opening at TOP . Which Data structure you use? And write functions to implement it using arrays.
(9 Marks)
6. When you are booking for ticket in a railway reservation counter, which data structure is applicable? implement its functions in C language.
(9 Marks)

7. “You have organized a students’ get together in your centre. Totally there are a few 50 students in your class. But you aren’t aware how many of them will turn up to the gathering” – In this situation which 1 of the subsequent is best allocation? What is its name?
a. Arrange all 50 chairs in begin itself
b. Arrange chairs as and when a learner comes
Write functions illustrating the data structure that is used in solving such issues in C language.
(8 Marks)
8. Say subsequent TREE structure is followed in your computer lab. If there is an fault in Comp-4 how do you search it using Binary Search Tree (BST) algorithm.

9. You are asked to store Age of all 100 students of MCA-II semester in your Learning Centre. Which data kind do you use? What is its syntax?
(9 Marks)










MC0068 – 02
Marks –60
ADVANCED DATA STRUCTURES
No. Of Credits: four Book ID: B0702

1. What do Big-O, Big- and Big- signify? Illustrate Big-O notations applicability in algorithm analysis. ( 12 Marks)

2. Name algorithms that are used for finding minimum spanning tree? Write any 1 complete algorithm.
( 12 Marks)

3. Name popular algorithms used for finding shortest paths. Illustrate 1 of them.
( 12 Marks)
4. Compare Depth 1st Search (DFS) with Breadth 1st Search (BFS) and Depth 1st with iterative Deepening (DF-ID).
1. To obtain out super-prime numbers which algorithm is suitable and why?
2. For issue of Desert crossing which algorithm holds good and why?

(12 Marks)

5. Can you apply Splay tree concepts of Zig, Zig-Zag and Zig-Zig to subsequent tree structures: (12 Marks)
i. Y




ii. Z

Earning:   Approval pending.