Scribd
Upload
2 views2 pages

imp-QP

This document is a model question paper for the Data Structures Using C course for II Semester BCA at Bengaluru North University for the academic year 2024-25. It consists of three sections: Section A with 10 short answer questions, Section B with 6 detailed questions, and Section C with 3 in-depth questions, covering various topics related to data structures. The total duration for the exam is 3 hours, and the maximum marks are 80.

Uploaded by

eimrglck
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
2 views2 pages

imp-QP

This document is a model question paper for the Data Structures Using C course for II Semester BCA at Bengaluru North University for the academic year 2024-25. It consists of three sections: Section A with 10 short answer questions, Section B with 6 detailed questions, and Section C with 3 in-depth questions, covering various topics related to data structures. The total duration for the exam is 3 hours, and the maximum marks are 80.

Uploaded by

eimrglck
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

Model Question Paper – Data Structures Using C (CA2T1)

II Semester BCA – Bengaluru North University (SEP 2024–25)


Time: 3 Hours
Max Marks: 80

Section – A

Answer any 10 questions. Each question carries 2 marks.


(10 × 2 = 20 Marks)

1. What are sparse matrices?


2. What is recursion?
3. Define a stack.
4. What is a binary search tree?
5. Define a graph.
6. What is a circular queue?
7. Define time complexity.
8. Compare stack and queue.
9. What is a non-linear data structure?
10. Mention different tree traversal methods.
11. What is a priority queue?
12. What are dynamic memory allocations?

Section – B

Answer any 6 questions. Each question carries 5 marks.


(6 × 5 = 30 Marks)

13. Explain tree traversal methods (Inorder, Preorder, Postorder) with an example.
14. Write an algorithm for bubble sort and explain.
15. Explain the concept of circular queue with diagram.
16. Explain the Towers of Hanoi problem with an example.
17. Explain dynamic memory allocation functions in C with example.
18. Write a note on adjacency matrix representation of graphs.
19. Write a C program to evaluate a postfix expression.
20. Write an algorithm to insert and delete an element in a linear queue.

Section – C

Answer any 3 questions. Each question carries 10 marks.


(3 × 10 = 30 Marks)
21. Implement stack using array and linked list. Write push and pop operations with code
and diagram.
22. What is a binary search tree? Explain insertion and deletion operations with an
example and diagrams.
23. Explain Breadth First Search (BFS) and Depth First Search (DFS) algorithms with
examples.
24. Write a menu-driven C program to perform all stack operations using arrays.

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy