Write a program that creates a directory containing course numbers and the room numbers of the rooms where the courses meet. the dictionary should have the following key-value pairs: course number (key) room number (value) cs101 3004 cs102 4501 cs103 6755 nt110 1244 cm241 1411 the program should also create a dictionary containing course numbers and the names of the instructors that teach each course. the dictionary should have the following key-value pairs: course number (key) instructor (value) cs101 haynes cs102 alvarado cs103 rich nt110 burke cm241 lee the program should also create a dictionary containing course numbers and the meeting times of each course. the dictionary should have the following key-value pairs: course number (key) meeting time (value) cs101 8: 00am cs102 9: 00am cs103 10: 00am nt110 11: 00am cm241 11: 00pm the program should let the user enter a course number, and then it should display the course's room number, instructor, and meeting time.

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

What multimedia system creates an immersive, real-life experience that the user can interact with?

Universal windows platform is designed for which windows 10 version?