You are going to purchase items from a store that can carry a maximal weight of 'w' into your knapsack. There are 5 items in store available and each items weight are Wi and the worth of
these items are Pi dollars. What items should you take and how using Knapsack algorithm?
The weight of knapsack depend upon the sum of your two digits of age for example suppose
your age is 25 then sum of age becomes 7. The list of items and their respective weight with
price are given in table.
Items Weight Price
A Total count of your first name Total count of your first name
divide by 2
B 3 Your roll no mod 5
C Second digit of your roll no 5
D Total count of your last name Total count of your first name
divide by 2
E Your roll no mod 3 Sum of roll no mod 13

State the parts of a variable declaration?

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

The place where the extended axis of the earth would touch the celestial sphere is called the celestial