2) your name and student number on the answer paper provided
Answer all the questions in this paper
JESTION 1
30
a) Answer briefly each of the following questions
i.
The hexadecimal digits are 1 to 0 and A to
ii.
The main advantage of hexadecimal numbers is the case of conversion
from hexadecimal to...
ili. Binary coded decimal (BCD) numbers express each digit as a...
iv. ASCII code is a 7 bit code for
How many bytes are there in 1011 1001 0110 1110 numbers?
[2]
Convert 1011 1001 0110 1110 to an Hexadecimal number
Convert the decimal number 151.75 to binary
[2]
Convert the binary number 1001.0010 to decimal.
V.
[5]
(1
ION 2
Jame the two (02) gates that can be used to realize a combinational circuit.​

Explain why it is reasonable to assume that receiving 3 duplicate acks in tcp is an indication that the network is not currently congested.

At an open or uncontrolled intersection, yield if a. the cross road has more lanes than yours b. the cross road has fewer land than yours c. you’re on a state highway and the cross road is a secondary road d. do you have three or more passengers in your vehicle

Some of your friends have gotten into the burgeoning field of time-series data mining, in which one looks for patterns in sequences of events that occur over time. purchases at stock exchanges--what’s being bought-- are one source of data with a natural ordering in time. given a long sequence s of such events, your friends want an efficient way to detect certain "patterns" in them--for example, they may want to know if the four events buy yahoo, buy ebay, buy yahoo, buy oracle occur in this sequence s, in order but not necessarily consecutively. they begin with a collection of possible events (e.g., the possible’ transactions) and a sequence s of n of these events. a given event may occur multiple times in s (e.g., yahoo stock may be bought many times in a single sequence s). we will say that a sequence s’ is a subsequence of s if there is a way to delete certain of the events from s so that the remaining events, in order, are equal to the sequence s’. so, for example, the sequence of four events above is a subsequence of the sequence buy amazon, buy yahoo, buy ebay, buy yahoo, buy yahoo, buy oracle their goal is to be able to dream up short sequences and quickly detect whether they are subsequences of s. so this is the problem they pose to you: give an algorithm that takes two sequences of even~s--s’ of length m and s of length n, each possibly containing an event more than once--and decides in time o(m n) whether s’ is a subsequence of s