Online study resources available anywhere, at any time
Highquality Study Documents, expert Tutors and Flashcards
Everything you need to learn more effectively and succeed
CS

We are sorry, there are no listings for the current search parameters.
School: UWO
Course: Applied Logic For Computer Science
UNIVERSITY OF WESTERN ONTARIO Computer Science 209a Applied Logic for Computer Science ASSIGNMENT 10 Solution 1. First, in order to use resolution, we have to transform all the premises and the negation of the conclusion in conjunctive normal form. p1 : P
School: UWO
http:/ksat.me/mapreduceareallysimpleintroductionkloudo/ MapReduce:Areallysimpleintroduction MapReducelibrarydividestheworkandgroupsthevaluesbythekey Example:countthenumberoftimesonecharacterwordsoccur,twocharacters wordsoccur,etc.uptothenumberoftimesten
School: UWO
MapReduce: Simplied Data Processing on Large Clusters Jeffrey Dean and Sanjay Ghemawat jeff@google.com, sanjay@google.com Google, Inc. Abstract MapReduce is a programming model and an associated implementation for processing and generating large data sets
School: UWO
Critical Response to Quest for Quality The article Quest for Quality, written by Mary Hayes Weier, is an overview of why software quality is so important and how quality can be improved. Bugriddled software has a negative impact on the company, leading t
School: UWO
Alanna Harris Enhancing Software Testing by Judicious Use of Code Coverage Information The report, Enhancing Software Testing by Judicious Use of Code Coverage Information, attempts to show that, when introduced properly and used judiciously, code coverag
School: UWO
Alanna Harris Economic Impact of Inadequate Software Testing Infrastructure The report, The Economic Impacts of Inadequate Infrastructure for Software Testing, discusses the inadequacies of software testing infrastructure and uses two case studies to sh
School: UWO
School: UWO
Course: M&C
 EnteringText o o o o  Automaticlinewrapping widthofparagraphdependsonwidthof webbrowserwindow(unlessintableor CSSstylesheets paragraphbreakleavesplankline betweenlines(<p>HTMLtag)Press <ENTER> LineBreaknospacebetweenlines (<br>HTMLtag)press <SHIFT><ENT
School: UWO
Course: M&C
o AlternativeText:captioninbrowser, displaystextassociatedwiththeimage  Maydisplaywhilegraphicloading,or ifusingatextonlybrowser Tomeetbarrierfreeaccess ForFirefox:inserttitle=xxxxx beforealt=xxxxx Links o o Toanotherwebpagewithinyoursitein yourfolderpoi
School: UWO
Course: M&C
DOWNLOADING:processofreceivinga program,documentorfileviaanetworkfrom anothercomputerRemotesite(server) Local computer o o UPLOADING:LocalcomputerRemote site(server) Need4piecesofinformationfromweb host: 1. 2. Password 4.  Username 3.  Hostname(ex:panth
School: UWO
Course: M&C
MULTIMEDIAANDCOMMUNICATION    715secondstomakeagoodfirstimpression, 4minforsomeonetodecidetogobeyondfirst impression MULTIMEDIA:everythingyoucanhearor see;Mediaincludetexts,books,pictures, music,sounds,CDs,videos,DVDs,MP3 players,iPods,recordsfilmsetc
School: UWO
Course: M&C
  RAYTRACING:techniqueofaddinglight andshadowstoa3Dimage Specialeffects o Morphing:processofblendingtogether twoimagesintoaseriesofimages o  Warping:distortsasingleimagewarp frownintosmile VIRTUALREALITY(VR):creates environmentwhereuserbecomespartofthe
School: UWO
Formal Specication and State Machines Introduction to formal specication Statecharts Basic elements ORstates ANDstates Specication techniques Markov chains 1 Introduction to Formal Specication Informal specs can be ambiguous, unclear, erroneous,
School: UWO
Introduction to Testing It was on one of my journeys between the EDSAC room and the punching equipment that hesitating at the angles of stairs the realization came over me with full force that a good part of the remainder of my life was going to be spent
School: UWO
Introduction to Formal Software Verication Denitions, costs and benets, motivations Logical specication Ways of using formal verication 1 Denitions Software verication and validation: making sure that the software is correct Some people dene a distin
School: UWO
Hoare Logic: Loops Intuition Whileloop axiom Loop invariants Examples Heuristics for nding loop invariants 1 While Loops: Intuition Consider factorial code l1 l2 l3 l4 l5 l6 l7 y < 1; i < n; while i > 1 do begin y < y * i; i < i  1; end This
School: UWO
Hoare Logic: StraightLine and Conditional Code Named after C. A. R. (Tony) Hoare (left) Motivations and basic ideas Syntax Proof rules Straightline code Conditional code Strategies for constructing proofs Bottomup Weakest precondition 1 Motiva
School: UWO
Inspections Inspections: the basic idea Two ends of the spectrum Code walkthroughs: simple Fagan inspections: more structured Variations in the spectrum Statistics and ndings Barriers and success factors 1 Inspections: The Basic Idea One individua
School: UWO
Course: Applied Logic For Computer Science
CS2209A 2011Fall Quiz3 Question 1.1 1.Translate the following into quantificational logic (5 marks) a. There is some French that everyone loves [Use Fx, Lxy] (x) (Fx (y) Lyx) Question 1.2 b. The smallest one is either red or blue (5 marks) [Use Sxy for x
School: UWO
Course: Applied Logic For Computer Science
CS2209A 2011Fall Quiz 1 Marking Criterion 50 marks in total 1. Translate following into wffs (10 marks): a. If you are young, then you are strong but inconsiderate. (use Y, S and I)3 (Y (S I) b. You feel hungry if and only if you didnt eat meat. (use F
School: UWO
Course: Applied Logic For Computer Science
Quiz 2 Question1(12/50) Convert the following two wffs into DNF and CNF respectively a. (~A(BC) =(~A(~BC) <CNF =(~A~B) (~AC) <DNF b. (A (B (C (~ A (B ~ C) =(~A (B (~C (~ A (~B ~ C) =(~A B)(~A (~C (~ A (~B ~ C) =(~A B)(~A ~B ~ C) < CNF =(~A(~A~B)(~A~C)(
School: UWO
Course: Artificail Intelligence II
Student ID: Name: CS 442b542b Short Exam 1 Instructions: Show all the work you do. Use the back of the page, if necessary. Calculators are allowed, laptops are not allowed. Problem 1 : Suppose we have a collected the following one dimensional samples fro
School: UWO
Course: Artificail Intelligence II
CS 4442b9542b, Winter 2010 Short Exam 1 Name: Instructions: Show all the work you do. Use the back of the page, if necessary. Calculators are allowed, laptops, cell phones, or any other communication devices are not allowed. This is an open notes/book ex
School: UWO
Course: Artificail Intelligence II
Student ID: Name: CS 442b542b Short Exam 2 Instructions: Show all the work you do. Use the back of the page, if necessary. Calculators are allowed, laptops are not allowed. Problem 1 (20%): The training data consists of the text: I like to play with cats
School: UWO
Course: Applied Logic For Computer Science
UNIVERSITY OF WESTERN ONTARIO Computer Science 209b, Winter 2000 Applied Logic for Computer Science ASSIGNMENT 8  SOLUTIONS Given: Friday, March 24, Due: Monday, April 3, 2000 1. Translation: Premise 1. (x)(F (x) D(x) C(x) Premise 2. (x)(F (x) I(x) C(x)
School: UWO
Course: Applied Logic For Computer Science
UNIVERSITY OF WESTERN ONTARIO Computer Science 209b, Winter 2000 Applied Logic for Computer Science ASSIGNMENT 5  SOLUTIONS Given: Friday, March 3, Due: Monday, March 13, 2000 1. n = xyzw x 0 0 0 0 0 0 0 0 1 1 y 0 0 0 0 1 1 1 1 0 0 z 0 0 1 1 0 0 1 1 0 0
School: UWO
Course: Applied Logic For Computer Science
UNIVERSITY OF WESTERN ONTARIO Computer Science 209b, Winter 2000 Applied Logic for Computer Science ASSIGNMENT 3  SOLUTIONS Given: Friday, February 4, Due: Monday, February 14, 2000 1. a) p (q r) = p (q r) (implication law)  = p (q r) (implication law
School: UWO
Course: Applied Logic For Computer Science
UNIVERSITY OF WESTERN ONTARIO Computer Science 209a, Fall 1999 Applied Logic for Computer Science ASSIGNMENT 1  SOLUTIONS Given: Friday, January 21, Due: Monday, January 31, 2000 1. a) N F b) (G M ) c) O L d) B F e) D W f ) F E, or equivalently F E, E F
School: UWO
Course: Applied Logic For Computer Science
UNIVERSITY OF WESTERN ONTARIO Computer Science 209b, Winter 2000 Applied Logic for Computer Science ASSIGNMENT 2  SOLUTIONS Given: Friday, January 28, Due: Monday, February 7, 2000 1. premise 1: P (G B) premise 2: P F premise 3: B F conclusion: F The arg
School: UWO
Course: Applied Logic For Computer Science
UNIVERSITY OF WESTERN ONTARIO Computer Science 209b, Winter 2000 Applied Logic for Computer Science ASSIGNMENT 4  SOLUTIONS Given: Friday, February 11, Due: Monday, February 28, 2000 1. Translation: Premise 1. P W K G Premise 2. P Premise 3. W Conclusion
School: UWO
School: UWO
Course: Applied Logic For Computer Science
UNIVERSITY OF WESTERN ONTARIO Computer Science 209a Applied Logic for Computer Science ASSIGNMENT 10 Solution 1. First, in order to use resolution, we have to transform all the premises and the negation of the conclusion in conjunctive normal form. p1 : P
School: UWO
http:/ksat.me/mapreduceareallysimpleintroductionkloudo/ MapReduce:Areallysimpleintroduction MapReducelibrarydividestheworkandgroupsthevaluesbythekey Example:countthenumberoftimesonecharacterwordsoccur,twocharacters wordsoccur,etc.uptothenumberoftimesten
School: UWO
MapReduce: Simplied Data Processing on Large Clusters Jeffrey Dean and Sanjay Ghemawat jeff@google.com, sanjay@google.com Google, Inc. Abstract MapReduce is a programming model and an associated implementation for processing and generating large data sets
School: UWO
Critical Response to Quest for Quality The article Quest for Quality, written by Mary Hayes Weier, is an overview of why software quality is so important and how quality can be improved. Bugriddled software has a negative impact on the company, leading t
School: UWO
Alanna Harris Enhancing Software Testing by Judicious Use of Code Coverage Information The report, Enhancing Software Testing by Judicious Use of Code Coverage Information, attempts to show that, when introduced properly and used judiciously, code coverag
School: UWO
Alanna Harris Economic Impact of Inadequate Software Testing Infrastructure The report, The Economic Impacts of Inadequate Infrastructure for Software Testing, discusses the inadequacies of software testing infrastructure and uses two case studies to sh
School: UWO
Alanna Harris TestDriven GUI Development with Abbot and TestNG In the article, TestDriven GUI Development with Abbot and TestNG, the authors introduce two different tools to assist in GUI testing. They show the necessity of these tools by explaining the
School: UWO
Alanna Harris Response Six: When a GUI Regression Test Failed, What Should be Blamed? The article, When a GUI Regression Test Failed, What Should be Blamed? investigates the causes of regression test case failures by studying the failed automatic tests in
School: UWO
Alanna Harris Case Study: How Analysis of Customer Found Defects Can be Used by System Test to Improve Quality This article was a case study regarding the analysis of customer found defects of a large telecommunications system, referred to as Z, to improv
School: UWO
Practical Approach for QualityDriven Inspections This article, written by Christian Denger and Forrest Shull, discusses their customizable inspection process, called TAQtIC (Tailoring Approach for QualityDriven Inspections), and how it solves previous i
School: UWO
MapReduce: A Review 1 Introduction InthearticleMapReduce:SimplifiedDataProcessingonLargeClusters,JeffreyDeanand SanjayGhemawatpresentanoverviewoftheGoogleMapReduce[3]programmingmodel forprocessingandgeneratingenormoussetsofdata.Theauthorsgiveabriefoutline
School: UWO
1 Introduction InthearticleMapReduce:SimplifiedDataProcessingonLargeClusters,JeffreyDeanand SanjayGhemawatpresentanoverviewoftheGoogleMapReduce[3]programmingmodel forprocessingandgeneratingenormoussetsofdata.Theauthorsgiveabriefoutlineofthe programmingmod
School: UWO
Course: Data Structures And Algorithms
CS2210b: Data Structures and Algorithms Winter 2014: Assignment 3(concept) Solutions 1. Consider the algorithm AddSomething (A, n) : Algorithm AddSomething(A,n) Input: Array A and integer n. A has size at least n if n < 1 return 0 else temp 3 A[n 1] + Add
School: UWO
Course: Applied Logic For Computer Science
UNIVERSITY OF WESTERN ONTARIO Computer Science 209a Applied Logic for Computer Science ASSIGNMENT 9 Solution 1. 1.x(C (x) W (x) 2.W (t) C (t) 1. x(C (x) W (x) () 2. C (t) W (t) (1, ) 3. W (t) () 4. W (t) C (t) (2, contrapositive) 5. C (t) (3, 4, ) where c
School: UWO
Course: Applied Logic For Computer Science
UNIVERSITY OF WESTERN ONTARIO Computer Science 209a Applied Logic for Computer Science ASSIGNMENT 8 Solution 1a. a) i) D=cfw_a P(x) Q(x) R(x) a 1 1 0 This interpretation makes the formula true. ii) D=cfw_a P(x) Q(x) R(x) a 1 1 1 This interpretation makes
School: UWO
Course: Applied Logic For Computer Science
UNIVERSITY OF WESTERN ONTARIO Computer Science 209a Applied Logic for Computer Science ASSIGNMENT 6 Solution 1a. PQ PQ R PQ PQ # 1 1 1 1 "! R The simplied form is: PQ PR PQ 1b. # R R PQ PQ # PQ 1 1 "! "! # 1 1 "! The simplied form is: P QR P Q R P QR P QR
School: UWO
Course: Applied Logic For Computer Science
UNIVERSITY OF WESTERN ONTARIO Computer Science 209a Applied Logic for Computer Science ASSIGNMENT 7 Solution 1. a) x(L(x) E (x) b) x(L(x) E (x) C (x) c) x[L(x) C (x) E (x)] d) x[(E (x) C (x) L(x)] e) x[L(x) E (x)] 2. a) x(E (x) C (a, x) b) xyC (y, x) c) x
School: UWO
Course: Applied Logic For Computer Science
Western University Computer Science Department CS 2209A: Applied Logic for Computer Science Fall 2012 Assignment 1 Solutions 1. (5 points) Prove by mathematical induction that (34n 1) is divisible by 80. Answer (a) For n=1. (34 1) = 80. (b) Assume that fo
School: UWO
Course: Data Structures And Algorithms
CS2210b: Data Structures and Algorithms Winter 2014: Assignment 1 (concept) Due: January 20 Solutions 1. (10%) Use the denition of bigO to prove that 12n5 + 0.5n4 log(n) is O(n5 ). Solution: 12n5 + 0.5n4 log(n) 12n5 + 0.5n5 n 2. Therefore 12n5 + 0.5n4 1
School: UWO
This article is about the application of the formal B method to the safety critical software for the Meteor line, the first driverless metro in Paris. Beginning with the development process, there is the modelisation phase, transformation from software re
School: UWO
Alanna Harris Critical Response: Formal Methods in SafetyCritical Railway Systems This article describes two situations in which the formal B method was applied. In both cases, the method was used introduce platform screen doors(PSD) on railway tracks in
School: UWO
Course: Data Structures And Algorithms
CS2210 Data Structures and Algorithms Lecture 5: Hash Tables Instructor: Olga Veksler 0 1 2 3 4 2004Goodrich,Tamassia 0256120001 9811010002 4512290004 Outline HashTables Motivation Hashfunctions Collisionhandling SeparateChaining(openaddressing) Li
School: UWO
Course: Data Structures And Algorithms
CS2210 DataStructuresandAlgorithms Lecture6:Trees MakeMoneyFast! Stock Fraud Ponzi Scheme Bank Robbery Instructor:OlgaVeksler 2004Goodrich,Tamassia Outline TreeasanADT TerminologyonTrees SpecialcaseofTrees: Binarytrees BasicPropertiesofBinaryTrees TreeTr
School: UWO
Course: Data Structures And Algorithms
CS2210 Data Structures and Algorithms Lecture 8: Binary Search Trees < 2 1 6 9 > 4= Instructor: Olga Veksler 8 Outline Return to the ordered dictionary ADT will spend the next 23 weeks on several different ways of implementing an ordered dictionary ADT O
School: UWO
Course: Data Structures And Algorithms
CS2210 Data Structures and Algorithms Lecture 9: AVL TREES definition, properties, insertion 6 v 8 3 z 4 BST Performance For a binary search tree with n nodes and of height h methods find, insert and remove take O(h) time Height h is O(n) in the worst cas
School: UWO
Course: Data Structures And Algorithms
CS2210 Data Structures and Algorithms Lecture10: AVLTREESdeletion 6 v 8 3 z 4 ReviewofRemovalinBinarySearchTrees RemovalinAVLtreebegins asinbinarysearchtree Example:remove3 Case2:keyk toberemoved isstoredatanodev whose childrenarebothinternal findinter
School: UWO
CS2210 Data Structures and Algorithms Lecture 2: Analysis of Algorithms Asymptotic notation Instructor: Olga Veksler 2004 Goodrich, Tamassia Outline Comparing algorithms Pseudocode Theoretical Analysis of Running time Primitive Operations Counting primit
School: UWO
CS2210 Data Structures and Algorithms Lecture 3: ADTs and Javas interfaces Instructor: Olga Veksler 2004 Goodrich, Tamassia Outline DataStructures AbstractDataTypes 2PrinciplesofOOProgrammingfrequently usedforimplementingADT encapsulation(informationhidi
School: UWO
CS2210 Data Structures and Algorithms Lecture 4: Dictionaries Instructor: Olga Veksler 2004 Goodrich, Tamassia Outline Dictionaries BinarySearch Recurrenceequations 2 DictionaryADT ThedictionaryADTmodelsasearchablecollectionof keyvalue pairs(k,v),callede
School: UWO
CS2210 Data Structures and Algorithms Lecture 5: Hash Tables Instructor: Olga Veksler 0 1 2 3 4 2004Goodrich,Tamassia 0256120001 9811010002 4512290004 Outline HashTables Motivation Hashfunctions Collisionhandling SeparateChaining(openaddressing) Li
School: UWO
Course: Data Structures And Algorithms
CS2210 Data Structures and Algorithms Lecture 4: Dictionaries Instructor: Olga Veksler 2004 Goodrich, Tamassia Outline Dictionaries BinarySearch Recurrenceequations 2 DictionaryADT ThedictionaryADTmodelsasearchablecollectionof keyvalue pairs(k,v),callede
School: UWO
Course: Data Structures And Algorithms
CS2210 Data Structures and Algorithms Lecture 3: ADTs and Javas interfaces Instructor: Olga Veksler 2004 Goodrich, Tamassia Outline DataStructures AbstractDataTypes 2PrinciplesofOOProgrammingfrequently usedforimplementingADT encapsulation(informationhidi
School: UWO
Course: Data Structures And Algorithms
CS2210 Data Structures and Algorithms Lecture 2: Analysis of Algorithms Asymptotic notation Instructor: Olga Veksler 2004 Goodrich, Tamassia Outline Comparing algorithms Pseudocode Theoretical Analysis of Running time Primitive Operations Counting primit
School: UWO
Course: Applied Logic For Computer Science
UNIVERSITY OF WESTERN ONTARIO Computer Science 209b, Winter 2000 Applied Logic for Computer Science ASSIGNMENT 7  SOLUTIONS Given: Friday, March 17, Due: Monday, March 27, 2000 1. a) (i) U = set of all cities in the world A(x) = x is a city in North Amer
School: UWO
Course: Applied Logic For Computer Science
UNIVERSITY OF WESTERN ONTARIO Computer Science 209b, Winter 2000 Applied Logic for Computer Science ASSIGNMENT 6  SOLUTIONS Given: Friday, March 10, Due: Monday, March 20, 2000 1. (P Q R) (P Q R) (R Q) t0 000, 001, 010, 011, 100, 101, 110, 111 t1 100, 10
School: UWO
Course: Applied Logic For Computer Science
UNIVERSITY OF WESTERN ONTARIO Computer Science 209b, Winter 2000 Applied Logic for Computer Science ASSIGNMENT 4  SOLUTIONS Given: Friday, February 11, Due: Monday, February 28, 2000 1. Translation: Premise 1. P W K G Premise 2. P Premise 3. W Conclusion
School: UWO
Course: Applied Logic For Computer Science
UNIVERSITY OF WESTERN ONTARIO Computer Science 209b, Winter 2000 Applied Logic for Computer Science ASSIGNMENT 2  SOLUTIONS Given: Friday, January 28, Due: Monday, February 7, 2000 1. premise 1: P (G B) premise 2: P F premise 3: B F conclusion: F The arg
School: UWO
Course: Applied Logic For Computer Science
UNIVERSITY OF WESTERN ONTARIO Computer Science 209a, Fall 1999 Applied Logic for Computer Science ASSIGNMENT 1  SOLUTIONS Given: Friday, January 21, Due: Monday, January 31, 2000 1. a) N F b) (G M ) c) O L d) B F e) D W f ) F E, or equivalently F E, E F
School: UWO
Course: Applied Logic For Computer Science
UNIVERSITY OF WESTERN ONTARIO Computer Science 209b, Winter 2000 Applied Logic for Computer Science ASSIGNMENT 3  SOLUTIONS Given: Friday, February 4, Due: Monday, February 14, 2000 1. a) p (q r) = p (q r) (implication law)  = p (q r) (implication law
School: UWO
Course: Applied Logic For Computer Science
UNIVERSITY OF WESTERN ONTARIO Computer Science 209b, Winter 2000 Applied Logic for Computer Science ASSIGNMENT 5  SOLUTIONS Given: Friday, March 3, Due: Monday, March 13, 2000 1. n = xyzw x 0 0 0 0 0 0 0 0 1 1 y 0 0 0 0 1 1 1 1 0 0 z 0 0 1 1 0 0 1 1 0 0
School: UWO
Course: Applied Logic For Computer Science
UNIVERSITY OF WESTERN ONTARIO Computer Science 209b, Winter 2000 Applied Logic for Computer Science ASSIGNMENT 8  SOLUTIONS Given: Friday, March 24, Due: Monday, April 3, 2000 1. Translation: Premise 1. (x)(F (x) D(x) C(x) Premise 2. (x)(F (x) I(x) C(x)
School: UWO
Course: Data Structures And Algorithms
CS2210 Data Structures and Algorithms Lecture 1: Course Overview Instructor: Olga Veksler 2004 Goodrich, Tamassia What is this course about? We will study moderately complex data structures and algorithms that are essential in core areas of computer scie
School: UWO
CS2210 Data Structures and Algorithms Lecture7:PriorityQueuesandHeaps Instructor: Olga Veksler Outline PriorityqueueADT 2SimpleListbasedimplementationforPriority Queue HeapDatastructure notasefficientaspossible Firstmoderatelycomplexdatastructurethatyouha
School: UWO
Course: Computer Science Fundamentals I
CS026a Final Examination December 19, 2006 Page 1 of 20 THE UNIVERSITY OF WESTERN ONTARIO LONDON CANADA COMPUTER SCIENCE 026a FINAL EXAMINATION DECEMBER 19, 2006 3 HOURS NAME: _ STUDENT NUMBER: _ Question 120. _ 2140. _ 41. _ 42. _ 43. _ 44. _ 45. _ 46.
School: UWO
Course: Computer Science Fundamentals II
The University of Western Ontario Department of Computer Science Computer Science 1027b Midterm Exam Master March 10, 2012 2 hours Print your name:_ Student number: _ Instructions: Fill in your name and student number above immediately. Answer all the que
School: UWO
Course: Computer Science Fundamentals II
Western University Department of Computer Science Computer Science 1027b Midterm Exam 2 hours PRINT YOUR NAME: PRINT YOUR STUDENT NUMBER: DO NOT TURN THIS PAGE UNTIL INSTRUCTED TO DO SO! Instructions Fill in your name and student number above immediately
School: UWO
Course: Computer Science Fundamentals II (C++)
Computer Science 1037a Final Examination SAMPLE 1 3 hours Student Number: SOLUTION Surname: Given name: Instructions/Notes: The examination has 14 pages and a total of 100 marks, and consists of two parts. Part 1 is Multiple Choice and True/False, and con
School: UWO
Course: Computer Science Fundamentals II (C++)
Computer Science 1037a Final Examination SAMPLE 2 3 hours Student Number: Surname: Given name: Instructions/Notes: The examination has 14 pages and a total of 100 marks, and consists of two parts. Part 1 is Multiple Choice and True/False, and consists of
School: UWO
Course: Computer Science Fundamentals II (C++)
Computer Science 1037a Final Examination SAMPLE 2 3 hours Student Number: SOLUTION Surname: Given name: Instructions/Notes: The examination has 14 pages and a total of 100 marks, and consists of two parts. Part 1 is Multiple Choice and True/False, and con
School: UWO
Course: Computer Science Fundamentals II (C++)
Computer Science 1037a Final Examination SAMPLE 1 3 hours Student Number: Surname: Given name: Instructions/Notes: The examination has 14 pages and a total of 100 marks, and consists of two parts. Part 1 is Multiple Choice and True/False, and consists of
School: UWO
Course: Databases II
1 1. (30 marks) For each of the following, state whether the statement is true or false. If it is false, correct the statement without changing the underlined text. If the statement is true, do not write anything more, just indicate true. (a) A database b
School: UWO
Course: Databases II
1 Name: Student ID: Department of Computer Science Final Exam, CS 4411a Databases II Prof. S. Osborn April 22, 2010 3 Hours No aids. No electronic aids Answer all questions on the exam page This paper contains 19 pages; the last page is for rough work. Qu
School: UWO
Course: Databases II
Name: 1 1. (20 marks) Terminology: For each of the following statements, state whether it is true or false. If it is false, correct the statement without changing the underlined text. (Note: there might be more than one correction to make!) (a) SQL is an
School: UWO
Course: Data Structures And Algorithms
CS2210a: Data Structures and Algorithms Winter 2013: Midterm Examination Solutions 110 minutes Instructions: Write your name in the space provided. Please check that your exam is complete. It should have 13 pages in total The examination has a total of
School: UWO
Course: Data Structures And Algorithms
Part 1: Multiple Choice Enter your answers on the Scantron sheet. We will not mark answers that have been entered on this sheet. Each multiple choice question is worth 3.5 marks. 1. Two algorithms, A and B , have time complexities fA (n) and fB (n), respe
School: UWO
Course: Data Structures And Algorithms
Part 1: Multiple Choice Enter your answers on the Scantron sheet. We will not mark answers that have been entered on this sheet. Each multiple choice question is worth 2.5 marks. In all the questions below, log(x) means log2 (x). You might nd this fact us
School: UWO
Course: Computer Science Fundamentals I
27 Computer Science 026a Final Exam Fall 2007 Sample Questions with Solutions Part 1: Sample Multiple Choice Questions You may assume that there are no syntax errors intended in any of the code provided in the questions of Part 1, unless the question spec
School: UWO
School: UWO
Course: M&C
 EnteringText o o o o  Automaticlinewrapping widthofparagraphdependsonwidthof webbrowserwindow(unlessintableor CSSstylesheets paragraphbreakleavesplankline betweenlines(<p>HTMLtag)Press <ENTER> LineBreaknospacebetweenlines (<br>HTMLtag)press <SHIFT><ENT
School: UWO
Course: M&C
o AlternativeText:captioninbrowser, displaystextassociatedwiththeimage  Maydisplaywhilegraphicloading,or ifusingatextonlybrowser Tomeetbarrierfreeaccess ForFirefox:inserttitle=xxxxx beforealt=xxxxx Links o o Toanotherwebpagewithinyoursitein yourfolderpoi
School: UWO
Course: M&C
DOWNLOADING:processofreceivinga program,documentorfileviaanetworkfrom anothercomputerRemotesite(server) Local computer o o UPLOADING:LocalcomputerRemote site(server) Need4piecesofinformationfromweb host: 1. 2. Password 4.  Username 3.  Hostname(ex:panth
School: UWO
Course: M&C
MULTIMEDIAANDCOMMUNICATION    715secondstomakeagoodfirstimpression, 4minforsomeonetodecidetogobeyondfirst impression MULTIMEDIA:everythingyoucanhearor see;Mediaincludetexts,books,pictures, music,sounds,CDs,videos,DVDs,MP3 players,iPods,recordsfilmsetc
School: UWO
Course: M&C
  RAYTRACING:techniqueofaddinglight andshadowstoa3Dimage Specialeffects o Morphing:processofblendingtogether twoimagesintoaseriesofimages o  Warping:distortsasingleimagewarp frownintosmile VIRTUALREALITY(VR):creates environmentwhereuserbecomespartofthe
School: UWO
Course: M&C
 WEBHOSTING:theSERVICEthatprovides internetuserswithonlinesystemsforstoring information,images,video,oranycontent accessibleviatheweb o o WEBHOSTS:(ISPs)COMPANIESthat providespaceonaservertheyownforuse bytheirclientsaswellasproviding internetconnectivity
School: UWO
Course: M&C
HistoryofSearchingtheNet  1990:ThefirsttoolforsearchingtheInternet wascalledArchie(shortforarchives) o o o o  Originalimplementationwrittenin1990 byAlanEmtage,BillHeelan,andPeterJ. DeutschatMcGill DesignedtoindexFTParchives,allowing peopletofindspecific
School: UWO
Course: M&C
ANIMATION:adrawingthatmoves,bringingthe drawingtolife    Relyonmovingimagesforeffective communication Usedfor:entertainment(action,realism), Education(visualization,demonstration) Whyuseanimation? o o Visualize3Dobjects o  Illustratechangeovertime o 
School: UWO
Course: M&C
 VideoCaptureDevice o o 1. AnalogCamcorder:NeedVIDEO CAPTURECARD DigitalCamcorder:FIREWIRE connection SOURCEDEVICE: o o CAMCORDER(cameraRecorder): deviceforrecordingvideoimagesand audioontoastoragedevice.Tousevideo inamultimediaapplication,itmustbein dig
School: UWO
Course: M&C
VIDEO    VideousesthepowerofMOTIONand SOUND ANALOGVIDEO:smoothelectronicwaves (ex:ConventionalTV) DIGITALVIDEO:convertsintodigital media(0sand1s)benefitofdeliveringon internet o o o o Composedofaseriesofbitmapgraphics, eachonecalledaframe Motioninavide
School: UWO
Course: M&C
  SPIDER/WEBCRAWLER:websoftware thatconstantlysearchesfornewwebpages andfollowsanylinks DATABASE:addresses,pagetitles, significantwords,topics o  METASEARCH ENGINGE/METACRAWLER:internet searchenginewhichsearchesothersearch engines o   searchenginesac
School: UWO
Course: M&C
  Sourcesofanimationlotsoffreesoftware onlinetocreateGIFanimations Otheranimationfiletypes: o AnimatedGIFS(.gif)(universal) o Flash(.fla,.swf)(byAdobe) o MacromediaDirector o  SophisticatedAnimations:strata3D, Lightwave,3dstudioMax,Maya,Houdini Animati
School: UWO
Course: Multimedia And Communication
 Processofcreatingstreamingfiles:(USED REALPRODUCER) o o o o Locateandpreparesourcematerials/media content Digitizeandthencompressfileswitha streamingformat FTPstreamingfilestostreamingserver Linkfromawebpagetothestreaming media/embedfileonawebpage   
School: UWO
Course: Multimedia And Communication
o Twotypesofcompression:losslessvs. lossy LOSSLESS COMPRESSION(no lossofdata) LOSSY COMPRESSION(loss ofdata) Squeezesdatainto smallerspacewithout eliminatinginformation discardsrepetitiveor redundantdata;may notbenoticeabletothe 100%ofdatastillthere, eye
School: UWO
Course: Multimedia And Communication
 Qualityofdigitalrecordingdependson: 1. SAMPLERATE:rateatwhich samplesarecaptured,numberof times/secthatthewaveformis measured 2. 3. 1000samplespersecond= 1KHZ(1000HZ)* 8KHZvoiceonly,22KHZmusic files,44.1KHZusedonCD *lowerratefilesmallersince missingsoun
School: UWO
Course: Multimedia And Communication
 Howissoundrecorded o o o MICROPHONEtranslatesmovement intoelectricalsignals(analog)thentape recordertranslatesthewaveformfroman electricalsignalonawiretoamagnetic signalonatape(analog) Analogtodigitalconverter(ADC): ADCcapturesasnapshotoftheelectric vol
School: UWO
Course: Multimedia And Communication
VideoTransferfortheWeb HTTP:Hypertext TransferProtocol RTSP:RealTime StreamingProtocol Downloadthevideo fromthehost(server)to theuserscomputerin itsentiretythenplaythe clip Playeddirectlyfromthe severtotheusers computerinaprocess calledSTREAMING Usermustw
School: UWO
Course: Multimedia And Communication
 PROCESS o Oncedigitizedsoundisinthecomputer o Soundeditingsoftware 1. 2. 3. o  Fadeins,fadeouts,background music,specialeffects Severalfoundfilescanbemixedor splicedtogether Savethefileinaformatintendedforthe audienceapplication DELIVER:toheadthroughsp
School: UWO
Course: Multimedia And Communication
 FirewirevsUSB o Firewire400byApple:wantedtocharge permachineused,soPCusedUSB1.1 instead  o    PeertoPeertechnology(canchain onecamcordertoanotherwithouta computer) USB1.1couldtransmitat12MBps  o Transmittedoriginallyat400Mbps Usedformice,keyboards,
School: UWO
Course: Multimedia And Communication
 EditingDigitalvideo o o o o Transfervideosinaseriesofshortclips (12min) Somesoftwareautomaticallydetects framechanges LINEAREDITING:beforedigital camcordersconsistedofrecording segmentsfromonevideotapetoanother tapecantjumparound NONLINEAREDITING:(now)
School: UWO
Course: Multimedia And Communication
WEBSITES  Whybuildawebsite o o o   Reachpotentialcustomers Detailsonservices/productsproviding testimonials Windowshopping Canadianspurchased$40billiononline,28 hoursonlineeachmonth,1/373web pages/CANhousehold Websearchesworldwide=5.7billionperday EBAY
School: UWO
Course: Multimedia And Communication
SERVERSANDUPLOADING    Uptime:howlongdoesserverstayup Upload:transferfilestoserversotheycanbe displayedontheweb Advantagesofaserver: 1) 2) 3)  Alwaysavailable:websitealways availablesincealwayson Takencareof:securityandmaintenance bypeople Panther:nam
School: UWO
Course: Multimedia And Communication
Compressiontechniques:  GIFsLOSSLESScompressionno discardofdata o o o  Doesnotgetblurryormess UsessimpletechniquecalledLZW compressiontoreducefilessizesof imagesbyfindingrepeatedpatternsof pixels Neverdegradesimagequality JPGsLOSSYcompressiondiscards da
School: UWO
Course: Multimedia And Communication
 URL:UniformResourceLocatoranAddress ofawebdocumentonacomputer o Everywebpageisreferredtobyaunique URL http:/www.uwo.ca/its/courses/spring.html 1) 2) 3) 4)  HypertextTransferProtocol:rulesthat definehowdataisexchangedbetweenservers andbrowsers WorldWide
School: UWO
Course: Multimedia And Communication
GRAPHICS    WerelyonimagesforInformation, explanations,entertainment Graphicsoriginatefrom:nondigitalmedium (papercopyofaphoto),outsideworld,create image DIGITIZATION:theprocessoftranslatinga pieceofinformation(text,images,sound recording,video)intoBIN
School: UWO
Course: Multimedia And Communication
 Colorresolution o GIFcontrol:colorresolution(numberof colors)support8bitcolor256,128,64, 32,16,8bytes   Bychangingthecolorresolution(bit depth)canlowerdownloadtime BMPfilesnocompression,stores informationabouteachpixel,eachpixelis1 byte GIFfilesdivide
School: UWO
Course: Multimedia And Communication
 TextsizePixelsvs.Points PIXEL(.ppiakadpi) POINTS(.dpi) unitofmeasureformonitor unitofmeasureforprinter resolution(px) resolution(pt) WEB WORD #ofpixelsperinchof monitordisplay #ofdotsperinch adisplaysettingof: 1280x1024has1.3million DPI,800x600has480,00
School: UWO
Course: Multimedia And Communication
HYPERLINKING o o INDEXallowsforjumpingaround sections VsSequential:startatbeginningand movetotheend(books,movies,videos)  ComputerBasedDelivery o o  HTMLhasfeaturesthatallowsyouto buildhyperlinkstootherwebpagesor locationonthesamepage Computerbasedmulti
School: UWO
Course: Multimedia And Communication
MultimediaHistory        15001300BC:prehistorichumanspaint imagesonthewallsoftheircaves(Grottede Lascaux,France 1914:silentmoviesincorporatedmultiple mediabeusingfilmandtextcaptionstogether 1928:WaltDisneydebutsthesecondshort starringamousenamedMic
School: UWO
Original article Marital satisfaction and mental health status in patients with breast cancer 1 2 3 4 Fariborz Mokarian Rajabi , Sayed Reza Ishaghi , Parnian Tabesh , Mohammad Arash Ramezani , Valiollah Mehrzad5, Neda Motamedi2 1 Professor, Department of
School: UWO
Chapter 12 Managing Information Security and Privacy WHAT ARE THE SOURCES AND TYPES OF SECURITY THREATS 3 sources of security threats are: o Human error and mistakes include accidental problems caused by both employees and nonemployees. Ex: an employee w
School: UWO
Chapter 11 IT Projects and Acquiring Information Systems HOW CAN INFORMATION SYSTEMS BE ACQUIRED The 4 basic methods for acquiring software applications are: 1. Buy it and use it 2. Buy it and customize it 3. Rent or lease it 4. Build it yourself All meth
School: UWO
Chapter 8 Decision Making and Business Intelligence WHAT ARE THE CHALLENGES MANAGERS FACE IN MAKING DECISIONS Russel Ackoff wrote an article titled Management Misinformation Systems. The articles suggested several erroneous assumptions about information s
School: UWO
Chapter 9 Information Systems Strategy, Governance, and Ethics RELATIONSHIP BETWEEN ORG. STRATEGY AND I.T. PLANNING Managing information systems requires an understanding of both organizational strategy and the technological architecture underlying them.
School: UWO
Chapter 7 Information Systems for Competitive Advantage WHAT ARE THE FUNDAMENTAL TYPES OF I.S. WITHIN ORGANIZATIONS I.S. have 3 systems that have evolved over time: CALCULATION SYSTEMS The very first I.S., calculation systems are calculating machines that
School: UWO
ComputerScience1032Chapter4 WhyDoYouNeedtoKnowAboutInformationTechnology? historyofITisrecent firstdigitalcomputingdeviceswereinventedin1940 EarlyComputers ElectronicNumericalIntegratorandComputer(ENIAC)firstreprogrammable generalpurposecomputer Large,c
School: UWO
Chapter 4 Hardware and Software WHERE DID ALL THIS INFO TECHNOLOGY COME FROM The first digital computing devices were invented in the 1940s. The first commercial computers were available in the 1950s, the first personal computers in the early 1980s, and t
School: UWO
Chapter 6 Networks and Communications Technology WHY SHOULD I CARE ABOUT NETWORKS The Global positioning system (GPS) uses a collection of dozens of satellites orbiting the earth that transmit precise microwave signals. A GPS receiver can calculate its po
School: UWO
School: UWO
Set9,Part2 timestampordering, distributedCCandOOCC CS4411/9538 Set9,Part2,ConcurrencyControl 1 Outlineofnotes Set1:Introduction Set2:Architecture CentralizedRelational DistributedDBMS ObjectOrientedDBMS Set3:DatabaseDesign CentralizedRelational Distribute
School: UWO
School: UWO
Set 11, Part 2 RBAC and Other Topics Sylvia Osborn CS4411/9538 Database Security Part 2 1 Outline of notes Set 1: Introduction Set 2: Architecture ObjectOriented DBMS Distributed DBMS Centralized Relational Centralized Relational Distributed DBMS Set 4
School: UWO
Set7 AlgebraicQueryOptimization SylviaOsborn CS4411/9538 Set7,AlgebraicQueryOptimization 1 Outlineofnotes Set1:Introduction Set2:Architecture CentralizedRelational DistributedDBMS ObjectOrientedDBMS CentralizedRelational DistributedDBMS Set4:ObjectOriente
School: UWO
School: UWO
Set8,part3 SomeXMLdatabaseimplementation issues CS4411/9538 Set 8, Part 3, XML implementation issues 1 Outlineofnotes CentralizedRelational DistributedDBMS ObjectOrientedDBMS Set3:DatabaseDesign Set1:Introduction Set2:Architecture CentralizedRelational Di
School: UWO
Set 2 DatabaseArchitecture CS4411/9538 Set 2, Database Architecture 1 Outlineofnotes Set1:Introduction Set2:Architecture CentralizedRelational DistributedDBMS ObjectOrientedDBMS XMLDatabases Set3:DatabaseDesign CentralizedRelational DistributedDBMS Set4:D
School: UWO
Set8 Storage,Indexing,andExecutionStrategies (part2isaboutcosts, part3containsXMLstorageandtechniques) SylviaOsborn CS4411/9538 Set8,Storage,Indexing,Execution 1 Outlineofnotes Set1:Introduction Set2:Architecture CentralizedRelational DistributedDBMS Obje
School: UWO
Set8,part2,Costs (and OOImplementationIssues) SylviaOsborn CS4411/9538 Set 8, Part2, Costs and OO implementation issues 1 Outlineofnotes Set1:Introduction Set2:Architecture Set8:Storage,Indexing,and ExecutionStrategies Set8,Part2:Costs andsomeOOImplementa
School: UWO
IntroductiontoXMLDatabases SylviaOsborn CS4411/9538 Intro to XML 1 Outlineofnotes Set1:Introduction Set2:Architecture ExecutionStrategies CentralizedRelational DistributedDBMS ObjectOrientedDBMS Set3:DatabaseDesign CentralizedRelational DistributedDB
School: UWO
AreXMLDatabases, Databases? datamodel:schemascanbedefinedusingDTDsorXMLSchema languages:haveXPathandXQuery.ThereisalsonowanXQueryUpdate language. persistence:documentsexistinfilesonwebsitesorinrelational databases.AlsoarenativeXMLDBpackages.Persistenceno
School: UWO
Set5 OODatabaseQuery Languages (issuesandsomeOQLspecifics) SylviaOsborn CS4411/9538 Set5,OODBQueryLanguages 1 Outlineofnotes Set1:Introduction Set2:Architecture CentralizedRelational DistributedDBMS ObjectOrientedDBMS CentralizedRelational DistributedDBMS
School: UWO
Set4:DataModeling Issues SylviaOsborn CS4411/9538 Set4:DataModellingIssues 1 Outlineofnotes Set1:Introduction Set2:Architecture CentralizedRelational DistributedDBMS ObjectOrientedDBMS XMLDatabases Set3:DatabaseDesign CentralizedRelational DistributedDBMS
School: UWO
Set 2 Database Architecture CS4411/9538 Set 2, Database Architecture 1 Outline of notes n n Set 1: Introduction Set 2: Architecture q q q q n q n n n n Centralized Relational Distributed DBMS ObjectOriented DBMS XML Databases n Set 3: Database
School: UWO
Introduction to XML Databases Sylvia Osborn CS4411/9538 Intro to XML 1 Outline of notes Set 1: Introduction Set 2: Architecture Set 8: Storage, Indexing, and Execution Strategies Set 8, Part 2: Costs Set 8, Part 3: XML Implementation Issues Set 9:
School: UWO
Set 3 DistributedDatabaseDesign Set 3: Distributed Database Design 1 Outlineofnotes Set1:Introduction Set2:Architecture CentralizedRelational DistributedDBMS ObjectOrientedDBMS XMLDatabases Set3:DatabaseDesign CentralizedRelational DistributedDBMS Set4:Da
School: UWO
Set 1  Introduction CS4411b/9538b Sylvia Osborn CS4411 Set1,Introduction 1 HistoryofDatabaseManagement 1950s EarlyProgrammingSystems,Cobol 1960s Packagesforsorting,reportgeneration,fileupdate,IDS, commondataamongprograms,onlinequery 1970s RelationalModel
School: UWO
Course: Multimedia And Communications
CS 1033 What we need: Infinite scrolling copying syntax how to google, avoid www.w3schools.com Database popup preview backgrounds layout circle border Bootstrap code: USE CAROUSEL Sidebar (Filterbar) Stylesheet: Javascript: makes webpages mov
School: UWO
Course: Multimedia And Communications
CS 1033 Multimedia and Communications Lab 01: Learning how to transfer files between your Computer and a Server  File Transfer and Website Publishing REMEMBER TO BRING YOUR MEMORY STICK TO EVERY LAB! 1 INTRODUCTION TO THE COMPUTING ENVIRONMENT: You will
School: UWO
Course: Multimedia And Communications
CS 1033 Multimedia and Communications Lab 04: Introduction to Dreamweaver (Website Design part 1 of 3) REMEMBER TO BRING YOUR MEMORY STICK TO EVERY LAB! Dreamweaver Layout Reference Sheet Use this picture as a Dreamweaver layout reference sheet as you wor
School: UWO
Formal Specication and State Machines Introduction to formal specication Statecharts Basic elements ORstates ANDstates Specication techniques Markov chains 1 Introduction to Formal Specication Informal specs can be ambiguous, unclear, erroneous,
School: UWO
Introduction to Testing It was on one of my journeys between the EDSAC room and the punching equipment that hesitating at the angles of stairs the realization came over me with full force that a good part of the remainder of my life was going to be spent
School: UWO
Introduction to Formal Software Verication Denitions, costs and benets, motivations Logical specication Ways of using formal verication 1 Denitions Software verication and validation: making sure that the software is correct Some people dene a distin
School: UWO
Hoare Logic: Loops Intuition Whileloop axiom Loop invariants Examples Heuristics for nding loop invariants 1 While Loops: Intuition Consider factorial code l1 l2 l3 l4 l5 l6 l7 y < 1; i < n; while i > 1 do begin y < y * i; i < i  1; end This
School: UWO
Hoare Logic: StraightLine and Conditional Code Named after C. A. R. (Tony) Hoare (left) Motivations and basic ideas Syntax Proof rules Straightline code Conditional code Strategies for constructing proofs Bottomup Weakest precondition 1 Motiva
School: UWO
Inspections Inspections: the basic idea Two ends of the spectrum Code walkthroughs: simple Fagan inspections: more structured Variations in the spectrum Statistics and ndings Barriers and success factors 1 Inspections: The Basic Idea One individua
School: UWO
Testing: The Big Picture Initial levels of testing Unit testing Integration testing Systemlevel testing activities and phases Test automation Dealing with defects Bug tracking systems Defect classication Stopping criteria and test plans 1 Overvi
School: UWO
Structural Testing: Coverage Criteria Structural testing overview while (p!=null) cfw_ if (p>n=y) cfw_ return p; p = p>next; . Some weak controlowbased criteria Interlude 1: Denitions Some stronger controlowbased criteria Interlude 2: Observati
School: UWO
Testing Tools gcov: GNU coverage tool for C/C+ Extended example How does gcov do it? Cobertura: opensource coverage tool for Java JUnit Use of tools TestDriven Development (TDD) using JUnit Abbot GUI testing framework 1 gcov: A Simple Structural
School: UWO
Functional Testing: Applications of Principles Applications of general functional testing principles to: Applications with GUIs Syntax testing Interaction test suite design In common with all functional (blackbox) testing: Focus on requirements Me
School: UWO
CS 4472: Software Quality Assurance 1 Course Introduction: Computer Science 4472a Course name: Specication, Testing and Quality Assurance Instructor: Jamie Andrews Ofce: MC 365 Email: andrews@csd.uwo.ca Prerequisite: CS 307/3307 or equivalent Texts
School: UWO
CS2210 Data Structures and Algorithms Lecture 1: Course Overview Instructor: Olga Veksler 2004 Goodrich, Tamassia What is this course about? We will study moderately complex data structures and algorithms that are essential in core areas of computer scie
School: UWO
CS2210 Data Structures and Algorithms Lecture 16 : Directed Graphs BOS ORD JFK SFO DFW LAX MIA Outline Directed Graphs Properties Algorithms for Directed Graphs DFS and BFS Strong Connectivity Transitive Closure DAG and Topological Ordering 2 Digraphs E A
School: UWO
CS2210 Data Structures and Algorithms Lecture14:GraphRepresentation,DFS, applicationsofDFS 337 43 17 LAX 1233 ORD 802 SFO 1843 DFW Outline GraphRepresentation EdgeList AdjacencyList AdjacencyMatrix GraphTraversals DepthFirstSearch(DFS) ApplicationsofDFS 2
School: UWO
CS2210 Data Structures and Algorithms Lecture15:BreadthFirstSearch L0 L1 B L2 2004Goodrich,Tamassia A C E D F Outline BreadthFirstSearch(BFS) ApplicationsofBFS 2 BFSAlgorithm Exploresverticesandedgesinsystematicorder,goforbreadth startatsomevertexv explo
School: UWO
CS2210 Data Structures and Algorithms Lecture 13 : Graphs 337 LAX 2004 Goodrich, Tamassia 43 17 1233 ORD 802 SFO 1843 DFW Outline Start a new data structure: Graphs very common and very useful data structure my favorite data structure different graph tha
School: UWO
CS2210 Data Structures and Algorithms Lecture 12 : B Trees 2004 Goodrich, Tamassia Outline Btree Special case of multiway search trees used when data must be stored on the disk, i.e. too large to fit in the memory 2 Reasons for using BTrees Accessing d
School: UWO
CS2210 DataStructuresandAlgorithms Lecture6:Trees MakeMoneyFast! Stock Fraud Ponzi Scheme Bank Robbery Instructor:OlgaVeksler 2004Goodrich,Tamassia Outline TreeasanADT TerminologyonTrees SpecialcaseofTrees: Binarytrees BasicPropertiesofBinaryTrees TreeTr
School: UWO
CS2210 Data Structures and Algorithms Lecture10: AVLTREESdeletion 6 v 8 3 z 4 ReviewofRemovalinBinarySearchTrees RemovalinAVLtreebegins asinbinarysearchtree Example:remove3 Case2:keyk toberemoved isstoredatanodev whose childrenarebothinternal findinter
School: UWO
CS2210 Data Structures and Algorithms Lecture11:Multiway and(2,4)Trees 9 257 2004Goodrich,Tamassia 10 14 Outline Anewtypeofsearchtrees,Multiway Seach Tree forordereddictionaryADT Searchinginmultiway trees (2,4)trees:specialcaseofmultiway trees Heightprop
School: UWO
CS2210 Data Structures and Algorithms Lecture 9: AVL TREES definition, properties, insertion 6 v 8 3 z 4 BST Performance For a binary search tree with n nodes and of height h methods find, insert and remove take O(h) time Height h is O(n) in the worst cas
School: UWO
CS2210 Data Structures and Algorithms Lecture 8: Binary Search Trees < 2 1 6 9 > 4= Instructor: Olga Veksler 8 Outline Return to the ordered dictionary ADT will spend the next 23 weeks on several different ways of implementing an ordered dictionary ADT O
School: UWO
CS2210 Data Structures and Algorithms Lecture7:PriorityQueuesandHeaps Instructor: Olga Veksler Outline PriorityqueueADT 2SimpleListbasedimplementationforPriority Queue HeapDatastructure notasefficientaspossible Firstmoderatelycomplexdatastructurethatyouha
School: UWO
CS2210 Data Structures and Algorithms Lecture 5: Hash Tables Instructor: Olga Veksler 0 1 2 3 4 2004Goodrich,Tamassia 0256120001 9811010002 4512290004 Outline HashTables Motivation Hashfunctions Collisionhandling SeparateChaining(openaddressing) Li
School: UWO
CS2210 Data Structures and Algorithms Lecture 4: Dictionaries Instructor: Olga Veksler 2004 Goodrich, Tamassia Outline Dictionaries BinarySearch Recurrenceequations 2 DictionaryADT ThedictionaryADTmodelsasearchablecollectionof keyvalue pairs(k,v),callede
School: UWO
CS2210 Data Structures and Algorithms Lecture 3: ADTs and Javas interfaces Instructor: Olga Veksler 2004 Goodrich, Tamassia Outline DataStructures AbstractDataTypes 2PrinciplesofOOProgrammingfrequently usedforimplementingADT encapsulation(informationhidi
School: UWO
CS2210 Data Structures and Algorithms Lecture 2: Analysis of Algorithms Asymptotic notation Instructor: Olga Veksler 2004 Goodrich, Tamassia Outline Comparing algorithms Pseudocode Theoretical Analysis of Running time Primitive Operations Counting primit
School: UWO
Course: Data Structures And Algorithms
CS2210 Data Structures and Algorithms Lecture10: AVLTREESdeletion 6 v 8 3 z 4 ReviewofRemovalinBinarySearchTrees RemovalinAVLtreebegins asinbinarysearchtree Example:remove3 Case2:keyk toberemoved isstoredatanodev whose childrenarebothinternal findinter
School: UWO
Course: Data Structures And Algorithms
CS2210 Data Structures and Algorithms Lecture 9: AVL TREES definition, properties, insertion 6 v 8 3 z 4 BST Performance For a binary search tree with n nodes and of height h methods find, insert and remove take O(h) time Height h is O(n) in the worst cas
School: UWO
Course: Data Structures And Algorithms
CS2210 Data Structures and Algorithms Lecture 8: Binary Search Trees < 2 1 6 9 > 4= Instructor: Olga Veksler 8 Outline Return to the ordered dictionary ADT will spend the next 23 weeks on several different ways of implementing an ordered dictionary ADT O
School: UWO
Course: Data Structures And Algorithms
CS2210 DataStructuresandAlgorithms Lecture6:Trees MakeMoneyFast! Stock Fraud Ponzi Scheme Bank Robbery Instructor:OlgaVeksler 2004Goodrich,Tamassia Outline TreeasanADT TerminologyonTrees SpecialcaseofTrees: Binarytrees BasicPropertiesofBinaryTrees TreeTr
School: UWO
Course: Data Structures And Algorithms
CS2210 Data Structures and Algorithms Lecture 5: Hash Tables Instructor: Olga Veksler 0 1 2 3 4 2004Goodrich,Tamassia 0256120001 9811010002 4512290004 Outline HashTables Motivation Hashfunctions Collisionhandling SeparateChaining(openaddressing) Li
School: UWO
Course: Data Structures And Algorithms
CS2210 Data Structures and Algorithms Lecture 4: Dictionaries Instructor: Olga Veksler 2004 Goodrich, Tamassia Outline Dictionaries BinarySearch Recurrenceequations 2 DictionaryADT ThedictionaryADTmodelsasearchablecollectionof keyvalue pairs(k,v),callede
School: UWO
Course: Data Structures And Algorithms
CS2210 Data Structures and Algorithms Lecture 3: ADTs and Javas interfaces Instructor: Olga Veksler 2004 Goodrich, Tamassia Outline DataStructures AbstractDataTypes 2PrinciplesofOOProgrammingfrequently usedforimplementingADT encapsulation(informationhidi
School: UWO
Course: Data Structures And Algorithms
CS2210 Data Structures and Algorithms Lecture 2: Analysis of Algorithms Asymptotic notation Instructor: Olga Veksler 2004 Goodrich, Tamassia Outline Comparing algorithms Pseudocode Theoretical Analysis of Running time Primitive Operations Counting primit
School: UWO
Course: Data Structures And Algorithms
CS2210 Data Structures and Algorithms Lecture 1: Course Overview Instructor: Olga Veksler 2004 Goodrich, Tamassia What is this course about? We will study moderately complex data structures and algorithms that are essential in core areas of computer scie
School: UWO
Course: Applied Logic For Computer Science
CS2209A 2011Fall Quiz3 Question 1.1 1.Translate the following into quantificational logic (5 marks) a. There is some French that everyone loves [Use Fx, Lxy] (x) (Fx (y) Lyx) Question 1.2 b. The smallest one is either red or blue (5 marks) [Use Sxy for x
School: UWO
Course: Applied Logic For Computer Science
CS2209A 2011Fall Quiz 1 Marking Criterion 50 marks in total 1. Translate following into wffs (10 marks): a. If you are young, then you are strong but inconsiderate. (use Y, S and I)3 (Y (S I) b. You feel hungry if and only if you didnt eat meat. (use F
School: UWO
Course: Applied Logic For Computer Science
Quiz 2 Question1(12/50) Convert the following two wffs into DNF and CNF respectively a. (~A(BC) =(~A(~BC) <CNF =(~A~B) (~AC) <DNF b. (A (B (C (~ A (B ~ C) =(~A (B (~C (~ A (~B ~ C) =(~A B)(~A (~C (~ A (~B ~ C) =(~A B)(~A ~B ~ C) < CNF =(~A(~A~B)(~A~C)(
School: UWO
Course: Artificail Intelligence II
Student ID: Name: CS 442b542b Short Exam 1 Instructions: Show all the work you do. Use the back of the page, if necessary. Calculators are allowed, laptops are not allowed. Problem 1 : Suppose we have a collected the following one dimensional samples fro
School: UWO
Course: Artificail Intelligence II
CS 4442b9542b, Winter 2010 Short Exam 1 Name: Instructions: Show all the work you do. Use the back of the page, if necessary. Calculators are allowed, laptops, cell phones, or any other communication devices are not allowed. This is an open notes/book ex
School: UWO
Course: Artificail Intelligence II
Student ID: Name: CS 442b542b Short Exam 2 Instructions: Show all the work you do. Use the back of the page, if necessary. Calculators are allowed, laptops are not allowed. Problem 1 (20%): The training data consists of the text: I like to play with cats
School: UWO
Course: Artificail Intelligence II
CS 442b542b Short Exam 3 Student ID: Name: Instructions: Show all the work you do. Use the back of the page, if necessary. Calculators are allowed, laptops are not allowed. Problem 1 (20%): (a) 10% Apply mask H f below 1 0 2 1 1 2 1 0 to the highligh
School: UWO
Course: Artificail Intelligence II
Name: CS4442/9542: Articial Intelligence II Winter 2013: Quiz 2 Solution Instructions: Show all the work you do. Use the back of the page, if necessary. Calculators are allowed, laptops, cell phones, or any other communication devices are not allowed. Thi
School: UWO
Course: Numerical Methods
1 The University of Western Ontario Computer Science CS630a Final Examination  December 5th, 1999 Surname Given Name Student Number This exam consists of 4 questions (5 pages, including this page) worth a total of 100%. It is an open book exam. All answe
School: UWO
Course: Numerical Methods
CS630a InClass Final Exam, Monday, December 13th, 46pm, 2004, MC320 1 The University of Western Ontario Computer Science CS630a Final Examination  December 13th, 2004 Surname Given Name Student Number This exam consists of 5 questions (8 pages, includi
School: UWO
Course: Numerical Methods
CS630a InClass Final Exam, Monday, December 9th, 10am11am, 2002, MC320 1 The University of Western Ontario Computer Science CS630a Final Examination  December 9th, 2002 Surname Given Name Student Number This exam consists of 5 questions (6 pages, inclu
School: UWO
Course: Numerical Methods
CS630a InClass Final Exam, Monday, December 10th, 46pm, 2001, MC105b 1 The University of Western Ontario Computer Science CS630a Final Examination  December 10th, 2001 Surname Given Name Student Number This exam consists of 4 questions (5 pages, includ
School: UWO
Course: Numerical Methods
1 The University of Western Ontario Computer Science CS630a Final Examination  December 14th, 2000 Surname Given Name Student Number This exam consists of 5 questions (6 pages, including this page) worth a total of 100%. It is an open book exam. All answ
School: UWO
Course: Numerical Methods
CS630a InClass Final Exam, Wednesday, December 14th, 24pm, 2005, MC316 1 The University of Western Ontario Computer Science CS630a Final Examination  December 14th, 2005 Surname Given Name Student Number This exam consists of 5 questions (8 pages, incl
School: UWO
Course: Numerical Methods
CS630a InClass Final Exam, Monday, December 11th, 4:306:30pm, 2006, MC316 1 The University of Western Ontario Computer Science CS630a Final Examination  December 11th, 2006 Surname Given Name Student Number This exam consists of 5 questions (8 pages, i
School: UWO
Course: Numerical Methods
CS9630a InClass Final Exam, Monday, December 4th, 2:304:30pm, 2012, MC320 1 The University of Western Ontario Computer Science CS9630a Final Examination  December 4th, 2012 Surname Given Name Student Number This exam consists of 5 questions (9 pages, i
School: UWO
Course: Numerical Methods
CS9630a InClass Final Exam, Monday, December 13th, 4:306:30pm, 2010, MC320 1 The University of Western Ontario Computer Science CS9630a Final Examination  December 13th, 2010 Surname Given Name Student Number This exam consists of 5 questions (11 pages
School: UWO
Course: Numerical Methods
CS9630a InClass Final Exam, Monday, December 14th, 4:306:30pm, 2009, MC300 1 The University of Western Ontario Computer Science CS9630a Final Examination  December 14th, 2009 Surname Given Name Student Number This exam consists of 5 questions (11 pages
School: UWO
Course: Numerical Methods
CS630a InClass Final Exam, Monday, December 10th, 4:306:30pm, 2007, MC320 1 The University of Western Ontario Computer Science CS630a Final Examination  December 10th, 2007 Surname Given Name Student Number This exam consists of 5 questions (8 pages, i
School: UWO
Course: Numerical Methods
CS9630a InClass Final Exam, Monday, December 8th, 4:306:30pm, 2008, MC320 1 The University of Western Ontario Computer Science CS9630a Final Examination  December 8th, 2008 Surname Given Name Student Number This exam consists of 5 questions (9 pages, i
School: UWO
Course: Databases II
1 1. (30 marks) For each of the following, state whether the statement is true or false. If it is false, correct the statement without changing the underlined text. If the statement is true, do not write anything more, just indicate true. (a) Persistence
School: UWO
Course: Databases II
Name: 1 1. (20 marks) Terminology: For each of the following statements, state whether it is true or false. If it is false, correct the statement without changing the underlined text. (Note: there might be more than one correction to make!) (a) SQL is an
School: UWO
Course: Databases II
1 Name: Student ID: Department of Computer Science Final Exam, CS 4411a Databases II Prof. S. Osborn April 22, 2010 3 Hours No aids. No electronic aids Answer all questions on the exam page This paper contains 19 pages; the last page is for rough work. Qu
School: UWO
Course: Databases II
1 1. (30 marks) For each of the following, state whether the statement is true or false. If it is false, correct the statement without changing the underlined text. If the statement is true, do not write anything more, just indicate true. (a) A database b
School: UWO
Course: Computer Science Fundamentals II (C++)
Computer Science 1037a Final Examination SAMPLE 1 3 hours Student Number: Surname: Given name: Instructions/Notes: The examination has 14 pages and a total of 100 marks, and consists of two parts. Part 1 is Multiple Choice and True/False, and consists of
School: UWO
Course: Computer Science Fundamentals II (C++)
Computer Science 1037a Final Examination SAMPLE 2 3 hours Student Number: SOLUTION Surname: Given name: Instructions/Notes: The examination has 14 pages and a total of 100 marks, and consists of two parts. Part 1 is Multiple Choice and True/False, and con
School: UWO
Course: Computer Science Fundamentals II (C++)
Computer Science 1037a Final Examination SAMPLE 2 3 hours Student Number: Surname: Given name: Instructions/Notes: The examination has 14 pages and a total of 100 marks, and consists of two parts. Part 1 is Multiple Choice and True/False, and consists of
School: UWO
Course: Computer Science Fundamentals II (C++)
Computer Science 1037a Final Examination SAMPLE 1 3 hours Student Number: SOLUTION Surname: Given name: Instructions/Notes: The examination has 14 pages and a total of 100 marks, and consists of two parts. Part 1 is Multiple Choice and True/False, and con
School: UWO
Course: Computer Science Fundamentals II
Western University Department of Computer Science Computer Science 1027b Midterm Exam 2 hours PRINT YOUR NAME: PRINT YOUR STUDENT NUMBER: DO NOT TURN THIS PAGE UNTIL INSTRUCTED TO DO SO! Instructions Fill in your name and student number above immediately
School: UWO
Course: Computer Science Fundamentals II
The University of Western Ontario Department of Computer Science Computer Science 1027b Midterm Exam Master March 10, 2012 2 hours Print your name:_ Student number: _ Instructions: Fill in your name and student number above immediately. Answer all the que
School: UWO
Course: Data Structures And Algorithms
CS2210a: Data Structures and Algorithms Winter 2013: Midterm Examination Solutions 110 minutes Instructions: Write your name in the space provided. Please check that your exam is complete. It should have 13 pages in total The examination has a total of
School: UWO
Course: Data Structures And Algorithms
Part 1: Multiple Choice Enter your answers on the Scantron sheet. We will not mark answers that have been entered on this sheet. Each multiple choice question is worth 3.5 marks. 1. Two algorithms, A and B , have time complexities fA (n) and fB (n), respe
School: UWO
Course: Data Structures And Algorithms
Part 1: Multiple Choice Enter your answers on the Scantron sheet. We will not mark answers that have been entered on this sheet. Each multiple choice question is worth 2.5 marks. In all the questions below, log(x) means log2 (x). You might nd this fact us
School: UWO
Course: Applied Logic For Computer Science
UNIVERSITY OF WESTERN ONTARIO Computer Science 209b, Winter 2000 Applied Logic for Computer Science MIDTERM TEST  SOLUTIONS Friday, February 18, 2000 1. (1 mark each) a) A G C b) P I c) C E G d) C A G e) G P f) R P g) S E h) E (A S ) i) I (X X +) (X X +)
School: UWO
Course: Applied Logic For Computer Science
UNIVERSITY OF WESTERN ONTARIO Computer Science 209a, Fall 2000 Applied Logic for Computer Science MIDTERM TEST 9:00pm11:00pm, Friday, February 18, 2000 Name ID 1. Translate the following sentences into the language of propositional calculus using the ind
School: UWO
Course: Applied Logic For Computer Science
UNIVERSITY OF WESTERN ONTARIO Computer Science 209b, Winter 2000 Applied Logic for Computer Science FINAL EXAM Monday, April 10, 2:00pm5:00pm Name ID 1. Translate each of the following sentences into the language of propositonal calculus using the indica
School: UWO
Course: Computer Science Fundamentals I
The University of Western Ontario Department of Computer Science Computer Science 1026a Midterm Exam 2 hours PRINT YOUR NAME: PRINT YOUR STUDENT NUMBER: Do not turn this page until instructed to do so! 1 Instructions Fill in your name and student number
School: UWO
Course: Computer Science Fundamentals I
The University of Western Ontario Department of Computer Science Computer Science 1026a Midterm Exam 2 hours PRINT YOUR NAME: PRINT YOUR STUDENT NUMBER: Do not turn this page until instructed to do so! 1 Instructions Fill in your name and student number
School: UWO
Course: Computer Science Fundamentals I
The University of Western Ontario Department of Computer Science Computer Science 1026a Midterm Exam May 30, 2013 1 hour 45 minutes Print your name: _ Student number: _ Instructions: Fill in your name and student number above immediately. You have 105 min
School: UWO
Course: Computer Science Fundamentals I
The University of Western Ontario Department of Computer Science Computer Science 1026b Final Exam April 21, 2009 3 hours Print your name: _ Student number: _ Fill in your name and student number above immediately. On the Scantron form, fill in your name
School: UWO
Course: Computer Science Fundamentals I
27 Computer Science 026a Final Exam Fall 2007 Sample Questions with Solutions Part 1: Sample Multiple Choice Questions You may assume that there are no syntax errors intended in any of the code provided in the questions of Part 1, unless the question spec
School: UWO
Course: Computer Science Fundamentals I
CS026a Final Examination December 19, 2006 Page 1 of 20 THE UNIVERSITY OF WESTERN ONTARIO LONDON CANADA COMPUTER SCIENCE 026a FINAL EXAMINATION DECEMBER 19, 2006 3 HOURS NAME: _ STUDENT NUMBER: _ Question 120. _ 2140. _ 41. _ 42. _ 43. _ 44. _ 45. _ 46.
School: UWO
Course: Computer Science Fundamentals I
27CS026a Final Examination December 10, 2007 Computer Science 026a Final Exam Fall 2007 Sample Questions Part 1: Sample Multiple Choice Questions You may assume that there are no syntax errors intended in any of the code provided in the questions of Part
School: UWO
Course: Computer Science Fundamentals I
The University of Western Ontario Department of Computer Science Computer Science 1026b Final Exam April 21, 2009 3 hours Print your name: _ Student number: _ Fill in your name and student number above immediately. On the Scantron form, fill in your name
School: UWO
Course: Computer Science Fundamentals I
CS026a Final Examination December 19, 2006 Page 1 of 20 THE UNIVERSITY OF WESTERN ONTARIO LONDON CANADA COMPUTER SCIENCE 026a FINAL EXAMINATION DECEMBER 19, 2006 3 HOURS NAME: _Marking Scheme_ STUDENT NUMBER: _ Question 120. _ 2140. _ 41. _ 42. _ 43. _
School: UWO
Course: Computer Science Fundamentals II
Computer Science 027a Midterm Exam  Fall 2005 1. (12 marks) For each of the following sentences, fill in the blank with the best one of the terms from the list below. Each term may be used one or more times, or not at all. a) b) c) d) e) f) g) A(n) _ is
School: UWO
Course: Computer Science Fundamentals II
Computer Science 027b Midterm Exam  January Term 2006 1. (3 marks) For each of the following growth functions, write beside it its order in BigO notation. a) b) c) 5n2 + 1000 n 1 1235 n + n3 n + 100 log2n _ _ _ 2. (6 marks) On the line beside each of th
School: UWO
Course: Computer Science Fundamentals II
Computer Science 027a Midterm Exam Fall 2005 with Solutions 1. (12 marks) For each of the following sentences, fill in the blank with the best one of the terms from the list below. Each term may be used one or more times, or not at all. a) A(n) _abstract
School: UWO
Course: Computer Science Fundamentals II
Computer Science 027b Midterm Exam January Term 2006 WITH SOLUTIONS 1. (3 marks) For each of the following growth functions, write beside it its order in BigO notation. a) b) c) 5n2 + 1000 n 1 1235 n + n3 n + 100 log2n _O(n^2)_ _O(n^3)_ _O(n)_ 2. (6 mark
School: UWO
Course: Computer Science Fundamentals II
CS1027a 2009 Practice Questions from Old Final Exams Part 1: Multiple Choice 1. (3 marks) Suppose that the following method is in class D. public static int sss(int x) cfw_ if (x % 2 = 0) return x+1; else return (x  1)*sss(x + 1); Determine the output o
School: UWO
Course: Computer Science Fundamentals II
CS1027 2009 Practice Questions from Old Final Exams with Solutions Part 1: Multiple Choice 1. (3 marks) Suppose that the following method is in class D. public static int sss(int x) cfw_ if (x % 2 = 0) return x+1; else return (x  1)*sss(x + 1); Determin
School: UWO
Course: Computer Science Fundamentals II
The University of Western Ontario Department of Computer Science Computer Science 1027a Midterm Exam With Solutions November 10, 2009 1 hour 45 minutes Print your name:_ Student number: _ Instructions: Fill in your name and student number above immediatel
School: UWO
Part 1: Multiple Choice Enter your answers on the Scantron sheet. We will not mark answers that have been entered on this sheet. Each multiple choice question is worth 3.5 marks. In all the questions below, log(x) means log2 (x). This fact might be useful
School: UWO
Course: Computer Network
An Object Example CS 1025 Computer Science Fundamentals I Stephen M. Watt University of Western Ontario Objectives Cement the idea of objects. Become comfortable with objects in Java. Practice with arrays. See a dynamic data structure. Learn how to r
School: UWO
Course: Cs1037a
Computer Science 1037a Sample Questions for the Final Examination Part I: True/False and multiple choice answers. Circle your answers on the question sheet, and fill them in on the Scantron form 1. [1 mark] A list is a lastin firstout data structure. a)
School: UWO
Course: Cs1037a
Computer Science 037a Final Examination Part I: True/False and multiple choice answers. Circle your answers on the question sheet, and fill them in on the Scantron form 1. [1 mark] A stack is a firstin firstout data structure. a) True b) False 2. [1 mar
School: UWO
Course: Cs1037a
Part I: True/False and multiple choice answers. Circle your answers on the question sheet, and fill them in on the Scantron form 1. [1 mark] The C+ declaration in function main char a; instantiates one object of type char. a) True b) False 2. [1 mark] The
School: UWO
Nov. 8, 2004 Midterm Instructions: Show all the work Problem 1 (15%): Consider a one dimensional two category classification problem. Suppose the class conditional densities are given by p(xc1)=N(2,1) and 1 p ( x  c2 ) = 3 0 if 0 x 3 otherwise C
School: UWO
Name: Student No: Department of Computer Science University of Western Ontario CS 025a Computer Science Fundamentals I October 16, 2007 Midterm Test TIME: 1 hour and 45 minutes One singlesided handwritten sheet of notes allowed. This test has four
School: UWO
Course: Applied Logic For Computer Science
UNIVERSITY OF WESTERN ONTARIO Computer Science 209b, Winter 2000 Applied Logic for Computer Science ASSIGNMENT 8  SOLUTIONS Given: Friday, March 24, Due: Monday, April 3, 2000 1. Translation: Premise 1. (x)(F (x) D(x) C(x) Premise 2. (x)(F (x) I(x) C(x)
School: UWO
Course: Applied Logic For Computer Science
UNIVERSITY OF WESTERN ONTARIO Computer Science 209b, Winter 2000 Applied Logic for Computer Science ASSIGNMENT 5  SOLUTIONS Given: Friday, March 3, Due: Monday, March 13, 2000 1. n = xyzw x 0 0 0 0 0 0 0 0 1 1 y 0 0 0 0 1 1 1 1 0 0 z 0 0 1 1 0 0 1 1 0 0
School: UWO
Course: Applied Logic For Computer Science
UNIVERSITY OF WESTERN ONTARIO Computer Science 209b, Winter 2000 Applied Logic for Computer Science ASSIGNMENT 3  SOLUTIONS Given: Friday, February 4, Due: Monday, February 14, 2000 1. a) p (q r) = p (q r) (implication law)  = p (q r) (implication law
School: UWO
Course: Applied Logic For Computer Science
UNIVERSITY OF WESTERN ONTARIO Computer Science 209a, Fall 1999 Applied Logic for Computer Science ASSIGNMENT 1  SOLUTIONS Given: Friday, January 21, Due: Monday, January 31, 2000 1. a) N F b) (G M ) c) O L d) B F e) D W f ) F E, or equivalently F E, E F
School: UWO
Course: Applied Logic For Computer Science
UNIVERSITY OF WESTERN ONTARIO Computer Science 209b, Winter 2000 Applied Logic for Computer Science ASSIGNMENT 2  SOLUTIONS Given: Friday, January 28, Due: Monday, February 7, 2000 1. premise 1: P (G B) premise 2: P F premise 3: B F conclusion: F The arg
School: UWO
Course: Applied Logic For Computer Science
UNIVERSITY OF WESTERN ONTARIO Computer Science 209b, Winter 2000 Applied Logic for Computer Science ASSIGNMENT 4  SOLUTIONS Given: Friday, February 11, Due: Monday, February 28, 2000 1. Translation: Premise 1. P W K G Premise 2. P Premise 3. W Conclusion
School: UWO
Course: Applied Logic For Computer Science
UNIVERSITY OF WESTERN ONTARIO Computer Science 209b, Winter 2000 Applied Logic for Computer Science ASSIGNMENT 6  SOLUTIONS Given: Friday, March 10, Due: Monday, March 20, 2000 1. (P Q R) (P Q R) (R Q) t0 000, 001, 010, 011, 100, 101, 110, 111 t1 100, 10
School: UWO
Course: Applied Logic For Computer Science
UNIVERSITY OF WESTERN ONTARIO Computer Science 209b, Winter 2000 Applied Logic for Computer Science ASSIGNMENT 7  SOLUTIONS Given: Friday, March 17, Due: Monday, March 27, 2000 1. a) (i) U = set of all cities in the world A(x) = x is a city in North Amer
School: UWO
Alanna Harris Critical Response: Formal Methods in SafetyCritical Railway Systems This article describes two situations in which the formal B method was applied. In both cases, the method was used introduce platform screen doors(PSD) on railway tracks in
School: UWO
This article is about the application of the formal B method to the safety critical software for the Meteor line, the first driverless metro in Paris. Beginning with the development process, there is the modelisation phase, transformation from software re
School: UWO
Practical Approach for QualityDriven Inspections This article, written by Christian Denger and Forrest Shull, discusses their customizable inspection process, called TAQtIC (Tailoring Approach for QualityDriven Inspections), and how it solves previous i
School: UWO
Alanna Harris Case Study: How Analysis of Customer Found Defects Can be Used by System Test to Improve Quality This article was a case study regarding the analysis of customer found defects of a large telecommunications system, referred to as Z, to improv
School: UWO
Alanna Harris Response Six: When a GUI Regression Test Failed, What Should be Blamed? The article, When a GUI Regression Test Failed, What Should be Blamed? investigates the causes of regression test case failures by studying the failed automatic tests in
School: UWO
Alanna Harris TestDriven GUI Development with Abbot and TestNG In the article, TestDriven GUI Development with Abbot and TestNG, the authors introduce two different tools to assist in GUI testing. They show the necessity of these tools by explaining the
School: UWO
Alanna Harris Economic Impact of Inadequate Software Testing Infrastructure The report, The Economic Impacts of Inadequate Infrastructure for Software Testing, discusses the inadequacies of software testing infrastructure and uses two case studies to sh
School: UWO
Alanna Harris Enhancing Software Testing by Judicious Use of Code Coverage Information The report, Enhancing Software Testing by Judicious Use of Code Coverage Information, attempts to show that, when introduced properly and used judiciously, code coverag
School: UWO
Critical Response to Quest for Quality The article Quest for Quality, written by Mary Hayes Weier, is an overview of why software quality is so important and how quality can be improved. Bugriddled software has a negative impact on the company, leading t
School: UWO
MapReduce: Simplied Data Processing on Large Clusters Jeffrey Dean and Sanjay Ghemawat jeff@google.com, sanjay@google.com Google, Inc. Abstract MapReduce is a programming model and an associated implementation for processing and generating large data sets
School: UWO
http:/ksat.me/mapreduceareallysimpleintroductionkloudo/ MapReduce:Areallysimpleintroduction MapReducelibrarydividestheworkandgroupsthevaluesbythekey Example:countthenumberoftimesonecharacterwordsoccur,twocharacters wordsoccur,etc.uptothenumberoftimesten
School: UWO
MapReduce: A Review 1 Introduction InthearticleMapReduce:SimplifiedDataProcessingonLargeClusters,JeffreyDeanand SanjayGhemawatpresentanoverviewoftheGoogleMapReduce[3]programmingmodel forprocessingandgeneratingenormoussetsofdata.Theauthorsgiveabriefoutline
School: UWO
1 Introduction InthearticleMapReduce:SimplifiedDataProcessingonLargeClusters,JeffreyDeanand SanjayGhemawatpresentanoverviewoftheGoogleMapReduce[3]programmingmodel forprocessingandgeneratingenormoussetsofdata.Theauthorsgiveabriefoutlineofthe programmingmod
School: UWO
Course: Data Structures And Algorithms
CS2210b: Data Structures and Algorithms Winter 2014: Assignment 3(concept) Solutions 1. Consider the algorithm AddSomething (A, n) : Algorithm AddSomething(A,n) Input: Array A and integer n. A has size at least n if n < 1 return 0 else temp 3 A[n 1] + Add
School: UWO
Course: Data Structures And Algorithms
CS2210b: Data Structures and Algorithms Winter 2014: Assignment 1 (concept) Due: January 20 Solutions 1. (10%) Use the denition of bigO to prove that 12n5 + 0.5n4 log(n) is O(n5 ). Solution: 12n5 + 0.5n4 log(n) 12n5 + 0.5n5 n 2. Therefore 12n5 + 0.5n4 1
School: UWO
Course: Applied Logic For Computer Science
Western University Computer Science Department CS 2209A: Applied Logic for Computer Science Fall 2012 Assignment 1 Solutions 1. (5 points) Prove by mathematical induction that (34n 1) is divisible by 80. Answer (a) For n=1. (34 1) = 80. (b) Assume that fo
School: UWO
Course: Applied Logic For Computer Science
UNIVERSITY OF WESTERN ONTARIO Computer Science 209a Applied Logic for Computer Science ASSIGNMENT 7 Solution 1. a) x(L(x) E (x) b) x(L(x) E (x) C (x) c) x[L(x) C (x) E (x)] d) x[(E (x) C (x) L(x)] e) x[L(x) E (x)] 2. a) x(E (x) C (a, x) b) xyC (y, x) c) x
School: UWO
Course: Applied Logic For Computer Science
UNIVERSITY OF WESTERN ONTARIO Computer Science 209a Applied Logic for Computer Science ASSIGNMENT 6 Solution 1a. PQ PQ R PQ PQ # 1 1 1 1 "! R The simplied form is: PQ PR PQ 1b. # R R PQ PQ # PQ 1 1 "! "! # 1 1 "! The simplied form is: P QR P Q R P QR P QR
School: UWO
Course: Applied Logic For Computer Science
UNIVERSITY OF WESTERN ONTARIO Computer Science 209a Applied Logic for Computer Science ASSIGNMENT 8 Solution 1a. a) i) D=cfw_a P(x) Q(x) R(x) a 1 1 0 This interpretation makes the formula true. ii) D=cfw_a P(x) Q(x) R(x) a 1 1 1 This interpretation makes
School: UWO
Course: Applied Logic For Computer Science
UNIVERSITY OF WESTERN ONTARIO Computer Science 209a Applied Logic for Computer Science ASSIGNMENT 9 Solution 1. 1.x(C (x) W (x) 2.W (t) C (t) 1. x(C (x) W (x) () 2. C (t) W (t) (1, ) 3. W (t) () 4. W (t) C (t) (2, contrapositive) 5. C (t) (3, 4, ) where c
School: UWO
Course: Applied Logic For Computer Science
UNIVERSITY OF WESTERN ONTARIO Computer Science 209a Applied Logic for Computer Science ASSIGNMENT 10 Solution 1. First, in order to use resolution, we have to transform all the premises and the negation of the conclusion in conjunctive normal form. p1 : P
School: UWO
CS 4457  Computer Networks II: Advanced Communications Assignment 3 Due: March 11, 2009 Weight: 10% 1. Consider the procedure described in the lecture notes for estimating the average delay di (slides 3239). Suppose that u = 0.1. Let r1 t1 be the
School: UWO
CS 2210b Data Structures and Algorithms Winter 2009, Instructor: Olga Veksler Assignment 2 (Programming) weight is 10% of the nal score Due February 12, 11:59 pm in the course locker number 308 and also electronically, see instructions below. 1 Ove
School: UWO