RAM (Random Access Memory) Types and Functions

RAM (Random Access Memory) is a type of memory that can be accessed randomly, meaning you can access any byte of memory without going through the preceding bytes. RAM is the most common type of computer memory and other devices such as printers.

Types of RAM

There are two basic types of RAM:

  • DRAM (Dynamic RAM)
  • SRAM (Static RAM)

The two types differ in the technology used to store data. Dynamic RAM needs to be refreshed thousands of times per second while static RAM does not need to be refreshed as often,

Read More

Client-Server Computing and Windows Server Administration

  1. Describe the components and purpose of a client server computing environment. Client/server is a program relationship in which one program (the client) requests a service or resource from another program (the server). Windows NT established a new file system called NTFS.
    What were the two major versions of Windows NT?

    Server and Workstation

    How did they differ in function?

    Server acted as a server in networks. Workstation was for stand-alone or client workstations

    What made Windows 2000 such a security
Read More

Dijkstra’s Algorithm for Finding Shortest Paths in a Graph

Dijkstra’s Algorithm for Finding Shortest Paths in a Graph

Dijkstra’s algorithm is a greedy algorithm that solves the single-source shortest path problem on a weighted, directed graph. Given a graph with a source vertex, the algorithm finds the shortest path from the source vertex to every other vertex in the graph.

The Algorithm

  1. Initialize a distance array d, where d[v] represents the current best known distance from the source vertex to vertex v. Initially, set d[v] to infinity for all vertices except
Read More

Database Normalization Forms and Indexing Techniques

1NF: A table is in 1NF if:

  1. The domain of each attribute contains only atomic values.
  2. The value of each attribute contains only a single value from that domain.

Functional Dependency: Y is functionally dependent on X in T if for each set x belonging to R.X there is precisely one corresponding set y belonging to R.Y.

Full Functional Dependency: Y is fully functionally dependent on X in T if Y is functionally dependent on X and Y is not functionally dependent on any proper subset of X.

Insertion Anomaly:

Read More

Interactive Video with Legends and Resizing


>


 



—————————————————–















Read More

Design Patterns and OCL

Design Patterns

Structural Patterns

– Adapters, Bridges, Facades, and Proxies are variations on a single theme:

  • Reduce coupling between two or more classes
  • Introduce an abstract class to enable future extensions

– Encapsulate complex structures

Behavioral Patterns

– Here we are concerned with algorithms and the assignment of responsibilities between objects: Who does what?

– Behavioral patterns allow us to characterize complex control flows that are difficult to follow at runtime.

Creational Patterns

– Here

Read More