CS2107 - Tutorial 1: Introduction and Encryption
Introduction and Encryption
CS3103 - Lecture 3: IP - Options, ICMP
IP
[Read More]
CS3230 - Lecture 3/4: Backtracking, Dynamic Programming
Lecture 3 and 4
Backtracking
Construct a solution to the problem one piece at a time
Algo recursively evaluates all alrernatives and chooses the best one
Algo exp amount of time in the recursion depth
[Read More]
LAJ2201: Lecture 12
Chapter 12 of N5 Textbook
Assignment 1
Released date: Week 1 - Week 2
CS3237 - Lecture 2: Statistical Methods
Advantages
Statistical methods have better theretical
Statistical methods in general are faster to build and train
Statistical methods usually have fewer hyper parameters to adjust
[Read More]
CS3230: Lecture 2 - Recursive Algorithms
Handling recursion Simplify and delegate If instance can be solve directly, then solve directly Else, Reduce it to one or more simpler instances of exactly the same problem e.g In an algorithm for Squaring a number, one cannot make a recursive call to a multiplying two integer b and c...
[Read More]
CS3103 - Lecture 2/3: ARP, DHCP, VLAN
ARP - Address Resolution Protocol
[Read More]
CS3103 - Assignment 1
Assignment 1
[Read More]
LAJ2201 - Lecture 1: Chapter 11
CS2107 - Lecture 1/2: Encryption
Encryption
An encryption scheme also known as cipher consist of encryption and decryption.
[Read More]
CS3237 - Lecture 1: Introduction
Internet of things
[Read More]
CS3103 - Lecture 1: Introduction to subnet
Internet Today
[Read More]
CS3230 - Lecture 1: Recap of Assymptops
Time complexity
worse case and average:
Worse: Max time that is required with input size n
Avg: Assume that input is distributed somewhere randomly
[Read More]
CS2105 - All lectures
CS2105 Lectures
[Read More]
CS2106 - Tutorial 6: Synchronisation and deadlocks
Synchronisation and deadlocks
[Read More]
ST2334 - Tutorial 9: Sampling and distribution
Chapter 5 and 6
[Read More]
ST2334 - Tutorial 10: Hypothesis testing
Chapter 6 and 7
[Read More]
CS2103T - Past year paper
18/19 -Sem 2 (No answer)
[Read More]