Fresno State Tutoring Student Success Site

CSCI 115

Resources

Note: If you want to look for some simpler data structures, check out the CSCI 41 page.

DataStructure (Like almost all of them)

AlgoExpert | Ace the Coding InterviewsThe leading platform to prepare for coding interviews. Master essential algorithms and data structures, and land your dream job with AlgoExpert.

Asymptotic Notation

Functions in Asymptotic Notation - A Visual Introduction to Algorithms

Analysis of Algorithms | Set 3 (Asymptotic Notations) - GeeksforGeeksA Computer Science portal for geeks. It contains well written, well thought and well explained computer science and programming articles, quizzes and practice/competitive programming/company interview Questions.

Data Structure Asymptotic NotationAsymptotic Notations are the expressions that are used to represent the complexity of an algorithm. As we discussed in the last tutorial, there are three

Asymptotic Analysis | Benefits and Top 5 Asymptotic Notations with GraphsGuide to Asymptotic Analysis. Here we discuss what is Asymptotic Analysis along with the top 5 asymptotic notations as well as respective benefits.

Solving Recurrences

Analysis of Algorithm | Set 4 (Solving Recurrences) - GeeksforGeeksA Computer Science portal for geeks. It contains well written, well thought and well explained computer science and programming articles, quizzes and practice/competitive programming/company interview Questions.

The Substitution Method for Solving Recurrences | Brilliant Math & Science WikiThe substitution method for solving recurrences is famously described using two steps: Guess the form of the solution. Use induction to show that the guess is valid. This method is especially powerful when we encounter recurrences that are non-trivial and unreadable via the master theorem. We can use the substitution method to establish both upper and lower bounds on recurrences. The name comes from the substitution of the guessed answer for the function when …

Sorting algorithms

Sorting Algorithms | Brilliant Math & Science WikiA sorting algorithm is an algorithm made up of a series of instructions that takes an array as input, performs specified operations on the array, sometimes called a list, and outputs a sorted array. Sorting algorithms are often taught early in computer science classes as they provide a straightforward way to introduce other key computer science topics like Big-O notation, divide-and-conquer methods, and data structures such as binary trees, and heaps. There …

Non Comparison based Sorting AlgorithmsWe have explored various non-comparison sorting algorithms like Counting Sort, Radix Sort, Postman Sort and others along with their advantages / disadvantages.

Sorting Algorithms — With PythonThis blog compares the sorting algorithms and their performance through one of Leetcode question.

Visualize Sorting Algorithms: VisuAlgo

Linked Lists

Using the Linked List Data Structure in PythonThe linked list data structure is a linear data structure that is used to implement other data structures.

Introduction to Linked Lists – Techie DelightA linked list is a linear data structure consisting of a group of nodes where each node point to the next node through a pointer. Each node is composed of data and a reference (in other words, a link) to the next node in the sequence.

Quizlet Covering The Above Topics

CSCI 115 Part 1 Study Set

Reading File

Binary Search Trees

Other Links:

https://www.programiz.com/dsa/binary-search-tree

Binary Search Tree (BST) with ExampleWhat is a Binary Search Tree? The binary search tree is an advanced algorithm used for analyzing the node, its left and right branches, which are modeled in a tree structure and returning the value.

Red Black Trees

Other Links:

https://www.programiz.com/dsa/red-black-tree

https://www.codesdope.com/course/data-structures-red-black-trees-insertion/

Hash Tables

Basics of Hash Tables Tutorials & Notes | Data Structures | HackerEarthDetailed tutorial on Basics of Hash Tables to improve your understanding of Data Structures. Also try practice problems to test & improve your skill level.

Hash Table in C/C++ - A Complete Implementation - JournalDevA Hash Table in C/C++ (Associative array) is a data structure that maps keys to values. This uses a hash function to compute indexes for a key. Based on

C++ Hash Table | Algorithm and Examples of C++ Hash TableGuide to C++ Hash Table. Here we also discuss the algorithm of hash table in c++ along with different examples and its code implementation.

The Basics of Hash TableHash table is fundamentally a data structure that offers fast insertion, lookup and deletion.

Other Links:

Graphs

Graph Data Structure And Algorithms - GeeksforGeeksA Computer Science portal for geeks. It contains well written, well thought and well explained computer science and programming articles, quizzes and practice/competitive programming/company interview Questions.

Representing Graph Data StructuresIt’s really all about the Edges.

A Gentle Introduction to Data Structures: How Graphs Workby Michael Olorunnisola A Gentle Introduction to Data Structures: How Graphs WorkSource: TheNextWebSo who wants to work at Google, Facebook, or maybe LinkedIn? Beyond their grueling interview process, one thing all these companies have in common is their heavy reliance on the graph data structure. After learning a bit about

What is a graph (data structure)?What is a graph (data structure)?

Graphs in Data Structure: Overview, Types & More | SimplilearnExplore what are graphs in data structure, its types, terminologies, representation and operations. Read on to know how to implement code in graph data structure. Keep learning!

BFS and DFS

Breadth First Search or BFS for a Graph - GeeksforGeeksA Computer Science portal for geeks. It contains well written, well thought and well explained computer science and programming articles, quizzes and practice/competitive programming/company interview Questions.

Depth First Search - InterviewBit

Breadth First Search Tutorials & Notes | Algorithms | HackerEarthDetailed tutorial on Breadth First Search to improve your understanding of Algorithms. Also try practice problems to test & improve your skill level.

Depth-first search - Wikipedia Republished // WIKI 2Depth-first search (DFS) is an algorithm for traversing or searching tree or graph data structures. The algorithm starts at the root node (selecting some arbitrary node as the root node in the case of a graph) and explores as far as possible along each branch before backtracking.

Prim's and Kruskal's Algorithm

Kruskal’s vs Prim’s Algorithm | Baeldung on Computer ScienceA quick and practical overview of Kruskal's and Prim's algorithms.

Difference between Prim's and Kruskal's algorithm for MST - GeeksforGeeksA Computer Science portal for geeks. It contains well written, well thought and well explained computer science and programming articles, quizzes and practice/competitive programming/company interview Questions.

Prim’s and Kruskal’s AlgorithmAn overview of two of the most popular greedy algorithms

Report abuse