bsc-3-sem-computer-science-ad-1833-s-2023.pdf

AD–1833 B.Sc. Part–II Semester–III Examination COMPUTER SCIENCE/COMPUTER APPLICATIONS/INFORMATION TECHNOLOGY (Data Structure & C++) Time :...

AD–1833 B.Sc. Part–II Semester–III Examination COMPUTER SCIENCE/COMPUTER APPLICATIONS/INFORMATION TECHNOLOGY (Data Structure & C++) Time : Three Hours] [Maximum Marks : 80 1 3 4 Note :— (1) All questions are compulsory. (2) Question No. 1 carries 8 marks and all other questions carry 12 marks each. (3) Assume suitable data wherever necessary. 3 41 1. (A) Fill in the blanks :— (i) Adding an element into stack is called ______ operation. (ii) The deletion in linked list if START = NULL is that situation is called ______. (iii) Assigning one or more function body to the same name is known as ______. (iv) The variable declared inside a class are known as ______. 2 (B) Choose the correct alternatives :— (i) Accessing each node exactly once is called : (a) Traversing 1 3 (b) Searching (c) Algorithm 4 (d) Sorting (ii) The first node of tree is called : (a) Leaf node (b) Terminal node (c) Root node (d) First node (iii) Which of the following concepts means wrapping up of data and function together ? (a) Abstraction (b) Encapsulation (c) Inheritance (d) Polymorphism (iv) A special member function which is invoked automatically when an object is to be destroyed is called : (a) Constructor (b) Destructor (c) Copy constructor (d) None of these 2 (C) Answer in one sentence each :— (i) 1 3 What is linear data structure ? 1 3 4 (ii) What is linked list ? 4 (iii) What is data hiding ? (iv) What is operator overloading ? 4 LT—28412 1 (Contd.) 2. (A) What is Data Structure ? Explain the different types of data structure with example. 6 (B) What is Stack ? Write an algorithm to insert the element into the stack 6 OR 3. (A) Explain the different operations performed on data structure. 6 (B) What is Array ? Explain the memory representation of array. 6 4. (A) What is Queue ? Explain the algorithm to delete an element from the queue. 6 13 (B) Write an algorithm to insert a new node after a given node. 6 5. 4 (A) Explain the following : OR (i) Circular queue 3 41 (ii) Dequeue (iii) Priority queue 6 (B) Write an algorithm to search an element in linked list. 6 6. (A) Explain binary tree with example. 6 (B) What is sorting ? Write an algorithm to sort the elements using bubble sort method. 6 OR 7. 3 (A) Explain traversing of binary tree. Write preorder, inorder and postorder of following tree : 1 A 4 B C D E F 6 (B) Explain the sequential and binary searching techniques with example. 6 8. (A) What is object oriented programming ? Explain its various features. 6 (B) Explain scope resolution operator with suitable example. 6 OR 9. (A) Explain console I/O operations with suitable example. 6 (B) Explain data members, member functions and accessing members. 6 13 13 10. (A) What is function in C++ ? Explain passing and returning objects from function. 6 4 (B) Explain array of objects with suitable example. OR 4 6 LT—28412 2 (Contd.) 11. (A) Explain the concept of inline function with suitable example. 6 (B) Explain 'this pointer' with suitable example. 6 12. (A) What is inheritance ? Explain with its types and example. 6 (B) Explain the following with example : (i) Virtual base class (ii) Abstract base class 6 4 13 OR 13. (A) What is operator overloading ? Explain the rules of operator overloading with example.6 (B) What is visibility mode ? What are the different inheritance visibility modes supported by C++ ? 6 3 41 1 3 4 1 3 1 3 4 4 LT—28412 3 25