27 Pages

slides22

Course: COMP 507, Fall 2009
School: East Los Angeles College
Rating:
 
 
 
 
 

Word Count: 1857

Document Preview

to Approaches Schema Design need to identify basic components entity types, relationship types, attributes and for each of these components key attributes cardinality and participation constraints of relationships hierarchical relationships, were relevant weak entity types this process can be done using two different approaches 1. centralized, or one shot schema design 2. view integration the difference...

Register Now

Unformatted Document Excerpt

Coursehero >> California >> East Los Angeles College >> COMP 507

Course Hero has millions of student submitted documents similar to the one
below including study guides, practice problems, reference materials, practice exams, textbook help and tutor support.

Course Hero has millions of student submitted documents similar to the one below including study guides, practice problems, reference materials, practice exams, textbook help and tutor support.
to Approaches Schema Design need to identify basic components entity types, relationship types, attributes and for each of these components key attributes cardinality and participation constraints of relationships hierarchical relationships, were relevant weak entity types this process can be done using two different approaches 1. centralized, or one shot schema design 2. view integration the difference is the stage in which the merging of the requirements takes place Centralized Schema Design a single schema is designed from the complete set of requirements requirements of different applications and user groups are merged into a single set of requirements before schema design external schemas for user groups and application are developed from the single schema assumption is that single administrator is responsible for deciding how to merge the different (and possibly conflicting) requirements centralized design can be difficult with many user groups and applications, merging all of the requirements can be arduous and time consuming can be difficult to merge informal description View Integration a schema (or view) is designed for each user group and application views are designed by user groups and application developers each view reflects a differing set of requirements individuals view are merged into the global conceptual schema need to specify correspondence among entity types, relationship types and attributes before starting integration individual views can be reconstructed as external schemas after view integration view integration can be difficult requires a good methodology and software support need to integrate conflicting views and verify the consistency of inter-schema correspondences Centralised ER Schema Design top down strategy start with schema containing high-level abstractions and apply successive top-down refinements may start by specifying only a few high level entity types as the specification of attributes starts, we can split these into lower level entity types and relationships Centralised ER Schema Design bottom up strategy starts with a schema containing basic abstractions then proceeds by combining and adding to these may start with attributes and group these into entities and relationships can add new relationships among entities as design progresses Special case: inside out strategy attention is focussed on a central set of concepts, that are most evident modelling spreads outwards, by considering new concepts in the vicinity of existing ones Centralised ER Schema Design mixed strategy ... but everything starts from the analysis of the requirements which usually are in natural language, and not particularly clear... 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 We wish to create a database for a company that runs training courses courses courses. For each course course participant participant , participant, identified by a code, we want to store the national insurance number, surname, age, sex, place of birth, employer's name, address and telephone number , previous employers (and period employed), the course attended and the final assessment of each course . We need also to represent the seminars that each participant is attending at present and, for each day, the places and times the classes are held. Each course has a code and a title and any course can be given any number of times. Each time a course is given, we call it an "edition" of the course . For each edition, we represent the start and end dates and the number of participants . If a trainee is a self employed professional, we need to know his or her area of expertise, and, if appropriate, his or her title . For somebody who works for a company we store the level and position held. For each instructor we will show surname, age, place of birth, the edition the course is taught, those taught in the past and the courses the tutor is qualified to teach. All the instructor 's telephone numbers are also stored. An instructor can be permanently employed or can be freelance. Natural Language Specification Problems there is an interchangeable use of names (synonyms problem): participants/trainees, tutors/instructors, courses/seminars some names are used with ambiguous meaning (homonyms problem): place means town (of birth) in line 3 and 15, and classroom in line 7 some terms are too general: period (line 5) can be specified better as start date and end date, assessment (line 5) is a mark (perhaps out of 10) title (line 13) is rather a professional title there are unnecessarily complex phrases: somebody who works for a company (line 13-14) is an employee some cross references are not explicit (may be ambiguous): are address and telephone number (line 4) referring to the trainees or their employers? Rewrite Specification construct a glossary of terms, such as: Term Trainee Instructor Course Company Description Participant in a course. Can be an employee or self-employed Corse tutor. Can be freelance Course offered. Can have various edition Company by which participant is or has been employed. Synonym Participant Tutor Seminar rewrite specification using terms in the glossary rearrange specification, breaking down the text into groups of homogeneous phrases, referring to the same concept Phrases of a general nature We wish to create a database for a company that runs training courses. Phrases relating to trainees For each trainee, identified by a code, we will hold the national insurance number, surname, age, sex, town of birth, current employer, previous employers (along with start date and end date of employment), the editions of the courses the trainee is attending at present and those he or she has attended in the past, with the final mark, out of ten. Phrases relating to the employers of the trainees For each employer of a trainee we will hold name, address and telephone number. Phrases relating to specific types of trainees For a trainee who is a self-employed professional, we will hold the area of expertise and, if appropriate, the professional For title. a trainee who is an employee, we will hold the level and position held. Phrases relating to the courses For each course we will hold the name and code. Each time a particular course is given, we will call it an "edition" of the course. For each edition, we will hold start date, end date and the number of participants. For the editions currently in progress, we will hold the dates, the classrooms and the times in which the classes are held. Phrases relating to the instructors For each instructor we will hold surname, age, town of birth, all telephone numbers, the edition of courses taught, those taught in the past and the courses the instructor is qualified to teach. The instructors can be permanently employed or can be freelance. General Criteria for Data Representation if a concept has significant properties and/or describes classes of objects with an autonomous existence, it is appropriate to represent it as an entity for example, an instructor can be an entity, as it possesses various properties (name etc) and its existence does not depend from other concepts General Criteria for Data Representation if a concept has a simple structure, and has no relevant properties associated with it, it is convenient to represent it as an attribute of another concept to which it refers for example: a town may well be an entity in general, but for this application it can more appropriately be modelled as an attribute General Criteria for Data Representation if the requirements contain a concept that provides a logical link between two or more entities, this concept can be represented by a relationship for example, the concept of attending a course. some cases can be controversial: for example, a match can be thought as a relationship between two teams and a stadium, or as an entity in its own right Top Down Strategy identify main entities and relationships Courses Trainees Instructors Trainees attend Courses Instructors teach Courses construct high level schema identify cases in which an entity describes two different concepts logically linked to each other: TRAINEE ATTENDS COURSE TEACHES INSTRUCTOR from 1 entity to 2 entities+relationship identify cases in which an entity describes two different concepts logically linked to each other: TRAINEE ATTENDS COURSE TEACHES INSTRUCTOR TRAINEE ATTENDS EDITION TEACHES INSTRUCTOR HELD IN COURSE TYPE from 1 entity to 1 entity+N entities+N relationships identify cases in which an entity is made up of distinct subentities TRAINEE ATTENDS EDITION TEACHES INSTRUCTOR HELD IN COURSE TYPE EMPLOYEE IS A TRAINEE ATTENDS EDITION TEACHES INSTRUCTOR IS A HELD IN PROFESSIONAL COURSE TYPE from 1 relationship to multiple relationships identify cases in which a relationship describes two or more different concepts linking the same entities EMPLOYEE IS A TRAINEE ATTENDS EDITION TEACHES INSTRUCTOR IS A HELD IN PROFESSIONAL COURSE TYPE EMPLOYEE IS A ATTENDS EDITION HAS ATTENDED TEACHES INSTRUCTOR TRAINEE IS A HELD IN HAS TAUGHT PROFESSIONAL COURSE TYPE from 1 relationship to 1 entity + relationships identify cases in which a relationship describes a concept having an autonomous existence EMPLOYEE IS A ATTENDS EDITION HAS ATTENDED TEACHES INSTRUCTOR TRAINEE IS A HELD IN HAS TAUGHT PROFESSIONAL COURSE TYPE EMPLOYEE CLASSROOM IS A ATTENDS EDITION HAS ATTENDED TEACHES INSTRUCTOR TRAINEE IS A HELD IN HAS TAUGHT PROFESSIONAL COURSE TYPE repeat the above processes for any new entity and relationship introduced EMPLOYEE CLASSROOM IS A ATTENDS EDITION HAS ATTENDED TEACHES...

Find millions of documents on Course Hero - Study Guides, Lecture Notes, Reference Materials, Practice Exams and more. Course Hero has millions of course specific materials providing students with the best way to expand their education.

Below is a small sample set of documents:

East Los Angeles College - COMP - 507
STAGE 5System Validation and Vericationthe rst prototype of the system can be used to determine its potential effectiveness and deciencies. the assumptions made during the modelling process can be tested for thoroughness and, where necessary, modi
East Los Angeles College - COMP - 507
Applications of Information Technology (COMP507)Aim: To introduce concepts, techniques, and tools necessary to model and produce working computer systems that meet a predefined specification.Lectures : Monday 3.00 pm, Rendall Building, lec. theat
East Los Angeles College - COMP - 318
V. TammaRDF Stores Jena (jena.semanticweb.org) Popular RDF store RDF (SparQL) and RDFS (RQL) querying Limited OWL reasoning Forward chaining and backward chaining rule engines Open source implementation in Java Command-line and Java API acce
East Los Angeles College - COMP - 302
CONCURRENCY CONTROL AND CONFLICT SERIALIZABILITY In order for transactions to be considered correct, they must satisfy the four ACID properties of transactions, A transaction is correct if the following properties hold: A Atomicity: Transaction e
East Los Angeles College - COMP - 318
V. TammaChapter 3RDFS semantics: exercisesGiven the following RDFS graph: <http:/example.org/#a> <http:/example.org/#b> <http:/example.org/#c> <http:/example.org/#b> rdfs:domain <http:/example.org/#a> <http:/example.org/#a> rdfs:subClassOf <htt
East Los Angeles College - COMP - 507
DEPARTMENTS(DepNo, DName, DHead) LECTURERS(LectNo, LName, LSurname, LDepN, LMentor) COURSES(CourseNo, CName, CSemester, CDepNo) TEACHINGDUTIES(CourseNo, LNo) The following referential constraints hold in the database DEPARTMENTS.DHead references
East Los Angeles College - COMP - 318
UNIVERSITY OF LIVERPOOL: DECLARATION ON PLAGIARISM AND COLLUSIONNAME:STUDENT NUMBER:MODULE TITLE/CODE: Advanced Web Technologies - Comp 318TITLE OF WORK:This form should be completed by the student and appended to any piece of work
East Los Angeles College - COMP - 318
V. TammaIt all started withCOMP318 Introduction on the WWWwww.csc.liv.ac.uk/~valli/Comp318 Dr Valentina Tamma Room: Ashton 2.22 Dept of computer science University of Liverpool V.Tamma@liverpool.ac.ukV. Tamma Comp 318 The Internet started with
East Los Angeles College - COMP - 318
Chapter 4Web Ontology Language: OWLV. TammaComp 318V. TammaLimitations of RDF Schema Local scope of properties In RDF Schema we cannot declare range restrictions that apply to some classes only E.g. cows eat only plants Disjointness of cl
East Los Angeles College - COMP - 318
V. TammaWWW ComponentsCOMP318 WWW architecturewww.csc.liv.ac.uk/~valli/Comp318 Dr Valentina Tamma Room: Ashton 2.22 Dept of computer science University of Liverpool valli@csc.liv.ac.ukV. Tamma Comp 318 Structural Components Clients/browser
East Los Angeles College - COMP - 318
Assignment 1 Complete the 4 questions below. Each question is worth 25 marks. When producing XML or RDF fragments (in N3 or XML serialisation), please make sure that the fragment produced is valid. 1. Consider the following fragment of an XML documen
East Los Angeles College - COMP - 318
V. TammaWeb Services: Basic ArchitectureChapter 8 Web servicesSlides adapted from T. Payne and, M. Huhns and M. Singh Publish or announce (WSDL) Service Provider Not well-knownV. Tamma Comp 318 Comp 318Service BrokerRegistry; well-knownFi
Wilfrid Laurier - CHEM - 353
304 Shop castle, the naturally occurring The basic Zersetzungsproduct of the Hyoscins is, like already the boiling point ergiebt, different from the Tropin. It schenit than this to be also many more hygroscopic, since the Krystalle became damp a
Rose-Hulman - SL - 151
SL 151 Bremmer March 24, 2008Name _ CM _ Homework Assignment #11 Due Thursday, March 27, 2008Instructions: The following questions cover material discussed in class and covered in Chapter 7. Indicate the best answer for each question in the spac
Rose-Hulman - AY - 0405
What should we do in ME 421 first week? (Fall 04-05)Pick a Project You may be asking yourself the question, What do I do this week that is worth 9 to 12 work hours? (3 or 4 people * 3 lab hours). We believe that selecting a project wisely is a worth
East Los Angeles College - COMP - 201
Essentials of interaction diagramsLecture 23Outline Collaborations Interaction on collaboration diagrams Sequence diagrams Messages from an object to itself Suppressing detailed behaviour Creation and deletion of objects Timing2Importa
Sveriges lantbruksuniversitet - CMPT - 413
CMPT 413 Computational LinguisticsAnoop Sarkarhttp:/www.cs.sfu.ca/~anoop1/14/081Formal Languages: Recap Symbols: a, b, c Alphabet : finite set of symbols = {a, b} String: sequence of symbols bab Empty string: Define: = {} Set of al
Sveriges lantbruksuniversitet - MACM - 300
Homework #1: MACM-300Reading: Sipser; Chapter 0 Distributed on Jan 9; due on Jan 16 (in class)Anoop Sarkar anoop@cs.sfu.caOnly submit answers for questions marked with . (1) (2) (3) (4) (5) A relation R on set S is irreexive if aRa is false for
Sveriges lantbruksuniversitet - CMPT - 413
CMPT 413 Computational LinguisticsAnoop Sarkarhttp:/www.cs.sfu.ca/~anoop1/23/081Finite-state transducers a : 0 is a notation for a mapping between two alphabets a 1 and 0 2 Finite-state transducers (FSTs) accept pairs of strings Finite-s
Sveriges lantbruksuniversitet - MACM - 300
Finite-state transducers MACM 300 Formal Languages and AutomataAnoop Sarkarhttp:/www.cs.sfu.ca/~anoop T2 T1R(T1) = R(T2) = { (aa, 10), (ab, 1) }Finite-state transducers a:0 is a notation for a mapping between two alphabets a " #1 and 0 " #2 F
Sveriges lantbruksuniversitet - MACM - 300
Derivations of a CFG MACM 300 Formal Languages and AutomataAnoop Sarkarhttp:/www.cs.sfu.ca/~anoop strings grow on trees strings grow on Noun strings grow Object strings Verb Object Noun Verb Object Sentence3Context-free Grammars Set of
Sveriges lantbruksuniversitet - CMPT - 755
CMPT-755 CompilersAnoop Sarkarhttp:/www.cs.sfu.ca/~anoop1Programming Languages and Formal Language Theory We ask the question: Does a particular formal language describe somekey aspect of a programming language Then we find out if that la
Sveriges lantbruksuniversitet - CMPT - 413
CMPT-413 Computational LinguisticsAnoop Sarkar http:/www.cs.sfu.ca/anoop1Formal Language Theory is the alphabet, e.g. = {a, b} is the set of all strings with alphabet The Library of Babel by Jorge Luis Borges (published in collections, e
Sveriges lantbruksuniversitet - CMPT - 825
Notes on MAP Estimation for HMMs Anoop SarkarA HMM is a probabilistic nite-state automata, in which ap,q represents the probability of taking a transition from state q to state p and bk,q represents the probability of emitting alphabet symbol k from
Sveriges lantbruksuniversitet - CMPT - 825
Homework #4: CMPT-825Due in class on Oct 3, 2003Anoop Sarkar anoop@cs.sfu.ca(1)(100pts) Part of Speech Tagging All the files for this assignment are in /cs/825/data/postags Part of speech tagging is the process of assigning to a sequence of wo
East Los Angeles College - COMP - 201
Introductory case studyThe problem The most difficult part of any design project is understanding the task you are attempting You have been contacted to develop a computer system for a university library. The library currently uses a 1960s progr
Sveriges lantbruksuniversitet - CMPT - 379
CMPT-379 CompilersAnoop Sarkarhttp:/www.cs.sfu.ca/~anoop1Programming Languages and Formal Language Theory We ask the question: Does a particular formal language describe somekey aspect of a programming language Then we find out if that la
Sveriges lantbruksuniversitet - MACM - 300
MACM-300: Intro to Formal Languages and AutomataAnoop Sarkar anoop@cs.sfu.caCantors Theorem. |N | < |P (N )|. Proof (by contradiction). Note that equivalent sets have the same number of members. For innite sets we show equivalence between two set
East Los Angeles College - COMP - 201
Software TestingLecture 27&28Software Engineering, COMP201Slide 1Defect testingqTesting programs to establish the presence of system defectsSoftware Engineering, COMP201Slide 2Objectivesqq qqTo understand testing techniques tha
East Los Angeles College - COMP - 201
Verification and ValidationLecture 25 Lecture 26Software Engineering, COMP201Slide 1Verification and ValidationAssuring that a software system meets a user's needsSoftware Engineering, COMP201Slide 2ObjectivesqqqqTo introduce
East Los Angeles College - COMP - 201
Modeling based on Petri-nets.Lecture 81High-level Petri nets The classical Petri net was invented by Carl Adam Petri in 1962. A lot of research has been conducted (>10.000 publications). Until 1985 it was mainly used by theoreticians. Since
East Los Angeles College - COMP - 201
1Introducing ASMLEnumerations, Conditionals and Loops, Quantifiers Lecture 13 Software Engineering COMP201Min1 (s as Set of Integer) as Integer require s ne {}Logical Operators, Quantifiers and Sets2return any x | x in s where forall y in
East Los Angeles College - COMP - 308
Sorting networksEfficient Parallel Algorithms COMP308Sorting networksToday, we investigate sorting algorithms based on a comparison network model of computation in which many comparison operations can be performed simultaneously Sorting networ
East Los Angeles College - COMP - 201
COMP201Project ManagementIan Sommerville 2000Software Engineering, 6th edition. Chapter 4Slide 1Project managementqOrganising, planning and scheduling software projectsIan Sommerville 2000Software Engineering, 6th edition. Chapter 4
East Los Angeles College - COMP - 201
1Introducing ASMLMethods, Values, Constraints, Constants, Variables, Sets, Sequences Lecture 11, 12 Software Engineering COMP2012I. Methods Methods are named operations that may be invoked in various contexts The definition of a method may
Sveriges lantbruksuniversitet - CMPT - 825
% -*- LaTeX -*-% SCRIBE.STY - Make scribe notes%% Jeff Erickson (jeffe@cs.uiuc.edu) July 29, 1998%% Loosely based on the MIT/Berkeley scribe notes macros, but% written from scratch.% --% USAGE:%% \documentstyle[12pt]{report}NO
East Los Angeles College - COMP - 201
Architectural Design, Distributed Systems ArchitecturesLectures 17 and 18Ian Sommerville 2000Software Engineering, COMP201Slide 1Architectural Design - Establishing the overall structure of a software systemTopics covered: q System structu
East Los Angeles College - COMP - 201
Sort Quicksort Shortest PathsCOMP 201 Formal Specification with ASML. (Examples)SORT Algorithm(simple specification of the one-swap-at-a-time sorting algorithm)Sorting4 1 5 2 312345var A as Seq of Integer swap() choose i in {0.leng
Sveriges lantbruksuniversitet - MACM - 300
Regular Languages MACM 300 Formal Languages and AutomataAnoop Sarkarhttp:/www.cs.sfu.ca/~anoop The set of regular languages: each element is a regular language Each regular language is an example of a (formal) language, i.e. a set of stringse.g
East Los Angeles College - COMP - 201
MORE ON CLASS MODELSLecture 22Outline Aggregation and composition Roles Navigability Qualified association Derived association Constraints Association classes2Aggregation and composition Aggregation and composition are kinds of associ
Sveriges lantbruksuniversitet - CMPT - 755
CMPT 755 CompilersAnoop Sarkarhttp:/www.cs.sfu.ca/~anoopLexical Analysis Also called scanning, take input program string and convert into tokens Example: T_DOUBLE (double)double f = sqrt(-1);T_IDENT T_OP T_IDENT T_LPAREN T_OP T_INTCONSTANT T_
Sveriges lantbruksuniversitet - CMPT - 379
Decaf Language DefinitionAnoop Sarkar anoop@cs.sfu.caSeptember 10, 20071IntroductionThe programming assignments over the semester will build various components towards a working compiler for a programming language called Decaf. This documen
Sveriges lantbruksuniversitet - CMPT - 882
CMPT-882: Statistical Learning of Natural LanguageLecture #10Anoop Sarkar anoop@cs.sfu.ca http:/www.sfu.ca/anoop1 Unsupervised Learning of the Morphology of a Natural Language. John Goldsmith. 2001. Minimally Supervised Morphological Analys
East Los Angeles College - COMP - 320
SoftwareDevelopmentTools7COMP320 DrVladimirSazonov Ant:DatatypesandPropertiesThese slides are mainly based on Java Development with Ant - E. Hatcher & S.Loughran. Manning Publications, 2003AntDatatypesandProperties Now,aftergettingstartedinprev
East Los Angeles College - COMP - 208
COMP 208/214/215/216 Lecture12 ReportWritingReportWriting Almostallprojectsinvolvethewritingofa reportordissertationwhichcarriesthebulk ofthemarks. Yourprojectwillbejudgedonitsreport Themeritofaprojectwillnotberecognisedif thereportisbad Agood
East Los Angeles College - COMP - 208
Year 2 End Of Year Teaching Evaluation Questionnaire 2006 2007 The teaching was particularly stimulating?Please take a few moments to complete this teaching evaluation questionnaire. Use BLACK INK or DARK PENCIL only. Where handwritten answers are
East Los Angeles College - COMP - 211
PAPER CODE NO. COMP211EXAMINER : Peter McBurney DEPARTMENT : Computer ScienceTEL. NO. 794 6760JANUARY 2005 EXAMINATIONSBachelor of Science : Year 1 Bachelor of Science : Year 2 No qualification aimed for : Year 1INTERNET PRINCIPLESTIME ALL
East Los Angeles College - COMP - 211
East Los Angeles College - COMP - 211
COMP211 Internet Principles: Model Solutions: Jan 20051COMP211: Examination January 2005 Exam Setter: Peter McBurney Model Solutions Q1. (a) 5: Application Layer 4: Transport Layer 3: Network Layer 2: Data Link Layer 1: Physical Layer(b) Applic
East Los Angeles College - COMP - 211
COMP211: Internet Principles 2003 These are revision questions. Assignments 1 and 2. You should also revise the questions on1. Explain the 5-layer and 7-layer models of distributed communications. What function does each layer play? How do the two
Sveriges lantbruksuniversitet - NUSC - 344
NUSC 341 Set 2Solutions to problem set #21) Given nuclide of mass number A, radius is given by R r0 A1/3 where r0 is 1.30 fermi. For 103 Rh, R 1.30 (105)1/3 6.10 fermi a) Fast neutron cross-section is = 1.2 barn = 1.2 x 10 24 cm2 = R2 then d
Sveriges lantbruksuniversitet - NUSC - 344
SIMON FRASER UNIVERSITY NUSC - 344 Problem Set # 4 Due: Fri., Feb. 16, 20071. Estimate the temperature, size and age of the universe when it shifted from being radiationdominated to matter-dominated. 2. At high enough temperatures and densities p a
Sveriges lantbruksuniversitet - NUSC - 344
SIMON FRASER UNIVERSITY NUSC - 344 Problem Set # 5 Due: Friday, Feb. 23, 20071. The red shift is also a measure of the time since an event occurred; periods in the evolution of the universe are sometimes given by their redshifts.a.Calculate the
East Los Angeles College - COMP - 208
COMP208/214/215/216 Lecture3 PlanningWeeklyMeetingNotes ForDrMcBurney&DrWeber Emailsubmissionofminutesisfine ForProfessorBenchCapon Pleasesubmitinhardcopyformat. Office:Level3,ChadwickTower.Planning Planningisthekeytoasuccessfulproject It
East Los Angeles College - COMP - 208
COMP208/214/215/216 Lecture6 PresentationSkillsPresentationSkills Differenttypesofpresentation FormalPresentation largeaudience smallaudience InformalPresentation asagroup asanindividualNot done on this course: part of the 3rd year projec
East Los Angeles College - COMP - 208
COMP208/214/215/216 Lecture4 SoftwareQualityQuality Whatissoftwarequality? Onedefinition: Conformancetoexplicitlystatedfunctionaland performancerequirements,explicitlydocumented developmentstandards,andimplicit characteristicsthatareexpectedofal
East Los Angeles College - COMP - 208
COMP208/214/215/216 Lecture1IntroductionGroupSoftwareProjects PeterMcBurney(Room1.04) CourseCoordinator ProjectMonitor,Lecturer TrishLuntandWendyEngland (CentreforLifelongLearning) LecturersonGroupWorking BirgittaWeber ProjectMonitor(Roo
East Los Angeles College - COMP - 208
COMP208/214/215/216 Lecture5RequirementsWalkthroughRequirementsReview Meeting Thismeetingreviewstheoutputsofthe firstthreestepsofthemethodin ConnollyandBegg. Itwillreviewthe6itemsof documentationwhichshouldbe producedinthisphaseoftheproject Thi
East Los Angeles College - COMP - 211
PAPER CODE NO. COMP211EXAMINER : Peter McBurney DEPARTMENT : Computer ScienceTEL. NO. 794 6760JANUARY 2004 EXAMINATIONSBachelor of Science : Year 1 Bachelor of Science : Year 2 No qualification aimed for : Year 1INTERNET PRINCIPLESTIME ALL
East Los Angeles College - COMP - 211
COMP211 Internet Principles: Model Solutions: Jan 20071COMP211: Examination January 2007 Exam Setters: Peter McBurney (Questions 1-3) Tim Miller (Question 4) Darek Kowalski (Questions 5-7) Model Solutions QUESTION 1 (a) 5: Application Layer 4: Tr
East Los Angeles College - COMP - 211
COMP211: Examination January 2004 Exam Setter: Peter McBurney Model Solutions Q1. (a) 5: Application Layer 4: Transport Layer 3: Network Layer 2: Data Link Layer 1: Physical Layer (b) Application Layer: Transport Layer: Network Layer: Data Link Layer