Scribd
Upload
5 views

Data Structure Using C_ Regular

The document is an examination paper for a B.C.A. degree course on Data Structures using C, consisting of multiple sections with various questions. It includes questions on topics such as dynamic memory allocation, pointers, data structures, recursion, sorting algorithms, and linked lists. Candidates are instructed to answer a specified number of questions from each section within a time limit of 2 hours.

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
5 views

Data Structure Using C_ Regular

The document is an examination paper for a B.C.A. degree course on Data Structures using C, consisting of multiple sections with various questions. It includes questions on topics such as dynamic memory allocation, pointers, data structures, recursion, sorting algorithms, and linked lists. Candidates are instructed to answer a specified number of questions from each section within a time limit of 2 hours.

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

B040210

Reg. No.
II Semester B.C.A.6. (NEP) Degree Examination, September/October
DATA STRUCTURE USING C - 2022
Paper - I
(Regular)
Time.:2 Hours
Maximum Marks: 60
Instructions to Candidates : Answer the question as per the
instructions given.

1. Answer any Six questions of the following. (6x2=12)


What is Dynamic memory allocation?
b. What is pointers in C? Give syntax and example.
C. What is towers of Hanoi? Mention constraints.
d. Define sequential scarch? List its advantages.
Convert infix to postfix notation.
a. A*B+C.
b. (A+B)*C-D.
f What is priority queue mention different types of it.
What is singly linked list? How do you declare it?
h What is strictly binary tree? Give example.
2 Answer any Three questions of the following. (3x4=12)
What is data structure? Define primitive and non- primitive data structures.
b. Write a short note on
Malloc
ii. Calloc
ii. Realloc.
C. Write advantages and disadvantages of using pointers.
d. With examplewrite a simple program in 'C' to access address and value of variables
using pointers.
|P.T.O.
(2) B040210
3. Answer any Three questions of the following. (3x4=12)
What is recursion? Write comparison between iterative and recursive furnction.
b. WIiiea Cprogram to generate binomial coeficient using recursive function.
C Write an algorithm deleting elements of array's.
d. Compare quick sort and selection sort.
4. Answer any Three questions of the following.. (3x4=12)
Explain Application of stack in function calls.
b Explain
working of circular queue.
C.
Write an algorithm evaluation ofpostfix expressions using stack.
What is queue? Write basic concepts.
5. Answer any Three questions of the following. (3x4-12)
Explain the types of linked lists.
b. Define
1. Node
ii. Terminal node.
iii. Non - terminal node.
C. Write an algorithm to display in - order traversal of a binary tree.
d Define:
0. Heap tree.
ii. Binary search tree.
ii. Complete binary tree.

You might also like