Scribd
Upload
6 views

Data Structures Using C CS April 2022

Uploaded by

efootballpes2012
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
6 views

Data Structures Using C CS April 2022

Uploaded by

efootballpes2012
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

1

180299

4
C 21519 (Pages : 2) Name.........................................

Reg. No.....................................

1
FOURTH SEMESTER (CBCSS—UG) EXAMINATION, APRIL 2022
Computer Science

1
BCS4C04—DATA STRUCTURE USING C PROGRAMMING
(2019 Admission onwards)
Time : Two Hours Maximum : 60 Marks

Section A

Answer atleast eight questions.

1
Each question carries 3 marks.
All questions can be attended.
Overall ceiling 24.

4
1. What are data types ? Specify the significance of various data types.

2. Explain the non-linear data structures with example.

1
3. What is an algorithm ? Specify the efficiency measures of an algorithm.

4. What is linear array ? What is the significance of an array index ?

1
5. How to represent a one dimensional array in memory ?

6. What are the features of a linear list ?

7. What are the advantages of circular linked list ?

8. What is the basic architecture of a queue ?

1
9. Explain the procedure to insert an element in to a stack.

10. What are the features of a circular queue ?

4
11. Define the complexity measures of a sort algorithm.

12. What is the basic concept of a linear search ?

1
(8 × 3 = 24 marks)

1
Turn over

180299
1
180299

4
2 C 21519

Section B

1
Answer atleast five questions.
Each question carries 5 marks.

1
All questions can be attended.
Overall ceiling 25.

13. Explain the characteristics of data structure. Also, discuss the concept of user defined data structures.

14. What are sparse matrices ? Explain the representation of sparse matrix in memory with suitable
example.

15. Develop the procedure to create a singly linked list in memory.

1
16. Explain the implementation of a queue using arrays.

17. Discuss various applications of a stack.

4
18. Explain the binary search procedure with example.

1
19. Discuss the insertion sort procedure with supporting algorithm.

(5 × 5 = 25 marks)

1
Section C

Answer any one question.


Each question carries 11 marks.

20. What is stack organization ? Explain the implementation of a stack in memory using linked list.

21. What is merge sort ? Explain the procedure and also measure the efficiency.

1
(1 × 11 = 11 marks)

1 1 4
180299

You might also like