Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd
Upload
6 views

Week 10_ Data Science_ Data Structures 3 (1)

Uploaded by

jaseel
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
6 views

Week 10_ Data Science_ Data Structures 3 (1)

Uploaded by

jaseel
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 4

Week 10 - Data Structures 3

Name:
Mobile:

Data Structure Workouts

1. Learn the concepts of Tree. Complete at least three sample workouts.


2. Learn the concepts of Binary Search Tree. Complete at least three sample workouts.
Example:
a. Create a Binary Search Tree with insertion, contains, delete, three traversals
(postorder, preorder, in order).
b. Find the closest value to a given number in a Tree.
c. Validate whether a given tree is BST or not.
3. Learn the concepts of Heap. Complete at least three sample workouts.
Example:
a. Create a min heap & max heap with build, insert, remove.
4. Learn the concept of Heap sort. Complete at least three sample workouts
5. Learn the concepts of Trie. Complete at least 3 sample workouts.
6. Learn the concepts of Graph. Complete at least three sample workouts.
7. Learn the concepts of Graph traversals (BFS, DFS).
8. Do at least 3 problems each for every structure from any competitive coding websites
9. Learn about the applications of all structures you covered this week

Write a short description about this task

In this task we are supposed to cover trees, this is an important concept in data structure.Trees
are a fundamental concept in computer science and data structures, offering a hierarchical
way of organising data. Imagine a tree in nature, with a trunk, branches, and leaves. Similarly,
in a tree data structure, there's a root node from which branches (child nodes) extend, further
branching out into smaller nodes or leaf nodes. Each node in a tree can have zero or more
child nodes, except the leaf nodes, which have no children.

Link to the folder containing code and screenshot of the output


https://drive.google.com/file/d/1a605Ujk81zoy55TPhuL9DvkWUC3qYgeY/view?
usp=drive_link

Write a short description about this task

In this task we are asked to learn about binary tree, binary search tree is where each node
can have at most two children.a left child and a right child.this allows for efficient
searching and insertion of data.

Link to the folder containing code and screenshot of the output


bst.pdf

Write a short description about this task


A heap is a specialized tree-based data structure that is widely used in computer science
for various purposes, primarily for implementing priority queues efficiently. It ensures
that the element with the highest (or lowest) priority can be quickly retrieved, making it
ideal for applications where prioritization and efficient retrieval are crucial.
Link to the folder containing code and screenshot of the output
https://drive.google.com/file/d/1K3uk-86sutW7vow_GAkAkOK0Zl1pJmgA/view?
usp=drive_link

Write a short description about this task


In this task we are suppose to learn about heap sort, in the case of heap sort is used for
comparison and sorting using heap method.Heap sort is a highly efficient comparison-
based sorting algorithm that utilises the heap data structure to achieve sorting in
ascending or descending order. It works by first constructing a heap from the input
array and then repeatedly extracting the maximum (in the case of max heap) or
minimum (in the case of min heap) element from the heap and placing it at the end of
the array.
Link to the folder containing code and screenshot of the output
https://drive.google.com/file/d/1RRtvlvpqd0KuT2buZklVrgT3OOn7lu-q/view?
usp=drive_link
Write a short description about this task
In this task we suppose to learn about trie, A trie, also known as a prefix tree, is a
specialized tree-based data structure used to efficiently store and retrieve dynamic sets
of strings or keys. Unlike many other data structures that store keys in a linear or
hierarchical fashion, a trie arranges keys in a tree structure where each node
represents a single character of the stored strings.

Link to the folder containing code and screenshot of the output


https://drive.google.com/file/d/1925ukuW-MhBS0xQbCsgjb1E0_Rs3qR0Y/view?
usp=drive_link

Write a short description about this task


In this task we are suppose to learn about graph,A graph is a fundamental mathematical
abstraction used to represent relationships or connections between a collection of
objects. These objects, often referred to as vertices or nodes, are connected by edges or
links.
Link to the folder containing code and screenshot of the output
https://drive.google.com/file/d/1MSiINGrAN9Gp7V5HEPnJTWzQm3_FEPpk/view?
usp=drive_link

Write a short description about this task


In this task we are suppose to learn about graph operation, dfs and bfs which are important
concepts to learn in data structure. Depth-First Search (DFS) and Breadth-First
Search (BFS) are fundamental algorithms used for traversing and exploring graphs.
These algorithms enable us to systematically visit each vertex and edge of a graph,
facilitating various graph-related operations and analyses.
https://drive.google.com/file/d/1MSiINGrAN9Gp7V5HEPnJTWzQm3_FEPpk/view?
usp=drive_link
Link to the folder containing code and screenshot of the output

Write a short description about this task

In this task we are suppose to learn in depth about every concepts in this week and do
problem on the topics mentioned above

Link to the folder containing code and screenshot of the output


https://drive.google.com/file/d/1uBYHg2FL777EutJB7O4kabsBRCQ8q8Ik/view?
usp=drive_link

You might also like