DATA STRUCTURE USING C++ - 2017 | B.SC CS 2ND YEAR | MJPRU | EXAM PAPER | My CS Tutorial - My CS Tutorial

Breaking

Programming languages full tutorial and programs, exam papers, visual basic( Vb.net ), information of new technologies and more....

Sunday, August 2, 2020

DATA STRUCTURE USING C++ - 2017 | B.SC CS 2ND YEAR | MJPRU | EXAM PAPER | My CS Tutorial


Data structure using c++ | My CS Tutorial

Paper code: 13515
1515
B.Sc. (Computer Science) (Part 2)
Examination, 2017
Paper No. 2.3
DATA STRUCTURES USING C++

Time: Three Hours][Maximum Marks: 34

Note: Attempt five questions in all. Question No. 1 is compulsory.
1. (a) What is OPPs? How does it differ from procedure oriented programming?
(b) What do you mean by data structure? Difference between linear data structure and non-linear data structure.
2. Write a C++ program to sort an array of 10 integer elements.
3. What are Functions? How can one overload function? Explain with appropriate example.
4. What is Inheritance? Explain various types of inheritance with a neat diagram of each.
5. Explain the following:
  1. Linked list
  2. Various operations on stacks
6. (a) Differentiate between the following:
  1. Constructor and destructor
  2. Graph and Tree
(b) Name and various traversal operations of trees.
7. (a) What are Virtual Function? Why one need it? Explain with an appropriate programming example.
(b) What do you mean by the error handling?
8. (a) What are various storage classes in C++?
(b) Define height of tree with an appropriate example.
9. Write short notes on any two of the following:
  1. Loops
  2. Files and streams
  3. Pointers

_______________________________________


Please share this post and blog link with your friends.For more programs use this blog.

If you have any problem, please comment in comment box, subscribe this blog for notifications of new post on your email and follow this blog.If you have any method of this tutorial or program or want to give any suggestion send email on hc78326@gmail.com

Created by-- HARSH CHAUHAN

No comments:

Post a Comment