35. To accommodate decrease records charges than STS-1, SONET has a gadget of digital tribu- taries (VTs). A VT is a partial payload that can be inserted into an STS-1 frame and mixed with different partial payloads to fill the facts body. VT1.5 makes use of three columns, VT2 uses four columns, VT3 makes use of 6 columns, and VT6 uses 12 columns of an STS-1 frame. Which VT can accommodate (a) A DS-1 provider (1.544 Mbps)? (b) European CEPT-1 provider (2.048 Mbps)? (c) A DS-2 provider (6.312 Mbps)? 36. What is the to be had user bandwidth in an OC-12c connection? 37. Three packet-switching networks every include n nodes. The first community has a celebrity topology with a important transfer, the second is a (bidirectional) ring, and the 0.33 is fully interconnected, with a cord from every node to every other node. What are the first-class-, average-, and worst-case transmission paths in hops? 38. Compare the put off in sending an x-bit message over a ok-hop path in a circuit-switched community and in a (gently loaded) packet-switched community. The circuit setup time is s sec, the propagation put off is d sec in keeping with hop, the packet length is p bits, and the records rate is b bps. Under what conditions does the packet network have a decrease put off? Also, ex- plain the conditions under which a packet-switched network is top-rated to a circuit- switched community. 39. Suppose that x bits of person information are to be transmitted over a ok-hop route in a packet- switched network as a chain of packets, every containing p records bits and h header bits, with x >> p + h. The bit rate of the traces is b bps and the propagation delay is negligi- ble. What price of p minimizes the full postpone? 40. In a regular cell phone machine with hexagonal cells, it's miles forbidden to reuse a fre- quency band in an adjoining cellular. If 840 frequencies are available, what number of can be used in a given cell? 41. The real layout of cells is seldom as ordinary that as shown in Fig. 2-45. Even the shapes of individual cells are usually abnormal. Give a possible motive why this might be. How do these abnormal shapes have an effect on frequency challenge to every cell? 42. Make a tough estimate of the wide variety of PCS microcells a hundred m in diameter it might take to cover San Francisco (one hundred twenty rectangular km). 43. Sometimes whilst a mobile user crosses the boundary from one cellular to any other, the cur- lease name is abruptly terminated, even though all transmitters and receivers are func- tioning flawlessly. Why? 44. Suppose that A, B, and C are concurrently transmitting 0 bits, using a CDMA sys- tem with the chip sequences of Fig. 2-28(a). What is the resulting chip series? Forty five. Consider a exclusive manner of searching on the orthogonality assets of CDMA chip se- quences. Each bit in a pair of sequences can healthy or no longer match. Express the ortho- gonality assets in terms of suits and mismatches. Forty six. A CDMA receiver gets the subsequent chips: (?1 +1 ?three +1 ?1 ?three +1 +1). Assuming the chip sequences defined in Fig. 2-28(a), which stations transmitted, and which bits did every one send?

question 1

2. For a fourbar mechanism schematically shown, the link lengths are: (Link 2): 0=10cm, (Link 3): 6=5cm, (Link 4):0=10cm, (Link 1): =20cm LY O4 For input value ? = 33 of the crank, find possible solutions (both open and crossed configurations) for , and O, by three methods of graphical, analytical, and computer software for design of machinery. Also: - Find the transmission angle at the given configuration. - Evaluate extreme values of transmission angle. - Find input angles corresponding to toggle positions.Given the following diagram of wireless transmission range of 5 computers, If computer A hears a CTS but not the corresponding RTS, computer A is free to initiate a transmission with another computer. True 0 Fake D Question 11 2 pts Given the following diagram of wireless transmission range of 5 computers, It is possible for computer B to be transmitting to computer A at the same time that computer C is transmitting to computer D. E DELLA compiler is a program that takes as input a string and checks if the string is a valid computer program {for some specied programming language]. If the string is a valid computer program it will accept the string [and return without an}r errors). If the string is not a valid computer program it will halt and reject the string {and report any errors found.) Can we create a program that takes as input a compiler (which is itself a string] and checks whether the compiler accepts an}F string as a valid program? In other words, can we create a program that will accept those strings that are compilers that will accept at least one program as a valid computer program? Explain your answer by relating it to a similar problem discussed in class, tutorial or in the text. You are not required to provide a full proof