Scribd
Upload
34 views

Hintsmock 1cse

1) The document contains questions and answers related to discrete mathematics and computer science topics. 2) It includes questions on relations, functions, graphs, logic, algorithms, complexity theory, and other topics. 3) The responses provide explanations and solutions to the questions in point form.

Uploaded by

Venkatesh Tallam
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
34 views

Hintsmock 1cse

1) The document contains questions and answers related to discrete mathematics and computer science topics. 2) It includes questions on relations, functions, graphs, logic, algorithms, complexity theory, and other topics. 3) The responses provide explanations and solutions to the questions in point form.

Uploaded by

Venkatesh Tallam
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
You are on page 1/ 5

OS+DAA+PL--- MG-I 2011

Q01.
Number of reflexive relations possible on a set with 3 elements = 2 3(3-
Number of irreflexive relations possible on a set with n elements= 23(3-1
Number of relations possible on a set with 3 elements= 29
Required number of relations= 29 – 64 – 64 = 384.

Q02. If f(x) is continuous at x = x0 then Lt f(x) = f(x0)


x→x0
⇒ a x0 + b = x02 … (1)
If f(x) is differentiable at x = x0 then 2 x0 = a …(2)
Solving (1) and (2),
we have a = 2 x0 and b = - x02 .

Q03. (B)
Maximum number of edges possible in a bipartite graph with 9 vertices is 20.
Q04. (C)
Q05. (B)
Q06. (C)
Q07. (D)
Q08. (B)
Q09. (A)
Q10. (D)
Q11. (C)
Q12. (B)
Q13. (A)
Q14: One Binary Semaphore is sufficient to implement Readers-Writers Code using Busy
Waiting

Q15: Multiplex problem is a clear cut example which can be controlled/modeled with
counting Semaphore.

Q16. Type checking is done for the operands and the operator in the expression and
assignment statements. Type Coercion is the phenomenon where the incompatible types
are made compatible with implicit narrowing or enlarging coercion.

Q17. Apply the definition of Big-Oh Notation. In case of any confusion over any function,
take log of the functions and resolve.
Q18. All Sorting techniques except, Bubble sort takes more than O(n) whether the elements
are in order or not.

Q19. Apply the definitions of P,NP, NP-Complete.

Q20. (C)
Q21. (D)
Q22. (D)
Q23. (A)
Q24. Ans: 1-vi 2-v 3-I 4-iii 5-iv 6-ii
Q26. All are correct
(A) 1) p∨q
2) ∼ p∨r
3) ∼ r
From 2) and 3) , we have ∼ p …(4) (by the rule of disjunctive syllogism)
From 1) and 4) , q follows by the rule of disjunctive syllogism.
∴ The argument is valid.

(B) 1) p∧q
2) p→ (r∧q)
3) r→ (s∨t)
4) ∼ s
From 1) and 2), we have (r∧q) … (5) by the rule of modus ponens.
From 5) and 3), we have (s∨t) … (6) by the rule of modus ponens
From 4) and 6) , t follows by the rule of disjunctive syllogism.
∴ The argument is valid.

(C) 1) p
2) p→ r
3) p→ (q∨∼r)
4) (∼ q∨∼r)
From 1) and 2), we have r … (5) by the rule of modus ponens.
From 1) and 3), we have (q∨∼r)… (6) by the rule of modus ponens
From 5) and 6) , q follows by the rule of disjunctive syllogism.
Here, The premises are inconsistent
∴ The argument is valid.

D) 1) p→ q
2) ∼ q
3) ∼ r
From 1) and 2), we have ∼ p … (4) by the rule of modus tollens.
From 3) and 4), we have ∼ p ∧∼ r … (5) by the rule of conjunction.
5) ⇔ ∼ (p∨r)
∴ The argument is valid.
Q27. (B)
Hint: Solve by the method of characteristic roots
Characteristic roots are 4 and 2
Complementary function is C1 (4n) +C2 (2n)
Particular solution is -9 (3n)
Applying initial conditions we get C1 =5 and C2 =7

Q28. (C)
(apply Binomial theorem)
Required probability= C(10,7).(1/2)7.(1/2)3 + C(10,8).(1/2)8.(1/2)2 +
C(10,9).(1/2)9.(1/2)1 + C(10,10).(1/2)10.(1/2)0

Q29. (D)

Q38. The solution does not guarantee mutual exclusion. Assume pre emption, just after the
while loop condition is false. It is free from deadlock.

Q39. Apply the definition of static scope and referencing environment.

Q40. Apply the technique of transforming the given recurrence to the form of Master
Theorem.

Q41. The Graph has a maximal independent set of size not more than 2.

Q42. (A)

Q43. (D)

Q44. (B)

Q45. (B)

Q46. (C)

Q47. Solution: reliability = 120/60*24*365=0.9997

Q48. Calculate the surface capacity in bytes and then multiply it with the no. of surfaces.

Q49. Free list keeps track of those blocks that are free. Bit map keeps track of all the blocks
with one bit per block.

Q50. (A)

Q51. (B)

Q52. Both the strings “X” and “Y” are included in the string <ABCAABABA> as
Subsequence.
Q53. Like LCS can be solved in O(mn) time, same way SCS can also be solved with the
similar recurrence and taking time of O(mn).

Q54. (C)

Q55. (A)

Q56. Ans: (B)


The number when divided by 9, 11 and 13 leaving remainder
6 = (L.C.M of 9, 11, 13) = + 6 = 1293
∴ Required number = 1294 – 1293 = 1

Q57. Ans: (D)


Nitin: 32 31 30 29 28 27 26 25 24 23 22 21 20 ………
Sumit: 1 3 5 7 9 11 13 15 17 19 21 23 25 ………
Clearly, both will never call out the same number.

Q58. Ans: (D)

Given Yellow New Old Law Medical


Cover Cover Volume Volume Reports Extract
A √ √ √
B √ √ √
C √ √ √
D √ √ √
E √ √ √
F √ √ √

Clearly, E and F are old volumes which have green covers and are medical extracts.

Q59. (B)

Q60. (B)

Q61. (C)

Q62. (C)

Q63. Ans: (C)


Let number of boys = x
Let number of girls = y
∴ Total number of students = x +y
⇒( x + y ) ×15 .8 =16 .4 x +15 .4 y ⇒0.6 x = 0.4 y
x 0.4 2
= = ⇒2:3
4 0.6 3

Q64. Ans: (D)


Clearly, a policy to select deserving candidates cannot be abolished just because of the
expenditure it entails. So, argument ‘I’ does not hold. Also, students who are intelligent
enough to secure good marks in academic exams have no reason not to perform well in
entrance test. So, II also does not hold. Further, the students passed out from different
universities are assessed on different patterns and hence a common entrance test would
put the candidates to uniform test and assessment. So, only III holds strong.

Q65. Ans: (C)


The information can be tabulated as under:
Male/Female Male Female Total
For 737 1026-737=289 1026
Against 1072-(289+201) 938
=582
Indifferent 201
1407 1072
 582 
The percentage of women who voted against the measure :  × 100 % = 54.3%
 1072 

You might also like