CS321

Cairo University

Here are the best resources to pass CS321. Find CS321 study guides, notes, assignments, and much more.

All 7 results

Sort by:

Package deal

Algorithms Analysis and Design
-

-

-

6

February 2024
This package include some of the content of "Algorithms Analysis and Design" Course. In this package, you will find a detailed explanation of "Greedy Algorithms", "Dynamic Programming", "Hashing", a simple summary of "Red-Black Tree Insertion and Deletion" and some examples on how to find the "Recurrence Relations" of some algorithms.
roaaemaduldin
$35.49 More Info

Summary

Red-Black Tree Insertion and Deletion
-

-

-

2

February 2024

2023/2024
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.
roaaemaduldin
$9.49 More Info

Other

Algorithm Analysis Examples | Recurrence Relations - 2023/2024
-

-

-

3

February 2024

2023/2024
This document provides some examples and their solutions for analyzing algorithms and deducing their recurrence relations.
roaaemaduldin
$8.49 More Info

Summary

Hashing Data Structure - 2023/2024
-

-

-

4

February 2024

2023/2024
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.
roaaemaduldin
$8.49 More Info

Summary

Hash Table - Data Structures - 2023/2024
-

-

-

5

February 2024

2023/2024
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.
roaaemaduldin
$8.49 More Info

Summary

Greedy Algorithms
-

-

-

12

February 2024

2023/2024
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.
roaaemaduldin
$10.99 More Info

Summary

Dynamic Programming 2023/2024
-

-

-

14

February 2024

2023/2024
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.
roaaemaduldin
$7.99 More Info