reemabdelhaleemhassan Goto Github PK

cfe-recommender

computer-vision

Assignments for computer vision courses (CC490) introduced by Dr. Marwan Torki, Fall 2022

face-recognition

image-segmentation

modulation-classification

multi-threaded-web-server--http-web-client

react-app

red-black-trees

You are required to implement the Red-Black Tree data structure supporting the following operations: 1. Search: Search for a specific element in a Red-Black Tree. 2.Insertion: Insert a new node in a Red-Black tree. Tree balance must be maintained via the rotation operations. 3.Print Tree Height: Print the height of the Red-Black tree. This is the longest path from the root to a leaf-node. 4.Print Tree size: Print the number of elements in Red-Black tree. 3. Application: English Dictionary As an application based on your Red-Black Tree implementation, you are required to implement a simple English dictionary, with a simple text-based user interface, supporting the following functionalities: 1- Load Dictionary: - You will be provided with a text file, “dictionary.txt", containing a list of words. Each word will be in a separate line. - You should load the dictionary into a Red-Black Tree data structure to support efficient insertions and search operations.2- Print Dictionary Size: - Prints the current size of your dictionary. 3- Insert Word: - Takes a word from the user and inserts it, only if it is not already in the dictionary. Otherwise, print the appropriate error message (e.g. “ERROR: Word already in the dictionary!"). 4- Look-up a Word: - Takes a word from the user and prints “YES" or “NO" according to whether it is found or not.

root-finder-program

software-engineering-project-1

Fast Order Machine

sorting-techniques

You are required to implement: - three O ( ଶ ) sorting algorithms: Selection Sort, Bubble Sort, and Insertion Sort. - three O (n log n) sorting algorithms: Merge Sort, Heap Sort and Quick sort algorithm in the average case. Now you have implemented six sorting techniques: three of them are O ( ଶ ) and the other three are O (n log n). You are required to compare the running time performance of your algorithms against each other. To test your implementation and analyze the running time performance, generate a dataset of random numbers, and plot the relationship between the execution time of the sorting algorithm versus the input size.

speech-emotion-recognition

term-project-g7

term-project-g7 created by GitHub Classroom