Information Technology (Semester 3)
Total marks: 50
Total time: 3 Hours
INSTRUCTIONS
(1) Question 1 is compulsory.
(2) Attempt Q1 or Q2, Q3 or Q4, Q5 or Q6, Q7 or Q8
(3) Draw neat diagrams wherever necessary.
1.a.
Explain dynamic memory allocation functions in C.
(4 marks)
00
1.b.
Explain the following with example :
i. Pointer to array
ii. Pointer to pointer
iii. Array to pointer
(6 marks)
00
1.c.
List and explain the fundamental types in C.
(2 marks)
00
OR
2.a.
Explain memory allocation, declaration, access and initialization of structure variable with suitable example.
(4 marks)
00
2.b.
What is stream ? State the type of stream used in C File handling.
(4 marks)
00
2.c.
Explain the ways of parameter passing in C functions.
(4 marks)
00
3.a.
What is Complexity of Algorithm ? Explain the importance of algorithm analysis.
(4 marks)
00
3.b.
Write Pseudo C code of binary search algorithm.
(6 marks)
00
3.c.
Define the following:
Data object
Data structure
(2 marks)
00
OR
4.a.
Write C program to implement Quick Sort and show all passes to sort the following list using quick sort :
55 85 0 25 40 35 20
(6 marks)
00
4.b.
Explain different asymptotic notations.
(6 marks)
00
5.a.
Explain the features of sequential organization in comparison with linked organization.
(6 marks)
00
5.b.
Write Pseudo C code for Sparse matrix simple transpose.
(7 marks)
00
OR
6.a.
What do you mean by ordered list ? Explain Sparse matrix as an example of ordered list.
(7 marks)
00
6.b.
Explain representation of polynomial using array and structure with an example.
(6 marks)
00
7.a
Explain the following:
Doubly linked list
Self-referential structure
(6 marks)
00
7.b.
Write Pseudo C code for inserting and deleting node of a circular linked list.
(7 marks)
00
OR
8.a
Explain GLL and represent the following polynomials using GLL:
$13 \quad x^{\wedge} 4+5 x^{\wedge} 3-12 x y+9 x y^{\wedge} 3-20 x^{\wedge} 2 y^{\wedge} 4$
(7 marks)
00
8.b.
Write C code to evaluate a polynomial term.
(6 marks)
00