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

Polymorphism in C++

Polymorphism is a fundamental pillar of Object-Oriented Programming (OOP). The term is derived from two Greek words: Poly (many) and Morph (forms). Therefore, polymorphism signifies one name having many forms.

In C++, polymorphism enables the same function or operator to perform different operations depending on the context.

Why Use Polymorphism?

• Improves code flexibility
• Reduces complexity
• Increases readability
• Supports code reuse
• Facilitates generic programming

Types of Polymorphism in C++

Polymorphism in C++ is categorized into two primary types:

1. Compile-Time (Static) Polymorphism

Compile-time polymorphism is resolved during the compilation phase. The compiler determines which function to invoke based on the function definition.... Continue reading "Polymorphism in C++: Concepts and Methods Explained" »

The Critical Section Problem

In a multi-threaded or multi-process system, shared data can easily become corrupted if multiple processes try to modify it at the same time. This issue is known as a race condition.

To prevent this, we identify the section of code where shared resources are accessed as the Critical Section. The goal is to ensure that only one process executes in its critical section at any given moment.

do {
    [ Entry Section ]   <-- Request permission to enter
        Critical Section   <-- Manipulate shared data
    [ Exit Section ]    <-- Release permission
        Remainder Section  <-- Non-shared code
} while (true);

To be a valid solution, any mechanism managing the critical section must satisfy three strict requirements:... Continue reading "Mastering Process Synchronization: Critical Sections and Semaphores" »

Unit 3: Core C Programming Concepts

Extracting Digits of a Number

Extracting digits of a number is a fundamental programming task used in various computational problems, such as reversing a number, checking for palindromes, or performing digit-based calculations. There are two main approaches: right-to-left extraction and left-to-right extraction.

Right-to-Left Extraction

In right-to-left extraction, the modulus operator (%) is used to obtain the last digit of the number, while integer division (/) removes the last digit after processing. For example, for the number 1234:

• 1234 % 10 gives 4.
• 1234 / 10 gives 123.

This process is repeated until the number becomes zero, allowing each digit to be handled individually.

Left-to-Right Extraction

Left-to-right... Continue reading "C Programming: Numerical Algorithms and Control Flow" »

Electronic Mail (Email) Fundamentals

Email is a method of exchanging digital messages from an author to one or more recipients. 📧

Introduction to Email

Email works similarly to physical mail, but electronically. It uses the internet to deliver messages almost instantaneously to an address on a global network. Key protocols like Simple Mail Transfer Protocol (SMTP) handle sending mail, while Post Office Protocol (POP3) or Internet Message Access Protocol (IMAP) handle receiving it.

Advantages of Email

• Speed: Messages are delivered almost instantly, even across vast distances.
• Cost-Effective: It's virtually free compared to traditional postal services or long-distance calls.
• Accessibility: You can send and receive emails from almost any internet-

Linear Regression Fundamentals

In regression, a set of records containing X and Y values is used to learn a function. This learned function can then be used to predict Y from an unknown X. In regression, we aim to find the value of Y, so a function is required which predicts Y given X. Y is continuous in the case of regression.

Here, Y is called the criterion variable and X is called the predictor variable. There are many types of functions or models which can be used for regression. The linear function is the simplest type of function. Here, X may be a single feature or multiple features representing the problem.

Applications of Linear Regression in AI

• Predictive Analysis: Forecasting sales, stock prices, or house prices based on historical data.

MEGA CHEAT SHEET

1. Programming Fundamentals

Software Development Life Cycle (SDLC)

Steps: Requirements → Specifications → Design → Development → Integration → Testing/Debugging → Installation → Maintenance.

Mnemonic: Really Smart Developers In Tech Install Machines.

Algorithms

• Control Structures:
  • Sequence (In Order)
  • Selection (If/Else)
  • Iteration (Loops)
• Design Strategies: Divide and Conquer, Backtracking.
• Representations: Pseudocode, Flowcharts, Structure Charts, Abstraction Diagrams.
• Checking: Identify Input/Output, Purpose, Desk Check with data.

Programming Paradigms

• Imperative: Step-by-step instructions (e.g., Python).
• OOP: Objects and classes (e.g., Java, Python).
• Logic: Facts and rules (e.g., Prolog).
• Functional: Pure functions, no state

Architecture of 8051

1. CPU (Central Processing Unit)

• Controls all operations of the microcontroller.
• Performs arithmetic and logical operations.
• Executes program instructions.

2. RAM (Random Access Memory)

• Temporary storage for data.
• Stores variables and intermediate results.
• Data is lost when power is turned off.

3. ROM (Read Only Memory)

• Stores the program permanently.
• Retains data even when power is off.

4. Timers/Counters

• Used to generate time delays.
• Can count external events.
• 8051 has Timer 0 and Timer 1.

5. Ports

• Used for input and output operations.
• 8051 has 4 ports (P0, P1, P2, P3).
• Each port is 8-bit.

6. Serial Communication

• Used to exchange data with other devices.
• Uses TXD (Transmit) and RXD (Receive) pins.
• Supports serial data transmission and reception.

Dijkstra's Algorithm in C

This code implements Dijkstra's algorithm to find the shortest path from a source vertex to all other vertices in a graph represented as an adjacency matrix. The program reads graph data from an input.txt file and writes the results to an output.txt file.

Code Implementation

#include <stdio.h>
#include <limits.h>
#include <stdbool.h>

#define MAX_VERTICES 100

// Function to find the vertex with minimum distance
int minDistance(int dist[], bool visited[], int vertices) {
    int min = INT_MAX, min_index;

    for (int v = 0; v < vertices; v++)
        if (!visited[v] && dist[v] <= min) {
            min = dist[v];
            min_index = v;
        }

    return min_index;
}

// Dijkstra'

a = ['z', 'y', 'x', 'w', 'v', 't', 's', 'r', 'q', 'p', 'n', 'm', 'l', 'k', 'j', 'h', 'g', 'f', 'd', 'c', 'b', 'u', 'o', 'i', 'e', 'a']

n = int(input())
h = []
for i in input():
h.append(a.index(i))

def heapify(heap, i, n):
l = 2*i + 1
r = 2*i + 2
minid = i
if l < n and heap[l] < heap[minid]:
minid = l
if r < n and heap[r] < heap[minid]:
minid = r
if minid != i:
heap[i], heap[minid] = heap[minid], heap[i]
heapify(heap, minid, n)

def hs(heap):
n = len(heap)
for i in range(n // 2 - 1, -1, -1):
heapify(heap, i, n)
for i in range(n - 1, 0, -1):
heap[0], heap[i] = heap[i], heap[0]
heapify(heap, 0, i)

hs(h)
print(''.join(a[i] for i in h))

import sys

def solve():
data... Continue reading "Heap Sort Algorithms in Python: Examples and Implementations" »

ECSE 427 Final Exam Cheat Sheet