Notes, summaries, assignments, exams, and problems

1. Task Constraints in Real-Time Systems

In real-time systems, task constraints refer to the limitations or requirements that must be met for timely and correct execution. The key constraints include:

• Time constraints (hard and soft deadlines)
• Precedence constraints (task dependencies)
• Resource constraints (limited CPU, memory)
• Synchronization constraints (shared resource management)

Failing to meet these constraints can result in system failure in critical applications like aircraft control and medical monitoring systems.

2. EDD (Earliest Due Date) Algorithm Explained

The EDD (Earliest Due Date) algorithm is used for aperiodic task scheduling, where tasks are executed in order of their deadlines. The task having the earliest due date is given the

Negotiation Strategies: A Comprehensive Overview

Understanding Your Interests

• Your Interests: List them. What would be a great deal for you? Why do you want these things? What is the relative value of the different issues for you?
• Options: What are the range of options you have on each interest?

Alternatives and Communication

• Your Alternatives: What happens for you if there is no deal? What is your BATNA (Best Alternative To a Negotiated Agreement)? What is the worst possible deal you would still accept?
• Your Communication: What will you ask/what will you convey? What information do you need to get? What questions should you ask to test them? What facts can you use to convince? How to best frame them? What tough questions are they likely to ask?

Chemical Reactions and Equations

1. Chemical Reaction Definition

The process in which a substance undergoes change to produce new substances with new properties is known as chemical reaction, e.g., magnesium carbonate when heated produces magnesium oxide and carbon dioxide (i.e., new substances with new properties).

A chemical change is generally accompanied by a change of state, change of colour, evolution of a gas, or change of temperature, etc.

2. Chemical Equation Definition

The qualitative representation of a chemical reaction in a shorthand or concise form, in terms of symbols and formulae, is called a chemical equation.

3. Skeletal Chemical Equation

A chemical equation written in the form of symbols and formulae is called a skeletal chemical

Historical Source Evaluation

Understanding Historical Source Evaluation

Timeline of Key Events (American & French Revolutions)

• American War of Independence: 1775 - 1783 (French involvement)
• Assembly of Notables: 22 Feb - 25 May 1787
• Lit De Justice: 6 Aug 1787, 8 May 1788
• Day of Tiles: 10 June 1788
• Harvest Crisis: 1788
• Pamphlet War: 1788-1789
• Cahiers De Doléances: 1789 (List of grievances)
• Rural Revolt: March 1789
• Réveillon Riots: 27-28 April 1789
• Estates-General: May 1789
• Declaration of the National Assembly: 17 June 1789
• Tennis Court Oath: 20 June 1789
• Royal Session: 23 June 1789
• Necker’s Dismissal: 11 July 1789
• Fall of the Bastille: 14 July 1789
• Municipal Revolutions: 13-17 July 1789
• The Great Fear: 20 July - 6 Aug 1789
• Night of 4 August: Abolition of

Lecture 1: Moore's Law

Moore's Law: The number of transistors on microchips doubles every two years.

Lecture 2: Logic Gates

AND, OR, and NOT gates are universal.

Logic word problem steps:

Example: In a bank, there were four employees: the bank manager, assistant manager, teller, and the security guard. The bank has a single vault for the storage of their money. This vault was designed so that it needs four signals to open it. These four signals are from the bank manager, assistant manager, teller, and the security guard. For the vault to open, it needs the following conditions:

1. No single employee can open the vault.
2. It can be opened with three employees as long as one of them is the manager.
3. It can be opened by the manager together with the assistant

Understanding Ancient Mesoamerican Civilizations

Delve into the rich history and complex structures of ancient Mesoamerican societies. This document highlights key aspects, from their societal organization and agricultural innovations to their lasting cultural and historical impact.

Key Aspects of Mesoamerican Societies

• Classic Period Decline: Societal Shifts

  An understanding of the societal, political, and economic shifts following the Classic period is crucial to grasp its consequences.

• Monumental Architecture and Social Hierarchy

  Analyzing how the construction of large-scale structures reveals the power structures and social hierarchies within Mesoamerican societies.

• Mesoamerican Calendars: Culture and Daily Life

  Explaining the importance of the

Passive Voice

• Active: The secretary types the letter.
• Passive: The letters are typed by the secretary.

• Future Simple: Will type / Will be typed
• Past Simple: Typed / Were typed
• Modal: Can type / Can be typed
• Present Continuous: Am/is/are being + past participle
• Present Perfect Simple: Have / has been + past participle

Impersonal Voice

1. It is thought/said/believed + that...
2. Subject + is considered/thought/said + to be...

The Causative (get/have + object + verb 3rd form)

Often associated with professions. Changes depending on the verbal tenses.

Ex: The painters painted my house / I had my house painted by the painters.

Wish Clauses

1. Wish + subject + past simple (about the future): Not reality, but you want it to happen. Ej: I wish I were a rich man.
2. Wish + could

A stack is a fundamental data structure in computer science that follows the Last In, First Out (LIFO) principle. This means that the last element added to the stack is the first one to be removed. You can think of it like a stack of plates: you can only add or remove the top plate.

### Key Concepts of a Stack:

1. Basic Operations:
   - Push: This operation adds an element to the top of the stack.
   - Pop: This operation removes the element from the top of the stack and returns it.
   - Peek (or Top): This operation returns the top element of the stack without removing it.
   - IsEmpty: This operation checks whether the stack is empty.

2. Implementation:
   Stacks can be implemented using arrays or linked lists. Here are the details for... Continue reading "Mastering Stacks, Deques, Trees, and Graph Data Structures" »

DFA for Strings with Odd 'a's and Even 'b's

This section details the construction of a Deterministic Finite Automaton (DFA) to accept strings composed of 'a's and 'b's, specifically those with an odd number of 'a's and an even number of 'b's.

Language Characteristics:

• Odd number of 'a's: At least one 'a', and the total count must be odd.
• Even number of 'b's: At least zero 'b's, and the total count must be even.

Examples of String Acceptance:

Let L be the language of accepted strings.

• abbaabbaabb → Reject (Odd 'a's, Odd 'b's)
• aabaabaab → Reject (Even 'a's, Odd 'b's)
• ababab → Reject (Even 'a's, Odd 'b's)
• bababa → Reject (Even 'a's, Odd 'b's)
• bbaaabbaaabbaaa → Accept (Odd 'a's, Even 'b's)
• aaabbaaabbaaabb → Accept (Odd 'a's, Even 'b's)

DFA for Decimal