4 Pages

hw5problem

Course: CS 07, Fall 2009
School: Uni. Worcester
Rating:
 
 
 
 
 

Word Count: 1069

Document Preview

Homework CS3431 5 (Fall 2007, B term) Homework Out: Monday, Nov 26th, 2007 (in class) Homework Due: Monday, Dec 3rd , 2007 at 9:59 am (at start of class) Homework Submit: Complete in hardcopy at start of class Monday (and, SQL portion also via MYWPI )! Homework Maximum Points: 70 pts Problem 1. [20pts ] SELECTCandD ( Relation R ) = SELECTC ( Relation R ) INTERSECT SELECTD ( Relation R ). Here C and D are two...

Register Now

Unformatted Document Excerpt

Coursehero >> United Kingdom >> Uni. Worcester >> CS 07

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.
Homework CS3431 5 (Fall 2007, B term) Homework Out: Monday, Nov 26th, 2007 (in class) Homework Due: Monday, Dec 3rd , 2007 at 9:59 am (at start of class) Homework Submit: Complete in hardcopy at start of class Monday (and, SQL portion also via MYWPI )! Homework Maximum Points: 70 pts Problem 1. [20pts ] SELECTCandD ( Relation R ) = SELECTC ( Relation R ) INTERSECT SELECTD ( Relation R ). Here C and D are two arbitrary conditions on R. Does the above equivalence hold for SETS? Explain why you think it holds, or give a counterexample to show that it does not hold. SELECTCandD ( Relation R ) = SELECTC ( Relation R ) INTERSECT SELECTD ( Relation R ). Here C and D are two arbitrary conditions on R. Does the above equivalence hold for BAGS ? Explain why you think it holds, or give a counterexample to show that it does not hold. SELECTCorD ( Relation R ) = SELECTC ( Relation R ) UNION SELECTD ( Relation R ). Here C and D are two arbitrary conditions on R. Does the above equivalence hold for SETS? Explain why you think it holds, or give a counterexample to show that it does not hold. SELECTCorD ( Relation R ) = SELECTC ( Relation R ) UNION SELECTD ( Relation R ). Here C and D are two arbitrary conditions on R. Does the above equivalence hold for BAGS ? Explain why you think it holds, or give a counterexample to show that it does not hold. The antisemijoin R anti 1 S is dened to correspond to the bag of tuples in R that do not agree with any tuple in S in the attributes common to R and S. Give a relational algebra expression equivalent to R anti 1 S. Explain your answer briey. An unary operator f is said to be idempotent if for all relations R, f (f (R)) = f (R). That is, applying f more than once is the same as applying it once. Which of the following operators are idempotent? Either explain why or give a counter example. (a) S with S some new relation name, (b) the duplicate removal operator , (c) the project operator L with L some attribute of the relation, and (d) the sort operator L with L some attribute of the relation to be sorted on. Problem 2. [30 pts] Consider the database schema below (the key elds are underlined). There are foreign keys connecting all three product-type relations to the Product relation. Product(manufacturer, model, type) PC(model, speed, ram, hd, rd, price) Laptop(model, speed, ram, hd, screen, price) Printer(model, color, type, price) The Product relation gives the manufacturer, model number and type (either PC or Laptop) of various products. The PC relation gives for each model number that is a PC the speed of processor (in megahertz), the amount of RAM (in megabytes), the size of hard disk (in gigabytes), the speed and type of the removable disk (CD or DVD), and the price (in $). The Laptop relation is similar except that the screen size is recorded in place of information about the removable disk. The Printer relation captures the color (yes/no), the type, and price for each printer model. Some sample data are shown below. manufacturer A A A B B B C C C C model 1001 2002 2003 1002 1003 2004 5001 5002 6001 6002 type PC Laptop Laptop PC PC Laptop Printer Printer Printer Printer Table 1: Sample data for Product model 1001 1002 1003 speed 700 1500 700 ram 64 128 64 hd 10 60 10 rd 48xCD 12xDVD 8xDVD price 799 2499 899 Table 2: Sample data for PC model 2002 2003 2004 speed 600 800 850 ram 64 96 64 hd 5 10 10 screen 12.1 15.1 15.1 price 1488 2584 1999 Table 3: Sample data for Laptop model 5001 5002 6001 6002 color no yes no yes type InkJet InkJet LaserWriter LaserPrinter price 300 350 600 1000 Table 4: Sample data for Printer (a) Write the following queries in SQL. (b) Test them on our given data set (which we will be providing to you on the course web site), and submit your results for running each of your queries on our data set. (c) Design a second testing data set, explain what queries or cases you are testing for in your own data set, in particular, if there are cases in our data set that were missed. (d) Again submit your data set and matching results for the same queries now run on your second data set. You need to submit your SQL queries as usual (via MYWPI). You should put all your SQL statements into one le (say, myqueries.sql) and the output of sqlplus (using command spool in sqlplus) into another le say myresults.txt, illustrating the results you got on our test data. Note that we may decide to create our own separate testing le, when we grade your homework, which we then would use to further test out your queries. So make sure your queries work in general, and not just for some particular data. 1. Find the manufacturer of the product (PCs and Laptops) with the lowest price. (Note: there could be multiple products with this same lowest price). 2. Find the model number, speed and hard-disk size for all PCs whose price is below $2000, and rename the speed column to megahertz and the hd column to gigabytes. 3. Find the manufacturers that make at least three dierent models ...

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:

Uni. Worcester - CS - 3431
CS3431 Homework 5 (Fall 2007, B term)Homework Out: Monday, Nov 26th, 2007 (in class) Homework Due: Monday, Dec 3rd , 2007 at 9:59 am (at start of class) Homework Submit: Complete in hardcopy at start of class Monday (and, SQL portion also via MYWPI
Uni. Worcester - CS - 07
Installing a Web Server1. Install a sample web server, which supports Servlets/JSPs. A light weight web serveris Apache Tomcat server. You can get the server fromhttp:/tomcat.apache.org/2. Follow the installation directions and install the serv
Uni. Worcester - CS - 3431
Installing a Web Server1. Install a sample web server, which supports Servlets/JSPs. A light weight web serveris Apache Tomcat server. You can get the server fromhttp:/tomcat.apache.org/2. Follow the installation directions and install the serv
Uni. Worcester - CS - 07
CS3431 Homework 6 (Fall 2007, B term)Homework Homework Homework Homework Homework Out: Monday, Dec 3rd, 2007 Due: Monday, Dec 10th , 2007 at 9:59 am (at start of class) Submit: Submit in hardcopy at start of class Monday. Submit: SQL portions must a
Uni. Worcester - CS - 3431
CS3431 Homework 6 (Fall 2007, B term)Homework Homework Homework Homework Homework Out: Monday, Dec 3rd, 2007 Due: Monday, Dec 10th , 2007 at 9:59 am (at start of class) Submit: Submit in hardcopy at start of class Monday. Submit: SQL portions must a
Uni. Worcester - CS - 07
CS542 EXAMPLE EXAMElke A. RundensteinerExample ExaminationAllocated Time: 100 minutes Maximum Points: 250 STUDENT NAME:General Instructions: This test is a closed book exam (besides one cheat sheet). Write your answers in the space provide
Uni. Worcester - CS - 3431
CS542 EXAMPLE EXAMElke A. RundensteinerExample ExaminationAllocated Time: 100 minutes Maximum Points: 250 STUDENT NAME:General Instructions: This test is a closed book exam (besides one cheat sheet). Write your answers in the space provide
Uni. Worcester - CS - 07
CS3431 Database Systems IProject OverviewOne continuous course projectDescription: Envision a database application, and implement it fully. Teaming : Teams of 2 students each Grading : Collect points over the phasesMurali ManiCS34311CS34
Uni. Worcester - CS - 3431
CS3431 Database Systems IProject OverviewOne continuous course projectDescription: Envision a database application, and implement it fully. Teaming : Teams of 2 students each Grading : Collect points over the phasesMurali ManiCS34311CS34
Uni. Worcester - CS - 07
CS3431 Database Systems ILogisticsInstructor: Murali Mani mmani@cs.wpi.eduWhat will we learn in this course?Database DesignRepresent application requirements in conceptual model (ER, Entity Relationship Model) Translate an ER schema to relatio
Uni. Worcester - CS - 3431
CS3431 Database Systems ILogisticsInstructor: Murali Mani mmani@cs.wpi.eduWhat will we learn in this course?Database DesignRepresent application requirements in conceptual model (ER, Entity Relationship Model) Translate an ER schema to relatio
Uni. Worcester - CS - 07
CS3431: Pro*C/Oracle Instruction1 Setup1. To use Pro*C, you must connect to CCC.WPI.EDU 2. Setup Pro*C: source /usr/local/bin/mngoraenv which defines the library path. 3. Setup Oracle: Put the following into your ~/.cshrc file setenv ORACLE_BASE /u
Uni. Worcester - CS - 3431
CS3431: Pro*C/Oracle Instruction1 Setup1. To use Pro*C, you must connect to CCC.WPI.EDU 2. Setup Pro*C: source /usr/local/bin/mngoraenv which defines the library path. 3. Setup Oracle: Put the following into your ~/.cshrc file setenv ORACLE_BASE /u
Uni. Worcester - CS - 07
CS3431 Homework 4 (Fall 2007, B term)Homework Out: Monday, Nov 12th, 2007 Homework Due: Thursday, Nov 15th, 2007 at 9:59 am (BEFORE CLASS) Homework Points: A maximum of 100 pts. NOTE. This homework is optional. That is, it will be graded and then ex
Uni. Worcester - CS - 3431
CS3431 Homework 4 (Fall 2007, B term)Homework Out: Monday, Nov 12th, 2007 Homework Due: Thursday, Nov 15th, 2007 at 9:59 am (BEFORE CLASS) Homework Points: A maximum of 100 pts. NOTE. This homework is optional. That is, it will be graded and then ex
Uni. Worcester - CS - 07
CS3431 Homework 3 (Fall 2007, B term)Homework Homework Homework Homework Out: Tuesday, Nov 6th, 2007 (in class) Due: Monday, Nov 12th, 2007 at 9:59 am (before class) Submit: In hardcopy at start of class Monday! Points: A maximum of 100 pts.Proble
Uni. Worcester - CS - 3431
CS3431 Homework 3 (Fall 2007, B term)Homework Homework Homework Homework Out: Tuesday, Nov 6th, 2007 (in class) Due: Monday, Nov 12th, 2007 at 9:59 am (before class) Submit: In hardcopy at start of class Monday! Points: A maximum of 100 pts.Proble
Uni. Worcester - CS - 07
CS3431: SQLJ / Oracle Programming Instruction1 SetupPut the following lines into your .cshrc file on ccc. This will set up both Oracle and SQLJ environment.setenv ORACLE_BASE /usr/local/oracle/app/oracle setenv ORACLE_HOME ${ORACLE_BASE}/product/9
Uni. Worcester - CS - 3431
CS3431: SQLJ / Oracle Programming Instruction1 SetupPut the following lines into your .cshrc file on ccc. This will set up both Oracle and SQLJ environment.setenv ORACLE_BASE /usr/local/oracle/app/oracle setenv ORACLE_HOME ${ORACLE_BASE}/product/9
Uni. Worcester - CS - 07
CS3431 Homework 1 (Fall 2007, B term)Homework Homework Homework Homework Out: Friday, Oct 26, 2007 (in class) Due: Monday, Nov 2nd, 2007 at 9:59 am (before class) Submit: In hardcopy at start of class Monday! Points: A maximum of 50 pts.Problem: G
Uni. Worcester - CS - 3431
CS3431 Homework 1 (Fall 2007, B term)Homework Homework Homework Homework Out: Friday, Oct 26, 2007 (in class) Due: Monday, Nov 2nd, 2007 at 9:59 am (before class) Submit: In hardcopy at start of class Monday! Points: A maximum of 50 pts.Problem: G
Uni. Worcester - CS - 07
CS3431 Homework 2 (Fall 2007, B term)Homework Due: Tuesday, Nov 6th, 2007 at 9:59 am (before class) Homework Submit: In hardcopy at start of class Tuesday! Homework Points: A maximum of 100 pts. Note: This homework is to be done by each student indi
Uni. Worcester - CS - 3431
CS3431 Homework 2 (Fall 2007, B term)Homework Due: Tuesday, Nov 6th, 2007 at 9:59 am (before class) Homework Submit: In hardcopy at start of class Tuesday! Homework Points: A maximum of 100 pts. Note: This homework is to be done by each student indi
Uni. Worcester - CS - 07
The EntityRelationship ModelPart I.CS34311Database Design StagesApplication RequirementsConceptual Design Conceptual Schema Logical Design Logical Schema Physical Design Physical SchemaCS3431 2Conceptual Design Whatis Conceptual Desi
Uni. Worcester - CS - 3431
The EntityRelationship ModelPart I.CS34311Database Design StagesApplication RequirementsConceptual Design Conceptual Schema Logical Design Logical Schema Physical Design Physical SchemaCS3431 2Conceptual Design Whatis Conceptual Desi
Uni. Worcester - CS - 07
Translating ER Schema to Relational ModelOther ER ConstructsCS34311Weak entity types: ExampledNumberdNamecNumbercName(0, *)DeptOffers(1, 1)Coursecs34312Weak entity types Consider weak entity type EA relation for E,
Uni. Worcester - CS - 3431
Translating ER Schema to Relational ModelOther ER ConstructsCS34311Weak entity types: ExampledNumberdNamecNumbercName(0, *)DeptOffers(1, 1)Coursecs34312Weak entity types Consider weak entity type EA relation for E,
Uni. Worcester - CS - 07
SQL : Query LanguageCS3431SELECT-FROM-WHERESELECT * FROM Student WHERE sName="Greg" AND address="320 FL" StudentsNumber 1 2 3 sName Dave Greg Matt address 311FL 320FL 320FL professor MM MM ER sNumber 2 sName Greg address 320FL professor MMCS3
Uni. Worcester - CS - 3431
SQL : Query LanguageCS3431SELECT-FROM-WHERESELECT * FROM Student WHERE sName="Greg" AND address="320 FL" StudentsNumber 1 2 3 sName Dave Greg Matt address 311FL 320FL 320FL professor MM MM ER sNumber 2 sName Greg address 320FL professor MMCS3
Uni. Worcester - CS - 07
The Relational ModelCS34311Why Relational Model? Currentlythe most widely usedVendors: Oracle, Microsoft, IBM Oldermodels still used competitionsIBM's IMS (hierarchical model) Object Oriented Model: ObjectStore, Oracle? Recent
Uni. Worcester - CS - 3431
The Relational ModelCS34311Why Relational Model? Currentlythe most widely usedVendors: Oracle, Microsoft, IBM Oldermodels still used competitionsIBM's IMS (hierarchical model) Object Oriented Model: ObjectStore, Oracle? Recent
Uni. Worcester - CS - 07
Relational Algebra #2More Complex Operatorscs3431More Algebra Operators SetOperators: Union, Intersection, Difference Cross (Cartesian) Product Select, Project Join: Natural Join, Theta Join, (Left/Right) Outer Join Renaming, Duplicate El
Uni. Worcester - CS - 3431
Relational Algebra #2More Complex Operatorscs3431More Algebra Operators SetOperators: Union, Intersection, Difference Cross (Cartesian) Product Select, Project Join: Natural Join, Theta Join, (Left/Right) Outer Join Renaming, Duplicate El
Uni. Worcester - CS - 07
To test the following procedures, do the followingA. SETTING UP TABLES WITH DATA-1. Ensure that your DB does not have student and professor tables. You may delete existingtables by:SQL> @dropTables2. Then create the tables by:SQL> @createT
Uni. Worcester - CS - 3431
To test the following procedures, do the followingA. SETTING UP TABLES WITH DATA-1. Ensure that your DB does not have student and professor tables. You may delete existingtables by:SQL> @dropTables2. Then create the tables by:SQL> @createT
Uni. Worcester - WLANS - 96
THE SECOND IEEE WORKSHOP ON Wireless Local Area NetworksIEEE 802.11 Wireless LANdraft StandardKeith B. Amundsen Wireless Solutions 508-470-9483 keith_b_amundsen@raytheon.com October 24, 1996 Worcester Polytechnic InstituteMicroelectronicsTHE
Uni. Worcester - WLANS - 96
Wireless LAN Tutorial: Products and Systemson op h te rks itu o st E W NS ic In EE dI LA techn n s co es r Poly Se l ire este 6 W rc er 9 Wo Octob24Copyright 1996 - All Rights ReservedCraig J. MathiasPrincipal Farpoint GroupCopyright 1996 All
Uni. Worcester - WLANS - 96
Antenna Selection for Optimum Wireless LAN PerformanceDr. Steven R. Best Cushcraft Corporation 48 Perimeter Road Manchester, NH 03108 (603) 627-7877PURPOSEOverview of antenna properties and performance characteristics Overview of RF propagation
Uni. Worcester - WLANS - 96
:LUHOHVV/$15HVHDUFK /DERUDWRU\CWINS3HUIRUPDQFH0RQLWRULQJ$QG 'HSOR\PHQW7RROV3UHVHQWHGE\3URI.3DKODYDQ 3URMHFW6WDII$=DKHGL3.ULVKQDPXUWK\$)DOVDIL 0+$OL6%DJFKL0'HPEHOH-5RELQVRQ $0HVVLHU:LUHOHVV/$15HVHDUFK /DERUDWRU\6WDUWLQJ'DWH-DQXDU\ &XUUHQW0HPEH
Uni. Worcester - WORKSHOP - 08
Opportunistic RF Localization for Next Generation Wireless Devices June 16-17, 2008 Worcester Polytechnic Institute Worcester, MA, USAPAGE 1Opportunistic RF Localization for Next Generation Wireless DevicesHybrid Positioning In CDMA NetworksJu
Uni. Worcester - WLANS - 96
6HFRQG,(:RUNVKRSRQ :LUHOHVV/$1CWINS7UHQGVLQ:LUHOHVV/$1V.3DKODYDQ :RUFHVWHU3RO\WHFKQLF,QVWLWXWH :RUFHVWHU0$ 7HO)$; (0NDYHK#FZLQVZSLHGX:LUHOHVV6HUYLFHV )L[HG VHUYLFHV /RFDWLRQ RI WKH VHUYLFH GRHV QRW FKDQJH ([DPSOH ,QWHU/$1 ZLUHOHVV EULGJHV ZLU
Uni. Worcester - WLANS - 96
THE SECOND IEEE WORKSHOP ON Wireless Local Area NetworksIEEE 802.11 Wireless LANdraft StandardKeith B. Amundsen Wireless Solutions 508-470-9483 keith_b_amundsen@raytheon.com October 24, 1996 Worcester Polytechnic InstituteMicroelectronicsTHE
Uni. Worcester - WORKSHOP - 08
Opportunistic RF Localization for Next Generation Wireless Devices June 16-17, 2008 Worcester Polytechnic Institute Worcester, MA, USAOpportunistic RF Localization for Next Generation Wireless DevicesJune 17, 2008Global Wireless Location Solutio
Uni. Worcester - WORKSHOP - 08
Opportunistic RF Localization for Next Generation Wireless Devices June 16-17, 2008 Worcester Polytechnic Institute Worcester, MA, USAThe Internet Location Service Model Using HELD in IP access networksJun 17, 2008James Winterbottom Senior Produc
Uni. Worcester - WLANS - 96
JOLT CORPORATE LECTURE FULL THROUGHPUT WIRELESS ATM Presented by : Dr. David B. Medved, President The Second IEEE Workshop on Wireless LANs October 24-25, 1996 Worcester Polytechnic InstitutePg. 1UWIN Features Wide bandwidth DC-155 Mbps Protoc
Uni. Worcester - WORKSHOP - 08
Opportunistic RF Localization for Next Generation Wireless Devices June 16-17, 2008 Worcester Polytechnic Institute Worcester, MA, USAUnderstanding and Capturing People's Privacy Preferences in a Friend Finder ApplicationNorman M. Sadeh - www.cs.c
Uni. Worcester - WORKSHOP - 08
Opportunistic RF Localization for Next Generation Wireless Devices June 16-17, 2008 Worcester Polytechnic Institute Worcester, MA, USALocation using Pattern Matching of Wireless Network MeasurementsOpportunistic RF Localization for Next Generatio
Uni. Worcester - WORKSHOP - 08
Opportunistic RF Localization for Next Generation Wireless Devices June 16-17, 2008 Worcester Polytechnic Institute Worcester, MA, USA6/22/2008Hybrid Positioning GNSS, Cell-ID, Wi-Fi Bluetooth C ll ID Wi Fi, Bl t th, FM & TVOpportunistic Locatio
Uni. Worcester - WLANS - 96
HIPERLANTim WilkinsonHP Labs EuropeWhat is HIPERLAN?HIPERLAN - HIgh PErformance Radio LAN HIPERLAN is a new standard for Radio LANs developed in Europe by ETSI HIPERLAN is an interoperability standard which specifies a common air interface MAC
Uni. Worcester - WLANS - 96
Wireless LAN in JapanTechnologies, Market and Regulation Present and Future0DVDKDUX 0RUL &ODULRQ &R /WG 6DLWDPD -DSDQ10/25/961ContentsXPresent Wireless LAN in Japan : Products and Technologies : Market and Application : Regulations X Futur
Uni. Worcester - WORKSHOP - 08
Opportunistic RF Localization for Next Generation Wireless Devices June 16-17, 2008 Worcester Polytechnic Institute Worcester, MA, USAClick to edit Master title styleTV+GPS Location and TimingTodd Young VP Marketing tyoung@rosum.com www.rosum.co
Uni. Worcester - WORKSHOP - 08
Opportunistic RF Localization for Next Generation Wireless Devices June 16-17, 2008 Worcester Polytechnic Institute Worcester, MA, USARecovery vs Location Opportunities and Challenges Arvind Ramadorai Vice President, New Products/New Business June
Uni. Worcester - WORKSHOP - 08
Opportunistic RF Localization for Next Generation Wireless Devices June 16-17, 2008 Worcester Polytechnic Institute Worcester, MA, USAOpportunistic and Hybrid LocalizationFarshid Alizadeh 6/17/2008Outline Introduction WPS? WPS unique features
Uni. Worcester - WLANS - 96
Wireless LAN Research LaboratoryCWINSPerformance Monitoring And Deployment ToolsPresented by: Prof. K. Pahlavan Project Staff: A.Zahedi, P.Krishnamurthy, A.Falsafi, M.H. Ali, S. Bagchi, M.Dembele, J.Robinson, A.MessierWireless LAN Research
Uni. Worcester - WLANS - 96
JOLT CORPORATE LECTURE FULL THROUGHPUT WIRELESS ATM Presented by : Dr. David B. Medved, President The Second IEEE Workshop on Wireless LANs October 24-25, 1996 Worcester Polytechnic InstitutePg. 1UWIN Features Widebandwidth DC-155 Mbps Protoc
Uni. Worcester - SOLUTION - 05
Received RF signal Location SensingLocation metrics: TOA, AOA, RSS, .Location coordinates (x, y, z)Positioning Algorithm Location SensingDisplay SystemFigure 13.1 Functional block diagram of a wireless geolocation system.xt (t ) = At cos(
Uni. Worcester - SOLUTION - 05
PowerCellular/PCSWLAN UWB1 2 3 5 10f (GHz)Figure 12.1 Relative power limits and the bandwidths available for cellular/PCS, WLAN and UWB.P (dBm)-41.3-501.91-60-70-80 0.96 1.61 3.1 10.6f (GHz)Focus of the IEEE 802.15.3aFigur
Uni. Worcester - SOLUTION - 05
CKt0 t1 1 0 0 0 1 0t2 1 0 1t3 1 1 0(b)t4 1 1 1 f7t5 0 1 1t6 0 0 1t7 1 0 0 f4D2 D1CKD2(a)D1D0D0 fcf4 f2f5 f6f3 f1FrequencyInformation Bitsf7 f6 f5 f4 f3 f2 f1(c)TimeFigure 10.1 The LFSR code of length 7 with
Uni. Worcester - SOLUTION - 05
CableNetwork Analyzerff0ff0+f(a)W(k) CZT h(n) or h()H(k)f1/fn or Time span: 1/f tk or f fk or f(b)Figure 5.12 (a) Basic block diagram of frequency response measurements using a network analyzer measurement system (b) post
Uni. Worcester - SOLUTION - 05
Slow fading: Histogram of deviations is shadow fadingPower in dBLinear fit to received power: Slope is the distance-power gradientFast fading: Histogram of deviations is multipath fading Fourier transform of deviations is Doppler spectrumDist
Uni. Worcester - SOLUTION - 05
Total Bandwidth of W-20 -25N CarriersSignal Strength in dB-30 -35 -40 -45 -50 -55 -60fFrequency Selective Fading-50 0 50frequency (in MHz)Figure 9.28 Frequency selective fading and MCMEE538 Lecture 7Symbols 4-pilot and 12-virtual