Computer Programming

The stack register points to the top of the stack for the currently executing thread. The stack is a fixed-length memory allocation at the bottom of addressable memory (highest available address). The stack extends upwards into lower addresses. To keep track of the stack's usage, the stack pointer marks the top of the stack where a new frame will be pushed, decrementing the stack pointer by the required amount. When a frame is popped, the stack pointer is incremented by the frame length. The stack is typically used to call and return from functions by storing the return address of the caller, but can also be used to store a function's arguments (the values passed to it by its caller), its local variables and its exception handlers. Since the memory is allocated as soon as the thread becomes active, moving a pointer to activate and release stack frames is much quicker than requesting heap memory via the operating system.

The basic algorithm for a bubble sort requires a boolean indicator. As the program cycles through the array to be sorted, it steps by one and compares n and n+1. If n+1 is greater than n, then they are swapped, the boolean indicator is set to false and the comparator increments by one. Once the comparator makes a complete cycle through without the indicator flagging to false, the array is sorted.

1234

(adj.) - lacking harmony or agreement, incompatible; inconsistent; unsuitable, inappropriate

Incongrous means when things don't go together, or things are inappropriately matched, like 'his laughter was incongrous with his hate-filled eyes' or something like that.

Ole DB is a mechanism that allows applications to connect to databases that support the Ole DB framework. This is a Windows technology. This technology allows application developers to write software that can target any database, making the code for database manupulation simpler and easier to implement. As an aside, Ole, which used to stand for Object Linking and Embedding, was dropped to "Ole" when Microsoft discovered you cant trademark an acronymn.

Nothing, but as a file-extension it means backup.

Function oriented design breaks a system down into one or more named functions which transform their inputs to produce an output, such that the output of one function may be used as input to another function. In addition, the system also typically provides a global state which any function may operate upon.

In order for the "system of functions" to operate there has to be single point of entry which is typically provided by the system's global main function. The inputs for this particular function are derived from the command line used to invoke the system while the output is an integer typically used to indicate a system-defined error (with the value 0 usually indicating no error). Typically, the global main function decodes the command line parameters to determine what work is to be performed (if any) and to delegate that work to an appropriate function.

Although a single function can perform a significant amount of work, complex systems are much easier to understand when the work is divided amongst many smaller, simpler functions. When the functions are appropriately named, code becomes largely self-documenting, with the low-level implementation details largely hidden from the user.

Greedy algorithms are only guaranteed to produce locally optimal solutions within a given time frame; they cannot be guaranteed to find globally optimal solutions. However, since the intent is to find a solution that approximates the global solution within a reasonable time frame, in that sense they will always work. If the intent is to find the optimal solution, they will mostly fail.

yes

In computer programming, 1 is the presence of voltage, 0 is the lack of voltage. Thus, 1 is "on" and 0 is "off." In the interest of compacting more information into smaller spaces, bi-polar representations emerged. In a bi-polar format, a -1 is also considered "on." Since there can be no condition except presence of, or lack of voltage, then using symbols such as 20 will not work.

And, I'm not a whiz at computer components, but I believe it is the math processor (CPU) that determines the values of "on" or "off" and compiles the bits into bytes which it then compares to pre-determined responses.

gotoxy is a function in some programming languages, such as Turbo C, that is used to move the cursor position to a specific coordinate on the screen. This function is commonly used in text-based console applications to control where text or graphics are displayed.

MFC is the Microsoft Foundation Class library which provides the Windows Application Framework Extensions (AFX). The library is really nothing more than a class wrapper to make it easier to work with the Windows API using C++ classes. Although still used today it has largely been replaced by the .NET framework.

The spectrum analyzer is used to do distortion analysis to the signal. Due to the fact that we don't have a pure generated signal. In reality, there must be some distortion. The distortion analysis is important in the communication field as well as in electronics.

It jumps to the line after the indicated label. For example, this batch...

@ECHO OFF

ECHO apple

GOTO BANANA

ECHO sauce

:BANANA

ECHO ice cream

... would generate the following output:

apple

ice cream

C

A constant expression.

None. A single binary digit can only be in one of two possible states. What that state physically represents is merely an abstraction: on or off, yes or no, positive or negative, true or false, black or white, the digits 0 or 1 and the characters 'A' or 'B' are all valid abstractions for the two possible states that any one bit may hold. But the computer has no notion of numbers let alone characters. These are simply our interpretation of what these states represent.

The ANSI character set has 127 characters in total which we can identify using an array of 7-bits (yielding a decimal value in the range 0 through 127). The character 'A' is represented by the binary value 1000001 (65 decimal), while 'B' is 1000010 (66 decimal). Thus we could choose between these two individual characters by saying that if a particular bit is set then we select character 65, otherwise we select character 66. However, the computer cannot do it alone -- it has no logic circuitry capable of deciding which of any two characters a single bit represents. We must program it, which requires a good deal more than just 1 bit. Thus a single bit cannot "do" any characters.

Konrad Zuse of Berlin. The Z1 was first designed in 1934 and completed in 1938. It was destroyed by Allied bombing raids in 1943 along with all construction plans. However, Zuse reconstructed the original Z1 from 1986 to 1989. It now resides in the German Museum of Technology in Berlin.

Abap4 is 4th generation language, though people may think it as version 4. 4th generation language makes the developer life easy as it has already huge lines of code embedded for different purposes. A fourth-generation programming language (1970s-1990) (abbreviated 4GL) is a prg language or programming environment designed with a specific purpose in mind, such as the development of commercial business software.

A flowchart is a way of showing a process from beginning to end along with the results of decision points in the course of the process. Most people create flowcharts by starting at the beginning of the process and listing each step and decision. Sometimes it is helpful to work backwards from the end of the process to be sure to account for all possibilities.

Finding a time complexity for an algorithm is better than measuring the actual running time for a few reasons:

# Time complexity is unaffected by outside factors; running time is determined as much by other running processes as by algorithm efficiency. # Time complexity describes how an algorithm will scale; running time can only describe how one particular set of inputs will cause the algorithm to perform.

Note that there are downsides to time complexity measurements:

# Users/clients do not care about how efficient your algorithm is, only how fast it seems to run. # Time complexity is ambiguous; two different O(n2) sort algorithms can have vastly different run times for the same data. # Time complexity ignores any constant-time parts of an algorithm. A O(n) algorithm could, in theory, have a constant ten second section, which isn't normally shown in big-o notation.

William King led the convention of 210 delegates that met for three weeks in October 1819 to hammer out a Maine state constitution. King later became the first governor of Maine.

1. How did the surge in population in the United States in the late nineteenth century contribute to the development of the computer?

At my high school, we used Photoshop.