….. 1.C Programming Structure Structure is the collection of variables of different types under a single name for better handling. For example: You want to store the information about person about his/her name, citizenship number and salary. You can create these information separately but, better approach will be collection of these information under single name because all these information. ……2.flowchart is a type of diagram that represents an algorithm or process, showing the steps as boxes of various kinds, and their order by connecting them with arrows. This diagrammatic representation illustrates a solution to a given problem. Process operations are represented in these boxes, and arrows; rather, they are implied by the sequencing of operations. Flowcharts are used in analyzing, designing, documenting or managing a process or program in various fieldstion are related to person. ………..3.Pseudocode is an informal high-level description of the operating principle of a computer program or other algorithm. It uses the structuraIn computer science, tree traversal refers to the process of visiting (examining and/or updating) each node in a tree data structure, exactly once, in a systematic way. Such traversals are classified by the order in which the nodes are visited. The following algorithms are described for a binary tree, but they may be generalized to other trees as well.l conventions of a programming language, but is intended for human reading rather than machine reading. Pseudocode typically omits details that are not essential for human understanding of the algorithm, such as variable declarations, system-specific code and some subroutines. ………4.An algorithm is an effective method expressed as a finite list[1] of well-defined instructions[2]for calculating a function.[3] Starting from an initial state and initial input (perhaps empty),[4]the instructions describe a computation that, when executed, proceeds through a finite [5]number of well-defined successive states, eventually producing "output"[6] and terminating at a final ending state. The transition from one state to the next is not necessarilydeterministic; some algorithms, known as randomized algorithms, incorporate random input. ……….one-dimensional array is a structured collection of components (often called array elements) that can be accessed individually by specifying the position of a component with a single index value.... ……….5.Two-dimensional arrays are a little more complicated to use than one-dimensional ones. This page presents two methods of passing a pointer to a two-dimensional array to a function for processing. • The first method uses subscript notation inside the function. This method has the same disadvantage as in Pascal -- the function is essentially array specific in that the data types need to match. However, while in Pascal you need to have a programmer-defined double-subscripted type which is used for both the array and the parameter in the called function, in C only the second subscript in each needs to match. A complete sample program is provided below. • The second method uses typecasting in the function call and a pointer with offsets inside the function. This method permits the programmer to use the same function to process information in arrays with different dimensions. A complete sample program is provided below. ……….6.In computer science, a queue (/ˈkjuː/ KEW) is a particular kind of abstract data type or collection in which the entities in the collection are kept in order and the principal (or only) operations on the collection are the addition of entities to the rear terminal position, known as enqueue, and removal of entities from the fronIn computer science, ………7.inked list is a data structure consisting of a group of nodes which together represent a sequence. Under the simplest form, each node is composed of a datum and a reference (in other words, a link) to the next node in the sequence; more complex variants add additional links. This structure allows for efficient insertion or removal of elements from any position in the sequence.t terminal position, known as dequIn computer science, ……….8.binary tree is a tree data structure in which each node has at most twochild nodes, usually distinguished as "left" and "right". Nodes with children are parent nodes, and child nodes may contain references to their parents. Outside the tree, there is often a reference to the "root" node (the ancestor of all nodes), if it exists. Any node in the data structure can be reached by starting at root node and repeatedly following rIn computer science, ………..9.tree traversal refers to the process of visiting (examining and/or updating) each node in a tree data structure, exactly once, in a systematic way. Such traversals are classified by the order in which the nodes are visited. The following algorithms are described for a binary tree, but they may be generalized to other trees as well.eferences to either the left or right child.eue.
Posted on: Tue, 25 Jun 2013 16:38:06 +0000
Trending Topics
Recently Viewed Topics
© 2015