This lecture includes the following topics: Valgrind. Bitwise operators. Hash tables. Trees. Binary search trees. Tries. Heaps. Heapsort. Huffman coding.
- Subject:
- Computer Science
- Material Type:
- Lecture
- Provider:
- Harvard
- Date Added:
- 12/23/2015
This lecture includes the following topics: Valgrind. Bitwise operators. Hash tables. Trees. Binary search trees. Tries. Heaps. Heapsort. Huffman coding.
This lecture includes the following topics: TCP/IP. HTTP. XHTML. PHP. SQL.
This lecture includes the following topics: TCP/IP. HTTP. XHTML. PHP. SQL.
This lecture includes the following topics: DOM. CSS. Inheritance. JavaScript. Events, continued. OOP. Ajax.
This lecture includes the following topics: DOM. CSS. Inheritance. JavaScript. Events, continued. OOP. Ajax.
This lecture includes the following topics: Preprocessing. Compiling. Assembling. Linking. CPUs.
This lecture includes the following topics: Enterprise architectures. Virtualization. Cloud computing. Sneak previews.
This lecture includes the following topics: Enterprise architectures. Virtualization. Cloud computing. Sneak previews.
This lecture includes the following topics: Introduction. Bits. Binary. ASCII. Programming. Algorithms. Scratch. Statements. Boolean expressions. Conditions. Loops. Variables. Threads. Events.
This lecture includes the following topics: Exciting conclusion.
This lecture includes the following topics: Introduction. Bits. Binary. ASCII. Programming. Algorithms. Scratch. Statements. Boolean expressions. Conditions. Loops. Variables. Threads. Events.
This lecture includes the following topics: Functions, continued. Global variables. Parameters. Return values. Stack. Frames. Scope. Arrays. Strings. Command-line arguments. Cryptography.
This lecture includes the following topics: Functions, continued. Global variables. Parameters. Return values. Stack. Frames. Scope. Arrays. Strings. Command-line arguments. Cryptography.
This lecture includes the following topics: Linear search. Binary search. Asymptotic notation. Recursion. Pseudorandomness. Bubble sort. Selection sort. Insertion sort. Merge sort. Debugging.
This lecture includes the following topics: Linear search. Binary search. Asymptotic notation. Recursion. Pseudorandomness. Bubble sort. Selection sort. Insertion sort. Merge sort. Debugging.
This lecture includes the following topics: Structures. Dynamic memory allocation. Pointers.
This lecture includes the following topics: Debugging, continued. Pointers, continued. Heap. File I/O. Forensics.
This lecture includes the following topics: Debugging, continued. Pointers, continued. Heap. File I/O. Forensics.
This lecture includes the following topics: Tartan Dice; Terminated Geometric; World Series Pitchers; Negative Hypergeometric; Coin Tossing.
This lecture includes the following topics: Casino Night; Random Walk Examples; Random Walk Terminology; Gambler's Ruin; Ruin in Fair Casino; Time until Win or Ruin; A Fair Game; Walk as a Random Variable; Ballot Theorem; Hitting Time Theorem; Expected Lead Times.