Exam Details
| Subject | advanced discrete mathematics | |
| Paper | paper 8 | |
| Exam / Course | m.c.a | |
| Department | ||
| Organization | Nalanda Open University | |
| Position | ||
| Exam Date | 2016 | |
| City, State | bihar, patna |
Question Paper
N A L A N D A O P E N U N I V E R S I T Y
Master of Computer Application Part-I
PAPER-VIII
(Advanced Discrete Mathematics)
Annual Examination, 2016
Time 3 Hours. Full Marks 80
Answer any Five Questions.
All questions carry equal marks.
1. Define the following with example
Null Graph
Pseudo Graph
Complete Graph
2. Using Induction, verify that 1
3. Find the complete solution of the recurrence an
4. Prove the Binomial Identity
5. Solve the recurrence relation for Catalan numbers given by
6. Find the edge chromatic number of C n .
Give an edge colouring of the Peterson graph.
7. Show that C 6 is bipartite and K 3 is not bipartite.
Is the sub graph of a bipartite graph bipartite Give reasons for your answers.
8. Prove that the sum of the degree of all the vertices of any graph is even.
Prove that any graph can only have an even number of odd vertices.
9. Draw at least 3 non-Isomorphic graphs on four vertices.
Is every sub graph of a regular graph regular Give reasons for your answer.
10. For which values of m and n is Km, n a tree
For which values of n is kn Eulerian
Master of Computer Application Part-I
PAPER-VIII
(Advanced Discrete Mathematics)
Annual Examination, 2016
Time 3 Hours. Full Marks 80
Answer any Five Questions.
All questions carry equal marks.
1. Define the following with example
Null Graph
Pseudo Graph
Complete Graph
2. Using Induction, verify that 1
3. Find the complete solution of the recurrence an
4. Prove the Binomial Identity
5. Solve the recurrence relation for Catalan numbers given by
6. Find the edge chromatic number of C n .
Give an edge colouring of the Peterson graph.
7. Show that C 6 is bipartite and K 3 is not bipartite.
Is the sub graph of a bipartite graph bipartite Give reasons for your answers.
8. Prove that the sum of the degree of all the vertices of any graph is even.
Prove that any graph can only have an even number of odd vertices.
9. Draw at least 3 non-Isomorphic graphs on four vertices.
Is every sub graph of a regular graph regular Give reasons for your answer.
10. For which values of m and n is Km, n a tree
For which values of n is kn Eulerian
Other Question Papers
Subjects
- (internet concepts and web design
- accounting & financial management
- advanced database design
- advanced discrete mathematics
- advanced internet technologies
- advanced internet technologies and computer graphics set-i
- advanced internet technologies and computer graphics set-ii
- application development with .net framework
- artificial intelligence and knowledge management
- c and assembly language programming
- communication skill
- communication skills
- computer graphics and multimedia
- computer networking
- computer organization
- computer organization and assembly language programming
- data and file structures
- data communication and computer networks
- database management system
- design and analysis of algorithm
- discrete mathematics
- internet concepts and web design
- introduction to database management systems
- lab (for data and file structures, networking and java programming)
- laboratory course
- management and information system
- mcs-041 : operating systems
- numerical and statistical computing
- object oriented analysis and design
- object oriented programming using java
- object oriented technologies and java programming
- operating system
- operating system concepts and networking management
- operating systems
- principles of management and information systems
- problem solving and programming
- problem solving using c
- software engineering
- system analysis and design
- systems analysis and design
- unix and oracle
- unix and oracle set-i
- unix and oracle set-ii