Programming

Programming

1. Algorithms

   • Algorithms are the simplified version of the code, that is composed before the starting of coding, as a set of instructions for the programmer for ease. They often are written in pseudocode which is a form of coded language which is more in simplified english. The algorithm will usually contain the factors Input, Process, and Output.
   • Output "what is your name?", Input "Name", Name = Read, "Hello, 'Name' "

2. Programming Languages

   • High level language is nearer to english, hence makes the programmer ease when understanding, as it mainly contains english words, and character combinations. Whereas the machine code is the code the computer computes and understands. This is usually binary (1's and 0's) Making the process of executing data and values easier for the computer. The two are converted using a translator program which changes the high level code to machine code, as the computer still needs to understand what the programmer is inputting.
   • Assemblers translate assembly language into machine code. Assembly language is a low level language written in mnemonics and closely reflects the operations of the CPU. The interpreter translates code into machine code, instruction by instruction. The CPU executes each instruction before the interpreter moves onto translate the next instruction. Due to this is will complain of a error upon bad code, making debugs and fixes easier, as the code will not have fully complied. Different languages have their benefits, as some are better suited for scripting, dynmic web pages or client/server side programming. They also usually have different environments which are the aesthetics in which the user programs. They often change in debug ablities and auto documentation ability.

3. Control flow in imperative languages

   • Use of control flow allows to make decisions in an order. And also they can repeat or start new actions based on more recent information. Computer programs use sequence, selection and iterations.
   • Selection: IF the door is locked, THEN unlock the door, ELSE do nothing (go to next instruction) IF the door is closed, THEN open the door, ELSE do nothing Enter the room IF the room is dark, THEN switch on the light, ELSE do nothing Close the door behind you.

4. Handling data in Algorithms

   • Algorithms are setup as a step by step instruction for the computer to follow, and are the heart of all computer programs. Algorithms are used in search engines as the most relevant webpage appears at the top in relative eye to the user. Weather forecasts have algorithms that predict the weather pattern due to certain factors. Integers - Numbers. Real - Full numbers. Boolean - Yes or No. String - array of letters ( words). Character - Singular characters.
   • Testing:
     • Upon creating a program, the creator first must be given the requirements, which would be analysed, upon this a design would be made, and further implantation would then be created to get a real sense of the actual program. This would be compared back to the design. Before being tested, and during which the main aspects of the programs would be checked. To ensure that they fulfil the criteria. Brute force tackling of testing would mean that the program is tested to extreme lengths in an attempt to break the system. Thus finding areas of weakness, and areas for improvement. Finally the improvements would be executed for the newly evolved version of the program.
     • Logic errors are bugs in a program, that causes it to operate incorrectly, or otherwise not execute to begin with. It produces unintended outputs. And Logic errors are usually due to misspellings. Or incomplete code as a line or word may be missing.
     • Syntax errors are errors of a sequence of character or tokens that are not intended to be in the code for that program. Programs will not compile until the syntax error has been corrected.