Notes, summaries, assignments, exams, and problems for Computer science

Refer to the exhibit. When a static IP address is being configured on the host, what address should be used for the default gateway

Computer science4.69 KB

HOSTàROUTER: 1

ENABLE

CONFIGURE TERMINAL

INTERFACE GIGABITETHERNET 0/0

IP ADDRESS 192.168.1.126 255.255.255.224

NO SHUTDOWN

EXIT

INTERFACE GIGABITEETHERNET 0/1

IP ADDRESS 192.168.1.158 255.255.255.240

NO SHUTDOWN

HOSTàSWITCH 2

ENABLE

CONFIFURE TERMINAL

INTERFACE VLAN 1

IP ADDRESS 192.168.1.157 255.255.255.240

NO SHUTDOWN

HOST/ROUTER 3

EXIT (LLEGAR AL CONFIGURE TERMINAL)

HOSTNAME MIDDLE

ENABLE SECRET CISCO

LINE CONSOLE 0

PASSWORD CLASS

LOGIN

EXIT

SECURITY PASSWORD MIN-LENGTH 10

SERVICE PASSWORD ENCRYPTION

IP DOMAIN-NAME CISCO

CRYPTON KEY GENERATE RSA

1024

EXIT

USERNAME CICLOS

LINE VTY 0 4

LOGIN LOCAL

TRANSPORT INPUT SSH

EXIT

INTERFACE GIBABITEETHERNET 0/0

IPV6 ADDRESS 2001:DB8:ACAD:A::1/64

IPV6 ADDRESS FE80::1 LIN

EXIT

GIBABITETHERNET 0/1

IPV6 ADDRESS 2001:DB8:ACAD:B::1/64

IPV6

...
Continue reading "Refer to the exhibit. When a static IP address is being configured on the host, what address should be used for the default gateway" »

Understanding Cache Memory and CPU Hazards

Computer science2.83 KB

1. General Questions (35%)

1.1. (5%) What is the difference between a write-back cache and a write-through cache?

Write-back cache: A store only writes data to the cache and marks the corresponding line as dirty. The modified line is written to the lower level of the memory hierarchy only when it is evicted.

Write-through cache: Data is written to the caches and the memory every time a store is executed.

1.2. (15%) Name the 3 Cs in cache misses and provide a brief explanation for each C.

Compulsory miss: A cache miss caused by the first access, a cold start effect.

Capacity miss: A cache miss due to the capacity limitation. Even with full associativity, it cannot accommodate all the working sets of an application.

Conflict miss: A cache miss that...

Continue reading "Understanding Cache Memory and CPU Hazards" »

Introduction to Computer Networks

Computer science2.57 KB

Servers

A server stores data to be used by other computers on a network. A server could be a specialized machine, or it can be a normal PC running server software. The server stores data and responds to requests for data or files, such as web pages.

Types of Server

There are many different types of servers. Some popular examples follow.

Web Servers

Web servers host websites and generally handle requests for static information such as HTML pages or images. They are used to manage the website on the server and often include FTP software, which can easily host and share large files. The Apache web server is a popular type of open-source web server software.

Application Servers

Many websites are classed as web applications, which contain programming and...

Continue reading "Introduction to Computer Networks" »

Revit Elements and Tools: A Comprehensive Dictionary

Computer science4.2 KB

Annotation Elements

Used to notate and clarify the information presented.

Annotate Ribbon

Buttons: Aligned, Linear, Angular, Radial, Diameter, Arc Length, Spot Elevation, Spot Coordinate, Spot Slope, Detail Line, Region, Component, Revision Cloud, Detail Group, Insulation, Text, Check Spelling, Find/Replace, Tag By Category, Tag All, Beam Annotations, Multi-Category, Material Tag, Area Tag, Room Tag, Space Tag, View Reference, Tread Number, Keynote, Duct Legend, Pipe Legend, Color Fill Legend, and Symbol.

Annotate Ribbon Tab

Panels: Dimension, Detail, Text, Tag, Color Fill, and Symbol.

Application Menu

File access and management tools are grouped in this menu. This menu is designated by the large ‘R’ in the top left corner of the Revit screen....

Continue reading "Revit Elements and Tools: A Comprehensive Dictionary" »

Machine Learning Algorithms: Concepts and Criteria

Computer science4.32 KB

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
...
Continue reading "Machine Learning Algorithms: Concepts and Criteria" »

Data Link Layer Fundamentals: MAC, LLC, and Ethernet

Computer science8.44 KB

Data Link Layer Fundamentals

1. MAC vs. LLC Sublayers: Motivation

The Data Link Layer (Layer 2) is crucial for connecting to upper layers and managing device communication within a local network. It employs specific addressing schemes to identify devices and uses frames to group bits for transmission. This layer is divided into two sublayers:

  • Logical Link Control (LLC):
    • Establishes the connection with upper layers, integrating with network layer protocols.
    • Identifies the network layer protocol (e.g., IPv4, IPv6) for the encapsulated packet.
    • Remains independent of the physical equipment, providing a consistent interface to the network layer.
  • Media Access Control (MAC):
    • Responsible for bringing data onto and off the physical media.
    • Handles data encapsulation,
...
Continue reading "Data Link Layer Fundamentals: MAC, LLC, and Ethernet" »

C Linked List Student Data Management Systems

Computer science14.42 KB

C Linked List Implementations for Student Data

This document presents two distinct C language implementations for managing student records using linked lists: a singly linked list and a circular linked list. Both examples demonstrate fundamental data structure operations such as adding, deleting, searching, and displaying student information.

1. Singly Linked List Implementation

This section details a student management system built using a singly linked list. Students are stored in ascending order of their roll numbers, and duplicate roll numbers are prevented.

Core Structure and Global Head

The Student structure defines the data for each node, including roll number, total marks, average, and a pointer to the next student. The head pointer always...

Continue reading "C Linked List Student Data Management Systems" »

Core Concepts of Industrial Automation: TIA, SCADA, and DCS Systems

Computer science23.38 KB

Industrial Automation Fundamentals

Defining Industrial Automation and Its Impact

Industrial automation refers to the use of control systems, such as computers, robots, and Programmable Logic Controllers (PLCs), to handle processes and machinery in industries, significantly reducing human intervention. It fundamentally enhances efficiency, precision, and safety in modern manufacturing.

The Revolution in Manufacturing

Automation has revolutionized manufacturing through several key areas:

  • Increased Productivity: Automation enables 24/7 operations, substantially boosting output and throughput.
  • Improved Quality: Consistent, repeatable processes reduce errors and ensure uniform product quality.
  • Cost Efficiency: Automation reduces reliance on manual labor
...
Continue reading "Core Concepts of Industrial Automation: TIA, SCADA, and DCS Systems" »

Core Concepts in Artificial Intelligence: Search Algorithms and Knowledge Systems

Computer science15.96 KB

Heuristic Search Techniques Explained

Heuristic search techniques use intelligent estimations to find solutions efficiently. These methods help in decision-making by prioritizing the most promising paths.


1. Greedy Best-First Search (GBFS)

  • Always chooses the next step that appears closest to the goal.
  • Ignores the cost already traveled.

Example:

A person finding the exit of a maze by always taking the path that looks shortest.

⚠ Risk: May lead to dead ends.


2. A* Search Algorithm

  • Balances actual cost and estimated cost to reach the goal.
  • Ensures the shortest and most efficient path.

Example:

Google Maps finds the best route by considering both distance already covered and the remaining estimated distance.

✅ Optimal and efficient.


3. Hill Climbing Algorithm

  • Moves
...
Continue reading "Core Concepts in Artificial Intelligence: Search Algorithms and Knowledge Systems" »

Fundamentals of AI Search Algorithms and Problem Solving

Computer science15.78 KB

AI Search Problem Fundamentals

Understanding different types of search problems is crucial in Artificial Intelligence.

  • Deterministic, fully observable: Classical search problem.
  • Non-deterministic and/or partially observable: Requires different approaches beyond classical search.
  • Non-observable: Sensorless problems.
  • Unknown state space: Exploration problem.

Basic Search Concepts

  • State Space: The set of all possible states reachable from the initial state.
  • Initial State: The starting state.
  • Actions: Possible operations available in a state.
  • State Transition Function: Determines the resulting state after performing an action.
  • Goal State: A desired state to be reached.
  • Step Cost: The cost associated with performing an action.
  • Solution: A sequence of actions
...
Continue reading "Fundamentals of AI Search Algorithms and Problem Solving" »