Notes, summaries, assignments, exams, and problems for Other courses

Data Structure Trees: Fundamentals

A tree is a non-linear data structure that represents data in a hierarchical form. It consists of nodes connected by edges.

Key Tree Terminology

• Root Node: The topmost node (has no parent).
• Parent Node: A node that has child nodes.
• Child Node: Nodes that have a parent.
• Leaf Node: Nodes with no children.
• Edge: The connection between two nodes.
• Level: Distance from the root (root = level 0).
• Height: The length of the longest path from the root to a leaf.

C++ Node Structure Example

This structure defines a basic node for a binary tree:

#include <iostream>
using namespace std;

struct Node {
    int data;
    Node* left;
    Node* right;

    Node(int val) {
        data = val;
        left = right = nullptr;
    }

Advantages of the System Approach

• Holistic View: Provides a comprehensive perspective of the organization, facilitating better decision-making.
• Coordination: Improves efficiency by integrating all departments and functions.

Types of Knowledge

• Explicit Knowledge: Knowledge that is documented and easily shared (e.g., manuals, reports).
• Tacit Knowledge: Personal experience-based knowledge that is difficult to express in words (e.g., skills, intuition).

Internet Protocols

• HTTP (Hypertext Transfer Protocol): Used for transferring web pages over the internet.
• FTP (File Transfer Protocol): Used for transferring files between computers on a network.

Origins of Fuzzy Logic

Fuzzy logic was proposed in 1965 by Lotfi A. Zadeh.

Functions of the CPU

• Arithmetic and Logic

Picture This: Art and Emotion Vocabulary

• Anxious: Worry
• Exhaustion / Drenched: Fatigue
• Astonished: Shocked (Surprise < Amazed < Astonished)
• Hopeful: Optimistic
• Despair: Hopelessness
• Agony: Suffering
• Agony Aunt: A newspaper columnist who offers advice on personal problems.
• Fatigue: Tiredness
• Guilt / Guilty: Blame
• Inappropriate: Unsuitable
• Seductive: Attractive
• Preoccupied: Distracted
• Detachable: Not attachable
• Tender: Loving
• Nuptials: Wedding
• Selective / Pinpoint: Choosing or selecting
• Ignore: Not pay attention to
• Stop in (my) tracks: Interrupt or stop
• Gorgeous: Beautiful
• Serve: Work for
• Plain / Ordinary / Simple: Not extravagant or fancy
• Tackle: Taking it on (Afrontar/Enfrentar)
• Matters: Issue (Asunto/Tema)
• Outgrow: Leave behind
• Resemble / Take after: Look like
• Wake

Membrane Lipids and Signaling Molecules

Glycolipids are the least abundant lipids, featuring a backbone made of sphingosine. They contain two tails, usually both saturated, and heads with polar sugar groups. These are always found on the non-cytosolic leaflet, as signaling and recognition occur in the extracellular space. Sterols are the second most abundant lipids, characterized by a rigid ring-structured backbone, one short tail, and a small head group found on both leaflets. There is an asymmetrical distribution of these different types of lipids in the biological bilayer; for instance, Phosphatidylserine (PS), with its negative charge, prefers the cytosolic side due to the reducing environment.

Phosphoinositide Signaling Pathways

Two groups... Continue reading "Membrane Lipids, Protein Analysis, and Cell Transport" »

Addressing Modes in 8085 Microprocessor

Addressing modes refer to the ways in which an instruction specifies the location of its data (operand). The 8085 microprocessor supports several addressing modes to access data efficiently based on program needs. Understanding these modes is essential for instruction execution and memory handling in assembly programming.

1. Immediate Addressing Mode

In this mode, the actual data (operand) is provided directly within the instruction itself. The processor does not need to fetch data from memory. It is fast and commonly used for initialization.

• Example: MVI A, 25H ; Load 25H directly into register A

2. Register Addressing Mode

The operand is stored in a CPU register. The instruction specifies the register where... Continue reading "8085 Microprocessor Addressing Modes and Registers Explained" »

Fundamental Sorting Algorithms in C

This document provides standard C implementations for three essential comparison-based sorting algorithms: Merge Sort, Quick Sort, and Heap Sort. These examples demonstrate the core logic and structure of each algorithm.

Merge Sort Implementation

Merge Sort is a stable, divide-and-conquer algorithm known for its consistent O(n log n) time complexity.

#include <stdio.h>

void merge(int a[], int l, int m, int r) {
    int i=l, j=m+1, k=0, b[100];
    while(i<=m && j<=r) {
        if(a[i]<a[j]) b[k++]=a[i++];
        else b[k++]=a[j++];
    }
    while(i<=m) b[k++]=a[i++];
    while(j<=r) b[k++]=a[j++];
    for(i=l,k=0;i<=r;i++,k++) a[i]=b[k];
}

void mergesort(int a[], int l, int

Aircraft Load Factors and Aerodynamics

The load factor indicates how many times the aircraft’s weight is being supported by lift. High load factors increase structural stress and can lead to a stall if the critical angle of attack is exceeded.

Lift-to-Drag Ratio and Efficiency

The aerodynamic efficiency or lift-to-drag ratio (L/D) measures how efficiently an aircraft produces lift compared to the drag it generates. A high L/D ratio means the aircraft gains more lift for the same drag, improving performance (longer range, better glide). At the point of... Continue reading "Aeronautical Engineering Principles and Aircraft Systems" »

Contract Definition and Validity Requirements

Definition of a Contract

A contract is an agreement between two or more parties which is legally enforceable when executed in accordance with requirements. An agreement will be enforced when the following essential elements exist:

• Offer and acceptance
• Intention to create legal relations
• Legality
• Possibility of performance
• Capacity of the parties
• Consent must be genuine
• Consideration must be present

All the elements must be present for a valid contract.

Remedies for Non-Performance (Schema)

Remedies available upon non-performance include:

• General remedies
• Cure by debtor of non-conforming performance
• Right to enforce performance
• Withholding performance
• Termination
  • Grounds for termination
  • Scope, exercise, and loss of

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:

Common Statistical Biases

• Sampling bias: The sample was not representative of the population.
• Non-response bias: Only 24% returned surveys.

Sampling Techniques

• Simple Random Sampling (SRS): 1) Every member of the population has the same chance of being included (representative). 2) Members are chosen independently.
• Random Cluster Sampling: 1) Divide into smaller geographical sectors. 2) Take an SRS of sectors. 3) Count all samples in sectors and scale appropriately.
• Stratified Random Sampling: 1) Divide population into groups based on criteria like age or income. 2) Perform an SRS of each group and scale appropriately.

Data Variables and Distributions

• Variable Types: Categorical and Numeric (discrete and continuous).
• Relative frequency: Count / sample