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

Sort by
Subject
Level

Indifference Curves, Budget Lines, and Consumer Equilibrium

Classified in Economy

Written on in English with a size of 562.89 KB

Theory of Indifference Curves

Developed by Prof. Thomas S. Alvarez

ECONOMICS AND INDUSTRIAL ORGANIZATION I

Indifference Curves

The table below shows points in four different indifference curves for a consumer.
(a) Draw the indifference curves I, II, III, and IV on the same set of axes.
(b) What are indifference curves?

I II III IV
Qx Qy Qx Qy Qx Qy Qx Qy
2 13 3 12 5 12 7 12
3 6 4 8 5.5 9 8 9
4 4.5 5 6.3 6.3 8.3 9 7
5 3.5 6 5 7 7 10 6.3
6 3 7 4.4 8 6 11 5.7
7 2.7 8 4 9 5.4 12 5.3

(a)

Image

(b) Indifference curves graphically display the tastes and preferences of consumers (in the analysis of utility, the total utility curve introduced consumer tastes). The consumer is indifferent to all the various combinations of X and Y on the same indifference curve... Continue reading "Indifference Curves, Budget Lines, and Consumer Equilibrium" »

Mastering Adverbial Clauses: Types, Subordinators, and Usage

Classified in Philosophy and ethics

Written on in English with a size of 3.37 KB

Understanding Adverbial Clauses

Clauses of Time

They are often introduced by subordinators such as after, before, since, until, when, while, as soon as, and once.

Example: When I first met you, you were still studying.

Clauses of Place

They are introduced by where or wherever.

Example: They always went for their holidays wherever they could afford to go.

Clauses of Condition and Concession

This category includes two related types:

  • Conditional Clauses: These express the dependence of one set of circumstances on another.

Example: If you are late, I will have gone away.

Concessive Clauses: These imply a contrast between two circumstances; the main clause is surprising in light of the subordinate one.

Example: Although I was late, she waited for me.

Specific

... Continue reading "Mastering Adverbial Clauses: Types, Subordinators, and Usage" »

Data Warehousing and Business Intelligence Essentials

Classified in Other subjects

Written on in English with a size of 586.85 KB

Data Warehouse

A Data Warehouse (DW) is a centralized, integrated repository designed for analysis rather than transaction processing. It consolidates data from multiple OLTP systems to support reporting, dashboards, and advanced analytics, serving as a single source of truth for strategic decision support.

Key Properties

The data is curated to be subject-oriented, integrated, time-variant, and non-volatile, ensuring data quality and consistency. Unlike OLTP, the DW is built for read-heavy analytics and historical trends, providing the governance needed for managers to trust the KPIs.

Process Context

Data flows via ETL (Extract-Transform-Load) into the DW, typically in scheduled batches (e.g., nightly). This process standardizes and cleanses data,... Continue reading "Data Warehousing and Business Intelligence Essentials" »

Key Eras in American History: Civil War to World War II

Classified in History

Written on in English with a size of 4.04 KB

Unit 7: Civil War and Reconstruction

  • Causes: Sectional tension over slavery; Popular Sovereignty (local voting on slavery) led to "Bleeding Kansas."
  • John Brown: Radical abolitionist; the 1859 Harpers Ferry raid signaled imminent war.
  • Abraham Lincoln: Won the 1860 election on a "Free Soil" platform, triggering Southern secession.
  • The War: Shifted from "preserving the Union" to "abolition" after the Emancipation Proclamation (1863).
  • Turning Point: Gettysburg (1863); Lincoln’s Gettysburg Address defined the "new birth of freedom."
  • Reconstruction Amendments: 13th (ends slavery), 14th (citizenship/equal protection), and 15th (Black male suffrage).
  • Conflict: President Johnson (lenient) vs. Radical Republicans (strict/Military Reconstruction).

Unit 8: Jim

... Continue reading "Key Eras in American History: Civil War to World War II" »

Linear Algebra: Row Space, Null Space, Determinants, and Gram-Schmidt

Posted by Anonymous and classified in Computers

Written on in English with a size of 2.02 MB

Finding the Basis of a Row Space

The easiest way to find the basis of a row space is to reduce matrix A to Reduced Row Echelon Form (RREF). The nonzero row vectors of R (which contain the leading 1s, or pivots) form a basis for row(A).

Finding the Basis of the Kernel

The following four steps outline the most effective method for finding a basis for null(A):

  1. Reduce A to RREF (R): Find the Reduced Row Echelon Form (R) of the matrix A.
  2. Solve the Homogeneous System: Use the RREF, R, to solve the equivalent homogeneous system Rx=0.
  3. Identify and Parameterize Variables:
    • Identify the leading variables (those corresponding to columns containing a leading 1 or pivot in the RREF) and the free variables.
    • Solve for the leading variables in terms of the free variables.
... Continue reading "Linear Algebra: Row Space, Null Space, Determinants, and Gram-Schmidt" »

Petroleum Refining Processes: Separation and Characterization

Posted by Anonymous and classified in Chemistry

Written on in English with a size of 305.29 KB

Ketone Dewaxing Process Details

Ketone dewaxing is a solvent dewaxing process utilized in petroleum refineries to eliminate paraffin wax from lubricating oil fractions. It employs a solvent mixture primarily composed of Methyl Ethyl Ketone (MEK) and Toluene.

  • MEK effectively dissolves the oil but not the wax, facilitating easy wax crystallization.
  • Hot lube oil is combined with the MEK–Toluene solvent and then chilled to very low temperatures (between −20°C and −30°C).
  • At these low temperatures, wax forms solid crystals and separates from the oil.
  • The mixture is filtered using a rotary drum filter, removing solid wax as a "wax cake."
  • The filtrate (dewaxed oil plus solvent) proceeds to solvent recovery, where the solvent is evaporated, condensed,
... Continue reading "Petroleum Refining Processes: Separation and Characterization" »

What is the time of the pet

Classified in Medicine & Health

Written on in English with a size of 4.05 KB

Do you think you eat healthily?No because i eat street food and i dont eat at my normal hours

Why do so many people believe that is important to have a healthy diet?Because healt depends a los on what youconsum

What are the long term benefits of eating more fruit and vegetables?Have better healt and be well hour nour shed

Ia it olnay to ead junk food from time o time?Yes but not very often

1Temptation:The desire to do something that you know is bad for you

2Carbonated:Containing small bubbles of carbon dioxide

3Quenches:Drink so that you are no longer thirsty

4Decay:The state of being destroyed naturally or through lack of care

5Obesity:The state of bek so overweight that it is not healthy

6Toppings:A layer of food on top of a dish that makes it look... Continue reading "What is the time of the pet" »

Essential Petroleum Refining Processes and Origin Theories

Posted by Anonymous and classified in Chemistry

Written on in English with a size of 3.35 KB

Catalytic Reforming Process Fundamentals

Catalytic Reforming | FSC 432: Petroleum Refining

  • Converts low-octane naphtha into high-octane reformate, which is used for gasoline blending and aromatics production.
  • Feed is mixed with hydrogen, heated, and passed over a catalyst in fixed-bed reactors.
  • Major reactions include dehydrogenation to aromatics, isomerization to branched paraffins, and mild hydrocracking.
  • Operating conditions are typically 450–520 °C temperature and 10–45 atm pressure.
  • The catalyst used is platinum on alumina or bimetallic Pt–Re on alumina.
  • Main products are reformate, hydrogen, LPG, and light hydrocarbons.

Fluid Catalytic Cracking (FCC) Technology

  1. FCC converts heavy gas oils into valuable products like high-octane gasoline, LPG, and olefins.
  2. Preheated feed contacts hot,
... Continue reading "Essential Petroleum Refining Processes and Origin Theories" »

C Programming Concepts: Arrays, Functions, Structures, and Stacks

Posted by Anonymous and classified in Computers

Written on in English with a size of 300.77 KB

1. Arrays: Definition, Types, and Implementation

An array is a collection of elements of the same data type stored in contiguous memory locations. It is used to store multiple values in a single variable and can be accessed using index numbers. The indexing in an array starts from 0. Arrays help manage and process data efficiently, especially when dealing with large volumes of similar data.

Types of Arrays Based on Dimensions

  • One-Dimensional Array: It stores data in a linear list format.
  • Multi-Dimensional Array: It stores data in matrix form (like 2D, 3D arrays), which is useful in applications like image processing and tables.

Types of Arrays Based on Memory Allocation

  1. Static Array:

    The size of the array is fixed at compile-time. Memory is allocated

... Continue reading "C Programming Concepts: Arrays, Functions, Structures, and Stacks" »

Data Structures: Queues, Trees, Graphs, and Searching Algorithms

Posted by Anonymous and classified in Computers

Written on in English with a size of 497.48 KB

Understanding Data Structures and Algorithms

8. Queues: FIFO Operations

A queue is a linear data structure that follows the First-In, First-Out (FIFO) principle. The element inserted first will be removed first, similar to people waiting in a line. It has two primary operations:

  • enqueue(): Adds an element to the rear of the queue.
  • dequeue(): Removes an element from the front of the queue.

Enqueue Operation Algorithm (Array-based):

  1. Check if the queue is full (rear == size - 1).
  2. If not full, increment rear.
  3. Insert the new element at queue[rear].

Example:

if (rear == size - 1)
    printf("Queue Overflow");
else {
    rear++;
    queue[rear] = value;
}

Dequeue Operation Algorithm:

  1. Check if the queue is empty (front > rear).
  2. If not empty, retrieve the element
... Continue reading "Data Structures: Queues, Trees, Graphs, and Searching Algorithms" »