The Department of Information Technology, JIMS organized the workshop for BCA 2nd year students. The workshop was for 4 days i.e. from April 8th to April 12th, 2024 (holiday on April 11th, 2024).
Objective:
- The workshop's main objective was to make students capable of solving problems related to DSA in the placement sessions.
- Another objective was to enable the students to understand and analyze data structures and algorithms along with their implementations
Brief of Workshop:
Day 1:
The workshop started with an introduction of the resource person Ms. Sweta Goel. She was an alumni of JIMS for batch 2011-2014 and now she is a consultant in Oroprise Solutions Pvt. Ltd. Then the basic topics of Data Structures and Algorithms were covered. The topics were as follows:
- Arrays: in arrays insertion of elements at a certain position in the array, deletion of the element at a position in an array was covered.
- Linked lists: in linked lists following topic was covered on day 1:
- Singly-linked list: inserting an element at the end of the link list, at the beginning of the link list, at a certain position in the link list, and deleting an element at the end, at the beginning, and a certain position.
- Doubly-linked list: inserting an element at the end of the link list, at the beginning of the link list, at a certain position in the link list, and deleting an element at the end, at the beginning, and a certain position.
- Circular linked list: inserting an element at the end of the link list, at the beginning of the link list, at a certain position in the link list, and deleting an element at the end, at the beginning, and a certain position.
After explaining the topics, practice questions were given which were done by the students. While performing the questions doubts of students were also cleared side by side which helped the students to perform the practice questions.
Day 2:
On the second day of the workshop, the topics of day 1 were revised, and after the revision new topic was started – Stacks, Queues, Searching, and bubble sort.
- Stack and Queue: implementation of stacks and queues on arrays and singly-linked list
- Searching: implementing linear and binary search on an array
- Sorting: in sorting only bubble sort was covered on day 2.
After the explanation, the practice questions were given which were based on practicing the implementation of stack, queues, and searching (both types). Along with practice questions, the doubts of the students were cleared by ma'am.
Day 3:
On day 3, the sorting topic was continued i.e. selection sort, insertion sort, and merge sort. After completing sorting less time was left thus hashing topic was explained a little bit. Sorting was explained and the implementation of sorting on arrays was practiced by students with the support of ma'am. In the hashing topic the topic of hash table and the process of how hashing works was explained. After the explanation practice session was there where students brainstormed on solving problems given by the teacher.
Day 4:
On day 4, the hashing topic was continued. The hashing techniques were explained theoretically. After completion of the hashing topic, the last topics graphs and trees were covered.
- Graphs: basic components of graphs, application of graphs, and Breadth First Traversal (BFT) and Depth First Traversal (DFT).
- Trees: basic terminologies of tree data structure, types of tree data structures, basic operations of tree data structure and different types of traversal, and implementation of tree data structure.
After completion of all the topics, a quick recap was done and interview questions about data structures which are frequently asked to the students were discussed. Students themselves answered the questions and all the doubts were also cleared. With the collaborative efforts of both the teacher and the students, the workshop drew to a successful conclusion, having thoroughly covered all the topics on the agenda.