Study guides, Class notes & Summaries
Looking for the best study guides, study notes and summaries about ? On this page you'll find 182 study documents about .
All 182 results
Sort by
-
Red-Black Tree Insertion and Deletion
- Summary • 2 pages • 2024
-
Available in package deal
-
- $8.99
- + learn more
This document summarizes the steps to be implemented that are needed when inserting a new element into the tree or deleting an existing element from the tree.
-
Algorithm Analysis Examples | Recurrence Relations - 2023/2024
- Other • 3 pages • 2024
-
Available in package deal
-
- $7.99
- + learn more
This document provides some examples and their solutions for analyzing algorithms and deducing their recurrence relations.
-
Hashing Data Structure - 2023/2024
- Summary • 4 pages • 2024
-
Available in package deal
-
- $7.99
- + learn more
This document provides an explanation of the definition of HASHING, how to use it, some of its types and how to avoid COLLISION that may occur due to using some hash functions.
-
Hash Table - Data Structures - 2023/2024
- Summary • 5 pages • 2024
-
Available in package deal
-
- $7.99
- + learn more
Hashing is a way of storing the data in more efficient way that needs less space or memory according to the hash function used. This document explains what is meant by hashing, how it is implemented and provides a summary of some types of hashing with illustrating.
-
Greedy Algorithms
- Summary • 12 pages • 2024
-
Available in package deal
-
- $10.49
- + learn more
A greedy algorithm is an algorithmic strategy that makes the optimal choice at each small stage (subproblem), with the goal of eventually leading to globally optimum solution. 
 
This document explains the definition of a greedy algorithm, the difference between greedy algorithm and dynamic programming and it provides a explanation of some greedy algorithms as Huffman Encoding, Minimum Spanning Tree (MST) and its different algorithms, graph review and Shortest-Path algorithm.
Get paid weekly? You can!
-
Dynamic Programming 2023/2024
- Summary • 14 pages • 2024
-
Available in package deal
-
- $7.49
- + learn more
Dynamic Programming is a computer technique where an algorithmic problem is first broken down into subproblems, the results are saved and then the subproblems are optimized to find the overall solution. 
 
This document describes and explains the definition of dynamic programming, the main idea it is based on, where to use it, how to use it and provides multiple examples with simple explanation.
-
marketing quetions with answers
- Exam (elaborations) • 26 pages • 2024
-
- $8.29
- + learn more
.
-
summary of Hemodynamic disorders
- Summary • 4 pages • 2024
-
- $8.49
- + learn more
summary of Hemodynamic disorders
-
Pituitary Gland Disorders Notes & keywords for exams - made simple
- Summary • 3 pages • 2023
-
- $10.49
- + learn more
Pituitary Gland Disorders Notes & Keywords made simple & effective to study about following topics: 
Hyperpituitarism & related diseases - Acromegaly & Prolactinoma 
Hypopituitarism & related diseases - Diabetes Insipidus
-
Understanding Iron Deficiency Anemia: A Comprehensive Guide
- Class notes • 1 pages • 2023
-
Available in package deal
-
- $5.49
- + learn more
Understanding Iron Deficiency Anemia: A Comprehensive Guide
That summary you just bought made someone very happy. Also get paid weekly? Sell your study resources on Stuvia! Discover all about earning on Stuvia