Chi square test of goodness of fit

) Russell's Paradox

Riemann Sum

 Maximin or Minimax Principle

xamine the following functions for maxima and minima:
a) 
b) 

 Discuss the nature of the following time path: 
b) Solve equation:  for 

 Ram and Rahim play for a prize of Rs. 99. The prize is to be won by the player who first throws a 3 with a single die. Ram throws first and if he fails Rahim throws it and if Rahim fails Ram throws it again and this process continues. Find their respective expectations.
b.) If P (A  B  C) = 0, show that P [(A  B)/ C] = P(A/C) + P (B/C)

Using Simplex method solve the problem:
Maximise z = 4x + 8y + 2k
Subject to:

Also, minimize the same for z

 Given the input matrix and the final demand vector:

A = [[0.10, 0.15, 0.12],
[0.20, 0, 0.30],
[0.25, 0.40, 0.20]]

d = [[100],
[200],
[300]]

a) Explain the economic meaning of the elements 0.30,0 and 200
b) Explain the economic meaning of (if any) of the third column sum
c) Explain the economic meaning of (if any) of the third row sum
d) Write out the specific input-output matrix equation for this model
e) Find the solution output levels of the three industries using Cramer's rule.

(a) Explain the theorem of second order optimum.
(b) Consider the following utility maximization problem, in which the utility function of the consumer is given by U(x,y)=x^0.7y^0.3. The consumer income is I=200 and p x=3 and py=2. Find the utility maximizing x and y when the budget constraint of the consumer may or may not bind. (Apply Kuhn-Tucker method)

 Log-Based Recovery and the role of Checkpoints

 Query Optimization in RDBMS

 NoSQL Databases (Explain one type, e.g., Document, Key-Value, or Graph)

The Star Schema in Data Warehousing

Distributed Databases vs. Centralized Databases

) Explain the Two-Phase Locking (2PL) protocol. How does it ensure serializability? Does 2PL prevent deadlocks? Explain with an example of how a deadlock can occur even when 2PL is used.

Is this schedule serializable? Justify your answer. Identify the specific concurrency problem (e.g., Lost Update, Dirty Read) that occurs here.

 What is the final value of A and B after this schedule?

 Consider the following schedule involving two transactions, T1 and T2, where A and B are data items with initial values A=1000, B=2000.