MFCS
1
MOCK TEST EXAM Class: BCA 2nd sem Sub: MFCS MM: 80 Attempt five questions by selecting one question from each section. Question 1 is compulsory. Each question carry equal marks. Q1. Explain these terms: (a) Sorting (b) Searching (c) Graphs (d) Recurrence relation Section-A Q2. Explain the frequency distribution table with the help of example. Q3. Explain: (a) Mean, Mode and Median (b) Range, Variance and Standard Deviation Section-B Q4. (a) Define the term Algorithm with it merits and demerits. (b) Explain Binary Search Algorithm with the help of example. Q5.(a) Explain the different types of graph. Define isomorphic and homeomorphic graphs. Section-C Q6. Define minimum spanning tree. Explain the algorithm for finding minimum spanning tree. Q7. What is Sorting. Explain Merge sort algorithm. Section-D Q8. Explain public key encryption schemes. Q9. Explain the concept of principle of mathematical induction.
description
mathematical foundation computer science mock test
Transcript of MFCS
MOCK TEST EXAMClass: BCA 2nd sem Sub: MFCS
MM: 80Attempt five questions by selecting one question from each section. Question 1 is compulsory. Each question carry equal marks.Q1. Explain these terms:
(a) Sorting(b) Searching(c) Graphs(d) Recurrence relation
Section-AQ2. Explain the frequency distribution table with the help of example. Q3. Explain: (a) Mean, Mode and Median (b) Range, Variance and Standard Deviation
Section-BQ4. (a) Define the term Algorithm with it merits and demerits. (b) Explain Binary Search Algorithm with the help of example.Q5.(a) Explain the different types of graph. Define isomorphic and homeomorphic graphs.
Section-CQ6. Define minimum spanning tree. Explain the algorithm for finding minimum spanning tree.Q7. What is Sorting. Explain Merge sort algorithm.
Section-DQ8. Explain public key encryption schemes.Q9. Explain the concept of principle of mathematical induction.
