CSC165 Discrete Structure
Discrete Structure: most repeated questions
Questions that have come up in more than one paper, matched by what they ask rather than exact wording. Most repeated first.
- 5×Asked in 2081, 2080, 2078, 2076, 2075Solve the recurrence relation a n = a n−1 + 2a n−2 with initial conditions a 0 = 2 and a 1 = 7.Answer coming5
See the wording in each paper
- Solve the recurrence relation a n = a n−1 + 2a n−2 with initial conditions a 0 = 2 and a 1 = 7.TU Board 2081
- State pigeonhole principle. Solve the recurrence relation a n = 5a n 1 – 6a n 2 with initial conditions a 0 = 1 and a 1 = 3.TU Board 2080
- Solve the recurrence relation a n = 5a n 1 – 6a n 2 with initial conditions a 0 = 1, a 1 = 4.TU Board 2078
- State pigeonhole principle. Solve the recurrence relation a n = 3a n 1 – 3a n 2 + a n 3 with initial conditions a 0=1 ,a 1 = 3, a 2=7.TU Board 2076
- Solve the recurrence relation a n = 5a n 1 – 6a n 2 with initial conditions a 0 = 1 and a 1 = 2.TU Board 2075
- 4×Asked in 2082, 2078, 2076, 2075Define an Euler circuit and Euler path in an undirected graph. Compute the maximal flow from the following network flow. [figure in the original paper]Answer coming10
See the wording in each paper
- Define an Euler circuit and Euler path in an undirected graph. Compute the maximal flow from the following network flow. [figure in the original paper]TU Board 2082
- List all the necessary conditions for the graph to be isomorphic with an example. Find the maximal flow from the node SOURCE to SINK in the following network flow. [figure in the original paper]TU Board 2078
- Define Euler circuit with suitable example. Find the maximal flow s to t from the given network flow. [figure in the original paper]TU Board 2076
- What is S D cut? For the following network flow find the maximal flow from S to D. [figure in the original paper]TU Board 2075
- 4×Asked in 2082, 2081, 2080, 2079Define well ordering property. Find the multiplicative inverse of 7 modulo 19 using Extended Euclidean Algorithm.Answer coming5
See the wording in each paper
- Define well ordering property. Find the multiplicative inverse of 7 modulo 19 using Extended Euclidean Algorithm.TU Board 2082
- Find the GCD of 12 and 16 using Extended Euclidean Algorithm.TU Board 2081
- Find the multiplicative inverse of 4 in Z 11 using extended euclidean algorithm.TU Board 2080
- Find the GCD of 24 and 32 using Extended Euclidean algorithm.TU Board 2079
- 3×Asked in 2081, 2078, 2076Define chromatic number. How does Kruskal's algorithm find Minimum Spanning Tree?Answer coming5
See the wording in each paper
- Define chromatic number. How does Kruskal's algorithm find Minimum Spanning Tree?TU Board 2081
- What are the significance of Minimum Spanning Tree? Describe how Kruskal's algorithm can be used to find the MST.TU Board 2078
- What is minimum spanning tree? Explain Kruskal's algorithm for finding minimum spanning tree.TU Board 2076
- 3×Asked in 2079, 2076, 2075Use Chinese Remainder Theorem to find the value of x such that x = 0 ( MOD 2) , x = 2 (MOD 3) and x = 3 (MOD 5).Answer coming5
See the wording in each paper
- Use Chinese Remainder Theorem to find the value of x such that x = 0 ( MOD 2) , x = 2 (MOD 3) and x = 3 (MOD 5).TU Board 2079
- Find the value of x such that x = 1 (mod 3), x = 1 (mod 4), x = 1 (mod 5) and x = 0 (mod 7) using Chinese remainder theorem.TU Board 2076
- Find the value of x such that x = 1 (mod 5) and x = 2 (mod 7) using Chinese remainder theorem.TU Board 2075
- 2×Asked in 2082, 2079What are the necessary conditions for a graph to be isomorphic? List and illustrate with an example.Answer coming5
See the wording in each paper
- 2×Asked in 2081, 2080What is network flow? Give an example of saturated edge, unsaturated edge, and slack.Answer coming5
See the wording in each paper
- 2×Asked in 2078, 2075Prove that if n is positive integer, then n is odd if and only if 5n + 6 is odd.Answer coming5
See the wording in each paper