Design a counter with an external control, x, to count the sequence (i. e., 1-2-7 and repeat) when the control is 0, and the sequence (i. e., 0-3-4-5-6 and repeat) when the control is 1. These values will be displayed on a seven-segment display like the one used in Lab 5. When the control value changes, the first clock should drive the output to the first value in the appropriate count- e. g., if the circuit has been counting the second sequence, and the control switches to 0, the first clock should drive the output to 1 (or if you have been counting multiples and the control switches to 1, the first clock pulse should make the output 1). Use any flip-flops available in the lab cabinet in your design. For input and output circuits, you may use any chips available in the lab, but you must justify your choice, both of your design and of the flip flops you use (combinational logic, decoder, or PLD). You must demonstrate your counter using your 7-segment display and any additional logic gates/devices that you need to control the circuit.

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

Which of the following would you find on a network

Q-1 which of the following can exist as cloud-based it resources? a. physical serverb. virtual serverc. software programd. network device