Documents Found!
As seen in
Less Work, Better Grades
Join
Course Hero
Access
best resources
Ace
your classes
Ace your courses with Course Hero!

Submit your homework question or assignment here:
352 Tutors are online
 
*  Attach Assignment (optional):
 
Our current time in (CST) is
 
Study Smarter, Score Higher
View This Document For FREE!
 
Document Content (unformatted)
Course Hero has millions of student submitted documents similar to the one below including study guides, homework solutions, papers, exam answer keys and textbook solutions.
13 Chapter Stream Control Transmission Protocol Objectives Upon completion you will be able to: Be able to name and understand the services offered by SCTP Understand SCTP's flow and error control and congestion control Be familiar with the fields in a SCTP segment Understand the phases in an SCTP association Understand the SCTP state transition diagram TCP/IP Protocol Suite 1 Figure 13.1 TCP/IP protocol suite TCP/IP Protocol Suite 2 Note: SCTP is a message-oriented, reliable protocol that combines the good features of UDP and TCP. TCP/IP Protocol Suite 3 13.1 SCTP SERVICES We explain the services offered by SCTP to the application layer processes. The topics discussed in this section include: Process-to-Process Communication Multiple Streams Multihoming Full-Duplex Communication Connection-Oriented Service Reliable Service TCP/IP Protocol Suite 4 Table 13.1 Some SCTP applications TCP/IP Protocol Suite 5 Figure 13.2 Multiple-stream concept TCP/IP Protocol Suite 6 Note: An association in SCTP can involve multiple streams. TCP/IP Protocol Suite 7 Figure 13.3 Multihoming concept TCP/IP Protocol Suite 8 Note: SCTP association allows multiple IP addresses for each end. TCP/IP Protocol Suite 9 13.2 SCTP FEATURES We discuss the general features of SCTP and then compare them with those of TCP. The topics discussed in this section include: Transmission Sequence Number (TSN) Stream Identifier (SI) Stream Sequence Number (SSN) Packets Acknowledgment Number Flow Control Error Control Congestion Control TCP/IP Protocol Suite 10 Note: In SCTP, a data chunk is numbered using a TSN. TCP/IP Protocol Suite 11 Note: To distinguish between different streams, SCTP uses a SI. TCP/IP Protocol Suite 12 Note: To distinguish between different data chunks belonging to the same stream, SCTP uses SSNs. TCP/IP Protocol Suite 13 Figure 13.4 Comparison between a TCP segment and an SCTP packet TCP/IP Protocol Suite 14 Note: TCP has segments; SCTP has packets. TCP/IP Protocol Suite 15 Note: In SCTP, control information and data information are carried in separate chunks. TCP/IP Protocol Suite 16 Figure 13.5 Packet, data chunks, and streams TCP/IP Protocol Suite 17 Note: Data chunks are identified by three identifiers: TSN, SI, and SSN. TSN is a cumulative number identifying the association; SI defines the stream; SSN defines the chunk in a stream. TCP/IP Protocol Suite 18 Note: In SCTP, acknowledgment numbers are used to acknowledge only data chunks; control chunks are acknowledged by other control chunks if necessary. TCP/IP Protocol Suite 19 13.3 PACKET FORMAT We show the format of a packet and different types of chunks. An SCTP packet has a mandatory general header and a set of blocks called chunks. There are two types of chunks: control chunks and data chunks. The topics discussed in this section include: General Header Chunks TCP/IP Protocol Suite 20 Figure 13.6 SCTP packet format TCP/IP Protocol Suite 21 Note: In an SCTP packet, control chunks come before data chunks. TCP/IP Protocol Suite 22 Figure 13.7 General header TCP/IP Protocol Suite 23 Figure 13.8 Common layout of a chunk TCP/IP Protocol Suite 24 Note: Chunks need to terminate on a 32-bit (4 byte) boundary. TCP/IP Protocol Suite 25 Table 13.2 Chunks TCP/IP Protocol Suite 26 Note: The number of padding bytes are not included in the value of the length field. TCP/IP Protocol Suite 27 Figure 13.9 DATA chunk TCP/IP Protocol Suite 28 Note: A DATA chunk cannot carry data belonging to more than one message, but a message can be split into several chunks. The data field of the DATA chunk must carry at least one byte of data, which means the value of length field cannot be less than 17. TCP/IP Protocol Suite 29 Figure 13.10 INIT chunk TCP/IP Protocol Suite 30 Note: No other chunk be can carried in a packet that carries an INIT chunk. TCP/IP Protocol Suite 31 Figure 13.11 INIT ACK chunk TCP/IP Protocol Suite 32 Note: No other chunk can be carried in a packet that carries an INIT ACK chunk. TCP/IP Protocol Suite 33 Figure 13.12 COOKIE ECHO chunk TCP/IP Protocol Suite 34 Figure 13.13 COOKIE ACK TCP/IP Protocol Suite 35 Figure 13.14 SACK chunk TCP/IP Protocol Suite 36 Figure 13.15 HEARTBEAT and HEARTBEAT ACK chunks TCP/IP Protocol Suite 37 Figure 13.16 SHUTDOWN, SHUTDOWN ACK, and SHUTDOWN COMPLETE chunks TCP/IP Protocol Suite 38 Figure 13.17 ERROR chunk TCP/IP Protocol Suite 39 Table 13.3 Errors TCP/IP Protocol Suite 40 Figure 13.18 ABORT chunk TCP/IP Protocol Suite 41 13.4 AN SCTP ASSOCIATION SCTP, like TCP, is a connection-oriented protocol. However, a connection in SCTP is called an association to emphasize multihoming The topics discussed in this section include: Association Establishment Data Transfer Association Termination Association Abortion TCP/IP Protocol Suite 42 Note: A connection in SCTP is called an association. TCP/IP Protocol Suite 43 Figure 13.19 Four-way handshaking TCP/IP Protocol Suite 44 Note: No other chunk is allowed in a packet carrying an INIT or INIT ACK chunk. A COOKIE ECHO or a COOKIE ACK chunk can carry DATA chunks. TCP/IP Protocol Suite 45 Note: In SCTP, only DATA chunks consume TSNs; DATA chunks are the only chunks that are acknowledged. TCP/IP Protocol Suite 46 Figure 13.20 Simple data transfer TCP/IP Protocol Suite 47 Note: The acknowledgment in SCTP defines the cumulative TSN, the TSN of the last DATA chunk received in order. TCP/IP Protocol Suite 48 Figure 13.21 Association termination TCP/IP Protocol Suite 49 Figure 13.22 Association abortion TCP/IP Protocol Suite 50 13.5 STATE TRANSITION DIAGRAM To keep track of all the different events happening during association establishment, association termination, and data transfer, the SCTP software, like TCP, is implemented as a finite state machine. The topics discussed in this section include: Scenarios Simultaneous Close TCP/IP Protocol Suite 51 Figure 13.23 State transition diagram TCP/IP Protocol Suite 52 Table 13.4 States for SCTP TCP/IP Protocol Suite 53 Figure 13.24 A common scenario of states TCP/IP Protocol Suite 54 Figure 13.25 Simultaneous open TCP/IP Protocol Suite 55 Figure 13.26 Simultaneous close TCP/IP Protocol Suite 56 13.6 FLOW CONTROL Flow control in SCTP is similar to that in TCP. In SCTP, we need to handle two units of data, the byte and the chunk. The topics discussed in this section include: Receiver Site Sender Site A Scenario TCP/IP Protocol Suite 57 Figure 13.27 Flow control, receiver site TCP/IP Protocol Suite 58 Figure 13.28 Flow control, sender site TCP/IP Protocol Suite 59 Figure 13.29 Flow control scenario TCP/IP Protocol Suite 60 13.7 ERROR CONTROL SCTP uses a SACK chunk to report the state of the receiver buffer to the sender. Each implementation uses a different set of entities and timers for the receiver and sender sites. The topics discussed in this section include: Receiver Site Sender Site Sending Data Chunks Generating SACK Chunks TCP/IP Protocol Suite 61 Figure 13.30 Error control, receiver site TCP/IP Protocol Suite 62 Figure 13.31 Error control, sender site TCP/IP Protocol Suite 63 Figure 13.32 New state at the sender site after receiving a SACK chunk TCP/IP Protocol Suite 64 13.8 CONGESTION CONTROL SCTP uses the same strategies for congestion control as TCP. SCTP uses slow start, congestion avoidance, and congestion detection phases. SCTP also uses fast retransmission and fast recovery. The topics discussed in this section include: Congestion Control and Multihoming Explicit Congestion Notification TCP/IP Protocol Suite 65
Find millions of documents here - Study Guides, Homework Solutions, Papers, Exam Answer Keys and more. Course Hero has millions of course related materials that will enable you to learn better, faster and get an A in all your courses.
Below is a small sample set of documents:

St. Xavier >> ACSG >> 520 (Fall, 2009)
Chapter 18 Remote Login: Telnet Objectives Upon completion you will be able to: Understand how TELNET works Understand the role of NVT in a TELNET communication Understand TELNET option and suboption negotiation Know how control characters are...
St. Xavier >> ACSG >> 530 (Fall, 2009)
Chapter2 The OSI Model and the TCP/IP Protocol Suite Objectives Upon completion you will be able to: Understand the architecture of the OSI model Understand the layers of the OSI model and their functions Understand the architecture of the TCP/IP...
St. Xavier >> ACSG >> 530 (Fall, 2009)
Chapter 10 Internet Group Management Protocol Objectives Upon completion you will be able to: Know the purpose of IGMP Know the types of IGMP messages Understand how a member joins a group and leaves a group Understand membership monitoring U...
St. Xavier >> ACSG >> 530 (Fall, 2009)
Chapter14 Unicast Routing Protocols: RIP, OSPF, and BGP Objectives Upon completion you will be able to: Distinguish between intra and interdomain routing Understand distance vector routing and RIP Understand link state routing and OSPF Understan...
St. Xavier >> ACSG >> 530 (Fall, 2009)
Chapter15 Multicasting and Multicast Routing Protocols Objectives Upon completion you will be able to: Differentiate between a unicast, multicast, and broadcast message Know the many applications of multicasting Understand multicast link state ro...
St. Xavier >> ACSG >> 530 (Fall, 2009)
Chapter 5 IP Addresses: Classless Addressing Objectives Upon completion you will be able to: Understand the concept of classless addressing Be able to find the first and last address given an IP address Be able to find the network address give...
St. Xavier >> CMPSC >> 245 (Fall, 2009)
Chapter 3 Assembly Language: Part 1 Machine language program (in hex notation) from Chapter 2 Symbolic instructions To make machine instructions more readable (to humans), lets substitute mnemonics for opcodes, and decimal numbers for binary addre...
St. Xavier >> ACSG >> 520 (Fall, 2009)
Chapter 21 Network Management: SNMP Objectives Upon completion you will be able to: Understand the SNMP manager and the SNMP agent Understand the roles of SMI and MIB in network management Be familiar with SMI object attributes and encoding met...
St. Xavier >> ACSG >> 530 (Fall, 2009)
Chapter 7 ARP and RARP Objectives Upon completion you will be able to: Understand the need for ARP Understand the cases in which ARP is used Understand the components and interactions in an ARP package Understand the need for RARP TCP/IP Prot...
St. Xavier >> ACSG >> 520 (Fall, 2009)
Chapter19 File Transfer: FTP and TFTP Objectives Upon completion you will be able to: Understand the connections needed for FTP file transfer Be familiar with FTP commands and responses Know the differences between FTP and TFTP Be familiar with ...
St. Xavier >> ACSG >> 520 (Fall, 2009)
Chapter 20 Electronic Mail: SMTP, POP, and IMAP Objectives Upon completion you will be able to: Understand four configurations of email architecture Understand the functions and formats of a user agent Understand MIME and its capabilities and d...
St. Xavier >> ACSG >> 530 (Fall, 2009)
Chapter 9 Internet Control Message Protocol Objectives Upon completion you will be able to: Be familiar with the ICMP message format Know the types of error reporting messages Know the types of query messages Be able to calculate the ICMP chec...
St. Xavier >> ACSG >> 520 (Fall, 2009)
Chapter16 Host Configuration: BOOTP and DHCP Objectives Upon completion you will be able to: Know the types of information required by a system on boot-up Know how BOOTP operates Know how DHCP operates Understand the differences between BOOTP an...
St. Xavier >> WEB >> 321 (Fall, 2009)
CMPSC 321 Week 11/5 Class & Topic Schedule Monday Fall 2007 Wednesday Ch. 5 ER Modeling Review HW8: 5.59, 5.60, 5.62, 5.64, 5.65 Ch. 6 ER models to database design In-class: sample - 6.51, 6.52, 6.54, 6.56, 6.57 HW8 due Wed: Marcias Dry Clean...
St. Xavier >> WEB >> 550 (Fall, 2009)
ACSG550 1. Lab Assignment Fall 2007 Create a form in which the user is prompted to enter a file name (and path) they\'d like to locate. If the file can be found, display its size and other interesting information about it (see the list in the hand-...
St. Xavier >> WEB >> 550 (Fall, 2009)
ACSG 550 Database-Backed Websites Saint Xavier University Masters in Applied Computer Science Program Fall 2007 Course Description: This course focuses on the design, construction and implementation of websites that rely on databases to provide d...
St. Xavier >> CMPSC >> 245 (Fall, 2009)
Lab assignment: Use the circuit system shown in figure 1.15 on page 29 to solve the equations in the first column in the following table. Show the values of all flags after you solve each equation. Equation 7+8 9+8 8-7 7-9 6+1 -6-5 7+5 5-7 Signed/ ...
St. Xavier >> CMPSC >> 245 (Fall, 2009)
LAB # 5 CMPSC 245, SPRING 2007 Due: April 26, 2007 Objectives Use a simulator that simulates a simple PC called H1. H1 will run on our regular machine. H1 will help students understand the fundamentals of computer architecture. Understand th...
St. Xavier >> WEB >> 321 (Fall, 2009)
CMPSC 321 - Test 2 Review Topics Fall 2007 Chapter 5 Data Modeling with the ER Model Entity class/entity instance Attribute Identifier/composite identifier Relationship class/relationship instance Unary/binary/ternary Maximum cardinalities 1:1, 1:N...
St. Xavier >> HWK >> 1 (Fall, 2009)
<html> <head> <title>District 129</title> </head> <body> <align=\"center\"><bold><h1>School Supplies for District 129</h1></bold></center> <p>Please purchase: <hr></hr> <br> <ul> <li>2 blue pens</li> <li>4 pencils</li> <li>6 notebooks</li> <li>1 penci...
St. Xavier >> CMPSC >> 245 (Fall, 2009)
whatsnew.txt H1 Software Package Version 6.0 What\'s New Since Version 4.0 May 11, 2006 == Updating the textbook with errata.txt Be sure to ...
St. Xavier >> CMPSC >> 201 (Fall, 2009)
8 6 6 3 4 8 1 8 9 8 1 5 9 8 4 10 9 1 10 4 6 8 1 6 5 3 7 7 3 3 9 9 6 10 10 3 7 10 3 6 2 10 7 1 6 2 2 8 3 1 3 4 4 10 10 5 3 2 2 7 5 5 8 4 7 3 2 6 1 5 10 3 8 4 3 10 ...
St. Xavier >> CMPSC >> 201 (Fall, 2009)
Chapter 2 Problem Solving What is an algorithm? s A solution to a problem that is: Precise Effective Terminating What does a programmer do? s s s s s s Understand the problem specification Develop a detailed logical plan (algorithm) for so...
St. Xavier >> CMPSC >> 201 (Fall, 2009)
Functions Section 4.3 Last week, we were introduced to procedures Procedures are used in support of topdown program design. They are used to create modules within our Visual Basic programs. A typical program design - 1 P ro g ra m In p u t P r o...
St. Xavier >> CMPSC >> 201 (Fall, 2009)
Chapter 4 (cont) Sec. 4.1, 4.2, 4.4 Procedures (User-defined) Well-designed programs. l consist of highly modular code l have procedures that pass data between them q q data is passed to & from the calling procedure in the form of arguments a pro...
St. Xavier >> CMPSC >> 201 (Fall, 2009)
Chapter 3 (ctd) Section 3.2 EVENTS Three stages in the creation of a Visual Basic program: Create the interface ie, choose & create the objects use the properties window of each object Set the objects\' properties Create the code to respond t...
St. Xavier >> CMPSC >> 201 (Fall, 2009)
Introduction to Arrays Chapter 7 Why use arrays? To store & represent lists of homogeneous values To simplify program code To eliminate the need to reread data The kinds of problems that benefit from array representation of data Roll a die (6 s...
St. Xavier >> CMPSC >> 201 (Fall, 2009)
Section 3.6 BUILT-IN FUNCTIONS involving numbers returns a unique output value n = L...
St. Xavier >> CMPSC >> 201 (Fall, 2009)
Section 3.5 - Schneider This section introduces nice ways to produce input & display output: Input boxes Message boxes Input Boxes (Section 3.5) An input box is an object that appears on the form solely for the purpose of receiving data to ...
St. Xavier >> CMPSC >> 201 (Fall, 2009)
REPETITION (loops or iteration) Schneider: Sec. 6.1 over & over again. There are three types of loops in Visual Basic While entrance controlled Until exit cont...
St. Xavier >> CMPSC >> 201 (Fall, 2009)
Decisions (Conditional Programming) Chapter 5 (Sec. 5.1 & 5.2) Most programs make many decisions This is called programming logic Condition Action Action Conditional statements A condition is an expression that evaluates to true or false It in...
St. Xavier >> CMPSC >> 201 (Fall, 2009)
Chapter 6 More on looping We have three types of loops: While - entrance-controlled Until - exit controlled For.Next - counting Questions to ask about loops Will they terminate? Initialization of variables involved in condition Updating of th...
St. Xavier >> CMPSC >> 201 (Fall, 2009)
Chapter 3 (ctd) Sections 3.3 - 3.5 (partial) Input/Output NUMBERS & STRINGS The basic arithmetic operations (for now.) + , , *, /, ^ ( ) ^ (or *) *, / +, order of precedence: Using PICTURE BOXES to display numeric values (Output) First,...
St. Xavier >> CMPSC >> 201 (Fall, 2009)
Welcome to CS201! Introduction to Programming Using Visual Basic Preliminaries Syllabus Windows 2000 folders/directories (Sec. 1.3) Introduction to Visual Basic (Sec. 1.4) Algorithm development & foundat...
St. Xavier >> CMPSC >> 201 (Fall, 2009)
Chapter 4 Sec. 4.1, 4.2, 4.4 Procedures (User-defined) Modular, Top-Down or Structured Program Design lBreak the problem to be solved into discrete tasks: Ex: Read input Perform calculations Display output lCreate a user-defined (general) procedur...
St. Xavier >> CMPSC >> 201 (Fall, 2009)
Chapter 3 (Section 3.1) Fundamentals of Programming in Visual Basic Objects Visual Basic OBJECTS Forms are designed by the Visual Basic programmer and become graphical user interfaces (gui\'s) for users of the program. Controls such as boxes, bu...
St. Xavier >> ACSG >> 5 (Fall, 2009)
5.1 JavaScript Execution Environment - The JavaScript Window object represents the window in which the browser displays documents - The Window object provides the largest enclosing referencing environment for scripts - Its properties are visible to a...
St. Xavier >> ACSG >> 540 (Fall, 2009)
5.1 JavaScript Execution Environment - The JavaScript Window object represents the window in which the browser displays documents - The Window object provides the largest enclosing referencing environment for scripts - Its properties are visible to a...
St. Xavier >> CHAPTER >> 540 (Fall, 2009)
5.1 JavaScript Execution Environment - The JavaScript Window object represents the window in which the browser displays documents - The Window object provides the largest enclosing referencing environment for scripts - Its properties are visible to a...
St. Xavier >> ACSG >> 541 (Fall, 2009)
DEPARTMENT OF MATHEMATICS AND COMPUTER SCIENCE ACSG 541 Prerequisite: Description: Programming for the Web II Spring 2004 ACSG 540 This course is designed as an introduction to Internet applications in java. All students will study exception handlin...
St. Xavier >> CMPSC >> 360 (Fall, 2009)
DEPARTMENT OF MATHEMATICS AND COMPUTER SCIENCE CMPSC 360 Special Topics: Java Applets Prerequisite: CMPSC 311 Description: Java applets will be studied in detail. Topics will include graphical programming, widgets, containers, layouts, menus, and eve...
St. Xavier >> CMPSC >> 201 (Fall, 2009)
CS201 Introduction to Programming (4) with Visual Basic Saint Xavier University Department of Mathematics and Computer Science Fall 2002 Prerequisite Description Math 099 or equivalent. This course introduces the student to graphical user interfa...
St. Xavier >> CMPSC >> 202 (Fall, 2009)
DEPARTMENT OF MATHEMATICS AND COMPUTER SCIENCE SAINT XAVIER UNIVERSITY CMPSC 202 Prerequisite: Description: Principles of Programming I Fall 2005 Math 112, CMPSC 201 This is the second course in the basic programming sequence for computer science ma...
St. Xavier >> CMPSC >> 228 (Fall, 2009)
PROJECTS 4 HROUGH 5 STUDENT FILES to accompany JAVASCRIPT COMPLETE CONCEPTS AND TECHNIQUES SHELLY CASHMAN SERIES The JavaScript Data Disk contains the files required to complete some of the projects and exercises in Projects 4 through 5. As you step ...
St. Xavier >> CMPSC >> 201 (Fall, 2009)
Microsoft Visual Basic 2005: Reloaded Second Edition Chapter 5 Repeating Program Instructions Objectives Write loops using For.Next and Do.Loop Display a dialog box using the InputBox function Include a list box and a combo box in an interface I...
St. Xavier >> WEB >> 550 (Fall, 2009)
Introduction to php Chapter 1 ACSG 550 What we will be doing. Developing fullservice websites with dynamic content support for user interaction client and serverside processing underlying databases We are using php and mysql php A scripting...
St. Xavier >> WEB >> 550 (Fall, 2009)
SQL Components of SQL Data definition language (DDL) To create database structures To enforce constraints etc. Data manipulation language (DML) To access data Authorization language To grant privileges to users SQL supports dynamic databa...
St. Xavier >> CMPSC >> 321 (Fall, 2009)
David M. Kroenkes Database Processing: Fundamentals, Design, and Implementation Chapter One: Introduction Part One DAVID M. KROENKES DATABASE PROCESSING, 10th Edition 2006 Pearson Prentice Hall 1-1 Chapter Objectives To understand the nature and...
St. Xavier >> CMPSC >> 321 (Fall, 2009)
David M. Kroenkes Database Processing: Fundamentals, Design, and Implementation Chapter Eight: Database Redesign DAVID M. KROENKES DATABASE PROCESSING, 10th Edition 2006 Pearson Prentice Hall 8-1 Need For Database Redesign Database redesign is n...
St. Xavier >> WEB >> 321 (Fall, 2009)
Chapter Five Data Modeling with the Entity-Relationship Model 5-1 The Data Model A data model is a plan, or blueprint, for a database design. It is more generalized & abstract than a database design. It is easier to change a conceptual data mode...
St. Xavier >> CMPSC >> 321 (Fall, 2009)
David M. Kroenkes Database Processing: Fundamentals, Design, and Implementation Chapter Two: Introduction to Structured Query Language Part One DAVID M. KROENKES DATABASE PROCESSING, 10th Edition 2006 Pearson Prentice Hall 2-1 Structured Query Lan...
St. Xavier >> WEB >> 321 (Fall, 2009)
David M. Kroenkes Database Processing: Fundamentals, Design, and Implementation Chapter Three: The Relational Model and Normalization DAVID M. KROENKES DATABASE PROCESSING, 10th Edition 2006 Pearson Prentice Hall 3-1 Chapter Premise We have rece...
St. Xavier >> CMPSC >> 321 (Fall, 2009)
David M. Kroenkes Database Processing: Fundamentals, Design, and Implementation Chapter Three: The Relational Model and Normalization DAVID M. KROENKES DATABASE PROCESSING, 10th Edition 2006 Pearson Prentice Hall 3-1 Chapter Premise We have rece...
St. Xavier >> WEB >> 321 (Fall, 2009)
David M. Kroenke\'s Database Processing: Fundamentals, Design, and Implementation DAVID M. KROENKE\'S DATABASE PROCESSING, 10th Edition 2006 Pearson Prentice Hall Chapter Five: Data Modeling with the Entity-Relationship Model Part Three 5-1 Mixed...
St. Xavier >> WEB >> 321 (Fall, 2009)
David M. Kroenkes Database Processing: Fundamentals, Design, and Implementation DAVID M. KROENKES DATABASE PROCESSING, 10th Edition 2006 Pearson Prentice Hall Chapter Five: Data Modeling with the Entity-Relationship Model Part Two 5-1 Strong En...
St. Xavier >> WEB >> 321 (Fall, 2009)
CMPSC 321 - Relational Database Theory and Design - FALL 2007 Saint Xavier University Course Description: Prerequisite: One programming course. This course introduces the student to relational databases. Topics include the relational and object- re...
St. Xavier >> CHAPTER >> 10 (Fall, 2009)
A sample file used for demonstration of ColdFusion\'s upload capabilities....
St. Xavier >> CHAPTER >> 10 (Fall, 2009)
This is a file named charlies_resume.doc. ...
St. Xavier >> CHAPTER >> 05 (Fall, 2009)
INSERT INTO Customers (ClientName, ClientEmail, CurrentResidence, Criteria, Comments) VALUES (\'Ruth Francis\', \' FrancisR@myMail.com \', \'Own\', \'Price\', \' I start my job here next month. I am in a hurry.\') ; INSERT INTO REQUESTS (CustomerID, ScheduleD...
St. Xavier >> CHAPTER >> 05 (Fall, 2009)
SELECT Properties.PropertyID, Agents.FirstName Agents.MiddleInitial Agents.LastName AS AgentName FROM Properties, Agents WHERE Properties.AgentID = Agents.AgentID AND Agents.LastName = \'Petrie\'; SELECT Properties.PropertyID, Proper...
St. Xavier >> CHAPTER >> 05 (Fall, 2009)
SELECT Agents.LastName, COUNT(*) AS NumProperties FROM Properties, Agents WHERE Properties.AgentID = Agents.AgentID GROUP BY Agents.LastName ; SELECT Agents.LastName, AVG(Properties.Price) AS Average, MAX(Properties.Price) AS Maximum, MIN(Prope...
St. Xavier >> CHAPTER >> 05 (Fall, 2009)
SELECT PropertyID FROM Properties ; SELECT PropertyID, Location FROM Properties WHERE Location = \'Cedar Rapids\'; SELECT PropertyID, Location FROM Properties WHERE Location IN (\'Cedar Falls\', \'Waterloo\'); SELECT PropertyID, Price, NumBedrooms FR...
St. Xavier >> CHAPTER >> 05 (Fall, 2009)
SELECT PropertyID, Price * 0.07 AS PotCommission FROM Properties WHERE PropertyID = \'NIK4589\' ; SELECT PropertyID, Price * 0.07 * 0.65 AS AgentCommission, LastName FROM Properties, Agents WHERE Properties.AgentID = Agents.AgentID AND PropertyID ...
St. Xavier >> CHAPTER >> 05 (Fall, 2009)
INSERT INTO Properties (PropertyID, TypeOfHouse, YearBuilt, NumBedrooms, NumBathrooms, Area, Rooms, OtherFeatures, Price, Location, ZipCode, ImageFilename, AgentID) VALUES (\'NIK4878\', \'two-story home\', 1975, 3, 2.5, 2100, \'master bedroom,laundry room...
St. Xavier >> CHAPTER >> 10 (Fall, 2009)
A sample file used for demonstration of ColdFusion\'s upload capabilities.This is a multi-line string that is being appended to the sample.txt file. ...
St. Xavier >> CS >> 111 (Fall, 2009)
Exploring Microsoft Office 2003 Getting Started with Windows XP Robert Grauer and Maryann Barber Committed to Exploring Office 2003 - Grauer and Barber of IT Experts. Shaping the Next Generation 1 Objectives (1 of 2) Describe the Windows...
St. Xavier >> CH >> 3 (Fall, 2009)
8 April 2003 Rola Othman Pat Wiseman Mary Gleason Database Presentation using Java Labs 1. Use Chapter 3 in your Gittleman folder. 2. Open your command prompt and change directories until you get to the database directory (Chapter 3). Lab 1 Creatin...
St. Xavier >> CYBERENG >> 06 (Fall, 2009)
Peer Edit with Perfection! Tutorial Peer Editing is Fun! Working with your classmates to help improve their writing can be lots of fun. But first, you have to learn what it means to \"peer edit\" and how to do it! What is Peer Editing? A peer is som...
St. Xavier >> ENGLISH >> 373 (Fall, 2009)
JANUARY 2004 200420021999 CLASSROOM NOTES PLUS 1 TABLE OF CONTENTS Ideas from the Classroom How Things Aren\'t-Daniel Sullivan Using Poetry to Enhance Reading and Writing -Alisha L. Vincent Showing, Not Telling-Bonnie Dodge First Things First: Deve...
St. Xavier >> STF >> 06 (Fall, 2009)
From d.burban at mail1.sxu.edu Mon Jan 22 15:06:35 2007 From: d.burban at mail1.sxu.edu (Diana M. Burban) Date: Mon, 22 Jan 2007 15:06:35 -0600 Subject: [Stf06] Contact info for Lincolnway Message-ID: <200701221506.AA193855656@mail.sxu.edu> I think...
What are you waiting for?
View This Document For FREE!