STUDENT PORTFOLIO

Name: ARYAN AGARWAL

Register Number: RA2211032010003
Mail ID: aa6050@srmist.edu.in
Department: NETWORKING&COMMUNICATION
Specialization: CSE-IOT
Semester: 3

Subject Title: 20CSC201J Data Structures and Algorithms

Handled By: DR. A PRABHU CHAKKARAVARTHY

About me

 Semester-wise GPA:
 Semester 1: 7.4
 Semester 2: 7.6
 Current CGPA:
 GitHub Profile: https://github.com/hacked3213
 LinkedIn Profile:
 Total Number of Arrears/Detention: 0

Assignment – Crossword Puzzle (Units 3, & 4)

(Write about the assignment questions and how u solved them differently)

The crossword puzzles provided were quite diverse covering topics related to data structures and
binary trees. The first puzzle focused on concepts, like data structures, algorithms, and their time
complexities. To solve it successfully I needed an understanding of stacks, queues, tree traversals,
and their properties. By applying my knowledge of these concepts and how they relate to each
other I was able to fill in the answers

Moving on to the puzzle things got more interesting as it explored the intricacies of binary trees.
This puzzle delved into rotations, tree terminology, and different types of trees. In order to crack
this one, I primarily relied on my understanding of tree-related concepts such as search trees,
rotations, and the specific orders in which we traverse them. Solving this puzzle required
familiarity with terminologies and operations associated with trees.
Both puzzles put my computer science foundation. In data structures and algorithms. To the test.
The first one covered general knowledge in these areas while the second one specifically
challenged me on trees and their operations. Thanks to my grasp of these concepts, in computer
science I was able to solve both puzzles accurately and efficiently.

These puzzles really demonstrated the range of questions that can come up in computer science-
themed crosswords and solving them called for a grasp of the topic.

Group Assignment
(what is the most interesting part of the assignment)

The assignment's most interesting part, in my view, lies in employing linked lists to handle student
records. Here's the reasoning:

1. Custom Data Structure: Crafting a bespoke data structure for students stands as a pivotal facet of
this task. The `Student` structure, encompassing fields for student ID, name, grade, and a pointer to
the subsequent student, showcases the practical application of data structures in tackling real-world
predicaments. It exemplifies how data structures like linked lists can be tailored to cater to specific
requirements.

2. Dynamic Data Management: Linked lists constitute a dynamic data structure that can expand or
contract as required. This proves especially advantageous in a student management system where
new students can be added or existing ones can be eradicated without any fixed, predetermined size
constraint. This facilitates efficient utilization of memory.

3. Constant Time Complexity for Adding Students: The `addStudent` function's constant time
complexity (O(1)) for appending students at the onset of the linked list is intriguing. It
demonstrates the efficiency of linked lists for insertions and stands as a paramount feature of this
system. It serves as an exemplary illustration of how data structures can influence the performance
of an application.

4. Searching and Deletion: Although searching for a student and deleting a student possess a time
complexity of O(n) in the worst-case scenario (linear time complexity), they exemplify the
utilization of linked lists for such operations. This holds significance in comprehending the trade-
offs between data structures in terms of time complexity.

CodeChef/Hackerrank/HackerEarth Achievements
Or Any other Achievements
Achievements Completed by me include the following:

 Successfully received 5 Stars in Problem Solving (Data Structures).

 Successfully received 5 Stars in C++.
 Successfully received 5 Stars in Python.
 Participated in the “OSHack” class hackathon.
 Completed a Full Stack Project in Java titled “Task manager Application”.
 Completed a Mini Project in Python titled in data structure and algorithm titled
”Maze solver”.
 Completed a Mini Project in Python titled “data bot.ai Application”.
 Completed Mini Project on the subject of Operating Systems titled “Handling
Queries using Round Robbin”

Signature