Scribd
Upload
5 views1 page

HW706-3

The document outlines the Continuous Comprehensive Evaluation (CCE-1) for the Data Structure course at Bhopal School of Social Sciences for B.C.A. 2nd semester students. It includes instructions for assignment submission and a series of questions covering algorithms, data structures, and various operations related to arrays, linked lists, stacks, and queues. Students are required to provide their personal information and submit their assignments in PDF format by March 11, 2025.

Uploaded by

hp2209819
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 views1 page

HW706-3

The document outlines the Continuous Comprehensive Evaluation (CCE-1) for the Data Structure course at Bhopal School of Social Sciences for B.C.A. 2nd semester students. It includes instructions for assignment submission and a series of questions covering algorithms, data structures, and various operations related to arrays, linked lists, stacks, and queues. Students are required to provide their personal information and submit their assignments in PDF format by March 11, 2025.

Uploaded by

hp2209819
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/ 1

THE BHOPAL SCHOOL OF SOCIAL SCIENCES

DEPARTMENT OF COMPUTER SCIENCE & APPLICATION

CONTINUOUS COMPREHENSIVE EVALUATION (CCE)-1


DATA STRUCTURE
B.C.A. 2-sem

Note: (1) Write the answers of following questions in your writing


(2) Also write Your Registration Number, Name, and Mobile Number as per
college ID on TOP of each page of your assignment
(3) Scan the assignment in PDF with your name as File name
(4) Upload the assignment latest by 11th Mar 2025 on MIS

(Q1) What do you understand by Algorithm? Explain its characteristics and need. Also write
an algorithm to find largest of the three numbers.

(Q2) What is a Data Structure? Describe the classification of Data Structure.

(Q3) Describe the different types of operations that can be performed using data structures.

(Q4) Explain Array Data Structure and its important operations by means of a program and
algorithm

(Q5) What is Linked-List? Explain different types of Linked-List.

(Q6) Write algorithm for Insertion and Deletion in Single Linked List and Circular Linked
List.

(Q7) Explain different operations that can be performed in Linked Lists.

(Q8) What is a Stack Data Structure? Explain how it is represented in static and dynamic
form taking suitable examples. Also describe different operations that can be performed
on Stacks.

(Q9) What is a Queue Data Structure? Explain types of queues and how they are
implemented? Also describe different Queue Operations.

(Q10) Explain common terms associated with Array, Linked List, Stack and Queues

You might also like