You are given 4-bit ripple carry adders and logic gates you have learnt about in the class (AND, OR, NOT, XOR, XNOR, NAND, NOR). Construct a 12-bit adder/ subtractor from the provided components. An input S will determine the type of operation. If S=0, it should add, otherwise subtract. You can use black boxes to represent 4-bit adders for this part of the question. [10] b) Using the 4-bit adder discussed in class, show how you can simplify the circuit if you knew the circuit would always be adding 3. Start with the 4-bit ripple carry adder, set the value on input 'B' to the constant 3, and then reduce the logic gates because of the constant value of 3. [101 c) Specify the worst-case path and worst-case gate delay for your system in (a). [5] d) Specify the worst-case path and worst-case gate delay for your system in (b). [5]

Ihave a music player on my phone. i can buy songs, add them to playlists and play them. obviously it would be redundant to store each song in each playlist; each playlist is just a list of pointers to the songs. for this lab you will simulate this behavior. your program will need to have options to: add songs to the system library (you will store the text of the first line of the song, rather than the audio) add playlists add songs to a playlist list playlists play a playlist list all of the songs in the library with a count of how many times each song has been played remove a song from a playlist remove a playlist remove a song from the library (and thus from all playlists that contain it) note that we will not be checking many error cases. in real programming this would be bad, you should usually try to recognize and respond to as many types of errors as you can. in the context of class we are trying to acquaint you with as many concepts as possible, so for the sake of educational efficiency we will not be checking most errors in this lab, you may assume that your user provides correct input. you may add all appropriate error testing if you wish, but we will not be testing for it.

Which of the following examples has four beats in each measure?

Given a link with a maximum transmission rate of 32.8 mbps. only two computers, x and y, wish to transmit starting at time t = 0 seconds. computer x sends filex (4 mib) and computer y sends filey (244 kib), both starting at time t = 0. statistical multiplexing is used, with details as follows packet payload size = 1000 bytes packet header size = 24 bytes (overhead) ignore processing and queueing delays assume partial packets (packets consisting of less than 1000 bytes of data) are padded so that they are the same size as full packets. assume continuous alternating-packet transmission. computer x gets the transmission medium first. at what time (t = ? ) would filey finish transmitting? give answer in milliseconds, without units, and round to one decimal places (e.g. for an answer of 0.013777 seconds you would enter "13.8" without the quotes)