About this question paper
This is the previous year question paper of Mathematics Fundamentals of Computer Science 1 (MA, MSc) (Semester 3) conducted by Atal Bihari Vajpayee Vishwavidyalaya, Bilaspur (Dec 2020). 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 देखें।
Paper- VIII
Time:-Three House. I [Maximum Marks:080
=itc from Both the Section as Directed. The Figures in the right-hand margin
Note: Answer
indicate marks,
Q,1 Choose the correct answer or fiIl in the blanks as required: is
iiitl Not ensued. (iv) very low
(b) The principal ofabstraction ... ..' duplication
(i) is used to achieve oopr. ilir ls used to avoid
;;,' The combination ofabslraction ofthe dara and code is viewed in '
iil True (iD False;
I iii) Anont mous class tivl Abstract class
lii which ofthe lollouing feature is also known as runlime binding or late binding?
iij Dynamic twping (iD Dvnamic loading
iit dhat is the extra- feature is classes which was not in the struclue?
ra) What is oops? (b) What is a class
SECTION 12x5
Answer any five ofthe following question:
3. How do procedural programming and oop differ?
4. What is data structwe? Explain their types?
5. what is an array? Write multidimensional anay?
6. What is a stack? What is the application of stack?
,1, How is a stack different from a queue? Write applications ofqueue'
8. Explain an AvL hee and Binary search tree?
9. Explain open and close hashing.
t2. Explain Nested classes and pointer.