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

Corporate Distribution Layers

Distributions are applied in the following order: Accumulated E&P + Current E&P, then basis, then the remainder is treated as capital gain.

• No Dividend: If there is no E&P, reduce current E&P first. Negative AEP still distributes E&P.
• Offset: Half of current E&P is lost to offset AEP before distribution.

Property Distributions

Recognize gains, but not losses.

• Dividend: FMV - Liabilities
• Basis: FMV
• Gains: FMV - Tax Basis

Distribution Table

The amount from CEP is calculated as: (Period distribution / Total distribution) * CEP. AEP is applied to the remainder, then to stock basis.

Stock Distributions and Redemptions

• Stock Distribution: Proportionate distributions are nontaxable and do not reduce E&

Role of Sox2 in Biological Functions

Sox2 is a core transcription factor that preserves stem-cell identity. It works with Oct4 and Nanog to maintain pluripotency and self-renewal, activating genes required for an undifferentiated state. It also prevents premature differentiation, especially in neural progenitor cells, keeping them from becoming neurons or glial cells too early. Loss of Sox2 leads to failure in forming the pluripotent epiblast during early development, demonstrating its essential role in embryo viability.

LIF-Mediated Intracellular Signaling in mESCs

LIF maintains mouse embryonic stem cells (mESCs) in a "young and undifferentiated" state by activating key cell-signaling pathways:

• JAK-STAT3 Pathway: LIF binds its receptor, activating

English Vowel and Diphthong Phonetics

a — Low back, unrounded, lax

Examples: pot, car.

• Positions: initial — olive; middle — cottage.
• R-colored (/+r/) examples: swap — swab; knot — nod; bock — bog; cop — cob; barr — barred.

c — Mid-low back, rounded, tense

Examples: fall, raw.

• Positions: initial — office; middle — form; final — law.
• R-colored (/+r/) examples: course; dross — draws; source — sores; court — chord; cost — caused; brought — broad.

O — Diphthong, mid to high, rounded, tense

Examples: post, coal.

• Positions: initial — ocean; middle — most; final — low.
• Word pairs / examples: lope — lobe; doss — doze; oat — owed; host — hosed; loayn — loathe.

u — High back, rounded, lax

Examples: put, look.

• Positions:

Core Database Concepts and Relational Algebra

Question 1: Cartesian Product Size

Question 1: S is a relation instance. If S has 6 tuples, how many tuples are there in the result of the following SQL query?

SELECT * FROM S S1, S S2;

Answer: 36 (Calculated as 6 * 6, representing the Cartesian product of S with itself.)

Question 2: Maximum Tuples and Primary Keys

Question 2: Let R(A, B, C, D) be a relation, where (A, B, C) is the Primary Key (PK) of R, and attribute D cannot be NULL. Assume A's domain has 5 different values, B's domain has 2, C has 4, and D has 3. What is the maximum number of tuples that can be in an instance of R?

Answer: 40 (Calculated as 5 * 2 * 4. The maximum number of tuples is determined by the product of the domain sizes of the... Continue reading "Database Fundamentals: SQL Queries and Relational Concepts" »

What is Prayatna (प्रयत्न)?

In Sanskrit phonetics (as described in texts like Paniniya Shiksha), Prayatna simply means "effort." It is the effort or action made by our speech organs (tongue, lips, vocal cords, etc.) to produce a sound.

Prayatna is divided into two main categories:

1. Ābhyantara Prayatna (आभ्यन्तर प्रयत्न): The Internal Effort
2. Bāhya Prayatna (बाह्य प्रयत्न): The External Effort

1. Ābhyantara Prayatna (Internal Effort)

This is the effort that happens inside the mouth, just before the sound is produced. It describes how the tongue and lips act to shape the sound. According to the Paninian tradition, there are five types of internal effort.

1. Spṛṣṭa (स्पृष्ट)

CPU Fundamentals and Timing

Clock Cycles and Frequency

A clock that oscillates 1 million times per second (1 MHz) produces a clock cycle of 1 microsecond (1 μs), which equals 10^-6 seconds per cycle.

Instruction Execution Pipeline

The steps for executing a machine instruction are:

1. Fetch the instruction.
2. Decode the instruction.
3. Fetch the operand (if any).
4. Execute the instruction.
5. Store the result or output.

Cache Memory Operations

Cache memory is a small, fast memory used to temporarily store frequently accessed data or instructions to speed up CPU operations.

• A cache hit occurs when the CPU finds the required data in cache memory.
• A cache miss occurs when the data is not found and must be fetched from main memory.

Assembly Language Basics

General-Purpose

Assembly Language Fundamentals: Key Concepts and Definitions

1. Clock Frequency and Cycle Time

A clock that oscillates 1 million times per second (1 MHz) produces a clock cycle duration of $10^{-6}$ seconds (1 microsecond).

2. General-Purpose Registers (8-bit, 16-bit, and 32-bit Access)

The general-purpose registers that can be accessed in 8 bits, 16 bits, and 32 bits are: EAX, EBX, ECX, and EDX.

3. Purpose of EAX and ECX Registers

These registers serve specific roles in CPU operations:

• EAX – Accumulator: Automatically used by multiplication and division instructions. It is often referred to as the extended accumulator register.
• ECX – Loop Counter: The CPU automatically uses ECX as a counter for loop instructions.

4. Reserved Words and Identifiers

Solving Polynomials Using the Remainder Theorem

We are given the function:

f(x) = mx³ − 3x² + nx + 2

• When divided by (x + 3), the remainder is −3.
• When divided by (x − 2), the remainder is −4.

By the Remainder Theorem, if f(x) is divided by (x − a), the remainder is f(a).

Step 1: Substitute x = −3

f(−3) = m(−3)³ − 3(−3)² + n(−3) + 2

= −27m − 27 − 3n + 2

= −27m − 3n − 25

Given remainder −3:

−27m − 3n − 25 = −3

−27m − 3n = 22

27m + 3n = −22 (Equation 1)

Step 2: Substitute x = 2

f(2) = m(2)³ − 3(2)² + n(2) + 2

= 8m − 12 + 2n + 2

= 8m + 2n − 10

Given remainder −4:

8m + 2n − 10 = −4

8m + 2n = 6 (Equation 2)

Step 3: Solve the System of Equations

Multiply Equation 2 by 3 → 24m + 6n = 18

Multiply Equation... Continue reading "Solving Polynomial Remainder Theorem and Transformations" »

Słownictwo Rozszerzone

Grupa B

Zadanie 1

1. maternity ward
2. registry office
3. stand up to
4. till/until the cows come home
5. an unearthly hour
6. soft spot for
7. run errands

Zadanie 2

1. cot
2. prom
3. sibling
4. hectic
5. dump
6. descendant
7. godparent

Zadanie 3

1. Extended
2. custody
3. binge-watch
4. browsing
5. socialise
6. raised

Grupa A

Zadanie 1

1. change a nappy/diaper
2. housewarming party
3. silent treatment
4. the small hours
5. back in the day
6. have a crush
7. distant relatives

Zadanie 2

1. midwife
2. bouquet
3. offspring
4. frugal
5. fast
6. ancestor
7. triplets

Zadanie 3

1. brought
2. scanning
3. foster
4. hit
5. immediate
6. orphan

Test

Grupa A

Zadanie 1

1. financially dependent
2. go out/go out with friends/meet friends/spend time with friends/leave the house
3. a good idea / a good plan/a good decision
4. enough time/ a chance
5. get on better/feel better/feel happier / argue less

Zadanie 2

1D, 2A, 3E, 4B,... Continue reading "English Vocabulary and Grammar Exercise Answer Key" »

Section A: R Basics and Data Types (Weeks 1-4)

Model Questions and Answers

Q: Create a vector v (3, NA, Inf, -Inf). Explain adding 5 to v.

A: The operation is element-wise. Missing values (NA) propagate, resulting in NA. Infinite values (Inf, -Inf) remain infinite.

v <- c(3, NA, Inf, -Inf)
print(v + 5)
# Output: [1]  8 NA Inf -Inf

Q: Given vector a, write code to count and replace NAs.

A: Assuming a <- c(10, 15, NA, 20).

• Count NAs: sum(is.na(a)) → 1.
• Replace NAs (e.g., with 0): a[is.na(a)] <- 0.

Q: Explain the difference between a[a > 12] and a[which(a > 12)].

A: Both select elements greater than 12 (15, 20). However:

• a[a > 12] → [1] 15 NA (Uses logical indexing; preserves the position of NA in the original vector as NA).
• a[which(