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

1. Device Type in the Central Area

Which term correctly identifies the device type that is included in the central area?

2. Factory Default Settings

All devices shown in the image have factory default settings. How many broadcast domains are represented in the topology shown?

3. Appropriate Device Type for Interference

The most appropriate type for use in an environment where there are multiple sources of interference (EMI or RFI) corresponds to:

4. PDU in the Transport Layer

The PDU in the transport layer of the OSI model is:

5. Development of IPv6

What is the main reason for the development of IPv6?

6. Application Layer Protocol for File Transfer

What protocol in the application layer is commonly used to facilitate the transfer of files between a client... Continue reading "Understanding Network Devices and Protocols in IT" »

Decision Trees

Key Characteristics

• Advantages:
  • Easy to implement
  • Can extract rules
  • Non-incremental (more efficient and practical, without backtracking)
• Disadvantages:
  • Objective function must be discrete
  • Primarily for classification problems

Stop Criteria

• All examples belong to the same class
• All samples have the same value for attributes
• The gain on each split is insignificant
• The number of samples has reached a certain limit

Overfitting Problem

If the number of nodes is too large, decisions are made based on very small partitions of the samples, which reduces generalization ability.

Formulas

Entropy (Ent):

Ent(S) = -(p+ * log2(p+)) - (p- * log2(p-))

Where:

• S is the set of examples for that node.
• p+ is the probability of positive outcomes.
• p- is the probability

Operating System Process Management

Process States

Different states a process can be in:

• Execution: The process is executing instructions and has been granted CPU time.
• Ready: A process is ready to be executed, waiting for its turn to use its time slice and access system resources.
• Blocked: The process is held or blocked for some reason, waiting for an event (e.g., I/O completion).

Process State Transitions

Transitions between process states:

• Transition A: Occurs when a running process needs a resource, signal, etc., to continue execution and moves to the blocked state.
• Transition B: Occurs when a process has used its allocated CPU time slice and moves from execution back to the ready state.
• Transition C: Occurs when a process in the ready state moves

Memory Paging Fundamentals

Paging consists of dividing physical memory into fixed-size sections called frames and logical memory into sections of the same size called pages.

The paging system solved the problem of allocating blocks of equal size using physical memory called page frames.

Page Faults and Replacement

A page fault occurs when referring to a page that is not loaded in any page frame. A page replacement (or page out) is required because the total virtual address space of all processes exceeds the size of physical storage.

Functional Requirements

• Administration of address space.
• Address translation.
• Management of physical memory.
• Memory protection.
• Shared memory.
• Load monitoring system.
• Mapping files into memory, program execution on remote nodes,

Page Fault Handling

• Hardware triggers the trap and saves the Program Counter (PC).
• The trap handler (interrupt routine) saves the registers.
• The OS detects a page fault.
• The OS searches for a free page frame. If none are available, it selects a victim page and evicts it.
• The OS initiates I/O for the page that triggered the fault.
• Once the disk interrupt handler notifies that the page has arrived, the process is scheduled for execution again.

Page Table Management

During each context switch, the current page table must be saved in the Process Control Block (PCB) and the new process's table must be loaded. Tables can be stored in:

Registers

• Provides faster access.
• If there is significant RAM, the table will have too many entries to fit in registers.
• Every

Page Replacement Algorithms

• Random: The least efficient method, though simple to implement.
• FIFO (First-In, First-Out): Replaces the page that has resided in real memory the longest. It is easy to implement using a list to track page order.
• LRU (Least Recently Used): Replaces the page that has not been referenced for the longest period. It is highly effective because past behavior is often a reliable indicator of future needs.
• NUR (Not Used Recently): Selects a victim page cyclically, specifically targeting pages that have not been accessed or modified within a recent time window.
• LFU (Least Frequently Used): Replaces the page with the lowest reference count. This requires maintaining reference counters for each page.
• The Clock: A variant of LRU

1) Entering Configuration Screen

To enter the configuration screen from runtime mode:

• It depends on the configuration of the last application downloaded.

2) Dip Switch Settings

According to the dip switch settings shown in the figure:

• Starting from the CF card is disabled, you can download, and forced closure is disabled.

3) Screen Ventilation

To facilitate the ventilation of the screen, the manufacturer recommends a minimum distance of 100mm from any adjoining structure or equipment.

4) XBT-G LED Indicator

If the LED on the right side of the XBT-G screen lights orange, this means:

• Backlight is off.

5) COM1 Connector (SUB D25)

The female SUB D25 connector, COM1, of the XBT-G screen is used for:

• Serial communication with the PLC.

6) XBT-G Back Protection

The

Packet Switched Networks

IP Protocol

The IP protocol is a connectionless protocol used by both the origin and the destination for data communication over a packet-switched network.

IP Address

An IP address is a 32-bit integer that identifies a network interface. It is classified by type according to the value of the first byte.

Available Private Addresses

• Class A: 10.0.0.0
• Class B: 172.16.0.0 - 172.31.0.0
• Class C: 192.168.0.0 - 192.168.255.0

Netmask

A 32-bit integer associated with an IP address that indicates which bits belong to the network portion (binary 1) and which belong to the host (binary 0).

Fragmentation

The IP protocol includes fragmentation to fit the Maximum Transmission Unit (MTU). This divides an IP packet into smaller segments using the... Continue reading "Packet and Circuit Switched Networks: Core Concepts" »

Memory Management in Linux

Page Allocation Mechanism

Linux defines a mechanism for dealing with contiguous blocks of pages corresponding to blocks of contiguous page frames in main memory. For this, it uses the buddy system, where the kernel maintains a list of groups of contiguous page frames of fixed size.

Page Replacement Algorithm

The Linux page replacement algorithm is based on the Clock algorithm (also known as NUR or NRU), which associates a use bit and a modification bit with each page in main memory.

Memory Management in Solaris

Paging System

Machine-Independent Data Structures

For paged virtual memory, Solaris uses a series of data structures that are independent of the machine:

• Page Table: Each process has a table with an entry for every

Computer and Program Concepts

Program: A set of instructions to the computer written in a language understood by it.

Computer: Electronic machine.

Byte: The amount of information used by a computer to represent a character; a byte is a string of 8 bits.

Machine code: Binary encoding of a set of instructions.

Languages and Translators

Assembly language: A language that uses mnemonic codes to specify hardware operations.

Mnemonic code: An easy-to-remember word that represents a task to be performed by the processor.

High-level language: Languages that use terminology closer to human language.

Compiler: A program that translates a program written in a high-level language into machine language.

Linker: A program tasked with incorporating the library functions... Continue reading "Fundamentals of C Programming and Computer Concepts" »