📖 Detailed Notes

1.1 Concept of Test, Measurement, Assessment and Evaluation

Test: A systematic procedure for measuring a sample of behavior. It is a tool or instrument used to measure knowledge, skills, attitudes, or other characteristics.

Measurement: The process of assigning numbers or labels to objects, events, or characteristics according to specific rules. It quantifies the degree or amount of a trait.

Assessment: The systematic process of gathering, analyzing, and interpreting information about student learning. It is broader than testing and includes various methods.

Evaluation: The process of making judgments about the value or worth of something based on assessment data. It involves comparing results against standards or objectives.

1.2 Types of Evaluation

Type	Purpose	Tools	When Used
Diagnostic	Identify learning difficulties, strengths/weaknesses	Pre-tests, aptitude tests, observation	Before instruction
Placement	Determine appropriate level/section	Entrance tests, screening tests	Before instruction
Formative	Monitor learning progress, provide feedback	Quizzes, observations, homework	During instruction
Summative	Evaluate learning at end of instruction	Final exams, standardized tests	After instruction

📖 Detailed Notes

2.1 Essential Qualities of a Good Test

1. Validity: The test measures what it claims to measure. Types include:

• Content Validity: Test covers all aspects of the content domain
• Criterion Validity: Test correlates with an external criterion
  • Concurrent: Correlates with current performance
  • Predictive: Predicts future performance
• Construct Validity: Test measures the theoretical construct it claims to measure

2. Reliability: Consistency of test results. A reliable test gives consistent scores when administered under similar conditions.

Methods of Estimating Reliability:

Method	Description	Formula
Test-Retest	Same test given twice to same group	Correlation between two sets of scores
Parallel Form	Two equivalent forms given to same group	Correlation between Form A and Form B
Split-Half	Test divided into two halves, scores correlated	Spearman-Brown formula: r = 2r₁/₂/(1+r₁/₂)
Kuder-Richardson (KR-20)	Internal consistency for dichotomous items	Based on item difficulty and variance

3. Objectivity: Test results should not be influenced by the scorer's personal judgment or bias.

4. Usability: Test should be practical to administer, score, and interpret within available resources.

📖 Detailed Notes

3.1 Concept of Teacher Made Test

A teacher-made test is an assessment instrument prepared by the classroom teacher to measure student achievement on specific instructional objectives. Unlike standardized tests, these are tailored to specific classroom content and needs.

3.2 Purposes of Testing

• Instructional: To guide teaching and learning
• Grading: To assign marks/grades
• Diagnostic: To identify learning difficulties
• Selection: To select students for programs
• Placement: To place students in appropriate groups
• Counseling: To guide students in career choices
• Curricular Decisions: To evaluate curriculum effectiveness
• Policy Making: To inform educational policies

3.3 Types of Test Items

A. Subjective Test Items:

• Essay Questions: Require extended written response
  • Extended Response: Long, comprehensive answers
  • Restricted Response: Short, focused answers
• Short Answer: Brief responses (1-2 sentences)

B. Objective Test Items:

• Multiple Choice: Stem + 4-5 options (one correct)
• True/False: Binary choice items
• Matching: Two columns to be paired
• Fill in the Blanks: Complete the statement

3.4 Bloom's Taxonomy (Cognitive Domain)

Level	Description	Action Verbs
1. Knowledge	Recall facts, terms, basic concepts	Define, list, name, identify
2. Comprehension	Understand meaning, interpret	Explain, describe, summarize
3. Application	Use knowledge in new situations	Apply, solve, demonstrate
4. Analysis	Break down into components	Analyze, compare, contrast
5. Synthesis	Combine elements to create new	Create, design, formulate
6. Evaluation	Make judgments based on criteria	Evaluate, justify, critique

3.5 Test Construction Process

Step 1: Planning the Test

• Write instructional objectives
• Prepare specification chart (blueprint)
• Decide number of items, marks distribution

Step 2: Preparing the Test

• Prepare test items following guidelines
• Prepare clear instructions
• Prepare scoring key and marking scheme

📖 Detailed Notes

4.1 Test Administration

Proper test administration ensures valid and reliable results:

• Prepare testing environment (quiet, well-lit)
• Provide clear instructions
• Manage time effectively
• Ensure uniform conditions for all test-takers
• Handle test materials securely

4.2 Scoring Methods

Objective Items:

• Right-wrong scoring (0 or full marks)
• No partial credit

Subjective Items:

• Analytic scoring: Break into components, score each
• Holistic scoring: Overall impression score
• Rubric-based scoring: Use predefined criteria

4.3 Statistical Analysis of Test Results

Measures of Central Tendency:

• Mean: Average score. Formula: ΣX/N
• Median: Middle score when arranged in order
• Mode: Most frequently occurring score

Measures of Variability:

• Range: Highest - Lowest score
• Standard Deviation: Average deviation from mean. Formula: σ = √(Σ(X-M)²/N)
• Variance: Square of standard deviation

4.4 Item Analysis

Difficulty Index (P): Proportion of students who answered correctly

Formula: P = R/N (where R = number correct, N = total students)

• P = 0.20-0.80: Moderate difficulty (ideal)
• P < 0.20: Too difficult
• P > 0.80: Too easy

Discrimination Index (D): How well item differentiates between high and low performers

Formula: D = (Rᵤ - Rₗ)/N/₂ (upper group correct - lower group correct)

• D ≥ 0.40: Excellent
• D = 0.30-0.39: Good
• D = 0.20-0.29: Fair
• D < 0.20: Poor (should be revised)

📖 Detailed Notes

5.1 National Examination System

SEE (Secondary Education Examination):

• Conducted at the end of Grade 10
• Replaced SLC (School Leaving Certificate) in 2073 BS
• Grade point system (GPA 0-4)

NEB (National Examinations Board):

• Conducts Grade 11 and 12 examinations
• Replaced HSEB (Higher Secondary Education Board)

5.2 Internal Assessment System

As per NEB guidelines, internal assessment contributes 25% to final grades:

• Attendance: 5 marks
• Class participation/activities: 5 marks
• Project work/Assignment: 10 marks
• Internal examination: 5 marks

5.3 Continuous Assessment System (CAS)

CAS involves regular assessment throughout the academic session rather than single final exams:

• Regular quizzes and tests
• Project works
• Practical assessments
• Portfolio assessment

5.4 Grading System

Grade	GPA	Percentage	Description
A+	4.0	90-100	Outstanding
A	3.6	80-89	Excellent
B+	3.2	70-79	Very Good
B	2.8	60-69	Good
C+	2.4	50-59	Satisfactory
C	2.0	40-49	Acceptable
D+	1.6	30-39	Partially Acceptable
D	1.2	20-29	Insufficient
E	0.8	Below 20	Very Insufficient

📖 Detailed Notes

1.1 Java as a Programming Platform

Java is a high-level, object-oriented programming language developed by Sun Microsystems (now Oracle) in 1995. It is designed to be:

• Platform Independent: "Write Once, Run Anywhere" (WORA) - Java code runs on any platform with JVM
• Object-Oriented: Everything is organized in classes and objects
• Secure: No direct memory access, bytecode verification
• Robust: Strong type checking, automatic memory management

1.2 The Java "White Paper" Buzzwords

Feature	Description
Simple	Easy to learn, similar to C++ but removes complex features
Object-Oriented	Everything is an object, supports encapsulation, inheritance, polymorphism
Distributed	Built-in networking capabilities, supports RMI, CORBA
Robust	Strong memory management, exception handling, type checking
Secure	Bytecode verification, no pointer arithmetic, sandbox security
Architecture Neutral	Bytecode runs on any architecture with JVM
Portable	Same code runs on Windows, Linux, Mac
Interpreted	Bytecode is interpreted by JVM (now JIT compiled)
High Performance	JIT compilation, garbage collection optimization
Multithreaded	Built-in support for concurrent programming
Dynamic	Runtime linking, dynamic class loading

1.3 JVM, JRE, and JDK

JVM (Java Virtual Machine):

• Abstract computing machine that executes Java bytecode
• Provides platform independence
• Components: Class Loader, Bytecode Verifier, Execution Engine

JRE (Java Runtime Environment):

• JVM + Java class libraries + supporting files
• Required to run Java programs

JDK (Java Development Kit):

• JRE + Development tools (javac, javadoc, debugger)
• Required to develop Java programs

📖 Detailed Notes

2.1 Basic Data Types in Java

Type	Size	Range	Default Value
byte	1 byte	-128 to 127	0
short	2 bytes	-32,768 to 32,767	0
int	4 bytes	-2³¹ to 2³¹-1	0
long	8 bytes	-2⁶³ to 2⁶³-1	0L
float	4 bytes	±3.4E-38 to ±3.4E+38	0.0f
double	8 bytes	±1.7E-308 to ±1.7E+308	0.0d
char	2 bytes	0 to 65,535 (Unicode)	'\u0000'
boolean	1 bit	true or false	false

2.2 Control Flow Statements

Conditional Statements:

// if-else
if (condition) {
    // code
} else if (anotherCondition) {
    // code
} else {
    // code
}

// switch-case
switch (variable) {
    case value1:
        // code
        break;
    case value2:
        // code
        break;
    default:
        // code
}

Loop Statements:

// for loop
for (int i = 0; i < 10; i++) {
    // code
}

// while loop
while (condition) {
    // code
}

// do-while loop
do {
    // code
} while (condition);

// enhanced for loop (for-each)
for (Type item : collection) {
    // code
}

Jump Statements:

• break: Exits the loop or switch
• continue: Skips current iteration
• return: Exits method and returns value

2.3 Arrays in Java

// Declaration and initialization
int[] numbers = new int[5];           // size 5 array
int[] nums = {1, 2, 3, 4, 5};         // initialized array
int[][] matrix = new int[3][3];       // 2D array

// Array methods
int length = numbers.length;          // get length
Arrays.sort(numbers);                 // sort array
Arrays.toString(numbers);             // convert to string

📖 Detailed Notes

3.1 Object-Oriented Programming Concepts

Class: A blueprint/template that defines properties (fields) and behaviors (methods) of objects.

Object: An instance of a class. It has state (data) and behavior (methods).

// Class definition
public class Student {
    // Fields (instance variables)
    private String name;
    private int age;
    private static int studentCount = 0;  // static variable
    
    // Constructor
    public Student(String name, int age) {
        this.name = name;
        this.age = age;
        studentCount++;
    }
    
    // Methods
    public void study() {
        System.out.println(name + " is studying");
    }
    
    // Getters and Setters
    public String getName() { return name; }
    public void setName(String name) { this.name = name; }
    
    // Static method
    public static int getStudentCount() { return studentCount; }
}

3.2 The Four Pillars of OOP

1. Encapsulation: Wrapping data and methods together, hiding internal details

• Uses private fields with public getters/setters
• Protects data from unauthorized access

2. Inheritance: Creating new classes from existing ones

• Uses 'extends' keyword
• Child class inherits parent's fields and methods
• Promotes code reusability

3. Polymorphism: Same interface, different implementations

• Compile-time: Method overloading
• Runtime: Method overriding

4. Abstraction: Hiding implementation details, showing only functionality

• Achieved through abstract classes and interfaces

3.3 Static vs Instance Members

Aspect	Static	Instance
Belongs to	Class	Object
Memory	Allocated once	Allocated per object
Access	ClassName.member	object.member
Keyword	static	No keyword

📖 Detailed Notes

4.1 Inheritance in Java

// Parent class
class Animal {
    protected String name;
    
    public void eat() {
        System.out.println("Animal is eating");
    }
}

// Child class
class Dog extends Animal {
    public void bark() {
        System.out.println("Dog is barking");
    }
    
    // Method overriding
    @Override
    public void eat() {
        System.out.println("Dog is eating");
    }
}

Types of Inheritance:

• Single: One child extends one parent
• Multilevel: A → B → C (chain)
• Hierarchical: One parent, multiple children
• Multiple: One child, multiple parents (NOT supported in Java with classes)

4.2 Polymorphism

Method Overloading (Compile-time Polymorphism):

class Calculator {
    // Same method name, different parameters
    int add(int a, int b) { return a + b; }
    double add(double a, double b) { return a + b; }
    int add(int a, int b, int c) { return a + b + c; }
}

Method Overriding (Runtime Polymorphism):

class Parent {
    void show() { System.out.println("Parent"); }
}

class Child extends Parent {
    @Override
    void show() { System.out.println("Child"); }
}

// Usage
Parent obj = new Child();  // Upcasting
obj.show();  // Outputs: Child (runtime binding)

4.3 Abstract Classes

abstract class Shape {
    abstract void draw();  // abstract method (no body)
    
    void display() {       // concrete method
        System.out.println("Displaying shape");
    }
}

class Circle extends Shape {
    @Override
    void draw() {
        System.out.println("Drawing circle");
    }
}

4.4 Interfaces

interface Drawable {
    void draw();           // implicitly public abstract
    default void print() { // default method (Java 8+)
        System.out.println("Printing...");
    }
    static void info() {   // static method (Java 8+)
        System.out.println("Drawable interface");
    }
}

class Rectangle implements Drawable {
    @Override
    public void draw() {
        System.out.println("Drawing rectangle");
    }
}

Aspect	Abstract Class	Interface
Methods	Can have abstract and concrete methods	Only abstract methods (before Java 8)
Variables	Can have any type	Only public static final (constants)
Constructor	Yes	No
Multiple inheritance	No (single class inheritance)	Yes (multiple interface implementation)
Keyword	extends	implements

📖 Detailed Notes

5.1 Exception Hierarchy

Throwable
├── Error (Unchecked - cannot handle)
│   ├── OutOfMemoryError
│   └── StackOverflowError
└── Exception
    ├── RuntimeException (Unchecked)
    │   ├── NullPointerException
    │   ├── ArrayIndexOutOfBoundsException
    │   └── ArithmeticException
    └── Other Exceptions (Checked)
        ├── IOException
        ├── SQLException
        └── FileNotFoundException

5.2 Exception Handling Keywords

// try-catch-finally
try {
    // Code that may throw exception
    int result = 10 / 0;
} catch (ArithmeticException e) {
    // Handle specific exception
    System.out.println("Cannot divide by zero");
} catch (Exception e) {
    // Handle any other exception
    System.out.println("Error: " + e.getMessage());
} finally {
    // Always executes
    System.out.println("Cleanup code");
}

// throw - explicitly throw exception
if (age < 0) {
    throw new IllegalArgumentException("Age cannot be negative");
}

// throws - declare exceptions in method signature
public void readFile() throws IOException, FileNotFoundException {
    // Method code
}

Keyword	Use	Location
try	Enclose risky code	Block
catch	Handle exception	After try
finally	Cleanup code	After catch
throw	Explicitly throw exception	Inside method
throws	Declare possible exceptions	Method signature

5.3 Multithreading Basics

// Method 1: Extend Thread class
class MyThread extends Thread {
    @Override
    public void run() {
        // Thread code
        for (int i = 0; i < 5; i++) {
            System.out.println("Thread: " + i);
        }
    }
}

// Method 2: Implement Runnable interface
class MyRunnable implements Runnable {
    @Override
    public void run() {
        // Thread code
    }
}

// Usage
MyThread t1 = new MyThread();
t1.start();  // Starts new thread

Thread t2 = new Thread(new MyRunnable());
t2.start();

Thread States: New → Runnable → Running → Blocked/Waiting → Terminated

📖 Detailed Notes

6.1 I/O Streams

Byte Streams: Handle raw binary data (8-bit)

• InputStream, OutputStream (abstract base classes)
• FileInputStream, FileOutputStream
• BufferedInputStream, BufferedOutputStream

Character Streams: Handle Unicode characters (16-bit)

• Reader, Writer (abstract base classes)
• FileReader, FileWriter
• BufferedReader, BufferedWriter

6.2 File Operations

// Reading from file
BufferedReader reader = new BufferedReader(new FileReader("file.txt"));
String line;
while ((line = reader.readLine()) != null) {
    System.out.println(line);
}
reader.close();

// Writing to file
BufferedWriter writer = new BufferedWriter(new FileWriter("output.txt"));
writer.write("Hello World");
writer.newLine();
writer.close();

// Using try-with-resources (Java 7+)
try (BufferedReader br = new BufferedReader(new FileReader("file.txt"))) {
    String line;
    while ((line = br.readLine()) != null) {
        System.out.println(line);
    }
}  // Automatically closes

6.3 Scanner Class

import java.util.Scanner;

Scanner scanner = new Scanner(System.in);

System.out.print("Enter name: ");
String name = scanner.nextLine();

System.out.print("Enter age: ");
int age = scanner.nextInt();

System.out.print("Enter salary: ");
double salary = scanner.nextDouble();

scanner.close();

📖 Detailed Notes

7.1 Event Handling Model

Delegation Event Model:

• Event Source: Component that generates events (button, text field)
• Event Object: Contains information about the event
• Event Listener: Interface that receives and handles events

// Event handling using anonymous inner class
JButton button = new JButton("Click Me");
button.addActionListener(new ActionListener() {
    @Override
    public void actionPerformed(ActionEvent e) {
        System.out.println("Button clicked!");
    }
});

// Using Lambda expression (Java 8+)
button.addActionListener(e -> {
    System.out.println("Button clicked!");
});

7.2 Common Event Listeners

Listener	Methods	Used For
ActionListener	actionPerformed()	Buttons, menu items
MouseListener	mouseClicked(), mousePressed(), mouseReleased(), mouseEntered(), mouseExited()	Mouse events
KeyListener	keyPressed(), keyReleased(), keyTyped()	Keyboard events
WindowListener	windowOpened(), windowClosing(), windowClosed(), etc.	Window events

7.3 Basic Swing Components

import javax.swing.*;

public class SimpleGUI {
    public static void main(String[] args) {
        // Create frame
        JFrame frame = new JFrame("My Application");
        frame.setSize(400, 300);
        frame.setDefaultCloseOperation(JFrame.EXIT_ON_CLOSE);
        frame.setLayout(new FlowLayout());
        
        // Add components
        JLabel label = new JLabel("Enter name:");
        JTextField textField = new JTextField(20);
        JButton button = new JButton("Submit");
        
        // Add event listener
        button.addActionListener(e -> {
            String name = textField.getText();
            JOptionPane.showMessageDialog(frame, "Hello, " + name);
        });
        
        // Add to frame
        frame.add(label);
        frame.add(textField);
        frame.add(button);
        
        frame.setVisible(true);
    }
}

Common Layout Managers:

• FlowLayout: Components flow left to right
• BorderLayout: NORTH, SOUTH, EAST, WEST, CENTER
• GridLayout: Rows and columns

📖 Detailed Notes

8.1 JDBC Architecture

JDBC (Java Database Connectivity) is an API that allows Java programs to interact with databases.

• JDBC Driver: Interface between Java application and database
• Connection: Establishes connection to database
• Statement: Executes SQL queries
• ResultSet: Stores query results

8.2 JDBC Steps

import java.sql.*;

public class JDBCDemo {
    public static void main(String[] args) {
        try {
            // Step 1: Load driver (optional in newer Java versions)
            Class.forName("com.mysql.cj.jdbc.Driver");
            
            // Step 2: Create connection
            String url = "jdbc:mysql://localhost:3306/mydb";
            String user = "root";
            String password = "password";
            Connection conn = DriverManager.getConnection(url, user, password);
            
            // Step 3: Create statement
            Statement stmt = conn.createStatement();
            
            // Step 4: Execute query
            ResultSet rs = stmt.executeQuery("SELECT * FROM students");
            
            // Step 5: Process results
            while (rs.next()) {
                int id = rs.getInt("id");
                String name = rs.getString("name");
                System.out.println(id + ": " + name);
            }
            
            // Step 6: Close resources
            rs.close();
            stmt.close();
            conn.close();
            
        } catch (ClassNotFoundException | SQLException e) {
            e.printStackTrace();
        }
    }
}

8.3 Types of Statements

Statement Type	Use	Example
Statement	Simple queries without parameters	stmt.executeQuery("SELECT * FROM table")
PreparedStatement	Parameterized queries (prevents SQL injection)	PreparedStatement ps = conn.prepareStatement("INSERT INTO table VALUES (?, ?)")
CallableStatement	Execute stored procedures	CallableStatement cs = conn.prepareCall("{call procedureName()}")

📖 Detailed Notes

1.1 Components of Data Communication

Data Communication is the exchange of data between two devices via some transmission medium.

Five Components:

1. Message: The information/data to be communicated (text, audio, video)
2. Sender: Device that sends the message (computer, phone)
3. Receiver: Device that receives the message
4. Transmission Medium: Physical path (cable, air for wireless)
5. Protocol: Set of rules governing communication

1.2 Data Representation and Data Flow

Data Flow Directions:

Mode	Description	Example
Simplex	One-way communication only	Keyboard to computer, TV broadcast
Half-Duplex	Both ways, but not simultaneously	Walkie-talkie
Full-Duplex	Both ways simultaneously	Telephone, mobile communication

1.3 Network Criteria and Physical Structures

Network Criteria:

• Performance: Measured by throughput, delay, jitter
• Reliability: Frequency of failure, recovery time
• Security: Protection against unauthorized access

Network Topologies:

Topology	Description	Advantages	Disadvantages
Bus	Single backbone cable	Easy to install, less cable	Difficult to troubleshoot, single point of failure
Star	All devices connect to central hub	Easy to manage, fault isolation	Hub failure affects all, more cable
Ring	Each device connected to two others	Equal access, easy to install	One failure breaks ring
Mesh	Every device connected to every other	High redundancy, robust	Expensive, complex, lots of cable

📖 Detailed Notes

2.1 OSI Model (Open Systems Interconnection)

Developed by ISO in 1984. Seven layers that standardize network communication.

Layer	Name	Function	Protocols/Devices	Data Unit
7	Application	Network services to applications	HTTP, FTP, SMTP, DNS	Message
6	Presentation	Data translation, encryption, compression	SSL, JPEG, ASCII	Message
5	Session	Session management, dialog control	NetBIOS, RPC	Message
4	Transport	End-to-end delivery, flow control	TCP, UDP	Segment
3	Network	Logical addressing, routing	IP, ICMP, Router	Packet
2	Data Link	Physical addressing, framing, error detection	MAC, Ethernet, Switch	Frame
1	Physical	Bit transmission, physical connection	Cables, Hubs, Repeaters	Bit

2.2 TCP/IP Model

Developed by DARPA. Four layers that are the foundation of the Internet.

Layer	OSI Equivalent	Protocols
4. Application	Session + Presentation + Application	HTTP, FTP, SMTP, DNS, Telnet
3. Transport	Transport	TCP, UDP
2. Internet	Network	IP, ICMP, ARP
1. Network Access	Physical + Data Link	Ethernet, Wi-Fi, PPP

2.3 OSI vs TCP/IP Comparison

Aspect	OSI	TCP/IP
Layers	7 layers	4 layers
Developed by	ISO (theoretical)	DARPA (practical)
Approach	Vertical approach	Horizontal approach
Protocol dependency	Protocol independent	Protocol dependent
Usage	Reference model	Implementation model

📖 Detailed Notes

3.1 IP Address

An IP address is a unique 32-bit (IPv4) or 128-bit (IPv6) identifier assigned to each device on a network.

IPv4 Address Classes:

Class	First Bits	Range	Default Mask	Use
A	0	1.0.0.0 - 126.255.255.255	255.0.0.0 (/8)	Large networks
B	10	128.0.0.0 - 191.255.255.255	255.255.0.0 (/16)	Medium networks
C	110	192.0.0.0 - 223.255.255.255	255.255.255.0 (/24)	Small networks
D	1110	224.0.0.0 - 239.255.255.255	-	Multicast
E	1111	240.0.0.0 - 255.255.255.255	-	Reserved/Experimental

Private IP Ranges (RFC 1918):

• Class A: 10.0.0.0 - 10.255.255.255
• Class B: 172.16.0.0 - 172.31.255.255
• Class C: 192.168.0.0 - 192.168.255.255

3.2 Subnetting

Subnetting divides a network into smaller subnetworks to improve efficiency and security.

Key Formulas:

• Number of subnets: 2ⁿ (n = borrowed bits)
• Hosts per subnet: 2ʰ - 2 (h = host bits)
• Block size: 256 - subnet mask octet value

Example: Subnet 192.168.1.0/24 into 4 subnets

1. Need 4 subnets: 2ⁿ ≥ 4, so n = 2 bits borrowed
2. New subnet mask: /24 + 2 = /26 (255.255.255.192)
3. Block size: 256 - 192 = 64
4. Subnets: 0, 64, 128, 192

Subnet	Network Address	Usable Range	Broadcast
1	192.168.1.0/26	192.168.1.1 - 192.168.1.62	192.168.1.63
2	192.168.1.64/26	192.168.1.65 - 192.168.1.126	192.168.1.127
3	192.168.1.128/26	192.168.1.129 - 192.168.1.190	192.168.1.191
4	192.168.1.192/26	192.168.1.193 - 192.168.1.254	192.168.1.255

3.3 CIDR (Classless Inter-Domain Routing)

CIDR replaces classful addressing with flexible prefix notation (/n).

Benefits:

• More efficient IP address allocation
• Reduces routing table size
• Enables VLSM (Variable Length Subnet Masking)

📖 Detailed Notes

4.1 TCP (Transmission Control Protocol)

Connection-oriented, reliable transport protocol.

Key Features:

• Connection-oriented: Three-way handshake before data transfer
• Reliable: Acknowledgments, retransmissions, sequencing
• Flow Control: Sliding window protocol
• Error Control: Checksums, ACKs, retransmission
• Full-duplex: Both directions simultaneously

Three-Way Handshake:

1. SYN: Client sends SYN to server
2. SYN-ACK: Server responds with SYN-ACK
3. ACK: Client sends ACK, connection established

4.2 UDP (User Datagram Protocol)

Connectionless, unreliable transport protocol.

Key Features:

• Connectionless: No handshake, sends data immediately
• Unreliable: No acknowledgments or retransmissions
• Fast: Low overhead, minimal delay
• Small header: 8 bytes vs TCP's 20 bytes

4.3 TCP vs UDP Comparison

Feature	TCP	UDP
Connection	Connection-oriented	Connectionless
Reliability	Reliable (guaranteed delivery)	Unreliable
Ordering	In-order delivery	No ordering
Header Size	20-60 bytes	8 bytes
Speed	Slower	Faster
Use Cases	HTTP, FTP, Email	DNS, Streaming, Gaming

Common Port Numbers:

Port	Protocol	Service
20, 21	TCP	FTP
22	TCP	SSH
23	TCP	Telnet
25	TCP	SMTP
53	UDP/TCP	DNS
80	TCP	HTTP
110	TCP	POP3
143	TCP	IMAP
443	TCP	HTTPS

📖 Detailed Notes

5.1 Network Layer Functions

• Logical Addressing: IP addresses for host identification
• Routing: Determining best path for packets
• Packetizing: Encapsulating data into packets
• Fragmentation: Breaking large packets for different MTUs

5.2 Routing Algorithms

Distance Vector Routing (RIP):

• Each router shares its entire routing table with neighbors
• Uses Bellman-Ford algorithm
• Metric: Hop count (max 15)
• Slow convergence, count-to-infinity problem

Link State Routing (OSPF):

• Each router knows complete network topology
• Uses Dijkstra's shortest path algorithm
• Metric: Cost (bandwidth-based)
• Fast convergence, more complex

Aspect	Distance Vector (RIP)	Link State (OSPF)
Algorithm	Bellman-Ford	Dijkstra
Information	Routing table to neighbors	Topology to all routers
Convergence	Slow	Fast
Metric	Hop count	Cost/Bandwidth
Scalability	Small networks	Large networks

5.3 Network Address Translation (NAT)

NAT translates private IP addresses to public IP addresses.

Types:

• Static NAT: One-to-one mapping (private ↔ public)
• Dynamic NAT: Maps to pool of public IPs
• PAT/NAPT: Many-to-one using port numbers (most common)

Benefits: Conserves public IPs, hides internal network, adds security.

5.4 DNS (Domain Name System)

Translates domain names to IP addresses.

DNS Resolution Process:

1. Browser checks local cache
2. Queries Local DNS Server (ISP)
3. Local DNS queries Root DNS Server
4. Root refers to TLD Server (.com, .org)
5. TLD refers to Authoritative DNS Server
6. Authoritative Server returns IP address

DNS Record Types:

Record	Purpose
A	Maps domain to IPv4 address
AAAA	Maps domain to IPv6 address
CNAME	Canonical name (alias)
MX	Mail exchange server
NS	Name server for domain
TXT	Text information (SPF, DKIM)

📖 Detailed Notes

1.1 Software Engineering Definition

Definition (IEEE): Software Engineering is the application of a systematic, disciplined, quantifiable approach to the development, operation, and maintenance of software.

Key Aspects:

• Systematic: Follows defined processes and methodologies
• Disciplined: Adheres to standards and best practices
• Quantifiable: Measurable and trackable

1.2 Software Crisis

The software crisis (1960s) refers to problems in software development:

• Projects running over budget and time
• Software with poor quality and many bugs
• Software not meeting requirements
• Difficult to maintain and modify

Solution: Software Engineering principles and practices

1.3 Attributes of Good Software

Attribute	Description
Maintainability	Should be easy to modify and evolve to meet changing needs
Dependability	Should be reliable, secure, and safe
Efficiency	Should make efficient use of system resources
Usability	Should be easy to learn and use

1.4 Software Process Models

Model	Characteristics	Best For	Limitations
Waterfall	Sequential phases, no overlap	Clear, stable requirements	Inflexible, late feedback
Incremental	System built in increments	Early delivery needed	Requires good planning
Spiral	Risk-driven, iterative	Large, complex projects	Complex, expensive
Agile	Iterative, flexible, customer-focused	Changing requirements	Less documentation

📖 Detailed Notes

2.1 Agile Manifesto (2001)

Four core values:

1. Individuals and interactions over processes and tools
2. Working software over comprehensive documentation
3. Customer collaboration over contract negotiation
4. Responding to change over following a plan

12 Agile Principles:

1. Customer satisfaction through early delivery
2. Welcome changing requirements
3. Deliver working software frequently
4. Business people and developers work together
5. Build projects around motivated individuals
6. Face-to-face conversation is best
7. Working software is primary measure of progress
8. Sustainable development pace
9. Continuous attention to technical excellence
10. Simplicity - maximize work not done
11. Self-organizing teams
12. Regular reflection and adjustment

2.2 Scrum Framework

Roles:

• Product Owner: Defines product backlog, prioritizes features
• Scrum Master: Facilitates process, removes obstacles
• Development Team: Self-organizing team that builds product

Artifacts:

• Product Backlog: Prioritized list of all desired features
• Sprint Backlog: Items selected for current sprint
• Increment: Potentially shippable product at sprint end

Events:

• Sprint: Time-boxed iteration (1-4 weeks)
• Sprint Planning: Plan work for upcoming sprint
• Daily Scrum: 15-minute daily standup meeting
• Sprint Review: Demo completed work to stakeholders
• Sprint Retrospective: Team reflects on process

2.3 Verification vs Validation

Aspect	Verification	Validation
Question	Are we building the product RIGHT?	Are we building the RIGHT product?
Focus	Conformance to specifications	Meeting user needs
Activities	Reviews, inspections, walkthroughs	Testing with users
When	Throughout development	After development

📖 Detailed Notes

3.1 Types of Requirements

Functional Requirements: What the system should do

• User login functionality
• Generate reports
• Process payments

Non-Functional Requirements: How the system should perform

• Performance: Response time, throughput
• Security: Authentication, encryption
• Reliability: Availability, fault tolerance
• Usability: Ease of use, learnability
• Scalability: Handle growing users/data

3.2 SRS (Software Requirements Specification)

Document that describes what the software will do and how it will be expected to perform.

Characteristics of good SRS (IEEE 830):

• Correct: Every requirement is correct
• Unambiguous: Only one interpretation
• Complete: All requirements included
• Consistent: No conflicts between requirements
• Verifiable: Can be tested
• Modifiable: Easy to change
• Traceable: Origin of each requirement known

3.3 Requirements Elicitation Techniques

Technique	Description	Best For
Interviews	One-on-one discussions with stakeholders	Understanding individual perspectives
Questionnaires	Written set of questions	Large number of stakeholders
Observation	Watch users perform tasks	Understanding actual work processes
Prototyping	Create mockups for feedback	Clarifying user interface needs
Brainstorming	Group idea generation	Exploring innovative solutions

📖 Detailed Notes

4.1 Software Design Principles

Cohesion: Measure of how closely related elements within a module are

• High cohesion is desirable (module does one thing well)
• Types: Functional, Sequential, Communicational, Procedural, Temporal, Logical, Coincidental

Coupling: Measure of interdependence between modules

• Low coupling is desirable (modules are independent)
• Types: Data, Stamp, Control, External, Common, Content

4.2 Design Patterns

Pattern	Type	Purpose
Singleton	Creational	Ensure only one instance of a class
Factory	Creational	Create objects without specifying exact class
Observer	Behavioral	One-to-many dependency notification
Strategy	Behavioral	Define family of interchangeable algorithms
MVC	Architectural	Separate Model, View, Controller

4.3 Software Testing Levels

Level	What is Tested	Who Tests	Focus
Unit Testing	Individual modules/functions	Developers	Code correctness
Integration Testing	Combined modules	Developers/Testers	Interface defects
System Testing	Complete system	Testers	Requirements compliance
Acceptance Testing	System with real data	Users/Clients	Business needs

4.4 Types of Testing

Black Box Testing: Test without knowing internal code structure

• Equivalence Partitioning
• Boundary Value Analysis
• Decision Table Testing

White Box Testing: Test with knowledge of internal code

• Statement Coverage
• Branch Coverage
• Path Coverage

Other Testing Types:

• Regression Testing: Ensure changes don't break existing functionality
• Performance Testing: Load, stress, scalability testing
• Security Testing: Identify vulnerabilities
• Usability Testing: Ease of use evaluation

4.5 Cyclomatic Complexity

Measures the complexity of a program by counting independent paths.

Formula: V(G) = E - N + 2P

• E = Number of edges
• N = Number of nodes
• P = Number of connected components (usually 1)

Alternative: V(G) = Number of predicate nodes + 1

Interpretation:

• 1-10: Simple, low risk
• 11-20: Moderate risk
• 21-50: High risk
• 50+: Very high risk, needs refactoring

📖 Detailed Notes

5.1 Project Management Concepts

Project: Temporary endeavor with defined beginning and end, creating unique product/service

Triple Constraint (Iron Triangle):

• Scope: What needs to be done
• Time: Schedule/deadlines
• Cost: Budget/resources

Changes to one constraint affect the others.

5.2 Project Scheduling

Work Breakdown Structure (WBS): Hierarchical decomposition of project into manageable components

CPM (Critical Path Method):

• Identifies the longest path through project network
• Determines minimum project duration
• Activities on critical path have zero slack

PERT (Program Evaluation and Review Technique):

• Uses three time estimates: Optimistic (O), Most Likely (M), Pessimistic (P)
• Expected Time: Te = (O + 4M + P) / 6

5.3 Software Metrics

Metric	Description	Use
LOC (Lines of Code)	Count of code lines	Size estimation
Function Points	Measure functionality based on inputs, outputs, files	Size/effort estimation
Cyclomatic Complexity	Measure of code complexity	Test planning
Defect Density	Defects per unit size	Quality measurement

5.4 Risk Management

Risk Management Process:

1. Identification: Find potential risks
2. Analysis: Assess probability and impact
3. Planning: Develop response strategies
4. Monitoring: Track and control risks

Risk Response Strategies:

• Avoid: Eliminate the risk
• Mitigate: Reduce probability or impact
• Transfer: Shift to third party (insurance)
• Accept: Acknowledge and monitor

📖 Detailed Notes

1.1 Propositional Logic

Logical Connectives:

Connective	Symbol	Meaning	Truth Table
Negation	¬ or ~	NOT	¬T=F, ¬F=T
Conjunction	∧	AND	T∧T=T, else F
Disjunction	∨	OR	F∨F=F, else T
Implication	→	If...then	F→T=T, F→F=T, T→F=F, T→T=T
Biconditional	↔	If and only if	T↔T=T, F↔F=T, else F

1.2 Logical Equivalences

Name	Equivalence
Identity	p ∧ T ≡ p, p ∨ F ≡ p
Domination	p ∨ T ≡ T, p ∧ F ≡ F
Idempotent	p ∨ p ≡ p, p ∧ p ≡ p
Double Negation	¬(¬p) ≡ p
Commutative	p ∨ q ≡ q ∨ p, p ∧ q ≡ q ∧ p
Associative	(p ∨ q) ∨ r ≡ p ∨ (q ∨ r)
Distributive	p ∨ (q ∧ r) ≡ (p ∨ q) ∧ (p ∨ r)
De Morgan's	¬(p ∧ q) ≡ ¬p ∨ ¬q, ¬(p ∨ q) ≡ ¬p ∧ ¬q

1.3 Rules of Inference

Rule	Form	Name
Modus Ponens	p → q, p ∴ q	Affirming the antecedent
Modus Tollens	p → q, ¬q ∴ ¬p	Denying the consequent
Hypothetical Syllogism	p → q, q → r ∴ p → r	Chain rule
Disjunctive Syllogism	p ∨ q, ¬p ∴ q	Process of elimination

1.4 Types of Proofs

• Direct Proof: Assume p is true, prove q is true
• Proof by Contrapositive: Prove ¬q → ¬p instead of p → q
• Proof by Contradiction: Assume statement is false, derive contradiction
• Proof by Induction: Base case + Inductive step

📖 Detailed Notes

2.1 Set Operations

Operation	Symbol	Definition
Union	A ∪ B	{x | x ∈ A or x ∈ B}
Intersection	A ∩ B	{x | x ∈ A and x ∈ B}
Difference	A - B	{x | x ∈ A and x ∉ B}
Complement	A'	{x | x ∉ A}
Cartesian Product	A × B	{(a,b) | a ∈ A, b ∈ B}

2.2 Relations

Properties of Relations:

• Reflexive: (a,a) ∈ R for all a ∈ A
• Symmetric: If (a,b) ∈ R then (b,a) ∈ R
• Transitive: If (a,b) ∈ R and (b,c) ∈ R then (a,c) ∈ R
• Antisymmetric: If (a,b) ∈ R and (b,a) ∈ R then a = b

Types of Relations:

• Equivalence Relation: Reflexive, Symmetric, Transitive
• Partial Order: Reflexive, Antisymmetric, Transitive

2.3 Functions

Types of Functions:

• Injective (One-to-One): f(a) = f(b) implies a = b
• Surjective (Onto): Every element in codomain is mapped
• Bijective: Both injective and surjective

📖 Detailed Notes

3.1 Counting Principles

Sum Rule: If task A can be done in m ways and task B in n ways (mutually exclusive), then A or B can be done in m + n ways.

Product Rule: If task A can be done in m ways and task B in n ways, then A and B can be done in m × n ways.

3.2 Permutations

Permutation (order matters):

• P(n,r) = n!/(n-r)! = n × (n-1) × ... × (n-r+1)
• Arranging r items from n items

Example: How many ways to arrange 3 people from 5?

P(5,3) = 5!/(5-3)! = 5!/2! = 120/2 = 60 ways

3.3 Combinations

Combination (order doesn't matter):

• C(n,r) = n!/(r!(n-r)!)
• Selecting r items from n items

Example: How many ways to choose 3 people from 5?

C(5,3) = 5!/(3!×2!) = 120/(6×2) = 10 ways

3.4 Pigeonhole Principle

Basic Form: If n items are put into m containers with n > m, then at least one container must contain more than one item.

Generalized Form: If n items into m containers, at least one container has ⌈n/m⌉ items.

Example: In a group of 13 people, at least 2 have birthday in same month (13 > 12).

3.5 Binomial Theorem

(a + b)ⁿ = Σ C(n,k) × aⁿ⁻ᵏ × bᵏ for k = 0 to n

Example: (a + b)³ = C(3,0)a³ + C(3,1)a²b + C(3,2)ab² + C(3,3)b³ = a³ + 3a²b + 3ab² + b³

📖 Detailed Notes

4.1 Graph Basics

Graph G = (V, E) where V is set of vertices and E is set of edges.

Types of Graphs:

Type	Description
Simple Graph	No loops, no multiple edges
Multigraph	Multiple edges allowed
Directed Graph	Edges have direction
Weighted Graph	Edges have weights/costs
Complete Graph (Kₙ)	Every vertex connected to every other
Bipartite Graph	Vertices divided into two sets, edges only between sets

4.2 Graph Terminology

• Degree of vertex: Number of edges incident to it
• Path: Sequence of vertices connected by edges
• Cycle: Path that starts and ends at same vertex
• Connected Graph: Path exists between any two vertices
• Tree: Connected graph with no cycles

4.3 Euler and Hamiltonian Paths

• Euler Path: Path that uses every edge exactly once. Exists if 0 or 2 vertices have odd degree.
• Euler Circuit: Euler path that starts and ends at same vertex. Exists if all vertices have even degree.
• Hamiltonian Path: Path that visits every vertex exactly once.
• Hamiltonian Circuit: Hamiltonian path that starts and ends at same vertex.

4.4 Euler's Formula for Planar Graphs

For any connected planar graph: V - E + F = 2

• V = Number of vertices
• E = Number of edges
• F = Number of faces (including outer face)

4.5 Trees

Properties of Trees:

• Connected graph with no cycles
• For n vertices, tree has exactly n-1 edges
• Exactly one path between any two vertices

Spanning Tree: Subgraph that is a tree containing all vertices of original graph.

📖 Detailed Notes

5.1 Boolean Algebra

Algebraic structure with two values: 0 (False) and 1 (True)

Basic Operations:

Operation	Symbol	Logic Gate
AND	· or ∧	Output 1 only if all inputs 1
OR	+ or ∨	Output 1 if any input 1
NOT	' or ¬	Inverts input
XOR	⊕	Output 1 if inputs differ

Boolean Laws:

• Idempotent: A + A = A, A · A = A
• Complement: A + A' = 1, A · A' = 0
• Commutative: A + B = B + A, A · B = B · A
• Associative: (A + B) + C = A + (B + C)
• Distributive: A · (B + C) = A·B + A·C
• De Morgan's: (A + B)' = A' · B', (A · B)' = A' + B'

5.2 Karnaugh Maps (K-Maps)

Visual method for simplifying Boolean expressions.

Steps to Simplify:

1. Draw K-map based on number of variables
2. Fill 1s for minterms in function
3. Group adjacent 1s in powers of 2 (1, 2, 4, 8...)
4. Make groups as large as possible
5. Write simplified expression from groups

5.3 Cryptography Basics

Caesar Cipher: Shift each letter by fixed number

• Encryption: E(x) = (x + k) mod 26
• Decryption: D(x) = (x - k) mod 26

RSA Algorithm:

1. Choose two prime numbers p and q
2. Calculate n = p × q
3. Calculate φ(n) = (p-1) × (q-1)
4. Choose e such that 1 < e < φ(n) and gcd(e, φ(n)) = 1
5. Calculate d such that e × d ≡ 1 (mod φ(n))
6. Public Key: (e, n), Private Key: (d, n)

Encryption: C = Mᵉ mod n

Decryption: M = Cᵈ mod n