Skip to main content
Graph
Search
fr
en
Login
Search
All
Categories
Concepts
Courses
Lectures
MOOCs
People
Quizes
Exercises
Publications
Startups
Units
Show all results for
Home
Course
CS-101: Advanced information, computation, communication I
Graph Chatbot
Lectures in this course (309)
Equivalence Relations: Classes, Partitions
Explains equivalence relations, classes, and partitions in sets.
Partial Ordering: Relations, Sequences, Summation
Introduces partial orderings, lattices, and lexicographic orderings on Cartesian products.
Sequences: Relations, Summation, Strings
Covers arithmetic and geometric progressions, strings, and recurrence relations in sequences.
Number Sequences: Guessing, Modeling, and Solving Recurrence Relations
Covers the identification of number sequences, modeling population growth, and solving recurrence relations.
Summation and Sequences: Notation and Formulas
Covers summation notation, product notation, and geometric series formulas.
Cardinality of Sets: Countable and Uncountable
Explores countable and uncountable sets, demonstrating how to determine the cardinality of different sets through listing elements in a sequence.
Algorithms: Organisational Questions
Covers organizational issues, exercise content, COVID regulations, mock exam plans, and a mid-semester survey.
Algorithms: Summary of the week
Covers algorithms for searching, sorting, optimization, and the Halting Problem.
Algorithms: Halting Problem Quiz
Explores the Halting Problem, efficient list element positioning, and the cashier's algorithm.
Propositional Logic: Quiz Answers
Covers the answers to a quiz on propositional logic, emphasizing the importance of clarity in logical statements.
Marriage Problem: Gale Shapley Algorithm
Covers the Marriage Problem and the Gale Shapley Algorithm to find stable matches.
Algorithms: Finding Maximum Value in a Sequence
Covers finding the maximum value in a sequence of integers using different algorithm specifications and types.
Searching Algorithms: Linear and Binary Search
Covers linear and binary search algorithms for locating items in a list.
Sorting Algorithms: Bubble and Insertion Sort
Covers the basic sorting algorithms, Bubble Sort and Insertion Sort, and hints at more efficient ones.
Optimisation Algorithms: Greedy Approach
Explores optimization problems solved with greedy algorithms and proves the optimality of the Cashier's Algorithm for U.S. coins.
Algorithms: Stable Matchings
Covers the concept of stable matchings and the Gale-Shapley algorithm.
Halting Problem: Unsolvable Problems
Explores the halting problem, demonstrating its unsolvability and the limitations of algorithms.
Complexity of Algorithms: Proofs of Big-O
Covers proofs of Big-O using witnesses and rules to analyze algorithm complexity.
Complexity of Algorithms: Proofs of Time Complexity
Covers the analysis of worst time complexity for algorithms and time complexity with real numbers and integers.
Course Organization: Online Exercises and Q&A Channel
Discusses the transition to online exercises, Discord reorganization, and Q&A channel.
Previous
Page 6 of 16
Next