mlennig Goto Github PK

481-project-maglev

Magnetic Levitation ECP Model 730

auvsi_suas

bank_teller_simulator

Bank teller simulator.

calculator

A basic calculator and a scientific calculator.

chapter10_sorting_and_searching

Common Sorting Algorithms, Searching Algorithms

chapter11_testing

What the Interviewer is Looking For, Testing a Real World Object, Testing a Piece of Software, Testing a Function, Troubleshooting Questions

chapter12_c_and_cpp

Classes and Inheritance, Constructors and Destructors, Virtual Functions, Virtual Destructor, Default Values, Operator Overloading, Pointers and References, Templates

chapter13_java

How to Approach, Overloading vs. Overriding, Collection Framework

chapter14_databases

SQL Syntax and Variations, Denormalized vs. Normalized Databases, SQL Statements, Small Database Design, Large Database Design

chapter15_threads_and_locks

Threads in Java, Synchronization and Locks, Deadlocks and Deadlock Prevention

chapter16_moderate

chapter17_hard

chapter1_arrays_and_strings

Hash Tables, ArrayList & Resizable Arrays, StringBuilder

chapter2_linked_lists

Creating a Linked List, Deleting a Node from a Singly Linked List, The "Runner" Technique, Recursive Problems,

chapter3_stacks_and_queues

Implementing a Stack, Implementing a Queue

chapter4_trees_and_graphs

Types of Trees, Binary Tree Traversal, Binary Heaps (Min-Heaps and Max-Heaps)

chapter5_bit_manipulation

Bit Manipulation By Hand, Bit Facts and Tricks, Two's Complement and Negative Numbers, Arithmetic vs. Logical Right Shift, Common Bit Tasks: Getting and Setting

chapter6_math_and_logic_puzzles

Prime Numbers, Probability, Start Talking, Develop Rules and Patterns, Worst Case Shifting, Algorithm Approaches

chapter7_object_oriented_design

How to Approach, Design Patterns

chapter8_recursion_and_dynamic_programming

How to Approach, Recursive vs. Interative Solutions

chapter9_system_design_and_scalability

Handling the Questions, Design: Step-By-Step, Algorithms that Scale: Step-By-Step, Key Concepts

courses

Courses for software developement.

final_walls_game

The game of ‘Walls’ is comprised of an NxN board of squares (like chess, for example) and two players (say A and B), where N is odd and greater than 1. Each game is played twice, one time with player A starting the game and another with player B making the first move. The game has a start state, play rules that determine legal moves and an end state. Once a game ends, there is a certain accounting that decides the game result.

first_evolutionary_algorithm

Evolutionary algorithm with two different types of fitness functions: Langermann and cubic.

hello-world

Test

infix_to_postfix

Turns infix notation into postfix notation.

interview_questions

Coding interview questions.

manual_object_detection

mergesort

Program capable of sorting up to 100k decimal numbers using both recursive and loop-based implementations of merge-sort.

prototype-1

First Unity project