a) Metro bus travel from Rawalpindi to Islamabad every day. The metro buses pass through Chamman Station between 4:00 PM to 6:00 PM and 50 passengers are allowed to sit in the bus. The number of buses has the following distribution 4 5 8 9 P(X = x) 1/12 1/12 1/6 1/6 Suppose the function 2X-1 represents the token given to the custodian in 30 Rs. Find the custodian's average earnings and also the dispersion.

a) Metro bus travel from Rawalpindi to Islamabad every day. The metro buses pass through Chamman Station between 4:00 PM to 6:00 PM and 50 passengers are allowed to sit in the bus. The number of buses has the following distribution 4 5 8 9 P(X = x) 1/12 1/12 1/6 1/6 Suppose the function 2X-1 represents the token given to the custodian in 30 Rs. Find the custodian's average earnings and also the dispersion.

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

Consider the following function: • 2 sin(n+ #), n=o √√√3 f(n)= n so croitout primollof odk rabies e ne € [1,1], Include plot both f(n) and f'(n) for enough point so that the curve you plots appears smooth. Use different colors and separate label to represent represent the function and it's derivative respectively, label the axes x and y, and use grid. You must use Sympy and Matplotlit, Manual differention should be avoid
Let X = {-1, 6, 11, 15, 17). Let f: X→ Z by f(x) = 7x + 15. The range of the function is
Determine whether each of the following functions f : {a,b,c,d} -> {a,b,c,d} is one-to-one and/or onto. (a) f(a) = b, f(b) = a, f(c) = b, f(d) = c (b) f(a) = b, f(b) = b, f(c) = d, f(d) = c (c) f(a) = b, f(b) = a, f(c) = c, f(d) = d (d) f(a) = d, f(b) = a, f(c) = c, f(d) = b (e) f(a) = c, f(b) = d, f(c) = a
For the following pairs of functions, first decide whether f(n) dominates g(n), or g(n) dominates f(n); then decide whether f = O(g), or f = Ω(g), or f = Θ(g), and briefly explains. i. f(n)=n2,g(n)=1000n+30 √1 ii. f(n) = n, g(n) = n3 iii. f(n) = 10 log2 n, g(n) = log10(n3) iv. f(n)=n 100 n ,g(n)=1.2 . 4 nn v. f(n)=2 ,g(n)=2.01 .
Question 3: If every year a tree produces 2 new braches from every existing branch which are at least 2 or more years old, write a function that computes the number of braches of a tree of age k. Assume that at age 0, a tree has 1 branch. For example, at age 1 the tree still contains 1 branch, because the existing branch was not old enough to produce new branches. However, the next year, on age 2, the tree now contains 3 branches: 1 existing branch and 2 new branches. Next, year, the old branch produces two more branches, but the fresh branches only grow themselves. Hence, the total number of branches become 5 on age 3. The following illustration shows this: | -+- | --+-- | -+- \ | / | -+- --+-- -+--+--+- | | | | / | \ --- --- --- --- --- 0(1) 1(1) 2(3) 3(5) 4(11) """ def treeBranch(k):
Q3: Two Variables es are define by the following equations: f1=E m(2,4,5,10, 12,13,14). f2=Em (2,9,10,11,13,14,15). Show how these functions can be implemented on a PLA
3
09..
Problem 3: A day at the beach. A group of n people are lying on the beach. The beach is represented by the real line R and the location of the i-th person is some integer r; e Z. Your task is to prevent people from getting sunburned by covering them with umbrellas. Each umbrella corresponds to a closed interval I = [a, a + L] of length L e N, and the i-th person is covered by that umbrella if æ¡ € I. Design a greedy algorithm for covering all people with the minimum number of umbrellas. The input consists of the integers x1,..., En, and L. The output of your algorithm should be the positions of umbrellas. For example, if the input is r1 = 1, x2 = 3, r3 = 5, and L = 2, then an optimum solution is the set of two umbrellas placed at positions 2 and 5, covering intervals [1,3] and [4,6]. 1 2 3 4 5 6 Prove that your algorithm is correct and that it runs in time polynomial in n.
CSE Simplify the following functions where D is a don't care function: F(W,X,Y,Z)-E(0,1,3,5,9,11)D(W,X,Y.Z)-X(2,4,8,10)