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

Dayanira's Profile and Exercises

About Dayanira and Her Family

My name is Dayanira, and I am from Oaxaca. My family consists of five members: my father, my mother, and my two younger brothers, who are 17 and 12 years old. My family is wonderful; my parents are very funny but also strict with us. They are always willing to help others.

True or False Exercise Answers

• V
• F
• F
• F
• V
• F
• F
• F
• F
• V

Multiple Choice Exercise Answers

• 1.- B
• 2.- D
• 3.- C
• 4.- D
• 5.- D
• 6.- C
• 7.- C
• 8.- D
• 9.- A
• 10.- B
• 11.- C
• 12.- A
• 13.- B
• 14.- D
• 15.- B
• 16.- A
• 17.- B
• 18.- C
• 19.- B
• 20.- D
• 21.- D
• 22.- C
• 23.- A
• 24.- B
• 25.- A
• 26.- A
• 27.- B
• 28.- B
• 29.- C
• 30.- D
• 31.- A
• 32.- B
• 33.- D
• 34.- B
• 35.- A
• 36.- B
• 37.- B
• 38.- A
• 39.- B

Preposition Exercise Answers

• ON
• NEXT TO
• IN
• UNDER
• NEXT TO
• IN

Yael Vazquez's Profile and Exercises

About Yael and Her Family

Hi, I'... Continue reading "Personal Profiles & English Exercise Solutions" »

Gerund ING

Infinitive TO+verb

Infinitive without TO

Reported Speech

Understanding Business Strategy

Strategy specifies how an organization matches its own capabilities with opportunities in the marketplace to accomplish its objectives. It describes how an organization can create value while differentiating itself from competitors. This includes industry analysis and Porter's Five Forces.

Key Strategic Concepts

Common strategies include Product Differentiation and Cost Leadership.

Strategy Map Explained

A Strategy Map describes how an organization creates value by connecting strategic objectives in explicit cause-and-effect relationships across Financial, Customer, Internal Business, and Learning and Growth perspectives.

Conditions for an Effective Strategy Map

• Strength of ties
• Orphan objectives
• Focal points
• Triggers
• Distinctive

UNIT 1 PRAGAMATICS

INTRODUCTION

• Deixis: Refers to words and phrases that cannot be fully understood without additional contextual information. Pointing via language.

“You’ll to bring this tomorrow because it is not here”

• Referenic. Act by which a speaker uses language to enable a listener to identify something.

• Inference: Additional information used by the listener to connect what is said to what must be MEANI

• Anaphora: Subsequent reference to an already introduced entity

“My brother came to see me. He was furious”

• Supposition: What a speaker assumes is true or known by what he hears

“Your qualified is waiting outside” → You heard a qualified

• Politeness: showing awareness of others' perform fave. Fave = public self-image

  • Fave-threatening

The End of World War II

Allied Victory

1. In 1943, British forces gained control of North Africa and Italy, forcing Mussolini to surrender.
2. In June 1944, Allied forces landed on Normandy, France, in the event known as D-Day.
3. In May 1945, Germany surrendered. In August 1945, the United States used the atomic bomb on Japan. World War II was over.

Results of the War

1. The United States and the Soviet Union emerged as the most powerful countries in the world.
2. In 1945, some 50 nations formed the United Nations, an international peacekeeping organization.

The Cold War Era

Defining the Cold War

The Cold War was a period of tense rivalry between the United States and the Soviet Union.

Causes and Effects

• Cause: Rivalry developed between the United States and the Soviet

English Vocabulary Essentials

Nouns

• Ancestor - Ancestro
• Ban - Prohibición
• Belief - Creencia
• Freedom - Libertad
• Manners - Modales
• Misconception - Idea equivocada
• Owner - Propietario
• Path - Camino
• Request - Petición
• Roots - Raíces
• Stereotype - Estereotipo
• Traditional costume - Traje regional

Verbs

• Attempt - Intentar
• Come back - Volver
• Consider - Considerar
• Find out - Encontrar
• Ignore - Ignorar
• Miss - Perderse algo
• Refuse - Rechazar
• Stay behind - Quedarse
• Surround - Rodear

Adjectives

• Appropriate - Adecuado
• Customary - Habitual
• Disturbing - Inquietante
• Forbidden - Prohibido
• Gigantic - Gigantesco
• Narrow-minded - Cerrado de mente
• Open-minded - Abierto de mente
• Proper - Adecuado
• Treacherous - Peligroso
• Typical - Típico

Expressions

• Culture shock - Choque cultural
• Keep... alive - Mantener

5. A machine has a 32-bit address space and an 8-KB page. The page table is entirely in hardware, with one 32-bit word per entry. When a process starts, the page table is copied to the hardware from memory, at one word every 100 nsec. Lf each process runs for 100 msec (including the time to load the page table), what fraction of the CPU time is devoted to loading the page tables?

The page table contains 232 /213 entries, which is 524,288.  Loading the page table takes 52 msec. If a process gets 100 msec, this consists of 52 msec for loading the page table and 48 msec for running. Thus 52% of the time is spent loading page tables.

6. Suppose that a machine has 48-bit virtual addresses and 32-bit physical addresses. If pages are 4 KB, how many... Continue reading "Understanding Paging and Virtual Memory in Computer Architecture" »

Memory Management Problems and Solutions

Deadlock Scenario

A system has four processes and five allocable resources. The current allocation and maximum needs are as follows:

What is the smallest value of x for which this is a safe state?

The needs matrix is as follows:

• 0 1 0 0 1
• 0 2 1 0 0
• 1 0 3 0 0
• 0 0 1 1 1

If x is 0, we have a deadlock immediately. If x is 1, process D can run to completion. When D is finished, the available vector is 1 1 2 2 1. Now, A has ‘10211’ and ‘11221’ is available which together satisfies maximum need. So, A is finished and now ‘2 1 4 3 2’ is available, which can satisfy C. Once C is done, the available resources are 3 2 4 4 2, which can help B finish. So, x =1 will do.

Memory Compaction

A swapping system eliminates... Continue reading "Memory Management: Algorithms and Techniques" »

Sorting Algorithms and Their Bounds

Results like the Ω(nlgn) lower bound on all sorting via binary comparisons are difficult to establish. On the other hand, results like the O(n2) upper bound on INSERTION-SORT are easier to achieve. Explain adequately the difference in the “ease” of arriving at these results.

One result applies to all sorting algorithms that are based on binary comparisons (and so is harder to establish) while the other result is simply for one specific sorting algorithm in the same category. A more complete answer would involve an argument that rightly recognizes that the lower bound result is one that also applies to algorithms that exist and also those yet to be devised (yes, even those that may be written a hundred... Continue reading "Sorting Algorithms and Hash Tables: Explained and Compared" »

1. Half-Adder Truth Table and Circuit

For a two single-bit input, draw the truth table and corresponding circuit for the half-adder.

Truth Table

Where A and B are the input values, C is the output carry, and Σ is the sum.

(The question also requires a circuit diagram, which typically consists of an XOR gate for the Sum and an AND gate for the Carry.)

2. MIPS Overflow Handling Options

MIPS provides the following instruction options to handle overflow:

• add, addi, sub: These instructions cause an exception on overflow.
• addu, addui, subu: These instructions do not cause an exception on overflow.

3. MIPS Signed Addition Overflow Check

To avoid exceptions when performing signed addition, one can use addu and check for overflow... Continue reading "MIPS Overflow, Floating-Point Arithmetic, and Digital Logic" »