Scribd
Upload
44 views2 pages

DS Scheme

This document outlines the examination structure for the I Semester B.C.A Degree in Computer Science, specifically focusing on Data Structures. It includes instructions for candidates, detailing the sections and marks distribution for various questions. The exam consists of three sections with questions requiring definitions, explanations, algorithms, and examples related to data structures.

Uploaded by

leeladevi T
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
44 views2 pages

DS Scheme

This document outlines the examination structure for the I Semester B.C.A Degree in Computer Science, specifically focusing on Data Structures. It includes instructions for candidates, detailing the sections and marks distribution for various questions. The exam consists of three sections with questions requiring definitions, explanations, algorithms, and examples related to data structures.

Uploaded by

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

I Semester B.C.

A Degree Examination, March/April-2024


COMPUTER SCIENCE
Data Structure Scheme of Valuation
(NEP Scheme 2021)
Paper: CA-C3T
Time: 2 ⅟2 Maximum Marks: 60
Instructions to Candidates:
Answer all the Sections.
SECTION-A
I. Answer any Four questions. Each question carries 2 marks. (4X2=8)
1. Ans. It is a type of DS where elements are stored non-sequentially. Data elements are not
arranged in sequential manner. (Definition 2 marks)
2. Ans. amount of space and amount of time required by an algorithm for an input of given
size “N” (definition 2 marks)
3. Ans. It is mathematical model for data types which gives overall view of data structure and
the program without specifying its implementation details. (definition 2 marks)
4. Ans. Binary tree: A tree whose elements have at most 2 children is called a binary tree. It
follows ordered format. It allows duplicate values. (definition 2 marks)
Binary Search Tree: It is a node based tree where a node or root node will have left and
right sub trees. It follows unordered format. It doesn’t allow duplicate values.
(definition 2 marks)
5. Ans. Directed graph, undirected graph, weighted graph. (Any two mentioned 2 marks)
6. Ans. It is a special type of matrix. It is also a product of mxn elements in which zero
elements are more. (definition 2 marks)
SECTION-B
II. Answer any Four questions. Each question carries 5 marks. (4X5=20)
7. Ans. a. Queues b. Arrays c. Memory Management d. Tree e. Distributed Systems
Explanations of theses each carries 1 mark.
8. Ans. Single and two dimensional arrays structure (figures) 3marks
Explanations 2 marks
9. Ans. Algirithm for Enqueue and Dequeue operations 5marks
10.Ans. Evaluation 5 marks
11.Ans. Explanation of Linear search algorithm 5marks
12.Ans. AVL tree explanation 2 marks
Operations 3 marks

SECTION-C
III. Answer any Four questions. Each question carries 8 marks. (4X8=32)
13. a) Explanation for asymptotic notations 5 marks
b) Algorithm for deleting an element in an array. 3 marks
14. Definition for recursion 2 marks.
Algorithm and diagrams for Tower of Hanoi 6 marks
15. a) Algorithm for bubble sort 3 marks
b) Using example with explanation 5 marks
16. Definition for Stack 2 marks. Program for Stack operations 6 marks.
17. Definition for BST 2 marks.
Construction for BST 6 marks.
18.a) Definition for hashing , hash table, hash function 3 marks
b) DFS Algorithm 5 marks.

You might also like