BSCS1001 · workspace

Computational Thinking

Syllabus, study tools, lectures, and curriculum map.

← Back to hub

More courses

Browse course shelf

Weekly outline

Syllabus

Week topics from the course map

00W00

Topic

Incomplete

01W01

Variables, Initialization, Iterators, Filtering, Datatypes, Flowcharts, Sanity of data

Incomplete

02W02

Iteration, Filtering, Selection, Pseudocode, Finding max and min, AND operator

Incomplete

03W03

Multiple iterations (non-nested), Three prizes problem, Procedures, Parameters, Side effects, OR operator

Incomplete

04W04

Nested iterations, Birthday paradox, Binning

Incomplete

05W05

List, Insertion sort

Incomplete

06W06

Table, Dictionar

Incomplete

07W07

Graph, Matrix

Incomplete

08W08

Adjacency matrix, Edge labelled graph

Incomplete

09W09

Backtracking, Tree, Depth First Search (DFS), Recursion

Incomplete

010W10

Object oriented programming, Class, Object, Encapsulation, Abstraction, Information hiding, Access specifiers

Incomplete

011W11

Message passing, Remote Procedure Call (RPC), Cache memory, Parallelism, Concurrency, Polling, Preemption, Multithreading, Producer Consumer, Atomicit

Incomplete

012W12

Top-down approach, Bottom-up approach, Decision tree, Numerical prediction, Behaviour analysis, Classification

Incomplete

Study tools

Memorize first

Compact recall strip

Open notes

7 min

Week 7: Adjacency Matrices

Open this first for the core logic and traps.

Dive in

8 min

Week 6: Dictionary Applications

Open this first for the core logic and traps.

Dive in

8 min

Week 9: Recursion

Open this first for the core logic and traps.

Dive in

Practice Dock

One drill at a time, with Theo hints, teacher lanes, and a replay queue.

Use this when the theory is already clear and the goal is fast, clean retrieval under pressure. Mark weak questions, copy a revision pack, and move on.

TheoTeacherTextbookSpeedrun

Ask less. Recall more.

Open Practice Dock

SM-2 Active

Spaced Repetition

Flashcards

Spaced repetition engine for long-term retention of core concepts.

Start session

Not Available

Interactive Simulations

Visual Labs

Exam Mode

Adaptive Practice

Mock Exam

Set paper

Code Protocol

OPPE Simulator

Secure Comm-Link Terminal

Secure Comm-Link // Playlist Connected

Uplink 12ms

Syllabus Synchronization: Active

Open current cue

Syllabus Matrix Registry

Global Course Index

Open Full Frame

Master Registry

v6.4 Directory

Foundational

Diploma

BSc Degree

BS Degree

PG / MTech

BSCS1001

Foundational

4 Credits

Computational Thinking

The students will be introduced to a number of programming concepts using illustrative examples which will be solved almost entirely manually. The ...

Deployment Hub External Docs

Execution Protocol

Module 0

Topic

Module 1

Variables, Initialization, Iterators, Filtering, Datatypes, Flowcharts, Sanity of data

Module 2

Iteration, Filtering, Selection, Pseudocode, Finding max and min, AND operator

Module 3

Multiple iterations (non-nested), Three prizes problem, Procedures, Parameters, Side effects, OR operator

Module 4

Nested iterations, Birthday paradox, Binning

Module 5

List, Insertion sort

Module 6

Table, Dictionar

Module 7

Graph, Matrix

Module 8

Adjacency matrix, Edge labelled graph

Module 9

Backtracking, Tree, Depth First Search (DFS), Recursion

Module 10

Object oriented programming, Class, Object, Encapsulation, Abstraction, Information hiding, Access specifiers

Module 11

Message passing, Remote Procedure Call (RPC), Cache memory, Parallelism, Concurrency, Polling, Preemption, Multithreading, Producer Consumer, Atomicit

Module 12

Syllabus

Topic

Variables, Initialization, Iterators, Filtering, Datatypes, Flowcharts, Sanity of data

Iteration, Filtering, Selection, Pseudocode, Finding max and min, AND operator

Multiple iterations (non-nested), Three prizes problem, Procedures, Parameters, Side effects, OR operator

Nested iterations, Birthday paradox, Binning

List, Insertion sort

Table, Dictionar

Graph, Matrix

Adjacency matrix, Edge labelled graph

Backtracking, Tree, Depth First Search (DFS), Recursion

Object oriented programming, Class, Object, Encapsulation, Abstraction, Information hiding, Access specifiers

Message passing, Remote Procedure Call (RPC), Cache memory, Parallelism, Concurrency, Polling, Preemption, Multithreading, Producer Consumer, Atomicit

Top-down approach, Bottom-up approach, Decision tree, Numerical prediction, Behaviour analysis, Classification

Compact recall strip

One drill at a time, with Theo hints, teacher lanes, and a replay queue.

Flashcards

Visual Labs

Mock Exam

OPPE Simulator

Secure Comm-Link Terminal

Syllabus Matrix Registry

Master Registry

Foundational

Diploma

BSc Degree

BS Degree

PG / MTech

Computational Thinking

Execution Protocol

Topic

Variables, Initialization, Iterators, Filtering, Datatypes, Flowcharts, Sanity of data

Iteration, Filtering, Selection, Pseudocode, Finding max and min, AND operator

Multiple iterations (non-nested), Three prizes problem, Procedures, Parameters, Side effects, OR operator

Nested iterations, Birthday paradox, Binning

List, Insertion sort

Table, Dictionar

Graph, Matrix

Adjacency matrix, Edge labelled graph

Backtracking, Tree, Depth First Search (DFS), Recursion

Object oriented programming, Class, Object, Encapsulation, Abstraction, Information hiding, Access specifiers

Message passing, Remote Procedure Call (RPC), Cache memory, Parallelism, Concurrency, Polling, Preemption, Multithreading, Producer Consumer, Atomicit

Top-down approach, Bottom-up approach, Decision tree, Numerical prediction, Behaviour analysis, Classification

Video Archive

Intelligence Hub