For the Tut+Lab combo, we will run all lab sessions in F2F mode. For the lecture component, we will have onsite sessions on Wednesdays at LT15 (venue booked) but online sessions on Thursday (venue (COM3-MPH123) is not ready to be used). Q: Will CS2040C S1 AY 2022/23 has onsite components? A: Yes. Relevant answers will be posted here to reach wider audiences. If you have any important questions regarding this module, email stevenhalim at gmail dot com. Proper implementation (more emphasis this sem) of (some) data structures and algorithms in C++ with (lesser emphasis this sem) their C++ STL version at the end.Real-life problem solving skills (Complete Search/Brute Force/BF, Divide and Conquer/DnC, Greedy, and Dynamic Programming/DP).More advanced data structures and algorithms design and analysis (compared to CS1010, but not as advanced as CS3230).Minimum Spanning Tree (MST): Kruskal's or Prim's algorithms (both are Greedy) and its applications.Single-Source Shortest Paths (SSSP): Bellman-Ford algorithm (DP), Dijkstra's algorithm (two versions, Greedy), various special cases and various application scenarios, e.g., Shortest Paths on DAG (DP), Shortest Paths on Tree.Graph Traversal (BF): Depth-First Search (DFS), Breadth-First Search (BFS), and various application scenarios.Part 4: Algorithms for Two Three Graph Problems:.Graph DS: Adjacency Matrix/Adjacency List/Edge List/Implicit Graph. Table/Map (ADT) part 2 (ordered) and its Binary Search Tree (BST) implementation, inclusive of the balanced BST version: Adelson-Velskii Landis (AVL) Tree (DnC).Table/Map (ADT) part 1 (unordered) and its Hash Table implementation (DnC).Priority Queue (PQ) ADT, its Binary Heap implementation (DnC), and Greedy algorithm with PQ (Greedy).Part 3: Various (Non-)Linear Data Structures (DSes):.Stack, Queue, and Deque ADTs in their Linked List implementations.Part 2: Various Linear Data Structures (DSes):.Part 1: Algorithms using the simplest Linear Data Structure: (Resize-able) Array, e.g., Sorting (DnC) and a few others (e.g., Greedy algorithms that are applicable after sorting the data).This is what you will learn if you take CS2040/C/S taught by Steven: Have you taken CS1020/CS1020E/CS2010/CS2020? You cannot take CS2040/C/S if you have taken similar/older module(s) that have huge degree of overlap with this module.Have you passed (or exempted from) CS1010 (or its variants)? You have to.Ammar Fathin Sabili ("full-time" TA and PhD student).Zoom Recurring Link (free and easy, PS deadlines last minute help) #Data structures and algorithms in c free#NUS ICPC lab COM1-02-15 (onsite, free and easy) The main target for this semester is to have many onsite components (see below for the details).Ĭlass Discord Study Room 2 - T1duS (online, free and easy)Ĭlass Discord Study Room 1 - dZhei (online, free and easy) (Senior) Lecturer: Dr Steven Halim, the key man behind VisuAlgo that will be used very extensively in this module.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |