Exam Details
| Subject | Mathematical Foundation And Algorithm Design | |
| Paper | ||
| Exam / Course | MBA - Information Technology Management (MBAITM) | |
| Department | School of Computer and Information Sciences (SOCIS) | |
| Organization | indira gandhi national open university | |
| Position | ||
| Exam Date | December, 2015 | |
| City, State | new delhi, |
Question Paper
1. Explain in detail binary search algorithm. The answer should contain the problem definition, the input, output and the procedure of algorithm. Write the definition of time complexity. Write time complexity of binary search algorithm.
2. Answer the following
One million trees grow in a forest. It is known that no tree has more six lakhs leaves. Show that at any moment there are two trees in the forest that have exactly same number of leaves.
How many steps are needed to swap two variables Does the answer change if we do not use the intermediate variable?
Show that if any 26 people are selected then we may choose a subset of 4 people, so that all 4 were born on the same day of the week.
How many different arrangements are there of the letters of the word primes?
How many of those arrangements have p as the first letter
How many have p as the last letter or in any specified position
How many will have r and i together?
Suppose S is a set of n integers. Prove that there exist distinct b € S such that a is a multiple of n.
Show that v is tautology.
Write a recursive algorithm to generate Fibonacci number for a given positive integer n
A door can be opened only with a security code that consists of five buttons: 9. A code consists of pressing anyone button, or any two, or any three, or any four, or all five. How many possible codes are there (You are to press all the buttons at once, so the door doesn't matter).
Find the inverse of A is
1 2
2 6
1 1 7
Give the definition and example of the following:
A complete graph
A pseudo graph
A multi graph
Explain the divide and conquer algorithm for problem solving.
What is the degree of a vertex? Draw a non-simple graph G with degree sequence 7).
Find the minimal spanning tree of the graph given below:
<img src='./qimages/15119-7b.jpg'>
Explain Bubble Soft Algorithm and its Time Complexity.
Let and 7 then find and R*.
For each of the following, draw a Venn diagram and shade the region corresponding to the indicated set.
Explain how mathematical techniques are required for design algorithms, with the help of example.
2. Answer the following
One million trees grow in a forest. It is known that no tree has more six lakhs leaves. Show that at any moment there are two trees in the forest that have exactly same number of leaves.
How many steps are needed to swap two variables Does the answer change if we do not use the intermediate variable?
Show that if any 26 people are selected then we may choose a subset of 4 people, so that all 4 were born on the same day of the week.
How many different arrangements are there of the letters of the word primes?
How many of those arrangements have p as the first letter
How many have p as the last letter or in any specified position
How many will have r and i together?
Suppose S is a set of n integers. Prove that there exist distinct b € S such that a is a multiple of n.
Show that v is tautology.
Write a recursive algorithm to generate Fibonacci number for a given positive integer n
A door can be opened only with a security code that consists of five buttons: 9. A code consists of pressing anyone button, or any two, or any three, or any four, or all five. How many possible codes are there (You are to press all the buttons at once, so the door doesn't matter).
Find the inverse of A is
1 2
2 6
1 1 7
Give the definition and example of the following:
A complete graph
A pseudo graph
A multi graph
Explain the divide and conquer algorithm for problem solving.
What is the degree of a vertex? Draw a non-simple graph G with degree sequence 7).
Find the minimal spanning tree of the graph given below:
<img src='./qimages/15119-7b.jpg'>
Explain Bubble Soft Algorithm and its Time Complexity.
Let and 7 then find and R*.
For each of the following, draw a Venn diagram and shade the region corresponding to the indicated set.
Explain how mathematical techniques are required for design algorithms, with the help of example.
Other Question Papers
Departments
- Centre for Corporate Education, Training & Consultancy (CCETC)
- Centre for Corporate Education, Training & Consultancy (CCETC)
- National Centre for Disability Studies (NCDS)
- School of Agriculture (SOA)
- School of Computer and Information Sciences (SOCIS)
- School of Continuing Education (SOCE)
- School of Education (SOE)
- School of Engineering & Technology (SOET)
- School of Extension and Development Studies (SOEDS)
- School of Foreign Languages (SOFL)
- School of Gender Development Studies(SOGDS)
- School of Health Science (SOHS)
- School of Humanities (SOH)
- School of Interdisciplinary and Trans-Disciplinary Studies (SOITDS)
- School of Journalism and New Media Studies (SOJNMS)
- School of Law (SOL)
- School of Management Studies (SOMS)
- School of Performing Arts and Visual Arts (SOPVA)
- School of Performing Arts and Visual Arts(SOPVA)
- School of Sciences (SOS)
- School of Social Sciences (SOSS)
- School of Social Work (SOSW)
- School of Tourism & Hospitality Service Sectoral SOMS (SOTHSM)
- School of Tourism &Hospitality Service Sectoral SOMS (SOTHSSM)
- School of Translation Studies and Training (SOTST)
- School of Vocational Education and Training (SOVET)
- Staff Training & Research in Distance Education (STRIDE)
Subjects
- Advance Signal And Image Processing
- Advanced Marketing Management
- Applied Artificial Intelligence
- Artificial Vision System
- Business Statistics
- Enterprise Resource Planning - II
- Enterprise Resource Planning-I
- Financial Statement Analysis
- Marketing Strategy
- Mathematical Foundation And Algorithm Design
- Mobile Autonomous Robots
- Production Planning And Control
- Programming Methodologies
- Quantitative Techniques
- Statistical Signal Analysis