Register now to access 7 million high quality study materials (What's Course Hero?) Course Hero is the premier provider of high quality online educational resources. With millions of study documents, online tutors, digital flashcards and free courseware, Course Hero is helping students learn more efficiently and effectively. Whether you're interested in exploring new subjects or mastering key topics for your next exam, Course Hero has the tools you need to achieve your goals.
1 Page
t2qsummary
Course: CS 431, Fall 2009School: Alaska Anch
Rating:
Word Count: 101
Document Preview
is This a summary of the questions on test 2. It is subject to change. There are 13 questions at 7 points apiece. That leaves 9 points for your name. 1. abstract stack machines 2. writing code for abstract stack machines 3. context free grammar/semantic action/translation scheme for abstract stack machines 4. reading abstract stack machine code 5. the relationship between translation a scheme and a parser...
Unformatted Document Excerpt
Coursehero >> Alaska >> Alaska Anch >> CS 431Course Hero has millions of student submitted documents similar to the one
below including study guides, practice problems, reference materials, practice exams, textbook help and tutor support.
Course Hero has millions of student submitted documents similar to the one
below including study guides, practice problems, reference materials, practice exams, textbook help and tutor support.
is This a summary of the questions on test 2. It is subject to change. There are 13 questions at 7 points apiece. That leaves 9 points for your name. 1. abstract stack machines 2. writing code for abstract stack machines 3. context free grammar/semantic action/translation scheme for abstract stack machines 4. reading abstract stack machine code 5. the relationship between translation a scheme and a parser implementation 6. same as 5 7. buffer pairs 8. language algebra 9. regular definitions of languages 10. state transition diagrams 11. regular definition of languages and the implementatio...
Find millions of documents on Course Hero - Study Guides, Lecture Notes, Reference Materials, Practice Exams and more.
Course Hero has millions of course specific materials providing students with the best way to expand
their education.
Below is a small sample set of documents:
Below is a small sample set of documents:
Alaska Anch - CS - 431
1 CS 431, Compilers, Assignment 6 Name:_ The first question comes out of section 4.3. The rest stem from section 4.4, the subsections on non-recursive predictive parsing, FIRST and FOLLOW, and the construction of predictive parsing tables. This assig
Alaska Anch - CS - 431
1 CS 431, Compilers, Assignment 7 Assuming everyone is agreeable, this assignment will be taken out of the syllabus for spring of 2004. There will be an assignment 8 posted. Grades will be made on the basis of 3 tests and 7 assignments, 1-6 and 8.
Alaska Anch - CS - 413
CS 413, Computer and Data Security, Sign Up Sheet This is the sign up sheet for security software demonstrations. Just like with picking the piece of software youre interested in, the time slots are first come, first served, and one to a customer. If
Alaska Anch - CS - 413
1Key Based Computer Cryptosystems: Just Enough Background to Believe that They're Not Black MagicKirk Scott Computer Science Department, UAAOutline Background AES/DES Style Encryption Public Key Systems vs. Private Key Systems Public Key E
Alaska Anch - CS - 413
1 CS 413, Computer and Data Security Confusion and Diffusion in Symmetric Encryption I. BackgroundThe former and current national standards, DES and AES, are symmetric key ciphers that work on blocks of bits. This document attempts to illustrate th
Alaska Anch - CS - 413
1 CS 413, Computer and Data Security The Knapsack Problem and Merkle Hellman Encryption I. The Knapsack Problem and Superincreasing KnapsacksMerkle Hellman encryption is an example of an asymmetric encryption system. It was one of the earliest proo
Alaska Anch - CS - 413
1 CS 413, Homework 1, Part 3, Merkle-Hellman Questions 1. Define the term superincreasing with respect to knapsack contents. 2. Can the elements of this vector be used to form a superincreasing knapsack? If so, what would it be? (1, 6, 10, 4, 16) 3.
Alaska Anch - CS - 413
1 CS 413, Homework 2, Working with Policies and Permissions Here are some general remarks about this assignment: The assignment is modeled after those parts of the course Web page which contain examples related to the use of policies and permissions.
Alaska Anch - CS - 413
1 CS 413, Homework 3, the Keytool, the Jarsigner, Signing Code, Hashing, Generating and Verifying Keys in Code, and Encryption in Code This assignment hasn't been written yet.
Alaska Anch - CS - 413
1 Chapter 10 Outline This document is an attempt to describe how the contents of chapter 10 will be covered in class. Not all of chapter 10 will be covered while some things will be covered in greater depth in class than in the book. Also, things wil
Alaska Anch - CS - 413
1CS 413, Computer and Data Security Math for Encryption Overheads I. Thinking Concretely about Division and Remainders. The Euclidean Algorithm for Finding the Greatest Common Divisor. Some Definitions: The material in this section has some indepen
Alaska Anch - CS - 413
1 CS 413, Computer and Data Security Math for Encryption I. Thinking Concretely about Division and Remainders. The Euclidean Algorithm for Finding the Greatest Common Divisor.The material in this section has some independent utility, but its main p
Alaska Anch - CS - 413
1 CS 413, Computer and Data Security Some Proofs and Fermats Little Theorem This set of notes falls into three sections: Proofs or demonstrations of various preliminary things concerning modular fields; a proof of an intermediate result which is need
Alaska Anch - CS - 413
1 CS 413, Computer and Data Security Euler's Theorem and RSA Encryption I. A Remark on Terminology In the set of notes on the mathematics of encryption the algebraic terms group, ring, and field were introduced. The ring was noted as an intermediate
Alaska Anch - CS - 413
1 CS 413, Computer and Data Security Euler's Theorem and RSA Encryption I. A Remark on TerminologyIn the original set of notes on the mathematics of encryption the algebraic terms group, ring, and field were introduced. The ring was noted as an int
Alaska Anch - CS - 413
1 CS 413, Computer and Data Security, Test 2 Outline, Spring 2005 (1) Ch. 3, program security, general questions Qs 1-5 (2) Ch. 3, types of program errors Qs 6-12 (3) Ch. 3, viruses Qs 13-17 (4) Ch. 3, the Internet Worm Qs 18-22 (5) Ch. 3, trapdoors,
Alaska Anch - CS - 109
1 Syllabus, CS 109, Computer Programming, SQL, Fall of 2007 Course Schedule Information: CS A109, Computer Programming (SQL), 3.0 cr. 73350, 601, TR 4:00-5:15 p.m., ESH 104 Instructor: Kirk Scott, Office: SSB 158G, Phone: 786-4820 email: afkas@uaa.al
Alaska Anch - CS - 109
1 An Introduction to Relational Databases 1. 2. 3. 4. 5. Entities, Tables, and Primary Keys One-to-Many Relationships and Foreign Keys One-to-One and Many-to-Many Relationships Nulls and Integrity An Introduction to Data TypesChapter 0 in the book
Alaska Anch - CS - 109
Car vin make model DS Strada Caravan Ranger Celica year stickerprice dealercost 2000 2002 2002 2005 2004 2003 $4,000.00 $5,000.00 $8,500.00 $3,000.00 $4,000.00 $8,000.00 00000 Renault 12345 Fiat 22222 Dodge 33333 Ford 44444 Toyota 55555 Lincoln 66666
Alaska Anch - CS - 109
Alaska Anch - CS - 109
1CS 109 SQL, Assignment 1, Key1. COSC1310 2. 3 1 3 Mary KellyKelly Brenda Lujack 8. F B A 9. 7 10. 63. Lineas Lujack Richard 4. 1 4 3 5. 9 1 9 1 9 2 9 2 A B A B A B11. 91 12. A A 13. CRN 87 88 89 14. course department and number ENGL35206
Alaska Anch - CS - 109
1 CS 109 SQL, Assignment 4 1. Write an SQL query that will select all fields from records of the salesperson and carsale tables where the spno is the same. In other words, form the equijoin of these two tables on the spno field.2. Write an SQL quer
Alaska Anch - CS - 109
1 CS 109 SQL Assignment 6, Key Questions 1 and 2 are on chapter 6. If you are doing the odds only, do all of the lettered parts of question 1 and you may skip all of the parts of question 2. 1a. Write a query that will find the vin, make, model, and
Alaska Anch - CS - 109
1 7. Set Operations 7.1 7.2 7.3 7.4 7.5 Introduction UNION Queries Queries with IN (Intersection) Queries with NOT IN (Set Subtraction) Unions, Joins, and Outer Joins7.1 Introduction 1. The technical term for a table is a relation. A relation is li
Alaska Anch - CS - 109
1 CS 109 SQL Assignment 8 Key 1. Write a query that will find the make and model of cars that have been sold. Do this with a subquery using IN. SELECT make, model FROM Car WHERE vin IN (SELECT vin FROM Carsale); 2. Write a query that will find the ma
Alaska Anch - CS - 109
1 9. Aggregation and Group By 9.1 9.2 9.3 9.4 9.5 Grouping By One Field Grouping By More than One Field GROUP BY with HAVING Finding Aggregates of Aggregates More on Nulls9.1 Grouping By One Field 1. Recall that the term aggregation referred to bui
Alaska Anch - CS - 109
1 CS 109 SQL Assignment 9 1-8, GROUP BY without HAVING. 1. Write a query that will list each make and the count of the number of the make's occurrences in the car table, grouped by make.2. Write a query that will find each year and the sum of (stic
Alaska Anch - CS - 109
1 10. Correlated Subqueries 10.1 10.2 10.3 10.4 Correlated Subqueries EXISTS NOT EXISTS Double NOT EXISTS10.1 Correlated Subqueries 1. Recall how subqueries with IN work. There is an inner query and an outer query. The inner query is run first, pro
Alaska Anch - CS - 109
1 CS 109 SQL Assignment 10 Key Some of the questions in this assignment describe queries for cases that are exceptional. If you test your answers on a copy of the car dealership, some of these queries may return obscure results. 1-14, correlated subq
Alaska Anch - CS - 109
1 CS 109 SQL Assignment 11 Key If you are assigned to hand this in, if you want to, you can do it entirely by hand. (More details are given below.) As a reminder, here are the definitions of the Car and Carsale tables with no constraints specified: C
Alaska Anch - CS - 109
CS 109 SQL Assignment 12 Instructions In class you'll be given a sheet of paper for assignment 11, part 2, which contains this information: 1. A small E-R diagram which illustrates a database scenario. 2. A brief verbal description of anything that m
Alaska Anch - CS - 109
1 Java Chapter 2 Beginning to Program 2.1 Initial Example The program given in the previous set of notes is repeated here. This will be the starting point for understanding Java programs. The goal is to explain as much about the program as possible-a
Alaska Anch - CS - 109
1 Java Chapter 2 Multiple Choice Questions 1. User written programs in Java are: a. b. c. d. Classes. Modules. Routines. Procedures.2. User written classes in Java should have the following kind of access: a. b. c. d. Public. Private. Package. Rest
Alaska Anch - CS - 109
1 Java Chapter 2 Key 1.public class MyProg { public static void main(String[] args) { .2. compiling 3./* My name is Kirk Scott. */public class Firstprog { public static void main(String[] args) { System.out.println("/*/"); System.out.println("/
Alaska Anch - CS - 109
1 Java Chapter 3 Key 1. no 2. no 3. no 4. yes 5. yes 6. yes 7. yes 8. no 9. no 10. yes 11. no 12. 7 13. 14.6 14. can't assign a new value to a final 15. 4 16. 19 17. 4 18. 1 19. 3 20. 10 21. 30.0 22. 18.0223. 0.0 24. can't store a double in an in
Alaska Anch - CS - 320
1 CS 320 Questions, Ch. 2: Operating-System Structures 1. The book gives 5 different elements of process management. Give any 3. 2. Suppose a user process is about to make a system call that requires passing parameters to the operating system. Give o
Alaska Anch - CS - 320
1 CS 320 Answers, Ch. 2: Operating-System Structures 1. Creating/deleting, suspending/resuming, synchronizing, interprocess communication, deadlock handling. 2. In the registers, in memory with the address in a register, on the stack. 3. Context swit
Alaska Anch - CS - 320
1 CS 320 Questions, Ch. 3: Processes 1. Give the book definition of a process. 2. What is the key distinction between a program and a process? 3. The book gives 5 components of a process. Give any 3 of these. 4. The book gives 5 process states. Give
Alaska Anch - CS - 320
1 CS 320 Answers, Ch. 3: Processes 1. Its a running program. 2. The process has been given a PCB and is under the control of the scheduler. 3. Text section, program counter, register values, process stack, data section. 4. New, running, waiting, read
Alaska Anch - CS - 320
1 CS 320 Questions, Ch. 4: Threads 1. The book gives a list of four things that a thread has that are unique to itself. Give any one of these. 2. A thread is based on the idea of sharing a process. The book gives a list of three things which threads
Alaska Anch - CS - 320
1 CS 320 Answers, Ch. 4: Threads 1. Thread id, program counter, register set, stack. 2. Code section, data section, other O/S resources like open files and signals. 3. Responsiveness, resource sharing, economy (process creation), utilization of multi
Alaska Anch - CS - 320
1 CS 320 Answers, Ch. 7: Deadlocks 1. 2 resources, 2 processes. 2. Mutual exclusion, hold and wait, no preemption, circular wait. 3.R1P1 R2P24. Yes. 5.P3 R1P1P2R2 P46. No.27. Necessary and sufficient. 8. Necessary. 9. All 5. 10.
Alaska Anch - CS - 320
1 CS 320 Questions, Ch. 8: Main Memory Memory management without paging 1. Assuming multiprogramming with contiguous memory allocation, what two registers would be needed at a minimum as hardware support for memory mapping? 2. Assuming multiprogrammi
Alaska Anch - CS - 320
1The Minimal Instruction Set Computer (MISC) in Java,Introduction This document explains a simulation of a simple computational machine which is written in the Java language. In particular, this document describes the internal architecture of the
Alaska Anch - CS - 320
1 CS 320, Assignment 2 Do not use graphical versions of the MISC code. This assignment is a nongraphical assignment. Important initial information: Assignment 2 is conceptually broken into 2 parts. It is presented in this way because it might be easi
Alaska Anch - CS - 320
0000011000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
Alaska Anch - CS - 320
Memory removed from memorylist at top of rpf.0**Contents of memorylist.326496128160192224*PCB added to processlist at bottom of rpf.CONTENTS OF PCB. 03200000000000000000000000000000000000000000000100000000000000000000000
Alaska Anch - CS - 109
1 Java Unit 1 Some Background Information on Java and Object-Orientation 1.1 1.2 1.3 1.4 1.5 Java Object-Orientation UML Downloading and Installing Java and TextPad Practical Notes1.1 Java What are some of Java's characteristics that distinguish it
Alaska Anch - CS - 109
1 Java Unit 1 Questions 1. The Java language is: a. b. c. d. Compiled to obtain executable target files. Interpreted at run time. Designed for recursive string processing. Designed for matrix algorithm processing.2. The Java language is designed to
Alaska Anch - CS - 109
1 Java Unit 1 Question Answers 1. b 2. d 3. a 4. c 5. c 6. d 7. b 8. d 9. c 10. b 11. a 12. c 13. c 14. d
Alaska Anch - CS - 109
1 Java Unit 2 Beginning to Program 2.1 2.2 2.3 2.4 2.5 Initial Example Information on Program Appearance and Printing The Java API Documentation Creating and Using Objects Errors2.1 Initial Example The goal of this section is to give an initial exp
Alaska Anch - CS - 109
1 Java Unit 2 Assignment 1. Give the 2 standard lines of code which would appear at the beginning of a Java program saved under the file name MyProg.java. I am not counting lines containing braces in the count of 2 lines of code, but also show the br
Alaska Anch - CS - 109
1 Java Unit 2 Key, Odds 1.public class MyProg { public static void main(String[] args) { .3./*My name is Kirk Scott.*/public class FirstProg { public static void main(String[] args) { MyTerminalIO myterminal = new MyTerminalIO(); mytermina
Alaska Anch - CS - 109
1 Java Unit 2 Questions 1. User written programs in Java are: a. b. c. d. Routines. Classes. Modules. Procedures.2. User written classes in Java should have the following kind of access: a. b. c. d. Private. Public. Package. Restricted.3. Program
Alaska Anch - CS - 109
1 Java Unit 2 Question Answers 1. b 2. b 3. c 4. d 5. a 6. b 7. a 8. d 9. c 10. b 11. b 12. d 13. d 14. a 15. c 16. b 17. b 18. c 19. b 20. a 21. b 22. d223. d 24. b 25. c 26. c
Alaska Anch - CS - 109
1 Java Unit 3 Simple Data Types, Operators, and Variables 3.1 3.2 3.3 3.4 3.5 3.6 Data Types, Variable Declaration and Initialization Assignment and the Relationship Between Numeric Types Assignment and Simple Arithmetic The Math Class The String Cla
Alaska Anch - CS - 109
1 Java Unit 3 Assignment 1-11, yes or no questions. Certain variable declarations are given. Assume that between the declarations and the questions the variables are assigned valid values. Each question shows an assignment between two of the variable
Alaska Anch - CS - 109
1 Java Unit 3 Key, Odds 1. no 3. no 5. yes 7. yes 9. no 11. no 13. 14.6 15. 4 17. 4 19. 3 21. 30.0 23. 0.0 25. 3 27. world 7 (space between world and 7) 29. 15 31. Math.PI 33-37. public class Unit3Prog { public static void main(String[] args) { MyTer
Alaska Anch - CS - 109
1 Java Unit 3 Questions 1. When writing non-integral numeric constants in Java: a. b. c. d. Commas are allowed, but decimal points are not. Both decimal points and commas are allowed. Decimal points are allowed, but commas are not. Neither decimal po