Problem Solved Final Semester Production Equipment
to download the report format please click here

below is a matter of practice
Cekidot ....
And Good luck

Solved Problems Chapter 5

1 . Make an algorithm with the following specifications :
- Displays the words " Hello , what's your name ," then
- Asks the user to enter his name , and finally
- Write the message " happy to make friends with you , " which in this case is the string that is read by ( b ) .
2 . Write an algorithm to calculate the area of ​​the other geometry ( circular , square , triangular , trapezoidal , and so on ) . Input data are read from input devices and wide awake in the show as an output .
3 . Read length of time in seconds . Write an algorithm to convert the duration into days , hours , minutes , seconds .
4 . A project in kekerjakan for x days . Write an algorithm to mengkonverwsi few years , how many months , and miraculous day the project was done . Assume : 1 year = 365 days , 1 month = 30 days . Exodus ( year , month , day ) display device to output
5 . Read two dates (dd : mm : yy ) . Write an algorithm to calculate the number of days within the two dates . Assume : 1 year = 365 days , 1 month = 30 days . Exodus ( year , month , day ) display output kepiranti
6 . Reads three integers x , y and z write algorithms to exchange triple ( x , y , z ) to ( y , z , x )
7 . Yangmembaca algorithms make money ( dollars ) in multiples of 25 , then determine how many fractional exchange value . Fraction available is Rp100 , Rp100 Rp50 and Rp25 Rp.500 . For example Rp.2775 money worth the equivalent of 2 pieces of broken Rp1000 plus 7 biaj [ ecajam R [ 100 dota , baj 1 biaj [ ecajam Rp50 Rp25 denomination plus 1 piece
8 . An ant to travel as far as x cm write algorithms to convert the distance x into the kilometer - meter - centimeter . Remember that 1 m = 100 cm and 1 km = 1000m = 100,000 cm . Eg x = 261 341 cm , this means that ants menmpuh distance 2km +63 km + 141 cm
9 . Write an algorithm that reads the length of an object in meters and then converts it into units of inches , feet , and yards ( 1 inch = 25.4 mm , 1 foot = 30.48cm and 1 yard = 0.9144 m )
10 . No hubnungannya ideal weight with a height to determine your ideal weight , height minus 100 then reduced again by 10 % from the first penguranan . Write an algorithm that reads height and determine the ideal weight for the high

Solved Problems Chapter 6

1 . Bilangna read a positive integer then determine whether the number is a multiple of 4
2 . X supermarkets give discount prices for shoppers spending a total value of more than 100,000 . write an algorithm to determine the price net of discount shopping . Data input is the total value of buyer expenditure , while the output is the price and the discounted value of expenditure net of discounts
3 . Write an algorithm that reads three integers and then sort those three numbers of small value to a large value . Output is three sequential numbers
4 . Write an algorithm that reads the length ( integer ) segitita three sides a , 1 , b , c , in this case a < b
5 . Write an algorithm that reads a digit character ( 0 .. 9) and converts it into an integer value ( 0 .. 9 ) for example, if the character is read 5 then conversion to an integer value is 5 . Make each algorithm to the following two conditions :
a. Character digits are assumed to be correct in reading lies in the range 0 .. 9
b . Yadibaca characters 0 .. 9 may not be read if the character is not a character digit , then the conversion is assumed to be worth -99
6 . If we are shopping at the supermarket / supermarket , the total value of our shopping dollars is often not a multiple of the applicable fraction , for example, the total expenditure is Rp.19.212 suppose ipecahan dollars while in the smallest force yantg Rp25 addition there is also Rp50 and Rp100 fractions . Generally supermarket checkout rounding fractional values ​​to the greatest shopping . So Rp19.212 dubykatjab nebhadu Ro19.255 this is clearly detrimental to consumers . Suppose you have a supermarket and do not harm the honest buyer . So if there is not value spending keliapata denominations exist, then the value of the shopping fractions rounded to the lowest , so Rp19.212 rounded to Rp19.2500 tulisha algorithm that reads the value of spending ( integer ) and then round it to the value of money with the lowest fraction .
7 .
a. Write an algorithm that reads a positive integer in the range 1 smapai 10 , and then converts it into roman numerals
b . Develop an algorithm ( a) above to be able to convert arbitrary positive integers into roman numerals
8 . In the field of image processing ( image processing) , erkecil picture elements called pixels ( picture element ) . Value of 256 pixels for image color is from 0 to 255 . Opearsi for pixel operations are often located outside of this value range . If that is the case , then the value of the results of operations should be cut ( clipping ) so it stays in the interval [ 0 .. 25 ] . if the value oerasi results greater than 255 , then the value is truncated to 255 , and if negative then cut to 0 , reads a value haris image processing operations , make the algorithm to perform cliping .
9 . Tinjaukembali Exercises 10 Chapter 5 numbers to determine idelal weight , or the message " not ideal " if no quarrel +2 kg of ideal body tightly , or the message " not ideal " if no quarrel +2 kg of ideal body weight , write the algorithm
10 . Write down the language into pascal and C for algorithms about number 1 to number 9 above

Solved Problems Chapter 7

1 . Create an algorithm that reads any character and print it to the screen
Create an algorithm for the two cases
a. The number of characters in the read in the know , namely N- ( N read first)
b . The number of characters in the read is not known but the reading process ends if the character in the input point ( the point of the character is not involved in print
2 . Create an algorithm to calculate the amount of N pieces of the first odd number ( ie 1 +3 +5 ff ) . Note : N is an integer no negative
3 . Create an algorithm to count the number of odd numbers from 1 to N Example 1 +3 +5 plus n . ( Note the difference in these practice questions with question number 1
4 . Write program to print pascal segitia image of n lines , each line to I contains the first star fruit . N values ​​are read from the keyboard
Example : input N = 5
5 . Write an algorithm to display all integer solutions of the following equation x + y + z = 25, which in this case x = 0 y large or greater than or equal premises 0 and z greater than or equal to 0
6 . Create an algorithm that will convert positive integers to roman numerals so pengkonversiannya rancangnlah the algorithm can be done berulangan times until the value 0 is read from input devices
7 . Someone possessed her savings in the bank can deposit and withdraw money , but the amount of the minimum balance that must be in reserving this means is if the balance 10,000 10,000 he did not take the money again . Transaction code is 0 and the transaction code to take is 1 , create an algorithm that simulates the one who performed the transaction , the algorithm receives the input of transaction code in the amount of money deposited or retrieved . Devise algorithms are allowing savers can transact repeatedly until the remaining balance of 10 thousand dollars or the amount of money taken is greater than the balance of money taken note value is always an integer


Solved Problems Chapter 10

1 . Write down the procedure for calculating the amount of N pieces first even number ( even number starts from 0 ) . Receiving procedure ( parameter ) enter N and give ( parameter ) number N of fruit output even number first .
2 . Write down the procedure that produces the average value of a set of integer data is read repeatedly from the keyboard ( final reading is 9999 ) . ( 1 + i/100 )
3 . Repeat Question 2 remains the procedure produces the smallest value .
4 . Suppose you save money in conventional banks A number of dollars at the beginning of the year . If you get an annual interest rate of I percent , then the amount of money you are after n years .
F = A { ( 1 + i/100 ) + ( 1 + i/100 ) 2 + ( 1 + i/100 ) 3 + ... + ( 1 + i/100 ) n }
Make A procedure that accepts input , I, n and provide output F
5 . Write procedures in pascal language and C language that accepts as input a positive integer value and display the value in words
example :
Input : 15
Exodus : fifteen
Input : 2347
Outputs : two thousand three hundred and forty- seven
6 . Write down a procedure which accepts input clock ( hh: mm : ss ) and p minutes then give output yesterday after hours is now reduced p -minute ( this exercise is the opposite of the example problems in the chapter 8.1 . Make two versions of the algorithm , the first to use calculation , the second use case analysis method .
7 . Write the name of the procedure receiving now and specify the name of the day tomorrow . For example , if the current ' Wednesday ' then the next day is " Thursday " .
8 . Repeat number 5 , but specifies the name of the previous day .
9 . Write down the procedure that accepts a date in the form dd- mm -yyyy ( example : 12-8-1996 ) and provide output earlier date ( the exercise is the opposite of the example problems in the chapter 8.7
Note : parameter date type input / output ) ;
10 . Write down the procedure that accepts a date ( dd- mm -yyyy ) and then calculate the distance of infinity that date from the date of 1-1-1900 .
11 . Write procedures that receive hours now ( dd - mm - ss ) , date ( dd- mm -yyyy ) , and the name of the day , then watch the seconds continue to operate so as to achieve at 0:0:0 , the next date was also changed , so did name the next day . Consider the case of a leap year .
12 . Create a procedure in Pascal language and c language to print a pyramid with " height " n ( asusmsi : n ≤ 10 ) as an example , if n = 6 , then the resulting pyramid is
1
232
34 543
456 754
567898765
67890109876
13 . Make it in pascal language and c language to print a case gamba below if given the value of N ( ie the width of the longest line ) , assuming N is odd
Example : N = 7

*
***
*****
*******
*****
***
*
task PTI
Task : ( in gathering Friday evening at the latest at 18.30 )

Describe the components of a computer system
Explain tentangkomponen hardware
Explain about the various registers
Describe the components of a CPU
Explain about the instruction cycle
Explain about the types of memory
Provide a short description complete with an example , to convert the number of :
a. Base N to base 10
b . Base 10 to base N
c . Base N to basisN
Explain the three basic data types
Explain the following terms :
a. beet
b . Charakter
c . field
d . record
e . file
f . Data Base
10 . Explain the classification of computers based on wide area networks and network topology
11 . Explain the classification of programming based on the level
12 . Difference between compilers and interpreters
13 . Tell us about the stages of system development
Rank Program ( PASCAL )
{ Program to Calculate exponential number }

fori program ;
uses crt ;
var
i , number , rank , number : longint ;
begin
clrscr ;
write (' Enter the number : ' ) ; readln ( number) ;
write (' Input Designation : ' ) ; readln ( rank ) ;
number : = number ;
for i : = 1 to rank do
begin
number : = number * number ;
writeln ( ' Karma ' , i , ' = ' , sum ) ;

end ;
readkey ;
end .
Word Ordering Program ( Pascal )
urutangka program ;

uses crt ;

var

a, x , y , z : longint ;

begin

clrscr ;

writeln ( ' Program Ordering Integer ' ) ;
writeln ( ' Enter the number : ' ) ;
writeln ;
write ( ' = > ' ) ; readln ( x ) ;
write ( ' = > ' ) ; readln ( y ) ;

write ( ' = > ' ) ; readln ( z ) ;

begin
if x > y then
begin
a : = x ; x : = y ; y : = a;
end ;

if x > z then
begin
a : = x ; x : = z ; z : = a;
end ;
if y > z then

begin
a : = y ; y : = z ; z : = a;
end ;
writeln ;

writeln ( ' = > ' , x ) ;
writeln ( ' = > ' , y ) ;
writeln ( ' = > ' , z ) ;
writeln ;

end ;
readkey ;
end .
Calculator program ( pascal )
calculator program ;
uses crt ;
var
a, b , result : real ;
kar : char ;
begin
clrscr ;
gotoxy ( 36.3 ) ; writeln ( ' CALCULATOR ' ) ;
gotoxy ( 11.4 ) ; readln ( a) ;
kar : = readkey ;
gotoxy ( 11.6 ) ; readln ( b ) ;
kar case of
' + ' : Result : = a + b ;
' - ' : Result : = a- b ;
' / ' : Result : = a / b ;
' * ' : Result : = a * b ;
end ;
writeln ( ' ============ ' ) ;
gotoxy ( 13.7 ) ; writeln ( kar ) ;
if ( kar = ' / ' ) then
write ( ' = ' , result : 10:2 )
else
write ( ' = ' , result : 10:0 ) ;
readkey ;
end .
external Memory
Foreign deposits

I. preliminary
Deposits outside (external memory ) is memory that is located outside the process tool , or also called mass storage ( big savings ) , secondary storage ( memory both ) .
External memory was born because the need for storage ( storage) the larger , main memory because its capacity is limited . Especially in today's times the files are getting bigger.

drawing comparisons memory

Outside deposit divided into 2 groups, namely DASD (direct access memory ) or tool income direct deposits and SASD ( sequential access storage device) or a savings tool income sequence . his differences with the main memory capacity is larger than the main memory , but in terms of the speed of main memory is superior .


2 . Direct Access Storage Device ( DASD )
DASD savings tool pemasupan sequence . The data stored in the SASD pemasupan can be done directly by the CPU in position , compared with the main memory capacity of DASD generally larger and the price per bit of information that can be recorded is cheaper , but the speed is slower than the main memory .
2.1 . Magnetic Disk
Beyond the savings made ​​from one or more discs that looks like a black disc made ​​of metal or plastic and the surface was coated with magnetic iron - oxide layer .

2.1.1 . Micro Disk
Made of plastic disc diameter is small enough that 3 ½ -inch that can be put in your pocket . Of micro disk platters wrapped into a place that is made of hard plastic that is more durable , not easily scratched and not easily bent . Micro Floppy disk is also called micro .

2.1.2 . mini Disk
In 1972, IBM introduced the mini disk as a storage medium for mainframe computer program . Mini is also the name of the disk called floppy disks , mini floppy disk , flexible disk or diskette .

Read / write protect notch when it is covered , then the mini disk to be read-only nature . A mini disc is divided into several concentric circles called tracks and divided into pieces called transverse sector .

Number of sectors depending on the system disk that is used for each computer ( typically 8 or more sectors ) . Amount of information that can be recorded on the surface of the disk depends on the density ( density disk ) . Diameter sizes from mini disk is 5 ¼ inches and 8 inches .

2.1.3 . hard Card
Was introduced to the micro- computer memory in the form of a card together with its controller . Hard cards can be installed in one of the slots on the micro computer . Hard Card is also called by the name of the file -card , because the files are stored on the card .

2.1.4 . hard Disk
Made from hard discs from aluminum or ceramic dlapisi with magnetic substances . Because of the hard disk platters from the hard and rigid form , it can consist of 5 to 100 discs were compiled .

As with minidisk , each disc on the hard drive is divided into several concentric circles called tracks . System on the hard disk is not used but replaced with cylinder sector , which is a collection of the same track number for all records .

Data is placed on your hard disk will be recorded on a particular track on the surface , when the track is full , it will continue on the same track number on the next level
2.1.4.1 . Removable Disk ( Disk Pack )
That is the hard disk that can dilepasdari driving tool and read / write head in the disk drive located on the hard disk is not . Advantage of the removable disk is removable from the driving tool that can be changed to another and can be carried around .

The disadvantage is the possibility of the surface of the disc can be damaged by scratches with a read / write head when paired to a disk drive .

2.1.4.2 . Fixed Disk ( Winchester Disk )
A hard disk that is placed in an enclosed space together with the read / write head of his . With Winchester technology , read / write head can be placed very close to one of the disk surface which is about 1/20 million inches .

The disadvantage is that the hard disk is permanently installed in the computer , it is not easily removed and replaced with another and carry.

Diameter and capacity of the disc in winchester disk varies and is used in computer size , mini and micro computers are widely used in applications that require for the purposes of a quick pemasupan time .

2.1.4.3 . disk Cartridge
A hard disk that are removable with a large capacity and is used to back up files . Speed ​​is slower than the disk cartridge winchester disk or removable disk .

2.2 . Strip Tape Cartridge
It is a combination of magnetic tape with magnetic disks . IBM calls cartridge tape strip with the term mass storage systems . For example, IBM 3850 using a strip of magnetic tape 770 inches in length with a width of 3 inches . Each strip of magnetic tape rolled up and stored in a cartridge cylinder 2 inches in diameter and 4 inches in length .

Each cartridge can store up to 50 million bytes of data and put in a place shaped cells resembling a honeycomb honey ( honeycomb ) . Each cell is used to place a cartridge and arm taken using electromechanical devices with time between 4-8 seconds . Information in it is read and transferred to magnetic disk for processing .

2.3 . Optical Disk
This tool has been investigated in 1960 by Stanford Ovshinsky . Experiments have been carried out in 1980 by Philips North America which then generated an optical disk system which is based on a 12 -inch video disk .

Data can be stored on an optical disk having tracks 40000 and 132 sectors per side are capable of recording data at 1 billion characters . Optical disks are being developed to be able to store data more than 12.5 billion bytes per side.
Data recorded on the optical disc by burning the small dots on the surface layer of the disk with a laser beam . Because the data recording by burning , the optical disk can not be removed and can not be used again . Company Matsushita in Japan in 1983 has successfully developed an optical disk that can be erased and re-written again .


2.4 . Magnetic Drum
The graphical representation of STEP 2 and urutan2 procedures of a program analysis and programmers to help solve that problem into smaller segmen2 and help in analyzing the operation of another alternatif2

2.5 Magnetic Dubble Memory
memory is a type of non folatil competer who distinguished using thin flim magnetic material to hold small magnet areas , known as bubbles or dominant masing2 data.bubble store one bit of memory in the technology started as promised in the 1970s but failed kormesial as performance diks drive and repair costs in the 1980s overtook profits .

3 . Sequence Access Storage Device ( SASD )
SASD is a savings tool pemasupan sequence , the SASD pemasupan can not be done directly by the CPU in position , and has the greatest capacity ushered the three types of memory , the price per bit of information that can be recorded even cheaper , but also slower pace than other memory .
3.1 . punched Card
Plong card or punch card ( punched card ) was developed in 1887 by Prof . Dr. . Herman Hollerith and first used to process the census in the United States in 1890. Plong card is called the 80 - column punched card and a card for the old computer . Plong 80 column card is also called the standard name card or Hollerith card .

Characters were recorded for each column is done by punching holes (perforate ) certain lines in accordance with the code that used the Hollerith Code .

3.2 . Paper Tape
Paper Tape ( paper tape ) is a continuous sheet of paper that generally have a width of 1 inch or 7/8 inch . Characters recorded on paper tape by drilling holes .

Data recorded on paper tape using paper tape pengeplongan tool connected to a computer or other special machines . Data were recorded on paper tape can be read back into the computer through paper tape reader .

3.3 . Magnetic Tape
Has long be used of 1950 in computer ( UNVAC ) magnetic tape made ​​of coated magnetic iron oxide red brownish
3.3.1 . Reel to Reel
Often used for large computer size ½ inch wide , about 2,400 feet long for each reel of magnetic tape , the beginning and end of the tape there is an area that is not used to record data called leader .


3.3.2 . cartridge Tape
Often used for computer storage mini arguably the result of a backup of the files on the disk , the backup file is a backup / protection if the original file is damaged or missing . Tool reads data tape cartridge tape unit is inside the hard drive .
3.3.3 . cassette
Cassette tape is smaller than the tape cartridge also serves to record the form of a binary signal is known by the computer and is also known as FSK ( frequency shift key'ng )