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

What is bleed? When any image or element on a page touches the edge of the page, extending beyond the trim edge leaving no margin it is said to bleed. It may bleed or extend off one or more sides.

What is slug? Non-printing information (such as a title and date) used to identify a document outside bleed area.

What is Trim - The final size of a printed page after excess edges of paper have been cut off What is Gutter - The area between columns on a page or the blank space between two facing pages in print

Match each file format with the kind of information it would likely be used to save?
o TIFF = A loss-less bit-mapped file format for high-resolution photographic images, typically in print
a EPS = A vector-based file format for high-resolution... Continue reading "Understanding Bleed, Slug, Trim, and Gutter in Print Design" »

Javascript

The async attribute allows the browser to process the web page concurrently with loading and processing the JavaScript.

The defer attribute allows the browser to load the web page concurrently with loading the JavaScript, but the JavaScript is not processed until the web page is completely loaded.script src="bootstrap.js" async>script>

A change event is caused by an element value being modified. Ex: Selecting an item in a radio button group causes a change event.

An input event is caused when the value of an input or textarea element is changed.

A load event is caused when the browser completes loading a resource and dependent resources. Usually load is used with the body element to execute code once all the web page's CSS, JavaScript,

◦ Performs an action if a condition is true and performs a different action if the condition is false.

◦ Double-selection statement—selects between two different actions (or groups of actions).

}switch statement

◦ Performs one of several actions, based on the value of an expression.

◦ Multiple-selection statement—selects among many different actions (or groups of actions).

Iteration Statements in Java

}Four iteration statements (also called iteration statements or looping statements)

◦ Perform statements repeatedly while a loop-continuation condition remains true.

}

while and for statements perform the action(s) in their bodies zero or more times

◦ if the loop-continuation condition is initially false, the body will not execute.

}The do…while... Continue reading "Java Control Statements and Operators" »

This document presents a C++ implementation of a Queue data structure, demonstrating its core functionalities and operations. The Queue is implemented using a linked list, adhering to the First-In, First-Out (FIFO) principle.

Queue Class Definition

The Queue class encapsulates the data members and member functions necessary to manage a queue. Note that the Node struct/class is assumed to be defined elsewhere, typically as struct Node { double info; Node* link; };.

class Queue
{
private:
    Node* front;
    Node* rear;
    int count;
    double info; // This member 'info' within the Queue class itself seems unused in the provided code.
public:
    // Constructor: Should be 'Queue();' without 'void'. Implementation is missing.
    Queue();

CH6

Predictive Modeling Techniques

61) Predictive modeling is perhaps the most commonly practiced branch in data mining. What are three of the most popular predictive modeling techniques?

Answer:

• Artificial neural networks
• Support vector machines
• k-nearest neighbor

62) Why have neural networks shown much promise in many forecasting and business classification applications?

Answer: Because of their ability to "learn" from the data, their nonparametric nature (i.e., no rigid assumptions), and their ability to generalize.

Understanding Neural Networks

63) Each ANN is composed of a collection of neurons that are grouped into layers. One of these layers is the hidden layer. Define the hidden layer.

Answer: A hidden layer is a layer of neurons that takes input... Continue reading "Predictive Modeling Techniques in Data Mining" »

Chapter 1: Foundations of Object-Oriented Programming

Data Encapsulation with Classes

The starting point of object-oriented programming is to provide a more faithful implementation of the notion of “type” in programming. The programming languages we are familiar with come with standard built-in types that we can assign to variables and values:

Built-in Programming Types

• In C, we can use int, float, double, char, etc.
• In Haskell, similarly, we can use Int, Float, Char, Bool, etc.

In addition, programming languages provide a way to assign a single name to a collection of values of the same type. The nature of this collection is determined by the underlying architecture assumed by the programming language.

Collections and Data Structures

Arrays in

Operations on a Process

1. Process Creation: A user request or an already running process can create new processes. A parent process creates child processes using a system call, which, in turn, can create other processes, forming a tree of processes.
2. Process Pre-emption: A process is pre-empted if an I/O event or timeout occurs. The process then moves from the running state to the ready state, and the CPU loads another process from the ready state to the running state, if available.
3. Process Blocking: When a process requires an I/O event during its execution, it moves from the running state to the waiting state, and the CPU dispatches another process.
4. Process Termination: A process is terminated when it completes its execution. Additionally, events

Space Complexity

• Analysis of the space complexity of an algorithm or program is the amount of memory it needs to run to completion.
• The space needed by a program consists of the following components:
• Fixed space requirements: Independent of the number and size of the program's input and output. It includes:

• Instruction Space (Space needed to store the code)
• Space for simple variables
• Space for constants

• Variable space requirements: This component consists of:

• Space needed by structured variables whose size depends on the particular instance I of the problem being solved
• Space required when a function uses recursion

Total Space Complexity

S(P) of a program is:

S(P) = C + S_p(I)

Here S_p(I) is the variable space requirements of program P working on an instance... Continue reading "Algorithm Analysis: Time and Space Complexity" »

E-Voting

Considerations

• Voter ID
• Candidate ID and Voter ID
• Representing information in text format
• Secure section for additional fields
• Providing a set number of options to reduce data input errors

Data Collection Methods

Questionnaires

Advantages: Less labor-intensive than interviews.

Disadvantages: Poorly designed questions (e.g., overuse or lack of closed questions) can lead to misunderstandings.

Interviews

Advantages: Provide more detailed information than questionnaires; allow for face-to-face interaction.

Disadvantages: Time-consuming; require skilled interviewers.

BYOD at Xingu Academy

Technical Aspects

• MAC address and IP address management
• Voice recognition software: Converts analog speech to digital sound, then to text using a sound database. Matches