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

Chapter 1: Fundamentals of Numbers

Numbers and Notation

We begin by talking about numbers. This may seem rather elementary, but it does set the scene and introduce a lot of notation. In addition, much of what follows is important in computing.

1.0.1 Integers: Definition and Properties

We begin by assuming you are familiar with the integers:

Sometimes called the whole numbers, these are just the numbers we use for counting. To these integers we add zero (0), defined as:

Once we have the integers and zero, mathematicians create negative integers by defining (-n) as the number which, when added to n, gives zero. So, n + (-n) = (-n) + n = 0. Eventually, we simplify writing n + (-n) = 0 to n - n = 0. We now have the set of positive and negative integers:... Continue reading "Fundamentals of Integers, Primes, and Factorization" »

B-Trees

B-trees are tree data structures commonly found in database and file system implementations. Unlike standard binary search trees, each node in a B-tree can have more than two children.

Binary Trees

A binary tree is a data structure where each node has at most two children: a left child and a right child. If a child reference is null, it is called an external node; otherwise, it is an internal node.

Hashing Functions

Hashing refers to a method used to generate keys that uniquely represent documents, records, or files. A hash is the result of this function. A fundamental property of hashing is that if two results are different, the inputs that generated them must also be different. Note that collisions can occur, as the range of possible keys... Continue reading "Essential Data Structures and Runtime Concepts Explained" »

Workshop Planning and Control

Planning

Planning aims to coordinate workload with available resources and equipment to perform the required services in production, or the quantity and quality required, at the lowest cost and meeting the deadline.

Organization

Methods, order, time > budget OR > acceptance > delivery term.

Workload

The workload is the amount of work available for the workshop, consisting of the OR already issued and accepted by clients.

Production Capacity

Production capacity is the amount of work that the workshop can perform based on available operators, equipment, and facilities.

The workload can be defined in a working or time to implement and scale, or are uncertain about working with an open OR work involving a diagnostic... Continue reading "Workshop Workload and Production Capacity Management" »

funcition min-max(pos,out-eval,out-best_move,in-whomoves,in-max_level){max=-?;min=?;best_move=0;if(level==0){evaluation=eval_(pos);best_move=0; return;}else{foi(i=0;i<num_succ(i);++i){succi=succesor(i);if(whomoves=='max'){min-max(succi,evaluation,best_move,'min', max_level-1);if(evaluation>max){max=evaluation; best_move=i;}}else{min-max(succi,evaluation,best_move,'max', max_level-1);}if(evaluation<min){min=evaluation;best_move=i;}}}}

funcition ??(pos,level,quien_juega,*eval,mejor_move,?,?){if(terminal(pos)||(level==0){*eval=eval(pos);return;}n_succ= num_succ(pos);for(i=0;i<n_succ;++i{if(quien_juega=='max'){succi=succesor(pos,i);??(succi,level-1,'min',evali, mejor_movi,?,?);if(evali>?){?=evali;*eval=?; *mejor_move=i;}if(?>?)... Continue reading "Prolog Predicates & Game AI Algorithms" »

Internal vs. External Files in Data Processing

External File: A data structure used to store information in secondary memory (e.g., on a hard drive or SSD).

Internal File: A variable representing a data structure in main memory used to process information within an application.

Understanding File Organization Types

File organization refers to the way data records are stored on a storage medium. The type of organization is determined when the file is created. The primary types are:

• Sequential Organization

  In a sequential file, records are written or recorded consecutively, often in adjacent physical positions, following the same order in which they were introduced. To access the n-th record, you must first read the preceding n-1 records. This results

Memory Management Definition

Memory management is the process of:

• Bringing programs into the main memory to be executed by the processor.
• Dynamically dividing the part of main memory to accommodate multiple processes.
• Allocating memory efficiently for packaging processes, preventing the processor from being idle.
• Enabling the execution of a larger program than is available in real memory.

Memory Management Requirements

1. Relocation

• Ability to move a program from one region to another of the main memory without invalidating the memory references.
• The processor hardware and operating system translate the memory references' addresses to the final physical memory addresses.

2. Protection

Each process must be protected from unwanted interference from other... Continue reading "Memory Management Concepts and Techniques" »

Network Management Fundamentals

Network management consists of deciding how to configure the network, joining teams, determining what permissions users will have, and handling all tasks related to the operation of the network.

Client/Server Network Architecture

A client/server network consists of the following components:

• Server: Network equipment more powerful than the others, acting as the central controller. The server sets up the network and its policies.
• Client Computers: Devices connected to the server that depend on it for resources and services.
• Shares (Resources): Devices like printers, faxes, and other peripherals used by all network users.
• Connection Devices: Equipment that connects all the computers composing the network (e.g., switches,

Database Terminology and Structure

Tip: A set of characters with some meaning can be numeric, alphanumeric, or alphabetical.

Information: Ordered set of data that are managed according to user needs.

Field: It is the smallest unit to which we refer to in a program.

Record: Collection of equal fields or different types.

File: Collection of records stored homogeneously following a structure.

Database: Collection of interrelated files that typically contain information about a particular company.

DBMS: A computer-based system (software) that manages a database or a collection of databases or files.

Uses and Functions of a DBMS

• Allow users to access and manipulate the database.
• Provide administrators with the tools to perform maintenance and data management.

Fuzzy Logic

Fuzzy logic extends Boolean logic, allowing intermediate values between TRUE (1) and FALSE (0), such as MAYBE (0.5). A fuzzy logic value can be any value within the range of 0 to 1. This logic incorporates statistical concepts, especially in inference. Fuzzy logic implementations enable control devices to handle indeterminate states, allowing for the evaluation of non-quantifiable concepts. Practical examples include evaluating temperature (hot, warm, medium), happiness (bright, happy, apathetic, sad), and the veracity of an argument (absolutely right, right, counter-argumentative, inconsistent, false, totally wrong).

Fuzzy logic is a research area focused on uncertainty treatment and a family of mathematical models dedicated to... Continue reading "Understanding Fuzzy Logic and Backpropagation in Neural Networks" »

Counting Frequencies Algorithm in C++

This C++ implementation demonstrates a method for counting the frequencies of input integers while maintaining a sorted list of unique values. It utilizes custom functions for insertion and shifting elements.

Data Structure Definition

#include <iostream>
#include <vector>
using namespace std;

struct lon{
    int dig, vez; // digit, count (vezes)
};

Helper Functions: Shifting and Positioning

The mover function shifts elements to make space for a new insertion, and donde_poner finds the correct sorted position for a new digit.

void mover(vector<lon>& a, const int& pos, const int& ini){
    for(int i = pos; i > ini; --i){
        a[i].dig = a[i-1].dig;
        a[i].vez = a[i-1]