1. Answer the questions.

1.What is Euler path?

- Euler path is a path that uses every edge of a graph exactly once.
2.What is chromatic number of a graph?
- The chromatic number of a graph is the smallest number of colors needed to color the
vertices so that no two adjacent vertices share the same color.
3.What is the difference between a graph and a tree?
- Tree is a special form of graph, having only one path between two vertices.
4.What are the universal gates?
- A universal gate is a logic gate that can be used to construct all the other logic gates.
5.A map is drawn with 25 vertices and 73 edges, how many countries are there?
- Region = Edge – Vertices + 2. Countries = 73-25+2 = 50.
6.What do you mean by a MST(Minimum Spanning Tree)?
- MST is sub-tree of a graph with no cycle, maximum height and least edge weight(if the
graph is weighted).
7.What is the maximum number of colors that are needed to color a map?
- Maximum of 4 colors are needed to color a map.
8.Design an OR gate using only NAND gates.

9.You cannot write the letter A without lifting you pen (and without overwriting),
but you can write the letter B lifting you pen (and without overwriting). Why?
-The letter ‘A’ has a Euler path but ‘B’ does not.
10.Draw the circuit : (x+y)xy

11.Is x + 1 = 2 a proposition?
- No. Because it’s not a statement.
12.Write the truth table of p⊕q.
-

p q p⊕q

0 0 0

0 1 1

1 0 1

1 1 0
13.If p:”You study” and q: “You have bad grades” then express the sentence : “If
you do not study you have bad grades” using propositions.
- ¬p q
14.Which one is true : ¬∃x Q(x) ≡ ∀x¬Q(x) or ¬∃x Q(x) ≡ ∀xQ(x)
- ¬∃x Q(x) ≡ ∀x¬Q(x)
15.True or False : “The spanning tree of a graph is unique”.
-
16.Determine if the function from Z to Z is one-to-one, onto, both or none: f(n) =
n3
- one-to-one.
17.Determine if the function from R to R is one-to-one, onto, both or none: f(x) =
1/x
- none
18.If f(x) is O(g(x)) when f(x) = 3x2 + 4x +9 find g(x).
- x2, C = .
19.True or False : The Olympics Symbol has Euler path but no Euler circuit?

- False.
20.What is the sequence of the generating function (x) = (x18 – 1)/(x-1) ?
-
21.Express decimal 769 in base 7.
- (769)10 = (2146)7.
22.Find LCM of 4048 and 256.
- 64768.
23.Find next two elements of the following sequences:
1,7,25,79,241,727,2185,6559,19861,____,____.
- 59047 and 177145. #Hint: an = 3n-2.
24.If f(x) = 2x and g(x) = x3 + 2x – 3, find fog(x).
- fog(x) = 2(x3+2x-3) = 2x3 + 4x -6.
25.Find the truth value of ∃n(3n = 5n) if n is integer.
- ∃n(3n = 5n) is true when n = 0.
26.Find the truth value of ∀n(n2 > n) if n is integer.
- False
27.If p : I studied and q : I passed the exam then express the proposition : p → q
in English sentence.
- If I studied then I would pass the exam.
28.State De-Morgan’s law.
-The complement of the union of two sets is the intersection of their complements and
the complement of the intersection of two sets is the union of their complements
29.If A∪B = |A| + |B| - |A*B| then what is *?
- * is ∩ (Intersection operator).
30.Express the following numbers in prime factors : 66521
- 66521 = 71 x 131 x 171 x 431
31.What is Planar Graph?
- If a graph can be represented in copy and there is no intersection point in edges then
the graph is called planar graph.
32.Find the generating function if ak = 1/(k!).
- ex
33.Determine if 24 and 14 are congruent modulo 6?
- Not congruent
34.Will you be able to draw the Olympic symbol without lifting the pen?
- No.
35.What is the probability of getting 7 if two dices are rolled?
- 1/6.
36.Determine if the function f(n) = n3 is one to one if n is integer.
- one-to-one
37.Is the relation R = {(1,1),(1,2),(1,3),(1,4),(2,2),(2,3),(2,4),(3,3),(3,4),(4,4)}
symmetric or anti-symmetric?
- Anti-symmetric
38.How many vertices does a binary tree of height 4 have?
- 2n+1-1. Here, n=4. So, 24+1-1=31.
39.What is the number of Boolean functions of degree 4?
- 2^2^n. Here, n=4. So, 2^2^4 = 65536.
40.At most how many leaves can be in an m-ary tree of height h?
- mh
41.Find the truth value of ∃n(n = -n) if n is integer.
- True if n = 0.
42.Find the truth value of ∃x(x3 = -1) if x is real number
- True if x=-1.
43.If p : I studied and q : I passed the exam then write the proposition for the
English sentence : I studied but I didn’t pass the exam.
-
44.What is twin prime?
- If the difference between two primes is 2.
45.Draw a Venn diagram and shade to show: A∩(B∪C)
-
46.Express 677 in base 3.
- (677)10 = (221002)3.
47.Find the LCM of 12673 and 4199.
- 2800733.
48.What is the sequence of the generating function (x) = 1/(1-x)?
-
49.What is the quotient and remainder when -124 is divided by 13?
- Quotient is 10 and remainder is 6.
50.In how many regions a graph of 10 vertices and 15 edges will split a plane?
- 7 (#Hint : r=e-v+2)
51.If your class has 60 students how many pair of students are likely to have same
birthdate?
-
52.Determine if the function f(x)=(x+1)/(x+2) is one to one correspondence if x is
real.
- No.
53.Which set of operators are functionally complete in Boolean algebra?
- AND, OR and NOT.
54.Find f(5) if f is defined recursively as f(n+1) = f(n) + 3f(n-1).
-
55.What is the coefficient of x101y99 in the expansion of (2x-3y)200?
-
56.Draw a Venn diagram and shade to show : (A-B) ∩(C-B).
-
57.Find LCM of 95256 and 144.
- 190512.
58.How many binary digits and decimal are there in the largest Mersenne prime
number 257685161-1.
- 57685161 binary bits and 17364964 decimal digits.
59.Which function is a one to one? (Z Z) (i) f(n) = n-1 (ii) f(n) = n2+1
- (i) f(n) = n-1
60.Find C and k for f(x) is O(x) and f(x) = 3x+7
- C = 4, K = 7.
61.Find if the function f(a) = b, f(b) = c, f(c) = d, f(d) = a from (a,b,c,d) to itself is
one to one, onto, both or none.
- Both.
62.A planar graph is divided in 17 regions, it has 10 vertices, what is the number of
edges?
- 25. #Hint : r = e-v+2.
63.Name an algorithm to find MST.
- Prim’s Algorithm.
64.How many edges does a n node tree have?
- n-1.
65.Design an AND gate using only NOR gate.
-
66.What are (i) literal and (ii)minterm?
- A literal is a logic variable or it’s compliment.
A minterm is the product of N distinct literals where each literal occurs once.
67.Find the value of └1/2 +┌3/2 ┐┘ and └1/2. └5/2┘┘.
- 2 and 1
68.If generating function is G3 = (1-xn)/(1-x) find ak.
-
69.S(x): x is SUST student, T(x) : x is a teacher, A(x,y): x asked y a question. Use
quantifiers to express: There is a teacher who has never been asked a question
by a student.
-
70.Evaluate -221 mod 23 (A) 3 (B) 10 (C) 9 (D) 7 (E) 22.
- (C)9
71.F(x) = 3x + 2 g(x) = 2x + 4 find fog and gof
- fog=6x+14 and gof=6x+8.
72.Which functions are onto? (Z Z) (i) f(n) = n -1 (ii) f(n) = n2 + 1 (iii) f(n) = n3 (iv)
f(n) = ┌n/2┐.
-
73.What are these functions?

- (i) =ln(1+x)

74.A tree traversed in pre-order, in order and post-order are ABC, BAC, BCA. Draw
the tree.
-
75.What are the operations of Boolean algebra?
-
76.True or False : A graph with chromatic number 2 is a Bipartite graph.
-
77.If C(x) : “x has visited Cox’s Bazar and S(x) : “x has visited St. Martin” then
express the proposition : “Every student has visited either Cox’s Bazar or St.
Martin” using proper Quatifier.
-
78.Determine if the function from Z to Z is one to one, onto, both or none : f(n) =
n2 + 1.
- None.
79.Determine if the function from R to R is one to one, onto, both or none : f(x) =
(x2 + 1)/(x2 + 2)
-
80.Arrange the following function as increasing complexity: log n, n log n, b n, n!,
constant, nb
-
81.Write both De-Morgan’s laws.
-
82.Find the prime factors of : 168795
- 32 x 5 x 112 x31.
83.How many primes are in between 7000 and 8000?
-229. #Hint = .
84.Give an example of Divide and Conquer algorithm.
- Binary Search.
85.State the Pigeon Hole Principle.
- Pigeonhole principle states that if n items are put into m containers, with n > m > 0,
then at least one container must contain more than one item.
86.True or False : “∀n ∊ N. (x2 – x = 0) ∧ (x ≥ 2)”
-False.
87.Let A = {1,2,3,4} and let R = {(1,2),(2,2),(3,4),(4,1)}. Is R anti-symmetric? Yes/No.
- Yes.
88.Is 2 + 3 = 79 a proposition?
- Yes
89.True or False? If A, B and C are sets then (A-C)∩(C-B) =
- True.
90.If f(x) = 3x+5 and g(x) = 2x+2 find gof and fog.
- gof = 6x + 12 and fog = 6x + 11
91.Find the prime factors of 705551
- 73 x 112 x 17
92.Find the LCM and GCD of 112651 and 121121
- 16109093 & 847.
93.Express 369 in base 5
- (369)10 = (2434)5
94.261 – 1 is a Mersenne prime. Write the prime number in any number system.
-
95.A graph of 53 edges splits the plane in 40 regions. How many vertices does the
graph have?
- 15 #Hint : r = e-v+2
96.What is a connected graph?
- If there is at least one path between any two vertices then that graph is called
connected graph.
97.If A = {2,6}, B={2,4,6,}, C={2} and D={4,6,8}, find which of these sets are subsets
of which other sets.
-
98.How many integers less than 45 are relatively prime to 45?
-
99.What is 57 mod x for each x=2,3,4 and 5?
- 1, 0, 1 and 2.
100.Express an AND gate using NOR gates.
-
101.True or False : f(x) = |x| + 1 (Z Z) is onto but not one to one.
- True.
102.Find the 26th prime number.
-
103.Product of two prime numbers are 19043. Find the twin primes.
- 137 & 139.
104.What is fundamental theorem of Arithmetic?
-
105.True or False? 23 = 16 mod 7
- True.
106.Find the pseudo random numbers using xn+1 = (7xn+4) mod 8 for x0 = 3
-
107.What is the generating function of the series. 1+x+x2+x3+x4+...
-
108.What is the difference between a Euler path and a Hamilton path in a graph?
- Euler path uses every edges at least once but Hamilton path uses every vertices at
least once.
109.Draw the circuit X.Y+Y.Z+Z.X
-
110.Determine the Root if R is a tree R={(a,d),(b,c),(c,a),(d,e)}
- The root is ‘a’.
111.True or False: “An undirected graph has an even number of vertices of odd
degree”
-