A complete course map. A manageable next step.
Study the whole course.
Practise the written answer.
All 30 academic modules, the Scaler overlap, and exactly what to practise producing yourself. Open one module, attempt an answer, then check the gaps.
Onsite at SST · closed-book · computer-typed. All times are IST. Current official notices dated 9 and 19 November 2026 control the format. Older 2023 open-book papers are practice material, not the current exam blueprint.
Start here
Prepare in exam order.
Spend more effort where writing an answer exposes a gap. These are preparation priorities, not predicted exam weights or exclusions.
- 01Writing first: produce the genres
Draft and revise a paragraph, a short essay and a concise academic email. Then practise the report sequence, an abstract and an SOP. Include citation, paraphrase and sentence-level checks.
- 02Programming next: write and trace C
Prioritise the connected structures → pointers → dynamic memory sequence, then file I/O and the comprehensive case. Check every foundation in C: expressions, control flow, functions, arrays, strings and matrix loops.
- 03Maths next: construct every argument
Write every proof method, including trivial and vacuous proofs. Then work through countability, relations and orders; structural induction and recurrences; graph extensions, spanning trees and algebra. Keep sets, functions, counting and elementary logic in the check.
Choose one module → answer one prompt without notes → check the method and missing steps → rewrite it once. Move on with a specific gap recorded.
The complete syllabus
Three subjects. Open as needed.
Academic modules 2–11 in each course. Full course scope is retained; no current comprehensive-exam exclusions have been verified.
Showing all 30 modules.
0 of 98 module prompts practisedChecks stay in this browser. “Practised” records an attempt, not mastery.
No modules match. Try a shorter term, a different spelling, or clear the search.
01WritingParagraphs, essays, academic correspondence and research writing.Sat 21 Nov · 09:30–12:00 ISTBCSZC239 · 10 modules
Draft complete texts. Check purpose, structure, evidence, cohesion and language.
Writing past paper — Course login required02Introduction to Academic Writing0/2 practised
Full BITS topic list
- Course aims, reading materials and applications
- Definition, purposes, features and types of academic writing
- Originality and integrity
- Plagiarism
- Intellectual property rights and respecting them in academic writing
What may transfer from Scaler
- No close academic-writing or publication-ethics unit is explicitly listed in the Scaler English Term1 plan.
Give these BITS details a direct check
- Academic writing conventions, originality/integrity, plagiarism and intellectual-property treatment.
Write it out
2 practice promptsComplete an answer before checking the prompt. A check records practice, not mastery.
03Structure of Paragraphs0/3 practised
Full BITS topic list
- Brainstorming and finding ideas on the internet
- Idea maps, connections and delimiting ideas
- Paragraph components
- Topic sentence, supporting details and concluding sentence
- Signposting: purpose, order, relations and appropriate selection
What may transfer from Scaler
- English 10 Prepared Speeches: TED-style talks (C11): speech-outline worksheet.
- English 14 Presentation (C15): structure, organizing content and signposting language.
Give these BITS details a direct check
- Written paragraph planning, idea maps and narrowing a topic.
- Topic/supporting/concluding sentences and paragraph-level signposts; Scaler’s documented structure/signposting is for spoken presentations.
Write it out
3 practice promptsComplete an answer before checking the prompt. A check records practice, not mastery.
04Writing Argumentative, Cause-Effect, and Comparison Paragraphs0/3 practised
Full BITS topic list
- Argumentative paragraph structure, introductory sentences and evidence
- Claims/counterclaims and argumentative vocabulary
- Cause-effect paragraph structure and language
- Cause-driven and effect-driven paragraphs
- Comparison-paragraph structure and language
- Block and point-to-point organization
What may transfer from Scaler
- English 7 Group Discussion 1 (C8): discussion etiquette and useful expressions; English 13 Movie Unpacked (C14): critical panel review. These may support forming opinions but do not explicitly teach these written paragraph genres.
Give these BITS details a direct check
- Explicit argumentative writing with evidence/counterclaims.
- Cause-effect and comparison paragraph structures, genre-specific language, block and point-to-point organization.
Write it out
3 practice promptsComplete an answer before checking the prompt. A check records practice, not mastery.
05Writing Paragraphs on Problem-Solution, Process, and Visual Information0/3 practised
Full BITS topic list
- Problem-solution paragraphs: structure, introduction/conclusion and describing problem/solution
- Process paragraphs: structure, introduction/conclusion and chronological order
- Passive structures in process description
- Paragraphs describing visual information: structure and introduction/conclusion
- Types of visuals in academic texts
- Language and planning for describing visual information
What may transfer from Scaler
- English 14 Presentation (C15) offers general content-organization practice; the supplied English rows do not explicitly list problem-solution/process/visual-data paragraph writing.
Give these BITS details a direct check
- Three academic paragraph genres and their sentence-level construction.
- Chronological/process writing and passive structures; describing academic visual information.
Write it out
3 practice promptsComplete an answer before checking the prompt. A check records practice, not mastery.
06Elements of Writing0/3 practised
Full BITS topic list
- Accuracy in academic writing
- Punctuation, articles and tense forms
- Paraphrasing purposes and techniques: synonyms, word class and word order
- Summarizing purposes and identifying key points
- Drafting and checking accuracy of a summary
What may transfer from Scaler
- English 2–4 Tenses (C3–C5): present/past/future; English 11 Brush Up Your English (C12): tense, preposition, article, adjective, countability and subject-verb-agreement errors.
- English 9 Listening for Understanding (C10): speech summary of audio content; this is adjacent to, rather than equivalent to, summarizing academic texts.
Give these BITS details a direct check
- Punctuation and academic-text accuracy as explicit writing tasks.
- Paraphrasing with synonym/word-class/word-order changes; text-based summarization and checking fidelity to the source.
Write it out
3 practice promptsComplete an answer before checking the prompt. A check records practice, not mastery.
07Writing Emails0/2 practised
Full BITS topic list
- Email structure, purpose, tone, politeness and language
- Subject line and opening salutation
- Self-introduction and problem/purpose statement
- Explanation, closure and closing salutation
- Request, complaint, complaint-response and enquiry emails
- Email etiquette
What may transfer from Scaler
- English 1 Speed Friending (F2): introducing oneself; English 5–6 Everyday English Conversations (C6–C7): formal/informal expressions, questions, requests, suggestions and offers. These offer pragmatic transfer; email writing is not explicitly listed.
Give these BITS details a direct check
- Full written-email format, subject/salutation/closure and email etiquette.
- Drafting request/complaint/reply/enquiry emails with suitable tone.
Write it out
2 practice promptsComplete an answer before checking the prompt. A check records practice, not mastery.
08Writing Short Essays0/3 practised
Full BITS topic list
- Essay structure, outline and note-taking
- Strong thesis statement
- Introduction, body and concluding paragraphs
- Unity and coherence
- Editing and proofreading
- Following style sheets
- Citations and referencing
What may transfer from Scaler
- English 10 Prepared Speeches (C11): outlining and writing a prepared speech; English 14 Presentation (C15): structure, organizing content and signposting.
Give these BITS details a direct check
- Academic essay thesis and paragraph development; written unity/coherence.
- Editing/proofreading, style-sheet compliance and citations/referencing are not explicitly listed in Scaler Term1.
Write it out
3 practice promptsComplete an answer before checking the prompt. A check records practice, not mastery.
09Sections of an Academic Report: Introduction and Methods0/3 practised
Full BITS topic list
- Academic reports: definition, purpose, types, styles, formats and components
- Introduction section: structure and components
- Literature review: purpose and writing
- Methods section: structure and components
- Describing tools/materials and the data-collection process
What may transfer from Scaler
- No close academic-report, literature-review or methods-writing unit is explicitly listed in Scaler English Term1.
Give these BITS details a direct check
- Academic report conventions and introduction/literature-review/methods sections.
- Describing research tools/materials and data collection.
Write it out
3 practice promptsComplete an answer before checking the prompt. A check records practice, not mastery.
10Sections of an Academic Report: Results, Discussion, and Conclusion0/3 practised
Full BITS topic list
- Results section: structure, components, figures and language
- Discussion section: structure, components and language
- Writing study limitations
- Conclusion section: structure, components and language
- Directions for further research
What may transfer from Scaler
- English 13 Movie Unpacked (C14) includes critical review, but a spoken film review does not establish coverage of research-report sections.
Give these BITS details a direct check
- Research-results presentation, discussion/interpretation and limitations.
- Research conclusions and further-work directions, including section-specific language and figures.
Write it out
3 practice promptsComplete an answer before checking the prompt. A check records practice, not mastery.
11Writing Abstract, SOP, and Publishing Research0/3 practised
Full BITS topic list
- Abstract structure, components and language
- Science/engineering abstracts
- Statement of purpose: introduction, format, components and tips
- SOP strategies, checklists and language; science/engineering SOPs
- Writing for journals and identifying publication venues
- Using search engines and writing technology
What may transfer from Scaler
- No close abstract, statement-of-purpose or research-publishing unit is explicitly listed in Scaler English Term1. WebDev 2 (C3) mentions using AI, which is only general technology context.
Give these BITS details a direct check
- Abstract and SOP genres, including science/engineering conventions.
- Journal writing/selection, research search engines and writing technology.
Write it out
3 practice promptsComplete an answer before checking the prompt. A check records practice, not mastery.
02ProgrammingProblem-solving in C, from expressions to files and manual memory management.Sat 21 Nov · 13:00–15:30 ISTBCSZC313 · 10 modules
Write valid C, trace the state, explain the result and check boundary cases.
Programming practice questions — Course login required02Introduction to Computing and Problem-Solving0/3 practised
Full BITS topic list
- Computers and computer programming
- Operating systems and program execution
- Algorithms and flowcharts
- Representing decisions and iteration with a flowchart/algorithm
What may transfer from Scaler
- ICP 1 Getting Started with Linux (C2): computer components, need for programming languages, abstraction, storage and program counter.
- ICP 2 Linux Commands 1 (C3): operating system; ICP 5 Introduction to Computer Programming (C8): first Java program.
- ICP 9 If/Else 1 (C14): decision-making flowcharts; ICP 11–14 (C17–C22): while/for loops and pattern problems.
Give these BITS details a direct check
- Explicit algorithm construction and flowchart representation of iteration need checking; basic concepts transfer across languages.
Write it out
3 practice promptsComplete an answer before checking the prompt. A check records practice, not mastery.
03Introduction to C Programming0/3 practised
Full BITS topic list
- Essential elements and execution of a C program in Coursera Labs
- Basic Unix commands in Coursera Labs
- Variables, constants and C datatypes
- Program-data storage; variable types and their storage
- Character types and type conversions in C
- Operators and expressions; arithmetic, assignment and unary operators
- Operator precedence and associativity
- Relational and logical operators; expression examples
What may transfer from Scaler
- ICP 2–4 Linux Commands (C3,C4,C6) and ICP 5 (C8): terminal commands and writing a program.
- ICP 6 Basic Operators & Variables (C9), 7 Data Types (C11), 8 Reading Input & Operators (C12): variables, expression evaluation, numeric/Boolean types, casts, arithmetic/relational/logical/assignment/unary operators.
- ICP 16 Introduction to Strings (C26): characters and ASCII; WebDev 12 Introduction to JavaScript (C20): variables, datatypes and basic operations.
Give these BITS details a direct check
- C program structure, compiler/lab workflow and C datatype/character/conversion rules.
- C storage semantics and exact operator precedence/associativity; Java/JS familiarity requires translation.
Write it out
3 practice promptsComplete an answer before checking the prompt. A check records practice, not mastery.
04Branching and Looping0/3 practised
Full BITS topic list
- Statements and blocks in C
- if, if-else, nested if-else and switch
- Loops and while-loop tracing/examples
- break and continue
- for-loop construction/tracing/examples; while versus for
What may transfer from Scaler
- ICP 9 If/Else 1 (C14): if/else-if/nested if-else and switch; ICP 10 (C15): conditional problems and variable scope.
- ICP 11–14 (C17,C19,C21,C22): while/for loops, output tracing, break/continue and loop-based pattern problems.
Give these BITS details a direct check
- Translate Java control-flow knowledge to valid C statements and blocks; verify C-specific expression/condition behavior.
Write it out
3 practice promptsComplete an answer before checking the prompt. A check records practice, not mastery.
05Functions0/3 practised
Full BITS topic list
- Need, role, advantages and disadvantages of functions
- Function declaration, definition and invocation
- Function call flow and memory snapshots during execution
- Scope and storage classes
- Memory layout of a C program
- Automatic, global and static variables; worked function examples
What may transfer from Scaler
- ICP 15 Functions (C24): function syntax/rules, predefined functions, incorrect arguments, factorial/nCr and Armstrong-number examples; ICP 21 Functions 2 (B35) is listed without topic detail.
- ICP 10 If/Else 2 (C15): variable scope.
- WebDev 13 Arrays, Strings and Functions (C22); 14 Execution Context in JS with Hoisting (C24): call stack and global/local execution context.
Give these BITS details a direct check
- C declarations/prototypes versus definitions and C call semantics.
- C memory layout and memory snapshots; automatic/global/static storage classes and lifetimes.
Write it out
3 practice promptsComplete an answer before checking the prompt. A check records practice, not mastery.
06Arrays0/3 practised
Full BITS topic list
- Purpose, definition, indexing and access of arrays
- Array layout in memory and worked array examples
- Passing arrays to functions
- Linear search
- Sorting and selection sort
- Character arrays
What may transfer from Scaler
- ICP 17–18 1D Arrays 1–2 (C28–C29): declaration/indexing/input, sums/averages, reverse, palindrome, maximum and pair/frequency problems.
- ICP 20 Problems on Arrays (C33): reversing part of an array and rotations; WebDev 13 (C22): arrays and strings.
Give these BITS details a direct check
- C array memory layout and array/function interface; character arrays rather than Java String objects.
- Linear search and selection sort are explicit BITS topics; these algorithms are not named in the supplied Scaler Term1 plan.
Write it out
3 practice promptsComplete an answer before checking the prompt. A check records practice, not mastery.
07Multi-Dimensional Arrays and Strings0/3 practised
Full BITS topic list
- Accessing multidimensional arrays; 2-D memory maps; glimpse of n-dimensional arrays
- Matrix addition and multiplication
- C strings and reading strings from users
- String manipulation examples; key characters and string-related functions
- Arrays of strings
What may transfer from Scaler
- ICP 19 2D Arrays (C31): indexing/input, row traversal, column sums and diagonals; ICP 20 (C33): transpose and 90-degree rotation.
- ICP 16 Introduction to Strings (C26): characters/ASCII, indexing, substring/contains, input with next()/nextLine() and case toggling.
- WebDev 13 Arrays, Strings and Functions (C22): arrays and strings.
Give these BITS details a direct check
- C row-major memory maps and n-dimensional array syntax.
- Matrix addition/multiplication are not explicitly named in Scaler Term1 rows.
- C null-terminated strings, character-array input, C string-library functions and arrays of strings differ from Java/JS strings.
Write it out
3 practice promptsComplete an answer before checking the prompt. A check records practice, not mastery.
08Structures0/3 practised
Full BITS topic list
- Need for structures; structure declarations and operations
- typedef
- Nested structures
- Arrays of structures
- Structures with functions
- Two applied case studies using structures
What may transfer from Scaler
- No close structures/records module is explicitly listed in the supplied ICP or WebDev Term1 topic rows; arrays and functions provide prerequisite concepts.
Give these BITS details a direct check
- C struct syntax/operations, typedef, nesting, arrays of structs and passing structs to functions.
- Work through both BITS structure case studies; their internal subject matter is not recoverable from lecture titles alone.
Write it out
3 practice promptsComplete an answer before checking the prompt. A check records practice, not mastery.
09Pointers0/3 practised
Full BITS topic list
- Pointers and worked examples
- Pointer arithmetic
- Relationship between arrays and pointers
- Pointers to structures
- Call by value versus call by reference; examples
- Null pointers
What may transfer from Scaler
- ICP arrays/functions and WebDev call-stack concepts are prerequisites; the supplied Term1 rows do not explicitly list C pointers or pointer arithmetic.
Give these BITS details a direct check
- C addresses and dereferencing, pointer arithmetic, array/pointer relationship and structure pointers.
- C value passing and reference-like mutation through pointers; null-pointer handling.
Write it out
3 practice promptsComplete an answer before checking the prompt. A check records practice, not mastery.
10Dynamic Memory Management0/3 practised
Full BITS topic list
- Stack versus heap memory
- malloc() and dynamic memory allocation
- Dynamically allocated arrays and examples
- free() and deallocation
- Dynamically allocated structures
- Dynamically allocated 2-D arrays
What may transfer from Scaler
- WebDev 14 Execution Context in JS with Hoisting (C24) explicitly names the call stack; this is only adjacent to manual C heap management.
Give these BITS details a direct check
- C stack/heap distinction and explicit allocation/deallocation using malloc()/free().
- Dynamic C arrays, structures and 2-D array allocation.
Write it out
3 practice promptsComplete an answer before checking the prompt. A check records practice, not mastery.
11File Handling in C and Comprehensive Cases0/3 practised
Full BITS topic list
- Files in C
- Opening, reading, writing and closing files
- Worked file-handling examples
- Five-part comprehensive programming case
What may transfer from Scaler
- ICP 2–4 Linux Commands (C3,C4,C6) covers shell files/folders/permissions, which offers filesystem context. Programmatic C file I/O is not explicitly listed.
Give these BITS details a direct check
- C programmatic file I/O and file lifecycle.
- Complete the five-part BITS case; lecture labels alone do not identify its internal requirements.
Write it out
3 practice promptsComplete an answer before checking the prompt. A check records practice, not mastery.
03Discrete mathsProofs, discrete structures, counting, graphs, trees and algebra.Sun 22 Nov · 09:30–12:00 ISTBCSZC219 · 10 modules
State the definitions and assumptions. Construct the argument, then justify the conclusion.
Maths past paper — Course login required02Proof Methods0/4 practised
Full BITS topic list
- Propositions, truth tables and connectives
- Conditional, converse, contrapositive and inverse
- Logical equivalences
- Predicates and quantifiers; negation and nested quantifiers
- Rules of inference
- Proof terminology
- Direct and indirect proofs
- Trivial and vacuous proofs
What may transfer from Scaler
- Maths 3 Propositional Logic (C34–C39): propositions, truth tables, tautologies/contradictions, equivalence and implication/converse/inverse/contrapositive.
- Maths 4 Predicates & Proof Thinking (C44–C50): predicates, domain, universal/existential quantifiers and negation, definitions/axioms/theorems, direct proof.
- Maths 5 Proof Thinking II (C54–C55): contrapositive and contradiction.
Give these BITS details a direct check
- Nested quantified expressions, formal rules of inference, trivial/vacuous proof are not explicit in Scaler rows.
- Practise writing BITS-style formal proofs; planned topic overlap does not establish proof fluency.
Write it out
4 practice promptsComplete an answer before checking the prompt. A check records practice, not mastery.
03More Proof Methods, Sequences, and Summations0/4 practised
Full BITS topic list
- Proof by contradiction
- Constructive and nonconstructive existence proofs
- Proof by cases
- Counterexamples and common fallacies
- Mathematical induction and writing induction proofs
- Strong induction and writing strong-induction proofs
- Sequences and summations
- Arithmetic, harmonic and geometric progressions
What may transfer from Scaler
- Maths 5 Proof Thinking II (C55–C58): contradiction, mathematical induction and strong/weak induction with examples.
- Maths 16 Growth of Functions & Complexity Thinking (C181): AP/GP/HP summations are listed as a quiz topic.
Give these BITS details a direct check
- Constructive/nonconstructive existence, proof by cases, counterexamples and fallacy diagnosis are not explicitly listed in Scaler Term1.
- BITS dedicates lectures to writing induction/strong-induction proofs; Scaler lists one strong/weak example each.
- Check sequence/summation notation and AP/GP/HP derivations beyond the Scaler complexity-quiz label.
Write it out
4 practice promptsComplete an answer before checking the prompt. A check records practice, not mastery.
04Sets and Functions0/4 practised
Full BITS topic list
- Set fundamentals, subsets and equality
- Null set, power set, cardinality and Cartesian products
- Set operations and identities
- Computer representation of sets
- Functions; floor and ceiling
- Injective, surjective and bijective functions
- Function operators
What may transfer from Scaler
- Maths 6 Sets and Multisets as Computational Models (C64–C71): notation, types/subsets/power set, operations/laws and Cartesian product.
- Maths 7 Functions and Relations as Computational Models (C74–C77): mappings, domain/codomain/range, injective/surjective/bijective functions and CS models.
- ICP 15 Functions (C24) explicitly includes floor and ceiling functions.
Give these BITS details a direct check
- Formal cardinality and computer representation of sets; precise BITS function-operator treatment is not detailed in Scaler rows.
- Check BITS set-identity/function exercises rather than assuming equivalence from session headings.
Write it out
4 practice promptsComplete an answer before checking the prompt. A check records practice, not mastery.
05Relations and Countable Sets0/4 practised
Full BITS topic list
- Countable and uncountable sets; countability examples
- Relations, inverse and complementary relations
- Properties of relations
- Composition and n-ary relations
- Representations and closures of relations
- Applications of relations
What may transfer from Scaler
- Maths 7 Functions and Relations as Computational Models (C78–C80): relations, functions versus relations and equivalence relations.
Give these BITS details a direct check
- Countability/uncountability are not explicitly listed in Scaler Term1.
- Inverse/complementary/composite/n-ary relations, properties, representations and closures receive explicit BITS coverage beyond Scaler’s generic relations label.
- BITS relation-application lectures require review; specific applications are not named in the labels.
Write it out
4 practice promptsComplete an answer before checking the prompt. A check records practice, not mastery.
06Equivalence and Partial Ordered Relations0/4 practised
Full BITS topic list
- Equivalence relations and examples
- Partitions and equivalence classes; their correspondence
- Partial orders and totally ordered sets
- Hasse diagrams
- Maximal and minimal elements
- Upper and lower bounds
- Lattices
What may transfer from Scaler
- Maths 7 Functions and Relations as Computational Models (C80): equivalence relations.
Give these BITS details a direct check
- Detailed equivalence classes/partition correspondence is not specified by Scaler’s equivalence-relations line.
- Partial/total orders, Hasse diagrams, maximal/minimal elements, upper/lower bounds and lattices are not explicitly listed in Scaler Term1.
Write it out
4 practice promptsComplete an answer before checking the prompt. A check records practice, not mastery.
07Counting Techniques0/4 practised
Full BITS topic list
- Combinatorics and counting
- Extended product rule, sum rule and combined examples
- Counting subsets of finite sets
- Inclusion-exclusion principle
- Pigeonhole and generalized pigeonhole principles
- Permutations and combinations
What may transfer from Scaler
- Maths 11 Counting Principles and Combinatorial Models (C114–C122): addition/multiplication rules, factorials, permutations/combinations, repetition, bitstrings/subsets and path counting homework.
- Maths 12 Inclusion-Exclusion, Pigeonhole and Stars & Bars (C129–C137): two/three-set inclusion-exclusion, at-least-one/none conditions and pigeonhole/strong pigeonhole principles.
Give these BITS details a direct check
- No clear unmatched core topic from the BITS lecture titles; compare BITS problem depth and terminology through practice.
Write it out
4 practice promptsComplete an answer before checking the prompt. A check records practice, not mastery.
08Recursive Functions and Recurrence Relations0/4 practised
Full BITS topic list
- Recursive definitions and recursively defined functions
- Recursively defined sets
- Structural induction and worked proofs
- Recurrence relations and examples
- Linear recurrence relations and solving them
What may transfer from Scaler
- Maths 8 Recursion (C84–C91): induction versus recursion, formal definition, sum/factorial/Fibonacci, recursion trees and substitution.
- Maths 5 (C56–C58): ordinary/strong induction is a prerequisite, rather than an explicit structural-induction match.
Give these BITS details a direct check
- Recursively defined sets and structural-induction proofs are not explicitly listed.
- BITS explicitly develops recurrence relations and solutions of linear recurrences; Scaler’s recursion/substitution label is related but does not establish that full coverage.
Write it out
4 practice promptsComplete an answer before checking the prompt. A check records practice, not mastery.
09Introduction to Graphs0/4 practised
Full BITS topic list
- Modeling real-world settings with graphs
- Graph definitions; directed and undirected terminology
- Subgraphs
- Adjacency lists, adjacency matrices and incidence matrices
- Special simple graphs
- Bipartite graphs and matchings
- Graph isomorphism
What may transfer from Scaler
- Maths 13 Graph Theory 1 (C144–C149): motivation, vertices/edges, weighted/unweighted/directed/undirected graphs, degrees and adjacency list/matrix representations.
Give these BITS details a direct check
- Subgraphs, incidence matrices, special simple graphs, bipartite graphs, matchings and graph isomorphism are not explicitly listed in Scaler Term1.
Write it out
4 practice promptsComplete an answer before checking the prompt. A check records practice, not mastery.
10Advanced Topics on Graphs, Paths, and Connectivity0/4 practised
Full BITS topic list
- Paths, cycles and simple paths
- Connectivity in undirected and directed graphs
- Euler paths and circuits
- Hamilton paths and circuits
- Planar graphs and Euler’s formula
- Graph coloring
What may transfer from Scaler
- Maths 13 Graph Theory 1 (C148): connected components.
- Maths 14 Graph Theory 2 (C157–C158): BFS/DFS and Maths 15 Graph Algorithms (C164–C165): shortest paths/Dijkstra are adjacent path/graph concepts, not explicit matches for Euler/Hamilton theory.
Give these BITS details a direct check
- Formal path/cycle and directed-connectivity treatment needs checking beyond connected components.
- Euler/Hamilton paths/circuits, planarity/Euler’s formula and graph coloring are not explicitly listed in Scaler Term1.
Write it out
4 practice promptsComplete an answer before checking the prompt. A check records practice, not mastery.
11Trees and Basic Algebraic Structures0/4 practised
Full BITS topic list
- Modeling real-world settings as trees
- Trees, rooted trees and properties
- Spanning trees
- Minimum spanning trees using Prim’s and Kruskal’s algorithms
- Abstraction and abstract algebra
- Semigroups and monoids
- Groups and subgroups
- Rings
What may transfer from Scaler
- Maths 14 Graph Theory 2 (C154–C156): trees, terminology, level/depth/height.
- Maths 15 Graph Algorithms (C166–C167): spanning-tree/MST problem and Prim’s algorithm.
Give these BITS details a direct check
- Kruskal’s algorithm is not explicitly listed in Scaler Term1.
- Abstract algebra, semigroups/monoids, groups/subgroups and rings are not explicitly listed.
- Check formal BITS tree properties beyond the Scaler terminology outline.
Write it out
4 practice promptsComplete an answer before checking the prompt. A check records practice, not mastery.
The module numbers follow Coursera: Module 1 is course orientation. Introductions, wrap-ups, recordings and duplicate entries do not create extra academic modules. Course links are optional and require an enrolled account; this guide remains readable without one.
The method bank
Recognition is the first step.
Production is the practice.
Even the simplest method belongs in the check. Work from a blank answer, state assumptions, show the steps and close with the result.
Set it up. State the domain, inputs, definitions or purpose.
02Show the method. Make the reasoning, trace, calculation or structure visible.
03Finish and check. State the conclusion; test cases, assumptions, accuracy and clarity.
Every proof family0 of 12 practised
Original illustrative examples and reusable scaffolds, not answers to course quizzes. Write a fresh example yourself before marking a method practised.
Direct proof
Method. Assume the hypothesis. Use definitions and valid steps to reach the conclusion.
Worked example. If a and b are even integers, write a = 2r and b = 2s for integers r,s. Then a + b = 2(r + s). Since r + s is an integer, a + b is even.
Check. Name the integer witness. Do not assume the conclusion.
Open the matching module →Proof by contrapositive
Method. To prove P ⇒ Q, prove ¬Q ⇒ ¬P.
Worked example. Claim: for an integer n, if n² is odd, n is odd. Assume n is not odd, so n = 2k. Then n² = 4k² = 2(2k²), which is even. This proves the contrapositive and therefore the claim.
Check. Negate both statements and reverse their order. The converse is different.
Open the matching module →Proof by contradiction
Method. Assume the claim is false. Derive a contradiction, then reject that assumption.
Worked example. Claim: there is no smallest positive rational number. Suppose q is the smallest. Then q/2 is rational, positive and smaller than q, contradicting the choice of q. Therefore no smallest one exists.
Check. State the exact contradictory facts; do not just write “a contradiction”.
Open the matching module →Trivial proof
Method. To prove P ⇒ Q, establish that Q is true independently of P.
Worked example. For every integer n, “if n is divisible by 7, then 2² = 4” is true. The consequent follows from arithmetic, so the implication holds whatever the antecedent says.
Check. Explicitly establish the consequent. “Obvious” is not the proof.
Open the matching module →Vacuous proof
Method. To prove P ⇒ Q, establish that P is impossible in the stated domain.
Worked example. For every integer n, “if n² < 0, then n = 7” is true. An integer square is nonnegative, so the antecedent is always false; the implication is therefore true.
Check. State the domain and why the antecedent cannot hold. This does not establish Q on its own.
Open the matching module →Constructive existence
Method. Give a witness and verify every required property.
Worked example. Claim: an odd composite positive integer exists. Choose 9. It is positive, 9 = 2·4 + 1 is odd, and 9 = 3·3 is composite. The witness has all three properties.
Check. Naming a candidate is only the start; check the conditions.
Open the matching module →Nonconstructive existence
Method. Prove that at least one object must exist without exhibiting the object.
Worked example. There are 2⁶ = 64 subsets of {1,2,3,4,5,6}. Each subset sum is an integer between 0 and 21, giving at most 22 sums. By the pigeonhole principle, two distinct subsets have the same sum. The argument does not select the pair.
Check. Identify the finite objects and boxes, or the precise contradiction ensuring existence.
Open the matching module →Proof by cases
Method. Split the domain into exhaustive cases and prove the claim in each.
Worked example. Claim: n(n + 1) is even for every integer n. If n is even, n = 2k and the product is 2[k(n + 1)]. If n is odd, write n = 2k + 1 for an integer k. Then n + 1 = 2(k + 1), so the product is 2[n(k + 1)]. Every integer is even or odd, so the cases are exhaustive.
Check. Explain why the cases cover the domain. Verify each case.
Open the matching module →Counterexample
Method. To refute a universal claim, give one admissible object for which the claimed property fails.
Worked example. The claim “every prime number is odd” is false: 2 is prime because its positive divisors are 1 and 2, and 2 is even. One valid counterexample refutes the universal claim.
Check. Verify the hypothesis and the failed conclusion. An example cannot prove a universal claim.
Open the matching module →Ordinary / weak induction
Method. Give the starting case, assume P(k), prove P(k + 1), and state the range of the conclusion.
Worked example. Claim: 1 + 3 + … + (2n − 1) = n² for n ≥ 1. Base n = 1: 1 = 1². Assume the first k odd numbers sum to k². Adding 2(k + 1) − 1 gives k² + 2k + 1 = (k + 1)². Thus the identity holds for every n ≥ 1.
Check. Use the hypothesis at k; do not assume the k + 1 case.
Open the matching module →Strong induction
Method. Establish the needed base cases. Assume every permitted earlier case and use them to prove the next.
Worked example. Claim: every integer n ≥ 2 is a product of primes. Base: 2 is prime. Assume the claim for all integers from 2 to k. If k + 1 is prime, it is already a product of one prime. Otherwise k + 1 = ab with 2 ≤ a,b ≤ k. Both factors are products of primes by the hypothesis, so their product is too.
Check. State the whole induction range. Check that each smaller argument lies inside it.
Open the matching module →Structural induction
Method. Prove the basis objects, then a preservation step for every constructor in the recursive definition.
Worked example. Words over {a,b} start with the empty word ε; each new word is wx with x ∈ {a,b}. Prove |reverse(w)| = |w|. Basis: reverse(ε) = ε, of length 0. Step: assuming the property for w, reverse(wx) = x reverse(w), so its length is 1 + |w| = |wx|. This covers both append constructors.
Check. Induct over the construction rules, with a step for each rule. State which smaller objects supply the hypothesis.
Open the matching module →Logic and elementary proof tools
Implication, equivalence and truth tables
List every assignment to the input propositions. For two propositions, use TT, TF, FT, FF. For p ⇒ q the results are T, F, T, T; ¬p ∨ q gives the same four results, proving the equivalence. Label intermediate columns rather than guessing the last column.
For p ⇒ q: converse q ⇒ p; inverse ¬p ⇒ ¬q; contrapositive ¬q ⇒ ¬p. Only the contrapositive is automatically equivalent to the original.
Predicates and quantifiers
State the domain first. “∀n ∈ ℤ, ∃m ∈ ℤ such that m > n” is witnessed by m = n + 1. Its negation is “∃n ∈ ℤ, ∀m ∈ ℤ, m ≤ n”. Negation switches each quantifier and negates the predicate; preserve the order of dependent choices.
Rules of inference and fallacies
Modus ponens uses p and p ⇒ q to infer q. For example, 12 is a multiple of 4; every multiple of 4 is even; hence 12 is even. From q and p ⇒ q one cannot infer p: 6 is even but is not a multiple of 4. Label a rule or justify the transition in a longer derivation.
A definition is a proof plan
For set equality, prove both containments using an arbitrary element. For injectivity, begin with f(a) = f(b) and establish a = b. For surjectivity, take an arbitrary codomain element and supply a valid preimage. For a relation property or algebraic law, state its quantified requirement, verify it for the whole domain, or give a counterexample.
Programming: explain, trace, construct, check
Algorithm and flowchart
State inputs and outputs, write ordered unambiguous steps, and label both branches of each decision. Example: read integer n → test n > 0 → output “positive” or “nonpositive” → stop. Trace n = 3 and n = 0; both must reach a defined output. For a loop, show initialization, condition, body, update and exit.
C expressions and state
Use a table with step, expression, value and changed variables. Example: start x = 3; execute x = x + 2; x becomes 5; y = 2 * x assigns 10. State types and conversions. Apply C precedence and associativity. If an operation has undefined or invalid behaviour, explain the issue instead of inventing an output.
Functions, arrays and memory
Show caller and callee state separately. For each array, state its length, valid indices and element values. During linear search, record each tested index and the not-found exit. During selection sort, record the remaining segment, chosen minimum and each swap. For a matrix product, show dimensions and the sum defining one output entry before tracing the loops.
For strings, show the terminating \0 and available capacity. For a structure, name the field being accessed. For pointers, draw the pointer variable separately from the object it points to; distinguish the address, stored pointer and dereferenced value.
Allocation and files
A minimal allocation pattern for n positive integers is int *a = malloc(n * sizeof *a);, after checking the intended size is valid. Check a != NULL before access, use indices 0 through n−1, and pair the allocation with free(a); after the last use. Include the appropriate standard headers. A dynamically allocated 2-D arrangement may need one allocation or one per row; its cleanup must match that arrangement.
For file I/O, state the mode and sequence: open → test for failure → read/write while checking operation results → close. Explain end-of-file and error handling for the chosen operations. Trace the program’s state and resulting file contents, not only shell commands.
Writing: a scaffold for every genre
These are flexible drafting plans. Follow the prompt and the course’s conventions; a fixed template cannot replace an answer to the actual task.
Academic paragraph
Topic sentence → development or evidence → explanation connecting the evidence → closing or linking sentence. Keep one controlling idea and remove unrelated details.
Argument
Clear claim → reason → evidence → explanation. Address a relevant counterargument and qualify the conclusion where evidence is limited.
Cause–effect / comparison
State the relationship. For causes, separate an explanation from mere correlation. For comparison, use common criteria and a consistent point-by-point or block order.
Problem–solution / process
Define the problem, explain consequences, propose a feasible solution and evaluate it. For a process, state the goal, sequence the steps and explain dependencies or necessary conditions.
Visual information
Identify what the visual measures, give its overall pattern, then select key comparisons with units and accurate values. Distinguish description from unsupported explanation.
Specific subject → suitable greeting → context → clear purpose or request → necessary details → courteous close and signature. Revise tone, brevity and correctness for the recipient.
Short essay
Introduction with a focused thesis → logically ordered body paragraphs → conclusion that answers the question. Use transitions and evidence; revise each paragraph against the thesis.
Report: introduction and methods
Introduction: context → problem or gap → purpose and scope. Methods: what was done, with what materials or participants, and how, in enough detail for the reader to understand the procedure.
Report: results, discussion, conclusion
Results: present findings clearly. Discussion: interpret them, connect them to the question and address limitations. Conclusion: state the supported answer and implications without introducing unsupported claims.
Abstract
Compress the purpose, method, principal result and conclusion of the complete work. Keep it accurate, coherent and within the requested length.
Statement of purpose
Motivation → specific preparation and evidence → fit with the programme → goals. Use concrete examples and a coherent account rather than a list of unsupported qualities.
Sources and publication
Read for meaning before paraphrasing, then write a new formulation and cite the source. A summary keeps the main ideas in less space. Distinguish quoting from paraphrasing; check citation, reference, originality and the course’s publication conventions.
Sentence accuracy, cohesion and language checks → Abstract, SOP and publishing →
All methods, module by module98 prompts · 30 modules
This index links to every module’s full written-practice checklist, including elementary explanations, calculations, derivations, traces, diagrams, constructions and drafts.
Writing
- M2 Introduction to Academic Writing2 prompts
- M3 Structure of Paragraphs3 prompts
- M4 Writing Argumentative, Cause-Effect, and Comparison Paragraphs3 prompts
- M5 Writing Paragraphs on Problem-Solution, Process, and Visual Information3 prompts
- M6 Elements of Writing3 prompts
- M7 Writing Emails2 prompts
- M8 Writing Short Essays3 prompts
- M9 Sections of an Academic Report: Introduction and Methods3 prompts
- M10 Sections of an Academic Report: Results, Discussion, and Conclusion3 prompts
- M11 Writing Abstract, SOP, and Publishing Research3 prompts
Programming
- M2 Introduction to Computing and Problem-Solving3 prompts
- M3 Introduction to C Programming3 prompts
- M4 Branching and Looping3 prompts
- M5 Functions3 prompts
- M6 Arrays3 prompts
- M7 Multi-Dimensional Arrays and Strings3 prompts
- M8 Structures3 prompts
- M9 Pointers3 prompts
- M10 Dynamic Memory Management3 prompts
- M11 File Handling in C and Comprehensive Cases3 prompts
Discrete maths
- M2 Proof Methods4 prompts
- M3 More Proof Methods, Sequences, and Summations4 prompts
- M4 Sets and Functions4 prompts
- M5 Relations and Countable Sets4 prompts
- M6 Equivalence and Partial Ordered Relations4 prompts
- M7 Counting Techniques4 prompts
- M8 Recursive Functions and Recurrence Relations4 prompts
- M9 Introduction to Graphs4 prompts
- M10 Advanced Topics on Graphs, Paths, and Connectivity4 prompts
- M11 Trees and Basic Algebraic Structures4 prompts
Read the overlap carefully
A syllabus match is a starting point.
Each module shows its Scaler connection and the BITS details to check. Planned coverage and familiar labels do not establish retention, equal depth or written fluency.
Mostly overlaps Most principal concepts explicitly match.
Partly overlaps Some match, with additions or language/genre differences.
Mainly additional The main skill lacks a close explicit match in the supplied plan.
Reverse comparison: Scaler emphases beyond the BITS labels
These topics are explicit in the SST plan but are not named as close standalone matches in the available BITS lecture labels. Course examples may still touch related ideas.
ICP (Java)
- More extensive explicit Linux workflow: file permissions, Vim, process listing with ps, grep and pipes.
- Java program/class setup, print versus println, + for concatenation, Java numeric types/overflow and typecasting.
- Labeled break/continue and extensive numerical/pattern problems (primality, digits, GCD, pattern printing).
- Java String APIs and next()/nextLine() input behavior.
- Explicit array problem practice: in-place reversal, palindrome, pair counts, odd frequency, rotations, transpose and 90-degree matrix rotation.
ICP 2–4 C3/C4/C6; 5–8 C8/C9/C11/C12; 12–14 C19/C21/C22; 16–20 C26/C28–C33.
These are explicit Scaler emphases not explicitly named in the BITS lecture labels. Unspecified BITS examples and case studies may contain some of the same problems. Planned coverage does not establish attendance, learning or mastery.
Maths
- Number bases and conversions (decimal/binary/octal/hex), binary arithmetic, 1’s/2’s complement, signed range and overflow.
- Bitwise AND/OR/NOT/NAND/NOR/XOR/XNOR, XOR applications and masks.
- Multisets and multiplicity as computational models.
- Number theory: divisibility, GCD/Euclidean algorithm, LCM, prime factorization and divisor count.
- Modular arithmetic, cycles, operation laws and safe normalization of negative remainders.
- Explicit counting with repetition and stars-and-bars/nonnegative/positive integer solutions; path-counting homework.
- BFS/DFS and level/depth/height; shortest paths/Dijkstra.
- Growth rates, Big-O/Big-Omega/Big-Theta and loop-complexity analysis.
Maths 1 C2–C12; 2 C24–C30; 6 C69–C70; 9 C94–C100; 10 C104–C108; 11–12 C120–C137; 14–16 C154–C181.
Not explicitly named as standalone topics in the supplied BITS DM lecture labels; BITS examples may touch related ideas.
WebDev
- Programming/product mindset, stack selection/MERN context and use of AI.
- Client/server/browser/HTTP and internet/web fundamentals.
- HTML structure, links, lists, tables, forms and GitHub introduction.
- CSS selectors, typography/colors/spacing, display/box model/units.
- Flexbox, media queries, mobile-first design, CSS Grid and responsive layouts.
- Cascade/specificity/inheritance, positioning, z-index/stacking contexts.
- Transitions, transforms/keyframe animations and a portfolio build day.
- JavaScript execution context/hoisting; first-class/higher-order functions, pure functions, immutability, side effects, map/filter/reduce and composition.
WebDev 1–15: C2–C26; JavaScript basics/arrays/strings/functions have transferable BITS programming overlap, while the listed web technologies and functional-programming details have no close explicit BITS Term1 module match.
The available BITS programming course is introductory C; this is a reverse curriculum difference, not a judgment of Scaler learning or BITS quality.
English
- Everyday spoken conversations, role-play, requests/suggestions/offers.
- Group discussions, etiquette and picture-perception discussion.
- Conditional sentences; spoken fluency through impromptu speeches.
- Engaged listening and podcast-based comprehension.
- Prepared TED-style speeches and presentation delivery, including handling questions.
- Movie screening and critical panel review.
- Pronunciation: vowel/consonant sounds and minimal pairs.
- Explicit grammar remediation for prepositions/adjectives/countability/subject-verb agreement in addition to overlapping tenses/articles.
English 1–16: C2–C16, especially 5–10 C6–C11 and 12–15 C13–C16.
The supplied BITS Writing course emphasizes written academic genres. English-speaking/listening practice is not established by its lecture labels.
Comparison method and limits
- BITS academic modules are numbered 2–11 in each course. Lecture groups are bounded by Module Wrap-Up. Introductions, wrap-ups, live recordings and duplicate recordings are not extra academic topics. Named worked examples are combined with their concept; unspecified case-study content is not invented.
- Scaler references identify the official SST Batch 2030 Term 1 workbook sheet, session and cell rows. They describe planned coverage, not confirmed teaching, attendance, learning or mastery.
- Overlap labels are a qualitative syllabus comparison, not official equivalence or a credit decision: overlap means most principal concepts explicitly match; partial means some meaningful match with additions or language/genre differences; new means the main skill lacks a close explicit match in the supplied plan.
- BITS additions identify C-specific or academic-writing treatment, or topics without an explicit close Scaler match. Silence in a written plan does not establish that a topic was never taught. Similar titles do not establish equal depth.
- Java and JavaScript concepts may transfer to C. C storage, characters, strings, pointers and manual memory management need direct checking.
- No percentage of syllabus coverage, learning or mastery is inferred. The complete course scope is retained; no current comprehensive-exam exclusions have been verified.
Sources & scope
A public study companion.
Updated 20 November 2026. An independent preparation guide for the three Term 1 courses, based on BITS Coursera Cohort 8 course structures and the SST Batch 2030 Term 1 plan.
Enrolled course resources
The summaries and checklists on this page are free to read. The source course pages require login and appropriate enrolment.
Use the current instructions
The exam schedule and closed-book, computer-typed format reflect the current official notices. No exclusions from the full course scope have been verified. Practice prompts and suggested priorities make no claims about question selection, marks or cutoffs.
The 2023 past papers were open-book. Use them to practise concepts and answer construction; follow current instructions for what is allowed in the exam.
What the linked practice materials help you rehearse
Historical papers: practise producing an answer
The enrolled 2022–23 Discrete Mathematics make-up paper includes elementary proof and counterexample work, countability, graph counting and justification, connectivity arguments, Prim/Kruskal traces and subgroup reasoning. The 2023 Writing paper includes argumentative writing, paraphrase, a tightly limited summary, visual description and recognising the roles of abstract/conclusion sections.
These observations support practising written methods across the whole syllabus, including elementary ones. Both papers belong to the historical open-book setting; they do not predict the November 2026 questions or replace current instructions.
Programming: use the practice pack with the outline
The official comprehensive-practice resource contains easy, moderate and tough exercises and starter files. It includes structures, allocation, pointers, arrays, strings and matrices. It also includes realloc and linked-list operations beyond the named lecture outline: treat those as supplemental practice extensions, not verified additions to the current exam scope. The easy set identifies itself as generated by ChatGPT; check its worked claims against the course material and C rules.
This guide links to enrolled materials without republishing course attachments or their questions.
How to use the practice checklists
- Recognising a correct option and producing a complete answer are different skills. Even familiar elementary topics deserve a written explanation, trace, construction, derivation, proof or composed text when appropriate.
- Each module’s written-practice prompts are preparation tasks derived from named lecture topics. They do not predict current exam questions, answer formats or marks.
- Use the current official instructions to confirm the exam format and assessable scope. The linked 2023 past papers were open-book; they are practice material, not a blueprint for the November 2026 closed-book exams.
- Show assumptions and definitions, the method, intermediate steps and a clear conclusion. Programming traces need input and successive state; mathematical arguments need justified transitions; writing practice needs complete drafts and revision.
- Practise every proof family explicitly: direct, contrapositive, contradiction, trivial, vacuous, constructive and nonconstructive existence, cases, counterexamples, weak induction, strong induction and structural induction.
- A planned curriculum match does not establish the ability to write C, trace state, construct a proof or draft an academic text. Use the written tasks to check those abilities.
Privacy: checks use local storage on this browser only. No account, analytics, external fonts or backend is used. Shared computers share that browser’s checkmarks; clearing browser data removes them.