cairo university
Latest uploads at cairo university. Looking for notes at cairo university? We have lots of notes, study guides and study notes available for your school.
-
191
- 0
-
8
All courses for cairo university
-
Accounting 1
-
ANATOMY 2
-
Business 1
-
Calculus MATH1101 6
-
Circuits 1
-
CS321 Algorithms 6
-
CS427 - Android CS427 1
-
Differential calculus MAT101 8
-
Differential equations MATH-3 1
-
Eco 3101 1
-
Embedded System 21
-
Good suhd_56 2
-
Health & Medical 1
-
Higher-order Differential equations Math-3 1
-
IMED 601 5
-
IMS VOLTE Solution 7
-
Introduction to economy 1
-
Iot 1
-
MATH111 pro2030 3
-
Medicine 37
-
Module 207 / 208 2
-
Nursing 1
-
Pharmacology 1 PL313 2
-
Physiology cardiopulmonary 3
-
Pituitary Gland disorders 601 1
-
Pol777 2
-
Political science 2
-
Software Engineering 8
-
STRN441 STRN441 3
-
TCP Wireshark Analysis 11
Latest notes & summaries cairo university
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.
- Package deal
- Summary
- • 2 pages's •
-
Cairo University•CS321
-
Algorithms Analysis and Design• By roaaemaduldin
Preview 1 out of 2 pages
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.
This document provides some examples and their solutions for analyzing algorithms and deducing their recurrence relations.
- Package deal
- Other
- • 3 pages's •
-
Cairo University•CS321
-
Algorithms Analysis and Design• By roaaemaduldin
Preview 1 out of 3 pages
This document provides some examples and their solutions for analyzing algorithms and deducing their recurrence relations.
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.
- Package deal
- Summary
- • 4 pages's •
-
Cairo University•CS321
-
Algorithms Analysis and Design• By roaaemaduldin
Preview 1 out of 4 pages
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.
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.
- Package deal
- Summary
- • 5 pages's •
-
Cairo University•CS321
-
Algorithms Analysis and Design• By roaaemaduldin
Preview 3 out of 5 pages
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.
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.
- Package deal
- Summary
- • 12 pages's •
-
Cairo University•CS321
-
Algorithms Analysis and Design• By roaaemaduldin
Preview 3 out of 12 pages
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.
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.
- Package deal
- Summary
- • 14 pages's •
-
Cairo University•CS321
-
Algorithms Analysis and Design• By roaaemaduldin
Preview 3 out of 14 pages
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.
.
- Exam (elaborations)
- • 26 pages's •
-
Cairo University•eco 3101
Preview 3 out of 26 pages
.
summary of Hemodynamic disorders
- Summary
- • 4 pages's •
-
Cairo University•1
Preview 1 out of 4 pages
summary of Hemodynamic disorders
Pituitary Gland Disorders Notes & Keywords made simple & effective to study about following topics: 
Hyperpituitarism & related diseases - Acromegaly & Prolactinoma 
Hypopituitarism & related diseases - Diabetes Insipidus
- Summary
- • 3 pages's •
-
Cairo University•Pituitary Gland disorders
Preview 1 out of 3 pages
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
- Package deal
- Class notes
- • 1 pages's •
-
Cairo University•IMED 601
-
Hematology - Anemia Notes Causes, clinical picture, diagnosis, treatment, exam keywords• By abdullahsabbah
Preview 1 out of 1 pages
Understanding Iron Deficiency Anemia: A Comprehensive Guide