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

New jobs are admitted into the system
-- long-term or high-level scheduling

Once in the system, processes go through a number of state changes
-- short-term or low-level or CPU scheduling

A process is a "running program" or "program in execution"

Processes have a variety of states:


   RUNNING           READY                 WAITING (on I/O)
    STATE            STATE                  STATE

   +-----+                               +-----------------------+
   |     |     +--------------------+    |                 P2 P8 |
   | CPU | <== |="" p3="" |="" p6="" |="" p5="" |="" ...="">==><== i/o="" subsystem="" p13="" |="" |="" p11="" |="" +--------------------+="" |="" |="" +-----+="" +-----------------------+="" (a="" cpu=""

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" »

What is a Database?

A database is an organized collection of data, visualized as a container of information. The data is typically organized to model relevant aspects of reality. A Database Management System (DBMS) is a software package with computer programs that controls the creation, maintenance, and use of a database. It allows organizations to conveniently develop databases for various applications.

A database is an integrated collection of data records, files, and other objects. A DBMS allows different user application programs to concurrently access the same database. Typically, databases available on database servers are accessed through command-line or graphical user interface tools, referred to as front-ends; database servers are referred... Continue reading "Understanding Databases: Concepts and Key Components" »

The Counting Principles

Counting is the action of finding the number of elements in a finite set of objects. Here are the key principles:

1. The Stable-Order Principle: To count effectively, the list of words used (like one, two, three) must be in a repeatable order.
2. The One-to-One Principle: This involves assigning one, and only one, distinct counting word to each item being counted.
3. The Cardinal Principle: When the one-to-one and stable-order principles are followed, the number name given to the final object in a collection represents the total number of items in that collection.
4. The Order-Irrelevance Principle: This principle highlights that the order in which items are counted doesn't affect the total count.
5. The Abstraction Principle: These counting

Introduction

This program demonstrates how to draw a 3D cube in OpenGL and perform various transformations on it, including scaling, translation, and rotation about one axis.

Code

#include <GL/glut.h>

bool movingRight = false;
float xLocation = 0.0f;

void display() {
  glClearColor(1.0f, 0.0f, 0.0f, 1.0f);
  glClear(GL_COLOR_BUFFER_BIT);
  glLoadIdentity();
  glTranslatef(0.0f, 0.0f, -5.0f);
  glTranslatef(xLocation, 0.0f, 0.0f);
  glutWireCube(2.0f);
  glutSwapBuffers();

  if (movingRight)
    xLocation -= 0.05f;
  else
    xLocation += 0.05f;

  if (xLocation < -3.0f)
    movingRight = false;
  else if (xLocation > 3.0f)
    movingRight = true;
}

void reshape(int width, int height) {
  glViewport(0, 0, (GLsizei)width, (GLsizei)

PL/SQL Components for Race Management

The following PL/SQL objects demonstrate core database programming concepts, including custom functions for calculation, procedures for data manipulation and ranking, and triggers for auditing.

1. Calculating Global Time: The tempo_global Function

This function calculates the total elapsed time for a specific pilot by summing the duration of all stages recorded in the TempoEtapas table. It includes robust error handling using SQLCODE.

CREATE FUNCTION tempo_global (ID_piloto IN NUMBER)
RETURN NUMBER
IS
    soma_tempo NUMBER;
    coderro NUMBER;
    CURSOR c1 IS
        SELECT tempo_inicio, tempo_fim
        FROM TempoEtapas
        WHERE Piloto_idPiloto = ID_piloto;

BEGIN
    soma_tempo := 0;
    FOR item IN

1.  A network technician is configuring port Security on a LAN switch interface. The security policy requires host MAC Addresses to be learned dynamically, stored in the address table, and Saved to the switch running configuration. Which command does the technician Need to add to the following configuration to implement this Policy? Switch(config)# interface fa0/1 
   Switch(config-if)# switchport mode access 
   Switch(config-if)# switchport port-security

·Switch(config-if)# switchport port-security mac-address sticky

2. On which switch interface would an Administrator configure an IP address so that the switch can be managed Remotely?

·VLAN 1

3. Refer to the exhibit. Match the packets with Their destination IP address to the exiting interface on the router.

Understanding IGRP Protocol

What is IGRP?

IGRP is a Cisco-specific protocol developed in the mid-1980s.

IGRP Advantages Over RIP

IGRP calculates a composite metric from a set of route variables. It can be implemented on networks of up to 255 hops in diameter. Additional advantages include:

• Unequal-cost load sharing
• An update period three times longer than RIP's
• A more efficient update packet format

Unlike RIP, which uses UDP, the IGRP process is accessed directly from the IP layer as protocol 9.

IGRP Routing and Process Domains

Using domains allows isolating communications within one domain from others. IGRP uses two types: routing domains and process domains.

• Routing domains: Defined by Autonomous System (AS) boundaries and communicate via Exterior Gateway

OPENFLOW:

defines OpenFlow as the first standard communications interface defined between the control and forwarding layers of an SDN architecture. OpenFlow allows direct access to and manipulation of the forwarding plane of network devices such as switches and routers, both physical and virtual 

OPENFLOW CONFIG CONCEPTS

OF Capable Switch: Physical OF switch.  Can contain one or more OF logicalswitches.

OpenFlow Configuration Point: configurationservice

OF Controller: Controls logical switch via OFprotocol

Operational Context: OF logicalswitch

OF Queue: Queues of packets waiting forforwarding

OF Port: forwarding interface. May be physical orlogical.

OF Resource: ports, queues, certificates, flow tables and other  resources of OF capableswitches 

Discuss the advantages of address aggregation (summarization) with respect to routing table size, routing update exchange, and routing optimization?

Route aggregation and subnetting shrink the size of routing tables used by routers. Without CIDR, a router must maintain many individual entries for routes within the same network. CIDR guarantees more efficient routing and reduces the number of CPU cycles when updating a routing table. It also reduces router memory requirements.

What are the key characteristics or requirements that should be fulfilled by any routing protocol?

A routing protocol should guarantee loop-free paths, calculate multi-hop optimal paths, use simple or composite network metrics, be scalable, converge rapidly, use network resources... Continue reading "Advantages of Address Aggregation and Key Characteristics of Routing Protocols" »