Can any of you here please provide me the Logical Reasoning sample question paper of Anna University Distance Education Entrance Test (DEET)???

Hello friend as you want the Sample Paper of Distance Education Entrance Test (DEET) of Anna University so here I am providing you the same…

M.B.A. DEGREE EXAMINATION,
First Semester
BA STATWMCS FOR WAGEMEMT
Time : %%me hours M w u r n : 100 marh
1. Give two us= for probability in busin-.
2. Distiqpirah Between &mte and cmtinuours probability distributions. :
3. What is the advantage of central limit theorem in sampling?
4. Give four factors affecting ample size.
5. What is the null and alternative hypothesis?
6. What is. significance level?
7. Distinguish between parametric and non-parametfic twts.
8. When is Mann-Whitney U test ad?
9. How is the accuracy of a regremion qquaticm measured?
10. What are the components of a time series?
11. (a) There are two boss B, a d . % B,. B, cuntaim two Red Balls and one
green ball. B, contains 0% red Ball afid tws been balls.
(i) A ball is drawn from one of the boxes randomly. It is found to be
. red. What is the probability that it is from B, ? (7)

Electronics and Communication Engineering EC 2203 — DIGITAL ELECTRONICS
Time : Three hours Maximum : 100 Marks
Answer ALL Questions
PART A — (10 × 2 = 20 Marks)
1. Prove that the logical sum of all minterms of a Boolean function of 2
variables is 1.
2. Show that a positive logic NAND gate is a negative logic NOR gate.
3. Suggest a solution to overcome the limitation on the speed of an
adder.
4. Differentiate a decoder from a demultiplexer.
5. Write down the characteristic equation for JK flipflop.
6. Distinguish between synchronous and asynchronous sequential circuits.
7. Compare and contrast static RAM and dynamic RAM.
8. What is PAL? How does it differ from PLA?
9. What are Hazards?
10. Compare the ASM chart with a conventional flow chart.
PART B — (5 × 16 = 80 Marks)
11. (a) (i) Express the Boolean function F = XY + XZ in product of
Maxterm.
(6)
(ii) Reduce the following function using K-map technique
f ( A, B, C , D ) = ð (0, 3, 4, 7, 8, 10, 12, 14 ) + d (2, 6) . (10) Or
(b) Simplify the following Boolean function by using Quine-Mcclusky
method
F ( A, B, C , D ) = (0, 2, 3, 6, 7, 8, 10, 12, 13) . (16)
12. (a) Design a carry look ahead adder with necessary diagrams. (16) Or
(b) (i) Implement full subtractor using demultiplexer. (10) (ii)
Implement the given Boolean function using 8 : 1 multiplexer
F ( A, B, C ) = (1, 3, 5, 6) . (6)
13. (a) (i) How will you convert a D flipflop into JK flipflop? (8) (ii)
Explain the operation of a JK master slave flipflop. (8)
Or
(b) Explain in detail the operation of a 4 bit binary ripple counter.
(16)
14. (a) Implement the following Boolean functions with a PLA
F1 ( A, B, C ) = (0, 1, 2, 4 )
F2 ( A, B, C ) = (0, 5, 6, 7)
F3 ( A, B, C ) = (0, 3, 5, 7) . (16) Or
(b) Design a combinational circuit using a ROM. The circuit accepts a
three bit number and outputs a binary number equal to the square of the
input number. (16)
15. (a) Design a three bit binary counter using T flipflops. (16) Or
(b) Design a negative-edge triggered ‘T flipflop’. (16)


Distance Education Entrance Test (DEET) Sample Paper