BSc CS Sem 1 BSc CS Semester 1 (2020 2021) 2021 DM Question Paper - Mumbai University | munotes

Questions asked in this paper

1. Q1 Relation R is defined on set A. If aRb and bRa implies a = b, then relation R is
   • a) Reflexive
   • b) Symmetric
   • c) Anti symmetric
   • d) Transitive
2. Q2 Let A= {1,2,3}, then number of elements in A X A are
3. Q3 Iffis a function from A to B then the set of all images of f in B is called
   • a) Range of f
   • b) Domain of f
   • c) Co domain of f
   • d) Inverse of f
4. Q4 Let A= {1,2}, B = {a,b,c} and R = {(1,a),(1,b),(2,c)}, then which of the following is true?
   • a) but not a function
   • b) Risa function but not a relation
   • c) Ris function as well as relation
   • d) R is neither function nor relation
5. Q5 If Aisa finite set having n elements, then the number of relations which can be defined on A are
6. Q6 A function f from R to R defines as f(x) = |x| is
   • a) Invertible
   • c) Not one one
   • d) Not onto
7. Q7 Degree of recurrence relation a, = + 3 marks
8. Q8 Characteristic roots of recurrence relation a, — + = 0 are
9. Q9 Next term of Fibonacci sequence
10. Q11 What is the coefficient of ab* in the expansion of (a + ?
11. Q12 Five girls are to be seated around a round table. The number of seating arrangements possible are
12. Q13 Godel number of a word w = is
13. Q14 Grammar which has no restrictions on its productions is
    • b) type 1
14. Q15 Minimum how many students should be there in a class to guarantee that atleast two students have their names starting from same letter?
15. Q16 n(A) = 50, n(B) = 30, n(An B)=10, n(AU B)=70, then n(only A) is
16. Q17 The regular expression does not use which of the following symbols?
17. Q18 A graph with n vertices and no edges is called
    • a) Multigraph
    • b) Regular graph
    • c) Trivial graph
    • d) Complete graph
18. Q19 A graph in which there is an edge between every pair of vertices is called
    • a) Regular graph
    • b) Complete graph
    • c) Simple graph
    • d) Trail
19. Q20 A walk in which no vertex is repeated more than once is called
    • a) Closed walk
    • b) Path
    • c) Trail
    • d) Circuit
20. Q21 Connected graph without any cycle is called
    • a) Circuit
    • b) Tree
    • c) Diagraph
    • d) Path
21. Q22 Which of the following indicates pre order traversal?
22. Q23 In a binary rooted tree, , the degree of the root is
23. Q24 If number of edges is 6, then the degree of the graph is
24. Q25 Multigraph has
    • a) No loops, no parallel edges
    • b) Parallel edges but no loops
    • c) Loops but no parallel edges
    • d) Loops and parallel edges

Read from the scan above, so a character or two may differ. The scan is the original.