0% found this document useful (0 votes)
5 views2 pages

Data Structures Using C_Repeters

This document outlines the examination structure for the II Semester B.C.A. Degree in Data Structures using C, conducted in September/October 2022. It includes instructions for candidates, three sections of questions with varying formats, and topics covering memory allocation, file handling, sorting algorithms, and data structures. The exam consists of multiple-choice questions, programming tasks, and theoretical explanations.

Uploaded by

shahidss07313
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
0% found this document useful (0 votes)
5 views2 pages

Data Structures Using C_Repeters

This document outlines the examination structure for the II Semester B.C.A. Degree in Data Structures using C, conducted in September/October 2022. It includes instructions for candidates, three sections of questions with varying formats, and topics covering memory allocation, file handling, sorting algorithms, and data structures. The exam consists of multiple-choice questions, programming tasks, and theoretical explanations.

Uploaded by

shahidss07313
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

41223/B230

Reg. No.
II Semester B.C.A.4. Degree
DATA
Examination, September/October - 2022
STRUCTURES USING C
(Repeaters)
Time:3 Hours Maximum Marks:80
Instructions to Candidates : Answer all sections.
2. Draw neat diagram wherever
3. necessary.
Write question numbers correctly.

SECTION-A
1. Answer All questions. (10x2-20)
a. What is static memory allocation?
b What is file? Mention its different access modes.
What is Data structure? List out its types.
d What is recursion? Giye example?
e. What is merge sort?
f. Define stack. Mention any two application.
What is circular queue?
h What is priority queue?
i Differentiate between singly linked list and doubly linked list.
What is linked list?
SECTION-B

Answer any four questions. (4x5-20)


2. Write a 'C' program to read atext file and convert the file contents in upper case and write
a contents in on outputfile.
3. Explain the concept of bubble sort technique with an example.
4. Write a note on tower of Hanoi.
5. Explain the various types of queues.
6. Explain advantage and disadvantage of linked list.
[P.T.O.
queue.
functions.
ordinary operations.
DMA in
SECTION
-C function
recursion.
on structure.
Explain
(2) operation POP
management
and and list.
allocation?Data PUSH iteration
all of linked
perform
classification list.
memory list. linked
questions. for versus
memory between
program linked
to of
Arraysof Representation
program various
Four dynamic the Differentiate
Components
'C'
any Explain
Explain
a Compare
'C Write
Answer
is Write
a
What
b. 10,
a. b. a. b.
11. C.
7. 8. 9.

You might also like