Data Structure and Algorithm (CS-2001)

A MINI-PROJECT REPORT
ON
“MINI-PROJECT TITLE”

Semester – III
Section – CS-08
Group # – 14
Submission Date – 08/11/19
Submitted by:
Sr# Roll No Name Digital Signature

1 1805534 Subandhu Agravanshi

2 1805577 Ashwani Shukla
3 1805593 Rhythem Priyadarshi

1
Evaluation Criteria:
Page
Sr# Section Weightage
1 Section 2 4
2 Section 3 3
3 Section 4 2
4 Section 5 1

School of Computer Engineering, KIIT Deemed to be University, Bhubaneswar, Odisha

 Data Structure and Algorithm (CS-2001)

Section – 1
Problem Statement:
Capture the mini project problem statement

2
Page

School of Computer Engineering, KIIT Deemed to be University, Bhubaneswar, Odisha

 Data Structure and Algorithm (CS-2001)

Section - 2
2.1. ADT (Abstract Data Type)
Provide the logical description of how you will view the data and the
operations that are allowed without regard to how it will be implemented
or how it does the job.

2.2. Data Structure

Present on how you design and implement the solution in such a way
that it reduces the complexity and increases the efficiency.

2.3. Problem Solution Approach

Present algorithm either in flowchart or pseudocode or function code.

2.4. Time and Space Complexity

Present the worst case time and space complexity of the solution.

3
Page

School of Computer Engineering, KIIT Deemed to be University, Bhubaneswar, Odisha

 Data Structure and Algorithm (CS-2001)

Section - 3
Source Code:
The source code to capture the following points:
1. Each function to capture comments on what
2. Each important steps to capture comments on what and why
3. Follow indention
4. Keep the code readable and easy to smell

4
Page

School of Computer Engineering, KIIT Deemed to be University, Bhubaneswar, Odisha

 Data Structure and Algorithm (CS-2001)

Section - 4
I/O:
Capture the snap of Input & Output by covering at least 5 test cases.
4.1. Test Case 1

4.2. Test Case 2

4.3. Test Case 3

4.4. Test Case 4

4.5. Test Case 5

5
Page

School of Computer Engineering, KIIT Deemed to be University, Bhubaneswar, Odisha

 Data Structure and Algorithm (CS-2001)

Section - 5
Critique of the subject:
Note: Critique the subject and not the faculty.
Critique the subject by stating on
- Text Book
- Reference Books
- Mid Term Questions
- Chapters
- Lecture Notes

6
Page

School of Computer Engineering, KIIT Deemed to be University, Bhubaneswar, Odisha