Using the attached news data file as your baseline (data. json), we are going to build an application that is a news reader. I've attached a sample data file that you will have to add to for testing. (This data file is a JSON file. It is not 100% complete. You will have to create some 'fake' news in order to test all the requirements listed below. The application should be visually appealing. (Use CSS and images/icons). You will lose at least 10 points if you do not use CSS - to make the application look good. Requirements: 1. By default, the application only shows today's news articles. (You will have to insert/create news for the day you test) 2. Allow the user to search the news by date, author and keyword. 3. Use of modules very, very recommended, as you will use modules in your final exam. So, please do so. But, you don't have to.

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

There’s only one game mode that stars with the letter ‘e’ in cs: go. which of the options below is it?

What is a programming method that provides for interactive modules to a website?