0% found this document useful (0 votes)
14 views5 pages

DS All Assignments

The document outlines assignments for the SY(CSE) class at M.G.M’s College of Engineering for the academic year 2024-25, focusing on Data Structures. It includes questions that cover definitions, comparisons, algorithm implementations, and analyses of various data structures such as arrays, linked lists, trees, and graphs. Each assignment is categorized by Bloom's taxonomy levels, with specific marks allocated to each question.

Uploaded by

heyay40885
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
0% found this document useful (0 votes)
14 views5 pages

DS All Assignments

The document outlines assignments for the SY(CSE) class at M.G.M’s College of Engineering for the academic year 2024-25, focusing on Data Structures. It includes questions that cover definitions, comparisons, algorithm implementations, and analyses of various data structures such as arrays, linked lists, trees, and graphs. Each assignment is categorized by Bloom's taxonomy levels, with specific marks allocated to each question.

Uploaded by

heyay40885
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/ 5

M.G.

M’s College of Engineering, Nanded


Department of Computer Science & Engineering
Academic Year 2024-25 (ODD Semester)
Assignment-I
Class: SY(CSE) Sub: Data Structures

Bloom’s
Q. No. Question CO Marks
Level
Define the following terms with examples:
1 a)Data b) Data types c) Data structure CO1 Remember 2
d) Linear and non-linear data structure

Explain the differences between an algorithm and a program.


2 Include examples to illustrate how an algorithm is CO1 Understand 2
implemented in a program.

Write an algorithm to find the maximum element in a


3 given array of integers. Trace your algorithm for the array CO1 Apply 2
A = [12, 45, 7, 23, 56].

Compare arrays and linked lists in terms of:


a) Memory usage b) Accessing elements
4 c) Insertion and deletion operations CO1 Analyze 2
d) Application areas
Provide a brief explanation for each comparison.

Analyze the following scenario:


You are tasked with designing a system to store and
retrieve hierarchical data, such as an organization's
structure.
a) Identify whether a linear or non-linear data structure
5 would be more appropriate. CO1 Analyze 4
b) Justify your choice with at least two reasons.
c) Provide an example of how the chosen data structure
would represent the organization with three levels:
CEO → Managers → Employees.
M.G.M’s College of Engineering, Nanded
Department of Computer Science & Engineering
Academic Year 2024-25 (ODD Semester)
Assignment-II
Class: SY(CSE) Sub: Data Structures

Bloom’s
Q. No. Question CO Marks
Level
Define the following terms:
1 CO2 Remember 2
a) Linear Search b) Binary Search c) Hashing

Explain how the selection sort algorithm works. Use an


2 CO2 Understand 2
example array to illustrate the process.

Consider the array A = [35, 42, 5, 18, 27]. Perform binary


search to find the position of the number 18.
3 CO2 Apply 2
a) Show the steps of the algorithm.
b) State the time complexity of binary search.

Compare insertion sort and radix sort in terms of:


4 a) Time complexity for best, average, and worst cases. CO2 Analyze 2
b) Applicability based on the size and type of dataset.

A company stores employee IDs in a hash table of size 10


using the hashing function:
hash(key) = key mod 10.

5 The employee IDs are: 25, 40, 15, 35, 50, 20. CO2 Analyze 4
a) Insert these IDs into the hash table and resolve any
collisions using linear probing.
b) Analyze the advantages and limitations of using linear
probing in this context.
M.G.M’s College of Engineering, Nanded
Department of Computer Science & Engineering
Academic Year 2024-25 (ODD Semester)
Assignment-III
Class: SY(CSE) Sub: Data Structures

Bloom’s
Q. No. Question CO Marks
Level
What is stack overflow and stack underflow? How these
1 CO3 Remember 2
conditions are detected in stack?

In the context of a circular queue, explain how overflow is


2 handled differently compared to a simple queue. Show CO3 Understand 2
how a circular queue structure can help efficiently utilize
the available space.
You are given the following postfix expression:
234*+56*+
3 CO3 Apply 2
Evaluate the expression and show the step-by-step
process of solving it using a stack.

Analyze the following scenarios and determine whether a


tree or a graph is more appropriate:
4 a) Representing an organization's hierarchy. CO3 Analyze 2
b) Representing a city's road network.

Justify your choice in each case.

Consider a binary search tree (BST) with the following


elements inserted in the given order:
50, 30, 70, 20, 40, 60, 80
a) Draw the binary search tree.
5 CO3 Analyze 4
b) Perform in-order traversal and pre-order traversal of
the tree.
c) Analyze the advantages of using a BST for searching
compared to a linear data structure.
M.G.M’s College of Engineering, Nanded
Department of Computer Science & Engineering
Academic Year 2024-25 (ODD Semester)
Assignment-IV
Class: SY(CSE) Sub: Data Structures

Bloom’s
Q. No. Question CO Marks
Level
Define the following data structures and provide one
1 example problem that can be efficiently solved using each: CO4 Remember 2
a) Linked List b) Tree

Why is a graph a better choice than a tree when modeling


2 a social network (e.g., connections between people)? CO4 Understand 2
Explain with reference to the features of a graph.

You are designing a browser history feature that allows


users to navigate back and forth between previously
visited web pages.
3 a) Which data structure would you use to implement CO4 Apply 2
this feature?
b) Describe how you would implement the back and
forward operations using your chosen data structure.
You are tasked with building a file directory structure
where each folder may contain files or subfolders.
a) Which data structure would be most appropriate for
4 CO4 Analyze 2
representing this directory structure?
b) Analyze why this data structure is suitable for both
representing and traversing the directory.

Consider a graph to represent a road network with


intersections as vertices and roads as edges.
a) Which graph representation (adjacency matrix or
adjacency list) would you choose to efficiently store
5 this road network, and why? CO4 Analyze 4
b) If you need to find the shortest path between two
intersections, what algorithm would you use, and
how would the graph representation affect the
algorithm's performance?
M.G.M’s College of Engineering, Nanded
Department of Computer Science & Engineering
Academic Year 2024-25 (ODD Semester)
Assignment-V
Class: SY(CSE) Sub: Data Structures

Bloom’s
Q. No. Question CO Marks
Level
List the basic operations and their corresponding time
1 complexities for the following data structures: CO5 Remember 2
a) Stack b) Queue

Explain how the time complexity of enqueue and dequeue


2 operations in a queue differs when implemented using an CO5 Understand 2
array versus a linked list.

Given a binary search tree (BST), write the algorithm for


searching for a value in the tree.
3 a) What is the time complexity of this search operation CO5 Apply 2
in the best, worst, and average cases?
b) What is the space complexity of this search operation?
Compare the time complexities of insertion and deletion
operations for a doubly linked list and a singly linked list.
4 a) Which of these operations is more efficient in both CO5 Analyze 2
types of lists?
b) Provide reasoning for the differences in efficiency.
Consider the following data structures for storing
elements. You need to find whether an element exists in a
collection of data.
i) Binary Search Tree (BST) ii) Hash Table
a) Analyze the time complexity for searching an element
in both the BST and Hash Table. Discuss the best,
5 average, and worst cases for each. CO5 Analyze 4
b) Analyze the space complexity for storing the same
collection of elements in both data structures.
c) In which scenario (e.g., small dataset, large dataset,
frequent insertions) would you prefer one data
structure over the other? Justify your choice based on
time and space complexities.

You might also like