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

Essential Software Design Patterns and Testing Techniques

Computer science6.26 KB

Domain Model

  • Shows concepts only: classes, attributes, associations, and multiplicities.
  • No methods, no UI, and no controllers are included.
  • Purpose: To understand the real-world objects involved in the system.

Use Case Model (Module 6)

  • Focuses on Actor ↔ System interaction.
  • Uses the Verb + Noun naming convention.
  • Format: Defines Actor steps versus System steps.
  • Use cases serve as input for sequence diagrams, which inform class diagrams.

UML Class Diagram (Module 7)

  • Class Components: Name, attributes, and methods.
  • Association: Line connecting classes with multiplicity (1, 0..1, *, 1..*).
  • Inheritance: Represented by an open triangle arrow symbol.
  • Interface: Indicated by the «interface» stereotype.
  • DCD (Design Class Diagram): Explicitly includes methods
...
Continue reading "Essential Software Design Patterns and Testing Techniques" »

Understanding Network Switches, IP Addressing, and Key Terms

Computer science2.96 KB

Network Switches

Managed vs. Unmanaged Switches

Managed Switch: Configurable via software, supports security and communication settings. Used in large networks (enterprise, universities).

Unmanaged Switch: Fixed configuration, hardware-only, cannot be configured.

Ethernet & Speed

  1. Fast Ethernet: 100 Mbps.
  2. Gigabit Ethernet: 1 Gbps.

Ethernet Protocol

Divides data into frames, encapsulates IP addresses, performs error detection.

Ports

  1. Console Port: Connects PC/laptop to configure switch.

Communication Modes

  • Simplex (Half Duplex): One-way communication at a time.
  • Duplex (Full Duplex): Two-way communication simultaneously.

Bandwidth

  1. Maximum transmission speed of a network, determined by signal frequency range.

IP Addressing & Subnets

  1. IP Address: Identifies
...
Continue reading "Understanding Network Switches, IP Addressing, and Key Terms" »

Processor Architectures: RISC, CISC, and Micro-operations Demystified

Computer science3.23 KB

CISC: Complex Instruction Set Computer

The Complex Instruction Set Computer (CISC) architecture packs more complex instructions into the processor. Some instructions might perform several tasks in one go. This design reduces the number of instructions a programmer needs to write but makes the CPU's internal logic more complicated and potentially slower for some tasks.

  • Think: “Do more, but it might take longer.”

CISC is commonly found in x86 architectures (e.g., typical laptops or desktops), where compatibility and code density often matter more than raw efficiency.

RISC vs. CISC: Architectural Approaches

Both RISC (Reduced Instruction Set Computer) and CISC architectures aim to solve the same problem—efficient program execution—but they...

Continue reading "Processor Architectures: RISC, CISC, and Micro-operations Demystified" »

Operating System Memory Management and Deadlock Prevention

Computer science6.41 KB

Operating System Memory Management Fundamentals

The Operating System (OS) is responsible for crucial memory decisions: determining which programs reside in memory, where they are placed, how memory is protected, and what actions to take when memory resources are exhausted.

Parkinson's Law Applied to Computing

Parkinson’s Law states that programs expand to fill the memory available to hold them.

Models for Organizing Memory

Three primary models exist for structuring memory:

  • Model A (User on Top, RAM on Bottom):
    • Pros: Fast execution.
    • Cons: No protection (e.g., used in MS-DOS).
  • Model B (ROM on Top, User on Bottom):
    • Pros: OS protected.
    • Cons: Slow and not flexible.
  • Model C (Drivers at Top, User in Middle, RAM at Bottom):
    • Pros: Fast and secure.
    • Cons: Complex
...
Continue reading "Operating System Memory Management and Deadlock Prevention" »

Dafny Verification and Formal Methods Exam Review

Computer science644.93 KB

Dafny Concepts and Preconditions

Preconditions are required; postconditions are ensured.

Methods do not change given parameters unless a modifies clause is present.

Old(E) has the value of E at the start of the method.

Fresh(E) as a postcondition shows that E was created by M.

With if statements, Dafny works normally. With if-case statements, you introduce nondeterminism (hard; you need to prove all options).

Classes have instance variables and methods, which need clear contracts.

A trait is an abstract class, from which classes inherit (like a template in Java). Example: trait A; class B extends A

Class invariants must hold before and after any method. Use ghost predicate Valid().

Behavioral Subtyping: When a class A inherits from another class/trait,...

Continue reading "Dafny Verification and Formal Methods Exam Review" »

Software Quality Assurance: Strategies, Testing, and Design

Computer science16.47 KB

Strategic Approach: Begins with technical reviews to identify errors early. Moves from component-level (unit testing) to system-level integration. Different strategies suit conventional software, object-oriented software, and web applications.

Strategies for Different Systems

  • Conventional Software: Focus on module testing and integration.
  • Object-Oriented Software: Emphasis shifts to classes, attributes, and their collaborations.
  • Web Applications: Covers usability, interface, security, and environmental compatibility.

Key Strategic Issues: Define requirements quantitatively before testing. Develop robust software with self-testing capabilities. Use iterative testing cycles to refine quality. Employ independent testers alongside developers.

Regression

...
Continue reading "Software Quality Assurance: Strategies, Testing, and Design" »

Database Fundamentals: Normalization, Storage, and SQL Queries

Computer science4.08 KB

This document summarizes key concepts and solutions from previous database exam questions.


Relational Schema with Functional Dependencies

  • Schema: R(A, B, C, D, E, F)
  • Dependencies: C → F, E → A, EC → D, A → B
  1. Candidate Keys: CE
  2. Prime Attributes: C, E
  3. Second Normal Form (2NF):
    • No, because of partial dependencies:
      • C → F (partial dependency)
      • E → A, B (partial dependency)

EMP_DEPT Table Analysis

  1. Functional Dependencies:
    • Ssn → Ename, Bdate, Address, Dnumber, Dname, Dmgr_ssn
    • Dnumber → Dname, Dmgr_ssn
    • Dmgr_ssn → Dnumber, Dname
    • Dname → Dnumber, Dmgr_ssn
  2. First Normal Form (1NF):
    • Split names into first_name and last_name.
  3. Second Normal Form (2NF):
    • Already in 2NF because there are no partial dependencies.

EMP_PROJ Table Normalization

  1. Functional Dependencies:
...
Continue reading "Database Fundamentals: Normalization, Storage, and SQL Queries" »

Mastering Program Flow: Conditional and Iteration Structures

Computer science4.62 KB

Conditional Control Structures

Conditional control structures dictate the flow of execution by allowing specific blocks of code to run only when certain conditions are met.

1. The If Statement

The If statement executes a block of code only if the specified condition evaluates to true. Otherwise, the block is skipped entirely.

Syntax:

if (condition) {
    // statements (If Block)
}
// other statements

Note: A flow chart typically illustrates the execution path based on the condition.

2. The If-Else Statement

If the condition is true, the If block is executed. If the condition is false, the alternative Else block is executed.

Syntax:

if (condition) {
    // statements (If Block)
} else {
    // statements (Else Block)
}

3. The Else-If Ladder Statement

The...

Continue reading "Mastering Program Flow: Conditional and Iteration Structures" »

C Programming: Tokens, Operators, and Logic

Computer science2.55 KB

Tokens

In programming, a token is the smallest meaningful element in code. They are the building blocks of a language's syntax. Common token types include:

  • Keywords: Reserved words like if, else, while, and int (for declaring integers).
  • Identifiers: Names given to elements like variables (e.g., sum), functions, and arrays.
  • Constants: Unchanging values during program execution (e.g., 3.14 for pi).
  • Operators: Symbols for mathematical or logical operations (e.g., + for addition).
  • Separators: Punctuation like commas (,), semicolons (;), and braces ({}).

Example: int sum = 10 + 5;

In this line, int is a keyword, sum is an identifier, = is an operator, 10 and 5 are constants, and ; is a separator.

Arithmetic Operators

C has nine arithmetic operators for basic...

Continue reading "C Programming: Tokens, Operators, and Logic" »

Implementing Logic Functions with Decoders and MUXs

Computer science3.54 KB

Implementing Boolean Functions with Truth Tables

Problem 1: Implement the following function F(A, B, C) = Σ(2, 5, 6, 7) using a truth table with:

  • a. Decoder
  • b. Multiplexer

Truth Table for Function F(A, B, C)

ABCF
0000
0010
0101
0110
1000
1011
1101
1111

a. Decoder Implementation

A decoder is used to select one of the outputs based on the input combination. In this case, we have 3 inputs (A, B, C) and 8 possible combinations. The truth table shows that F = 1 for input combinations (010), (101), (110), and (111), and F = 0 for all other combinations. To implement this, we connect the corresponding decoder outputs to an OR gate.

b. Multiplexer Implementation

A multiplexer (MUX) selects one of the input lines and passes it to the output. The selection is controlled...

Continue reading "Implementing Logic Functions with Decoders and MUXs" »