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

Dining Philosophers Deadlock Prevention

The following implementation addresses the Dining Philosophers problem using POSIX threads and semaphores. To prevent deadlock, the logic ensures that the last philosopher picks up the forks in a different order than the others.

#include <stdio.h>
#include <pthread.h>
#include <semaphore.h>
#include <unistd.h>
#include <stdlib.h>

#define N 5

sem_t forkS[N];

void *philosopher(void *n)
{
    int id = *(int *)n;
    int left = id;
    int right = (id + 1) % N;

    while (1)
    {
        printf("P%d Thinking\n", id);

        fflush(stdout); // Force print immediately
        sleep(1);

        // Deadlock prevention: last philosopher picks right fork first
        if (id ==

1. Vector Databases — High-Dimensional Embeddings

Store and search high-dimensional vector embeddings. Used in semantic search, similarity search, and RAG pipelines.

Indexing Techniques

• Flat Index (Brute Force) → accurate but slow.
• Approximate Nearest Neighbor (ANN) → fast and scalable.
  • Algorithms: HNSW, FAISS, Annoy.
  • 

3. Retrieval-Augmented Generation (RAG)

Overview

Enhances LLM output by integrating retrieved external knowledge.

• Reduces hallucination and outdated responses.
• Improves factual grounding.

RAG Workflow

1. Indexing: Convert raw data (PDF, HTML, Word) → embeddings.
2. Retrieval: Retrieve relevant document chunks using similarity search.
3. Generation: LLM synthesizes results with the query to produce the final answer.

Retrieval Types

What is a DBMS?

A Database Management System (DBMS) is software that enables users to define, create, maintain, and control access to a database. It acts as an interface between users and a database, allowing users to interact with data without needing to know how it is stored internally. It serves as a bridge between data and application programs/users.

Popular DBMS Examples

• MySQL
• Oracle Database
• Microsoft SQL Server
• MongoDB

Types of DBMS

• Hierarchical DBMS: Data organized like a tree.
• Network DBMS: Data linked in a network structure.
• Relational DBMS (RDBMS): Data stored in tables (most common).
• NoSQL DBMS: Used for unstructured or big data.

DBMS Architecture

The 3-Level Architecture is essential for database design:

• Internal Level: How data is physically

1. Span of Array

Problem Statement:
Find the span of an array (the difference between the maximum and minimum elements).

Example:
Input: [3, 4, 7, 10, 1]
Output: 9 (since 10 - 1 = 9)

Approach:

• Initialize max = -∞ and min = +∞.
• Traverse the array once:
  • Update max if the current element is greater than max.
  • Update min if the current element is less than min.
• Return max - min.

Time Complexity: O(n)
Space Complexity: O(1)

2. Second Largest Element

Problem Statement:
Find the second largest element in an array without sorting it.

Example:
Input: [20, 42, 99, 10, 88, 6]
Output: 88

Approach:

• Initialize two variables: max1 (largest) and max2 (second largest).
• Compare the first two elements to set initial values for max1 and max2.
• From the third element onward, iterate:

1. Why Study Programming Language Concepts?

• Expressiveness: Leverage diverse language features

• Selection: Match language to task (e.g., LISP for AI, PHP for web)

• Learning: Foundations ease uptake of new languages

• Efficiency: Choose constructs (recursion vs. iteration) for performance

• Maintenance: Better code reuse and understanding

2. Programming Domains and Typical Languages

3. Language Categories

• Imperative: Variables + assignment + iteration (C, Java, Python, Perl)

• Functional: Computation

When to Use For Loops vs. While Loops

A for loop and a while loop are both used for iteration in programming, but they serve different purposes and are used in different scenarios. Here are three key points to consider when deciding which loop to use:

• Known vs. Unknown Iterations

  For Loop: Use a for loop when the number of iterations is known beforehand. For example, iterating over a fixed range of numbers or elements in a collection (like an array or list).

  While Loop: Use a while loop when the number of iterations is not known in advance and depends on a condition being met. This is useful for scenarios where you need to continue looping until a specific condition changes (e.g., reading input until a user decides to stop).

• Control Structure Differences

  For

Core OOP Definitions

Class and Object

• Class: A user-defined data structure that binds data members and operations (methods) into a single unit.
• Object: An instance of a class. Objects are used to perform actions or allow interactions based on the class definition.

Variables and Attributes

• Method: An action performed using the object's attributes.
• Attributes: Characteristics or properties of a class. Also known as instance variables (declared outside methods, belonging to one object). They are accessible through static and public methods.
• Class Variable: Declared using the static keyword; shared among all objects of the class.
• Local Variables: Declared inside methods, constructors, or blocks; they exist only while the method runs. They cannot be accessed

PHP Core Concepts: Quick Answers

PHP Array Types

• Indexed Array: A normal array with numeric keys.
• Associative Array: An array with named keys (strings).
• Multidimensional Array: An array containing one or more other arrays.

PHP Arithmetic Operators

• + (Addition): Adds two operands.
• - (Subtraction): Subtracts the second operand from the first.
• * (Multiplication): Multiplies two operands.
• / (Division): Divides the first operand by the second.
• % (Modulus): Returns the remainder of a division.

Understanding PHP Abstract Classes

An abstract class in PHP is a class that cannot be directly instantiated. It may contain abstract methods that must be defined (implemented) in any child classes that inherit from it.

What is a Sticky Form?

A sticky form is a web form that... Continue reading "PHP & Web Development Essentials: Core Concepts" »

What is a Microcontroller?

A microcontroller (MC, uC, or μC), also known as a microcontroller unit (MCU), is a small computer on a single integrated circuit. A microcontroller contains one or more processor cores along with memory and programmable input/output (I/O) peripherals.

Microprocessor Core Functions

The core directs all operations of the microprocessor:

• Instruction Handling: It fetches instructions from memory, decodes them, and sends signals to other units.
• Role: Think of it as the “manager” of the microprocessor.

Arithmetic and Logic Unit (ALU)

The ALU performs mathematical operations (addition, subtraction, etc.) and logical operations (AND, OR, NOT). It acts as the “calculator” part of the microprocessor.

Registers

Registers are... Continue reading "Understanding Microcontrollers: Architecture and Functions" »

Recursive Binary Tree Traversals

Inorder Traversal:

void inorder(struct node *root)
{
  if(root != NULL)
  {
    inorder(root->left);
    printf("%d\t", root->data);
    inorder(root->right);
  }
}

Preorder Traversal:

void preorder(struct node *root)
{
  if(root != NULL)
  {
    printf("%d\t", root->data);
    preorder(root->left);
    preorder(root->right);
  }
}

Postorder Traversal:

void postorder(struct node *root)
{
  if(root != NULL)
  {
    postorder(root->left);
    postorder(root->right);
    printf("%d\t", root->data);
  }
}

Linked List Operations

Search

void search(struct node *head,int key)
{
  struct node *temp = head;
  while(temp != NULL)
  {
    if(temp->data == key)
      printf("key found");
    temp =