Coursehero >> Wisconsin >> Wisconsin Milwaukee >> CS 131

Course Hero has millions of student submitted documents similar to the one below including study guides, homework solutions, papers, exam answer keys and textbook solutions.

Review Final 1. Know the following terms and their de nitions: computer science, algorithm, boolean algerbra, boolean operators, boolean variables, logical expressions, truth tables, circuits, tautology, contradiction, ip- op, memory, bit, byte, kilobyte, megabyte, gigabyte, memory address, most/least signi cant bit, RAM (and the properties of RAM), DRAM, SDRAM, mass storage, online, o ine, disk storage, ash memory, disk access, seek time, latency time, access time, transfer rate, magnteic storage, optical storage, track, sector, binary, bit, ASCII, Unicode, representing text, representing images, representing sound, binary, hexadecimal, two s complement, machine code, processor, cpu, alu, cu, registers (and types), machine cycle, operating system, hardware, software, batch processing, interactive processing, real-time processing, multitasking systems, time-sharing, shell, kernel, windows manager, le manager, device drivers, memory manager scheduler, le manager, ROM, bootstrap, booting, network, LAN, MAN, WAN, protocol, bus network, ring network, token ring protocol, star network, hub, router, internet, Internet, peer to peer, interprocess communication, client, server, malware, virus, worm, trojean horse, sypware, phishing, spam, encryption, http, url, html, domain, source, dns, twisted-pair wire, coaxial cable, ber-optic cable, Church-Turing Thesis, pseudo-code, loop, syntax, semantics, assignment, input/output, conditional, loop, designing a while loop, algorithm design methods, programming language, high-level language, assembly language, compiler, lexical analysis, parer, code generator, control structure, comments, goto, programming paradigms, variables, data structure, arrays (1 and 2 D), linked lists, null pointer, head pointer, stack, queue, tree, binary tree, binary search tree, database, database management system, application program, relational model, relation, attributes, tuple, SELECT, PROJECT, JOIN, SQL. 2. Know all the same ideas from Midterm Review, if you need more questions look in your book at the end of chapter review problems. Know how to get from a truth table to a logical expression to a circuit, how to convert binary, decimal, and hexidecimal numbers into other forms. Know how an OS works and know the architecture inside a computer. Lastly, understand how boolean algebra works. Bring examples of these to class on Wednesday if you want to do some of these problems in class. 3. The factorial of 0 is de to ned be 1. The factorial of a positive integer is de ned to be the product of all positive integers less than or equal to that number. For example, the factorial of 5 is 5 4 3 2 1 = 120. Given below is the skeleton for a program that computes the factorial of a number entered by the user. Design the while loop to complete the program. You may assume that the user enters a number greater than 0. output Please enter a positive integer ( > 0 ) input value assign ans the value 1 Your while loop goes here output ans 4. Using the Employee relations from Section 9.4, answer the following questions. (a) Write a sequence of relational operations that would obtain a list of the names and addresses of the company s employees. (b) Write a sequence of relational operations that would obtain a list of the names and SS numbers of all employees currently working in the Sales Department. (c) Write a sequence of relational operations that would obtain a list of the names and address of all employees how have worked are are currently working in the Accounting Department. (d) Do the last three problems also in SQL. 5. Re-write the following rat s nest program so that there are no goto statements. if (X > 5) then goto 80 X = X + 1 goto 90 80 X = X + 2 90 Y = 5 6. Translate the following into the machine language from class. Assume that the variables X, Y, and Z are located at memory locations 00, 01, and 02, respectively, and that the program starts at memory location 10. if(x equals 0) ( assign Z the value Y + W ) else ( assign Z the value Y + X ) 7. Translate the following into the machine language from class. Assume that the variable x is stored at memory location B3 and the program begins and memory location 00. assign x the value 0 while(x < 3) do ( assign x the value x + 1 ) 8. What is the di erence between the meaning of the equals symbol in the statement if (X = 5) then ( ...) as opposed to the assignment statement x = 2 + Y Which of the three stages of compilation would be used to di erentiate between the meanings? 9. Assume that you have an 1-D array of with 100 elements named numbers. Make a 2-D array, numbers2 that is 10 by 10 which stores all of the elements. Hint: the rst 10 elements are in the rst row, the second 10 elements are in the second row, etc. Look at how we work with 2-D arrays. 10. What is the theory of computation? What is the halting problem and can we compute the answer? Why or why not?

Find millions of documents here - Study Guides, Homework Solutions, Papers, Exam Answer Keys and more. Course Hero has millions of course related materials that will enable you to learn better, faster and get an A in all your courses.
Below is a small sample set of documents: