Notes, summaries, assignments, exams, and exercises for Computer science for Other courses

Unit 12: Web Vocabulary & CMS Comparison

Computer science2.83 KB

Unit 12: Web Vocabulary & CMS Comparison

Vocabulary

  1. Scripting languages — interpreted.
  2. Get out stuff.
  3. Browser-encoded docs.
  4. Programming model: dataflow.
  5. Architecture underlying.
  6. Retrieve: Shift key.
  7. Relieves infrastructure.
  8. Message board: online discussion.
  9. Responsive web design — viewed response.
  10. Spreadsheet: financial planning.

Language Focus

1

  1. The program will prompt you with a message if you try to exit the setup program.
  2. If the system detects installed devices, the driver's menu will show the available device drivers.
  3. You can change the value of a field if the item is configurable.
  4. If any of the components are defective, the problem will usually show up in the burn-in process.
  5. If this utility finds there is missing software, it lists the missing
...
Continue reading "Unit 12: Web Vocabulary & CMS Comparison" »

Mastering the Unified Process Transition Phase

Computer science3.53 KB

Transition Phase

The transition phase is entered when a baseline is mature. A usable subset of the system has been built with acceptable quality levels and user documentation. It can be deployed to the user community.

  • For some projects, the transition phase marks the starting point for another version of the software system.
  • For other projects, the transition phase signifies the complete delivery of the software system to a third party responsible for operation, maintenance, and enhancement.

Objectives of the Transition Phase

  • Achieve user independence (users can support themselves).
  • Ensure the deployment baseline is complete and consistent with the criteria in the project agreement.
  • Ensure the final baseline can be built as rapidly and cost-effectively
...
Continue reading "Mastering the Unified Process Transition Phase" »

Software Configuration Management Fundamentals

Computer science2.77 KB

Software Configuration Management (SCM)

Definition of Software Configuration Management

Software Configuration Management (SCM) is a set of management disciplines within a software engineering process used to develop a baseline. SCM encompasses the disciplines and techniques of initiating, evaluating, and controlling change to software products during development and maintenance.

Administering SCM

Administering Software Configuration Management is a crucial project function with the goal of making technical and managerial activities more effective. SCM can be administered in several ways:

  • Organization-wide: A single SCM team manages configuration for the whole organization.
  • Project-specific: A separate configuration management team is established
...
Continue reading "Software Configuration Management Fundamentals" »

Windows Server Configuration Scenarios for IT Professionals

Computer science4.8 KB

Trey Research

  • Deploy a Network Load Balancing (NLB) cluster using an .msi file.
  • Minimize the number of Virtual Machines (VMs).
  • Configure Special Auditing.
  • Install Remote Server Administration Tools (RSAT).
  • Configure Distributed File System (DFS) Replication.
  • Configure a DFS Namespace.

Proseware, Inc.

  • Create Data Collector Sets.
  • Configure settings on a Remote Desktop (RD) Virtualization Host.
  • Use dynamically expanding Virtual Hard Disks (VHDs).
  • Deploy applications using RemoteApp.
  • Apply Windows Management Instrumentation (WMI) filtering to Group Policy Objects (GPOs).
  • Manage Local Users and Groups.
  • Configure Windows Search Service on the file server and add the Legal share to the index for legal department clients.

School of Fine Art

  • Configure printer driver
...
Continue reading "Windows Server Configuration Scenarios for IT Professionals" »

Understanding Network Devices and Protocols in IT

Computer science3.46 KB

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" »

Database Transaction Integrity and Relational Algebra Operations

Computer science3.25 KB

The serializability problem arises when transactions interfere, potentially leading to incorrect results even if individual transactions succeed. If a transaction involves a commit, it is serializable; otherwise, it may not be. This graph technique is applicable only when multiple modules execute transactions simultaneously.

A successful transaction can yield incorrect results due to interference with other transactions. Three common problems include:

  1. Lost Update: Occurs when two transactions read the same data, and one transaction's update is lost because the other transaction writes its update later without considering the first.
  2. Unconfirmed Unit: Happens when a transaction retrieves or updates a tuple that was modified by another transaction
...
Continue reading "Database Transaction Integrity and Relational Algebra Operations" »

Heap Sort Algorithms in Python: Examples and Implementations

Computer science4.58 KB

a = ['z', 'y', 'x', 'w', 'v', 't', 's', 'r', 'q', 'p', 'n', 'm', 'l', 'k', 'j', 'h', 'g', 'f', 'd', 'c', 'b', 'u', 'o', 'i', 'e', 'a']

n = int(input())
h = []
for i in input():
h.append(a.index(i))

def heapify(heap, i, n):
l = 2*i + 1
r = 2*i + 2
minid = i
if l < n and heap[l] < heap[minid]:
minid = l
if r < n and heap[r] < heap[minid]:
minid = r
if minid != i:
heap[i], heap[minid] = heap[minid], heap[i]
heapify(heap, minid, n)

def hs(heap):
n = len(heap)
for i in range(n // 2 - 1, -1, -1):
heapify(heap, i, n)
for i in range(n - 1, 0, -1):
heap[0], heap[i] = heap[i], heap[0]
heapify(heap, 0, i)

hs(h)
print(''.join(a[i] for i in h))


import sys

def solve():
data...

Continue reading "Heap Sort Algorithms in Python: Examples and Implementations" »

Operating System Concepts: Functions, Types, and Processes

Computer science117.7 KB

What is an Operating System?

An Operating System (OS) is system software that acts as an interface between the user and computer hardware. It manages the hardware and software resources of a computer and provides an environment for running application programs.

Examples: Windows, Linux, macOS, Android, and Unix.

Basic Structure of an OS

        User
          ↓
   Application Programs
          ↓
    Operating System
          ↓
       Hardware

Major Functions of an Operating System

  1. Process Management: The OS manages the creation, execution, scheduling, and termination of processes.
  2. Memory Management: It manages the main memory (RAM) and allocates or deallocates memory to different processes.
  3. File Management: It manages files and directories,
...
Continue reading "Operating System Concepts: Functions, Types, and Processes" »

Efficient AVL Tree Implementation in C++

Computer science4.53 KB

Node Class Structure

The Node class defines the structure for each element in the AVL tree, storing a key, its corresponding meaning, and pointers to child nodes.

class Node {
public:
    string key, meaning;
    Node *lft, *right;
    int h8;
    Node(string k, string m) {
        key = k;
        meaning = m;
        lft = right = NULL;
        h8 = 1;
    }
};

AVL Tree Class Definition

The AVL class contains the logic for maintaining a self-balancing binary search tree.

Helper Functions for Balancing

These utility functions manage node height (h8), calculate the balance factor, and determine the maximum of two values.

class AVL {
    Node* root;
    int h(Node* n) { if (n == NULL) return 0; return n->h8; }
    int bal(Node* n) { if (n == NULL)
...
Continue reading "Efficient AVL Tree Implementation in C++" »

Java Arrays and ArrayLists: Essential Concepts and Fixes

Computer science3.32 KB

Section 1: Java Array Fundamentals

  1. An array is a collection of elements of the same data type stored in one variable.
  2. The index of the first element is 0.
  3. The correct declaration is: int[] arr = new int[5];
  4. The size of the array is 10.
  5. The best loop for arrays is a for loop.
  6. A 2D array represents a table.
  7. ArrayList belongs to java.util.
  8. ArrayList can store objects.
  9. The method used to add an element is add().
  10. arr.length gives the size of the array.

Section 2: Array Properties

  1. Arrays store elements of the same type.
  2. The last index of an array of size n is n - 1.
  3. A 2D array is also called a two-dimensional array.
  4. ArrayList size can grow dynamically.
  5. The loop used to traverse arrays is usually a for loop.

Section 3: Advanced Array Concepts

  1. A 1D array is a list of
...
Continue reading "Java Arrays and ArrayLists: Essential Concepts and Fixes" »