BCI Exam 2026 Prep

Complete study guide for Rajasthan Basic Computer Instructor Exam โ€” all papers analyzed, key topics identified, strategy ready.

100Questions
100Max Marks
2 hrsDuration
1/3Penalty/Wrong
40%Pass Marks
8+Papers Analyzed
๐Ÿ“‹ Exam Pattern
โšก Key Rules
  • โœ… 100 MCQ questions, 1 mark each
  • โŒ Wrong answer = โˆ’1/3 mark
  • โฌœ Unattempted = 0 marks
  • ๐ŸŽฏ Passing = 40 marks (SC/ST: 35)
  • โฑ Time = 2 hours (72 sec/question)
  • ๐Ÿ“ Hindi & English both available โ€” see ๐Ÿ“‹ Syllabus Overview for exact question counts per topic
๐Ÿ“… 30-Day Study Plan
Beginner Strategy: Don't try to learn everything deeply. Focus on recognition and pattern matching โ€” these are MCQs, not descriptive answers. Learn the key facts, definitions, and commonly repeated answers.
Week 1 โ€” Foundation (Days 1โ€“7)
Day 1-2
MS Office (Word, Excel, PowerPoint) โ€” Shortcut keys, functions. High PYQ weight!
Day 3-4
Computer Fundamentals โ€” Number Systems (Binary/Hex), Input/Output devices, memory types
Day 5-6
DBMS basics โ€” SQL commands (SELECT, INSERT, UPDATE, DELETE), Keys, Normal Forms
Day 7
Revise Week 1 + Do 50 MCQs practice
Week 2 โ€” Core CS (Days 8โ€“14)
Day 8-9
Data Structures โ€” Stack, Queue, Linked List (definitions, operations, types)
Day 10-11
Trees & Sorting โ€” BST, traversals, Bubble/Merge/Quick sort complexities
Day 12-13
OOP concepts โ€” Encapsulation, Inheritance, Polymorphism, Abstract classes
Day 14
Revise Week 2 + Do 80 MCQs practice
Week 3 โ€” Networks & OS (Days 15โ€“21)
Day 15-16
Computer Networks โ€” OSI model, TCP/IP, protocols (SMTP, HTTP, FTP, DHCP), devices
Day 17-18
Operating Systems โ€” Scheduling, memory management, paging, deadlock, semaphores
Day 19-20
Network Security โ€” Virus types, firewall, hacking techniques, cybersecurity basics
Day 21
Revise + Full mock test practice
Week 4 โ€” Revision & Practice (Days 22โ€“30)
Day 22-23
Java, Python basics โ€” OOP keywords, list methods, string functions, output tracing
Day 24-25
SAD + AI/ML โ€” SDLC models, testing types, ML algorithms, AI agents
Day 26-27
Mega Revision โ€” All shortcut keys, all protocol ports, all formulas
Day 28-30
Full mock tests from all papers, focus on weak areas, mental preparation
๐Ÿšซ Topics to Skip / Skim Only
With only 1 month, skip deep study of these: Complex C code output tracing, K-map minimization derivations, detailed graph algorithms (Dijkstra, BFS/DFS code), Blockchain deep theory, complex OS scheduling calculations, Assembly language programming, UML diagram drawing.

โŒ Don't Study Deeply

  • Complex pointer arithmetic in C
  • Detailed K-map derivation
  • Graph algorithm code
  • Blockchain internals
  • Assembly language
  • Complex prefix/postfix derivation

โšก Quick Skim Only

  • Pedagogy โ€” know basic types
  • Mental Ability โ€” practice a few
  • IoT protocols (MQTT)
  • Blockchain basics (what is it)
  • DotNet overview
  • HTML/XML tags

โœ… Must Master

  • All SQL commands + uses
  • All protocol names + ports
  • OSI 7 layers (in order)
  • OOP 4 pillars + definitions
  • Stack vs Queue differences
  • MS Office shortcut keys
๐Ÿ” Question Pattern Analysis
Types of Questions Asked

๐Ÿ“Œ Definition type: "Which of the following defines X?" โ€” Very common! Learn all key definitions.

๐Ÿ“Œ NOT type: "Which is NOT a type of X?" โ€” Appears 20-30% of the time. Know the wrong answers too!

๐Ÿ“Œ Application type: SQL query output, C code output, Stack operations

๐Ÿ“Œ Matching type: Match function/tool to its description

๐Ÿ“Œ Statement I/II type: "Which statements are correct?" โ€” Check each individually

๐Ÿ“Œ Numerical type: Binary conversions, complexity calculations (O notation)

Repeated Topics Across All Papers
Binary Search = O(log n) 7 papers
Stack for recursion / LIFO 6 papers
Primary Key in SQL 6 papers
SMTP = send email 6 papers
OSI model layers 5 papers
Router = connects networks 5 papers
INSERT to add rows in SQL 4 papers
Merge Sort = Divide & Conquer 4 papers
IPv4=32 bit, IPv6=128 bit 4 papers
Normal forms (2NF) 4 papers
๐ŸŽฏ Topic Priority Map
Strategy: Spend 70% time on RED topics โ€” they cover ~75 questions. Medium topics = ~15 questions. Skip deep-diving LOW topics.
๐Ÿ”ด HIGH Priority โ€” Study First
Data Structures & Algorithms~18 Qs
DBMS & SQL~15 Qs
Computer Networks~12 Qs
C / C++ / OOP~12 Qs
Operating Systems~10 Qs
MS Office (Word/Excel/PPT)~10 Qs
๐ŸŸก MEDIUM & ๐ŸŸข LOW Priority
Computer Organization / Number Systems~8 Qs
Java & Python~7 Qs
Network Security~6 Qs
System Analysis & Design~5 Qs
AI / ML / IoT~4 Qs
Pedagogy / Mental Ability~8 Qs
๐ŸŒณ
Data Structures
Stack, Queue, Trees, Sorting, Searching
HIGH~18 questions
๐Ÿ—„๏ธ
DBMS & SQL
Keys, Normal Forms, SQL Commands
HIGH~15 questions
๐ŸŒ
Computer Networks
OSI, TCP/IP, Protocols, Devices
HIGH~12 questions
๐Ÿ’ป
C / C++ / OOP
Encapsulation, Inheritance, Polymorphism
HIGH~12 questions
โš™๏ธ
Operating Systems
Scheduling, Paging, Deadlock
HIGH~10 questions
๐Ÿ“
MS Office
Word, Excel, PowerPoint shortcuts
HIGH~10 questions
๐Ÿ”ข
Computer Organization
Number Systems, Gates, Memory
MEDIUM~8 questions
โ˜•
Java & Python
OOP keywords, list methods, exceptions
MEDIUM~7 questions
๐Ÿ”’
Network Security
Malware, Firewalls, Hacking types
MEDIUM~6 questions
โš ๏ธ Negative Marking Strategy

Rule: Wrong Answer = โˆ’1/3 Mark Deducted

Every wrong answer costs you 1/3 of 1 mark. So if you attempt 3 questions and get all wrong, you lose 1 full mark. Unattempted questions = 0 (no penalty).

๐Ÿ“Š When to Attempt vs Skip
SituationActionWhy
100% sure of answerโœ… AttemptFull +1 mark
Eliminated 2 options, 50-50โœ… AttemptExpected value = +0.33
Eliminated 1 option (33% chance)โš ๏ธ SkipExpected value โ‰ˆ 0
No idea at allโŒ SkipExpected value = โˆ’0.33
"NOT" type question, know 3 of 4โœ… AttemptHigh confidence
๐Ÿงฎ Score Calculation Examples
Example 1: Attempt 80, get 60 correct, 20 wrong.
Score = 60 โˆ’ (20 ร— 1/3) = 60 โˆ’ 6.67 = 53.33 marks โœ… Pass
Example 2: Attempt all 100, get 45 correct, 55 wrong.
Score = 45 โˆ’ (55 ร— 1/3) = 45 โˆ’ 18.33 = 26.67 marks โŒ Fail
Safe Strategy: Attempt only 70-75 questions you're confident about. Score 55-60 correct = ~50 marks = comfortable pass.
๐Ÿง  Smart Elimination Tricks

๐Ÿšซ Eliminate Wrong Options

  • Options with "always" or "never" are usually wrong
  • "All of the above" โ€” if you know 2 are correct, likely right
  • "None of the above" โ€” less common as correct answer
  • Extreme values are often wrong

๐Ÿ“Œ Pattern from Papers

  • If statement says "NOT", all options are usually similar except one
  • In I, II, III type โ€” check each independently
  • Numeric answers: avoid extremes
  • Definition questions: longest accurate option is often right

โฑ Time Management

  • 72 seconds per question average
  • Spend max 60 sec on hard questions
  • Mark & skip if unsure โ€” come back later
  • Last 15 min: review skipped questions
  • Easy topics first: MS Office, Networks, DBMS
๐Ÿ”ฅ These numbers are EXACT โ€” counted question-by-question from bci-paper-main PYQ 2022 (all 100 questions verified). Not estimates. The biggest surprise: DBMS = 15 questions (highest!) and IoT = only 2 questions.
15
DBMS (most)
11
Programming
10
MS Office
10
CO + OS
9
Fundamentals
8
Mental Ability
8
DS
8
Security
7
Networks
7
SAD
5
Pedagogy
2
IoT (lowest)
(i) Pedagogy LOW 5 questions (Q1,2,3,4,51)
  • Types of research for understanding difficult concepts in class (Case study, Action research, Interaction analysis)1 q
  • Teaching methods to increase critical thinking (Project-based, Lecture, Demonstration, Inductive-deductive)1 q
  • Classroom management โ€” handling difficult students1 q
  • Applications of Essay Questions (ability to compare, apply principles, communicate ideas)1 q
  • Ranking scale / Likert scale in information gathering research1 q
(ii) Mental Ability: Decision making and Problem solving, Data Interpretation, Data Sufficiency, Logical Reasoning and Analytical Ability, Major developments in IT MEDIUM 8 questions (Q5โ€“12)
  • Decision making / Calendar puzzle (dates, days)1 q
  • Seating arrangement (linear/circular)1 q
  • Logical Reasoning โ€” Syllogism (conclusions from statements)1 q
  • Data Interpretation โ€” Pie chart / Bar graph / Table reading1 q
  • Logical notation / Symbol-based relationships (Pร—Q, PรทQ meaning)1 q
  • Number series โ€” find wrong/missing term1 q
  • Colour/word analogy (if X is called Y, what is Z called?)2 q
(iii) Fundamentals of Computer: Overview of Computer System, I/O devices, Number System, Data Representation MEDIUM 9 questions (Q16,17,40,44,45,46,47,59,93)
  • Multimedia file formats โ€” animation formats (FLI/FLC, MPEG, QT/Moov, SGI)1 q
  • Audio file extensions (NOT valid: .rar โ€” valid: .wav, .mp3, .mid)1 q
  • Storage cards โ€” SD full form (Secure Digital), MMC full form (Multimedia Card)1 q
  • System software vs Application software (what is NOT system software)1 q
  • Storage units hierarchy โ€” Terabyte is largest among KB/MB/GB/TB1 q
  • Computer generations โ€” 1st generation: ENIAC (1946)1 q
  • I/O devices โ€” MICR (Magnetic Ink Character Recognition) used in banking1 q
  • Printers โ€” Line printer vs Page/Laser printer difference1 q
  • Windows shortcuts โ€” Snipping tool (Win+Shift+S or Ctrl+Shift+S)1 q
(iv) Data Processing: Word Processing (MS-Word), Spread Sheet (MS Excel), Presentation (MS PowerPoint), DBMS Software (MS-Access) HIGH 10 questions (Q15,27,28,37,38,39,41,42,43,81)
  • MS Word โ€” Sans Serif fonts (Arial, Calibri โ€” without feet/strokes)1 q
  • MS Word โ€” 'Gutter' is related to Margins (space for binding)1 q
  • MS Word โ€” 'Create Bookmark' to assign a name to a specific point in document1 q
  • MS Word โ€” Decorative text = WordArt (not SmartArt, ClipArt, Bookmark)1 q
  • MS Excel โ€” Insert columns between G and H (select column H โ†’ insert)1 q
  • MS Excel โ€” =LCM(5,7,35) result = 351 q
  • MS Excel โ€” odd one out: Portrait (print setting, not Excel-specific feature like Scenario Manager/Goal Seek/Data Table)1 q
  • MS PowerPoint โ€” NOT a valid Master view: Outline Master (valid: Notes/Slide/Handout master)1 q
  • MS PowerPoint โ€” Slide show from beginning: F5, from current slide: Shift+F71 q
  • MS PowerPoint โ€” View to rearrange slides = Slide Sorter1 q
(v) Programming Fundamentals: C, C++, Java, DotNet, AI, Machine Learning, Python, Block Chain, OOPs, IDE HIGH 11 questions (Q58,84,88,89,91,92,95,97,98,99,100)
  • Java โ€” String creation methods (String S = "Hello Java" vs new String("Hello Java"))1 q
  • Java โ€” 'final' keyword: method declared final cannot be overridden in subclass1 q
  • Java โ€” Constants declared with 'static' keyword cannot be changed1 q
  • AI โ€” Agent types: Simple reflex, Model-based, Learning, Utility-based1 q
  • C โ€” Pointer expression: *ptrdata++ evaluated as (C++) meaning post-increment of pointer1 q
  • C โ€” Program to compute GCD using while loop (Euclidean algorithm: p=p-q or q=q-p)1 q
  • Exception handling โ€” try/catch/finally true statements (catch block optional if finally exists)1 q
  • OOP โ€” Abstract class: subclasses not providing all method implementations are also abstract1 q
  • C โ€” Real data types: float, double, long double (floating point types)1 q
  • C โ€” Code output tracing: if-else with a>b && a<=c conditions1 q
  • Python โ€” Incorrect declaration: xyz=5,000,000 (commas not valid; use 5000000 or 5_000_000)1 q
(vi) Data Structures and Algorithms: Arrays, Linked list, Stack, Queues, Binary trees, BST, Graphs, Sorting, Searching HIGH 8 questions (Q13,22,34,35,36,62,63,80)
  • BST Traversal โ€” given preorder+inorder, find postorder (e.g., preorder ABCDEF, inorder BADCFE โ†’ postorder BDFECA)1 q
  • Expression evaluation โ€” postfix/prefix value computation (+,โˆ’,*,3,2,/,8,4,1 = 12)1 q
  • BST deletion โ€” when root node deleted, what becomes new root1 q
  • Expression notation โ€” prefix notation of (a+(b/c)*(d^e)-f) = -+a*+a/bcde^f1 q
  • Stack overflow โ€” max value of top before overflow (#define SIZE 11 โ†’ top max = 10)1 q
  • Binary search โ€” true/false: faster than linear search; may not apply on all input lists1 q
  • Linear array algorithm โ€” given LB to UB loop with PROCESS โ†’ sorts/searches/traverses1 q
  • Bubble sort โ€” output after completing first pass on input array (32,51,27,85,66,23,13,57)1 q
(vii) Computer Organization and Operating System: Basic Structure, CPU, Memory, I/O, Process Management HIGH 10 questions (Q30,57,74,75,94 CO + Q48,82,85,86,87 OS)
  • [CO] Combinational logic circuit: 2 input lines, 1 output โ†’ Encoder (2โ†’1) vs Decoder1 q
  • [CO] Cache memory โ€” used to minimize memory-processor speed mismatch (UVEPROM/Flash/DVD/Cache)1 q
  • [CO] RAM chip: 1024 words ร— 8 bits (1Kร—8), number of 2ร—4 decoders needed to make 16Kร—16 RAM1 q
  • [CO] Bootstrap loader is always stored in ROM / BIOS1 q
  • [CO] Number system โ€” (356)โ‚ˆ to hexadecimal = EA (octalโ†’binaryโ†’hex)1 q
  • [OS] Three threads sharing one object โ†’ Race condition / Mutual exclusion problem1 q
  • [OS] Spooler = special software to create job queue (for printing)1 q
  • [OS] How many states can be processed by OS (process states: New/Ready/Running/Waiting/Terminated = 5)1 q
  • [OS] INT file in Windows 95 = a program file / initialization file1 q
  • [OS] Counting semaphore initialized to 8, after 12 P(wait) + 7 V(signal) โ†’ resulting value = 31 q
(viii) Communication and Network Concepts: Network Models, Devices, Mobile Communication MEDIUM 7 questions (Q14,29,31,32,77,78,79)
  • Email protocol โ€” SMTP used to move messages from source to destination (not IMAP/POP/UDP)1 q
  • IP packet โ€” first 8 bits = 01000010, total bytes in header = 16 bytes (upper layer = ICMP)1 q
  • Webpage transfer protocol โ€” HTTP (not HTML, WML, WTTP)1 q
  • WiFi vs WiMax โ€” WiFi: radio waves/IEEE 802.11x; WiMax: spectrum/IEEE 802.16y; WiMax covers larger area1 q
  • Base64 encoding โ€” 24 bits โ†’ four 6-bit chunks โ†’ sent as 32 bits (encoding scheme)1 q
  • FTP โ€” three types of data: file types, data types, transmission modes (stream/block/compressed)1 q
  • Checksum โ€” used for both error correction and error detection (both A and B)1 q
(ix) Network Security: Viruses, Malicious attacks, Firewalls, Ethical Hacking HIGH 8 questions (Q24,70,71,72,73,76,83,96)
  • Encryption โ€” information that gets transformed = Plain text (input to encryption)1 q
  • Firewall โ€” Network layer firewall works as Packet filter (not Frame filter)1 q
  • Malware โ€” alters regular functionality of OS, acts as system admin on victim = Rootkit1 q
  • Hacktivism โ€” act of hacking for political/social motivation (not gaining access to fix weaknesses)1 q
  • Phreaking โ€” technique used to make free phone calls by exploiting telecom systems1 q
  • Wi-Fi hacking tools โ€” Aircrack-ng and Wireshark commonly used in Wi-Fi hacking process1 q
  • Password cracking techniques โ€” AttackSyllable, AttackBrut forcing, AttackHybrid (all are forms)1 q
  • Virus Life Cycle โ€” phases: Dormant, Triggering, Execution (NOT "Start" โ€” not a valid phase)1 q
(x) Database Management System: RDBMS, Database Design, Manipulating Data, NoSQL HIGH 15 questions โ€” MOST in exam! (Q18,19,21,23,49,52,60,61,64,65,66,67,68,69,90)
  • Keys โ€” Super key = attribute(s) that uniquely identify records; Candidate key = minimal super key2 q
  • NoSQL โ€” types: CouchDB (Document), MongoDB (Document), HBase (Column); QBase is NOT a type1 q
  • RDBMS concepts โ€” Trigger (to maintain materialized view); Pointer and Clone object NOT used for this1 q
  • SQL error statements โ€” SELECT * from emp where empid=10003 vs 10009 and last_name='GELLER'1 q
  • Candidate keys = minimal super keys in relational database1 q
  • Normal Forms โ€” relation with full functional dependency + no transitive = 3NF (answer NOT BCNF)1 q
  • SQL DELETE โ€” DELETE FROM EMPLOYEE having 'n' tuple deletes ALL 'n' tuples1 q
  • SQL schema change โ€” valid pair: DROP,ALTER and DROP,UPDATE (not CREATE,ALTER alone)1 q
  • Relational Algebra โ€” Unary operators: Select (ฯƒ) and Project (ฯ€) โ€” Union and Product are binary1 q
  • Super key โ€” NOT a super key in schema V,W,X,Y,Z with PK=VY: must include V and Y or their superset1 q
  • DDL/DML/TCL โ€” Match: DDLโ†’ALTER TABLE, DMLโ†’COMMIT, TCLโ†’REVOKE, Binary opโ†’LOCK TABLE2 q
  • Tuple Relational Calculus โ€” P1โ†’P2 is equivalent to ยฌP1โˆจP21 q
  • Relational data manipulation operations โ€” Relational algebra (not predicate/tuple calculus)1 q
  • SQL aggregate function โ€” AVG is an aggregate function (not SELECT, CREATE, MODIFY)1 q
(xi) System Analysis and Design: SDLC, DFD, UML, Testing, Software Approaches MEDIUM 7 questions (Q25,26,50,53,54,55,56)
  • DFD โ€” Black hole in DFD = a data store with no inbound flows (data only goes in, never comes out)1 q
  • Software process models โ€” COCOMO is NOT a process model (it's a cost estimation model)1 q
  • Decision table โ€” left-lower quadrant = Condition entry (conditions listed, not actions)1 q
  • Software complexity measurement โ€” LOC (Lines of Code), FP (Function Points), man-years1 q
  • Test levels in order โ€” Unit โ†’ Integration โ†’ System โ†’ Acceptance1 q
  • Gorilla testing = focuses on heavily testing one particular module1 q
  • System study project first step = Describe information needs (not define performance criteria)1 q
(xii) Internet of Things and its application: Internet Technology, HTML, XML, E-Commerce, IoT LOW 2 questions only (Q20,33) โ€” lowest in exam
  • XML โ€” most accurate statement: XML used to describe hierarchically organized information (not produce HTML output, not presentation info)1 q
  • XML correct statements โ€” (i) display data only, (ii) can be used as database, (iii) XPATH stores IP addresses โ€” which are true1 q
  • Introduction of Internet Technology, Protocol, HTML, E-Commerce, Browsers, LAN/MAN/WAN0 q in PYQ 2022 โ€” may appear in future exams
  • IoT devices, sensors, applications (smart home, healthcare)0 q in PYQ 2022 โ€” study lightly
๐ŸŒณ Data Structures & Algorithms VERY HIGH โ€” ~18 Questions
Appears in ALL 8 papers. Focus: Stack (LIFO/recursion), Queue (types), BST traversals, Sorting time complexities, Binary Search = O(log n). These exact facts repeat across every paper.
๐Ÿ“š Stack Repeated 6+ times

Core Facts

  • LIFO โ€” Last In, First Out (also called LIFO list)
  • Operations: push (insert), pop (remove), peek/top (view top)
  • Overflow = push to a full stack
  • Underflow = pop from an empty stack
  • Implemented using: Array or Linked List

Applications (Must Know All)

  • Recursion implementation
  • Infix โ†’ Postfix / Prefix conversion
  • Expression evaluation
  • Balanced parentheses checking
  • String reversal
  • Backtracking (maze, N-queens)
  • Undo/Redo in text editors
  • Browser Back button
Q. Which data structure is used in recursion? (All papers)
โœ… Stack
Q. Stack is also called _____ list.
โœ… LIFO list
Q. Which is NOT an application of Stack?
(A) Recursion (B) Asynchronous data transfer (C) Backtracking (D) String reversal
โœ… B โ€” Asynchronous data transfer (that is Queue's application)
Q. Which data structure converts infix to prefix?
โœ… Stack
Q. Prefix of A+B*C is?
โœ… +A*BC
๐Ÿšถ Queue Repeated 5+ times

Core Facts

  • FIFO โ€” First In, First Out
  • Insert at Rear, Delete from Front
  • Check before delete: Underflow (empty check)
  • Circular Queue = Ring Buffer
  • Priority Queue: best implemented with Binary Heap
  • Deque (Double-ended queue): insert/delete from both ends

Queue Types

  • Linear Queue โ€” simple array, wastes space
  • Circular Queue โ€” ring buffer, avoids wastage
  • Priority Queue โ€” elements have priority
  • Deque โ€” insert/delete from both ends

Applications

  • CPU Scheduling (Round Robin)
  • Printer spooling
  • BFS traversal
  • Asynchronous data transfer
Q. Circular Queue is also known as?
โœ… Ring Buffer
Q. Condition to check before deletion from queue?
โœ… Underflow (check if queue is empty)
Q. Which is NOT a type of Queue?
(A) Linear (B) Circular (C) Double-ended (D) Diagonal
โœ… D โ€” Diagonal (not a real queue type)
Q. Which data structure for priority queue implementation?
โœ… Binary Heap
Q. Circular queue is empty when front = rear = ?
โœ… โˆ’1
๐Ÿ”— Linked List Repeated 3+ times

Types

  • Singly: traverse one direction
  • Doubly: traverse both directions, extra space needed
  • Circular: last node points to first

Key Facts

  • Dynamic size (unlike array)
  • No random access (unlike array)
  • Binary search cannot be applied on linked list
  • Doubly linked list: implementation harder than singly
  • Stack can be implemented using linked list
Q. Which is NOT suitable for binary search?
โœ… Linked List (no random access)
Q. Doubly linked list โ€” incorrect statement?
(A) Can traverse both ways (B) Needs extra space (C) Easier to implement than singly
โœ… C โ€” It is harder to implement, not easier
๐ŸŒฒ Trees & Binary Search Trees Repeated 5+ times

BST Rules (Critical)

  • Left child < Root node
  • Right child > Root node
  • Both subtrees must also be BSTs
  • Search time: O(log n) average, O(n) worst

Tree Traversals (Memorise)

  • Pre-order: Root โ†’ Left โ†’ Right (also = depth-first)
  • In-order: Left โ†’ Root โ†’ Right (gives sorted output in BST)
  • Post-order: Left โ†’ Right โ†’ Root
  • Tip: "Pre" = Root first, "Post" = Root last

Balanced Binary Tree

  • Height difference of two subtrees โ‰ค 1
  • Red-Black Tree: new root node = Black
  • Heap: complete binary tree for priority queue
Q. In BST, which subtree has elements greater than root?
โœ… Right subtree
Q. Pre-order traversal is same as?
โœ… Depth-first order
Q. Which technique is NOT used in binary tree?
(A) Preorder (B) Inorder (C) Postorder (D) Randomized traversal
โœ… D โ€” Randomized traversal
Q. In balanced binary tree, height difference of subtrees cannot exceed?
โœ… 1
Q. Post-order of tree with pre=ABCDEF, in=BADCFE?
โœ… BDFECA (trace through the tree)
๐Ÿ”„ Sorting Algorithms Time complexity asked every paper
AlgorithmBestAverageWorstSpaceStable?Paradigm
Bubble SortO(n)O(nยฒ)O(nยฒ)O(1)โœ… Yesโ€”
Selection SortO(nยฒ)O(nยฒ)O(nยฒ)O(1)โŒ Noโ€”
Insertion SortO(n)O(nยฒ)O(nยฒ)O(1)โœ… Yesโ€”
Merge SortO(n log n)O(n log n)O(n log n)O(n)โœ… YesDivide & Conquer
Quick SortO(n log n)O(n log n)O(nยฒ)O(log n)โŒ NoDivide & Conquer
Heap SortO(n log n)O(n log n)O(n log n)O(1)โŒ Noโ€”
Q. Merge Sort is an example of which algorithm design paradigm?
โœ… Divide and Conquer
Q. Which sorting has worst case O(n log n)?
(A) Quick (B) Merge (C) Bubble (D) Selection
โœ… B โ€” Merge Sort (always O(n log n))
Q. Sorting is stable if it maintains relative order of non-distinct elements?
โœ… True. Merge Sort and Bubble Sort are stable.
Q. Bubble sort output after 1st pass on [32,51,27,85,66,23,13,57]?
โœ… [32,27,51,66,23,13,57,85] โ€” largest bubbles to end
๐Ÿ” Searching Algorithms

Linear Search

  • Time: O(n)
  • Works on unsorted arrays
  • Checks each element one by one

Binary Search

  • Time: O(log n) โ€” asked in EVERY paper!
  • Requires sorted array
  • Divide array in half each time
  • Cannot be applied on linked list
Q. Order of binary search algorithm is?
โœ… O(log n) โ€” also written as N log N... Answer is O(log n)
Q. Binary search is faster than linear search โ€” TRUE or FALSE?
โœ… TRUE, but ONLY on sorted data. Linear search can work on unsorted too.
โšก Big-O Quick Reference (Must Memorise)
Remember: O(1) < O(log n) < O(n) < O(n log n) < O(nยฒ) < O(2โฟ)
ComplexityNameExamples
O(1)ConstantArray access, Hash table lookup
O(log n)LogarithmicBinary Search, BST average
O(n)LinearLinear Search, infix-postfix O(N)
O(n log n)LinearithmicMerge Sort, Heap Sort, Quick Sort (avg)
O(nยฒ)QuadraticBubble, Selection, Insertion Sort
Big-O represents the UPPER BOUND (worst case) of an algorithm's runtime. It does NOT represent average or lower bound (that's ฮฉ โ€” Omega).
๐Ÿ—„๏ธ DBMS & SQL VERY HIGH โ€” ~15 Questions
Appears in ALL 8 papers. Focus: SQL commands (INSERT/DELETE/COMMIT), Keys (Primary/Foreign/Candidate), Normal Forms (2NF/3NF/BCNF), HAVING vs WHERE, NoSQL types.
๐Ÿงช ACID Properties (Transactions)

ACID โ€” Must Know Full Form

  • Atomicity โ€” All or nothing
  • Consistency โ€” DB stays valid
  • Isolation โ€” Transactions don't interfere
  • Durability โ€” Committed data persists

Database Types

  • Relational (RDBMS) โ€” tables, SQL
  • Network โ€” records + links
  • Hierarchical โ€” tree structure
  • Object-Oriented DBMS
  • NOT a type: Sequential DBMS โŒ
Q. DBMS acts as interface between ___ and ___ of enterprise system.
โœ… Database application, the database
๐Ÿ“‹ SQL Command Categories
CategoryCommandsUse
DDLCREATE, ALTER, DROP, TRUNCATEDefine structure
DMLINSERT, UPDATE, DELETE, SELECTManipulate data
DCLGRANT, REVOKEControl access
TCLCOMMIT, ROLLBACK, SAVEPOINTTransactions
Schema change statements in SQL: DELETE, ALTER (DDL) โ€” DROP, ALTER โ€” also DELETE, UPDATE (DML). Valid pair = DELETE, ALTER
๐Ÿ”‘ Critical SQL Commands (All from PYQ Papers)
Q. Which SQL command is used to add new rows to a table?
โœ… INSERT
Q. ___ command makes updates by transaction permanent.
โœ… COMMIT
Q. To DROP a constraint from a table in SQL, we use?
โœ… ALTER statement with a DROP clause
Q. SQL Views are also known as?
โœ… Virtual Tables
Q. Which is NOT a constraint in SQL?
(A) Primary key (B) Not null (C) Union
โœ… C โ€” UNION is not a constraint
Q. If DELETE FROM EMPLOYEE on 'n' tuple table executes, how many tuples deleted?
โœ… All 'n' tuples (DELETE without WHERE deletes all rows)
Q. SELECT ROUND(65.726, โˆ’1) FROM DUAL; prints?
โœ… 70
Q. Default sort order in SQL ORDER BY clause?
โœ… ASC (Ascending)
Q. Which is NOT a valid aggregate function?
(A) COUNT (B) COMPUTE (C) SUM (D) AVG
โœ… B โ€” COMPUTE is not a standard aggregate function
๐Ÿ—๏ธ Database Keys (Critical โ€” Every Paper)
Key TypeDefinitionProperties
Primary KeyUniquely identifies each recordNOT NULL + UNIQUE. Only 1 per table
Foreign KeyReferences Primary Key of another tableReferential integrity. Can be null.
Candidate KeyCan be chosen as primary keySubset of Super Key. Minimal super key.
Super KeySet of attributes that uniquely identify a recordCandidate key is a subset of Super Key
Composite KeyCombination of 2+ columns as keyUsed when single column not unique
Referential Integrity: Values in a Foreign Key column must exist in the Primary Key of the referenced table.
Q. A super key is an attribute or combination that uniquely identifies records โ€” TRUE/FALSE?
โœ… TRUE โ€” Candidate key is a SUBSET of super key (Statement I true)
Q. In relational DB, minimum super keys are called?
โœ… Candidate Keys
Q. How many Primary Keys can a table have?
โœ… Only 1 (one primary key per table)
Q. Referential integrity constraint can be specified with?
โœ… Foreign Key
๐Ÿ“ Normal Forms (Normalization) Repeated 4+ times
Normal FormConditionEliminates
1NFAll attributes are atomic (no repeating groups)Multi-valued attributes
2NFIn 1NF + every non-prime attribute fully dependent on PRIMARY KEYPartial dependency
3NFIn 2NF + no transitive dependencyTransitive dependency
BCNFEvery key attribute is fully functionally dependent on primary key, no transitive dependencyAnomalies not covered by 3NF
Simple memory trick: 1NF = Atomic. 2NF = Full dependency on PK. 3NF = No transitive. BCNF = Stricter 3NF.
Q. Which normal form ensures every non-prime attribute is fully functionally dependent on the primary key?
โœ… 2NF (Second Normal Form)
Q. A relation where every key attribute is fully functionally dependent on PK and no transitive dependency = ?
โœ… BCNF
Q. Lack of normalization leads to?
โœ… Insertion anomalies (update/delete anomalies too)
Q. An attribute of a table matching the primary key of another table is called?
โœ… Foreign Key
๐Ÿงฎ HAVING vs WHERE

Key Difference

  • WHERE โ€” filters rows before grouping
  • HAVING โ€” filters groups after GROUP BY
  • HAVING can use aggregate functions (SUM, COUNT, etc.)
  • WHERE cannot use aggregate functions directly
Q. After groups are established, SQL applies predicates in ___ clause to use aggregate functions.
โœ… HAVING
Q. ___ clause creates temporary relation for the query.
โœ… WITH
๐Ÿƒ NoSQL Databases

NoSQL Types (Know Names)

  • MongoDB โ€” Document-based โœ…
  • CouchDB โ€” Document-based โœ…
  • HBase โ€” Column-based โœ…
  • Cassandra โ€” Column-based โœ…
  • QBase โ€” โŒ NOT a NoSQL type (trick question!)
  • Redis โ€” Key-value store โœ…
Q. Which is NOT a type of NoSQL?
(A) CouchDB (B) MongoDB (C) HBase (D) QBase
โœ… D โ€” QBase is NOT a NoSQL type
Q. Which DB object does not physically exist?
(A) Base table (B) Index (C) View
โœ… C โ€” View (it's a virtual/logical table)
๐Ÿ”ฃ Relational Algebra Quick Reference
OperationSymbolType
Selectฯƒ (sigma)Unary
Projectฯ€ (pi)Unary
UnionโˆชBinary
Productร—Binary
Natural Joinโ‹ˆBinary โ€” basic approach for joining
Q. Which of the following are Unary operators in Relational Algebra?
(1) Select (2) Project (3) Union (4) Product
โœ… 1 and 2 only (Select and Project are unary)
๐Ÿ’ป C / C++ / OOP HIGH โ€” ~12 Questions
Appears in 6 of 8 papers. Focus: 4 OOP pillars (definitions!), Abstract class, Virtual functions, Constructors, Exception handling, Access specifiers.
๐Ÿ›๏ธ The 4 Pillars of OOP Most Important

1. Encapsulation

  • Wrapping data + functions into a single unit (class)
  • "Data hiding" โ€” restricting direct access
  • Achieved via access specifiers (private/public)
  • Example: class with private variables + public methods

2. Inheritance

  • Derived class inherits properties of base class
  • Java keyword: extends
  • Supports code reusability
  • Types: Single, Multiple (C++), Multi-level, Hierarchical, Hybrid

3. Polymorphism

  • One name, many forms
  • Compile-time: Function overloading, Templates, Operator overloading
  • Runtime: Virtual functions, Function overriding
  • "Ability to take more than one form"

4. Abstraction

  • Hiding implementation, showing only interface
  • Achieved via Abstract classes and Interfaces
  • Focus on WHAT not HOW
Q. Wrapping data and its functionality into a single entity is called?
โœ… Encapsulation
Q. The ability to take more than one form is called?
โœ… Polymorphism
Q. Insulation of data from direct access by the program is?
โœ… Encapsulation / Data Hiding
Q. OOP uses which approach?
โœ… Bottom-up (POP uses Top-down)
Q. Compile-time polymorphism in C++ is implemented using?
โœ… Templates (function/class templates)
Q. Which features must a language support to be pure OOP?
โœ… Encapsulation + Inheritance + Polymorphism (all 3)
๐Ÿ” Access Specifiers
SpecifierSame ClassDerived ClassOutside
publicโœ…โœ…โœ…
protectedโœ…โœ…โŒ
privateโœ…โŒโŒ
In class: members are private by default. In struct: members are public by default.
Q. Members that can be inherited but NOT accessible in any derived class?
โœ… Private (inherited but inaccessible)
๐Ÿ—๏ธ Constructors

Types of Constructors

  • Default Constructor โ€” No parameters. Compiler provides if not defined.
  • Parameterized Constructor โ€” Takes arguments
  • Copy Constructor โ€” Copies from another object

Key Facts

  • Constructor has SAME name as class
  • No return type (not even void)
  • Destructor: ~ClassName() โ€” called when object destroyed
  • Virtual inheritance: avoids multiple copies of base class
Q. Which constructor is provided by compiler if not defined?
โœ… Default constructor
๐ŸŽญ Abstract Class & Virtual Functions Repeated 4+ times

Abstract Class

  • A class with at least one pure virtual function
  • Pure virtual: virtual void func() = 0;
  • Cannot create objects of abstract class directly
  • Subclass MUST implement all pure virtual functions
  • Can have constructors and static methods? NO
  • Abstract class subclass that doesn't implement is also abstract

Virtual Functions

  • Enables runtime polymorphism
  • If a method is final, it CANNOT be overridden
  • Virtual inheritance: avoids diamond problem (multiple copies)
Q. Abstract class in C++ is a class with at least one?
โœ… Pure virtual function
Q. If a method is declared final, that method cannot be overridden โ€” T/F?
โœ… TRUE
Q. Abstract class โ€” which statement is INCORRECT?
(A) Subclass not implementing becomes abstract (B) Sometimes we can create objects directly (C) Constructor/static cannot be declared
โœ… B and C are incorrect (can't create objects; can have constructor)
Q. Virtual inheritance in C++ is used to?
โœ… Avoid multiple copies of base class in derived class (solves diamond problem)
โš ๏ธ Exception Handling

Keywords

  • try โ€” code that might throw exception
  • throw โ€” throws an exception
  • catch โ€” handles the exception
  • catch block without try is NOT possible
  • try block can have multiple catch blocks
  • finally block always executes
Q. C++ code causing abnormal behavior should be written under ___ block.
โœ… try
Q. catch block without try block โ€” possible?
โœ… No โ€” catch requires try
๐Ÿ“Œ C Language Key Facts

Data Types & Misc

  • Real data types in C: float, double, long double
  • %ld format specifier for long int
  • Conditional operator ( ? : ) = ternary operator
  • Default return type of user-defined function: int
  • = is assignment, NOT a relational/logical operator
  • Arrays in C: index starts at 0
Q. Conditional operator in C is also called?
โœ… Ternary operator
Q. Which is NOT a logical/relational operator in C?
(A) != (B) || (C) = (D) ==
โœ… C โ€” Single = is assignment, not comparison
โš™๏ธ Compiler, Interpreter, Pointers โ€” Quick Facts

Compiler

  • Translates entire source program to machine code
  • Input = source program, Output = object code
  • Does NOT execute the program
  • Faster execution than interpreter

Key C++ Points

  • Creator of C++: Bjarne Stroustrup
  • Creator of C: Dennis Ritchie / Brian Kernighan
  • Header file extension: .h
  • Namespace: using namespace std;
  • delete vs delete[]: delete[] for arrays

Inline Functions

  • Substituted at point of call (no function call overhead)
  • Generally small and simple functions
  • Save overhead of return call
  • Incorrect: "generally very large and complicated"
Q. Creator of C++ language?
โœ… Bjarne Stroustrup
Q. A compiler translates source program to machine code as a whole โ€” TRUE/FALSE?
โœ… TRUE (that's the definition of a compiler)
๐ŸŒ Computer Networks HIGH โ€” ~12 Questions
Appears in ALL papers. Focus: OSI 7 layers (in order!), Protocols + ports, Router vs Switch vs Hub, IPv4=32bit/IPv6=128bit, SMTP=email, HTTP=web.
๐Ÿ“ถ OSI 7-Layer Model Most Repeated
Memory Trick (Top to Bottom): All People Seem To Need Data Processing = Application, Presentation, Session, Transport, Network, Data Link, Physical
#LayerFunctionProtocols/DevicesKey Fact
7ApplicationUser interface, network servicesHTTP, FTP, SMTP, DNSClosest to user
6PresentationData format, encryption, compressionSSL, TLS, JPEGCompression & Decompression here
5SessionSession management, dialog controlNetBIOS, RPCEstablishes/terminates sessions
4TransportEnd-to-end delivery, flow controlTCP, UDPFlow control. Host-to-host connectivity.
3NetworkRouting, logical addressingIP, ICMP, RouterRouter operates here
2Data LinkPhysical addressing (MAC), framingEthernet, Switch, BridgeError detection via CRC/Hamming
1PhysicalBit transmission, cables, signalsHub, Repeater, NICHub/Repeater operate here
Q. Which OSI layer is responsible for routing and forwarding data packets?
โœ… Network Layer (Layer 3)
Q. Which layer responsible for compression/decompression of data?
โœ… Presentation Layer (Layer 6)
Q. End-to-end connectivity (host-to-host) is provided at which layer?
โœ… Transport Layer (Layer 4)
Q. Repeater operates at which layer?
โœ… Physical Layer (Layer 1)
๐Ÿ“ก Key Protocols & Ports Memorise ALL
ProtocolPortPurposeKey Fact
HTTP80Web browsingCommonly used for webpage transfer
HTTPS443Secure webHTTP + SSL/TLS
SMTP25Send emailUsed to SEND email over internet (asked 6 times!)
POP3110Receive emailDownloads email to client
IMAP143Receive emailKeeps email on server
FTP21File transfer3 types: stream, block, compressed
DNS53Domain name resolutionConverts domain to IP
DHCP67/68Auto IP assignmentAutomates IP, Subnet mask, DNS, Gateway config
ARPโ€”IP to MACConverts IP address to physical MAC address
ICMPโ€”Error messagesUsed by ping command. Upper layer = ICMP for IP packets
Telnet23Remote loginInsecure (plaintext)
SSH22Secure remote loginEncrypted Telnet alternative
MQTT1883IoT messagingLightweight IoT protocol
Q. Which protocol is used to send email over the Internet?
โœ… SMTP (Simple Mail Transfer Protocol)
Q. Which protocol automates IP Address, Subnet mask, DNS, default gateway?
โœ… DHCP (Dynamic Host Configuration Protocol)
Q. Commonly used protocol for webpage transfer?
โœ… HTTP
Q. Which protocol converts IP address to MAC address?
โœ… ARP (Address Resolution Protocol)
๐Ÿ”ข IP Addressing Repeated Every Paper
TypeBitsFormatExample
IPv432 bits4 octets (0-255)192.168.1.1
IPv6128 bits8 groups of hex2001:db8::1

Private IP Ranges (Not Publicly Routable)

  • 10.0.0.0 โ€“ 10.255.255.255 (Class A)
  • 172.16.0.0 โ€“ 172.31.255.255 (Class B)
  • 192.168.0.0 โ€“ 192.168.255.255 (Class C) โ† Most common
  • 127.0.0.1 = Loopback address (Local loop back)

IP Packet โ€” First 8 bits

  • First 8 bits of IP packet with 01000010 โ†’ Number of hops = 2
  • Total bytes in IP header = 16 bytes
  • Upper layer protocol for IP = ICMP
Q. In IPv4, every IP address is formed using?
โœ… 32 bits
Q. Length of IPv6 is?
โœ… 128 bits
Q. 127.0.0.1 is an example of?
โœ… Local loop back address
Q. Which is a private IP address?
(A) 12.0.0.1 (B) 172.168.2.3 (C) 168.202.32.4 (D) 192.168.12.12
โœ… D โ€” 192.168.12.12 is private
Q. Purpose of subnet mask in TCP/IP?
โœ… To identify the network portion of an IP address
๐Ÿ”Œ Network Devices Repeated 4+ times
DeviceOSI LayerFunctionKey Fact
RouterNetwork (L3)Connects multiple DIFFERENT networksUses IP addresses. Most important device!
SwitchData Link (L2)Connects devices within SAME LANUses MAC addresses. Smarter than Hub.
HubPhysical (L1)Multi-port repeater, broadcasts to allDumb device, creates collisions
BridgeData Link (L2)Connects 2 LANs, filters by MACFrames from one LAN to another via Bridge
GatewayAll layersProtocol translation between networksWorks at all OSI layers
RepeaterPhysical (L1)Amplifies/regenerates signalsExtends network range
ModemPhysicalModulate/demodulate analog-digitalUsed for dial-up/broadband
Q. Primary function of a router in a computer network?
โœ… To connect multiple networks together
Q. Which device connects multiple devices within the same LAN?
โœ… Switch
Q. Network layer firewall works as?
โœ… Packet filter
Q. Frames from one LAN to another are transmitted via?
โœ… Bridge
โšก TCP vs UDP
FeatureTCPUDP
ConnectionConnection-orientedConnectionless
ReliabilityReliable (ACK)Unreliable
SpeedSlowerFaster
UseHTTP, FTP, EmailDNS, Video, VoIP
RoutingSame pathDifferent paths possible
๐Ÿ“ถ WiFi & WiMax

Key Standards

  • WiFi: IEEE 802.11x โ€” uses radio waves
  • WiMax: IEEE 802.16y โ€” uses spectrum, covers larger area than WiFi
  • Bluetooth 5.0 max speed: 2 Mbps
  • WiFi โ€” wireless connection using radio waves โœ…
  • WiMax covers comparatively larger area than WiFi โœ…
Q. WiFi is defined under IEEE standard?
โœ… IEEE 802.11x
Q. Max data rate of Bluetooth 5.0?
โœ… 2 Mbps
โš™๏ธ Operating Systems HIGH โ€” ~10 Questions
Appears in all papers. Focus: CPU Scheduling (Round Robin!), Paging vs Segmentation, Deadlock 4 conditions, Semaphores=race condition, Thrashing=excessive paging.
โฑ๏ธ CPU Scheduling Algorithms Very Important
AlgorithmTypeKey PropertyFavours
FCFS (First Come First Served)Non-preemptiveSimple, processes in arrival orderCPU-bound
SJF (Shortest Job First)Non-preemptiveMinimum average waiting timeShort jobs
Round RobinPreemptiveTime quantum/slice. As time quantum โ†‘, avg turnaround โ†“Interactive/Time-sharing
Priority SchedulingBothHigher priority first. Can cause starvation.High priority processes
MLFS (Multilevel Feedback)PreemptiveMultiple queues with different prioritiesCPU-bound
Q. In Round Robin scheduling, as time quantum increases, average turnaround time?
โœ… Decreases (becomes similar to FCFS eventually)
Q. Disk scheduling involves deciding?
โœ… The order in which disk access requests must be serviced
Q. Which algorithms FAVOUR CPU-bound processes?
1. Round Robin 2. FCFS 3. Multilevel feedback queues
โœ… 2 only (FCFS) โ€” Round Robin favours short/interactive jobs
Q. Spooling helps because?
โœ… Computer is released to do other things while still printing
๐Ÿ’พ Memory Management Repeated in every paper
TechniqueFixed/VariableKey Fact
PagingFixed size pagesPages = fixed size blocks of virtual memory. Eliminates external fragmentation.
SegmentationVariable sizeLogical division (code, data, stack segments). Has external fragmentation.
Virtual Memoryโ€”Only active pages in RAM; rest on disk. Allows running larger programs.

Key Definitions

  • Page Fault: Page NOT available in main memory โ†’ fetched from disk
  • Thrashing: Excessive paging activity โ†’ caused by too many page faults
  • TLB: Translation Lookaside Buffer โ€” organized as set-associative cache
  • Compaction: Shifting processes to make contiguous free memory
  • Swapping: Moving suspended process from memory to disk
  • UVEPROM: Used to minimize memory-processor speed mismatch
Q. What is a page in paging?
โœ… A fixed-size block of virtual memory
Q. What causes thrashing to occur?
โœ… Excessive paging activity
Q. Page fault occurs when?
โœ… The page is NOT available in main memory
Q. How is TLB typically organized?
โœ… As a set-associative cache
Q. Under virtual storage, only the ___ are stored in primary storage.
โœ… Active pages of a program
Q. ___ shifts processes so they are contiguous and all free memory is in one block.
โœ… Compaction
๐Ÿ”’ Deadlock

4 Necessary Conditions (ALL must hold)

  • Mutual Exclusion โ€” Resource held by one process at a time
  • Hold and Wait โ€” Process holds resource while waiting for more
  • No Preemption โ€” Resources cannot be forcibly taken
  • Circular Wait โ€” Circular chain of waiting processes

Prevention (Break one condition)

  • Request all resources initially (breaks Hold & Wait)
  • Order resources numerically (breaks Circular Wait)
  • Preempt resources from low-priority processes
Q. Hold and Wait condition โ€” which approach prevents deadlock?
โœ… Request all resources initially
๐Ÿšฆ Process Synchronization

Key Concepts

  • Race Condition: Two+ processes access shared data concurrently and try to change it
  • Critical Section: Code section accessing shared resource
  • Semaphore: Used to solve race condition / process synchronization
  • Mutex: Binary semaphore (0 or 1)
  • Mutual exclusion problem occurs: among processes that share resources
Q. Semaphores are used to solve the problem of?
โœ… Race condition / Process synchronization
Q. When a computer is "swapping", it is?
โœ… Moving data from memory to the swap file on the hard drive
๐Ÿ“ File Systems & OS Misc

File Systems

  • NTFS โ€” Windows (New Technology File System)
  • FAT32 โ€” Older Windows
  • HFS+ โ€” Apple Mac
  • Common operations: Create, Delete, Rename

Memory Access Speed

  • Fastest: Registers
  • 2nd: Cache memory
  • 3rd: RAM (main memory)
  • Slowest: Magnetic disk
  • Bootstrap loader stored in: ROM

Interrupt Types

  • Hardware interrupt = external interrupt
  • Software interrupt = trap
  • NOT a type: Memory interrupt โŒ
  • A hardware interrupt = also called external interrupt or I/O interrupt
Q. Which memory has lowest access time?
โœ… Cache memory (Registers are fastest, but Cache is the answer for "lowest access time" in most papers)
Q. Which is NOT a memory management technique?
(A) Paging (B) Segmentation (C) Fragmentation
โœ… C โ€” Fragmentation is a problem, not a technique
๐Ÿ“ MS Office (Word, Excel, PowerPoint) HIGH โ€” ~10 Questions in PYQ
PYQ 2022 had 10+ MS Office questions! This is easy marks for everyone. Learn all shortcut keys โ€” they are directly asked and repeated every year.
๐Ÿ“„ MS Word 5-6 questions
Essential Shortcut Keys
ShortcutAction
Ctrl+BBold
Ctrl+IItalic
Ctrl+UUnderline
Ctrl+ZUndo
Ctrl+YRedo
Ctrl+SSave
Ctrl+PPrint
Ctrl+CCopy
Ctrl+VPaste
Ctrl+XCut
Ctrl+ASelect All
Ctrl+FFind
Ctrl+HFind & Replace
Ctrl+EnterPage Break
F7Spelling & Grammar check
Ctrl+HomeGo to beginning of document
Ctrl+EndGo to end of document

MS Word Key Concepts

  • Bookmark โ€” assigns name to specific point in document ("Create ___ to assign a name to a specific point")
  • Hyperlink โ€” links to web page or another location
  • Cross-reference โ€” refers to another part of same document
  • WordArt โ€” decorative text in MS Word
  • SmartArt โ€” visual diagrams
  • Gutter โ€” related to Margins in page setup
  • Sans Serif fonts: Arial, Gothic (NOT Times New Roman)
  • Times New Roman = Serif font
Q. "Create ___ to assign a name to a specific point in document."
โœ… Bookmark
Q. Decorative text in MS-Word is called?
โœ… WordArt
Q. In MS Word, "Gutter" is related to?
โœ… Margins
Q. Which is a Sans Serif font?
(A) Arial (B) Times New Roman (C) Courier (D) Gothic
โœ… A and D โ€” Arial and Gothic are Sans Serif
๐Ÿ“Š MS Excel 4-5 questions

Excel Functions (Must Know)

  • =SUM(A1:A5) โ€” adds A1 to A5
  • =AVERAGE(A1:A5) โ€” average
  • =MAX(A1:A5) / =MIN(A1:A5)
  • =COUNT(A1:A5) โ€” count numbers
  • =LCM(5,7,35) = 35
  • =VLOOKUP() โ€” finds related records in table
  • Absolute reference: $A$1 (dollar sign locks row & column)
  • Odd Excel formula: =SUM(A1:A5)/(10-10) โ€” division by zero, Excel CANNOT calculate

Excel Key Shortcuts

  • Ctrl+; โ€” Insert current date
  • F2 โ€” Edit cell
  • Alt+Enter โ€” New line within same cell
  • Ctrl+Shift+; โ€” Insert current time
  • Ctrl+Home โ€” Go to cell A1
Q. =LCM(5, 7, 35) in MS Excel outputs?
โœ… 35
Q. What does VLOOKUP do?
โœ… Finds related records (looks up value in a table)
Q. Which is an absolute cell reference?
(A) !B!1 (B) $B$1 (C) #b#1 (D) B1
โœ… B โ€” $B$1 (dollar signs make it absolute)
Q. Which formula will Excel NOT be able to calculate?
โœ… =SUM(A1:A5)/(10-10) โ€” division by zero error
Q. In Excel 2016, to insert 3 columns between G and H, you would?
โœ… Select column H, right click and select insert for 3 times
Q. In MS Excel, "Odd one out" โ€” which is NOT a feature?
(A) Portrait (B) Scenario Manager (C) Goal seek (D) Data table
โœ… A โ€” Portrait is a print layout, not an Excel-specific feature
๐ŸŽฏ MS PowerPoint 3-4 questions
ShortcutAction
F5Start slideshow from beginning
Shift+F5Start slideshow from current slide
Ctrl+MNew slide
Ctrl+DDuplicate slide
EscEnd slideshow

PowerPoint Views

  • Normal view โ€” default editing view
  • Slide Sorter โ€” rearrange slides (most suitable for rearranging!)
  • Notes Page โ€” view with notes
  • Slide Show โ€” presentation mode
  • Reading View โ€” preview mode

Slide Masters (Very Tricky!)

  • Valid Masters: Slide Master, Handout Master, Notes Master
  • NOT valid: Outline Master โŒ (trick question โ€” appears in PYQ!)
Q. Which view is most suitable to rearrange slides in MS PowerPoint?
โœ… Slide Sorter
Q. We can run slideshow from beginning using ___ key and from current slide using ___ key.
โœ… F5 (beginning), Shift+F5 (current slide)
Q. Which is NOT a valid Master View option in PowerPoint 2016?
(A) Notes master (B) Outline master (C) Slide master (D) Handout master
โœ… B โ€” Outline Master is NOT valid!
Q. Decorative text in MS-Word Slide is called?
โœ… WordArt
๐Ÿ”ข Computer Organization & Number Systems MEDIUM โ€” ~8 Questions
Appears in 6 of 8 papers. Focus: Binary/Hex conversions, Logic gates (NAND/NOR = universal), De Morgan's theorem, Memory hierarchy, CPU components.
๐Ÿ”ข Number Systems Conversions asked frequently
SystemBaseDigitsExample
Binary20, 11011 = 11 (decimal)
Octal80โ€“7โ€”
Decimal100โ€“9โ€”
Hexadecimal160โ€“9, Aโ€“FA=10, B=11, F=15

Quick Conversions

  • Binary 1011.1101 โ†’ Decimal: 11.8125
  • Decimal 1234 โ†’ Binary: 10011010010, Hex: 4D2
  • Hex A9B = Binary: 101010011011
  • (356)โ‚ˆ = (x)โ‚โ‚† โ†’ Convert: 356 octal = 238 decimal = EE hex
  • 2's complement of (539)โ‚โ‚€ = DBC in hex
  • BCD: only uses 0000โ€“1001 (0โ€“9). 1010โ€“1111 are invalid BCD
  • BCD max digit = 9 (4 bits)

Binary Arithmetic

  • 1101 + 1000 = 10101 (binary addition)
  • 1010 AND 1100 = 1000
  • 1010 OR 1100 = 1110
  • 2's complement = 1's complement + 1
  • Gray code: minimum error code
Q. Convert binary 1011.1101 to decimal.
โœ… 11.8125
Q. Find x if (356)โ‚ˆ = (x)โ‚โ‚†
โœ… EE (356 octal โ†’ 238 decimal โ†’ EE hex)
Q. Which are invalid in BCD code?
(A) 0010 (B) 0101 (C) 110 (D) 1100
โœ… C and D โ€” BCD only valid for 0000 to 1001
Q. Which is the minimum error code?
โœ… Gray code
Q. The 2's complement of (539)โ‚โ‚€ in hexadecimal?
โœ… DBC
โšก Logic Gates Gate properties asked
GateSymbolOutputKey Fact
ANDAยทB1 only if ALL inputs = 1โ€”
ORA+B1 if ANY input = 1โ€”
NOTA'Inverts inputโ€”
NAND(AยทB)'NOT ANDUniversal gate โ€” can make any other gate
NOR(A+B)'NOT ORUniversal gate โ€” can make any other gate
XORAโŠ•B1 if inputs differUsed in Half-adder (Sum output)
XNOR(AโŠ•B)'1 if inputs sameโ€”
Universal Gates = NAND and NOR. They can implement ANY Boolean function alone. Digital circuits can be built using repeated NAND or NOR gates only.

Boolean Algebra

  • De Morgan's: NOT(AยทB) = NOT A + NOT B
  • De Morgan's: NOT(A+B) = NOT A ยท NOT B
  • A positive AND gate = negative NAND gate (De Morgan)
  • SOP = Sum of Products (OR of ANDs)
  • POS = Product of Sums (AND of ORs)
  • K-map: used to minimize Boolean expressions (gates & fan-in)
Q. Digital circuit can be made by repeated use of?
โœ… NAND gate (or NOR gate โ€” both are universal)
Q. A positive AND gate is also a negative?
โœ… NAND gate (De Morgan's theorem)
Q. Half-adder outputs are?
โœ… Sum (XOR) and Carry (AND)
Q. OR gate has 4 inputs. Words in truth table = ?
โœ… 16 (= 2โด)
๐Ÿ’พ Memory Types
TypeVolatile?Key Fact
RAMYes (volatile)Main working memory. Lost on power off.
ROMNo (non-volatile)Read-only. Stores bootstrap loader / BIOS.
PROMNoProgrammable ROM โ€” written once
EPROMNoErasable with UV light
EEPROMNoElectrically erasable
CacheYesFastest memory after registers. Enhances effective memory access time.
FlashNoUsed in USB drives, SD cards
Q. Bootstrap loader (tiny program) is situated in?
โœ… ROM (BIOS)
Q. Which ROM type is visible under UV light?
โœ… EPROM
๐Ÿ–ฅ๏ธ CPU Components

CPU = ALU + CU + Registers

  • ALU (Arithmetic Logic Unit) โ€” performs binary addition and shift operations
  • Control Unit โ€” generates control/timing signals
  • Registers โ€” fastest storage, inside CPU
  • Pipelining: improves CPU performance by introduction of parallelism
  • 32-bit address bus: accesses 4 GB memory
  • CISC: Complex Instruction Set Computer
  • RISC: Reduced Instruction Set Computer
Q. Which part of CPU performs arithmetic addition and shift operations?
โœ… ALU (Arithmetic Logic Unit)
Q. Pipelining improves CPU performance due to?
โœ… Introduction of parallelism
Q. A 32-bit address bus allows access to memory of capacity?
โœ… 4 GB
โ˜• Java & Python MEDIUM โ€” ~7 Questions
Java: OOP keywords (extends, implements, final), Exception handling. Python: List methods (append!), String functions (strip, ord), Output tracing. Both appear in 4+ papers.
โ˜• Java 4-5 questions
KeywordPurpose
extendsInheritance โ€” class inherits from another class
implementsImplement an interface
abstractAbstract class/method declaration
finalCannot be overridden/inherited/modified
staticConstants that cannot be changed (also for class-level)
superRefers to parent class
thisRefers to current object
interfaceAbstract type with only abstract methods

Java Exception Handling

  • Divide by zero โ†’ ArithmeticException
  • Array out of bounds โ†’ ArrayIndexOutOfBoundsException
  • Null pointer โ†’ NullPointerException
  • try โ†’ throw โ†’ catch โ†’ finally
  • Multiple catch blocks allowed per try
  • finally block ALWAYS executes

Key Java Facts

  • Constants that can't be changed: declared using static keyword
  • A class can inherit ONLY one class (Java = single inheritance)
  • A class can implement MULTIPLE interfaces
  • Access specifier for same package only: package-private (default)
  • Java keyword for inheritance: extends
Q. Which keyword is used in Java to implement inheritance?
โœ… extends
Q. In Java, which exception is thrown when divide by zero executes?
โœ… ArithmeticException
Q. Which statement about Java is TRUE?
A. Constants using 'static'. B. A class can inherit only one that implements multiple interfaces.
โœ… Both A and B are true
Q. If a class is declared final, it cannot be?
โœ… Inherited (extended)
Q. Which access specifier makes members accessible only within same package?
โœ… package-private (default access โ€” no keyword)
Q. In AI, which agent deals with happy and unhappy state?
โœ… Utility based agent
๐Ÿ Python 3-4 questions
MethodPurpose
list.append(x)Add element x to END of list
list.pop()Remove and return last element
list.insert(i, x)Insert x at position i
list.sort()Sort list in-place
list.index(x)Returns index of x
str.strip()Remove leading/trailing whitespace
str.upper()Convert to uppercase
str.split()Split string into list
max()Returns character with highest ASCII value
ord()Converts character to integer (ASCII value)
len()Returns length of string/list

Python Data Types

  • int, float, complex โ€” numbers
  • str โ€” string
  • list โ€” mutable, ordered, allows duplicates []
  • tuple โ€” immutable, ordered ()
  • dict โ€” key-value pairs {}
  • set โ€” unordered, no duplicates {}

Python Declarations (Correct Syntax)

  • x, y, z, p = 5000, 6000, 7000, 8000 โœ…
  • xyz = 5,000,000 โŒ โ€” this creates a tuple!
  • x_y_z_p = 5,000,000 โŒ
  • No semicolons required in Python
  • Indentation-based (no curly braces)
Q. Which method adds element to END of list in Python?
โœ… append()
Q. Which function returns character with highest ASCII value?
โœ… max()
Q. Which type conversion converts char to integer in Python?
โœ… ord()
Q. Python output: a=20, b=35, if a>=b: print("yes") else: print("No")
โœ… No (since 20 is NOT >= 35)
๐Ÿ”’ Network Security MEDIUM โ€” ~6 Questions
Appears in 5+ papers. Focus: Malware types (Rootkit vs Trojan vs Virus), Hacking techniques (Phishing/Cracking), Firewall types, Virus life cycle.
๐Ÿฆ  Malware Types Most Repeated
MalwareDefinitionKey Characteristic
VirusSelf-replicating malicious programAttaches to other files to spread
Trojan HorseDisguised as legitimate softwareAppears useful but is malicious
RootkitAlters regular OS functionality; takes full control as system adminActs as system administrator on victim's machine (asked in PYQ!)
SpywareMonitors user activity secretlyCollects data without user knowledge
WormSelf-replicating, spreads through networkDoes NOT need host file (unlike virus)
RansomwareEncrypts files, demands ransomWannaCry is famous example
AdwareDisplays unwanted adsOften comes with free software
Q. ___ is malicious software that alters regular OS functionality, takes full control and acts as system administrator on victim's system.
โœ… Rootkit
Q. Which malware disguises itself as legitimate software?
โœ… Trojan Horse
Q. Which software monitors user activity secretly?
โœ… Spyware
Q. In cyber security, what remedy does the law provide?
โœ… Imprisonment
๐ŸŽฃ Hacking Techniques
TechniqueDescription
PhishingFake websites/emails to steal credentials
CrackingBreaking passwords/encryption
SpammingSending unsolicited bulk emails
SniffingIntercepting network traffic
HacktivismHacking for political/social reasons (NOT: gaining access to fix weaknesses)
Ethical HackingAuthorized testing to find vulnerabilities
Q. Oldest phone hacking technique used by hackers to make free calls?
โœ… Phreaking
Q. Hacktivism is?
โœ… The act of hacking a computer system for politically or socially motivated purposes
๐Ÿ›ก๏ธ Firewall & Security

Firewall Types

  • Packet Filter โ€” works at Network layer (most common)
  • Application Layer Firewall โ€” inspects at application level
  • Network layer firewall = Packet filter

Password Cracking Techniques

  • AttackSyllable (dictionary attack)
  • AttackBrut forcing (brute force โ€” tries all combinations)
  • AttackHybrid (combines dictionary + brute force)
  • Best tool for WiFi hacking: Aircrack-ng or Wireshark

Virus Life Cycle Phases

  • Dormant โ†’ Triggering โ†’ Execution โ†’ No "Start" phase
  • Start is NOT a virus life cycle phase โŒ
Q. Network layer firewall works as?
โœ… Packet filter
Q. Which phase is NOT included in Virus Life Cycle?
(A) Dormant (B) Execution (C) Start (D) Triggering
โœ… C โ€” Start is NOT a virus life cycle phase
๐Ÿ” Encryption & Security Basics

Encryption Terms

  • Plain text โ€” original unencrypted data
  • Cipher text โ€” encrypted data
  • Encrypted text โ€” data after encryption
  • Decrypted text โ€” data after decryption
  • Information that gets transformed in encryption = Plain text

WiFi Hacking Tools

  • Aircrack-ng โ€” WiFi password cracking
  • Wireshark โ€” network packet analyser
  • Norton โ€” antivirus (NOT hacking tool)
  • Usually used in WiFi hacking: Aircrack-ng

Unicode & Character Standards

  • ASCII โ€” 7-bit, 128 characters (English only)
  • Unicode โ€” covers all world languages
  • EBCDIC โ€” IBM mainframe standard
  • In encoding: 24 bits โ†’ 4 ร— 6-bit chunks โ†’ 32 bits
Q. Which standard covers characters of all world languages?
โœ… Unicode
Q. Information that gets transformed in encryption is?
โœ… Plain text
โšก Exam Weight: ~5-8 questions. Focus on SDLC phases, DFD, UML diagrams, and Software Testing โ€” these repeat across papers.

SDLC โ€” Software Development Life Cycle

๐Ÿ“‹ SDLC Phases (In Order)
1. Planning โ€” Define scope, feasibility
2. Requirements Analysis โ€” Gather user needs, SRS document
3. System Design โ€” HLD (High Level) + LLD (Low Level)
4. Implementation (Coding) โ€” Actual programming
5. Testing โ€” Unit, Integration, System, UAT
6. Deployment โ€” Release to production
7. Maintenance โ€” Bug fixes, updates
๐Ÿ”‘ Feasibility Study Types
TypeQuestion Asked
TechnicalCan we build it with available tech?
EconomicIs it cost-effective? (Cost-Benefit Analysis)
OperationalWill users accept and use it?
ScheduleCan we deliver on time?
LegalAny legal/compliance issues?
๐Ÿ’ก Mnemonic: T-E-O-S-L = Technical, Economic, Operational, Schedule, Legal

Software Process Models

๐ŸŒŠ Waterfall Model
  • Sequential โ€” one phase at a time, no going back
  • Simple, well-documented
  • Disadvantage: No flexibility; requirements must be clear upfront
  • Good for: small projects with fixed requirements
๐Ÿ”„ Iterative Models
ModelKey Feature
AgileShort sprints (2-4 weeks), customer feedback each sprint
SpiralRisk-driven; combines Waterfall + Prototyping
RADRapid Application Development; very fast delivery
PrototypeBuild rough model first, then refine based on feedback
IncrementalDeliver in parts (modules) step-by-step

DFD โ€” Data Flow Diagram

๐Ÿ“Š DFD Symbols
SymbolMeaningShape
External EntitySource/Sink of data (outside system)Rectangle / Square
ProcessTransforms/processes dataCircle / Rounded Rectangle
Data StoreWhere data is stored (DB, files)Open Rectangle (two lines)
Data FlowMovement of data between entitiesArrow (โ†’)
โ„น๏ธ DFD Levels: Level 0 = Context Diagram (whole system as one circle). Level 1 = breaks into sub-processes. Level 2 = further detail.
๐Ÿ“ SRS Document

SRS = Software Requirements Specification

Written during Requirements Analysis phase.

  • Functional Requirements โ€” What the system must do
  • Non-Functional Requirements โ€” Performance, Security, Scalability
  • Constraints โ€” Tech/platform limitations
โš ๏ธ SRS is also called "Blueprint" of the system. The analyst writes it, NOT the programmer.

UML โ€” Unified Modeling Language

๐Ÿ“Š UML Diagram Types

Structural Diagrams (static view)

DiagramShows
Class DiagramClasses, attributes, relationships (most used)
Object DiagramInstances of classes at a point in time
Component DiagramSoftware components and dependencies
Deployment DiagramHardware and network topology

Behavioral Diagrams (dynamic view)

DiagramShows
Use Case DiagramUser-system interactions (actors + use cases)
Sequence DiagramTime-ordered messages between objects
Activity DiagramWorkflow / flowchart of operations
State DiagramStates and transitions of an object

Software Testing

๐Ÿ”ฌ Testing Types
TypeWhat it TestsWho Does It
Unit TestingIndividual functions/modulesDeveloper
Integration TestingCombined modules work togetherDeveloper/Tester
System TestingComplete system vs requirementsTester
UAT (Acceptance)System meets user needsClient/End User
Regression TestingOld features still work after changesTester
โฌ›โฌœ Black Box vs White Box
AspectBlack BoxWhite Box
Code KnowledgeNot neededRequired
TestsInputs/Outputs onlyInternal logic/paths
Done byTester (external)Developer
Also calledFunctional TestingStructural Testing
๐Ÿ’ก Grey Box Testing = partial knowledge of internal structure

Coupling & Cohesion

๐Ÿ”— Coupling (Module Independence)

LOW Coupling = GOOD (modules are independent)

HIGH Coupling = BAD (modules depend heavily on each other)

Types (worst โ†’ best): Content โ†’ Common โ†’ External โ†’ Control โ†’ Stamp โ†’ Data

๐ŸŽฏ Cohesion (Module Focus)

HIGH Cohesion = GOOD (module does one well-defined task)

LOW Cohesion = BAD (module does many unrelated things)

Types (best โ†’ worst): Functional โ†’ Sequential โ†’ Communicational โ†’ Procedural โ†’ Temporal โ†’ Logical โ†’ Coincidental

Key MCQs from Papers

Q. Which SDLC model is best for a project with unclear requirements?
โœ… Prototype / Agile model
Q. In a DFD, a rectangle represents?
โœ… External entity (person, org outside system)
Q. Which UML diagram shows actors and their interactions with a system?
โœ… Use Case Diagram
Q. Testing done by end user before system is accepted is called?
โœ… User Acceptance Testing (UAT)
Q. SRS stands for?
โœ… Software Requirements Specification
Q. Which process model adds risk analysis at each iteration?
โœ… Spiral Model
โšก Exam Weight: ~8-12 questions. HTML/Internet basics + AI/ML definitions + IoT concepts repeat frequently across all papers.

Artificial Intelligence & Machine Learning

๐Ÿค– AI Types
TypeDescriptionExample
Narrow AI (ANI)One specific taskSiri, Chess engine
General AI (AGI)Human-level thinkingHypothetical (not yet)
Super AI (ASI)Beyond human intelligenceScience fiction
๐Ÿ’ก Turing Test โ€” tests if a machine can exhibit intelligent behavior indistinguishable from a human
๐Ÿ“Š Machine Learning Types
TypeHow it learnsExample
SupervisedLabeled data (input+output)Spam detection, Image classification
UnsupervisedUnlabeled data (finds patterns)Clustering, Anomaly detection
ReinforcementRewards and penalties (trial & error)Game playing (AlphaGo), Robotics
Semi-SupervisedMix of labeled + unlabeledWeb content classification
๐Ÿง  Neural Network Terms
  • Neural Network โ€” Model inspired by human brain neurons
  • Deep Learning โ€” Neural network with many layers (Deep NN)
  • NLP โ€” Natural Language Processing (e.g., ChatGPT)
  • Computer Vision โ€” AI that "sees" and interprets images
  • Training Data โ€” Data used to teach the ML model
  • Overfitting โ€” Model learns training data too well, fails on new data
โ›“๏ธ Blockchain
  • Blockchain โ€” Distributed, decentralized ledger of records
  • Data stored in blocks linked together in a chain
  • Immutable โ€” Once recorded, data cannot be changed
  • Decentralized โ€” No single authority controls it
  • Consensus Mechanism โ€” PoW (Proof of Work), PoS (Proof of Stake)
  • Bitcoin, Ethereum are blockchain applications

IoT โ€” Internet of Things

๐ŸŒ IoT Key Concepts
  • IoT โ€” Physical devices connected to internet, sharing data
  • Components: Sensors โ†’ Connectivity โ†’ Data Processing โ†’ User Interface
  • Examples: Smart home, Smart meters, Wearables, Connected cars
  • Protocols used: MQTT, CoAP, HTTP, Zigbee, Bluetooth, Wi-Fi
  • Cloud + IoT = data processed in cloud
  • Security risk โ€” IoT devices are vulnerable to hacking
๐Ÿ“ฑ IoT Applications
DomainIoT Use
HealthcarePatient monitoring, smart pills
AgricultureSoil sensors, automated irrigation
Smart CitiesTraffic lights, waste management
IndustryPredictive maintenance (IIoT)
HomeSmart thermostat, Alexa, security cameras

HTML / Web Basics

๐Ÿท๏ธ Essential HTML Tags
TagPurpose
<html>Root element
<head>Metadata (title, links)
<body>Visible page content
<h1>โ€“<h6>Headings (h1 = largest)
<p>Paragraph
<a href="">Hyperlink
<img src="">Image (no closing tag)
<table>Table
<form>Input form
<br>Line break (empty/void tag)
๐Ÿ”ค HTML vs XML
FeatureHTMLXML
PurposeDisplay dataStore/transport data
TagsPredefinedUser-defined
CaseNot case-sensitiveCase-sensitive
Closing tagsOptional for someAlways required
๐Ÿ’ก XHTML = stricter version of HTML that follows XML rules

Internet & Web Concepts

๐ŸŒ Internet Key Terms
TermMeaning
WWWWorld Wide Web โ€” collection of web pages
URLUniform Resource Locator (web address)
ISPInternet Service Provider (BSNL, Jio, Airtel)
BrowserChrome, Firefox, Edge, Safari, Opera
Search EngineGoogle, Bing, Yahoo, DuckDuckGo
HTTPHyperText Transfer Protocol (web pages)
HTTPSHTTP + SSL (secure, encrypted)
IP AddressUnique numeric address of a device
Domain NameHuman-readable name (google.com)
DNSDomain Name System โ€” converts name to IP
๐Ÿ›’ E-Commerce Types
TypeMeaningExample
B2CBusiness to ConsumerAmazon, Flipkart
B2BBusiness to BusinessAlibaba, IndiaMART
C2CConsumer to ConsumerOLX, eBay
B2GBusiness to Governmente-Procurement
C2BConsumer to BusinessFreelancer, Upwork
โš ๏ธ Most Asked: B2C (Amazon), B2B (Alibaba), C2C (OLX) โ€” know which is which!

Key MCQs from Papers

Q. What type of ML uses labeled training data?
โœ… Supervised Learning
Q. Which algorithm is used in recommendation systems like Netflix?
โœ… Collaborative Filtering (Unsupervised/ML)
Q. HTML tag used to create a hyperlink?
โœ… <a href="">
Q. What does DNS stand for?
โœ… Domain Name System
Q. OLX is an example of which e-commerce model?
โœ… C2C (Consumer to Consumer)
Q. Which property makes blockchain data tamper-proof?
โœ… Immutability (cryptographic hash linking)
Q. What does IoT stand for?
โœ… Internet of Things
Q. Deep Learning is a subset of?
โœ… Machine Learning (which is a subset of AI)
โ„น๏ธ Exam Weight: Pedagogy ~5-8 questions + Mental Ability ~5-8 questions. Mental ability questions are analytical/numerical and cannot be "memorized" โ€” focus on Pedagogy theory instead.

Pedagogy โ€” Teaching Methodology

๐Ÿ“š Key Pedagogy Terms
TermMeaning
PedagogyArt and science of teaching (methods, strategies)
AndragogyTeaching adults (self-directed, experience-based)
HeutagogySelf-determined learning (learner fully autonomous)
CurriculumPlanned content, activities, and learning outcomes
SyllabusTopics to be covered in a specific course
Lesson PlanDetailed plan for a single class session
๐ŸŽฏ Teaching Methods
MethodDescription
Lecture MethodTeacher talks, students listen (traditional)
Discussion MethodTwo-way interaction between teacher and students
DemonstrationTeacher shows/performs to illustrate concepts
Project MethodStudents complete real-world projects
Inquiry-BasedStudents investigate questions/problems themselves
Flipped ClassroomStudents study at home, apply in class

Learning Theories

๐Ÿง  Major Learning Theories
TheoryTheoristKey Idea
BehaviorismPavlov, SkinnerLearning = response to stimuli (rewards/punishments)
CognitivismPiaget, BrunerLearning = mental processes (thinking, understanding)
ConstructivismVygotsky, DeweyLearning = building knowledge from experience
ConnectivismSiemensLearning through digital networks (modern theory)
๐Ÿ“Š Bloom's Taxonomy

Classifies educational learning objectives (lowest โ†’ highest):

1. Remember โ€” Recall facts
2. Understand โ€” Explain ideas
3. Apply โ€” Use information
4. Analyze โ€” Break down parts
5. Evaluate โ€” Justify decisions
6. Create โ€” Produce new work (highest)

ICT in Education

๐Ÿ’ป ICT Tools for Teaching
  • LMS โ€” Learning Management System (Moodle, Google Classroom)
  • E-Learning โ€” Learning via digital media/internet
  • Blended Learning โ€” Mix of online + traditional classroom
  • MOOCs โ€” Massive Open Online Courses (Coursera, NPTEL)
  • Smart Board โ€” Interactive whiteboard for teaching
  • Podcast โ€” Audio-based learning content
๐Ÿ“ Assessment Types
TypeWhenPurpose
FormativeDuring learningMonitor progress, give feedback
SummativeEnd of unit/courseEvaluate final achievement
DiagnosticBefore teachingIdentify prior knowledge/gaps
Peer AssessmentDuringStudents assess each other

Mental Ability โ€” Key Topics

๐Ÿงฎ Types of Mental Ability Questions
CategoryExample
Number Series2, 4, 8, 16, ? โ†’ 32
AnalogyBook : Library :: Painting : ?
Coding-DecodingIf CAT = 3120, then DOG = ?
Data InterpretationBar chart/pie chart questions
Logical ReasoningSyllogisms (All A are B, Some B are C...)
Clock & CalendarDay/angle calculations
โšก Mental Ability Tips

Strategy for MA questions:

  • Number series: check +, ร—, ยฒ, differences between terms
  • Coding: find pattern (position, shift, reverse)
  • Syllogism: draw Venn diagrams mentally
  • Data charts: read axis labels carefully before answering
  • Blood relations: write family tree
๐Ÿšซ With 1/3 negative marking โ€” skip any MA question you're not 70%+ sure about. These are high-risk.

Major IT Developments (Mental Ability Section)

๐Ÿš€ Important IT Milestones to Know
YearDevelopment
1946ENIAC โ€” first general-purpose computer
1971First microprocessor (Intel 4004)
1983Internet (TCP/IP) officially launched
1991World Wide Web invented (Tim Berners-Lee)
1995Windows 95, Java released
YearDevelopment
1998Google founded
2004Facebook launched
2007iPhone launched (smartphone era)
2008Bitcoin/Blockchain (Satoshi Nakamoto)
2022ChatGPT launched (Generative AI era)

Key MCQs from Papers

Q. Bloom's Taxonomy highest level of cognitive learning?
โœ… Create (Synthesis/Creation)
Q. Assessment done during the learning process is?
โœ… Formative Assessment
Q. Who invented the World Wide Web?
โœ… Tim Berners-Lee (1991)
Q. Learning theory based on stimulus-response?
โœ… Behaviorism (Pavlov, Skinner)
Q. ICT-based teaching using both classroom + online is called?
โœ… Blended Learning
Q. Which theory emphasizes ZPD (Zone of Proximal Development)?
โœ… Vygotsky's Constructivism
โšก Protocol/port number questions appear in every paper. Memorize all rows in the tables below โ€” easy 3-5 marks.

Complete Protocol Port Reference

๐Ÿ”Œ Application Layer Protocols & Ports
ProtocolFull NamePortPurposeNote
HTTPHyperText Transfer Protocol80Web browsingUnencrypted
HTTPSHTTP Secure443Secure web browsingSSL/TLS encrypted
FTPFile Transfer Protocol21 (ctrl) / 20 (data)File transferTwo ports!
SFTPSSH File Transfer Protocol22Secure file transferUses SSH
SSHSecure Shell22Secure remote loginReplaces Telnet
Telnetโ€”23Remote loginUnencrypted (insecure)
SMTPSimple Mail Transfer Protocol25Sending emailsOutgoing only
POP3Post Office Protocol v3110Receiving emailsDownloads & deletes from server
IMAPInternet Message Access Protocol143Receiving emailsKeeps mail on server
DNSDomain Name System53Domain โ†’ IP resolutionUses UDP
DHCPDynamic Host Configuration Protocol67/68Auto IP assignmentServer=67, Client=68
Telnetโ€”23Remote terminalNo encryption
SNMPSimple Network Management Protocol161Network monitoringManages network devices
LDAPLightweight Directory Access Protocol389Directory servicesActive Directory
RDPRemote Desktop Protocol3389Remote desktop (Windows)Microsoft
SMTPSSMTP Secure465Encrypted email sendingSSL version of SMTP

Network Layer Protocols

๐ŸŒ IP & Routing Protocols
ProtocolFull NamePurpose
IPInternet ProtocolLogical addressing & routing
ICMPInternet Control Message ProtocolError reporting (used by ping)
ARPAddress Resolution ProtocolIP โ†’ MAC address mapping
RARPReverse ARPMAC โ†’ IP address mapping
RIPRouting Information ProtocolDistance vector routing
OSPFOpen Shortest Path FirstLink-state routing (fast)
BGPBorder Gateway ProtocolInternet backbone routing
๐Ÿš› Transport Layer: TCP vs UDP
FeatureTCPUDP
ConnectionConnection-orientedConnectionless
ReliabilityReliableUnreliable
SpeedSlowerFaster
Error checkingYes (ACK)No guarantee
Use casesHTTP, SMTP, FTPDNS, Video streaming, Gaming
๐Ÿ’ก TCP uses 3-way handshake: SYN โ†’ SYN-ACK โ†’ ACK

OSI Model Quick Reference

๐Ÿ“Š All 7 OSI Layers
Layer #Layer NameFunctionProtocol/DeviceMnemonic
7ApplicationUser interface, app servicesHTTP, FTP, SMTP, DNSAll
6PresentationData format, encryption, compressionSSL/TLS, JPEG, MPEGPeople
5SessionSession setup/teardownNetBIOS, RPCSeem
4TransportEnd-to-end delivery, reliabilityTCP, UDPTo
3NetworkLogical addressing, routingIP, ICMP, RouterNeed
2Data LinkMAC addressing, framingEthernet, Switch, BridgeData
1PhysicalBits, cables, signalsHub, Repeater, CableProcessing

Wireless & Mobile Standards

๐Ÿ“ถ Wi-Fi Standards
StandardIEEEMax SpeedFrequency
Wi-Fi 4802.11n600 Mbps2.4/5 GHz
Wi-Fi 5802.11ac3.5 Gbps5 GHz
Wi-Fi 6802.11ax9.6 Gbps2.4/5 GHz
Bluetooth802.15~3 Mbps2.4 GHz (short range)
๐Ÿ“ฑ Mobile Networks
GenerationTechnologySpeed
1GAnalog~2.4 Kbps
2GGSM/CDMA~64 Kbps
3GWCDMA/HSPA~2 Mbps
4GLTE~100 Mbps
5GNR (New Radio)~20 Gbps

Most-Asked Protocol MCQs

Q. What is the port number of HTTP?
โœ… 80
Q. What is the port number of HTTPS?
โœ… 443
Q. FTP uses which two port numbers?
โœ… Port 21 (control) and Port 20 (data)
Q. Which protocol converts domain name to IP address?
โœ… DNS (port 53)
Q. Which protocol is used to send email?
โœ… SMTP (port 25)
Q. Which protocol automatically assigns IP to devices?
โœ… DHCP (ports 67/68)
Q. ping command uses which protocol?
โœ… ICMP
Q. ARP resolves IP address to?
โœ… MAC Address
๐Ÿ”ฅ These are ACTUAL exam questions from bci-paper-main (PYQ 2022) โ€” the most important section. Read all of these at least 3 times before the exam.

MS Office PYQs

Q1. Which of the following is NOT a valid view in MS PowerPoint?
(A) Normal (B) Slide Sorter (C) Outline Master (D) Notes Page
โœ… (C) Outline Master โ€” The valid views are Normal, Slide Sorter, Notes Page, Reading View. "Outline Master" does not exist.
Q2. In MS Excel, what does the formula =VLOOKUP(A2,B:D,3,0) return?
โœ… Returns value from 3rd column of range B:D where value in first column matches A2. Last arg 0 = exact match.
Q3. In MS Word, which feature is used to insert a reusable block of text?
โœ… AutoText / Building Blocks
Q4. In MS Excel, the symbol $ in =$A$1 is used for?
โœ… Absolute cell reference (row + column both fixed when copied)
Q5. Sans-serif font in MS Word means?
โœ… Font without decorative strokes/feet. Examples: Arial, Calibri, Helvetica
Q6. Shortcut to insert a new slide in PowerPoint?
โœ… Ctrl+M

C / C++ / Java PYQs

Q7. What will this C code output?
int i=5; printf("%d", i++);
โœ… 5 โ€” Post-increment: prints current value (5), then increments to 6.
Q8. Which OOP concept is implemented when a class cannot be instantiated directly?
โœ… Abstract class / Abstraction
Q9. In Java, which keyword is used to call parent class constructor?
โœ… super() โ€” used in child class constructor to call parent
Q10. In C++, what does the :: operator do?
โœ… Scope resolution operator โ€” accesses class member or global variable
Q11. Which C++ concept allows same function name with different parameters?
โœ… Function Overloading (compile-time polymorphism)
Q12. In Java, ArithmeticException is thrown when?
โœ… Division by zero: int x = 5/0;

Data Structures PYQs

Q13. Which data structure uses LIFO (Last In First Out) principle?
โœ… Stack
Q14. In a circular queue, front = 3, rear = 2, size = 5. How many elements?
โœ… (rear - front + size) % size = (2-3+5)%5 = 4 elements
Q15. Inorder traversal of BST gives which output?
โœ… Sorted (ascending) order โ€” Left โ†’ Root โ†’ Right
Q16. Time complexity of Binary Search?
โœ… O(log n) โ€” worst case
Q17. Which sorting algorithm has best worst-case time complexity?
โœ… Merge Sort โ€” O(n log n) always
Q18. Stack overflow occurs when?
โœ… PUSH operation on a full stack / infinite recursion

DBMS PYQs

Q19. In SQL, what is the difference between WHERE and HAVING?
โœ… WHERE filters rows BEFORE grouping. HAVING filters AFTER GROUP BY (on aggregates).
Q20. What does ACID stand for in database transactions?
โœ… Atomicity, Consistency, Isolation, Durability
Q21. A table with no partial dependencies (keyโ†’nonkey only) is in which Normal Form?
โœ… 2NF (Second Normal Form)
Q22. What SQL command removes all rows from a table but keeps structure?
โœ… TRUNCATE TABLE tablename;
Q23. Which key uniquely identifies each row and cannot be NULL?
โœ… Primary Key
Q24. Which SQL clause is used with aggregate functions?
โœ… HAVING (e.g., HAVING COUNT(*) > 5)

Networks & Security PYQs

Q25. Which OSI layer is responsible for routing packets between networks?
โœ… Layer 3 โ€” Network Layer (uses Router)
Q26. Which attack sends overwhelming traffic to make a service unavailable?
โœ… DoS / DDoS (Denial of Service)
Q27. A virus that replicates itself across networks without user action?
โœ… Worm (e.g., WannaCry)
Q28. Which network device connects computers within the same LAN?
โœ… Switch (uses MAC addresses)
Q29. Encryption key shared between sender and receiver is called?
โœ… Symmetric key (same key to encrypt and decrypt)
Q30. Which type of firewall inspects packet headers only?
โœ… Packet Filtering Firewall

OS & Computer Organization PYQs

Q31. CPU scheduling algorithm with highest average waiting time?
โœ… FCFS (First Come First Served) โ€” convoy effect
Q32. Deadlock requires all 4 conditions simultaneously. Which one can be broken by preemption?
โœ… No Preemption โ€” allowing preemption breaks deadlock possibility
Q33. 2's complement of binary 0101?
โœ… Step 1: 1's complement = 1010. Step 2: Add 1 = 1011
Q34. Which gate is called "Universal gate"?
โœ… NAND and NOR โ€” both are universal gates (can make any other gate)
Q35. What is virtual memory?
โœ… Using part of hard disk as if it were RAM; allows running larger programs than physical RAM
Q36. Hexadecimal (FF)โ‚โ‚† in decimal?
โœ… 15ร—16 + 15 = 255
๐Ÿ’ก Exam Strategy: If you know all 36 questions above correctly, that's potentially 36 marks secured. With โˆ’1/3 penalty: getting 36 right and 0 wrong = 36 marks (pass easily). Be sure before answering!
โšก Shortcut questions = guaranteed 5-8 marks. These repeat across ALL papers. Learn all shortcuts below.

MS Word Shortcuts

๐Ÿ“ Formatting & Editing
ShortcutAction
Ctrl+BBold
Ctrl+IItalic
Ctrl+UUnderline
Ctrl+ECenter align
Ctrl+LLeft align
Ctrl+RRight align
Ctrl+JJustify align
Ctrl+1Single line spacing
Ctrl+2Double line spacing
Ctrl+51.5 line spacing
Ctrl+DFont dialog box
๐Ÿ“‹ File & General Operations
ShortcutAction
Ctrl+NNew document
Ctrl+OOpen file
Ctrl+SSave
Ctrl+Shift+SSave As
Ctrl+PPrint
Ctrl+ZUndo
Ctrl+YRedo
Ctrl+ASelect All
Ctrl+CCopy
Ctrl+XCut
Ctrl+VPaste
Ctrl+FFind
Ctrl+HFind & Replace
Ctrl+GGo To (page/line)
Ctrl+KInsert Hyperlink
F7Spelling & Grammar check
F12Save As dialog

MS Excel Shortcuts

๐Ÿ“Š Navigation & Selection
ShortcutAction
Ctrl+HomeGo to cell A1
Ctrl+EndGo to last used cell
Ctrl+ArrowJump to edge of data
Ctrl+Shift+EndSelect to last used cell
F2Edit selected cell
F4Toggle absolute/relative reference ($)
Alt+EnterNew line within same cell
Ctrl+;Insert today's date
Ctrl+Shift+:Insert current time
๐Ÿ“Š Formulas & Functions
FunctionPurpose
=SUM(A1:A10)Add range
=AVERAGE(A1:A10)Mean of range
=COUNT(A1:A10)Count numeric cells
=COUNTA(A1:A10)Count non-empty cells
=MAX(A1:A10)Highest value
=MIN(A1:A10)Lowest value
=IF(A1>5,"Yes","No")Conditional value
=VLOOKUP(val,range,col,0)Vertical lookup
=HLOOKUP(val,range,row,0)Horizontal lookup
=LEN(A1)Character count
=LEFT(A1,3)First 3 chars
=RIGHT(A1,3)Last 3 chars
=CONCATENATE(A1,B1)Join text

MS PowerPoint Shortcuts

๐ŸŽจ Presentation Shortcuts
ShortcutAction
Ctrl+MNew slide
Ctrl+DDuplicate slide
F5Start slideshow from beginning
Shift+F5Start from current slide
EscEnd slideshow
BBlack screen during show
WWhite screen during show

PowerPoint Views:

  • Normal View โ€” Edit slides (default)
  • Slide Sorter View โ€” Rearrange slides thumbnail view
  • Notes Page View โ€” Add speaker notes
  • Reading View โ€” View without full screen
  • Presenter View โ€” Shows notes while presenting
๐Ÿšซ "Outline Master" is NOT a valid PowerPoint view! This is a trick question in the exam.

Windows & General Shortcuts

๐ŸชŸ Windows Shortcuts
ShortcutAction
Win+DShow/Hide Desktop
Win+EOpen File Explorer
Win+LLock computer
Win+RRun dialog box
Alt+F4Close application
Alt+TabSwitch between open windows
Ctrl+Alt+DelTask Manager / Security options
Print ScreenScreenshot (full screen)
Win+Shift+SScreenshot (select area)
๐ŸŒ Browser Shortcuts
ShortcutAction
Ctrl+TNew tab
Ctrl+WClose current tab
Ctrl+Shift+TReopen closed tab
Ctrl+TabNext tab
F5Refresh page
Ctrl+F5Hard refresh (clear cache)
Ctrl+DBookmark page
Ctrl++Zoom in
Ctrl+-Zoom out
Ctrl+0Reset zoom to 100%
โ„น๏ธ All resources below are free on YouTube. Prioritized by HIGH โ†’ MEDIUM โ†’ LOW. Watch HIGH priority first. Search terms are exact โ€” use them on YouTube.

๐Ÿ”ด HIGH Priority โ€” Watch First

๐Ÿ“Š Data Structures & Algorithms
ChannelSearch TermWhy Watch
Jenny's Lectures CS/IT"Data Structures Hindi playlist"Clear Hindi explanations, covers all DS topics
GeeksforGeeks"DSA full course Hindi"Covers sorting, trees, graphs with animations
CodeWithHarry"Data Structures C++ Hindi"Beginner-friendly, code examples
๐Ÿ’ก Focus topics: Stack, Queue, BST Traversals, Sorting complexity table
๐Ÿ—„๏ธ DBMS
ChannelSearch TermWhy Watch
Sanchit Jain"DBMS full course in Hindi"Complete DBMS with Normal Forms explained simply
Knowledge Gate"DBMS Complete Series Hindi"SQL commands + ACID + Keys with examples
Gate Smashers"SQL complete tutorial Hindi"HAVING vs WHERE, JOINs with practice MCQs
๐ŸŒ Computer Networks
ChannelSearch TermWhy Watch
Sanchit Jain"Computer Networks Hindi full course"OSI model with real-world analogies
Gate Smashers"OSI model Hindi"All 7 layers memorized in 20 minutes
Neso Academy"Computer Networks full course"TCP/IP, protocols, subnetting (English, but very clear)
๐Ÿ–ฅ๏ธ Operating Systems
ChannelSearch TermWhy Watch
Gate Smashers"OS complete course Hindi"Process scheduling + deadlock + paging
Jenny's Lectures"Operating System Hindi playlist"Memory management with diagrams
Knowledge Gate"CPU Scheduling Hindi"FCFS/SJF/RR with solved examples

๐ŸŸ  MEDIUM Priority

โš™๏ธ C & C++ Programming
ChannelSearch Term
CodeWithHarry"C++ complete course Hindi"
Apna College"C++ OOP Hindi playlist"
Jenny's Lectures"C++ programming Hindi"

Focus: OOP concepts (Inheritance, Polymorphism, Encapsulation, Abstraction), Virtual functions, Abstract classes

โ˜• Java & Python
ChannelSearch Term
CodeWithHarry"Java full course Hindi" / "Python for beginners Hindi"
Apna College"Java OOP Hindi" / "Python DSA Hindi"

Focus: Java keywords (extends/implements), Exception types, Python list/string methods

๐Ÿ”’ Network Security
ChannelSearch Term
Simply Learn"Cybersecurity full course Hindi"
Gate Smashers"Network Security Hindi"

Focus: Malware types (Virus/Worm/Trojan/Rootkit), Firewall types, Encryption basics

๐Ÿ’พ Computer Organization
ChannelSearch Term
Gate Smashers"Computer Organization Hindi"
Neso Academy"Digital Logic Gates"

Focus: Number systems (Binary/Hex/Octal conversions), Logic gates, Memory types

๐Ÿ“ MS Office
ChannelSearch Term
Gyaan Sahil"MS Word complete tutorial Hindi"
Gyaan Sahil"MS Excel complete course Hindi"
Technical Guruji"MS Office shortcuts Hindi"

Focus: All keyboard shortcuts, Excel functions (VLOOKUP, IF, SUM), PowerPoint views

๐Ÿ“ System Analysis & Design
ChannelSearch Term
Easy Engineering Classes"System Analysis and Design Hindi"
Gate Smashers"Software Engineering SDLC Hindi"

Focus: SDLC phases, DFD symbols, UML diagrams, Software testing types

๐ŸŸข LOW Priority / Quick Revision

๐Ÿค– AI / ML / IoT
ChannelSearch Term
CodeWithHarry"Machine Learning Hindi introduction"
Simply Learn"AI for beginners Hindi"
Simplilearn"IoT Internet of Things full course"
๐Ÿ“š Pedagogy
ChannelSearch Term
Let's LEARN"Pedagogy for competitive exams Hindi"
StudyIQ Education"Bloom's Taxonomy Hindi"

๐Ÿ“… 1-Month Study Schedule

๐Ÿ“… Recommended Weekly Plan
Week 1 FOUNDATION
Data Structures (Stack, Queue, Trees, Sorting) + DBMS (SQL, Normal Forms, Keys, ACID) + solve 30 MCQs daily from DS/DBMS
Week 2 NETWORKING
Networks (OSI layers, Protocols+Ports, TCP/IP) + OS (Scheduling, Deadlock, Memory) + Computer Organization (Number systems, Logic gates) + solve 30 MCQs daily
Week 3 PROGRAMMING
C/C++ OOP concepts + Java/Python basics + MS Office shortcuts (Word/Excel/PPT) + Network Security + solve 30 MCQs daily
Week 4 REVISION
SAD + AI/ML/IoT + Pedagogy (low priority, 1 day each) โ†’ Full mock tests (100 MCQs) Day 5-6 โ†’ All PYQ revision Day 7 โ†’ All shortcuts revision final day
๐ŸŽฏ Final Exam Tips: (1) Attempt only when 70%+ confident due to โˆ’1/3 marking. (2) Mark difficult questions and return. (3) Read all 4 options before answering. (4) Cross verify shortcut/port number questions โ€” these have exact right/wrong answers. (5) Trust first instinct on MCQs, don't second-guess. All the best! ๐Ÿš€