Scribd
Upload
36 views2 pages

2nd Sem B.C.a August-September 2024 DATA STRUCTURE USING C (Regular - Repeater)

This document is an examination paper for the II Semester B.C.A. Degree in Data Structures using C, scheduled for August/September 2024. It includes instructions for candidates, a variety of questions covering definitions, operations, algorithms, and programming tasks related to data structures. The exam consists of multiple choice and full questions, with a total of 60 marks available.

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
36 views2 pages

2nd Sem B.C.a August-September 2024 DATA STRUCTURE USING C (Regular - Repeater)

This document is an examination paper for the II Semester B.C.A. Degree in Data Structures using C, scheduled for August/September 2024. It includes instructions for candidates, a variety of questions covering definitions, operations, algorithms, and programming tasks related to data structures. The exam consists of multiple choice and full questions, with a total of 60 marks available.

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

34057

B040210
Reg. No,

II Semester B.C.A. 6 Degree Examination, August/September -2024


DATASTRUCTURES USING C
(Regular/Repeater)
Time : 2 Hours Maximum Marks: 60
Instructions to Candidates :
) Attempt allquestions according to internal choice.
2) Draw neat diagrams wherever necessary.

Answer any Six questions. (6x2=12)


1. a) Define data structures.
b) List the various operations on data structures.
c) Write an iterative functions for Linear search.
d) Define recursion.
e) Convert the following expression from infix to postfix: atb*c/d-e.
Mention the applications of queue.
g) How do you represent a node of a linked list.
h) What is a complete binary tree?

Answer any Three full questions. (3x4=12)


2. a) Explain Primitive and Non-Primitive data structures.
b) Differentiate between static and dynamic memory allocation.
c) Write a note on Pointer arithmetic.
d) Explain malloc() and free () functions with syntax and example.

Answer any Three fullquestions. (3x4=12)


3. a) Write a program to find GCDof two numbers using recursive function.
b) Sort the following elements using bubble sort method:
5, 1,4, 2, 8.
c) Explain binary search with an example.
d) Write aprogram to implement selection sort.

|P.T.O.
(2) BO40210
Answer anyThree full questions. (3x4=12)
4. a) Deinethe term stack. Explain the primitive operations on a stack.
b) Explain cireular queue and priority queue.
c) Write a note on evaluation of postfix expression using stack.
d) Write a program to implement simple queue.

Answer any Three full questions. (3x4=12)


5. a) Describe the concept of singly and doubly linked list.
b) Define the following
terminologies:
) root node ii)degree of a node iii) level iv) depth
C) Traverse the following binary tree using preorder, inorder and postorder traversal:

d) Write aprogam to create asingly linked list and implement the following operations
on it:
i) Insert a node at the beginningof the list.
i) Delete a node at the beginningof alist.

LIBkARLAN
KLS Gogte College of Commerce
Belagavi (Karnataka)

You might also like