Notes, summaries, assignments, exams, and problems for Computer science

Evolution of the World Wide Web: From Web 1.0 to Web 3.0

Computer science8.53 KB

Evolution and History of the World Wide Web

1. Introduction and Origins of the Web

The World Wide Web (WWW) is an information system where documents and other web resources are identified by Uniform Resource Locators (URLs), interlinked by hypertext links, and accessible via the Internet.

  • The Genesis: Invented by British scientist Sir Tim Berners-Lee in 1989 while working at CERN (European Organization for Nuclear Research).
  • The Core Motivation: Developed to automate information-sharing among scientists globally, overcoming compatibility barriers between different computers and operating systems.
  • The Core Building Blocks: By 1990, Berners-Lee defined the three fundamental technologies that remain the backbone of the modern web:
  1. HTML (HyperText Markup
...
Continue reading "Evolution of the World Wide Web: From Web 1.0 to Web 3.0" »

Memory Management and File System Architecture

Computer science12.9 KB

1. Demand Paging

In a standard virtual memory system, the operating system does not load an entire program into physical memory (RAM) at once. Instead, it uses Demand Paging—a strategy where pages are loaded into memory only when they are needed (on demand).

How It Works: The Page Fault Mechanism

  1. CPU Reference: The CPU tries to access a specific virtual address.
  2. Page Table Check: The Hardware (MMU) checks the page table entry for that page. Each entry has a Valid/Invalid (V/I) Bit:
    • Valid (1): The page is already in RAM. The address is translated, and execution continues.
    • Invalid (0): The page is currently on the disk (hard drive/SSD). This triggers a Page Fault interrupt.
  3. OS Trap: The operating system takes control to handle the page fault.
  4. Disk
...
Continue reading "Memory Management and File System Architecture" »

Understanding Binary Conversion and Computer Performance

Computer science3.88 KB

Binary Conversion

Single-Precision Floating-Point

Format: 1 sign bit, 8 exponent bits, 23 fraction bits

Bias: +127 (decimal to binary), -127 (binary to decimal)

Double-Precision Floating-Point

Format: 1 sign bit, 11 exponent bits, 52 fraction bits

Bias: +1023 (decimal to binary), -1023 (binary to decimal)

Example: -17.6875 (Single-Precision)

  1. Sign Bit: + = 0, - = 1 (In this case, 1)
  2. Integer Part to Binary: Repeatedly divide the integer part by 2 and record the remainders.
  3. Fractional Part to Binary: Repeatedly multiply the fractional part by 2 and record the integer parts.
  4. Combine and Normalize: Combine the binary integer and fractional parts. Normalize to the form 1.xxx * 2^exponent.
  5. Calculate Exponent: Add the bias to the exponent.
DivideAnswerRemainder
17
...
Continue reading "Understanding Binary Conversion and Computer Performance" »

Understanding SEO: A Comprehensive Guide to Search Engine Optimization

Computer science4.24 KB

Understanding Search Engine Optimization (SEO)

Crawling and Indexing

Web crawlers, also known as bots, robots, or spiders, are software programs designed to follow links, gather information, and send it back to search engines for indexing. This process allows search engines to understand the content and structure of websites.

Evolution of Google Search Algorithms

Over the years, Google has implemented various algorithm updates to improve search results and combat spam. Some notable updates include:

  • Google Dance (2002): Click-through rates started influencing search rankings.
  • Austin (2004): Targeted websites with keyword stuffing.
  • Google Suggest (2008) & Google Instant (2010): Introduced predictive search based on search history.
  • Hummingbird (2013)
...
Continue reading "Understanding SEO: A Comprehensive Guide to Search Engine Optimization" »

Digital Graphics and Media: Terms and Definitions

Computer science3.97 KB

Digital Graphics and Media: Key Terms

Image Fundamentals

  • Pixel: Individual dots that make up bitmap graphics.
  • Dots Per Inch (DPI): Also known as printer resolution. The number of dots of color a printer can produce in a certain amount of space.
  • Pixels Per Inch (PPI): The measurement of pixelation on an output device, such as a computer screen.
  • 300 PPI: The typical PPI needed for professional and commercial prints, such as advertising hoardings, for acceptable quality.
  • Megapixel: A unit used to measure the resolution of digital cameras, referring to one million pixels.
  • Bit Depth: Refers to the number of colors in an image.

Vector vs. Bitmap Graphics

  • Vector Graphics: Graphics stored as a series of mathematical shapes and properties that can be independently
...
Continue reading "Digital Graphics and Media: Terms and Definitions" »

Factors Affecting Second Language Acquisition: Readiness to Notice and Task Demands

Computer science5.8 KB

5. Readiness to Notice (means be ready prepared)

The current state of the interlanguage system (when you're studying your first SLA). What the L is ready to notice (or attend to) due to his/her internal structures or mechanisms (some Ls are going to be more able than others to noticing structures). Pieneman’s Multidimensional Model (word order acquisition in L2 German or emergence of questions in L2 English). Acquisition of word in German. EX: Capacity to place adverbs at the beginning of sentences before. Capacity to place the verb at the end of the sentence in some structures. EX. Prediction about what the L can notice: what is to be noticed refers to the next thing to be acquired: adverbs at the beginning of sentences -> verbs at the...

Continue reading "Factors Affecting Second Language Acquisition: Readiness to Notice and Task Demands" »

Operating Systems: Core Functions and Architecture

Computer science10.41 KB

An Operating System (OS) acts as an intermediary or a bridge between computer hardware and the user. It manages hardware resources, provides a platform for application software to run, and ensures that the computer system operates efficiently and securely.

1. Core Functions and Characteristics

Major Functions of an OS

  • Processor Management (CPU Scheduling): Decides which process gets the processor when, and for how long.
  • Memory Management: Tracks primary memory (RAM), allocating and de-allocating blocks of memory to programs as they execute.
  • File Management: Organizes files into directories, navigation paths, and manages access permissions (read, write, execute).
  • Device Management: Communicates with hardware devices via their respective drivers, managing
...
Continue reading "Operating Systems: Core Functions and Architecture" »

Cybersecurity Threat Landscape: Actors, Vectors, and Defenses

Computer science9.76 KB

🔎 Threat Actors & Their Attack Paths

Who is attacking?

Threat Actors are the people or groups launching attacks. Mnemonic: “NO HIS” (Nation-State, Organized Crime, Hacktivists, Insiders, Script Kiddies).

Actor TypeMotivationTactics
Nation-State (APT Groups)Espionage, warfareAdvanced, persistent attacks
Organized CrimeFinancial gainRansomware, phishing
HacktivistsSocial justice, ideologyWebsite defacement, data leaks
InsidersRevenge, profitData theft, sabotage
Script KiddiesFun, fameLow-skill attacks using existing tools

How do threats reach systems?

Threat Vectors are the attack paths used by threat actors. Mnemonic: “MFWDVN” (Messages, Files, Websites, Devices, Vendors, Networks).

Attack PathExampleHow It Works
Message-BasedPhishing, smishingTrick
...
Continue reading "Cybersecurity Threat Landscape: Actors, Vectors, and Defenses" »

SkinnerDB: Reinforcement Learning for Query Optimization

Computer science3.78 KB

SkinnerDB: Regret-Bounded Query Evaluation via Reinforcement Learning

INTRODUCTION AND PROBLEM DEFINITION:

The work is on query optimization, more specifically: SkinnerDB focuses on finding the optimal Join Order. Because it has the most impact in practice.

SkinnerDB aims to get expected near optimal results without needing any a-priori information. It does not make strong assumptions either.

CONTRIBUTIONS:

  • Introduced a new quality criterion for query evaluation strategies that compares expected and optimal execution cost.
  • Proposed several adaptive execution strategies based on reinforcement learning.
  • Formally proved correctness and regret bounds for those execution strategies.
  • Experimental comparisations of those strategies, implemented in SkinnerDB,
...
Continue reading "SkinnerDB: Reinforcement Learning for Query Optimization" »

Memory Management: Algorithms and Techniques

Computer science4.4 KB

Memory Management Problems and Solutions

Deadlock Scenario

A system has four processes and five allocable resources. The current allocation and maximum needs are as follows:

What is the smallest value of x for which this is a safe state?

The needs matrix is as follows:

  • 0 1 0 0 1
  • 0 2 1 0 0
  • 1 0 3 0 0
  • 0 0 1 1 1

If x is 0, we have a deadlock immediately. If x is 1, process D can run to completion. When D is finished, the available vector is 1 1 2 2 1. Now, A has ‘10211’ and ‘11221’ is available which together satisfies maximum need. So, A is finished and now ‘2 1 4 3 2’ is available, which can satisfy C. Once C is done, the available resources are 3 2 4 4 2, which can help B finish. So, x =1 will do.

Memory Compaction

A swapping system eliminates...

Continue reading "Memory Management: Algorithms and Techniques" »