CS 079 Purdue

Study Material >> Indiana Colleges & Universities >> Purdue >> Computer Science (CS) >> CS 079
Find below a list of sample documents for Purdue CS 079 course.
 

Purdue CS 079 documents:

  • Purdue CS 079 Fall 2009
    CS 502 Compiling and Programming Systems Mid-term Examination, 10/30/07 Instructions: Read carefully through the whole exam first and plan your time. Note the relative weight of each question and part (as a percentage of the score for the whole exam
  • Purdue CS 079 Fall 2009
    CS 502 Compiling and Programming Systems Final and Qualifying Examination Part I, 12/11/2007 Instructions: Read carefully through the whole exam first and plan your time. Note the relative weight of each question and part (as a percentage of the sco
  • Purdue CS
    CS 502 Compiling and Programming Systems Mid-term Examination, 10/30/07 Instructions: Read carefully through the whole exam first and plan your time. Note the relative weight of each question and part (as a percentage of the score for the whole exam
  • Purdue CS
    CS 502 Compiling and Programming Systems Final and Qualifying Examination Part I, 12/11/2007 Instructions: Read carefully through the whole exam first and plan your time. Note the relative weight of each question and part (as a percentage of the sco
  • Purdue CS
    Solutions of Homework 5: Big O, Important Note: log n Q1. 1. 2. 3. 4. Q.2 i. 6n2 - 2n 6n2 = O(n2) . . . . . . . . . . . . . . . (1) 6n2 - 2n 6n2 - 2n2 = 4n2 = (n2 ) . . . . (2) Form (1) and (2): 6n2 - 2n log n = (n2 ). 2 ii. log6nn+1 6n2 n3 = O
  • Purdue CS
    Solutions of Homework 6: Programming Project The following is the complete C program that implements the given function with the required modifications. #include <math.h> #include <stdio.h> #include <stdlib.h> int count; double fun(double n){ count+
  • Purdue CS
    Solutions of HW#1: Basic Logic Q.1 Make truth tables for the following statement: (p q) (q p) Answer p T T F F q T F T F pq T F T T qp T T F T (p q) (q p) T T F T (p q) (p q) Answer p T T F F q T F T F pq T F T T p q T T T F (p q) (p
  • h7
    Purdue CS
    [50] Homework 7: Basic Number Theory [10] Use the Euclidean algorithm to find (a) gcd(1529, 14039), (b) gcd(1111, 11111). [10] Compute 61531 mod 713. [10] Prove that 937 is an inverse of 13 modulo 2436. [10] Solve 4x = 5 mod 9. [10] Encrypt the mess
  • 18
    Purdue CS
    Chapter 18: Introduction to Assurance Overview Why assurance? Trust and assurance Life cycle and assurance June 1, 2004 Computer Security: Art and Science Slide #18-1 Overview Trust Problems from lack of assurance Types of assurance Lif