DCA1207 DATA STRUCTURES JULY SEPTEMBER 2025

Description

SESSION	SEP 2025
PROGRAM	BACHELORS OF COMPUTER APPLICATIONS (BCA)
SEMESTER	II
COURSE CODE & NAME	DCA1207 DATA STRUCTURES

 

 

Set-I

 

 

Q1. How many types of Arrays are used in programming? Discuss the algorithm to delete an array element from the mid of an array. 5+5        

Ans 1.

Arrays

An array is one of the most fundamental data structures used in programming. It allows storing multiple values of the same data type in a contiguous memory location under a single variable name. Arrays provide fast access to elements using index values and are widely used in implementing other complex data structures. Depending on how data is organized and accessed, arrays are classified into different types.

Types of Arrays Used in Programming

Arrays can broadly be classified based on their dimensions. A one-dimensional array is the simplest form, where elements are stored in a linear sequence and accessed using a single index.

MUJ

Its Half solved only

Buy Complete assignment from us

Price – 190/  assignment

MUJ Manipal University Complete SolvedAssignments  JULY-AUGUST  2025

buy cheap assignment help online from us easily

we are here to help you with the best and cheap help

Contact No – 8791514139 (WhatsApp)

OR

Mail us-  [email protected]

Our website – https://muj.assignmentsupport.in/

 

 

Q2. Write an algorithm to find a particular number in an array and replace it with some other value.          5+5           

Ans 2.

Searching is a basic but crucial operation in data structures. Arrays often require searching for specific elements to update, modify, or replace values. One common operation is finding a particular number in an array and replacing it with another value. This operation is widely used in data correction, updating records, and modifying stored datasets.

Concept of Searching and Replacing in an Array

Searching involves scanning array elements sequentially or using optimized techniques

 

Q3. Explain the working of a Stack data structure. What are its applications in real-world scenarios? 5+5  

Ans 3.

Working of Stack Data Structure and Its Real-World Applications

Stack Data Structure

A stack is a linear data structure that follows the Last In First Out (LIFO) principle. This means the element added last is removed first. Stacks are widely used in computer science because of their simplicity and effectiveness in handling temporary data and function calls.

Working Principle of Stack

A stack allows insertion and deletion of elements only from one end known as the top. The two primary operations performed on a stack are push and pop. The push operation inserts an element

 

Set-II

 

Q4. What is a linked list and its types? Discuss the benefits of using them over array in detail. 10

Ans 4.

Linked List

A linked list is a dynamic linear data structure in which elements, called nodes, are stored at non-contiguous memory locations. Each node consists of two parts: the data part that stores the actual value and the link part that stores the address of the next node. Unlike arrays, linked lists do not require contiguous memory allocation, which makes them flexible and efficient in many programming scenarios.

Basic Structure of a Linked List

In a linked list, the first node is called the head, which contains the address of the first data

 

 

Q5. What is a doubly circular queue? Write an algorithm to display the contents of the circular queue.        5+5             

Ans 5.

Doubly Circular Queue

A doubly circular queue is a variation of the queue data structure that combines features of both doubly linked lists and circular queues. In this structure, each node contains data along with two pointers: one pointing to the next node and the other pointing to the previous node. The last node is linked back to the first node, forming a circular structure.

Concept and Working of Doubly Circular Queue

In a doubly circular queue, insertion and deletion can be efficiently performed from both ends if

 

 

Q6. Write an algorithm for Merge Sort and explain its divide-and-conquer approach. 10

Ans 6.

Merge Sort

Merge Sort is a popular sorting algorithm based on the divide-and-conquer technique. It efficiently sorts elements by dividing the array into smaller subarrays, sorting them, and then merging them back into a single sorted array. Merge Sort is widely used due to its stable performance and predictable time complexity.

Concept of Divide-and-Conquer

The divide-and-conquer approach works by breaking a problem into smaller subproblems,