Scribd
Upload
2K views2 pages

I Semester BCA Examination (NEP - SCHEME) : Subject: Computer Science

1) The document is a model paper for the Data Structures subject exam for Bangalore University's 1st semester BCA course following the NEP scheme. It contains 3 parts - Part A with 2 mark questions, Part B with 5 mark questions, and Part C with 8 mark questions. 2) Some of the topics covered in the questions include data structures and their operations, arrays, linked lists, trees, hashing, complexity of algorithms, stacks, queues, sorting, and graph traversals. 3) Students need to answer 4 questions from each part for a total of 60 marks - Part A carries 8 marks, Part B carries 20 marks, and Part C carries

Uploaded by

SOCIAL PLACE
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
2K views2 pages

I Semester BCA Examination (NEP - SCHEME) : Subject: Computer Science

1) The document is a model paper for the Data Structures subject exam for Bangalore University's 1st semester BCA course following the NEP scheme. It contains 3 parts - Part A with 2 mark questions, Part B with 5 mark questions, and Part C with 8 mark questions. 2) Some of the topics covered in the questions include data structures and their operations, arrays, linked lists, trees, hashing, complexity of algorithms, stacks, queues, sorting, and graph traversals. 3) Students need to answer 4 questions from each part for a total of 60 marks - Part A carries 8 marks, Part B carries 20 marks, and Part C carries

Uploaded by

SOCIAL PLACE
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
  • Part-A: Comprises simpler questions, each carrying 2 marks, focusing on basic data structure definitions and concepts.
  • Model Paper Overview: Presents the exam conditions and overall structure, indicating the number of parts and questions to be answered.
  • Part-B: Presents more complex questions, each carrying 5 marks, on data structure operations and efficiency.
  • Part-C: Features advanced questions carrying 8 marks, requiring problem-solving skills in programming and theoretical concepts.

Bangalore University

I Semester BCA Examination (NEP - SCHEME)


Subject: COMPUTER SCIENCE
PAPER: DATA STRUCTURES
MODEL PAPER -1
Time: 2 hours Max. Marks: 60

Instruction: Answer any FOUR questions from each part


PART- A
I. ANSWER ANY 4 QUESTIONS
Each question carries 2 marks 4x2=8

1. Define Data Structure. List out any two Data structure operations.
2. Write ADT of an array.
3. What is Circular Singly Linked List?
4. Define recursion.
5. Write any 2 differences between Binary tree and B-tree.
6. Define any 2 Collision Resolution methods in Hashing.

PART-B
II. ANSWER ANY 4 QUESTIONS
Each question carries 5 marks 4 x 5 = 20

7. Explain Asymptotic notations for Complexity of algorithms.


8. Write a C function to insert a node at the end of the list.
9. Evaluate postfix expression using stack
6, 3, +, 5, *, 2, 3, +, +
10. Construct a Binary Search Tree for the given list of numbers.
45, 38, 77, 55, 33, 66, 88, 22, 57, 89, 99, 46
11. Write a note on (a) Adjacency Matrix (b) Adjacency List
12. Explain Heap Sort for : 9, 16, 32, 8, 4, 1, 5, 8, 0
PART-C
III. ANSWER ANY 4 QUESTIONS
Each question carries 8 marks 4 x 8 = 32

13. Write C program to find the location of 7 from {4,7,3,2,1,7,9,0} using Binary search
technique.
14. Write C function to insert an element 37 into a Linked list(Sorted List).

20 27 36 46 X

15. Write a C function to insert an element in Circular queue.


16. Convert infix to postfix using Stack.
A+(B*C–(D/E^F)*G)*H
17. Construct Binary search tree using :
Inorder : E A C K F H D B G
Postorder : E C K A H B G D F
18. Explain Stepwise BFS concept for the below graph.

1 2 3

4 5 6

7 8 9

19. Write a note on Topological Sorting.

********** ALL THE BEST *********

You might also like