TLDR;
Alright, folks, buckle up for a marathon session covering Paper 1 and Computer Science (Paper 2)! The aim is to prep you for tackling both papers together, just like in the exam hall. Remember, every question carries equal weightage, so no slacking on either paper.
- Questions can be multiple-choice, match the following, or even calculation-based.
- Key is to recall concepts quickly and use elimination strategies.
- Don't take any topic lightly, every mark counts.
Research Aptitude Questions [2:50]
First up, Interpretivism contrasts with positivism, focusing on qualitative research. Internal validity threats include maturation, instrumentation, and historical events. When it comes to sampling, empirical-inductive research leans towards non-probability sampling methods. For studying hidden populations, snowball sampling and using key informants are your best bet.
Sampling Techniques [9:10]
In sampling, simple random sampling means each unit has an equal shot at being selected. Systematic sampling involves picking every 'kth' item. Snowball sampling relies on referrals.
Logical Reasoning: Square of Opposition [13:50]
Moving on to logical reasoning, remember the square of opposition and logical equivalences. For example, the logically equivalent statement of "No fishes are mammals" is "No mammals are fishes". To solve these questions, remember the code for A, E, I, O type statements and their equivalences like converse, contrapositive, and obverse.
More Logical Reasoning [18:31]
In logical reasoning, contrary statements can't both be true but can be false. Universal affirmative statements (A type) are contrasted with universal negative statements (E type).
Syllogism: Mood and Figure [24:49]
To identify mood and figure, remember the three-letter combination and middle term placement.
Informal Fallacies [28:14]
Ad hominem is attacking the person instead of the issue. Strawman fallacy is distorting the argument. False cause is mistaking the relation, and red herring is distraction.
Number Systems and Base Conversion [32:04]
Switching gears to ICT, when converting hexadecimal to binary, remember to use 4 bits. For octal, use 3 bits. When dealing with bases, the range is always 0 to base - 1.
Signed Numbers and Gray Code [37:00]
For signed numbers, remember one bit is reserved for the sign. To convert decimal to Gray code, convert decimal to binary first, then perform XOR operations.
Logic Gates and Memory Hierarchy [41:03]
Basic logic gates are NAND and NOR. Remember, in the memory hierarchy, as speed increases, size decreases, and cost increases.
Memory Access Time and RAM Types
Speed is inversely proportional to access time. Static RAM (SRAM) is faster and used for cache, while Dynamic RAM (DRAM) is slower and used for main memory.
Key Registers and Instruction Execution
Key registers: Program Counter (PC) holds the address of the next instruction, Instruction Register (IR) holds the current instruction, Accumulator (ACC) performs operations, and Memory Buffer Register (MBR) stores data temporarily.
Instruction Set Architectures: RISC vs CISC
RISC (Reduced Instruction Set Computer) uses simpler instructions, while CISC (Complex Instruction Set Computer) uses complex instructions.
Error Detection and K-Maps
Two's complement is used for negative numbers. Parity bits are for error detection. Always practice K-maps for simplifying Boolean expressions.
Combinational vs Sequential Circuits and Memory Mapped I/O
Combinational circuits depend on current input, while sequential circuits depend on current and previous inputs. NAND and NOR are basic gates. In memory-mapped I/O, I/O devices and memory share the same address space.
DMA Transfer Modes and Interrupt Handling
DMA (Direct Memory Access) allows data transfer bypassing the CPU. Modes include burst mode, cycle stealing, and interleaving. Interrupt handling involves saving the current state, loading the interrupt routine, executing it, and then restoring the previous state.
Cache Coherence and Memory Policies
Cache coherence ensures data consistency across multiple processors. Write-through updates both cache and memory, while write-back updates only cache initially.
Interrupts and Polling
Interrupts are hardware signals, while polling is a software protocol where the CPU checks for requests.
Instruction Cycle and Addressing Modes
The instruction cycle involves fetching, decoding, calculating the effective address, fetching the operand, and executing the instruction. Addressing modes include immediate, direct, indirect, register direct, and register indirect.
8085 Instructions and Addressing Modes
Know your 8085 instructions and their corresponding addressing modes.
Communication Models: Aristotle, Lasswell, Shannon-Weaver
Aristotle's model focuses on the speaker, speech, audience, occasion, and effect, aiming to persuade. Lasswell's model focuses on "Who says what in which channel to whom with what effect," emphasizing media. Shannon-Weaver's model introduces noise in the communication channel.
Communication Models: Osgood-Schramm, Berlo's SMCR
Osgood-Schramm's model introduces the "field of experience" and feedback. Berlo's SMCR model emphasizes the skills of the communicator and listener.
Key Communication Concepts: Gatekeeping, Persuasion, Entropy
Gatekeeping is related to news, persuasion to advertising, and entropy to confusion in communication.
ICT: Firewalls, Cookies, and Spam
Firewalls isolate networks, cookies store browsing data, and spam is unsolicited advertising.
Perceptual Time and Semiotics
Perceptual time refers to how our brains process nonverbal cues. Semiotics is the study of signs and symbols in communication.
Aristotle's Rhetorical Strategies: Ethos, Pathos, Logos
To persuade, use ethos (ethics), pathos (emotion), and logos (logic).
Networking Devices: Routers, Gateways, Modems, Switches
Routers transfer data between networks, gateways connect networks with different protocols, modems convert signals, and switches operate within a local network.
Communication Types: Interpersonal vs Group
Interpersonal communication offers quicker, more reliable feedback than group communication.
ICT: Tethering, GPS, and Malware
Tethering shares a mobile data connection. GPS is for global positioning. Malware includes Trojans (appear legitimate), worms (self-replicating), ransomware (demands payment), and spyware (monitors activity).
Data Flow and Network Security
Data transmission can be simplex (one-way), half-duplex (both ways, not simultaneously), or full-duplex (both ways simultaneously).
Barriers to Communication
Barriers to communication can be psychological, semantic, organizational, or cultural.
ICT: Printers and Digital Initiatives
Laser printers are non-impact printers using toner. Digital initiatives include NDL (National Digital Library), and SWAYAM (for MOOCs).
Software Types: System, Application, Utility, Communication
System software manages hardware, application software performs specific tasks, utility software maintains the system, and communication software facilitates communication.
Operating Systems: Booting and Process Management
The booting process involves BIOS setup, power-on self-test (POST), loading the OS, system configuration, loading utilities, and user authentication. Processes ready for execution reside in the ready queue.
CPU Scheduling and Memory Management
In preemptive CPU scheduling, a running process can be moved to the ready state. Key memory areas: text (program code), data (global variables), heap (dynamic allocation), and stack (local variables).
Job Pools and Scheduling Algorithms
The job pool resides in primary memory. Scheduling algorithms include FCFS (First-Come, First-Served), SJF (Shortest Job First), and Round Robin.
Real-Time Systems and EDF Scheduling
EDF (Earliest Deadline First) is best for real-time systems.
Memory Management: Paging and Segmentation
Paging and segmentation are memory management techniques. Paging uses fixed-size pages, while segmentation uses variable-size segments.
Page Table Structures and Locality of Reference
Page table structures include clustered, hierarchical, and inverted page tables. Types of locality of reference: temporal (time-based) and spatial (space-based).
Process Synchronization and Mutual Exclusion
Mutual exclusion ensures only one process accesses a critical section at a time.
Spin Locks and Process States
Spin locks use busy-waiting.
Linux System Calls and Fork Programming
Common Linux system calls include fork (creates a new process), exit (terminates a process), and exec (executes a program).
Socket Programming and Kernel Functions
In socket programming, "listen" indicates the server will accept connections.
Distributed Operating Systems and Hypervisors
Distributed operating systems manage multiple computers as a single system. Type 1 hypervisors run directly on hardware, while Type 2 run on top of an OS.
Virtualization Techniques: Full, Para, Containerization
Full virtualization emulates hardware, paravirtualization modifies the guest OS, and containerization isolates multiple instances of an OS kernel.
Operating System Security Levels
Security levels range from Type A (highest) to Type D (lowest).
RAID Levels: 0, 1, 2, 3, 5, 6, 10
RAID (Redundant Array of Independent Disks) levels offer different balances of performance and redundancy. Know the characteristics of RAID 0 (striping), RAID 1 (mirroring), RAID 5 (striping with parity), RAID 6 (striping with dual parity), and RAID 10 (combination of mirroring and striping).
