1. How to Program Damian Gordon

3. Characteristics of a System Input Output Proc1 Proc2 Proc3

4. Characteristics of a Computer System User Defined Programs CPU Peripherals Networks Operating System (O/S) Applications Software (S/W) Hardware (H/W) Computer System

5. ALGORITHMS

12. Control Statements

29. EXAMPLES OF ALGORITHMS

30. Double Number

33. Triple Number

35. Check for Odd/Even

37. Count Next Ten

39. Sum Numbers 1 to 10

41. Check if Number is Prime

44. JAVA Keywords

45. JAVA Keywords abstract double int strictfp boolean else interface super break extends long switch byte final native synchronized case finally new this catch float package throw char for private throws class goto protected transient const if public try continue implements return void default import short volatile do instanceof static while

51. Java Virtual Machine

52. Hello World Program public class HelloWorld { // A program to display the message // "Hello World!" on standard output public static void main(String[] args) { System.out.println("Hello World!"); } } // end of class HelloWorld

54. Bubblesort

61. Modularisation

66. List of Variables

68. Bubblesort - Methods

71. Factorial

72. Find the index where a value X is stored

77. /* program to take in an array and an element value and find the element in the array */ #define N 10 #include <stdio.h> main () { int binary_search(int,int,int [],int); int a[N]= {2, 4, 6, 8, 10, 12, 14, 16, 18, 20}; int pos, x, start, end; printf (&quot;Enter the number you are looking for:&quot;); scanf (&quot;%d&quot;,&x); start = 0; end = N-1; pos = binary_search(start, end, a, x); if (pos >= 0) printf (&quot;The value %d is in position %d&quot;,x,pos); else printf (&quot;The value %d is not in the array&quot;,x); return 0; }