About this question paper
This is the previous year question paper of Mathematics Fundamental of Computer Science (MA, MSc) (Semester 3) conducted by Pt. Ravishankar Shukla University, Raipur (Jan 2021). Practising it helps you understand the exam pattern, important questions and marks distribution of your university.
How to prepare with this paper
- पूरा पेपर एक बार पढ़ें और जो प्रश्न आपको आते हैं उन पर निशान लगाएँ।
- देखें कि हर प्रश्न सिलेबस की किस इकाई से है — जो इकाइयाँ बार-बार आती हैं, वही सबसे ज़रूरी हैं।
- बिना नोट्स देखे 3 घंटे में पेपर हल करें, फिर अपनी किताब से उत्तर मिलाएँ।
- इसी विषय के दूसरे वर्षों के पेपर भी डाउनलोड करें और दोहराए गए प्रश्न ढूँढें।
Questions in this paper (text version)
यह टेक्स्ट मूल PDF से लिया गया है ताकि आप इसे जल्दी पढ़ और खोज सकें। सूत्र, चित्र और हिंदी टेक्स्ट सही न दिखें तो ऊपर दी गई PDF देखें।
MATHEMATICS
Paper Third
(Fundamental of Computer Science)
Time : Three Hours ] [ Maximum Marks : 70
Note : Attempt all Sections as directed.
(Objective/Multiple Choice Questions)
Note : Attempt all questions.
Choose the correct answer :
2. Which is not a type of constructor ?
(a) Default
(b) Copy
(c) Reference
(d) Parameterized
3. Which of the following is used for implementing the late
binding ?
(a) Operator function
(b) Constraint function
(c) Virtual function
4. Which of the following refers to using the existing code
instead of rewriting it ?
(a) Inheritance
(b) Encapsulation
(c) Abstraction
(a) Inheritance
(b) Virtual function
(c) Templates
6. Operator overloading is also called ........... polymorphism.
(a) run time
(b) initial time
(c) compile time
(d) completion time
7. Which one of the following is the process of inserting an
element in the stack ?
(a) push
(b) insert
(c) add
8. Which data structure is required to convert the infix to prefix
notation ?
(a) link list
(b) stack
(c) binary tree
9. Which of the following principles does queue use ?
(a) LIFO principle
(b) FIFO principle
(c) Linear tree
(d) Ordered array
10. What is full binary tree ?
(a) Each node has exactly zero or two children.
(b) Each node has exactly two children.
11. Which of the following is false about binary search tree ?
(a) The left child is always lesser than its parent.
trees.
(d) In order sequence give decreasing order of elements.
12. On which algorithm is heap sort based on ?
(a) Fibonacci heap
(c) Binary tree
(d) FIFO
13. How many arrays are required to perform deletion operation
in a heap ?
14. Which of the following sorting algorithms is fastest ?
(a) Merge sort
(b) Quick sort
(c) Insertion sort
(d) Shell sort
15. What will be the number of passes to sort the elements using
insertion sort ?
(Very Short Answer Type Questions)
Note : Attempt all questions.
1. What is object oriented programming ?
2. What is destructor ?
3. Define polymorphism.
4. What do you mean by inheritance in OOP ?
5. What is a linear data structure ?
7. Write any two rules for B-tree.
8. Write the function supported by Binary Search tree.
9. What is a Hash Table ?
10. What is Shell Sort ?
(Short Answer Type Questions)
Note : Attempt any six questions.
1. Explain, which member function of class define outside of
class.
2. Explain nested classes.
3. What is multiple inheritance ? Write its syntax.
4. Write difference between virtual and pure virtual function.
5. Explain postfix expression with example.
6. What is doubly linked list ?
7. Explain insertion sort.
8. What is sorting technique ? What is its use in data
structure ?
(Long Answer Type Questions)
Note : Attempt any five questions.
1. Explain the feature of object oriented programming.
2. Write a program to print factorial of number using class,
object and member function.
3. Explain function overloading with example.
4. Explain multilevel inheritance with example.
5. Write complete note on binary tree.
6. Explain quick and heap sort.