IIT Madras CT Lectures: Computational Thinking
BSCS1001134 lectures12 weeks
Weeks
- Week 115 lecturesIntroduction to datasets · Concept of variables, iterators and filtering · Week 1 tutorial for lecture 2 · Iterations using combination of filtering conditions · Week 1 tutorial for lecture 3 | adjective filtering, spending analysis · Introduction to flowcharts | visualizing algorithms, decisions & loops · Flowchart for sum with filtering · Week 1 tutorial for lecture 5 · Sanity of data | detecting errors & ensuring data integrity in datasets · Introduction to datatypes | integers, booleans & characters explained · Subtypes of basic datatypes | data ranges, validation & customization · Transformation of sub datatypes · Introduction to complex datatypes · Practice assignment solution · Graded assignment solution
- Week 220 lecturesConditional termination in iteration · Local operations and max in single iteration | part 1 · Week 2 tutorial 2.1 · Local operations and max in single iteration | part 2 · Week 2 tutorial 2.2 · Local operations and max in single iteration | part 3 · Week 2 tutorial 2.3 · Local operations and max in single iteration | part 4 · Week 2 tutorial 2.4 · Max in a single iteration & max in two iterations non nested · Week 2 tutorial 2.5 · Max in a single iteration without losing information & applications of frequency count · Week 2 tutorial 2.7 · Flowchart for max marks · Introduction to pseudocodes · Pseudocode for iteration with filtering · Week 2 tutorial 2.8 · Tutorial 2.6 · Practice assignment solution |step-by-step pseudocode walkthrough · Graded assignment solution | pseudocode, flowcharts & logic explained
- Week 312 lecturesPresentation of datasets in the form of a table fixed vs variable data · Week 3 tutorial 3.1 · Below average students in two iterations non nested & grade allocation · Week 3 tutorial 3.2 · Systematic process of hypothesis verification for relation between word length & frequency · Three prizes problem | designing fair reward systems for students · Pseudocode for procedures and parameters | part 1 · Introduction to procedures & parameters · Week 3 tutorial 3.3 | procedure errors & debugging with bigbazaar example · Side effects of procedures · Pseudocode for procedures & parameters (part 2) | finding top students · Pseudocode for three prizes problem
- Week 410 lecturesWeek 4 tutorial 4.1 · Concept of nested iterations using the birthday paradox naive approach · Concept of nested iterations using the birthday paradox using binning · Week 4 tutorial 4.2 · Importance of binning to reduce number of comparisons in nested iterations · Concept of binning to avoid the complexity of nested iterations · Concept of fair teams · Procedure to find same date of birth for different students · Procedure to resolve pronoun with its equivalent matching noun · Week 4 tutorial 4.3
- Week 510 lecturesIntroduction to collections & list data structure · Pseudocode for lists · Operations on the data collected in three prizes problem using lists · Pseudocode for operations on the data collected in three prizes problem using lists · Basic list operations · List construction & operations · Tutorial on pseudocode for list functions · List of pairs 7 & list of triples · Practice assignment | coding questions explained step-by-step · Graded assignment solution | step-by-step pseudocode analysis
- Week 69 lecturesList of lists · Insertion sort & ordered list | explanation & applications · Pseudocode for insertion sort & ordered list | sorting basics · Examples using sorted lists · Tutorial on answering subpart pseudocode questions based on lists · Systematic process of hypothesis verification for relation between math physics using lists · Pseudocode for systematic hypothesis verification on math & physics using lists · Introduction to train dataset · Practice assignment solution
- Week 78 lecturesExamples to introduce dictionary · Concept of dictionary to solve birthday paradox problem · Pseudocode for dictionaries · Relations among customers based on their spending patterns | part 1 · Relations among customers based on their spending patterns | part 2 · Introduction to dictionary data structure | tracking customer purchases · Pseudocodes for real time examples using dictionaries · Practice solution
- Week 85 lecturesDictionaries with lists as values · Resolve pronoun with its equivalent matching noun using dictionary & ordered lists · Dictionary comparison to find common elements in them | analyzing train routes · Procedure to find relations among customers based on their spending patterns · Side effects in pseudocodes for lists & dictionaries
- Week 97 lecturesIntroduction to graph data structure · Introduction to matrices & implementation of matrix using nested dictionary · Undirected graph and cliques · Concept of popular students using graph · Pseudocodes for real time examples using graphs · Concept of connected graph to represent relations between nouns in a paragraph · Represent direct trains using a graph & find a route using multiple hops
- Week 104 lecturesRepresentation of a graph as an adjacency matrix to find shortest distance and time · Construction of a graph where trains are nodes and stations are edges · Pseudocodes for finding a route between stations using no hop one hop two hops & n hops · Pseudocode for edge labelled graph
- Week 116 lecturesDepth first search & recursive procedure call | part 1 · Depth first search & recursive procedure call | part 2 · Depth first search & recursive procedure call | part 3 · Depth first search & recursive procedure call | part 4 · Pseudocode for recursion · Pseudocode for depth first search DFS and recursive procedure call
- Week 125 lecturesTutorial on pseudocode for fundamentals of programming · Tutorial on pseudocode for lists & dictionaries · Tutorial on pseudocode for graph adjacency matrix & dictionary representation · Tutorial on pseudocode for recursion & depth first search DFS · Summary of contents introduced in this course
More lectures
7:58