Computer Applications

Halftone is the reprographic technique that simulates continuous tone imagery through the use of dots, varying either in size, shape or spacing.

Languages such as C and assembly language have rudimentary macro systems, implemented as preprocessors to the compiler or assembler. C preprocessor macros work by simple textual search-and-replace at the token, rather than the character, level.

This statement is false. If a graph G has an Euler circuit, then all of its vertices must be even vertices. In Eulerian path, each time we visit a vertex v, we walk through two unvisited edges with one end point as v. Therefore, all middle vertices in Eulerian Path must have even degree. For Eulerian Cycle, any vertex can be middle vertex, therefore all vertices must have even degree.

The shadow mask is one of the technologies used to manufacture cathode ray tube (CRT) televisions and computer displays that produce color images

An instruction pipeline is a technique used in the design of computers to increase their instruction throughput (the number of instructions that can be executed in a unit of time). Pipelining does not reduce the time to complete an instruction, but increases instruction throughput by performing multiple operations in parallel.

Schema is the structure of a database system, described in a formal language supported by the database management system (DBMS). In a relational database, the schema defines the tables, the fields in each table, and the relationships between fields and tables.

The range of Class D addresses is from 224.0.0.0 - 239.255.255.255. Hence, this address belongs to this class.

The data unit created at the application layer is called a message.

This is the distributive law.

A different approach to CPU scheduling is the shortest-job-first (SJF) scheduling algorithm. This algorithm associates with each process the length of the process's next CPU burst. The real difficulty with the SJF algorithm is knowing the length of the next CPU request. For long-term (job) scheduling in a batch system, we can use as the length the process time limit that a user specifies when he submits the job.

This is the Redundance Law in boolean algebra : (a) A + A B = A (b) A (A + B) = A

The Banker's algorithm is a resource allocation and deadlock avoidance algorithm developed by Edsger Dijkstra that tests for safety by simulating the allocation of pre-determined maximum possible amounts of all resources, and then makes a safe-state check to test for possible deadlock conditions for all other pending activities, before deciding whether allocation should be allowed to continue.

Tri-state buffers, also known as 3-state buffers, are combinatorial elements that in addition to providing the two standard logic “0″ and logic “1″ states, can be made to provide a high impedance third state. This third state occurs when the gates output is effectively switched “OFF” or disconnected. This third state is often referred to as an “High-impedance”, “hi-Z“, or just “Z” state.

The 1's complement of 10000000 is 01111111, adding 1 to it, gives 10000000 as its 2's complement. This is the same as the given number.

Immediate update also called UNDO/REDO, is also another technique used to recover/support transaction failures that occur due to operating system, power, memory or machine failures. When a transaction runs, any of the updates or alterations made by the transaction are written directly in to the database.

Clustering is often used to find appropriate groupings of elements for a set of data. Unlike decision trees we discuss above, clustering is a kind of undirected knowledge discovery or unsupervised learning; that is, there is no target field, and the relationship among the data is identified by bottom-up approach.

In order to discover trends in business, analysts need large amounts of data. A data warehouse is time variant. A data warehouse's focus on change over time is what is meant by the term time variant.