Scribd
Upload
3 views7 pages

Report of Bootcamp On Advance Data Structures - TY B Div

The document reports on a 3-day bootcamp on 'Advanced Data Structures' held at JSPM’s Rajarshi Shahu College of Engineering, featuring Dr. Ajitkumar Shitole as the speaker. The sessions covered topics including hashing, linked lists, binary trees, and graphs, with a focus on their applications and traversal techniques. A total of 78 students participated, and the bootcamp aimed to enhance students' understanding of advanced data structures relevant to computer engineering.

Uploaded by

Pradnya Vikhar
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
3 views7 pages

Report of Bootcamp On Advance Data Structures - TY B Div

The document reports on a 3-day bootcamp on 'Advanced Data Structures' held at JSPM’s Rajarshi Shahu College of Engineering, featuring Dr. Ajitkumar Shitole as the speaker. The sessions covered topics including hashing, linked lists, binary trees, and graphs, with a focus on their applications and traversal techniques. A total of 78 students participated, and the bootcamp aimed to enhance students' understanding of advanced data structures relevant to computer engineering.

Uploaded by

Pradnya Vikhar
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/ 7

JSPM’s Rajarshi Shahu College Of Engineering,

Tathawade, Pune – 33.


(An Autonomous Institute Affiliated To Savitribai Phule Pune
University, Pune)
DEPARTMENT OF COMPUTER ENGINEERING

REPORT OF 3-DAYS BOOTCAMP ON “Advanced Data Structures”

UNDER Coding Club in association with IEEE student chapter

Class : T. Y. B. Tech B div Students of Computer Department

Name of Workshop : 3-DAYS BOOTCAMP ON“Advanced Data Structures”

Date & Day : 10th, 13th, 17th March 2025

Time : 9:00 am to 1:00 pm

Name of Speaker : Dr. Ajitkumar Shitole,


Associate Professor, International Institute of Information
Technology, Pune

9922963537

Total No. of students : 78

POs Mapped : PO1, PO2,PO3, PO5, PO9, PO10,PO12

PSOs Mapped: PSO1: Domain Specialization, PSO3: Professional Career and


Entrepreneurship

Speaker: Dr. Ajitkumar Shitole

About Speaker:

Dr. Ajitkumar S. Shitole completed Ph.D. in Computer Science Engineering from Amity
University Maharashtra, Mumbai. He has published more than 25 research papers in various
International / National Journals / Conferences. His area of interest is Data Mining, Machine
Learning, and Algorithms. Currently,he is working as an Associate Professor in Computer
Engineering Department at I2IT Hinjawadi, Pune. He has published two books titled "Design
and Analysis of Algorithms" for SPPU and BATU. He is having more than 20 years of
teaching experience
Day:Monday Date: 10-03-2025

Session : 1

Topic: Hashing and Linked List

Details: Following points were covered on day 1.

1. Hash Functions

A hash function converts input data (keys) into a fixed-size numerical value, called a
hash code. A good hash function ensures uniform distribution to avoid collisions.

2. Collision Handling Techniques

Collisions occur when two keys generate the same hash value. Common techniques to
handle collisions include:

A) Chaining: Uses linked lists to store multiple values at the same index.

B) Open Addressing: Finds alternative locations within the hash table (e.g., linear
probing, quadratic probing, and double hashing).

3. Applications of Hashing

4. Types of Linked Lists

Singly Linked List: Each node has a single pointer to the next node.

Doubly Linked List: Each node has two pointers, one pointing to the next node and
another to the previous node.

Circular Linked List: The last node links back to the first node, forming a loop.

5. Advantages and Disadvantages of Linked Lists

6. Applications of Linked Lists

The session concluded with a discussion on the advantages of binary trees in handling
hierarchical data. The speaker emphasized their significance in improving search
efficiency and memory utilization, making them essential in various computing
applications.
Glimpses of Day1 (10/03/2025)

Day:Thursday Date: 13-03-2025


Session : 2
Topic: Binary Trees
Details: Following points were covered on day 2.
1. Introduction
The session covered the concept of binary trees, which are hierarchical data structures
widely used in computer science. The speaker explained that a binary tree consists of
nodes, each having at most two children, known as the left and right child. The
importance of binary trees in various applications was also highlighted.
2. Types of Binary Trees
During the session, the speaker discussed different types of binary trees, including:
Full Binary Tree: A tree where every node had either zero or two children.
Complete Binary Tree: A tree where all levels were completely filled except possibly
the last level.
Perfect Binary Tree: A binary tree where all interior nodes had two children, and all
leaf nodes were at the same level.
Balanced Binary Tree: A tree where the height difference between left and right
subtrees was at most one.
Degenerate Tree: A binary tree where each node had only one child, making it similar
to a linked list.
3. Binary Tree Traversal Methods
The speaker elaborated on various traversal techniques used to access the
elements of a binary tree:
Inorder Traversal (Left, Root, Right): Used to retrieve data in a sorted order.
Preorder Traversal (Root, Left, Right): Useful for copying a tree structure.
Postorder Traversal (Left, Right, Root): Commonly used for deleting nodes in a tree.
Level Order Traversal: Nodes were visited level by level using a queue.
4. Operations on Binary Trees
Key operations on binary trees, as discussed in the session, included:
Insertion: Adding nodes while maintaining binary tree properties.
Deletion: Handling different cases, such as deleting a leaf node or a node with children.

Searching: Efficient techniques to locate specific nodes.

Height Calculation: Determining the height of a tree using recursive methods.

5. Applications of Binary Trees


The session concluded with a discussion on the advantages of binary trees in handling
hierarchical data. The speaker emphasized their significance in improving search
efficiency and memory utilization, making them essential in various computing
applications.

Glimpses of Day2 (13/03/2025)


Session: 3
Topic: Graphs and Traversal Techniques
Details: Following points were covered on day 3.
Report on Graphs and Traversal Techniques

1. Introduction

The session covered the concept of graphs, a fundamental data structure used to
represent relationships between objects. The speaker explained that graphs consist of
vertices (nodes) and edges (connections), which can be directed or undirected. The
importance of graphs in various applications, such as networking, social media, and
route optimization, was also highlighted.

2. Types of Graphs

During the session, the speaker discussed different types of graphs, including:

Undirected Graph: A graph where edges do not have a direction.

Directed Graph (Digraph): A graph where edges have a specific direction.

Weighted Graph: A graph where edges have weights representing costs or distances.

Unweighted Graph: A graph where edges have no associated weights.

Connected Graph: A graph where there is at least one path between any two vertices.

Disconnected Graph: A graph where some vertices do not have a connecting path.

Cyclic Graph: A graph that contains at least one cycle.

Acyclic Graph: A graph with no cycles, such as a tree.

3. Graph Representation

The speaker elaborated on various ways to represent graphs in computer memory:

Adjacency Matrix: A 2D array where rows and columns represent vertices, and values
indicate edge presence.

Adjacency List: A collection of lists where each vertex has a list of adjacent vertices.

Edge List: A list of all edges in the graph, specifying the start and end vertices.

4. Graph Traversal Techniques

The session focused on two primary traversal techniques used for exploring graphs:

Breadth-First Search (BFS): A level-wise traversal that uses a queue to explore all
neighbors of a vertex before moving deeper.
Depth-First Search (DFS): A recursive or stack-based traversal method that explores
as far as possible along one branch before backtracking.

6. Applications of Graphs

The session concluded with a discussion on how graphs and their traversal techniques
are crucial in solving real-world problems efficiently. The speaker emphasized the
importance of choosing the appropriate traversal method based on the problem
requirements.

Dr. Rushali A. Deshmukh Dr. Seema V. Kedar

Event Coordinator HOD

You might also like