Scribd
Upload
29 views2 pages

DS Questions Bank

The document is an examination paper for BCA II Semester III at Punyashlok Ahilyadevi Holkar Solapur University, focusing on Data Structures using C. It includes questions on definitions, characteristics, and applications of various data structures, as well as programming tasks related to implementing stacks, queues, and linked lists. The paper is divided into three sections with varying marks for each question.

Uploaded by

raghavrk3032
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
29 views2 pages

DS Questions Bank

The document is an examination paper for BCA II Semester III at Punyashlok Ahilyadevi Holkar Solapur University, focusing on Data Structures using C. It includes questions on definitions, characteristics, and applications of various data structures, as well as programming tasks related to implementing stacks, queues, and linked lists. The paper is divided into three sections with varying marks for each question.

Uploaded by

raghavrk3032
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

Punyashlok Ahilyadevi Holkar Solapur University, Solapur

BCA II Semester III


Data Structures using C : I

Q. No. 1) Answer any four of the following (for 2 marks)


1) Define ADT
2) Define data structure
3) Define algorithm
4) Define time complexity
5) Define space complexity
6) What is Big-O notation?
7) Define array
8) Define stack. Give an example.
9) Explain the application of stack.
10) Which operations we can perform on stack?
11) Define queue. Give an example.
12) Which operations we can perform on queue?
13) What is priority queue?
14) State the applications of queue
15) State the types of queue.
16) What is deque? Give example.
17) What is linear queue?
18) What is19) Define linked list
20) State the types of linked list?
Q. No. 2) Answer any two of the following or short notes ( 4 marks )
1) Explain stack as an ADT
2) Explain queue as an ADT
3) Explain array as an ADT
4) Explain characteristics of an algorithm
5) What is divide and conquer?
6) Explain Greedy algorithm
7) Explain branch and bound
8) What is backtracking?
9)Explain dynamic programming
9) Explain types of data structure.
10) Explain types of array with example
11)Which operations we can perform on array?
12) Differentiate between stack and queue
13) Differentiate between linear and circular queue
14) Differentiate between array and linked list
15)What 16)What is dynamic queue?
17) Which operations we can perform on linked list?
18) Explain all types of linked list with graph
Q. No. 3) Answer any one of the following (for 8 marks)
1) Write a program to implement STACK using array and perform the
following operations
a) PUSH b) POP c) Display d) Exit
2) Write a program to convert infix expression to postfix expression
3) Write a program to convert infix expression to prefix expression
4) Write a program for matching parenthesis in an expression
5) Write a program to evaluate postfix expression.
6)Write a program to implement queue using array.
7) Write program to implement linear queue using array.
8) Write program to implement circular queue using array.
9) Write program to implement priority queue using array.
10) Write a program to implement singly linear linked list and perform the
following operations
a) Insert at end b) delete from beginning c) Display
11) Write a program to implement doubly linear linked list and perform the following
operatiob) Insert at beginning b) delete from end c) Display
12) Write a program to implement circular singly linked list.
13) Write a program to implement circular double linked list.
14) Write a program to implement STACK using linked list
15) Write a program to implement QUEUE using linked list

You might also like