Scribd
Upload
24 views6 pages

DIS CO-3,4 Imp Questions

Uploaded by

saicharanghantasala64
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
24 views6 pages

DIS CO-3,4 Imp Questions

Uploaded by

saicharanghantasala64
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 6

CO-3

1. How many different license plates can be made if each plate contains a sequence of three
uppercase English letters followed by three digits (and no sequences of letters are
prohibited, even if they are obscene)?
2. For instance, suppose a bakery has a selection of 20 different cupcakes, 10 different donuts,
and 15 different muffins. If you are to select a tasty treat, how many different choices of
sweets can you choose from?
3. A password of 6 digits is made of digits 9,2,6,0,0,2. How many possible passwords are there?
How long would it take to try all the possible passwords if trying one password takes 5
seconds?
4. Find the number of arrangements of the letters of the word INDEPENDENCE. In how many of
these arrangements,
a. do the words start with P
b. do all the vowels always occur together
c. do the vowels never occur together
d. do the words begin with I and end in P?
5. There are 3 elements a, b, c. Use them to make:
a. permutations (without repetition)
b. permutations with repetition, where, “a” occurs 2 times, “b” one time and “c” one
time.
6. A bank pays 6% (annual) interest on savings, compounding the interest monthly. If Bonnie
deposits$1000 on the first day of May, how much will this deposit be worth a year later?
7. Obtain the solution to the recurrence relation a n = 7a n−2 - 6a n−3 with the initial conditions
a 0 = -1, a 1 = 0, and a 2 = 3.
8. Suppose that the roots of the characteristic equation of a linear homogeneous recurrence
relation are -2, -2, -2, 7, 7, and 8 (that is, there are three roots, the root -2 with multiplicity
three, the root 7 with multiplicity two, and the root 8 with multiplicity one). What is the form
of the general solution?
9. Determine the general solutions of the recurrence relation a n = 5a n−1 -4a n-2 +2n. What is
the solution with a 1 = 3?
10. Solve the recurrence relations using generating functions.
CO-4
1. Identify the degree sequence in graphical 2,2,2,2.

2. Is there a simple graph with degree sequence (1,1,3,3,3,4,6,7)? Justify your answer.

3. Determine whether the following graph is a simple graph or multigraph, and obtain the
degree of each vertex.

4. Obtain the adjacency matrix for the given graphs.

1 1 1 0
5. Draw a graph with the adjacency matrix [0 0 1 0] with respect to the ordering of
1 0 1 0
1 1 1 0
the vertices a, b, c, d.
6. Check whether the graph H displayed are bipartite or not?
7. Check whether the graphs are isomorphic or not?

8. Is the graphs isomorphic or not?

i.

9. which of the following graphs have Euler circuit, then construct such graph if exist.

10. Which of the following graphs have Hamilton circuit or Hamilton path, and then
construct such graph if exist.
11. Which of the following graphs have Hamilton circuit or Hamilton path, then construct
such graph if exist.

12. Solve the traveling salesperson problem for this graph by finding the total weight of all
Hamilton circuits and determining a circuit with minimum total weight.

13. Which of these non-planar graphs have the property that the removal of any vertex and
all edges incident with that vertex produces with planar graph?
a) K6 b) K3, 3

14. Suppose that a connected planar graph has six vertices, each of degree four. Into how
many regions is the plane divided by a planar representation of this graph?
15. Determine whether the given graph is planar. If so, draw it so that no edges cross.

a. b.
16. A connected planar graph has 10 vertices each of degree 3. Into how many regions does a
representation of this planar graph split the plane.
17. Find the chromatic number of the complete bipartite graph Km,n, where m and n are
positive integers?

18. Determine all spanning trees of the graph G shown in the following Figure.

a.

b.
19. Construct all possible spanning trees of the graph H shown in the following Figure.

a.

20. Apply Kruskal’s Algorithm to construct the minimum spanning tree (MST) from the
following graph.

a.
21. Apply Kruskal’s Algorithm to construct the minimum spanning tree (MST) from the
following graph.
a.
22. Construct the minimum spanning tree (MST) for the given graph using Kruskal’s
Algorithm.

a.

23. Construct the minimum spanning tree (MST) for the given graph using Kruskal’s
Algorithm.

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy