AIJobalert.comSarkari Naukri • Behtar Bhavishya

Get Free Job Alerts Request a Job Update

AIJobalert.comSarkari Naukri • Behtar Bhavishya

Computer Science Core Concepts & One-Liners for Competitive Exams Notes

Computer Science Core Concepts & One-Liners for Competitive Exams

A comprehensive lecture covering 500 essential one-liner concepts across computer science, tailored for Bihar STET, BPSC TRE, DSSSB, and SSC-JE. The topics span computer fundamentals, architecture, operating systems, DBMS, data structures, algorithms, networking, software engineering, and web technologies.

Teaching
Other State PSC
SSC
Computer
English · 11 topics
Checked against the video on 23 Oct 2026

Made by AI from the YouTube video 🔥 1 VIDEO = SELECTION PAKKA! 🎯 Top 500 Computer Science One-Liners|STET, BPSC TRE 4.0, DSSSB, SSC JE (opens YouTube in a new tab) by Easy Bankers, then checked against it. All credit for the teaching goes to the creator. Tap a topic’s time to confirm a fact in the video.

Computer Science Core Concepts & One-Liners for Competitive Exams

English11 topics · 5 MCQs · 15 flashcardsWatch the video (opens YouTube in a new tab)

Checked against the video

In short

A comprehensive lecture covering 500 essential one-liner concepts across computer science, tailored for Bihar STET, BPSC TRE, DSSSB, and SSC-JE. The topics span computer fundamentals, architecture, operating systems, DBMS, data structures, algorithms, networking, software engineering, and web technologies.

Computer Fundamentals & CPU Components

Charles Babbage is considered the Father of Computer who designed the Analytical Engine in 1837.
Alan Turing is recognized as the Father of Modern Computer Science, introducing the concepts of the Turing machine and algorithmic execution.
Must knowThe first electronic computer was ENIAC (Electronic Numerical Integrator and Computer), built by Eckert and Mauchly.
UNIVAC I was the first commercial computer designed for general business applications, and EDSAC was the first stored-program computer developed by Maurice Wilkes.
Must knowThe Central Processing Unit (CPU) is the brain of the computer, comprising the Arithmetic Logic Unit (ALU), Control Unit (CU), and internal registers.
The Program Counter (PC) is a special register holding the memory address of the next instruction to execute, while the Instruction Register (IR) temporarily holds the instruction currently being decoded or executed.

Memory Hierarchy & Computer Architecture

The Memory Address Register (MAR) holds the memory address being read or written, while the Memory Buffer Register (MBR) holds the actual data payload read or written.
The Accumulator (AC) acts as the primary temporary storage register for ALU intermediate calculations.
System buses consist of the Address Bus (unidirectional), Data Bus (bidirectional), and Control Bus (bidirectional).
RISC (Reduced Instruction Set Computer) utilizes simple instructions executed in a single clock cycle, whereas CISC (Complex Instruction Set Computer) handles multi-cycle complex instructions.
Must knowSRAM uses flip-flops, is faster, more expensive, and requires no periodic refresh, while DRAM uses capacitors and requires constant periodic refreshing.
Virtual memory allows larger programs to run by mapping secondary storage addresses to RAM as needed.

Data Representation & Number Systems

Standard ASCII is a 7-bit character encoding covering 128 characters, while Extended ASCII uses 8 bits for 256 characters.
EBCDIC (Extended Binary Coded Decimal Interchange Code) is an 8-bit character encoding primarily utilized in IBM mainframes.
One nibble is strictly equal to 4 bits, and one byte equals 8 bits.
Must know1 Terabyte (TB) equals 1024 Gigabytes (GB) or 2⁴⁰ bytes, and 1 Petabyte (PB) equals 1024 Terabytes (TB) or 2⁵⁰ bytes.
The base (radix) for Binary is 2 (digits 0–1), Octal is 8 (digits 0–7), and Hexadecimal is 16 (digits 0–9 and symbols A–F, where A=10 and F=15).
Must know2's Complement is computed by adding 1 to the 1's complement of a binary number and is used for signed integer arithmetic.

Operating System Principles & CPU Scheduling

Direct Memory Access (DMA) enables hardware subsystems to transfer data directly to RAM without continuous CPU intervention.
An Interrupt prompts the CPU to suspend its current execution state to run a dedicated Interrupt Service Routine (ISR).
Must knowThe Four Coffman conditions necessary for a deadlock to occur are Mutual Exclusion, Hold and Wait, No Preemption, and Circular Wait.
The Banker's Algorithm is a deadlock avoidance algorithm that dynamically tests for safety before resource allocation.
First-Come First-Served (FCFS) scheduling suffers from the convoy effect, where short processes queue behind long CPU-bound tasks.
Shortest Job First (SJF) yields the optimal minimum average waiting time but can cause starvation for longer jobs.

Storage Management, Paging & Replacement Algorithms

Disk Access Time is the sum of Seek Time, Rotational Latency, and Data Transfer Time.
RAID 0 performs disk striping with no fault tolerance, RAID 1 provides disk mirroring, and RAID 5 employs block-level striping with distributed parity.
Page Fault occurs via a hardware interrupt when an actively requested memory page is not present in physical RAM.
Must knowBelady's Anomaly is the counterintuitive phenomenon in FIFO page replacement where adding more physical page frames increases the total number of page faults.
Thrashing describes a critical performance degradation state where the operating system spends more time swapping pages than executing instructions.
Common disk scheduling algorithms include FCFS, SSTF (Shortest Seek Time First), SCAN (Elevator Algorithm), C-SCAN, LOOK, and C-LOOK.

Database Management Systems & Relational Algebra

Edgar F. Codd introduced the relational model and proposed the 12 Codd's Rules for relational database management.
The three data abstraction levels in DBMS are Physical (Internal), Logical (Conceptual), and View (External).
Entity Integrity enforces that primary key attributes cannot contain NULL values, whereas Referential Integrity ensures foreign keys match existing primary keys or remain null.
Relational algebra operations include Selection (σ) for horizontal row slicing and Projection (π) for vertical column extraction.
Normalization forms prevent anomalies: 1NF eliminates repeating groups, 2NF removes partial dependencies, and 3NF eliminates transitive dependencies.
Must knowACID properties form the foundation of transaction processing: Atomicity (all-or-nothing), Consistency (state validity), Isolation (concurrency independence), and Durability (persistence).

SQL Commands, Indexing & Views

SQL language categories: DDL (CREATE, ALTER, DROP, TRUNCATE), DML (SELECT, INSERT, UPDATE, DELETE), DCL (GRANT, REVOKE), and TCL (COMMIT, ROLLBACK, SAVEPOINT).
Must knowTRUNCATE is a DDL command that quickly deallocates an entire table without logging row deletions, whereas DELETE is a DML operation that removes rows individually.
A B-Tree maintains balanced sorted data with logarithmic operations, whereas a B+ Tree exclusively stores data pointers in its leaf nodes linked sequentially for fast range scans.
Clustered Index alters the physical storage order of rows on disk (only one permitted per table), whereas a Non-Clustered Index maintains a separate logical pointer structure.
SQL defaults to an INNER JOIN when the JOIN keyword is specified without qualification.

Computer Networks & Communication Protocols

The OSI model comprises 7 layers: Physical, Data Link, Network, Transport, Session, Presentation, and Application.
IPv4 addresses are 32-bit logical addresses written in 4 dotted-decimal octets, while IPv6 addresses are 128-bit written in hexadecimal colon notation.
Must knowWell-known network port assignments:
TCP is a connection-oriented, reliable stream protocol establishing sessions via a 3-Way Handshake (SYN, SYN-ACK, ACK), whereas UDP is connectionless and unreliable.
CSMA/CD (IEEE 802.3) handles collision detection in wired Ethernet, whereas CSMA/CA (IEEE 802.11) uses RTS/CTS frames for wireless collision avoidance.

Protocol	Port Number	Description
FTP Data / Control	20 / 21	File Transfer Protocol
SSH	22	Secure Shell
Telnet	23	Unencrypted Remote Terminal
SMTP	25	Simple Mail Transfer Protocol
DNS	53	Domain Name System
HTTP / HTTPS	80 / 443	Web Traffic (Clear / SSL Encrypted)
POP3 / IMAP	110 / 143	Email Retrieval Protocols

Data Structures & Sorting Algorithms

Stacks operate on Last-In First-Out (LIFO) using push, pop, and peek; attempting to pop from an empty stack triggers an Underflow, and pushing to a full stack causes Overflow.
Queues follow First-In First-Out (FIFO) using enqueue (at tail) and dequeue (at head).
Inorder traversal processes nodes as Left-Root-Right, Preorder as Root-Left-Right, and Postorder as Left-Right-Root.
An AVL Tree is a self-balancing binary search tree maintaining balance factors strictly within {-1, 0, +1}.
Must knowMerge Sort and Heap Sort guarantee an O(n log n) worst-case time complexity, whereas Quick Sort runs in O(n²) worst-case time despite an average of O(n log n).
Stable sorting algorithms (such as Merge Sort and Insertion Sort) preserve the relative original input order of duplicate keys.

Object-Oriented Programming (OOP) & Java/C++ Concepts

The 4 pillars of OOP are Encapsulation (data bundling/hiding), Abstraction (interface simplification), Inheritance (code reuse), and Polymorphism (multiple forms).
Method Overloading represents compile-time polymorphism, while Method Overriding implements dynamic runtime polymorphism.
In Java, String objects are strictly immutable and stored inside the Common String Pool.
In Java, StringBuilder is faster and unsynchronized, whereas StringBuffer is thread-safe and synchronized.
In C++, solving the Multiple Inheritance Diamond Problem is accomplished using virtual base classes.
A Dangling Pointer points to a deallocated or freed memory address, while a Memory Leak occurs when dynamically allocated heap memory loses references without being cleared.

Software Engineering, Compilers & Automata Theory

Classic SDLC models include Waterfall (linear sequential), Prototyping (requirement clarification), Spiral (risk-driven), and Agile/Scrum (iterative delivery).
Software quality aims for Low Coupling (low inter-dependency between modules) and High Cohesion (focused functional strength within a module).
Compiler phases: Lexical Analysis (Scanner producing tokens) -> Syntax Analysis (Parser creating parse trees) -> Semantic Analysis -> Intermediate Code Generation -> Optimization -> Code Generation.
Must knowThe Chomsky Hierarchy classifies formal languages:
Cyclomatic Complexity is calculated using the formula: V(G) = E - V + 2P, where E is edges, V is vertices, and P is connected components.

Type	Grammar / Language	Automaton
Type 0	Unrestricted	Turing Machine
Type 1	Context-Sensitive	Linear Bounded Automaton (LBA)
Type 2	Context-Free	Pushdown Automaton (PDA)
Type 3	Regular	Finite Automata (DFA/NFA)

Key terms

Virtual Memory: Technique that maps secondary storage to RAM to allow execution of larger programs
Semaphore: Synchronization integer tool accessed exclusively via atomic wait() and signal() operations
Paging: Non-contiguous memory allocation dividing logical space into pages and physical memory into frames
Belady's Anomaly: Occurrence in FIFO page replacement where increasing physical frames leads to more page faults
3-Way Handshake: TCP connection establishment procedure using SYN, SYN-ACK, and ACK flags
Deadlock: A condition where processes are blocked permanently waiting for resources held by each other
Cohesion: A metric measuring the internal functional strength and single responsibility of a module
Coupling: A metric measuring the degree of interdependence between separate software modules

Formulas

Disk Access Time = Seek Time + Rotational Latency + Data Transfer Time: Calculating the total time taken to retrieve data from a disk
Mesh Network Links = n(n - 1) / 2: Calculating total physical links in a fully connected mesh network of n nodes
Propagation Delay = Distance / Speed: Computing transmission signal transit delay over a medium
Transmission Delay = Packet Length / Bandwidth: Calculating time required to push data packets onto a transmission link
Cyclomatic Complexity V(G) = E - V + 2P: Determining independent execution paths in software control graphs

Exam tips and traps

Remember that TRUNCATE is DDL (cannot be rolled back easily, resets identity) whereas DELETE is DML (row-by-row, logged, supports WHERE).
In the Chomsky Hierarchy, smaller numbers represent broader, more powerful grammars (Type 0 is unrestricted; Type 3 is regular).

Quick revision

Read these the night before the exam.

Charles Babbage designed the Analytical Engine in 1837; Alan Turing pioneered algorithmic modern computing.
1 Nibble equals 4 bits, and 1 Byte equals 8 bits.
The four Coffman conditions for deadlock are Mutual Exclusion, Hold and Wait, No Preemption, and Circular Wait.
Belady's Anomaly exclusively occurs in FIFO page replacement algorithms.
In relational algebra, Selection (σ) performs horizontal slicing, and Projection (π) performs vertical slicing.
TCP uses a 3-way handshake (SYN -> SYN-ACK -> ACK) and is connection-oriented, whereas UDP is connectionless.
Port 21 is FTP control, Port 22 is SSH, Port 25 is SMTP, Port 53 is DNS, and Port 80 is HTTP.
Method overloading is resolved at compile time, whereas method overriding is dynamic at runtime.
Type 2 languages in the Chomsky Hierarchy are Context-Free and recognized by Pushdown Automata.
Merge Sort requires O(n) auxiliary memory and guarantees O(n log n) worst-case time complexity.

These notes are made by AI from the video. Use the timestamps to check any important fact against the video before you rely on it.