2. 1 Final Exam Study Guide 4 Final Examination is scheduled on Wednesday May 9th at 4PM 4 There are 8 questions with or without sub- parts and the exam carries 30 Marks 4 Let us look at the topics included in the exam

3. 2 Topics Included 4 Algorithms 4 Operating Systems 4 Processor Architecture 4 Searching and Sorting a List 4 Binary and Hex Numbers 4 Bits, Bytes, Pixels

4. 3 Topics Included 4 Digital Logic and expressions 4 Software Engineering Basic Concepts 4 Waterfall model and spiral model 4 Arrays, Contiguous and Linked Lists, Stacks, Queues and Binary Search Trees 4 Database Systems (Network and Relational) 4 E-Commerce Concerns and Encryption 4 Ethics in Computing

5. 4 Topics NOT in Exam 4 C++ Programming NOT in exam 4 Micro Machine Language NOT in exam 4 Networks NOT in exam 4 2GL,3GL, 4GL NOT in exam

6. 5 *Algorithms 4 An algorithm is a step by step method to solve a problem with a definite reachable termination state 4 Most algorithms can be developed by following the instructions below: –Read the problem statement and rewrite it in your own words to make it simple –Consider nouns used and identify the data items –Consider the verbs used and identify the actions to be taken

7. 6 *Algorithms –Write the initial algorithm in terms of WHAT is to be accomplished –Refine each step of the initial algorithm to include the details of HOW the step would be accomplished 4 In the exam, expect a question that asks you to develop an algorithm for solving a given problem on computer 4 DO NOT WRITE A C++ PROGRAM IN YOUR ANSWER

8. 7 Architecture 4 The processor obtains instructions one by one from memory through a “bus” using PC 4 Instructions are loaded in IR(instruction register) in the control unit and operands are brought into the data path 4 ALU operates on the operands and result is sent to memory or held in registers 4 Can you identify all registers and their usage? 4 Can you point out the steps in multiplying two numbers that are stored in memory?

9. 8 Operating Systems 4 Operating systems are programs that run the computers 4 Distinguish between batch and interactive systems 4 Think about the “time-sharing” systems 4 Think about Windows, UNIX and other operating systems

10. 9 Searching and Sorting a List 4 We looked at the while statement that is needed in searching and sorting operations 4 while loop is recommended when it is not known how many times the loop will execute 4 We developed two algorithms for searching a list for the occurrence of a target value 4 In the first algorithm, the list was sorted so we had to stop the search if current value exceeded the target value

11. 10 Searching and Sorting a List 4 In the while loop continuation condition, we used logical AND 4 continue the search if target not found AND current entry is less than target AND the current entry is not the last entry 4 Incase of unsorted list, the condition “current entry is less than target” is deleted 4 Also look at steps involved in inserting a name into a list

12. 11 *Binary and Hex Numbers 4 Binary system has just two symbols 0 and 1 4 It represents all values in patterns of 0 and 1 4 Like decimal system, binary is also positional number system 4 It means that the position of a bit in a pattern carries a weight 4 Weights are powers of 2 increasing from rightmost bit towards left, starting at 0 for integer values(Example: 1101)

13. 12 *Binary and Hex Numbers 4 Hex system has 16 symbols, all the way from 0 to F 4 It is also positional number system. 4 For example, 1F, 1A, 2B 4 Its digits carry weights expressed as powers of 16 starting from 0 at the rightmost bit position in the integer values

14. 13 *Converting Binary/Decimal 4 Binary to decimal conversion assigns position numbers. These are written as powers of 2, then all products are added 4 Example: 1001 4 Conversion from decimal to binary involves dividing the number repeatedly by 2 until a value less than 2 is left. Writing the remainders in each step from last value to first value will give us the binary equivalent

15. 14 Bits, Bytes and Pixels 4 A bit is a binary digit 4 It can assume the value of 0 or 1 4 Collection of 8 bits is known as a byte 4 A byte is the minimum unit in our computer memory and hard disk jargon 4 1KB means 1024 bytes 4 1MB means 1024KB 4 1GB means 1024MB

16. 15 Bits, Byes and Pixels 4 Suppose that a file has 4776 characters 4 Since each character has one bytes ASCII code, the file occupies 4776 bytes 4 In terms of KB, 4776/1024 means 4.66KB 4 A CD contains 650MBand hard disk is 20GB. How many CD’s can be copied into the hard disk? 4 (20*1024/650) equals 31.5

17. 16 Bits, Bytes and Pixels 4 An image has thousands of dots. Each dot is called a pixel. Each pixel takes up some memory space 4 A black and white image on 640x480 screen has 307,200 bits of information. You need 38,400 bytes to store this image ( 37.5KB) 4 If the image is colored, we will need 1 byte per pixel for 256-color image

18. 17 Digital Logic 4 Boolean logic consists of three operations AND,OR,NOT and two values 0 and 1 4 AND operation results in a 1 only if BOTH operands are 1 4 OR operation results in a 1 if ANY operand is equal to 1 4 NOT operation turns a 1 into 0 and a 0 into 1 4 Our focus is on converting real-life situations into logical expressions

19. 18 Software Engineering 4 We introduced the motivation for software engineering and why is it so important 4 We looked at waterfall model and spiral model of SE activities

20. Adapted from "Software Engineering A Practitioner's Approach" by Roger Pressman 19 *WaterFall Model Diagram

21. 20 *The WaterFall Model 4 This model is a sequence of stages 4 During analysis, the user requirements are identified and systems specs. are prepared 4 During design, the number of modules and their interconnection is finalized. The data types and structure is specified 4 During coding, actual programming is done 4 Testing is done to make sure there are no errors (alpha-release and beta-release)

22. 21 Spiral Model 4 It was realized that the waterfall model is not optimal as it is a one-way model 4 If a problem is discovered in a later stage, there is no way to go back and correct the problem 4 Therefore, spiral model was proposed in which the SE activity occurs in a spiral thus giving a chance to correct the mistakes

23. Adapted from "Software Engineering A Practitioner's Approach" by Roger Pressman 22 Spiral Model Diagram

24. 23 Data Structures 4 Arrays 4 Contiguous lists 4 Linked lists 4 Stacks and Queues 4 Binary Search Trees 4 Expect one to two questions from these topics, mostly specific

25. 24 Databases 4 We covered network database model and relational database model 4 In the network model, several information files are linked with physical disk addresses 4 In relational database model, a search is performed on a primary field in every file

26. 25 Encryption 4 Symmetric key encryption was covered with examples showing the use of XOR logical operation of the value with a key for both encryption and decryption 4 DES was introduced that uses a 56-bit key 4 The problem of key distribution led to public-private key algorithms where encryption and decryption is carried out with separate keys

27. 26 Ethics 4 Expect a short question related to ethics in computing. Maybe a specific case requesting your opinion

28. 27 How do you feel about computers? THE END yep no

29. 28 Pre_Exam Standing