Scribd
Upload
41 views1 page

CSE2003 Assigment PDF

This assignment aims to improve students' problem solving skills using various data structures and algorithms. Students must submit a handwritten document describing original problems and solutions using arrays, stacks, queues, linked lists, trees, graphs, and design techniques like divide and conquer, brute force, and dynamic programming. The submission should include a problem description, suitable data structure choice, design technique, pseudocode, and time complexity analysis.

Uploaded by

Ronit
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
41 views1 page

CSE2003 Assigment PDF

This assignment aims to improve students' problem solving skills using various data structures and algorithms. Students must submit a handwritten document describing original problems and solutions using arrays, stacks, queues, linked lists, trees, graphs, and design techniques like divide and conquer, brute force, and dynamic programming. The submission should include a problem description, suitable data structure choice, design technique, pseudocode, and time complexity analysis.

Uploaded by

Ronit
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

CSE2003 Assigment

The purpose of the assignment is to improve problem solving skills of the student
with different types of Data Structures and Algorithms. Students have to submit a
handwritten document for this assignment. Originality in expressing your ideas,
through this assignment, is highly appreciated and will be suitably rewarded also.
The usual `copy-paste' submission is highly discouraged. This assignment carries
10 marks.
List of Data Structures: Array, Stack, Queue, Linked List, Tree and Graph.
List of Design techniques: Divide and Conquer, Brute-Force, Dynamic
Programming.
You should answer the following things for every data structure and design
technique.
1. Problem description
2. Decide an efficient data structure for the problem with the reasons
3. Design technique used for developing the algorithm with reasons.
4. Pseudo code/algorithm.
5. Computation of time complexity.
 You have to describe a problem for each of the data structures and design
techniques. Your answer should have all the details (item 1-5) mentioned
above.
 Either you describe one problem for discussing all the above design
Techniques (or data structures) or describe a problem for each of the design
techniques (or data structures) with all the required descriptions.

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy