Online study resources available anywhere, at any time
High-quality Study Documents, expert Tutors and Flashcards
Everything you need to learn more effectively and succeed
We are not endorsed by this school |
- Course Hero has verified this tag with the official school catalog
We are sorry, there are no listings for the current search parameters.
We don't have any study resources available yet.
We don't have any study resources available yet.
We don't have any study resources available yet.
We don't have any study resources available yet.
We don't have any study resources available yet.
We don't have any study resources available yet.
We don't have any study resources available yet.
We don't have any study resources available yet.
We don't have any study resources available yet.
We don't have any study resources available yet.
We don't have any study resources available yet.
We don't have any study resources available yet.
We don't have any study resources available yet.
We don't have any study resources available yet.
We don't have any study resources available yet.
We don't have any study resources available yet.
We don't have any study resources available yet.
We don't have any study resources available yet.
We don't have any study resources available yet.
We don't have any study resources available yet.
We don't have any study resources available yet.
We don't have any study resources available yet.
We don't have any study resources available yet.
We don't have any study resources available yet.
We don't have any study resources available yet.
We don't have any study resources available yet.
We don't have any study resources available yet.
We don't have any study resources available yet.
We don't have any study resources available yet.
We don't have any study resources available yet.
We don't have any study resources available yet.
We don't have any study resources available yet.
We don't have any study resources available yet.
We don't have any study resources available yet.
We don't have any study resources available yet.
We don't have any study resources available yet.
We don't have any study resources available yet.
We don't have any study resources available yet.
We don't have any study resources available yet.
We don't have any study resources available yet.
We don't have any study resources available yet.
We don't have any study resources available yet.
We don't have any study resources available yet.
We don't have any study resources available yet.
We don't have any study resources available yet.
We don't have any study resources available yet.
We don't have any study resources available yet.
We don't have any study resources available yet.
We don't have any study resources available yet.
We don't have any study resources available yet.
We don't have any study resources available yet.
We don't have any study resources available yet.
We don't have any study resources available yet.
We don't have any study resources available yet.
We don't have any study resources available yet.
We don't have any study resources available yet.
We don't have any study resources available yet.
We don't have any study resources available yet.
We don't have any study resources available yet.
We don't have any study resources available yet.
We don't have any study resources available yet.
We don't have any study resources available yet.
We don't have any study resources available yet.
We don't have any study resources available yet.
We don't have any study resources available yet.
We don't have any study resources available yet.
School: Purdue
Solution of Homework 2: Language of Mathematics Q1. Prove AB =AB without using the De Morgans law and Venns Diagram. Answer To prove that two sets are equal, we need to prove that each set is a subset of the other: i) To prove that A B A B : x A B xAB /
School: Purdue
Course: Distributed Systems
CS 390S: Secure Programming Labs Student's choice: 2 out of these 6 possibilities. Labs are described at the SEED project. The choices are: 1. Buffer Overflow Vulnerability Lab: exploit the buffer overflow vulnerability. 2. Return-to-libc Attack Lab: expl
School: Purdue
Course: Systems Programming
Login Go Back to Your Class Why Homework is Better with Friends 1314 Admit it, you had the same dumb question. 921 When the prof says, "Any questions?" there are actually questions. 776 More bonding happens at 2AM, really. 647 When you're totally lost,
School: Purdue
Course: Introduction To The Analysis Of Algorithms
CS381 Homework 3 Sketch of Solution Fall 2013 Problem 1. The peak demand for the resource occurs at a time that is covered by the largest number of intervals, a number that can be computed in O(n log n) time as follows. 1. Initialize a counter variable co
School: Purdue
Solution of Homework 3 * Note that the approximate functions shown below are not unique and are provided for the sake of illustration not perfection. Prob. 1 n n! e Using Stirlings formula: n n 2n ln k = ln n ! n (ln n 1 ) + 0 . 5 ln( 2 n ) k =1 Algori
School: Purdue
Course: Programming I
2012/09/18 04:50 1/4 LAB5: User Defined Classes LAB5: User Defined Classes Overview: In this lab you will learn how to create user defined classes. We are going to simulate that West Lafayette is building a simple zoo, and you must help them. Think about
School: Purdue
Course: Introduction To The Analysis Of Algorithms
CS381 Homework 3 Sketch of Solution Fall 2013 Problem 1. The peak demand for the resource occurs at a time that is covered by the largest number of intervals, a number that can be computed in O(n log n) time as follows. 1. Initialize a counter variable co
School: Purdue
Course: Foundations Of Computer Science
CS182 Homework 6 Spring 2011 In all of the following questions, show the details of your work (it is not enough to just give the answer). Question 1. (10 points) Use the Euclidean algorithm to nd (a) gcd(1529, 14039), (b) gcd(1111, 11111). Question 2. (10
School: Purdue
Course: Foundations Of Computer Science
[40] Homework 5: Big O, . [10] Select the best big Oh notation for each expression. Justify by showing the constants c and n0 . Note that f (n) = O(g(n) if there are constants c > 0 and n0 > 0 so that for all n n0 we have |f (n)| c g(n). 1. 100n + 1. 2. (
School: Purdue
Course: Systems Programming
CS252: Systems Programming Ninghui Li Final Exam Review Topic 1 Understand pointer usage and arithmetic &, *(p+i) Understand argument passing behavior (especially those involving pointers) 2d Array implementation Using function pointers in generic functio
School: Purdue
Course: Systems Programming
16782: execve("/.bors-2/p1/mozilla-1.7.13/sun4-sos5/mozilla", 0xFFBEFCCC, 0xFFBEFCD8) argc = 2 16782: resolvepath("/usr/lib/ld.so.1", "/usr/lib/ld.so.1", 1023) = 16 16782: open("/var/ld/ld.config", O_RDONLY) = 3 16782: fstat(3, 0xFFBEF518) = 0 16782: mmap
School: Purdue
Course: Systems Programming
Midterm Exam CS354 Spring 2007 Name:_ Question Max. True/False 10 pts. Short Questions 1-5 15 pts. Short Questions 6-10 15 pts. 11, 5 pts. 12. 5 pts. 13. 10 pts. 14. 15 pts. 15. 10 pts 16. 15 pts Total: Current Part 1. True False Questions Answer True/Fal
School: Purdue
Course: Operating Systems
A Practical Dynamic Buffer Overflow Detector Olatunji Ruwase Transmeta Corporation 3990 Freedom Circle Santa Clara, CA 95054 tjruwase@transmeta.com Monica S. Lam Computer Systems Laboratory Stanford University Stanford, CA 94305 lam@stanford.edu tha
School: Purdue
Course: Programming Applications For Engineers
Chapter 2 Introduction to the C Language CS 158/159 C Programming Program Structure Preprocessor Directives stdio.h will appear in all programs this semester Other libraries are math.h, stdlib.h, etc. Global Declarations Function prototypes We will never
School: Purdue
Course: Programming Applications For Engineers
Chapter 1 Introduction to Computers CS 158/159 C Programming Computer Hardware Storage RAM Disks Input Processing Output Keyboard Mouse Microphone Disks CPU ALU Registers L1 Cache Monitor Printer Speaker Disks Computer Hardware Faster Slower Computer Soft
School: Purdue
Course: Systems Programming
CS252: Systems Programming Ninghui Li Based on Slides by Prof. Gustavo Rodriguez-Rivera Topic 15: Internet Overview History of the Internet 1962 Galactic Network idea (J.C.R. Licklider of MIT) Envisions a globally interconnected set of computers through w
School: Purdue
Course: Systems Programming
CS252: Systems Programming Ninghui Li Based on slides by Prof. Gustavo Rodriguez-Rivera Topic 16: Socket Programming & Project 5 Sockets API They were introduced by UNIX BSD (Berkeley Standard Distribution). Sockets are a form of IPC (Inter-Process Commun
School: Purdue
Course: Systems Programming
CS252: Systems Programming Ninghui Li Based on Slides by Prof. Gustavo Rodriguez-Rivera Topic 17: Signals, Process Credentials Process Properties A process has the following properties: PID: Index in process table PPID: Parent process id (affect signal d
School: Purdue
Course: Systems Programming
CS252: Systems Programming Ninghui Li Topic 18: Lab 6: The Process Games The Process Games In each process game, between 2 and 5 programs can participate. The arena program creates (i.e., forks) N processes of each program, where N is at least 10, and N*
School: Purdue
Course: Intro Organizatnl Comp
Functions allow you to perform calculations on the database. The AVERAGEIF function requires which arguments? Range, criteria, average_range. When using text as a criterion it must be enclosed with quotation marks. Range is NOT a valid argument for the M
School: Purdue
CS 182 Fall 2010 Michael S. Kirkpatrick Name: MIDTERM #1 This is an open book, open notes exam. However, you are not allowed to share any material with anyone else during the exam. Any evidence of academic dishonesty will be dealt with strictly in accorda
School: Purdue
Course: C Language
%INPUT data = [40; 96; 85; 21] %EXECUTABLE STATEMENT while data > 1 if mod(data, 2) = 0 data = data / 2; else data = (data * 3) + 1; end fprintf(' ') fprintf(data) end fprintf('\n') data = 40 96 85 21 Error using => fprintf Invalid file identifier. Use fo
School: Purdue
Course: Systems Programming
CS252: Systems Programming Spring 2015 Mid-term Exam 1 (Time: 75 minutes) Answer Filling in blanks (5 pts, 1pt each space) Fill in each of the underlined empty spaces with one word or a short phrase. A process (program in memory) has the following memory
School: Purdue
Course: Systems Programming
CS252: Systems Programming Spring 2014 Mid-term Exam 2 (Time: 50 minutes) Your login: Your name (Last, First): Part 1: Filling in the Blanks (15 pts, 1.5pt each space) Fill in each of the underlined blanks with one word or a short phrase. A process may b
School: Purdue
Course: Systems Programming
CS252: Systems Programming Spring 2015 Mid-term Exam 2 (Time: 75 minutes) Answer Part 1: True/False Questions (28 pts, 2pts each) Circle yes or no. yes / Interrupt handler code are executed in the kernel mode. / no Kernel mode is more powerful than the us
School: Purdue
Solution of Homework 2: Language of Mathematics Q1. Prove AB =AB without using the De Morgans law and Venns Diagram. Answer To prove that two sets are equal, we need to prove that each set is a subset of the other: i) To prove that A B A B : x A B xAB /
School: Purdue
Solution of Homework 3 * Note that the approximate functions shown below are not unique and are provided for the sake of illustration not perfection. Prob. 1 n n! e Using Stirlings formula: n n 2n ln k = ln n ! n (ln n 1 ) + 0 . 5 ln( 2 n ) k =1 Algori
School: Purdue
CS182 Spring 2013 Homework 3 Prof. Alex Pothen and Vernon Rego Due date: Friday, February 22, 2013 (before class). 1. (4pts) Find these terms of the sequence cfw_an , where an = (2)n + 5n. (a) a0 . (b) a1 . (c) a3 . (d) a6 . 2. (12pts) Find f (1), f (2),
School: Purdue
Course: Data Structure And Algorithms
4/8/12 CS25100: Data Structures and Algorithms, Project 2 CS25100: Data Structures and Algorithms, Spring 2012 Project 2, Stacks and Queues Description The goal of this assignment is to implement and use elementary data structures, and to introduce you to
School: Purdue
Course: Data Structure And Algorithms
4/8/12 CS25100: Data Structures and Algorithms, Project 3 CS25100: Data Structures and Algorithms, Spring 2012 Project 3, Convex Hull Description This project considers one of the most basic operations in computational geometry, namely the computation of
School: Purdue
Course: Operating Systems
Lab 1 Page 1 of 1 CS 503 Fall 2008 HW 1: Process Management (70 pts) Due: Friday 02/15/2008, 11:59 PM Problem (30 + 20 + 20 pts) 1. Solaris supports real-time (RT) processes by allowing them to occupy the priority range 100-159. Timeshare (TS) proc
School: Purdue
Course: Programming I
2012/09/18 04:50 1/4 LAB5: User Defined Classes LAB5: User Defined Classes Overview: In this lab you will learn how to create user defined classes. We are going to simulate that West Lafayette is building a simple zoo, and you must help them. Think about
School: Purdue
Lab5: Pointer to Functions, Wave Files and Bit Operations Goal: In this lab you will use pointer to functions to write a generic sorting function. You will also generate music wave files, and finally practice bit operations in "C". Step 1. Download the In
School: Purdue
Course: C Language
Lab #05 Programming Assignment Due: Friday June 29th at 11pm (LOCAL LAFAYETTE TIME) 5 Points Possible What will you submit? A single C-file (a file with a .c extension) will be submitted electronically via the sage server. An example submission was conduc
School: Purdue
Course: Systems Programming
Lab6 : Voice Over IP Using Android Goal In this lab you will write an application that will allow communicating two or more phones running Android over the Internet. You will work on teams of 2 to 5 students. Making the Teams Make your teams and e-mail to
School: Purdue
Fall2010: CS240 Programming In C Implementing a Resizable, Table, a Linked List, and your own String Functions Goal In this lab you will practice dynamic memory, pointers, and strings by implementing a table and a linked list that can be used to store nam
School: Purdue
Course: Programming Applications For Engineers
CS 159 Fall 2014 Lab #4 What will you submit? 1. The first task of this lab is a number of problems from and related to chapter 4 intended to improve your understanding of the material you will utilize in the lab assignment and familiarize you with the co
School: Purdue
Course: Programming With Multimedia Objects
Exam 3 Study Guide Chapter 1 Introduction to Computer Science and Media Computation Slides 9, 16, 23 Chapter 2 Introduction to Programming Slides 6, 13, 14, 22, 29 Chapter 3 Modifying Pictures Using Loops Slides 7, 10, 28, 49, 71, 80 Chapter 4 Modifying
School: Purdue
Course: Foundations Of Computer Science
CS182Foundation of Computer Science (http:/www.cs.purdue.edu/homes/spa/cs182.html ) TH 1:302:45 in Forney Hall of Chemical Eng., G140 Professor: E-mail: Oce: Oce Hours: HEAD TA: E-mail: W. Szpankowski (and M. Atallah) spa@cs.purdue.edu (only in the case o
School: Purdue
Course: Introduction To Organizational Computing
Course Syllabus Introduction to Organizational Computing CS 235 Spring 2011 Course Information Lecture: Section 02-01 01-01 Day WF WF Time 11:30 12:20 am 1:30 2:20 pm Room MTHW 210 CL50 224 Course Grades and Information Course grades are available to stud
School: Purdue
Course: Information Systems
CS348: Information Systems Home | Syllabus | Schedule | Homework, Projects, & Handouts | Announcements Course Policy For this course, we will be following Eugene Spafford's comprehensive course policy. Please be sure to read it over. Academic Dishonesty I
School: Purdue
Week Jan 9-13 Jan 16-20 Topic Lecture W: Class organization. Introduction to CS Lecture F: Data 1 Recitation: No recitation during the first week Lab: Orientation (e.g. graphs in Excel) Lecture W: Data 2 Lecture F: Regular data structures Recitation & Lab
School: Purdue
Solution of Homework 2: Language of Mathematics Q1. Prove AB =AB without using the De Morgans law and Venns Diagram. Answer To prove that two sets are equal, we need to prove that each set is a subset of the other: i) To prove that A B A B : x A B xAB /
School: Purdue
Course: Distributed Systems
CS 390S: Secure Programming Labs Student's choice: 2 out of these 6 possibilities. Labs are described at the SEED project. The choices are: 1. Buffer Overflow Vulnerability Lab: exploit the buffer overflow vulnerability. 2. Return-to-libc Attack Lab: expl
School: Purdue
Course: Systems Programming
Login Go Back to Your Class Why Homework is Better with Friends 1314 Admit it, you had the same dumb question. 921 When the prof says, "Any questions?" there are actually questions. 776 More bonding happens at 2AM, really. 647 When you're totally lost,
School: Purdue
Course: Introduction To The Analysis Of Algorithms
CS381 Homework 3 Sketch of Solution Fall 2013 Problem 1. The peak demand for the resource occurs at a time that is covered by the largest number of intervals, a number that can be computed in O(n log n) time as follows. 1. Initialize a counter variable co
School: Purdue
Solution of Homework 3 * Note that the approximate functions shown below are not unique and are provided for the sake of illustration not perfection. Prob. 1 n n! e Using Stirlings formula: n n 2n ln k = ln n ! n (ln n 1 ) + 0 . 5 ln( 2 n ) k =1 Algori
School: Purdue
Course: Programming I
2012/09/18 04:50 1/4 LAB5: User Defined Classes LAB5: User Defined Classes Overview: In this lab you will learn how to create user defined classes. We are going to simulate that West Lafayette is building a simple zoo, and you must help them. Think about
School: Purdue
CS182 Spring 2013 Homework 3 Prof. Alex Pothen and Vernon Rego Due date: Friday, February 22, 2013 (before class). 1. (4pts) Find these terms of the sequence cfw_an , where an = (2)n + 5n. (a) a0 . (b) a1 . (c) a3 . (d) a6 . 2. (12pts) Find f (1), f (2),
School: Purdue
Course: Systems Programming
CS252 Systems Programming Midterm Exam Preparation Part 1. True False Questions Answer True/False (T/F) (1 point each) _ ELF stands for Executable Link Format. _ A process has a stack for every thread it contains. _ A process ID may be reused _ Race condi
School: Purdue
Lab5: Pointer to Functions, Wave Files and Bit Operations Goal: In this lab you will use pointer to functions to write a generic sorting function. You will also generate music wave files, and finally practice bit operations in "C". Step 1. Download the In
School: Purdue
Course: C Language
Lab #05 Programming Assignment Due: Friday June 29th at 11pm (LOCAL LAFAYETTE TIME) 5 Points Possible What will you submit? A single C-file (a file with a .c extension) will be submitted electronically via the sage server. An example submission was conduc
School: Purdue
Course: Intro Organizatnl Comp
Functions allow you to perform calculations on the database. The AVERAGEIF function requires which arguments? Range, criteria, average_range. When using text as a criterion it must be enclosed with quotation marks. Range is NOT a valid argument for the M
School: Purdue
Course: Systems Programming
Lab6 : Voice Over IP Using Android Goal In this lab you will write an application that will allow communicating two or more phones running Android over the Internet. You will work on teams of 2 to 5 students. Making the Teams Make your teams and e-mail to
School: Purdue
Course: Data Structure And Algorithms
4/8/12 CS25100: Data Structures and Algorithms, Project 2 CS25100: Data Structures and Algorithms, Spring 2012 Project 2, Stacks and Queues Description The goal of this assignment is to implement and use elementary data structures, and to introduce you to
School: Purdue
CS 182 Fall 2010 Michael S. Kirkpatrick Name: MIDTERM #1 This is an open book, open notes exam. However, you are not allowed to share any material with anyone else during the exam. Any evidence of academic dishonesty will be dealt with strictly in accorda
School: Purdue
Fall2010: CS240 Programming In C Implementing a Resizable, Table, a Linked List, and your own String Functions Goal In this lab you will practice dynamic memory, pointers, and strings by implementing a table and a linked list that can be used to store nam
School: Purdue
Course: Information Systems
Copyright 2007 Ramez Elmasri and Shamkant B. Navathe Slide 10- 1 Chapter 10 Functional Dependencies and Normalization for Relational Databases Copyright 2007 Ramez Elmasri and Shamkant B. Navathe Chapter Outline 1 Informal Design Guidelines for Relational
School: Purdue
Course: Data Structure And Algorithms
4/8/12 CS25100: Data Structures and Algorithms, Project 3 CS25100: Data Structures and Algorithms, Spring 2012 Project 3, Convex Hull Description This project considers one of the most basic operations in computational geometry, namely the computation of
School: Purdue
Course: Operating Systems
Lab 1 Page 1 of 1 CS 503 Fall 2008 HW 1: Process Management (70 pts) Due: Friday 02/15/2008, 11:59 PM Problem (30 + 20 + 20 pts) 1. Solaris supports real-time (RT) processes by allowing them to occupy the priority range 100-159. Timeshare (TS) proc
School: Purdue
Course: Operating Systems
Lab 0: Getting Acquainted with XINU Page 1 of 1 CS 503 Spring 2008 HW 0: Features of Operating Systems (60 pts) Due: Friday 01/25/2008, 11:59 PM Problem (20 + 15 + 10 + 15 pts) 1. From a user perspective of operating systems (UNIX, Windows, Linux,
School: Purdue
Course: Intro Organizatnl Comp
Building Forensics and Expert Testimony Niche Marketing Plan Engler, Guccione & Partners Goal: Obtain billable hours for consulting jobs in the recession-resistant market of Building Forensics and Expert Testimony. Primary Tasks: Identify paths and venues
School: Purdue
[50] Homework 2. Language of Mathematics Each problem is worth 10 points [10] Prove that for any sets A and B A = (A - B) (A B). [10] Let x and y be integers. Determine whether the following relations are reflexive, symmetric, antisymmetric, or tra
School: Purdue
Course: C Language
%INPUT data = [40; 96; 85; 21] %EXECUTABLE STATEMENT while data > 1 if mod(data, 2) = 0 data = data / 2; else data = (data * 3) + 1; end fprintf(' ') fprintf(data) end fprintf('\n') data = 40 96 85 21 Error using => fprintf Invalid file identifier. Use fo
School: Purdue
Course: INTRO TO ORGANIZATIONAL COMPUTING
Course Syllabus CS 235 Spring 2008 Course Syllabus Introduction to Organizational Computing CS 235 Spring 2008 Course Information Lecture: Section 01-01 Day MW Time 8:30 9:20 am Room EE 129 Course Objectives Course grades are available to students by logg
School: Purdue
Course: Computer Science
CS 159 HW #01 5 Points Possible Due: January 24, 2011 at 11:00pm. Background (From: http:/en.wikipedia.org/wiki/Pythagorean_triple): A Pythagorean triple consists of three positive integers a, b, and c, such that a2 + b2 = c2. Such a triple is commonly wr
School: Purdue
Course: Programming Applications For Engineers
CS 159 Fall 2014 Lab #4 What will you submit? 1. The first task of this lab is a number of problems from and related to chapter 4 intended to improve your understanding of the material you will utilize in the lab assignment and familiarize you with the co
School: Purdue
Course: Programming Applications For Engineers
CS 159 Fall 2014 Lab #11 What will you submit? 1. The first task of this lab is a number of problems from and related to chapter 8 intended to improve your understanding of the material you will utilize in the lab assignment and familiarize you with the c
School: Purdue
Course: Programming Applications For Engineers
CS 159 Fall 2014 Lab #6 What will you submit? 1. The first task of this lab is a number of problems from and related to chapter 5 intended to improve your understanding of the material you will utilize in the lab assignment and familiarize you with the co
School: Purdue
Course: Programming Applications For Engineers
CS 159 HW #07 5 Points Possible Due: December 8, 2014 at 11:00pm. Problem: You will create a set of integer values based on two ranges specified as input from the user. Each value in first range will be multiplied by each value in the second range to gene
School: Purdue
Course: Programming Applications For Engineers
CS 159 HW #02 5 Points Possible Due: September 22, 2014 at 11:00pm. Problem: Given a lab section number tell the user on what day and at what time their lab section will meet. See the table below for the full list of possible sections. Time \ Day Tuesday
School: Purdue
Course: Programming Applications For Engineers
CS 159 HW #03 5 Points Possible Due: October 6, 2014 at 11:00pm. Problem: Given three points that make a triangle, determine whether the origin (0, 0) is inside of the triangle. If the origin is on a line, or is one of the three points, then it is not ins
School: Purdue
Course: Introduction To The Analysis Of Algorithms
CS381 Homework 3 Sketch of Solution Fall 2013 Problem 1. The peak demand for the resource occurs at a time that is covered by the largest number of intervals, a number that can be computed in O(n log n) time as follows. 1. Initialize a counter variable co
School: Purdue
Course: Foundations Of Computer Science
CS182 Homework 6 Spring 2011 In all of the following questions, show the details of your work (it is not enough to just give the answer). Question 1. (10 points) Use the Euclidean algorithm to nd (a) gcd(1529, 14039), (b) gcd(1111, 11111). Question 2. (10
School: Purdue
Course: Foundations Of Computer Science
[40] Homework 5: Big O, . [10] Select the best big Oh notation for each expression. Justify by showing the constants c and n0 . Note that f (n) = O(g(n) if there are constants c > 0 and n0 > 0 so that for all n n0 we have |f (n)| c g(n). 1. 100n + 1. 2. (
School: Purdue
Course: Systems Programming
CS252: Systems Programming Ninghui Li Final Exam Review Topic 1 Understand pointer usage and arithmetic &, *(p+i) Understand argument passing behavior (especially those involving pointers) 2d Array implementation Using function pointers in generic functio
School: Purdue
Course: Systems Programming
16782: execve("/.bors-2/p1/mozilla-1.7.13/sun4-sos5/mozilla", 0xFFBEFCCC, 0xFFBEFCD8) argc = 2 16782: resolvepath("/usr/lib/ld.so.1", "/usr/lib/ld.so.1", 1023) = 16 16782: open("/var/ld/ld.config", O_RDONLY) = 3 16782: fstat(3, 0xFFBEF518) = 0 16782: mmap
School: Purdue
Course: Systems Programming
Midterm Exam CS354 Spring 2007 Name:_ Question Max. True/False 10 pts. Short Questions 1-5 15 pts. Short Questions 6-10 15 pts. 11, 5 pts. 12. 5 pts. 13. 10 pts. 14. 15 pts. 15. 10 pts 16. 15 pts Total: Current Part 1. True False Questions Answer True/Fal
School: Purdue
Course: Systems Programming
CS252: Systems Programming Syllabus Instructor Ninghui Li Class Homepage An updated syllabus, class handouts, lecture notes, and other information can be found at: http:/www.cs.purdue.edu/homes/cs252 Textbook There is no textbook for this course. We will
School: Purdue
Course: Systems Programming
Here is my review of the manuscript "Applied Operating Systems 2e". I will send also a printed copy of the review and the reviewer profile form with my information by US-mail. Sincerely, Gustavo Rodriguez-Rivera Continuing Lecturer Computer Science Dept
School: Purdue
Course: Systems Programming
Part 1 - Memory Layout of a Program Sample Program Output Address of the function donothing() is 0x10afc Address of integer a is 0x21998 Address of array b is 0x21b0c Address of array d is 0x4da2c Address of character c is 0xeffff4cf Address of integer po
School: Purdue
Course: Systems Programming
#!/usr/local/bin/perl -w # elb 9/22/2002 # usage: make_list.pl <namelist> <loginlist> # # Given a class list of the format: # # SMITH, JOHN Q <> /1234 # LI, SUNG HI <> /9999 # GELLAR, SARAH MICHELLE <> /3333 # # and a list of login names one to a line, th
School: Purdue
Course: Systems Programming
Labs and Projects Lab1: C/C+ Programming and GDB (due 1/26/2015, one week, 4% of course grade) Lab2: Build FIZ Interpreter (due 2/16/2015, three weeks, 12% of course grade) Lab3: Building Your Own shell (due 3/9/2015, extended to 3/13/2015, three weeks
School: Purdue
Course: Systems Programming
This page uses frames, but your browser doesn't support them.
School: Purdue
Course: Systems Programming
CS252 Final Review Please aswer this final review and return it during the final exam. 1. Complete the procedure runCommand( command, outputBuffer, bufferSize) that executes a command in a different process and stores its output in outputBuffer. command i
School: Purdue
Course: Systems Programming
Using Git in CS252 Introduction Git is a distributed version control system which you will use to manage your lab source code during this course. Git is compatible with a large number of protocols and is supported on most major operating systems. It was o
School: Purdue
Course: Foundations Of Computer Science
Trees Margaret M. Fleck 10 November 2011 These notes cover trees and induction on trees. 1 Why trees? Trees are the central structure for storing and organizing data in computer science. Examples of trees include Trees which show the organization of real
School: Purdue
Course: Foundations Of Computer Science
Sets of Sets Margaret M. Fleck 7 November 2011 These notes present topics involving counting subsets and sets which contain other sets. 1 Sets containing sets So far, most of our sets have contained atomic elements (such as numbers or strings) or tuples (
School: Purdue
Course: Foundations Of Computer Science
State Diagrams Margaret M. Fleck 14 November 2011 These notes cover state diagrams. 1 Introduction State diagrams are a type of directed graph, in which the graph nodes represent states and labels on the graph edges represent actions. For example, here is
School: Purdue
Course: Foundations Of Computer Science
Sets Margaret M. Fleck 8 September 2011 These notes cover set notation, operations on sets, measuring the size of sets, and proving claims involving sets. They also discuss vacuous truth. 1 Sets So far, weve been assuming only a basic understanding of set
School: Purdue
Course: Foundations Of Computer Science
Relations Margaret M. Fleck 5 February 2011 These notes cover the basics of relations. 1 Relations A relation R on a set A is a subset of A A, i.e. R is a set of ordered pairs of elements from A. If R contains the pair (x, y), we say that x is related to
School: Purdue
Course: Foundations Of Computer Science
Recursive Denition Margaret M. Fleck 11 October 2011 These notes cover recursive denition, including nding closed forms. 1 Recursive denitions Thus far, we have dened objects of variable length using semi-formal denitions involving . . . For example, we d
School: Purdue
Course: Foundations Of Computer Science
Proofs Margaret M. Fleck 2 September 2011 Many mathematical proofs use a small range of standard outlines: direct proof, examples/counter-examples, and proof by contradiction and contrapositive. These notes explain these basic proof methods, as well as ho
School: Purdue
Course: Foundations Of Computer Science
Planar Graphs Margaret M. Fleck 2 December 2011 These notes cover special properties of planar graphs. 1 Planar graphs A planar graph is a graph which can be drawn in the plane without any edges crossing. Some pictures of a planar graph might have crossin
School: Purdue
Course: Foundations Of Computer Science
Number Theory Margaret M. Fleck 7 September 2011 These notes cover concepts from elementary number theory. 1 Number Theory Weve now covered most of the basic techniques for writing proofs. So were going to start applying them to specic topics in mathemati
School: Purdue
Course: Foundations Of Computer Science
Induction Margaret M. Fleck 10 October 2011 These notes cover mathematical induction and recursive denition 1 Introduction to induction At the start of the term, we saw the following formula for computing the sum of the rst n integers: Claim 1 For any pos
School: Purdue
Course: Foundations Of Computer Science
Introduction and math review Margaret M. Fleck 23 January 2011 This section introduces the course and quickly reviews basic mathematical concepts. 1 What is the course about? This course teaches two dierent sorts of things, woven together. It teaches you
School: Purdue
Course: Operating Systems
A Practical Dynamic Buffer Overflow Detector Olatunji Ruwase Transmeta Corporation 3990 Freedom Circle Santa Clara, CA 95054 tjruwase@transmeta.com Monica S. Lam Computer Systems Laboratory Stanford University Stanford, CA 94305 lam@stanford.edu tha
School: Purdue
Course: Programming Applications For Engineers
Chapter 2 Introduction to the C Language CS 158/159 C Programming Program Structure Preprocessor Directives stdio.h will appear in all programs this semester Other libraries are math.h, stdlib.h, etc. Global Declarations Function prototypes We will never
School: Purdue
Course: Programming Applications For Engineers
Chapter 1 Introduction to Computers CS 158/159 C Programming Computer Hardware Storage RAM Disks Input Processing Output Keyboard Mouse Microphone Disks CPU ALU Registers L1 Cache Monitor Printer Speaker Disks Computer Hardware Faster Slower Computer Soft
School: Purdue
Course: Systems Programming
CS252: Systems Programming Ninghui Li Based on Slides by Prof. Gustavo Rodriguez-Rivera Topic 15: Internet Overview History of the Internet 1962 Galactic Network idea (J.C.R. Licklider of MIT) Envisions a globally interconnected set of computers through w
School: Purdue
Course: Systems Programming
CS252: Systems Programming Ninghui Li Based on slides by Prof. Gustavo Rodriguez-Rivera Topic 16: Socket Programming & Project 5 Sockets API They were introduced by UNIX BSD (Berkeley Standard Distribution). Sockets are a form of IPC (Inter-Process Commun
School: Purdue
Course: Systems Programming
CS252: Systems Programming Ninghui Li Based on Slides by Prof. Gustavo Rodriguez-Rivera Topic 17: Signals, Process Credentials Process Properties A process has the following properties: PID: Index in process table PPID: Parent process id (affect signal d
School: Purdue
Course: Systems Programming
CS252: Systems Programming Ninghui Li Topic 18: Lab 6: The Process Games The Process Games In each process game, between 2 and 5 programs can participate. The arena program creates (i.e., forks) N processes of each program, where N is at least 10, and N*
School: Purdue
Course: Systems Programming
CS252: Systems Programming Ninghui Li Based on Slides by Prof. Gustavo Rodriguez-Rivera Topic 17: Signals, Process Credentials Process Properties A process has the following properties: PID: Index in process table PPID: Parent process id PGID: Process g
School: Purdue
Course: Systems Programming
CS252: Systems Programming Ninghui Li Based on Slides by Prof. Gustavo Rodriguez-Rivera Topic 14: Deadlock & Dinning Philosophers Deadlock and Starvation Deadlock It happens when one or more threads will have to block forever ( or until process is termin
School: Purdue
Course: Systems Programming
CS252: Systems Programming Ninghui Li Based on Slides by Prof. Gustavo Rodriguez-Rivera Topic 12: Thread-safe Data Structures, Semaphores Pthread Overview Pthreads: POSIX threads Mutual exclusion and synchronization tools that we cover Mutex locks Read/
School: Purdue
Course: Systems Programming
CS252: Systems Programming Ninghui Li Based on Slides by Prof. Gustavo Rodriguez-Rivera Topic 13: Condition Variable, Read/Write Lock, and Deadlock Pseudo-Code Implementing Semaphore Using Mutex Lock sem_post(sem_t *sem)cfw_ sem_wait(sem_t *sem)cfw_ lock(
School: Purdue
Course: Systems Programming
CS252: Systems Programming Ninghui Li Based on Slides by Prof. Gustavo Rodriguez-Rivera Topic 12: Thread-safe Data Structures, Semaphores Pthread Overview Pthreads: POSIX threads Mutual exclusion and synchronization tools that we cover Mutex locks Read/
School: Purdue
Course: Systems Programming
CS252: Systems Programming Ninghui Li Based on Slides by Prof. Gustavo Rodriguez-Rivera Topic 8: Opening Files and Starting Processes System Calls A system call is a controlled entry point into the kernel, allowing a process to request that the kernel do
School: Purdue
Course: Systems Programming
CS252: Systems Programming Ninghui Li Based on Slides by Prof. Gustavo Rodriguez-Rivera Topic 11: Threads and Thread Synchronization Clicker Question 1 from Mid-Term Consider the following yacc code: list : NUMBER cfw_ numbers[0] = $1; $ = 1; | list CM N
School: Purdue
Course: Systems Programming
CS252: Systems Programming Ninghui Li Slides by Prof. Gustavo Rodriguez-Rivera Topic 9: The Shell Project Shell Interpreter: Parser The shell project is divided into several subsystems: Parser: reads a command line and creates a command table. One entry c
School: Purdue
Course: Systems Programming
CS252: Systems Programming Ninghui Li Slides by Prof. Gustavo Rodriguez-Rivera Topic 10: User Mode, Kernel Mode, Interrupts, System Calls, Processes Computer Architecture Review Most modern computers use the Von Newman Architecture where both programs and
School: Purdue
Course: Systems Programming
CS252: Systems Programming Ninghui Li Slides by Prof. Gustavo Rodriguez-Rivera Topic 10: User Mode, Kernel Mode, Interrupts, System Calls, Processes Computer Architecture Review Most modern computers use the Von Newman Architecture where both programs and
School: Purdue
Course: Systems Programming
CS252: Systems Programming Ninghui Li Slides by Prof. Gustavo Rodriguez-Rivera Topic 7: Unix Tools and Shell Scripts Common UNIX Commands Basic UNIX Commands There are many UNIX commands that can be very useful They output of one can be connected to the i
School: Purdue
Course: Systems Programming
CS252: Systems Programming Ninghui Li Based on Slides by Prof. Gustavo Rodriguez-Rivera Topic 6: Unix Systems Overview What is an Operating System An Operating System (OS) is a layer of software that sits in between the hardware and the user programs. Res
School: Purdue
Course: Systems Programming
CS252 Lab 2 Prepared by El Kindi Rezig Notes Check out new version of the official fiz interpreter at https:/ www.cs.purdue.edu/homes/ninghui/courses/252_Spring15/code/fiz New functionality: tracing Use help in the interpreter fiz> help You can use the fo
School: Purdue
Course: Systems Programming
CS252: Systems Programming Ninghui Li Based on Slides by Prof. Gustavo RodriguezRivera Topic 2: Program Structure and Using GDB What Happens From a C Source Program, to Program Execution Building a program, i.e, generating an executable file from source c
School: Purdue
Course: Systems Programming
CS252: Systems Programming Ninghui Li Topic 5: Parsing Prepared by Evan Hanau ehanau@purdue.edu Introduction to Parsing with Yacc An Introduction to Parsing with Yacc Context-Free Grammars Yacc Parsing An example Infix Calculator Program Context-Free Gr
School: Purdue
Course: Systems Programming
CS252: Systems Programming Ninghui Li Based on Slides by Prof. Gustavo Rodriguez-Rivera Topic 1: Introduction to the Course and Review of C Programming General Information Web Page: http:/www.cs.purdue.edu/homes/cs252 Office: LWSN2142K Office hours: Tenta
School: Purdue
Course: Systems Programming
CS252: Systems Programming Ninghui Li Topic 4: Regular Expressions and Lexical Analysis Compiler Frontend Steps Lexical analyzer/scanner convert sequence of characters to sequence of tokens (inc 13) becomes 4 tokens, (, inc, 13, ) Parser/syntactic analysi
School: Purdue
Course: Systems Programming
CS252: Systems Programming Ninghui Li Topic 3: Programming in a FIZ: Simple Functional Programming Language What is FIZ FIZ F is for functional programming I is for integer (we only use integer data type) Z is for zero, denoting the simplicity of the lang
School: Purdue
Course: Systems Programming
CS252: Systems Programming Ninghui Li Problem of the Week Problem 1: Writing a Prime Testing Function in FIZ Write a prime testing function in FIZ, namely, using inc, dec, ifz, define Testing for Prime Number using FIZ ; Evaluates to 0 if x < y, and 1 ot
School: Purdue
Course: Systems Programming
System Programming CS 252 Topic 20 What is Computer/Information Security About? CS252 Topic 20 1 Security News in 2013 Snowden leaks information about various NSA data collection programs Phone call record Supposedly email, instant message, etc. Natio
School: Purdue
Course: Systems Programming
System Programming CS 252 Topic 20 What is Computer/Information Security About? CS252 Topic 20 1 Security News in 2013 Snowden leaks information about various NSA data collection programs Phone call record Supposedly email, instant message, etc. Natio
School: Purdue
Course: Systems Programming
System Programming CS 252 Topic 20 What is Computer/Information Security About? CS252 Topic 20 1 Security News in 2013 Snowden leaks information about various NSA data collection programs Phone call record Supposedly email, instant message, etc. Natio
School: Purdue
Course: Systems Programming
CS252: Systems Programming Ninghui Li Exam 1 Review Topic 1: C Programming General C programming questions Not limited to things explicitly covered in this class. Pointer usage Memory allocation errors Array vs pointers Function pointers and generic mappe
School: Purdue
Course: Systems Programming
CS252: Systems Programming Ninghui Li Program Interview Questions String Problem Input is a string containing a set of words separated by white space(s). Write a function that will transform it to a string in which the words appear in the reverse order. F
School: Purdue
Course: Intro Organizatnl Comp
Functions allow you to perform calculations on the database. The AVERAGEIF function requires which arguments? Range, criteria, average_range. When using text as a criterion it must be enclosed with quotation marks. Range is NOT a valid argument for the M
School: Purdue
CS 182 Fall 2010 Michael S. Kirkpatrick Name: MIDTERM #1 This is an open book, open notes exam. However, you are not allowed to share any material with anyone else during the exam. Any evidence of academic dishonesty will be dealt with strictly in accorda
School: Purdue
Course: C Language
%INPUT data = [40; 96; 85; 21] %EXECUTABLE STATEMENT while data > 1 if mod(data, 2) = 0 data = data / 2; else data = (data * 3) + 1; end fprintf(' ') fprintf(data) end fprintf('\n') data = 40 96 85 21 Error using => fprintf Invalid file identifier. Use fo
School: Purdue
Course: Systems Programming
CS252: Systems Programming Spring 2015 Mid-term Exam 1 (Time: 75 minutes) Answer Filling in blanks (5 pts, 1pt each space) Fill in each of the underlined empty spaces with one word or a short phrase. A process (program in memory) has the following memory
School: Purdue
Course: Systems Programming
CS252: Systems Programming Spring 2014 Mid-term Exam 2 (Time: 50 minutes) Your login: Your name (Last, First): Part 1: Filling in the Blanks (15 pts, 1.5pt each space) Fill in each of the underlined blanks with one word or a short phrase. A process may b
School: Purdue
Course: Systems Programming
CS252: Systems Programming Spring 2015 Mid-term Exam 2 (Time: 75 minutes) Answer Part 1: True/False Questions (28 pts, 2pts each) Circle yes or no. yes / Interrupt handler code are executed in the kernel mode. / no Kernel mode is more powerful than the us
School: Purdue
Course: Systems Programming
CS252: Systems Programming Spring 2014 Mid-term Exam 1 (Time: 50 minutes) Your login: Your name (Last, First): Part 1 (20 pts, 1pt each space) Fill in each of the underlined empty spaces with one word or a short phrase. Order the following steps that tog
School: Purdue
Course: Programming In C
CS240 Midterm Exam Fall 2014 Name:_ _ Question 1 2 3 4. 5. Max. 20 pts. 20 pts. 20pts. 20 pts. 20 pts. Total: Current 1. Write the implementation of the string functions strcpy, strlen, strcat, strdup, strstr using pointers. Use pointers. If you use the a
School: Purdue
Course: Programming In C
CS240 Programming in C Fall2014 Final Exam Name: _ _ Question 1. 2. 3. 4. Total: Max Points 25 25 25 25 100 Current Points 1. Write the following string operations using pointers. IMPORTANT: DO NOT USE the array[i] operator nor the equivalent *(array+i) e
School: Purdue
Course: Systems Programming
Here are some corrections to the solutions posted: T/F questions T/F_ ELF stands for Executable Link Format. - Can be also Extensible Linked Format T _ A process has a stack for every thread it contains. T _ A process ID may be reused - Yes if the process
School: Purdue
Course: Systems Programming
CS252 Systems Programming Midterm Exam Preparation Please write by hand the answers and turn them in the day of the exam. The solutions will be posted the day before the exam. I suggest you try to solve the questions before looking at the solution. Part 1
School: Purdue
Course: Systems Programming
<pre> Here are some corrections to the solutions posted: T/F questions T/F_ ELF stands for Executable Link Format. - Can be also Extensible Linked Format T _ A process has a stack for every thread it contains. T _ A process ID may be reused - Yes if the
School: Purdue
Course: Programming With Multimedia Objects
CS 17700 Review, iClicker -Questions Week 16 1 Announcements Project 5 is due December 4th @ 11:59 pm Final Exam is December 11th @ 8:00 am in WTHR 200 2 ANY QUESTIONS? 3 Table of Contents Binary Conversion Operator Precedence Variables Functions Global
School: Purdue
Course: Programming With Multimedia Objects
CS 177 Exam 2 Review and DFS Week 13 Announcements Project 4 Part 2 is due November 18th @11:59PM ANY QUESTIONS? Question 4 Q4. What will be printed to the screen by the following code? f = open('test.txt', 'r') Students.txt data = f.readlines() print(da
School: Purdue
Course: C Programming
First of all, packaged software is mass-produced, copyrighted retail software that meets the needs of a wide variety of users, not just a single user or company. Packaged software is available in retail stores or on the Web. It is also a ready-made applic
School: Purdue
Course: Introduction To Organizational Computing
Exam4StudyGuide DataValidation,AnalysisandSpecialQueries,Advancedforms,Reports,Macrosand SQL ChapterFive:DataValidationandDataAnalysis Whichofthefollowingisnotanexampleofadatavalidationtechnique? Descriptivefieldnames Lookupfields Defaultvalues InputMasks
School: Purdue
Course: Problem Solving And Object-Oriented Programming
CS180 Spring 2013 Final exam May 2nd /* * Last name, First name (use capital letters): * cs login (use capital letters) : * Laboratory section : * Signature: */ Final exam is composed of two parts: PART1 and PART2: PART1 is worth 50% of Final total score
School: Purdue
Course: Problem Solving And Object-Oriented Programming
CS180 Spring 2014 Midterm 2 exam April 1st PART1 Multiple choice questions 1. What is the output of the following program? public class ForEach cfw_ public static void main (String[] args) cfw_ int[] a = cfw_2, 4, 6; int[] b = a; int[] c = new int[3]; for
School: Purdue
Course: Problem Solving And Object-Oriented Programming
CS180 Spring 2014 Midterm 1 exam February 20th PART1 Multiple choice questions Q1. Which of the following is NOT a primitive type: A. double B. String C. int D. byte E. All are primitive types. Q2. Given the following three variable definitions: short sva
School: Purdue
Course: PROGRAMMING APPLICATIONS FOR ENGINEERS
CS 159 Final Exam December 17, 2009 10:20 12:20 CL50 Lecture Hall 50 questions * 3 Points Each = 150 Points Exam Rules/Notes: 1. Computer your name, your student ID#, and your FOUR DIGIT lab section on the answer sheet (write in AND bubble-in all requeste
School: Purdue
Course: Programming With Multimedia Objects
Question Q1 Q2 Q3 Q4 Q5 Q6 Q7 Q8 Q9 Q10 Q11 Q12 Q13 Q14 Q15 Q16 Q17 Q18 Q19 Q20 Q21 Q22 Q23 Q24 Q25 Q26 Q27 KEY A B B B B D B C A B C D A C A C B D B A D B A C D A D
School: Purdue
Course: Problem Solving And Object-Oriented Programming
CS180 Spring 2013 Final exam May 2nd /* * Last name, First name (use capital letters): * cs login (use capital letters) : * Laboratory section : * Signature: */ Final exam is composed of two parts: PART1 and PART2: PART1 is worth 50% of Final total score
School: Purdue
Course: Problem Solving And Object-Oriented Programming
CS180 Spring 2013 Midterm 2 exam March 27th /* * Last name, First name (use capital letters): * cs login (use capital letters) : * Laboratory section : * Signature: */ Midterm1 is composed of two parts: PART1 and PART2: PART1 is worth 50% of Midterm1 tot
School: Purdue
Course: Problem Solving And Object-Oriented Programming
CS180 Fall 2013 Midterm 1 exam September 25th Version A /* * Last name, First name (use capital letters): * cs login (use capital letters) : * Recitation section : * Signature: */ Midterm1 is composed of two parts: PART1 and PART2: PART1 is worth 50% of
School: Purdue
Course: Problem Solving And Object-Oriented Programming
CS180 Spring 2013 Exam 1 Multiple Choice Questions 01. As mentioned in class, _ loops are an example of indefinite iteration, and _ loops are an example of definite iteration. a b c d e for, for for, while while, for while, while none of these 02. Conside
School: Purdue
CS177 Spring 2012 Final Exam May 5, 2012 /* * Last name, First name: * Your Purdue mail account: * Your recitation section: * Signature: */ The exam consists of 30 multiple choice questions. For each question you are asked to select a single answer, i.e.
School: Purdue
CS 177 Spring 2011 Final Exam May 5th - There are 35 single choice questions. Each one is worth 4 points. The total score for the exam is 120. Answer the questions on the bubble sheet given. Fill in the Instructor, Course, Signature, Test, and Date blanks
School: Purdue
CS177 MIDTERM1 PRACTICEEXAM Name:_ StudentID:_ Thispracticeexamisduethedayofthemidtermexam.Thesolutionswillbepostedtheday beforetheexambutweencourageyoutolookatthesolutionsonlyafteryouhavetriedtosolve theexamfirst. Problem 1. 2. 3. 4. 5. 6. 7. 8. 9. 10. M
School: Purdue
CS177 Fall 2013 Midterm2 VERSION 02 November 6, 2013 /* * Last name, First name: * Your Purdue mail account: * Your recitation section: * Signature: Midterm 1 consists of 25 True/False and multiple choice questions. For each question you are asked to sele
School: Purdue
Solution of Homework 2: Language of Mathematics Q1. Prove AB =AB without using the De Morgans law and Venns Diagram. Answer To prove that two sets are equal, we need to prove that each set is a subset of the other: i) To prove that A B A B : x A B xAB /
School: Purdue
Solution of Homework 3 * Note that the approximate functions shown below are not unique and are provided for the sake of illustration not perfection. Prob. 1 n n! e Using Stirlings formula: n n 2n ln k = ln n ! n (ln n 1 ) + 0 . 5 ln( 2 n ) k =1 Algori
School: Purdue
CS182 Spring 2013 Homework 3 Prof. Alex Pothen and Vernon Rego Due date: Friday, February 22, 2013 (before class). 1. (4pts) Find these terms of the sequence cfw_an , where an = (2)n + 5n. (a) a0 . (b) a1 . (c) a3 . (d) a6 . 2. (12pts) Find f (1), f (2),
School: Purdue
Course: Data Structure And Algorithms
4/8/12 CS25100: Data Structures and Algorithms, Project 2 CS25100: Data Structures and Algorithms, Spring 2012 Project 2, Stacks and Queues Description The goal of this assignment is to implement and use elementary data structures, and to introduce you to
School: Purdue
Course: Data Structure And Algorithms
4/8/12 CS25100: Data Structures and Algorithms, Project 3 CS25100: Data Structures and Algorithms, Spring 2012 Project 3, Convex Hull Description This project considers one of the most basic operations in computational geometry, namely the computation of
School: Purdue
Course: Operating Systems
Lab 1 Page 1 of 1 CS 503 Fall 2008 HW 1: Process Management (70 pts) Due: Friday 02/15/2008, 11:59 PM Problem (30 + 20 + 20 pts) 1. Solaris supports real-time (RT) processes by allowing them to occupy the priority range 100-159. Timeshare (TS) proc
School: Purdue
Course: Operating Systems
Lab 0: Getting Acquainted with XINU Page 1 of 1 CS 503 Spring 2008 HW 0: Features of Operating Systems (60 pts) Due: Friday 01/25/2008, 11:59 PM Problem (20 + 15 + 10 + 15 pts) 1. From a user perspective of operating systems (UNIX, Windows, Linux,
School: Purdue
Course: Computer Science
CS 159 HW #01 5 Points Possible Due: January 24, 2011 at 11:00pm. Background (From: http:/en.wikipedia.org/wiki/Pythagorean_triple): A Pythagorean triple consists of three positive integers a, b, and c, such that a2 + b2 = c2. Such a triple is commonly wr
School: Purdue
Course: Programming Applications For Engineers
CS 159 HW #07 5 Points Possible Due: December 8, 2014 at 11:00pm. Problem: You will create a set of integer values based on two ranges specified as input from the user. Each value in first range will be multiplied by each value in the second range to gene
School: Purdue
Course: Programming Applications For Engineers
CS 159 HW #02 5 Points Possible Due: September 22, 2014 at 11:00pm. Problem: Given a lab section number tell the user on what day and at what time their lab section will meet. See the table below for the full list of possible sections. Time \ Day Tuesday
School: Purdue
Course: Programming Applications For Engineers
CS 159 HW #03 5 Points Possible Due: October 6, 2014 at 11:00pm. Problem: Given three points that make a triangle, determine whether the origin (0, 0) is inside of the triangle. If the origin is on a line, or is one of the three points, then it is not ins
School: Purdue
Course: Programming Applications For Engineers
CS 159 HW #06 5 Points Possible Due: November 17, 2014 at 11:00pm. Problem: You just finished playing cards with a group of friends and each time your score changed in the game you wrote it down. Given the total number of points it takes to win the game a
School: Purdue
Course: Programming Applications For Engineers
CS 159 HW #01 5 Points Possible Due: September 8, 2014 at 11:00pm. Problem: The hyperbolic cosine can be calculated using the formula below. As you will see the formula can be quite reliable if you use the correct data types for each of the operands. x co
School: Purdue
Course: Programming Applications For Engineers
CS 159 HW #04 5 Points Possible Due: October 20, 2014 at 11:00pm. Problem: Given a day number (1 to 366) that is to represent the starting day of the fall semester and the year determine when the final exam for a course will take place. The start of the s
School: Purdue
Course: Programming Applications For Engineers
CS 159 HW #05 5 Points Possible Due: November 3, 2014 at 11:00pm. Problem: Given a positive integer determine the largest factor that is also a prime number. Example Execution #1: Example Execution #3: Enter integer to test: 45 Enter integer to test: 53 L
School: Purdue
Course: Programming Applications For Engineers
CS 159 HW #07 5 Points Possible Due: April 27, 2015 at 11:00pm. Problem: A college instructor is giving a quiz during lecture and the students may elect to work alone or with as many other students from their recitation section that are seated in a contin
School: Purdue
Course: Programming Applications For Engineers
CS 159 HW #04 5 Points Possible Due: March 9, 2015 at 11:00pm. Problem: A typical deck of cards has 52 different cards. The cards are divided among four suits and each suit has numbered cards 2 through 10 along with a Jack, Queen, King, and Ace. The numbe
School: Purdue
Course: Programming Applications For Engineers
CS 159 HW #03 5 Points Possible Due: February 23, 2015 at 11:00pm. Problem: Given a year as input, determine the date of Easter (for the Western Christian Church) on the Gregorian calendar using Guass' Algorithm (http:/en.wikipedia.org/wiki/Computus#Gauss
School: Purdue
Course: Programming Applications For Engineers
CS 159 HW #02 5 Points Possible Due: February 9, 2015 at 11:00pm. Problem: Given the length of the minor and major axis of an ellipse, determine whether the eccentricity of that ellipse is greater than the eccentricity of the (E)arth's (0.0167) orbit, (M)
School: Purdue
Course: Programming Applications For Engineers
CS 159 HW #06 5 Points Possible Due: April 13, 2015 at 11:00pm. Problem: Given 10 integers as input alter each number by adding one if those elements immediately adjacent to it are greater, subtracting one if those elements immediately adjacent to it are
School: Purdue
Course: Programming Applications For Engineers
CS 159 HW #01 5 Points Possible Due: January 26, 2015 at 11:00pm. Problem: Given the length of the minor and major axis of an ellipse, calculate the area of the ellipse, the eccentricity of the ellipse, and the distance of the foci from the center of the
School: Purdue
Course: Programming Applications For Engineers
CS 159 HW #05 5 Points Possible Due: March 30, 2015 at 11:00pm. Problem: Given a range of integers calculate this summation for (the sum of all integers between 1 and) each value in the range, identify the divisors of each sum, and display the count of di
School: Purdue
Course: Foundations Of Computer Science
CS182 Homework 9 Sketch of Solution Spring 2011 Question 1. The inorder listing of the nodes is: mcgldpbjf koehnai Question 2. v is ancestor of w if and only if P reorder(v) < P reorder(w) P reorder(v) + Desc(v) 1 v is to the left of w if and only if it
School: Purdue
Course: Foundations Of Computer Science
CS182 Homework 9 Spring 2011 Question 1. (10+5 points) Let T be a tree whose 16 nodes are named a, b, c, d, e, f, g, h, i, j, k, l, m, n, o, p. A preorder traversal of T lists its nodes in the following order: dgcmlf bpjkaeohni A postorder traversal of T
School: Purdue
Course: Foundations Of Computer Science
CS182 Homework 8 Sketch of Solution Spring 2011 Question 1. 1. 2k 2. The net gain is 100 times the following: 2k (2k1 + 2k2 + + 21 + 20 ) = 2k1 (2k2 + + 21 + 20 ) = = 21 20 = 1 where we repeatedly used the fact that 2 2 1 =2 1 . So the answer is $100. Que
School: Purdue
Course: Foundations Of Computer Science
CS182 Homework 7 Sketch of Solution Spring 2011 Question 1. 1. C(n, m) for the following reason. First, recall that in class we interpreted C(n, m) as the number of paths that, in n horizontal or vertical positive unit steps, go from (0, 0) to (n m, m). T
School: Purdue
Course: Foundations Of Computer Science
CS182 Homework 8 Spring 2011 Question 1. (10 points). A gambler (call him Bob) is playing at a casino the following game: Bob can bet any amount he wishes, then a fair coin is tossed, and if the outcome of the toss is heads he wins an amount equal to his
School: Purdue
Course: Foundations Of Computer Science
CS182 Homework 7 Spring 2011 Question 1. (5+5+10 points) Simplify each of the following expressions. 1. C(n 2, m) + 2C(n 2, m 1) + C(n 2, m 2) 2. C(n 3, m) + 3C(n 3, m 1) + 3C(n 3, m 2) + C(n 3, m 3) 3. n+r k=n C(k, k n) Question 2. (10+10+10 points) Sup
School: Purdue
Course: Foundations Of Computer Science
CS 182 Spring 2015 Homework 7 Due date: Monday, April 20, 2015 (before class) 1. (10pts) Assume that the probability a child is a boy is 0.6 and that the sexes of children born into a family are independent. What is the probability that a family of 3 chil
School: Purdue
Course: Programming I
2012/09/18 04:50 1/4 LAB5: User Defined Classes LAB5: User Defined Classes Overview: In this lab you will learn how to create user defined classes. We are going to simulate that West Lafayette is building a simple zoo, and you must help them. Think about
School: Purdue
Lab5: Pointer to Functions, Wave Files and Bit Operations Goal: In this lab you will use pointer to functions to write a generic sorting function. You will also generate music wave files, and finally practice bit operations in "C". Step 1. Download the In
School: Purdue
Course: C Language
Lab #05 Programming Assignment Due: Friday June 29th at 11pm (LOCAL LAFAYETTE TIME) 5 Points Possible What will you submit? A single C-file (a file with a .c extension) will be submitted electronically via the sage server. An example submission was conduc
School: Purdue
Course: Systems Programming
Lab6 : Voice Over IP Using Android Goal In this lab you will write an application that will allow communicating two or more phones running Android over the Internet. You will work on teams of 2 to 5 students. Making the Teams Make your teams and e-mail to
School: Purdue
Fall2010: CS240 Programming In C Implementing a Resizable, Table, a Linked List, and your own String Functions Goal In this lab you will practice dynamic memory, pointers, and strings by implementing a table and a linked list that can be used to store nam
School: Purdue
Course: Programming Applications For Engineers
CS 159 Fall 2014 Lab #4 What will you submit? 1. The first task of this lab is a number of problems from and related to chapter 4 intended to improve your understanding of the material you will utilize in the lab assignment and familiarize you with the co
School: Purdue
Course: Programming Applications For Engineers
CS 159 Fall 2014 Lab #11 What will you submit? 1. The first task of this lab is a number of problems from and related to chapter 8 intended to improve your understanding of the material you will utilize in the lab assignment and familiarize you with the c
School: Purdue
Course: Programming Applications For Engineers
CS 159 Fall 2014 Lab #6 What will you submit? 1. The first task of this lab is a number of problems from and related to chapter 5 intended to improve your understanding of the material you will utilize in the lab assignment and familiarize you with the co
School: Purdue
Course: Systems Programming
Last modified: Monday, 17 April 2000 17:44 EST Bourne Shell: The Syntax Variables Using quotation marks Reserved words/characters Builtin variables Command line parsing Advanced variable usage Programming statements Pattern matching in filenames Redirecti
School: Purdue
Course: Systems Programming
Last modified: Friday, 17 October 1997 16:39 EST Unix Shell Scripting The Unix shell vs. shell scripting Bourne shell scripting A simple shell script Builtin commands Environment variables Shell syntax Variables Using quotation marks Reserved wor
School: Purdue
Course: Systems Programming
CS 354 Lab 6 Using Condition Variables In this lab you will learn how to use condition variables. You will rewrite the classes you wrote from lab 5 to use condition-variables instead of semaphores. The test files that were given and the ones you wrote sho
School: Purdue
Course: Systems Programming
CS 354 Lab 6 Inter-Process RPCs Using Condition Variables In this lab you will get experience with condition variables. You will rewrite RPC.cc and RPC.h from lab 5 to use condition-variables instead of semaphores. You don't need to modify any other file.
School: Purdue
Course: Systems Programming
Lab 0: Tutorials on the UNIX environment and Xemacs: Tutorial 1, Tutorial 2, Tutorial 3 Lab 1: C/C+ Programming and GDB Lab2: Shell scripting, syscall, nm, and ldd Lab3: Implementing a Shell Lab4: Introduction to Threads Lab5: Using Semaphores Lab6: Usin
School: Purdue
Course: Systems Programming
Lab0: Tutorials on the UNIX environment and Xemacs: Tutorial 1, Tutorial 2, Tutorial 3 Lab1: C and C+, Xemacs Review, Memory-Layout of a Program, UNIX process Tree, and Time. Lab2: Shell Programming, syscall, nm, and ldd. Lab3: Building a Shell Lab4: Int
School: Purdue
Course: Programming With Multimedia Objects
Project 1 take_decision() called with arrival times associated with the cars by position, for instance: (3, 21, 18, 45, 0) Requires sorting, here 21,18,45 You could sort a list: [21, 18, 45] => [18, 21, 45] But then we lost the car names! For Instan
School: Purdue
Course: Programming With Multimedia Objects
import csv #-# This function is given to you #- DO NOT MODIFY THIS FUNCTION! -def excel_read(filename): csvfile = csv.reader(open(filename, 'rU'), delimiter='\t') n = 0 roster = [] MAJORS = cfw_ for row in csvfile: n += 1 roster.append(row[0].split(',') M
School: Purdue
Course: Problem Solving And Object-Oriented Programming
School: Purdue
Course: Programming With Multimedia Objects
Exam 3 Study Guide Chapter 1 Introduction to Computer Science and Media Computation Slides 9, 16, 23 Chapter 2 Introduction to Programming Slides 6, 13, 14, 22, 29 Chapter 3 Modifying Pictures Using Loops Slides 7, 10, 28, 49, 71, 80 Chapter 4 Modifying
School: Purdue
Course: Foundations Of Computer Science
CS182Foundation of Computer Science (http:/www.cs.purdue.edu/homes/spa/cs182.html ) TH 1:302:45 in Forney Hall of Chemical Eng., G140 Professor: E-mail: Oce: Oce Hours: HEAD TA: E-mail: W. Szpankowski (and M. Atallah) spa@cs.purdue.edu (only in the case o
School: Purdue
Course: Introduction To Organizational Computing
Course Syllabus Introduction to Organizational Computing CS 235 Spring 2011 Course Information Lecture: Section 02-01 01-01 Day WF WF Time 11:30 12:20 am 1:30 2:20 pm Room MTHW 210 CL50 224 Course Grades and Information Course grades are available to stud
School: Purdue
Course: Information Systems
CS348: Information Systems Home | Syllabus | Schedule | Homework, Projects, & Handouts | Announcements Course Policy For this course, we will be following Eugene Spafford's comprehensive course policy. Please be sure to read it over. Academic Dishonesty I
School: Purdue
Week Jan 9-13 Jan 16-20 Topic Lecture W: Class organization. Introduction to CS Lecture F: Data 1 Recitation: No recitation during the first week Lab: Orientation (e.g. graphs in Excel) Lecture W: Data 2 Lecture F: Regular data structures Recitation & Lab