Theintnwenyein

This package includes everything you need to master Data Structures and Algorithms including but not limited to basic definitions and terms, the time complexity for different operations, and characteristics of each data structure and each algorithm. An 80% grade is easily achievable once every concept in this package is digested.

This informative document covers all the common and (some) exclusive algorithms for Data Structures and Algorithms Course from Bubble sort to Topological sort to Dijkstra's Shortest Path Algorithm and Prim's Algorithm on Minimum Spanning Tree. The advantages, disadvantages, time complexities of possible operations and characteristics of each algorithm are fully explained. This is a lot of information and it is recommended to take some time to digest all the information for a full understanding...

This presentation is designed to use as a reference for studying Open Systems Interconnection Model. Every application layer of the OSI model is explained in detail in addition to the basic understanding of what the OSI model is, and why and how we use it in real-world applications. This presentation includes a number of images for easy visualization and learning and provides a fun experience while learning all the important concepts without a boring moment.

This presentation consists of 54 slides which cover very detailed information and terms on each data structure every computer science student should know. In addition to common structures, this presentation briefly introduces Skip List, Red-Black Tree, Weight-balanced Tree, and Abstract Syntax Tree. This is a unique presentation as it is designed to provide an interactive and fun interface without boring the students with too much information. It is suggested to take time and carefully read thro...

This document covers the Data Structures part of CSCI362. This is a sophomore-level class on Data Structures and Algorithms with Professor Jiang Zheng. You can find detailed notes on each data structure from array to trees(as well as other popular kinds of trees like splay trees and b-trees) and graphs. Besides, this document also includes time complexities for different operations on each data structure, and instructions on how to convert between prefix (polish), infix, and postfix notations.