Chiranji Nagarani

I've been pursuing my graduation . And im very much interested in content writing and article writing. And I love to explore.

Student at University college of engineering and technology for women

Studied at Model high school

Certified in Line follower robot workshop

Multi programming and multi processing systems

Here there is lot of difference between multi programming and multi processing operating system, multi programming is one program waits for for I/o transfer ,another program is ready to utilize the CPU. Here many processes shares the time of CPU . Multi processor has 3main advantages. 1. Increase throughput 2. Economy of scale 3.increased reliability. In detail we can know from the diagrams of that pictures.

Program to explain if-else condition that is to find the maximum between two numbers.

If else condition is used to check the condition if a is greater than b then a is greatest otherwise b is greatest.. if(a>b) Printf(.....); Else Printf(.....); This is the syntax of if else condition.

Program to explain type casting.

Type casting means changing of one data type into other. type casting is of two types implicit and explicit. Implicit means the compiler will automatically converts the data type into other. Explicit means we have to mention the data type it wanted to be changed in.

Program to explain simple if.

Simple if is used to check a simple condition like yes or no . Let us introduce two variables a,b . If a is greater than b then a is greatest. This is the format of simple if condition. It includes two header file studio.h and conio.h to include all the files that we include in a program.

Block diagram of computer and it's functional description.

This is the basic block diagram of a computer. It consists of key board, mouse, CPU, speakers,monitor, printer, hard disk,etc. These are the hardware components of a computer. Coming to the internal part, data I sent through input devices as input . It is sent o the secondary storage or primary storage . Then control unit controls the entire system and arithmetic logical unit performs all the computational operations. Finally information is obtained as output .CPU consists of MMU ,CU,ALU.

Flow chart description and example of flow chart.

Flow chart is the pictorial representation of an algorithm to solve the problem.they are very much useful in documentation of a program . There are few symbols that represents a specific activity of that symbol. This flow chart helps in detail clarification of a program logic.

Types of algorithm , advantages and disadvantages of algorithm.

There are 3 types of algorithms . Sequence algorithm, repetitive algorithm, steps involved in developed algorithm. There are many advantages of algorithm. It is a step by step procedure. It is independent of programming language. We also have the example of an algorithm.

History of c language and history development of c

C language is one of the most popular computer languages in today's world. ALGOl was the first language introduced in 1960. Later in 1963 , CPL was introduced. Afterwards in 1967, BCPL was came into the picture. Then in 1970 B language was introduced. Modifying B language, in 1972 C language was introduced.

Steps for problem solving.

We have 8 main steps for solving the problem. 1.defining the problem. 2. Designing the problem 3. Coding the program 4. Testing and debugging the program. 5. Syntax errors. 6. Logic errors. 7. Run time errors. 8. Maintaining and upgrading the program.

Program to create sort in an array using template.

Sorting means arranging the elements in ascending or in descending order. Arranging the elements in array using template provides easy execution. Templates are the powerful concept in c++. Using this templates provides high consistency for data in documents of business.

Program to explain sorting of the elements of an array.

Firstly array means collection of elements of same data type stored in a continuous memory allocation. Sorting of the elements of an array means arranging the array elements in ascending or descending order.

Program to explain dynamic initialization of a variable

Dynamic initialization of a variable means introducing variable at run time. Just before executing the program we initialize that respective variable . Here in this program 'a' is initialized just before the end of the program.