Notes, summaries, assignments, exams, and problems for Computers

Topic Modeling: LSI vs LDA

Latent Semantic Indexing (LSI)

Use LSI for semantic similarity, retrieval, short/sparse documents, and synonymy problems. It uses Singular Value Decomposition (SVD) to find latent concept axes from term-document co-occurrence. Concepts are mathematical directions, not clean probability-based topics. It is better when the goal is to “find similar documents.”

Latent Dirichlet Allocation (LDA)

Use LDA for discovering hidden themes and topic percentages. In this model, each document is a mixture of topics, and each topic is a distribution over words. It is better when the goal is to determine “what themes exist in this corpus?”

Key Distinction

• LSI finds latent concept dimensions.
• LDA explicitly models probabilistic topics.

1. Hardware and Spreadsheet Fundamentals

1(a) Input and Output Devices

• 1(a)(i) Output
• 1(a)(ii) Input
• 1(a)(iii) Input
• 1(a)(iv) Output
• 1(a)(v) Input

1(b) Network Types and Components

• 1(b)(i) LAN
• 1(b)(ii) MAN
• 1(b)(iii) WAN

Wireless Networking

• Component: Wireless NIC, Wi-Fi adapter
• Reason: Connects device to wireless network without cables

1(c) Spreadsheet Operations

• 1(c)(i) =C2*D2
• 1(c)(ii) Average item cost: C8; Grand total: E8
• 1(c)(iii) =AVERAGE(C2:C7)
• 1(c)(iv) Stock ID: Text; Total Value: Currency
• 1(c)(v) Dinghy, Fender

2. Data Processing and Validation

2(a) Data Entry Devices

• 2(a)(i) MICR
• 2(a)(ii) Sensor
• 2(a)(iii) OMR
• 2(a)(iv) OCR

2(b) Validation Checks

• 2(b)(i) Presence check
• 2(b)(ii) Range check
• 2(b)(iii) Format check

2(c) Database Concepts

• 2(c)(i) Boolean: Stores only

Computer Systems Fundamentals Cheat Sheet

Number Systems

• Binary (Base 2): Digits 0 and 1.
• Hexadecimal (Base 16): Digits 0–9 and A–F.
• Decimal (Base 10): Digits 0–9.

Conversions

• Binary to Decimal: Multiply each bit by 2^n from the right.
• Decimal to Binary: Divide by 2 and record the remainders.
• Hex to Binary: Replace each hex digit with its 4-bit binary equivalent.

Two's Complement (Signed Numbers)

• Positive numbers: Same as unsigned.
• Negative numbers: Invert all bits and add 1.
• Range (n bits): -2^(n-1) to 2^(n-1) - 1.
• Overflow: Occurs if carry into the sign bit ≠ carry out.

Boolean Algebra Rules

• Identity: A + 0 = A, A * 1 = A
• Null: A + 1 = 1, A * 0 = 0
• Idempotent: A + A = A, A * A = A
• Inverse: A + NOT A = 1, A * NOT A = 0
• Distributive: A(B + C) = AB +

Features of an OPAC

OPAC (Online Public Access Catalogue):

Core Features of an OPAC

1. Advanced Search Capabilities

• Multi-Field Searching: Allows retrieval using specific metadata like Author, Title, ISBN, Subject, and Call Number.
• Boolean & Query Refinement: Supports Boolean operators (AND, OR, NOT), wildcard truncation, and phrase searching to narrow down results.

2. Real-Time Status & Location Tracking

• Circulation Status: Displays live item availability (e.g., Available, Checked Out, On Hold, Lost).
• Dynamic Location: Pinpoints the exact physical location, including the specific collection (e.g., Reference, Stack) and the Call Number/Shelf Mark.

3. Patron Self-Service (My Account)

• Circulation Control: Enables users to log in to renew issued

A stack is a fundamental data structure in computer science that follows the Last In, First Out (LIFO) principle. This means that the last element added to the stack is the first one to be removed. You can think of it like a stack of plates: you can only add or remove the top plate.

### Key Concepts of a Stack:

1. Basic Operations:
   - Push: This operation adds an element to the top of the stack.
   - Pop: This operation removes the element from the top of the stack and returns it.
   - Peek (or Top): This operation returns the top element of the stack without removing it.
   - IsEmpty: This operation checks whether the stack is empty.

2. Implementation:
   Stacks can be implemented using arrays or linked lists. Here are the details for... Continue reading "Mastering Stacks, Deques, Trees, and Graph Data Structures" »

Border Gateway Protocol (BGP)

BGP (Border Gateway Protocol) is a routing protocol used to exchange routing information between different networks or Autonomous Systems (AS) on the Internet. It is called an inter-domain routing protocol because it works between different networks.

Roles of BGP

• Connects different Autonomous Systems.
• Exchanges routing information between networks.
• Selects the best path for data transmission.
• Prevents routing loops.
• Maintains internet routing tables.

Example: When a user using Airtel internet accesses a Google server, BGP helps choose the best route between the Airtel network and the Google network.

CSMA/CD: Collision Detection in Ethernet

CSMA/CD stands for Carrier Sense Multiple Access with Collision Detection. It is a... Continue reading "Essential Computer Networking Protocols and Mechanisms" »

Microprocessor vs. Microcontroller

ii) Differentiate Between a Microprocessor and a Micro-Controller

Microprocessor

Definition:

A microprocessor is a central processing unit (CPU) on a single integrated circuit (IC) chip that performs the processing functions of a computer.

Functionality:

• It only includes the CPU core and lacks other components like memory, I/O ports, timers, and other peripherals.
• Requires external components like memory (RAM, ROM), input/output devices, timers, and other peripherals to function as a complete system.

Usage:

• Primarily used in systems requiring high computational power and flexibility, such as desktop computers, laptops, servers, and high-end embedded systems.
• Suited for applications where customization of peripherals

Number Pyramid of Integers

Write a program to generate the following patterns of integers:

              1
            121
           12321
         1234321

Corrected C Program (Number Pyramid)

The following C program prints the above centered palindrome number pyramid. It prompts for the number of rows.

#include <stdio.h>

int main()
{
    int i, j, row;
    printf("Enter number of rows: ");
    if (scanf("%d", &row) != 1) {
        printf("Invalid input.\n");
        return 1;
    }

    for (i = 1; i <= row; i++)
    {
        for (j = 1; j <= row - i; j++)
        {
            printf(" ");
        }
        for (j = 1; j <= i; j++)
        {
            printf("%d", j);
        }
        for (j = i - 1; j >= 1; j--)

Key .NET Concepts Defined

Managed Code Explained

Managed code is the code executed by the .NET runtime (CLR), which provides memory management, security, and exception handling.

.NET Framework Class Library (FCL)

FCL is a collection of reusable classes, interfaces, and value types that provide core functionalities like file handling, data access, and networking in .NET applications.

Boxing in VB.NET

Boxing is the process of converting a value type (e.g., Integer) into an object type (Object), allowing it to be stored in the heap.

Option Explicit Statement

In VB.NET, Option Explicit forces variable declarations before use, preventing errors due to undeclared variables.

Progress Bar Control Use

A Progress Bar control visually represents the progress of... Continue reading "Essential .NET Concepts: CLR, FCL, MSII" »

Industrial Automation Fundamentals

Defining Industrial Automation and Its Impact

Industrial automation refers to the use of control systems, such as computers, robots, and Programmable Logic Controllers (PLCs), to handle processes and machinery in industries, significantly reducing human intervention. It fundamentally enhances efficiency, precision, and safety in modern manufacturing.

The Revolution in Manufacturing

Automation has revolutionized manufacturing through several key areas:

• Increased Productivity: Automation enables 24/7 operations, substantially boosting output and throughput.
• Improved Quality: Consistent, repeatable processes reduce errors and ensure uniform product quality.
• Cost Efficiency: Automation reduces reliance on manual labor