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.
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: Minnesota
Course: Operating Systems
Assignment 3 Solutions Two process mutual exclusion Protocol 4: shared data: boolean flag[2]; /initial values false int turn; / 0 or 1 Process i: 1 while (true) . / ENTRY PROTOCOL 2 j = ( i + 1 ) % 2; 3 flag[ i] = true; 4 while ( flag[ j ] ) cfw_ 5 if ( t
School: Minnesota
Course: Operating Systems
CSCI 5103 (Fall 2010) Answers to Assignment 1 Questions and Grading Criteria Part A ( 100 points) Due September 15, 2010 This part of the assignment must be done individually. Problem 1 (20 points): Which of the following instructions should be allowed on
School: Minnesota
Course: Operating Systems
Department of Computer Science University of Minnesota, Twin Cities CSci 5103 - Operating Systems - Fall 2010 (Instructor: Tripathi) Assignment 3 Due Date: October 12, 2010 Problem 1: In case of Protocol 4 for two-process mutual exclusion, presented in Le
School: Minnesota
Course: Operating Systems
Assignment 7 Linux Device Driver Programming CSCI 5103, Fall 2010 Due November 29, 2010 This assignment can be done in a group of up to three students. Part A: (20 points): In this problem you are asked to rewrite a small part of the scullpipe device driv
School: Minnesota
Course: Operating Systems
CSCI 5103 (Fall 2010) Assignment 4 ( 100 points) Due October 28, 2010 This assignment may be done individually or in a group of two students Objective: The objective of this assignment is to acquire familiarity with using POSIX thread programming primitiv
School: Minnesota
Course: Operating Systems
CSCI 5103 (Fall 2010) Assignment 1 Part A ( 100 points) Due September 15, 2010 This part of the assignment must be done individually. Problem 1 (20 points): Which of the following instructions should be allowed only in the privileged (kernel) mode? a) Dis
School: Minnesota
Course: Discrete Structures Of Computer Science
School: Minnesota
Course: Automata
TIME COMPLEXITY CSci 4011 INHERENT LIMITATIONS OF COMPUTER PROGRAMS Definition: Let M be a TM that halts on all inputs. The running time or time-complexity of M is the function f : N N, where f(n) is the maximum number of steps that M uses on any input of
School: Minnesota
Course: Automata
CSci 4011 INHERENT LIMITATIONS OF COMPUTER PROGRAMS HARDEST PROBLEMS IN NP Definition: A language B is NP-complete if: 1. B NP 2. Every A in NP is poly-time reducible to B (i.e. B is NP-hard) If B is NP-Complete and P NP, then There is no fast algorithm f
School: Minnesota
Course: Automata
CSci 4011 INHERENT LIMITATIONS OF COMPUTER PROGRAMS HARDEST PROBLEMS IN NP Definition: A language B is NP-complete if: 1. B NP 2. Every A in NP is poly-time reducible to B (i.e. B is NP-hard) If B is NP-Complete and P NP, then There is no fast algorithm f
School: Minnesota
Course: Automata
QUIZ 5 CSci 4011 INHERENT LIMITATIONS OF COMPUTER PROGRAMS QUIZ 5 The language L TIME(t(n) if: L can be decided by a TM in time O(t(n) The language L NP if: L can be decided by a NTM in time O(nc) L has a polynomial time verifier 3SAT is the language: cfw
School: Minnesota
Course: Automata
TIME COMPLEXITY CSci 4011 INHERENT LIMITATIONS OF COMPUTER PROGRAMS Definition: Let M be a TM that halts on all inputs. The running time or time-complexity of M is the function f : N N, where f(n) is the maximum number of steps that M uses on any input of
School: Minnesota
Course: Automata
TIME COMPLEXITY CSci 4011 INHERENT LIMITATIONS OF COMPUTER PROGRAMS Definition: Let M be a TM that halts on all inputs. The running time or time-complexity of M is the function f : N ! N, where f(n) is the maximum number of steps that M uses on any input
School: Minnesota
Course: Introduction To Computing And Programming Concepts
School: Minnesota
! def change(x):! penny =1! nickel =5! dime =10! quarter =25! q=0! d=0! n=0! p=0! a1 = 'Quarters: '! a2 = 'Dimes: '! a3 = 'Nickels: '! a4 = 'Pennies: '! ! x= 100*oat(x)! if x >=25:! q=int(x/quarter)! x%=quarter! if x >=10:! d = int(x/dime)! x%=dime! if x>
School: Minnesota
Sample Take-Home Quiz II Sample Solutions Csci4211: Introduction to Computer Networks Fall 2013 Prof. Zhi-Li Zhang Instructions: 1. Please note that the solutions I provided to many questions are more detailked than necessary! Id like to use this opportun
School: Minnesota
Sample Take-Home Quiz II Version B Csci4211: Introduction to Computer Networks Fall 2013 Prof. Zhi-Li Zhang Last Name: First Name: Student Id. Instructions: 1. This is a open-book and open-note quick. 2. There are ve questions in total, each of which has
School: Minnesota
Midterm Exam Version B Csci4211: Introduction to Computer Networks Fall 2013 Prof. Zhi-Li Zhang Last Name: First Name: Student Id. Instructions: 1. This is a open-book and open-note quick. 2. There are ve questions in total, each of which has several sub-
School: Minnesota
FinalQuiz FinalReview Dec19(Thu)6:30pm8:30pm;KellerHall3230 comprehensive,emphasisonmaterialcoveredlaterinthesemester Openbook,opennotes,openInternet concepts,issues,mechanisms/algorithms,problemsolving fivebigproblems,2hours,similartoQuizzesI/II Everyt
School: Minnesota
Course: Operating Systems
Assignment 3 Solutions Two process mutual exclusion Protocol 4: shared data: boolean flag[2]; /initial values false int turn; / 0 or 1 Process i: 1 while (true) . / ENTRY PROTOCOL 2 j = ( i + 1 ) % 2; 3 flag[ i] = true; 4 while ( flag[ j ] ) cfw_ 5 if ( t
School: Minnesota
Course: Operating Systems
CSCI 5103 (Fall 2010) Answers to Assignment 1 Questions and Grading Criteria Part A ( 100 points) Due September 15, 2010 This part of the assignment must be done individually. Problem 1 (20 points): Which of the following instructions should be allowed on
School: Minnesota
Course: Operating Systems
Department of Computer Science University of Minnesota, Twin Cities CSci 5103 - Operating Systems - Fall 2010 (Instructor: Tripathi) Assignment 3 Due Date: October 12, 2010 Problem 1: In case of Protocol 4 for two-process mutual exclusion, presented in Le
School: Minnesota
Course: Operating Systems
Assignment 7 Linux Device Driver Programming CSCI 5103, Fall 2010 Due November 29, 2010 This assignment can be done in a group of up to three students. Part A: (20 points): In this problem you are asked to rewrite a small part of the scullpipe device driv
School: Minnesota
Course: Operating Systems
CSCI 5103 (Fall 2010) Assignment 4 ( 100 points) Due October 28, 2010 This assignment may be done individually or in a group of two students Objective: The objective of this assignment is to acquire familiarity with using POSIX thread programming primitiv
School: Minnesota
Course: Operating Systems
CSCI 5103 (Fall 2010) Assignment 1 Part A ( 100 points) Due September 15, 2010 This part of the assignment must be done individually. Problem 1 (20 points): Which of the following instructions should be allowed only in the privileged (kernel) mode? a) Dis
School: Minnesota
* SECTION 2 ANSWER KEY * CSci 1113 Spring 2009 Lab Midterm 90 Minutes Section 2: Monday 1:25-5:25 A. (30 points) Time Zone Program cswanson@shemp (~/spr09/lab_mid) % cat zone.cpp #include<iostream> using namespace std; int time_zone(int hours, char zone);
School: Minnesota
CSci 1133, Spring 2014 Lab Exercise 3 Procedural Abstraction In the previous Lab Exercise, you learned about useful functions that have been created by other people. A function was described as an abstraction; a named set of statements that perform some c
School: Minnesota
CSci 1133, Spring 2014 Lab Exercise 1 Introduction to UNIX and Python In this first lab, you will make sure your account is functional and explore a number of computational resources that will be needed during the course of the upcoming semester. You will
School: Minnesota
CSci 1133, Spring 2014 Lab Exercise 6 Lists Python provides several simple and powerful mechanisms to structure data. The list is a vital one that enables us to manipulate and reason with ordered collections. We can use an ordered collection (list) to rep
School: Minnesota
CSci 1133, Spring 2014 Lab Exercise 5 Fun With Strings In this lab we explore operations and methods using string objects. As discussed in lecture, strings are nonscalar, immutable sequence objects consisting of an ordered sequence of individual character
School: Minnesota
CSci 1133, Spring 2014 Lab Exercise 7 Dictionaries and Nested Lists This week, we will continue our exploration of container classes in Python. Dictionaries are mutable structures that provide a powerful association mechanism using key : value pairs, and
School: Minnesota
Course: Software Engineering 1
Syllabus - CSci 5801 Course Name: CSci 5801 Software Engineering I Semester: Fall 2012 Professor: Dr. Mats Heimdahl Lecture Hours: Tuesday and Thursday, 9:45 11:00 Location: ME 108. This syllabus describes the course CSci 5801, Software Engineering I. It
School: Minnesota
Basic of Computer Application 3:00pm-4:30pm M, W, F Classroom B 150 Instructor: Jason Lee Office: B 370 Office Hour: T, Th 10:00-Noon Course Description It is a an introduction to the great ideas of Computer Science; it is designed to help you understand
School: Minnesota
Course: Dvanced Algorithms And Data Structures
Fall 11: CSci 5421Advanced Algorithms and Data Structures Instructor Ravi Janardan Dept. of Computer Science & Engineering University of MinnesotaTwin Cities Minneapolis, MN 55455 Oce: 6217 Keller Hall (EE/CSci Bldg.) Phone: (612)6257338 Email: janardan@c
School: Minnesota
Course: Operating Systems
Assignment 3 Solutions Two process mutual exclusion Protocol 4: shared data: boolean flag[2]; /initial values false int turn; / 0 or 1 Process i: 1 while (true) . / ENTRY PROTOCOL 2 j = ( i + 1 ) % 2; 3 flag[ i] = true; 4 while ( flag[ j ] ) cfw_ 5 if ( t
School: Minnesota
Course: Operating Systems
CSCI 5103 (Fall 2010) Answers to Assignment 1 Questions and Grading Criteria Part A ( 100 points) Due September 15, 2010 This part of the assignment must be done individually. Problem 1 (20 points): Which of the following instructions should be allowed on
School: Minnesota
Course: Operating Systems
Department of Computer Science University of Minnesota, Twin Cities CSci 5103 - Operating Systems - Fall 2010 (Instructor: Tripathi) Assignment 3 Due Date: October 12, 2010 Problem 1: In case of Protocol 4 for two-process mutual exclusion, presented in Le
School: Minnesota
Course: Operating Systems
Assignment 7 Linux Device Driver Programming CSCI 5103, Fall 2010 Due November 29, 2010 This assignment can be done in a group of up to three students. Part A: (20 points): In this problem you are asked to rewrite a small part of the scullpipe device driv
School: Minnesota
Course: Operating Systems
CSCI 5103 (Fall 2010) Assignment 4 ( 100 points) Due October 28, 2010 This assignment may be done individually or in a group of two students Objective: The objective of this assignment is to acquire familiarity with using POSIX thread programming primitiv
School: Minnesota
Course: Operating Systems
CSCI 5103 (Fall 2010) Assignment 1 Part A ( 100 points) Due September 15, 2010 This part of the assignment must be done individually. Problem 1 (20 points): Which of the following instructions should be allowed only in the privileged (kernel) mode? a) Dis
School: Minnesota
Course: Operating Systems
Assignment 3 Solutions Two process mutual exclusion Protocol 4: shared data: boolean flag[2]; /initial values false int turn; / 0 or 1 Process i: 1 while (true) . / ENTRY PROTOCOL 2 j = ( i + 1 ) % 2; 3 flag[ i] = true; 4 while ( flag[ j ] ) cfw_ 5 if ( t
School: Minnesota
CSCI 2021, Spring 2010 Written Assignment #1 Instructions: Due Thursday, February 18 in your discussion section. Turn in a hard copy of your work. Write down your full name, ID, and section number in print on your homework paper The problems cover materia
School: Minnesota
* SECTION 2 ANSWER KEY * CSci 1113 Spring 2009 Lab Midterm 90 Minutes Section 2: Monday 1:25-5:25 A. (30 points) Time Zone Program cswanson@shemp (~/spr09/lab_mid) % cat zone.cpp #include<iostream> using namespace std; int time_zone(int hours, char zone);
School: Minnesota
Course: Discrete Structures Of Computer Science
School: Minnesota
Course: Introduction To Computing And Programming Concepts
School: Minnesota
Course: Introduction To Computing And Programming Concepts
School: Minnesota
Course: Introduction To Computing And Programming Concepts
School: Minnesota
Course: Introduction To Computing And Programming Concepts
School: Minnesota
! def change(x):! penny =1! nickel =5! dime =10! quarter =25! q=0! d=0! n=0! p=0! a1 = 'Quarters: '! a2 = 'Dimes: '! a3 = 'Nickels: '! a4 = 'Pennies: '! ! x= 100*oat(x)! if x >=25:! q=int(x/quarter)! x%=quarter! if x >=10:! d = int(x/dime)! x%=dime! if x>
School: Minnesota
2/9/14 <Disclaimer!> These slides are provide on an as-is basis. Largely, unmodified from how they were presented in class. This means there will be errors, corrections are announced in class as they are found. Flow Control Slides will not be posted
School: Minnesota
2/25/14 Recap What does "I ate 5 bananas".split() do? oCreates a list with 4 entries Intro to. Lists hello[1:2] hello[:2] hello[3:] oe, he, lo Stephen J. Guy break command? oExits the current loop Feb 24, 2014 2 Apple Bug Task: Reverse a St
School: Minnesota
CSci 1133, Spring 2014 Lab Exercise 3 Procedural Abstraction In the previous Lab Exercise, you learned about useful functions that have been created by other people. A function was described as an abstraction; a named set of statements that perform some c
School: Minnesota
CSci 1133, Spring 2014 Lab Exercise 1 Introduction to UNIX and Python In this first lab, you will make sure your account is functional and explore a number of computational resources that will be needed during the course of the upcoming semester. You will
School: Minnesota
CSci 1133, Spring 2014 Lab Exercise 6 Lists Python provides several simple and powerful mechanisms to structure data. The list is a vital one that enables us to manipulate and reason with ordered collections. We can use an ordered collection (list) to rep
School: Minnesota
CSci 1133, Spring 2014 Lab Exercise 5 Fun With Strings In this lab we explore operations and methods using string objects. As discussed in lecture, strings are nonscalar, immutable sequence objects consisting of an ordered sequence of individual character
School: Minnesota
CSci 1133, Spring 2014 Lab Exercise 7 Dictionaries and Nested Lists This week, we will continue our exploration of container classes in Python. Dictionaries are mutable structures that provide a powerful association mechanism using key : value pairs, and
School: Minnesota
CSci 1133, Spring 2014 Lab Exercise 9 Recursion This Lab exercise introduces you to a powerful problem solving method using functional recursion. Recursion is an abstraction which is defined in terms of itself. Examples include mathematical abstractions s
School: Minnesota
CSci 1133, Spring 2014 Lab Exercise 10 Introduction to Objects Object-oriented programming is a powerful computational paradigm in which we approach problem solving from the perspective of how data objects interact rather than the step-by-step procedural
School: Minnesota
CSci 1133, Spring 2014 Lab Exercise 12 Simple Inheritance and Polymorphism Graphical programs are natural applications for object-oriented programming. In this lab exercise, you will construct a number of classes to manage objects on a graphical display.
School: Minnesota
CSci 1133, Spring 2014 Lab Exercise 11 Overloading Operators There is much that goes into the construction of a well-designed object class, but when you're done you reap the benefits of a robust and powerful new "widget" for constructing programs. This we
School: Minnesota
Course: Machine Architecture And Organization
HOMEWORK 1 SOLUTIONS FALL 2012 Question 1: A. !x B. !x C. !(x & 0xFF) D. !(x & (0xFF < (sizeof(int)-1)<3) Question 2: 1 /* Return 1 when any odd 2 int any_odd_one(unsigned 3 /* Use mask to select 4 return (x&0xAAAAAAAA) 5 bit of x equals 1; 0 otherwise. A
School: Minnesota
Course: Machine Architecture And Organization
CSCI 2021, Fall 2012 Homework #1 Name: X500: Section: Instructions: This homework must be done individually. Posted Tuesday September 25th and due Friday, October 5th in class. Turn in a hard copy of your work. Handwritten is strongly discouraged. Write d
School: Minnesota
Course: Machine Architecture And Organization
CSCI 2021, Fall 2012 Homework #2 Name: X500: Section: Instructions: Posted Tuesday, October 23th and due Friday, November 2nd in class. Turn in a hard copy of your work. Printed is strongly preferred. Write down your full name, X500, and section number in
School: Minnesota
Sample Take-Home Quiz II Sample Solutions Csci4211: Introduction to Computer Networks Fall 2013 Prof. Zhi-Li Zhang Instructions: 1. Please note that the solutions I provided to many questions are more detailked than necessary! Id like to use this opportun
School: Minnesota
Sample Take-Home Quiz II Version B Csci4211: Introduction to Computer Networks Fall 2013 Prof. Zhi-Li Zhang Last Name: First Name: Student Id. Instructions: 1. This is a open-book and open-note quick. 2. There are ve questions in total, each of which has
School: Minnesota
Midterm Exam Version B Csci4211: Introduction to Computer Networks Fall 2013 Prof. Zhi-Li Zhang Last Name: First Name: Student Id. Instructions: 1. This is a open-book and open-note quick. 2. There are ve questions in total, each of which has several sub-
School: Minnesota
Chapter1:Introduction WhatisaNetwork?WhatisInternet? Comparedwithpostalservice&telephonesystem Servicesprovided NutsandBoltsdescription PacketSwitchingvs.CircuitSwitching FundamentalIssuesinComputerNetworking ProtocolandLayeredArchitecture InternetPr
School: Minnesota
Ne two rkLa ye r:P a rtII BasicRoutingPrinciplesandRoutingAlgorithms LinkStatevs.DistanceVector IntraASvs.InterASrouting IntraAS:RIPandOSPF InterAS:BGPandPolicyRouting RoutingintheInternet BroadcastandMulticastRouting(optional) Readings: T e xtb o o k:
School: Minnesota
802.11WirelessandMobileIP Wirelessand802.11LANs wirelesslinks: shared,fading,interference,hiddenterminalproblem CSMA/CAreflectswirelesschannelcharacteristics DIFS,SIFS,receiverACK,RTS/CTS,NAV, home,visitednetworks direct,indirectrouting careofaddresses m
School: Minnesota
DataLinkLayer:Part2 BroadcastLANandMediaAccessControl TaxonomyofMACProtocols RandomAccess:AlohaandslottedAloha CDMAandCDMA/CD EthernetandItsEvolution TakingTurnsMACProtocols&TokenRing PointtoPointDataLinkProtocols OptionalMaterial: Link(&Network)Virtuali
School: Minnesota
DataLinkLayer DataLinkLayerFunctions deliverframesoverasinglelink framing,mediaaccess,errorchecking(errorcorrection), CyclicRedundancyCodeforerrordetection LocalAreaNetworks(LANs)andMACAddresses MACaddresses(vs.IPaddress) pointtopointvs.sharedaccess IP
School: Minnesota
FinalQuiz FinalReview Dec19(Thu)6:30pm8:30pm;KellerHall3230 comprehensive,emphasisonmaterialcoveredlaterinthesemester Openbook,opennotes,openInternet concepts,issues,mechanisms/algorithms,problemsolving fivebigproblems,2hours,similartoQuizzesI/II Everyt
School: Minnesota
NetworkLayer:PartI NetworkLayerandIPProtocol! PartI: NetworkLayerFunctionsandServiceModels NetworkLayerFunctions IPAddressing NetworkServiceModels:VirtualCircuitvs.Datagram IPForwardingandIPProtocol Briefly:NAT,IPv6andIPv6transition(overIPv4) RouterArc
School: Minnesota
Course: Discrete Structures Of Computer Science
School: Minnesota
Course: Dvanced Algorithms And Data Structures
Outline Planar Point Location Using Persistent Search Trees Notion of (data structure) persistence Motivating application (point location) Sweep + Persistence paradigm N. Sarnak & R. Tarjan Making Red-Black trees persistent CSci 5421: Advanced Algorithms
School: Minnesota
Csci 3003 Midterm Exam #2 Review To help in your studying, weve put together several topics that will be covered on the exam. The exam format will be similar to Midterm #1, and will consist of a mix of questions about short pieces of code (e.g. whats wron
School: Minnesota
Csci 3003 Midterm Exam #1 Review Ive put together several topics that will be covered on the Midterm #1 exam and a list of example questions to help in your studying. The exam will consist of a mix of questions about short pieces of code (e.g. whats wrong
School: Minnesota
Week 11 - Test this Friday - Review Midterm Topics Chapters 4.2-7.2 (not 5.1) - Interpolation error Estimating derivatives Integration techniques Matrix reductions Midterm Topics Interpolation: -Error Estimating derivatives: -Theory -Richardson Extrapolat
School: Minnesota
Week 6 - Midterm Friday - Review Exam format - Chapters 1 - 3 + 4.1-4.2? - One sheet of note paper? - Calculators NOT allowed Review -Absolute and Relative Error -Nested Multiplication -Taylor Series (and Error Term) -Floating Point Representation -Loss o
School: Minnesota
CSci 1001 Spring 2010 Book Review Due Dates: Book selection due 5pm, Friday, March 5. Original version due by 5pm, Friday, April 9. Final version due by 5pm, Friday, April 30. Purpose: One purpose of this class is to learn about computer science in genera
School: Minnesota
IT Labs Home | One Stop | Directories | Search U of M Day Class Notes Ta Email Day Class Notes Evening Class Notes Final Project Lab Notes Office Hours Schedule Syllabus Announcements Check Grades CSci 1113 Home Notes specific to Prof. Swanson's day class
School: Minnesota
Course: Automata
TIME COMPLEXITY CSci 4011 INHERENT LIMITATIONS OF COMPUTER PROGRAMS Definition: Let M be a TM that halts on all inputs. The running time or time-complexity of M is the function f : N N, where f(n) is the maximum number of steps that M uses on any input of
School: Minnesota
Course: Automata
CSci 4011 INHERENT LIMITATIONS OF COMPUTER PROGRAMS HARDEST PROBLEMS IN NP Definition: A language B is NP-complete if: 1. B NP 2. Every A in NP is poly-time reducible to B (i.e. B is NP-hard) If B is NP-Complete and P NP, then There is no fast algorithm f
School: Minnesota
Course: Automata
CSci 4011 INHERENT LIMITATIONS OF COMPUTER PROGRAMS HARDEST PROBLEMS IN NP Definition: A language B is NP-complete if: 1. B NP 2. Every A in NP is poly-time reducible to B (i.e. B is NP-hard) If B is NP-Complete and P NP, then There is no fast algorithm f
School: Minnesota
Course: Automata
QUIZ 5 CSci 4011 INHERENT LIMITATIONS OF COMPUTER PROGRAMS QUIZ 5 The language L TIME(t(n) if: L can be decided by a TM in time O(t(n) The language L NP if: L can be decided by a NTM in time O(nc) L has a polynomial time verifier 3SAT is the language: cfw
School: Minnesota
Course: Automata
TIME COMPLEXITY CSci 4011 INHERENT LIMITATIONS OF COMPUTER PROGRAMS Definition: Let M be a TM that halts on all inputs. The running time or time-complexity of M is the function f : N N, where f(n) is the maximum number of steps that M uses on any input of
School: Minnesota
Course: Automata
TIME COMPLEXITY CSci 4011 INHERENT LIMITATIONS OF COMPUTER PROGRAMS Definition: Let M be a TM that halts on all inputs. The running time or time-complexity of M is the function f : N ! N, where f(n) is the maximum number of steps that M uses on any input
School: Minnesota
Course: Automata
A CIRCUIT CSci 4011 INHERENT LIMITATIONS OF COMPUTER PROGRAMS x0 x1 x2 is a collection of gates and inputs connected by wires. is satisfiable if some setting of inputs makes it output 1. can be encoded as a string CIRCUIT-SAT = cfw_C : C is a satisfiab
School: Minnesota
Course: Automata
ENCODING CHESS CSci 4011 A 88 chess board has 64 squares and 32 pieces: INHERENT LIMITATIONS OF COMPUTER PROGRAMS Each square can have one of 13 values: 4 bits +1 bit encodes turn information. CHESS = cfw_ B | B is a chess board and white can force a win.
School: Minnesota
Course: Automata
CSci 4011 INHERENT LIMITATIONS OF COMPUTER PROGRAMS QUIZ 4 (a) If A and B are languages, then A is mapping reducible to B, or A m B, if there is a computable function such that: w A (w) B (b) The acceptance problem ATM is the language: cfw_ M,w | M is a T
School: Minnesota
Course: Automata
RICES THEOREM CSci 4011 INHERENT LIMITATIONS OF COMPUTER PROGRAMS Let P be a language of Turing machine encodings. IF P satisfies the following properties: For all TMs M1 and M2, where L(M1) = L(M2), M1 P if and only if M2 P There exist TMs MIN P and MOUT
School: Minnesota
Course: Automata
UNDECIDABILITY CSci 4011 INHERENT LIMITATIONS OF COMPUTER PROGRAMS A language is a set of strings. It is a mathematical way of expressing a problem: given an input, is it in the set L? If a language is decidable, there is a computer program (TM) that can
School: Minnesota
Course: Automata
UNDECIDABILITY CSci 4011 INHERENT LIMITATIONS OF COMPUTER PROGRAMS A language is a set of strings. It is a mathematical way of expressing a problem: given an input, is it in the set L? If a language is decidable, there is a computer program (TM) that can
School: Minnesota
Course: Automata
QUIZ 3 The Turing Machine M decides the language L if: CSci 4011 M accepts all w L and rejects all w L. The language L is Turing-recognizable if: INHERENT LIMITATIONS OF COMPUTER PROGRAMS There is a TM that recognizes L (accepts all and only the strings i
School: Minnesota
Course: Automata
SET THEORY 101 CSci 4011 INHERENT LIMITATIONS OF COMPUTER PROGRAMS A function : A ! B is: 1-1 (or injective) if (x)=(y) onto (or surjective) if x=y y x: y = (x) bijective if it is 1-1 and onto. can help us count. If is: 1-1 then |A| |B| onto then |A| |B|
School: Minnesota
Course: Automata
CSci 4011 INHERENT LIMITATIONS OF COMPUTER PROGRAMS Definition: A Turing Machine is a 7-tuple T = (Q, , , , q0, qaccept, qreject), where: Q is a finite set of states is the input alphabet, where ! is the tape alphabet, where ! and : Q Q cfw_L,R q0 Q
School: Minnesota
Course: Automata
TURING MACHINE CSci 4011 INHERENT LIMITATIONS OF COMPUTER PROGRAMS FINITE STATE q1 0 CONTROL I A N P U T INFINITE TAPE A TM recognizes a language if it accepts all (and only) strings in the language. A TM decides a language if it accepts all strings in th
School: Minnesota
Course: Automata
THE 4011 CSci 4011 INHERENT LIMITATIONS OF COMPUTER PROGRAMS First model of a program: DFA / Regexp Solvable Problems: Regular Languages Unsolvable Problems: cfw_ 0n1n | n 0 Next model of a program: PDA / CFG Solvable Problems: Context-Free Languages Uns
School: Minnesota
Course: Automata
QUIZ 2 CSci 4011 INHERENT LIMITATIONS OF COMPUTER PROGAMS What are practical uses for PDAs? Why are pumping lemmas annoying? Buddhist temple, CFG, levitating during meditation? What will be on the upcoming midterm? WTF Implementation of PL? Context-Free P
School: Minnesota
Course: Automata
string CSci 4011 uVw yields uvw if (V v) 2 R. A derives 00#11 in 4 steps. 0, 0 1,0 ,$ 1,0 PARSE TREES A A A 0A1 AB B# A 0A1 00A11 00B11 00#11 push , $ INHERENT LIMITATIONS OF COMPUTER PROGRAMS CONTEXT-FREE GRAMMARS pop A B 00 # 11 A 0A1 00A11 00B11 00#
School: Minnesota
Course: Automata
string CSci 4011 INHERENT LIMITATIONS OF COMPUTER PROGAMS pop push , $ 0, 0 1,0 ,$ 1,0 The language of P is the set of strings it accepts. CONTEXT-FREE GRAMMARS A 0A1 AB B# A 0A1 00A11 00B11 00#11 A derives 00#11 in 4 steps. The language of G is the se
School: Minnesota
Course: Automata
THE PUMPING LEMMA CSci 4011 INHERENT LIMITATIONS OF COMPUTER PROGRAMS Let L be a regular language with |L| = Then there exists a length P such that w L, if |w| P then there exist xyz = w where: 1. |y| > 0 2. |xy| P 3. xyiz L for any i 0 PUMPING NON-REGUL
School: Minnesota
Course: Automata
QUIZ 1 CSci 4011 INHERENT LIMITATIONS OF COMPUTER PROGAMS A language is a: set of strings. If M is a DFA, L(M) is the set cfw_ w | M accepts w . Let M = (Q,q0,F). Q is the set of: states is the: Transition function a qa* b, qend How can you prove that a
School: Minnesota
Course: Automata
M = (Q, !, !, q0, F) where Q = cfw_q0, q1, q2, q3 ! = cfw_0,1 CSci 4011 INHERENT LIMITATIONS OF COMPUTER PROGRAMS * ! : Q " ! " Q transition function q0 # Q is start state F = cfw_q1, q2 $ Q accept states q1 0 1 q0 0 M q3 1 0,1 q2 0 1 * ! 0 1 q0 q0 q1 q1
School: Minnesota
Course: Automata
THE REGULAR OPERATIONS CSci 4011 INHERENT LIMITATIONS OF COMPUTER PROGRAMS Negation: A = cfw_ w | w A Union: A B = cfw_ w | w A or w B Intersection: A B = cfw_ w | w A and w B Reverse: AR = cfw_ w1 wk | wk w1 A Concatenation: A B = cfw_ vw | v A and w
School: Minnesota
Course: Automata
M = (Q, !, !, q0, F) where CSci 4011 INHERENT LIMITATIONS OF COMPUTER PROGAMS q1 0 1 q0 0 M q3 The Language of M, L(M), is the set of strings that M accepts A language is regular if it is recognized by a deterministic finite automaton L = cfw_ w | w conta
School: Minnesota
Course: Automata
COURSE STAFF CSci 4011 INHERENT LIMITATIONS OF COMPUTER PROGRAMS Nick Hopper Dr. Nick Sean KIm Akash Agrawal WHY SHOULD I CARE? THIS STUFF IS USEFUL This class uses mathematical models to think about the limitations of computers PART 1 Automata and Langua
School: Minnesota
Course: Automata
CSci 4011 INHERENT LIMITATIONS OF COMPUTER PROGRAMS string pop !,! " $ push 0,! " 0 1,0 " ! !,$ " ! 1,0 " ! CONTEXT-FREE GRAMMARS A " 0A1 A"B B"# A ! 0A1 ! 00A11 ! 00B11 ! 00#11 uVw yields uvw if (V " v) ! R. A derives 00#11 in 4 steps. PARSE TREES A A A
School: Minnesota
Course: Automata
CSci 4011 INHERENT LIMITATIONS OF COMPUTER PROGAMS string pop !,! " $ push 0,! " 0 1,0 " ! !,$ " ! 1,0 " ! The language of P is the set of strings it accepts. CONTEXT-FREE GRAMMARS A " 0A1 A"B B"# A ! 0A1 ! 00A11 ! 00B11 ! 00#11 A derives 00#11 in 4 steps
School: Minnesota
Course: Automata
CSci 4011 INHERENT LIMITATIONS OF COMPUTER PROGRAMS 4011 SO FAR MODEL OF A PROBLEM: LANGUAGE MODEL OF A PROGRAM: DFA EQUIVALENT MODELS: NFA, REGEXP PROBLEMS THAT A DFA CAN T SOLVE ARE WE DONE? NONE OF THESE ARE REGULAR = cfw_0, 1, L = cfw_ 0n1n | n 0 =
School: Minnesota
Course: Automata
CSci 4011 INHERENT LIMITATIONS OF COMPUTER PROGAMS QUIZ 1 A language is a: set of strings. If M is a DFA, L(M) is the set cfw_ w | M accepts w . Let M = (Q,q0,F). Q is the set of: states is the: Transition function a qa* b, qend How can you prove that a
School: Minnesota
Course: Automata
CSci 4011 INHERENT LIMITATIONS OF COMPUTER PROGRAMS M = (Q, !, !, q0, F) where Q = cfw_q0, q1, q2, q3 ! = cfw_0,1 * ! : Q " ! " Q transition function q0 # Q is start state F = cfw_q1, q2 $ Q accept states q1 0 1 q0 0 M q3 1 0,1 q2 0 1 * ! 0 1 q0 q0 q1 q1
School: Minnesota
Course: Automata
CSci 4011 INHERENT LIMITATIONS OF COMPUTER PROGRAMS THE REGULAR OPERATIONS Negation: A = cfw_ w | w A Union: A B = cfw_ w | w A or w B Intersection: A B = cfw_ w | w A and w B Reverse: AR = cfw_ w1 wk | wk w1 A Concatenation: A B = cfw_ vw | v A and w
School: Minnesota
Course: Automata
CSci 4011 INHERENT LIMITATIONS OF COMPUTER PROGAMS M = (Q, , , q0, F) where Q = cfw_q0, q1, q2, q3 = cfw_0,1 * : Q Q transition function q0 Q is start state F = cfw_q1, q2 Q accept states q1 0 1 q0 0 M q3 1 0,1 q2 0 1 * 0 1 q0 q0 q1 q1 q2 q3 q2 q3 q0 q2
School: Minnesota
Course: Automata
CSci 4011 INHERENT LIMITATIONS OF COMPUTER PROGRAMS COURSE STAFF Nick Hopper Dr. Nick Sean KIm Akash Agrawal This class uses mathematical models to think about the limitations of computers WHY SHOULD I CARE? THIS STUFF IS USEFUL PART 1 Automata and Langua
School: Minnesota
Course: Software Engineering 1
Lecture 28 - Static Techniques Fall 2012 1 To discuss the cost-effectiveness of static verification To describe the program inspection process To show how (simple) static analysis tools may be used To describe and discuss the Cleanroom software developmen
School: Minnesota
Course: Software Engineering 1
Lecture 27 - When to Stop? CSci 5801 - Fall 2012 When have we tested enough? Fall 2012 CSci 5801 - Dr. Mats Heimdahl 1 How do we know when we are done? Stopping Criteria Coverage Budget Plan Reliability Mutation analysis Fall 2012 CSci 5801 - Dr. Mat
School: Minnesota
Course: Software Engineering 1
Lecture 26 - White-Box Testing Selection Fall 2012 1 To understand program flow graphs Present some additional white box selection selection approaches To practice white box test case selection Fall 2012 CSci 5801 - Dr. Mats Heimdahl CSci 5801 - Fall 2012
School: Minnesota
Course: Software Engineering 1
Introduction to Test Automation CSCI 5801 - November 27, 2012 AKA: I developed TRAP, now how do I test this darn thing? You've (presumably) finished developing your version of TRAP. PS - That's due tonight! Next, you need to test it. 2 Next steps for TRAP
School: Minnesota
Course: Software Engineering 1
Lecture 23 - White-Box Testing CSci 5801 - Fall 2012 Using the code to measure test adequacy (and derive test cases) Fall 2012 CSci 5801 - Dr. Mats Heimdahl 1 To describe a second approach to testing which is geared to find program defects To explain the
School: Minnesota
Course: Software Engineering 1
Lecture 21 - Testing Fundamentals CSci 5801 - Fall 2012 Sommerville Chapter 8 Fall 2012 CSci 5801 - Dr. Mats Heimdahl Some definitions 1 What is a test? Testing strategies Lets get the language right How do we tackle a testing project Fall 2012 CSci 580
School: Minnesota
Course: Software Engineering 1
Lecture 21 - To Design CSci 5801 - Fall 2012 Design modeling using UML Fall 2012 1 Discuss how to take your OO conceptual design down to a detailed design suitable for coding Highlight some considerations that might effect your design Introduce the notati
School: Minnesota
Course: Software Engineering 1
Lecture 20 - State Machines CSci 5801 - Fall 2012 Fowler, Chapter 10 Fall 2012 CSci 5801 - Dr. Mats Heimdahl 1 State Machines An alternate way of capturing scenarios Large classes of scenarios Syntax and Semantics When to use state machines Fall 2012 CS
School: Minnesota
Course: Software Engineering 1
Lecture 19 - Interaction Diagrams CSci 5801 - Fall 2012 Sommerville Chapter 7 Fowler Chapters 4 and 11 Fall 2012 CSci 5801 - Dr. Mats Heimdahl 1 Room Notify Request Heat * * 1 1 1 Water Valve 1 Temp Sensor Water Pump Start 1 1 1 Control Panel Furnace 1 1
School: Minnesota
Course: Software Engineering 1
CSci 5801: Software Engineering I Design Patterns Ian De Silva Department of Computer Science desilva@cs.umn.edu Design Guidelines Change happens: expect it, design for it It should be easy to locate where a change is needed 2010, Andy Mangold, Used wit
School: Minnesota
Course: Software Engineering 1
Lecture 17 - Modeling Approach CSci 5801 - Fall 2012 Sommerville Chapter 7 Fowler Chapters 1, 3, 5, and 6 Fall 2012 CSci 5801 - Dr. Mats Heimdahl 1 To introduce one way of gettign a model started Introduce a way of starting to find responsibilities, colla
School: Minnesota
Course: Software Engineering 1
Lecture 16 - Intro to OO CSci 5801 - Fall 2012 Sommerville Chapter 7 Fowler Chapters 1, 3, 5, and 6 Fall 2012 CSci 5801 - Dr. Mats Heimdahl 1 To introduce conceptual modeling To review the OO solution To introduce and discuss the object model (conceptual)
School: Minnesota
Course: Software Engineering 1
Lecture 15 - Architecture CSci 5801 - Fall 2012 The High-Level Structure of a Software Intensive System Fall 2012 CSci 5801 - Dr. Mats Heimdahl 1 Architects are the technical interface between the customer and the contractor building the system A bad arch
School: Minnesota
Course: Software Engineering 1
Lecture 1 - CSci 5801 Introduction CSci 5801 - Fall 2012 Dr. Mats Heimdahl Fall 2012 CSci 5801 - Fall 2012 Mats Heimdahl 1 Understand what CSci 5801 is all about Instructor and teaching model What you should already know Clarify course expectations Ass
School: Minnesota
Course: Software Engineering 1
Lecture 2 - Product and Principles CSci 5801 - Fall 2012 Sommerville Chapter 1 and 10 CSci 5801 - Fall 2012 Mats Heimdahl 1 Define software engineering and explain its importance Discuss the concepts of software products and software processes Understan
School: Minnesota
Course: Software Engineering 1
Lecture 3 - Process CSci 5801 - Fall 2012 Sommerville Chapter 2 and 3 CSci 5801 - Fall 2012 Mats Heimdahl 1 Introduce and/or Review Software Development Processes Definitions, Processes, and Process Models Examples of Software Process Models CSci 5801 -
School: Minnesota
Course: Software Engineering 1
Lecture 5 - Requirements Basics CSci 5801 - Fall 2012 Sommerville Chapter 4 Fall 2012 CSci 5801 - Dr. Mats P.E. Heimdahl 1 Understand the requirements problem Get a feel for the structure of a requirements document Learn how to write good requirements Wh
School: Minnesota
Course: Software Engineering 1
Lecture 5 - Requirements Basics CSci 5801 - Fall 2012 Some Possible Organizations Fall 2012 Dr. Mats P.E. Heimdahl Introduction 1 Identifies the product and application domain Purpose Scope Definitions, acronyms, and abbreviations References Overview
School: Minnesota
Course: Software Engineering 1
Lecture 6 - Requirements Basics CSci 5801 - Fall 2012 Sommerville Chapter 4 Fall 2012 CSci 5801 - Dr. Mats P.E. Heimdahl The requirements problem The structure of a requirements document 1 How to write good requirements Why are they so important What go
School: Minnesota
Course: Software Engineering 1
Lecture 7 - Elicitation CSci 5801 - Fall 2012 Understanding the customers requirements for a software system Fall 2012 CSci 5801 - Dr. Mats P.E. Heimdahl 1 Understanding the concept of Stakeholder Discuss a few techniques to getting all the information we
School: Minnesota
Course: Software Engineering 1
Lecture 9 - Checklists and Testing Fall 2012 CSci 5801 - Dr. Mats P.E. Heimdahl Illustrate the value of checklists 1 Answer questions on the homework CSci 5801 - Fall 2012 Discuss the importance of test cases for the requirements Avoid forgetting things
School: Minnesota
Course: Software Engineering 1
Lecture 10 - Requirements-Based Testing CSci 5801 - Fall 2012 Sommerville Chapter 8 (we will come back here later) Fall 2012 CSci 5801 - Dr. Mats Heimdahl 1 Some definitions Lets get the language right Black-Box Tests Selecting Black-Box Test Cases Fall
School: Minnesota
Course: Software Engineering 1
Lecture 11 - Reference Models CSci 5801 - Fall 2012 Mainly Will It Work? Fall 2012 CSci 5801 - Dr. Mats Heimdahl Understanding what requirements really are 1 Reference Models Fall 2012 CSci 5801 - Dr. Mats Heimdahl 2 Requirements are always in the system
School: Minnesota
Course: Software Engineering 1
Lecture 12 - Design Fundamentals CSci 5801 - Fall 2012 Deriving a solution which satisfies the software requirements Sommerville, Chapter 6 Fall 2012 CSci 5801 - Dr. Mats Heimdahl 1 To define design To introduce the design process To preview two design st
School: Minnesota
KnowledgeBases Introduction Constructionofaknowledgebaseisdonethrough knowledgeengineering. Thegoalistodeterminetheimportantconceptsofa particulardomainandcreateaformalrepresentation ofobjectsandrelationsinthisdomain. Knowledgeacquisitionisimportant. Asig
School: Minnesota
Logic Introduction Knowledgeabouttheworldisimportantforgood decisions.Thisisespeciallytruewhenwetrytobuild intelligentagents. AKnowledgeBase(KB)isthecentralelementofa knowledgebasedagent. Aknowledgebasedagentshouldhavetwoelements: (a)aformallanguageinwhic
School: Minnesota
Course: Introduction To Computing And Programming Concepts
School: Minnesota
! def change(x):! penny =1! nickel =5! dime =10! quarter =25! q=0! d=0! n=0! p=0! a1 = 'Quarters: '! a2 = 'Dimes: '! a3 = 'Nickels: '! a4 = 'Pennies: '! ! x= 100*oat(x)! if x >=25:! q=int(x/quarter)! x%=quarter! if x >=10:! d = int(x/dime)! x%=dime! if x>
School: Minnesota
Sample Take-Home Quiz II Sample Solutions Csci4211: Introduction to Computer Networks Fall 2013 Prof. Zhi-Li Zhang Instructions: 1. Please note that the solutions I provided to many questions are more detailked than necessary! Id like to use this opportun
School: Minnesota
Sample Take-Home Quiz II Version B Csci4211: Introduction to Computer Networks Fall 2013 Prof. Zhi-Li Zhang Last Name: First Name: Student Id. Instructions: 1. This is a open-book and open-note quick. 2. There are ve questions in total, each of which has
School: Minnesota
Midterm Exam Version B Csci4211: Introduction to Computer Networks Fall 2013 Prof. Zhi-Li Zhang Last Name: First Name: Student Id. Instructions: 1. This is a open-book and open-note quick. 2. There are ve questions in total, each of which has several sub-
School: Minnesota
FinalQuiz FinalReview Dec19(Thu)6:30pm8:30pm;KellerHall3230 comprehensive,emphasisonmaterialcoveredlaterinthesemester Openbook,opennotes,openInternet concepts,issues,mechanisms/algorithms,problemsolving fivebigproblems,2hours,similartoQuizzesI/II Everyt
School: Minnesota
Course: Computational Aspects Of Matrix Theory
CSci 5304, F12 Quiz # 1 Today: Oct 1, 2012 Name: The rules: You can and are encouraged to discuss answers to the questions. You need to write your own anwser at the end of the discussion phase. You will get one point if you have written an answer that sho
School: Minnesota
Course: Computational Aspects Of Matrix Theory
CSci 5304, F12 Quiz # 2 Today: Oct. 23, 2012 Name: The rules: You can and are encouraged to discuss answers to the questions. You need to write your own anwser at the end of the discussion phase. You will get one point if you have written an answer that s
School: Minnesota
Course: Computational Aspects Of Matrix Theory
CSci 5304, F12 Quiz 3 11/28/2012 Name: The rules: You can and are encouraged to discuss answers to the questions. You need to write your own anwser at the end of the discussion phase. 1. Let A be a matrix with singular values 1 2 r > 0, and E a perturbati
School: Minnesota
CSci 2033, F12 Quiz 4 November 28, 2012 Do work together to nd answers to the questions. You may be called and asked to give your answer to a specic question. 1. Let v1, v2, in Rm. Show that H = spancfw_v1, v2 is a subspace of Rm. 2. What is the dimension
School: Minnesota
CSci 2033, F12 Quiz # 1 Today: Sept. 24, 2012 Name: The rules: You can and are encouraged to discuss answers to the questions. You need to write your own anwser at the end of the discussion phase. You will get credit for this quizz if you have written an
School: Minnesota
Midterm Exam Study Guide csci1113, Fall 2012 The midterm examination will be held in class, closed book. You will be allowed one 8.5x11 sheet with hand-written notes (no copies allowed). If you use a note sheet, you must include your name and turn it in w
School: Minnesota
* EXAM B ANSWERS * 1. (15 points) a) To increase the range of a floating point number, increase its: _ Mantissa _ Value _X_ Exponent _ Base b) Which of the following has definitions for cout and cin? _ #include _ C _ namespace _ cmath _X_ iostream c) What
School: Minnesota
* EXAM B ANSWERS * 1. (15 points) Statements and Expressions a) Indicate which of the following are not legal identifiers in C+: _X_ 9xyz _ xyz9 _ xyz_9 _X_ x+yz _ Xxy _X_ xyz! b) 234567 c) TRUE d) p + q < 200 & g != 20 e) ran1 = 4.2 + (18.8 - 4.2)*static
School: Minnesota
* EXAM B SOLUTIONS * 1. (15 points) a) Which computer has the greatest precision? _A_ Which computer has the greatest range? _B_ If you wanted to represent the value for , which computer would have the greatest roundoff error? _B_ b) The compiler will gen
School: Minnesota
* EXAM A ANSWERS * 1. (15 points) a) Which of the following has definitions for cout and cin? _ C _ namespace _X_ iostream _ cmath _ #include b) To increase the precision of a floating point number, increase its: _X_ Mantissa _ Value _ Exponent _ Base c)
School: Minnesota
* EXAM A ANSWERS * 1. (15 points) Statements and Expressions a) FALSE b) a + b != 200 & b >= 20 c) 34567 d) ran1 = 12.5 + (24.5 - 12.5)*static_cast<double>(rand() )/RAND_MAX; e) Indicate which of the following are legal identifiers in C+: _ 9xyz _X_ xyz9
School: Minnesota
* EXAM A SOLUTIONS * 1. (15 points) a) Which computer has the greatest precision? _B_ Which computer has the greatest range? _A_ If you wanted to represent the value for , which computer would have the greatest roundoff error? _A_ b) When an incorrect res
School: Minnesota
Course: Operating Systems
University of Minnesota Department of Computer Science Set of Sample Questions for the Mid-quarter Exam CSci 5103 (Instructor: Tripathi) You should look tat he following questions from the textbook as they are good representive of exam questions. The ques
School: Minnesota
Course: Operating Systems
CSci 5103 Operating Systems Sample Questions for Midterm Exam Problems from Chapter 3: 4, 9, 11, 18, 21, 31 Problems from Chapter 6: 14, 15, 20, 21, 24 Problem 1: Consider the snapshot of a system with four resource types A, B, C, D. There are five proces
School: Minnesota
Course: Operating Systems
CSci 5103 - Fall 2010 (Instructor: Tripathi) Final Exam Date: December 22, 2010 (Time 1:30-3:30) (Time: 120 minutes) Total Points 90 This exam contains 7 questions. CLOSED BOOK/CLOSED NOTES STUDENT NAME: Problem 1 (30 points): 1. (5 points) Identify at le
School: Minnesota
Course: Adv. Algorithms & Data Structures
CSci 5421: Practice Questions for Final Exam Note: These questions pertain to material covered beyond the syllabus for the Midterm 2. The syllabus for the Final includes all topics covered in the course, so be sure to review earlier material also. 1. Let
School: Minnesota
Course: Software Engineering 1
Software Engineering I CSci 5801 - Fall 2011 Final This is a 120 minute exam. It is a closed book test. On all essay type questions, you will receive points based on the quality of the answer - not the quantity. Be concise! Make an effort to write legibly
School: Minnesota
Course: Software Engineering 1
Software Engineering I CSci 5801 - Fall 2011 Final Suggested Solution Question 1 5 Points. Warm-up question. The following short questions are worth 1 or 2 points each. 2 Points: (more than one answer may be correct, pick all that apply). Which of the fol
School: Minnesota
Course: Dvanced Algorithms And Data Structures
CSci 5421: Practice Questions for Final Exam Note: These questions pertain to material beyond the syllabus for the second Midterm. The syllabus for the Final includes all topics covered in the course, however, so be sure to review earlier material also. 1
School: Minnesota
CSci 5403, Spring 2010 Exam 3 due: April 21, 2010 You may use the textbook and the class notes and example solutions, but no other sources to complete this exam. Graph Coloring. Recall that a graph G = (V, E ) is k -colorable if there exists an assignment
School: Minnesota
CSci 5403, Spring 2010 Exam 3 due: March 24, 2010 You may use the textbook and the class notes and example solutions, but no other sources to complete this exam. In particular, you may assume without proof that for every i 0 there exists a eld F2i with 2i
School: Minnesota
CSci 5403, Spring 2010 Exam 1 due: Feb 19, 2010 For each of the following languages, prove the tightest upper and lower bounds you can on its complexity. For our purposes, an upper bound is a proof that the language resides in some complexity class, and a
School: Minnesota
Course: Software Engineering II
Homework 3 To: CSci 5802, All students CC: Teaching Assistant From: Dr. Mats Heimdahl Date: 2/23/2010 Re: Homework Assignment 3 Creating Test Cases The problem Given the category partitions you created in the previous assignment, please create test-cases
School: Minnesota
CSCI 5512W: Articial Intelligence II (Spring08) Mid-Term Exam 1. (25 points) In your local nuclear power station, there is an alarm that senses when a temperature gauge exceeds a given threshold. The gauge measures the temperature of the core. Consider th
School: Minnesota
Name: _ Csci 3003 Midterm Exam #2 Thursday, April 16, 2009 Guidelines (read carefully!) The exam will only consist of one section, and you are allowed to use your notes, lab solutions, the internet, Matlab, or any other resource other than your neighbor.
School: Minnesota
Name: _ Csci 3003 Midterm Exam #1, Part I Thursday, February 26, 2009 Guidelines (read carefully!) The exam will have two parts. Part I will be written and will ask you to interpret short sections of code, state the value of variables, and write very shor
School: Minnesota
Advanced Operating Systems Theory CSci 8101 (Spring 2010) Midterm Exam (Take Home) Due Date Friday March 12 (Morning 11:00 AM) Please submit your answers online in PDF format only. This exam must be answered individually without consulting anyone. (Late s
School: Minnesota
Course: Software Engineering II
Quiz 1 To: CSci 5802, All students CC: Teaching Assistant From: Dr. Mats Heimdahl Date: 2/7/2010 Re: Quiz 1 Test This The Problem Adopted from Meyers Develop test cases for the following program that you think would adequately test this program. Briefly e
School: Minnesota
Course: Fundamentals Of Computer Graphics II
CSci 5108: Final Project proposal due: 9pm, Thursday, April 29 oral presentation: 10:30am, Tuesday, May 11 project due: 9pm, Thursday, May 13 For your final project you may extend one of the assignments that you have already done in this course or you may
School: Minnesota
Course: Internet Programming
The HTML DOM - The HTML DOM is a W3C standard and it is an abbreviation for the Document Object Model for HTML. The HTML DOM defines a standard set of objects for HTML, and a standard way to access and manipulate HTML documents. All HTML elements, along w
School: Minnesota
Course: The Body And Politics Of Representation
CSCL 3458W The Body and the Politics of Representation- Midterm Essay Topics Due: Monday, Nov. 2 Please choose to write on one of the following topics: 1. Foucault claims the nineteenth-century homosexual became a personage, a past, a case history, and a
School: Minnesota
School: Minnesota
#include <iostream> using namespace std ; int f(int * p1, int * p2) cfw_ int m = 1 ; for (int i = 0; i < * p2; +i) m = m * * p1 ; + p1 ; + * p2 ; return m; int g(int & p1, int & p2) cfw_ int m = 1 ; for (int i = 0; i < p2; +i) m = m * p1 ; + p1 ; - p2 ;
School: Minnesota
#include <iostream> using namespace std ; void g ( int a, int & b, int int x ; x = a + *c ; b=x+2; *d = x + b ; *d = c; *d = 9 ; * c, int * * d) cfw_ void f ( int v, int * w, int * * x, int & y, int & z ) cfw_ int u ; v=4; *x = 2 ; u=z; if (*x = z ) cfw_
School: Minnesota
#include <iostream> using namespace std ; int main() cfw_ int a, b ; int *c, *d ; a=1; b=a+3; c = &a ; d=c; *c = a + b ; b = *d + 5 ; cout cout cout cout < < < < "a = " < a < endl ; "b = " < b < endl ; "*c = " < *c < endl ; "*d = " < *d < endl ;
School: Minnesota
School: Minnesota
* EXAM B ANSWERS * 1. (20 points) int n; bool isPrime; cout < "enter a number: "; cin > n; isPrime = true; for(int i = 2; i < n; i+) cfw_ if(n%i = 0) isPrime = false; if(isPrime) cout < n < " is prime" < endl; else cout < n < " is not prime" < endl; 2. (
School: Minnesota
* EXAM A ANSWERS * 1. (20 points) int num, previous = -1; cout < "Enter a series of positive integers, negative to stop: "; cin > num; while(num >= 0) cfw_ if(num != previous) cout < num < " "; previous = num; cin > num; cout < endl; 2. (15 points) a) Ex
School: Minnesota
Here are a couple more examples of what the output of Part D should look like: % python hw6d.py Guess Number 1 Please enter a row : 4 Please enter a column: 9 No clues for robot location. No clues for mouse location. Guess Number 2 Please enter a row : 2
School: Minnesota
CSCI 2009 SPR 2009 FINAL EXAM ANSWER KEY = (1) (a) False (it allows virtual exploration of an actual archaeological site) (b) True (c) True (d) True - 2 - (a) The following are possibilities: - "rst" - "zab" (b) The following are true: - Whether VCRs a
School: Minnesota
CSci 1001 Spring 2009 Final Exam: Standard Version NAME: Time: 2 hours. Please show your work. Open book and note; however, electronic devices are not allowed. Please note there are 9 questions in all. Do well. (1) [8 points] Mark each of the following as
School: Minnesota
COMMENTS ON THE FINAL EXAM = - The final exam will be Wed. May 12 from 8:00 - 10:00am in the usual class room. - Note the 2 hour time period. - It will be open book and note: you may use the textbook for this class, any class notes you've taken, any
School: Minnesota
* SOLUTIONS * Final Exam Sample Questions - Spring 2010 Note: these questions are based on material since the midterm The final exam will have questions from the earlier material as well. 1. PC Class You are to write part of a class named PC to represent
School: Minnesota
Final Exam Sample Questions - Spring 2010 Note: these questions are based on material since the midterm The final exam will have questions from the earlier material as well. 1. PC Class You are to write part of a class named PC to represent features of pe
School: Minnesota
School: Minnesota
Course: Operating Systems
Assignment 3 Solutions Two process mutual exclusion Protocol 4: shared data: boolean flag[2]; /initial values false int turn; / 0 or 1 Process i: 1 while (true) . / ENTRY PROTOCOL 2 j = ( i + 1 ) % 2; 3 flag[ i] = true; 4 while ( flag[ j ] ) cfw_ 5 if ( t
School: Minnesota
Course: Operating Systems
CSCI 5103 (Fall 2010) Answers to Assignment 1 Questions and Grading Criteria Part A ( 100 points) Due September 15, 2010 This part of the assignment must be done individually. Problem 1 (20 points): Which of the following instructions should be allowed on
School: Minnesota
Course: Operating Systems
Department of Computer Science University of Minnesota, Twin Cities CSci 5103 - Operating Systems - Fall 2010 (Instructor: Tripathi) Assignment 3 Due Date: October 12, 2010 Problem 1: In case of Protocol 4 for two-process mutual exclusion, presented in Le
School: Minnesota
Course: Operating Systems
Assignment 7 Linux Device Driver Programming CSCI 5103, Fall 2010 Due November 29, 2010 This assignment can be done in a group of up to three students. Part A: (20 points): In this problem you are asked to rewrite a small part of the scullpipe device driv
School: Minnesota
Course: Operating Systems
CSCI 5103 (Fall 2010) Assignment 4 ( 100 points) Due October 28, 2010 This assignment may be done individually or in a group of two students Objective: The objective of this assignment is to acquire familiarity with using POSIX thread programming primitiv
School: Minnesota
Course: Operating Systems
CSCI 5103 (Fall 2010) Assignment 1 Part A ( 100 points) Due September 15, 2010 This part of the assignment must be done individually. Problem 1 (20 points): Which of the following instructions should be allowed only in the privileged (kernel) mode? a) Dis
School: Minnesota
Course: Operating Systems
Assignment 3 Solutions Two process mutual exclusion Protocol 4: shared data: boolean flag[2]; /initial values false int turn; / 0 or 1 Process i: 1 while (true) . / ENTRY PROTOCOL 2 j = ( i + 1 ) % 2; 3 flag[ i] = true; 4 while ( flag[ j ] ) cfw_ 5 if ( t
School: Minnesota
CSCI 2021, Spring 2010 Written Assignment #1 Instructions: Due Thursday, February 18 in your discussion section. Turn in a hard copy of your work. Write down your full name, ID, and section number in print on your homework paper The problems cover materia
School: Minnesota
Course: Machine Architecture And Organization
HOMEWORK 1 SOLUTIONS FALL 2012 Question 1: A. !x B. !x C. !(x & 0xFF) D. !(x & (0xFF < (sizeof(int)-1)<3) Question 2: 1 /* Return 1 when any odd 2 int any_odd_one(unsigned 3 /* Use mask to select 4 return (x&0xAAAAAAAA) 5 bit of x equals 1; 0 otherwise. A
School: Minnesota
Course: Machine Architecture And Organization
CSCI 2021, Fall 2012 Homework #1 Name: X500: Section: Instructions: This homework must be done individually. Posted Tuesday September 25th and due Friday, October 5th in class. Turn in a hard copy of your work. Handwritten is strongly discouraged. Write d
School: Minnesota
Course: Machine Architecture And Organization
CSCI 2021, Fall 2012 Homework #2 Name: X500: Section: Instructions: Posted Tuesday, October 23th and due Friday, November 2nd in class. Turn in a hard copy of your work. Printed is strongly preferred. Write down your full name, X500, and section number in
School: Minnesota
Course: Computational Aspects Of Matrix Theory
CSci 5304, F12 Homework # 1 Due Date: 09-19-2012 1. Show that circulant matrices are normal. [Hint: Use denition. The entry (i, j ) of AAH is the inner product of rows i and j of A, .] Are Hankel matrices normal? [Hint: answer is trivial!] Are Toeplitz ma
School: Minnesota
Course: Computational Aspects Of Matrix Theory
CSci 5304, F12 Homework # 2 Due Date: 10-03-2012 1. Show that the condition number of any any n n matrix associated with the Frobenius norm satises: F (A) n. 2. Show that (AB ) (A)(B ). Is it true in general that (A) = (AT )? Show that 2 (A) = 2 (AT ) and
School: Minnesota
Course: Computational Aspects Of Matrix Theory
CSci 5304, F12 Homework # 4 Due Date: 11-07-2012 Note: some data and scripts are available from the matlab section of the class web-site. 1. Exercise 4.2.4. (Page 150) from text. 2. Consider the matrix 4 2 4 A = 2 2 2 4 2 8 (a) Find the LU factorization o
School: Minnesota
Course: Computational Aspects Of Matrix Theory
CSci 5304, F12 Homework # 3 Due Date: 10-24-2012 1. (a) Find the LU factorization of the matrix: 4 4 0 2 2 6 2 3 A= 2 0 5 8 0 2 1 3 (b) What is the determinant of A? (c) Solve the linear system Ax = b where b = [6, 7, 9, 4]T using the LU factors obtained
School: Minnesota
Course: Computational Aspects Of Matrix Theory
CSci 5304, F12 Homework # 5 Due Date: 12-10-12 Note that the due date has been post-poned to Dec. 10. 1. Problem 7.4.6 from text [p. 350] 2. Problem 7.4.10 from text [p. 350] read about companion matrices in the text. 3. Apply Gershgorins theorem to nd a
School: Minnesota
CSci 2033, F12 Homework # 6 Due Date: 12/10/2012 1. The yearly temperature cycle in Fairbanks, Alaska is given in the next table. Date abc d e fgh i jk lm Degrees -14 -9 2 15 35 52 62 63 58 50 34 12 -5 There are 13 equally spaced data points which corresp
School: Minnesota
CSci 2033, F12 Homework # 5 Due Date: 11/28/2012 Note: there will be substantial coverage of questions 1 and 2 in class. 1. This question is about changing bases and proving that bases must have the same number of vectors. Let [u1 , u2 , , un ] and [v1 ,
School: Minnesota
CSci 2033, F12 Homework # 4 Due Date: 11/07/2012 1. Suppose you want to compute the inverse of an n n upper triangular matrix A by solving the systems Axi = ei , where ei is the i-th column of the identity matrix. When solving for xi you only need to work
School: Minnesota
CSci 2033, F12 Homework # 2 Due Date: 10/01/2012 1. Consider the ane plane consisting of all vectors in R3 that are of the form 2 1 1 1 + 2 + 0 1 0 0 (a) On a geometrical gure (hand-drawn OK) - show how you determine the point corresponding to the select
School: Minnesota
CSci 2033, F12 Homework # 1 Due Date: 09/17/2012 1. Exercise 32 from set 1.1 of text. Here is the question: Find the elementary row operation that transforms the frist matrix into the second and then the inverse row operation that transforms the second ma
School: Minnesota
Course: Automata
CSci 4011, Spring 2013 Homework 12 due: May 7, 2013 1. Prove that 2csp is np-hard by reduction from 3color. Depending on how you look at it, this could be a reduction by restriction, local replacement, or component design. 2. The Coloring Game is played i
School: Minnesota
Course: Automata
CSci 4011 - Homework 11 Solution 1. A graph is k -colorable if the nodes of the graph can each be assigned one of k colors so that there is no edge between two nodes of the same color. Let k -COLOR = cfw_ G | G is a k -colorable undirected graph . Prove t
School: Minnesota
Course: Automata
CSci 4011, Spring 2013 Homework 11 due: April 30, 2013 1. A graph is k -colorable if the nodes of the graph can each be assigned one of k colors so that there is no edge between two nodes of the same color. Let k -color = cfw_ G | G is a k -colorable undi
School: Minnesota
Course: Automata
CSCI 4011 - Homework 10 Solution 1. This is a problem about 3SAT. (a) Find a satisfying assignment to the formula a = (x1 x2 x3 ) (x1 x2 x3 ) (x1 x2 x3 ) Let x1 = 1, x2 = 0, and x3 = 0 or 1. (b) Find a satisfying assignment to the formula b = (x1 x3 x2 )
School: Minnesota
Course: Automata
CSci 4011, Spring 2013 Homework 10 due: April 23, 2013 1. This is a problem about 3SAT. (a) Find a satisfying assignment to the formula a = (x1 x2 x3 ) (x1 x2 x3 ) (x1 x2 x3 ) (b) Find a satisfying assignment to the formula b = (x1 x3 x2 ) (x1 x3 x2 ) (
School: Minnesota
Course: Automata
CSci 4011 - Homework 9 Solutions April 15, 2013 1. Prove each of the following asymptotic statements: (As usual in computer science, logarithms are base 2 unless otherwise specied.) There are a few rules that make problems like this easy. Proofs are left
School: Minnesota
Course: Automata
CSci 4011, Spring 2013 Homework 9 due: April 16, 2013 1. Prove each of the following asymptotic statements: (a) n n log(log n) + 192n(log n)2 = O(n2 ). (b) 2n = o(en ) (c) n log(ne ) = (n log n) (where e = 2.718 . . . ) (d) 8log n + 3n2 n = O(n3 ) (As usu
School: Minnesota
Course: Automata
CSci 4011 - Homework 8 Solutions April 1, 2013 1. Most modern programming languages are either compiled to platformspecic object code (e.g. x86/x64, PPC, or ARM assembly language) or compiled to some portable, low-level bytecode language (for example java
School: Minnesota
Course: Automata
CSci 4011, Spring 2013 Homework 8 due: April 2, 2013 1. Most modern programming languages are either compiled to platform-specic object code (e.g. x86/x64, PPC, or ARM assembly language) or compiled to some portable, low-level bytecode language (for examp
School: Minnesota
Course: Automata
CSci 4011 - Homework 7 Solutions March 27, 2013 1. Problem 5.3 in the textbook. Here is a PCP match: ab abab ab abab aba b b a b a aa a aa a 2. In Lectures 13 and 14 (March 7 and 12), we discussed how we could prove that ATM is undecidable using the fact
School: Minnesota
Course: Automata
CSci 4011, Spring 2013 Homework 7 due: March 26, 2013 1. Problem 5.3 in the textbook. 2. In Lectures 13 and 14 (March 7 and 12), we discussed how we could prove that ATM is undecidable using the fact that DTM is undecidable, and how we could prove that HA
School: Minnesota
Course: Automata
CSCI 4011 - Homework 6 Solution March 10, 2013 1. Informally describe a TM to decide the language step = cfw_ M, C1 , C2 | M is a TM such that conguration C1 yields C2 . The machine works as follows: on input M , C1 , C2 where M is a TM and C1 and C2 are
School: Minnesota
Course: Automata
CSci 4011, Spring 2013 Homework 6 due: March 12, 2013 1. Informally describe a TM to decide the language step = cfw_ M, C1 , C2 | M is a TM such that conguration C1 yields C2 . 2. Let N = cfw_0, 1, 2, 3, 4, . . . be the natural numbers, and let U L = P (
School: Minnesota
Course: Automata
CSCI 4011 - Homework 5 Solution February 26, 2013 1. Let M be the TM for the add language that was discussed in Tuesdays discussion. Give the complete sequence of congurations that M goes through when processing the string 1#1#1. (Notice that this string
School: Minnesota
Course: Automata
CSci 4011, Spring 2013 Homework 5 due: March 5, 2013 1. Let M be the TM for the add language that was discussed in Tuesdays discussion. Give the complete sequence of congurations that M goes through when processing the string 1#1#1. (Notice that this stri
School: Minnesota
Course: Automata
CSCI 4011 - Homework 4 Solution February 15, 2013 1. Let G = (V, , R, S ) where V = cfw_A, B, S, C , = cfw_a, b, R = cfw_S AB |BA, B CBC |b, A CAC |a, C a|b. (a) What is the language L(G)? The language L(G) is the set of strings cfw_xy : x, y and |x| =
School: Minnesota
Course: Automata
CSCI 4011 - Homework 3 Solution February 19, 2013 1. Use the pumping lemma to prove that each of the following languages is not regular: (a) L1 = cfw_ai baj bak | k = i + j . Assume otherwise, that L1 is regular. Let p be the pumping length given by the p
School: Minnesota
Course: Development Software
(L 0) (L 7) Language translators ; (2) Translator Structure and Regular Expressions ; (2) The scanner Exercise L7.2.2, #1. CSci 3081 - Programming Languages L7.2 Translator Structure and Regular Expressions Introduce yourself to someone you do not know -
School: Minnesota
Course: Development Software
(L 0) (L 5) C+ ; (1) Declarations, Denitions, header les ; (2) Header les Exercise L5.1.2, #1. CSci 3081 - Programming Languages L5.1: C+: Declarations, Denitions, header les Consider WordCount.cpp . How should we rewrite this to be more modular? List a f
School: Minnesota
Course: Development Software
(L 3) Software Models ; (1) State Machines ; (2) Theory Exercise L3.1.2, #1. CSci 3081 - Programming Languages L3.3: State Machines Draw a state machine that species the allowed sequence of actions on a le object (open, close, read, and write). Prof. Eric
School: Minnesota
Course: Development Software
(L 0) (L 1) Course Logistics ; (1) Course Introduction ; (1) Intended Learning Outcomes Exercise L1.1.1, #1. What does program better mean? CSci 3081 - Programming Languages L0.1 Course Introduction List 3 or 4 items in 1 minute: 1. 2. 3. 4. Prof. Eric Va
School: Minnesota
Course: Discrete Structures Of Computer Science
Spring 13: CSci 2011Discrete Structures of Computer Science 25 points Homework 4 Out Fri., 2/15 Due Fri., 2/22 Instructions: Please review carefully the instructions given for Homework 1. They apply to this assignment, too. Please hand in your answers to
School: Minnesota
Course: Discrete Structures Of Computer Science
Spring 13: CSci 2011Discrete Structures of Computer Science 25 points Homework 3 Out Fri., 2/8 Due Fri., 2/15 Instructions: Please review carefully the instructions given for Homework 1. They apply to this assignment, too. Please hand in your answers to t
School: Minnesota
Course: Discrete Structures Of Computer Science
Spring 13: CSci 2011Discrete Structures of Computer Science 25 points Homework 2 Out Fri., 2/1 Due Fri., 2/8 Instructions: Please review carefully the instructions given for Homework 1. They apply to this assignment, too. Please hand in your answers to th
School: Minnesota
Course: Discrete Structures Of Computer Science
Spring 13: CSci 2011Discrete Structures of Computer Science 25 points Homework 1 Out Fri., 1/25 Due Fri., 2/1 Instructions: This assignment is due at the beginning of class. Do all the problems listed below and hand in your solutions. Problems numbers cor
School: Minnesota
Course: Automata
CSci 4011, Spring 2013 Homework 4 due: February 19, 2013 1. Let G = (V, , R, S ) where V = cfw_A, B, S, C , = cfw_a, b, R = cfw_S AB |BA, B CBC |b, A CAC |a, C a|b. (a) What is the language L(G)? (b) Use the construction in Lemma 2.21 to convert G to a P
School: Minnesota
Course: Automata
CSci 4011, Spring 2013 Homework 3 due: February 12, 2013 For all problems on this homework, assume the alphabet is = cfw_a, b. 1. Use the pumping lemma to prove that each of the following languages is not regular: (a) L1 = cfw_ai baj bak | k = i + j . (b)
School: Minnesota
Course: Automata
CSCI 4011 - Homework 2 Solution February 2, 2013 1. Using the alphabet 1 = cfw_a, b, design NFAs for each of the following languages: (a) L1 = cfw_w | 2 |w| 3 In this problem, we need to check the length of the string. The automata needs to remember the l
School: Minnesota
Course: Automata
CSci 4011, Spring 2013 Homework 2 due: February 5, 2013 1. Using the alphabet 1 = cfw_a, b, design NFAs for each of the following languages: (a) L1 = cfw_w | 2 |w| 3. (b) L2 = cfw_w | every b in w is followed by an a. (c) L3 = L1 L2 , using the concatenat
School: Minnesota
Course: Automata
CSCI 4011 - Homework 1 Solutions January 19, 2013 1. For this problem, well work over the alphabet 1 = cfw_a, b, c. For each of the following languages, give two strings that are in the language, and two that are not, and then design a DFA to recognize th
School: Minnesota
Course: Automata
CSci 4011, Spring 2013 Homework 1 due: January 29, 2013 In this homework, we will design several nite automata. A textbook solution to such problems will describe what each state in the automaton represents about the input and why the transitions between
School: Minnesota
- SOLUTIONS -CSci 1113 Spring 2011 - Sample Midterm Exam Questions Note: These are sample questions from previous exams. The actual exam may have fewer questions. 1. Terms and definitions a) What are the three structures of structured programming? Sequenc
School: Minnesota
- SOLUTIONS -CSci 1113 Fall 2010 - Sample Midterm Exam Questions Note: These are sample questions from previous exams. The actual exam may have fewer questions. 1. Terms and definitions a) What are the three structures of structured programming? Sequence
School: Minnesota
Course: Adv. Algorithms & Data Structures
Fall 12: CSci 5421Advanced Algorithms and Data Structures Out 9/4 Homework 1 Due 9/18 Instructions: This assignment is due at the beginning of class (see Class Policies in the syllabus). Please do all problems. However, due to TA resource limitations, we
School: Minnesota
Course: Adv. Algorithms & Data Structures
Fall 12: CSci 5421Advanced Algorithms and Data Structures Out 9/18 Homework 2 Due 10/4 Please do all problems; we will grade a subset of these problems (same subset for everyone). Please follow all of the instructions given in the handout for Homework 1.
School: Minnesota
Course: Adv. Algorithms & Data Structures
Fall 12: CSci 5421Advanced Algorithms and Data Structures Out 10/9 Homework 3 Due 10/25 Please do all problems; we will grade a subset of these problems (same subset for everyone). Please follow all of the instructions given in the handout for Homework 1.
School: Minnesota
Course: Adv. Algorithms & Data Structures
Fall 12: CSci 5421Advanced Algorithms and Data Structures Out 10/25 Homework 4 Due 11/13 Please do all problems; we will grade a subset of these problems (same subset for everyone). Please follow all of the instructions given in the handout for Homework 1
School: Minnesota
Course: Adv. Algorithms & Data Structures
Fall 12: CSci 5421Advanced Algorithms and Data Structures Out 11/15 Homework 5 Due 12/6 Please do all problems; we will grade a subset of these problems (same subset for everyone). Please follow all of the instructions given in the handout for Homework 1.
School: Minnesota
Course: Software Engineering 1
Deliverable To: CSci 5801, All Students From: De Silva, Gay, and Heimdahl Date: 9/23/2012 Re: Homework 1, TRAP Requirements. The Problem In the course of doing business, people have to travel - be it to close the deal, to go to customer sites, to advertis
School: Minnesota
* SECTION 2 ANSWER KEY * CSci 1113 Spring 2009 Lab Midterm 90 Minutes Section 2: Monday 1:25-5:25 A. (30 points) Time Zone Program cswanson@shemp (~/spr09/lab_mid) % cat zone.cpp #include<iostream> using namespace std; int time_zone(int hours, char zone);
School: Minnesota
CSci 1133, Spring 2014 Lab Exercise 3 Procedural Abstraction In the previous Lab Exercise, you learned about useful functions that have been created by other people. A function was described as an abstraction; a named set of statements that perform some c
School: Minnesota
CSci 1133, Spring 2014 Lab Exercise 1 Introduction to UNIX and Python In this first lab, you will make sure your account is functional and explore a number of computational resources that will be needed during the course of the upcoming semester. You will
School: Minnesota
CSci 1133, Spring 2014 Lab Exercise 6 Lists Python provides several simple and powerful mechanisms to structure data. The list is a vital one that enables us to manipulate and reason with ordered collections. We can use an ordered collection (list) to rep
School: Minnesota
CSci 1133, Spring 2014 Lab Exercise 5 Fun With Strings In this lab we explore operations and methods using string objects. As discussed in lecture, strings are nonscalar, immutable sequence objects consisting of an ordered sequence of individual character
School: Minnesota
CSci 1133, Spring 2014 Lab Exercise 7 Dictionaries and Nested Lists This week, we will continue our exploration of container classes in Python. Dictionaries are mutable structures that provide a powerful association mechanism using key : value pairs, and
School: Minnesota
CSci 1133, Spring 2014 Lab Exercise 9 Recursion This Lab exercise introduces you to a powerful problem solving method using functional recursion. Recursion is an abstraction which is defined in terms of itself. Examples include mathematical abstractions s
School: Minnesota
CSci 1133, Spring 2014 Lab Exercise 10 Introduction to Objects Object-oriented programming is a powerful computational paradigm in which we approach problem solving from the perspective of how data objects interact rather than the step-by-step procedural
School: Minnesota
CSci 1133, Spring 2014 Lab Exercise 12 Simple Inheritance and Polymorphism Graphical programs are natural applications for object-oriented programming. In this lab exercise, you will construct a number of classes to manage objects on a graphical display.
School: Minnesota
CSci 1133, Spring 2014 Lab Exercise 11 Overloading Operators There is much that goes into the construction of a well-designed object class, but when you're done you reap the benefits of a robust and powerful new "widget" for constructing programs. This we
School: Minnesota
CSCI 3081 Lab Session Aaron Halfaker <firstname>.<lastname>@gmail.com whoami PhD Student Human Computer Interaction Interfaces that support communities Software engineer for ~ 2 years Today Development Environment Itlabs account Go to class webpage for la
School: Minnesota
CSci 3003: Introduction to Computing in Biology Lab Assignment #8 20 points Assigned: 4/7/10 Due: Tuesday, 4/27/10 (before midnight) Goals of this lab: Practice using Matlab to load/analyze expression data. Practice using software tools to explore and int
School: Minnesota
CSci 3003: Introduction to Computing in Biology Lab Assignment #7 20 points Assigned: 3/24/10 Due: Tuesday, 4/6/10 (before midnight) Goals of this lab: Practice using Matlab to load/analyze data. Learn about statistical analyses of gene expression data. L
School: Minnesota
CSci 3003: Introduction to Computing in Biology Lab Assignment #6 10 points Assigned: 3/10/10 Due: Tuesday, 3/23/10 (before midnight) Goals of this lab: Become familiar with the Matlab interface. Run/modify a simple Matlab script. Part I: Instructions for
School: Minnesota
CSci 3003: Introduction to Computing in Biology Lab Assignment #5 20 points Assigned: 3/3/10 Due: 3/19/10 (before midnight) Goals of this lab: Practice writing programs to accomplish complex tasks. Practice regular expressions. Learn about gene expression
School: Minnesota
CSci 3003: Introduction to Computing in Biology Lab Assignment #4 30 points Assigned: 2/10/10 Due: 2/23/10 (before midnight) Goals of this lab: Practice manipulating arrays. Become familiar with using conditional statements and loops. Practice reading in
School: Minnesota
CSci 3003: Introduction to Computing in Biology Lab Assignment #3 15 points Assigned: 2/3/10 Due: 2/9/10, before midnight Goals of this lab: (1) (2) (3) (4) Practice Perl syntax rules covered in class. Use numeric and string operations to manipulate varia
School: Minnesota
CSci 3003: Introduction to Computing in Biology Lab Assignment #2 15 points Assigned: 1/27/10 Due: 2/2/10 Goals of this lab: Become familiar with using public databases for browsing gene information, obtaining sequence data. Get practice using the Linux e
School: Minnesota
CSci 3003: Introduction to Computing in Biology Lab Assignment #1 5 points Assigned: 1/20/10 Due: 1/26/10, 2pm Goals of this lab: Get practice using the Linux environment for writing and running Perl scripts. See and run your first Perl script and begin u
School: Minnesota
Course: Programming 1
; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; Lab 11 - Due 11/29 Filename: lab11.scm Name(s): This file is organized as follows. The file is broken into parts for each problem. The first part is an empty skeleton of the procedures you are to right for that proble
School: Minnesota
Course: Programming 1
#| = LAB 10 = | |# ; Utility Functions ; Reloads the current file. (define (reload) (load "lab10.scm") ; Change file name if copied to a new file. ) ; Test Code ; This has only been tested for STk and it is ; not expected to work for all other implementat
School: Minnesota
Course: Programming 1
#| = LAB 9 = | | Author(s): | Lab Section: | |# ; Utility Functions ; Reloads the current file. (define (reload) (load "lab9.scm") ; Change file name if copied to a new file. ) ; Test Code ; ; Usage: (do-test '(sqrt 9) ; Output: (sqrt 9) => 3 ; ; Please n
School: Minnesota
Course: Programming 1
#| = LAB 8 = | | Author(s): | Lab Section: | |# ; Utility Functions ; Reloads the current file. (define (reload) (load "lab8.scm") ; Change file name if copied to a new file. ) ; Square ( (define (square x) (* x x) ; REMINDER: ; You must include test case
School: Minnesota
Course: Programming 1
; This buffer is for notes you don't want to save, and for Lisp evaluation. ; If you want to create a file, visit that file with C-x C-f, ; then enter the text in that file's own buffer. #| = LAB 7 = | | Author(s): | Lab Section: | |# ; Utility Functions
School: Minnesota
Course: Programming 1
#| = LAB 5 = | | Author(s): | Lab Section: | |# ; Utility Functions ; Reloads the current file. (define (reload) (load "lab5.scm") ; Change file name if copied to a new file. ) ; REMINDER: ; You must include test cases for all procedures you write. ; Thor
School: Minnesota
Course: Programming 1
#| = LAB 4 = | | Author(s): | Lab Section: | |# ; Utility Functions ; Reloads the current file. (define (reload) (load "lab4.scm") ; Change file name if copied to a new file. ) ; REMINDER: ; You must include test cases for all procedures you write. ; Thor
School: Minnesota
CSci 1113 Spring 2009 Lab Midterm 90 Minutes Section 2: Monday 1:25-5:25 In your home directory, create a new directory called midterm and move to that directory using the following commands: cd mkdir midterm cd midterm Do all of your work for the lab mid
School: Minnesota
Course: Software Engineering 1
Syllabus - CSci 5801 Course Name: CSci 5801 Software Engineering I Semester: Fall 2012 Professor: Dr. Mats Heimdahl Lecture Hours: Tuesday and Thursday, 9:45 11:00 Location: ME 108. This syllabus describes the course CSci 5801, Software Engineering I. It
School: Minnesota
Basic of Computer Application 3:00pm-4:30pm M, W, F Classroom B 150 Instructor: Jason Lee Office: B 370 Office Hour: T, Th 10:00-Noon Course Description It is a an introduction to the great ideas of Computer Science; it is designed to help you understand
School: Minnesota
Course: Dvanced Algorithms And Data Structures
Fall 11: CSci 5421Advanced Algorithms and Data Structures Instructor Ravi Janardan Dept. of Computer Science & Engineering University of MinnesotaTwin Cities Minneapolis, MN 55455 Oce: 6217 Keller Hall (EE/CSci Bldg.) Phone: (612)6257338 Email: janardan@c