and 5 others joined a min ago.
0
400views
Fundamentals Of Data Structures Question Paper - Jun 17 - Information Technology (Semester 3) - Pune University (PU)
1 Answer
0
0views
written 6.9 years ago by
teamques10
★ 70k
|
Fundamentals Of Data Structures - Jun 17
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.
What is the use of void data type?
(2 marks)
00
1.b.
What is macro? Compare it with function.
(4 marks)
00
1.c.
Explain the use of pointer to array of structure wit suitable example.
(2 marks)
00
1.d.
Explain any four functions used for file handling.
(4 marks)
00
OR
2.a.
Explain different storage classes in C.
(4 marks)
00
2.b.
What is pointer? Explain pointer to a function with suitable example.
(5 marks)
00
2.c.
Differentiate between binary and text file.
(3 marks)
00
3.a.
Explain static and dynamic data structures with suitable examples.
(3 marks)
00
3.b.
What is space complexity of an algorithm? Explain its importance with example.
(3 marks)
00
3.c.
Explain the following terms:
(6 marks)
00
i. Internal sorting
ii. External sorting
iii. Sort stability
OR
4.a.
Explain linear data structure with suitable example.
(3 marks)
00
4.b.
What are different asympotic notations?
(3 marks)
00
4.c.
Write pseudo C code for insertion sort. Show all the passes to sort the values in ascending order using insertion sort , values are : 5, 15, 3, 7, 2.
(6 marks)
00
5.a.
Write a pseudo C algorithm for simple transpose of sparse matrix. What is it time complexity?
(5 marks)
00
5.b.
Explain row and column major storage representations of two dimensional array.
(6 marks)
00
5.c.
Explain stack as Abstract Data Type (ADT).
(2 marks)
00
OR
6.a.
Explain sequential memory organizations using suitable data structure.
(6 marks)
00
6.b.
Write an algorithm to add two sorted polynomial in a single variable. Analyze its complexity.
(7 marks)
00
7.a.
What is generalized linked list? Give graphical representations of the generalized list:
(4 marks)
00
A=(1, 2 (3, (4, 5)), 6)
7.b.
Compare linear and circular linked list.
(3 marks)
00
7.c.
Write pseudo C code to delete a node from doubly linked list (DLL).
(6 marks)
00
OR
8.a.
Compare array and link list.
(3 marks)
00
8.b.
Write pseudo C code to insert a node at start and end of singly linked list (SLL).
(6 marks)
00
8.c.
Give practical applications of circular linked list.
(4 marks)
00
ADD COMMENT
EDIT
Please log in to add an answer.