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

Biological Neurons

A biological neuron is the fundamental unit of the nervous system, responsible for transmitting information throughout the body. It consists of three main parts:

• Dendrites: These are branch-like structures that receive signals from other neurons and transmit them to the cell body.
• Cell Body (Soma): Contains the nucleus and other essential organelles responsible for processing information.
• Axon: A long, thread-like extension that carries nerve impulses away from the cell body to other neurons, muscles, or glands.

Neurons communicate using electrical and chemical signals through synapses, where neurotransmitters help in transmitting the signals. The brain contains billions of neurons that work together to perform cognitive functions,... Continue reading "Neural Networks: Neurons, Activation, Structure" »

Constructor

A constructor is a special method in object-oriented programming that is automatically called when an instance (object) of a class is created. The main purpose of a constructor is to initialize the object's attributes (properties) and allocate resources if needed. Constructors have the same name as the class and do not have a return type.

Example of a Constructor

Here is an example in Python:

class Person:
    def __init__(self):
        self.name = "John Doe"
        self.age = 30

# Creating an instance of the Person class
person = Person()

print(person.name)  # Output: John Doe
print(person.age)   # Output: 30

In this example, __init__ is the constructor method in the Person class. It initializes the name and age attributes of the... Continue reading "Understanding Constructors and Class Variables in OOP" »

Cache Write Policies

Write-Through

• Definition: Writes data to both the cache and main memory simultaneously.
• Synchronization: Cache and main memory are always synchronized.
• Write Speed: Slower, because every write goes to both cache and memory.
• Data Integrity: Ensures data in both cache and main memory is identical.
• CPU Performance Impact: Slower, due to the additional write to main memory.
• Use Cases: Ideal for systems where data consistency is critical (e.g., databases).
• Cache Miss Handling: Writes to both cache and memory on a miss.
• Complexity: Simple to implement; doesn't require tracking of data in the cache.

Write-Back

• Definition: Writes data to the cache first and only writes to memory when the cache line is evicted.
• Synchronization: Cache and main

Understanding Node.js Modules & Core Functionality

In Node.js, modules are fundamental. They represent reusable blocks of code that can be exported from one file and imported into another, promoting a modular and organized application structure. Node.js features a built-in module system, allowing developers to utilize core modules, create custom modules, or integrate third-party modules.

Core Modules in Node.js

Core modules are pre-packaged with Node.js, offering essential functionalities for common tasks like file system operations, HTTP request handling, and path manipulation.

Some commonly used core modules in Node.js are:

• fs (File System): For interacting with the file system.
• http (HTTP): For creating HTTP servers and clients.
• path (Path)

Classes (الصفوف)

• A class consists of variables (fields) and methods.
• Variables are data members of a class.
• Methods are functions that define the class's behavior.

Variables (المتغيرات)

• Declared with a data type and a name.
• Can be public or private.
• Examples: int age, String name.

Methods (الأساليب)

• Functions that perform specific tasks.
• Can have parameters and return values.
• Types:
  • Void methods: Don't return a value.
  • Return type methods: Return a value.
  • Static methods: Can be called without creating an object.
  • Instance methods: Require an object to be called.
  • Abstract methods: Declared without a body; used in abstract classes.
  • Overloaded methods: Multiple methods with the same name but different parameters.

Constructors (البناؤون)

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 =

Lecture 1: Moore's Law

Moore's Law: The number of transistors on microchips doubles every two years.

Lecture 2: Logic Gates

AND, OR, and NOT gates are universal.

Logic word problem steps:

Example: In a bank, there were four employees: the bank manager, assistant manager, teller, and the security guard. The bank has a single vault for the storage of their money. This vault was designed so that it needs four signals to open it. These four signals are from the bank manager, assistant manager, teller, and the security guard. For the vault to open, it needs the following conditions:

1. No single employee can open the vault.
2. It can be opened with three employees as long as one of them is the manager.
3. It can be opened by the manager together with the assistant

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" »

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

Essential Linux Commands

File and Directory Management

• mkdir: Create a new directory.
• ls: List contents of a directory.
• rm: Remove files or directories (-r for recursive).
• cp: Copy files or directories.
• mv: Move or rename files or directories.
• cat: Display file contents or create files.
• less: View file contents one page at a time.
• head: Display the first 10 lines of a file.
• tail: Display the last 10 lines of a file.

System Information

• uname: Show system information (kernel, version, etc.).
• top: Display running processes and resource usage.
• df: Show disk space usage.
• df -h: Show disk usage in human-readable format.
• free: Display memory usage (RAM and swap).

File Creation and Editing

• touch: Create an empty file or update its timestamp.
• echo: Write text to a file