Scribd
Upload
4 views

Data Structures Using C 2022 November

Uploaded by

fincyka33265
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
4 views

Data Structures Using C 2022 November

Uploaded by

fincyka33265
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

8

289099

3
D 31787 (Pages : 2) Name.........................................

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

3
THIRD SEMESTER (CBCSS—UG) DEGREE EXAMINATION
NOVEMBER 2022

1
Computer Science

BCS 3B 04—DATA STRUCTURES USING C

(2019 Admission onwards)

Time : Two Hours Maximum : 60 Marks

Section A (Short Answer Type Questions)

8
Answer all questions, each correct answer carries a maximum of 2 marks.
Ceiling 20 marks.

3
1. What are derived data types ? Example.

2. List out any three string manipulation operations ?

3
3. How to perform a traversal in an array ?

4. What are the limitations of a linear array representation ?

1
5. Explain the basic structure of a doubly linked list.

6. What is LIFO terminology ? Example.

7. What are linear queues ?

8. Specify the advantages of a circular queue.

9. Define the tree data structure with example.

10. Explain the pre-order tree traversal procedure.

8
11. What is undirected graph ?

12. What are hash functions ? Example.

3
Section B (Short Essay Type Questions)

Answer all questions, each correct answer carries a maximum of 5 marks.

3
Ceiling 30 marks.

13. What is a data structure ? Explain its classification with suitable examples.

1
14. Explain the procedure to insert an element in a specified position of an array.

Turn over

289099
8
289099

3
2 D 31787

15. Develop the algorithm to delete a node from a singly linked list.

3
16. What are Stacks ? Explain the implementation of linear stack in memory.

17. What are various types of priority queues ? Explain.

1
18. How to represent an expression in a binary tree ? Also, perform a post order traversal on that tree.

19. Explain the depth first and breadth first graph traversals.

Section C (Essay Type Questions)

Answer any one question, correct answer carries 10 marks.

20. What is polish notation ? Explain the procedure to convert an infix expression in to post fix with

8
the help of an operand stack.

21. Explain the quick sort algorithm and also find the efficiency measures.

3
(1 × 10 = 10 marks)

1 3
3 38
1
289099

You might also like