Skip to content

mizbahc/CS300-Data-Structures-Homeworks

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

2 Commits
 
 
 
 
 
 
 
 
 
 

Repository files navigation

CS300-Data-Structures-Homeworks

HW1

  • Generating a chessboard of size NxN and
    placing a certain number of pawns on board based on some conditions.
  • Placing king and knight and rescuing king if possible, otherwise return related message.

HW2

  • Creating two Notebooks using AVL Search Tree and Binary Search Tree
    with funcionality of adding removing sections and items.

HW3

  • Creating recommendation system using given TV Show lists
    with implemantation of templated hash table using separate chaining.

HW4

  • Implementing Sort( Insertion, Quick, Merge, Heap ) and
    Search(Sequential, Binary) algorithms.

About

No description, website, or topics provided.

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages