Skip to content

nicoku08/DataStructures

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

8 Commits
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

DataStructures

Projects from class

  1. Big Integer: When the integer becomes larger than what an int datatype can hold, we need to create a program that allows us to store an integer as a linked list of digits. We can do parse, add, subtract and multiply operations with given integers. BigTest and DigitNode classes had been provided.
  2. Expression Evaluation: Evaluate given arbitrary expressions primarily composed by mathematical operators, array of integers, variables, and subexpressions. Array, Evaluator, and Variable class provided.
  3. Trie: Application to build a tree structure called Trie for a dictionary of English words, and use the Trie to generate completion lists for prefix searches. TrieApp and TrieNode classes had been provided.
  4. Friends: Implement different algorithms for graphs that represent friendships (e.g. Facebook). A friendship graph is an undirected graph without any weights on the edges. The graph allows to look for the shortest chain between friendships, any 'cliques' or group of friends, the friends considered 'connectors' so other people's friendship's depend on them. Edge, Friend, Person, and Graph class provided.

About

Projects from class

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages