VALLIAMMAI ENGNIEERING COLLEGE SRM Nagar, Kattankulathur DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING QUESTION BANK

Save this PDF as:
Size: px
Start display at page:

Download "VALLIAMMAI ENGNIEERING COLLEGE SRM Nagar, Kattankulathur DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING QUESTION BANK"

Transcription

1 VALLIAMMAI ENGNIEERING COLLEGE SRM Nagar, Kattankulathur DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING QUESTION BANK Degree & Branch : B.E E.C.E. Year & Semester : II / IV Section : ECE 1, 2 & 3 Subject Code : EC6301 Subject Name : OOPS AND DATA STRUCTURES Name of the Teacher : Ms. A. Lalitha, Ms. N. Meenakshi and Ms. V. Prema UNIT - I DATA ABSTRACTION & OVERLOADING PART A S. No 1 Infer the features of Object Oriented Programming. BTL -4 Analyzing 2 Distinguish between Procedure Oriented Programming and Object Oriented programming. BTL -2 Understanding 3 Which is used for data hiding in C++? List its types. BTL -1 Remembering 4 Collect the use of scope resolution operator. BTL -1 Remembering 5 Assess the control structures used in C++. BTL -5 Evaluating 6 Define a class and object BTL -1 Remembering 7 Differentiate between structures and class. BTL -2 Understanding 8 Analyze the theme behind Encapsulation and Data Abstraction. BTL -4 Analyzing 9 Name the access modes used within a class. BTL -1 Remembering 10 Summarize polymorphism and its types. BTL -5 Evaluating 11 Create a C++ code to swap two variable using reference variables in function. BTL -6 Creating 12 Illustrate constructor and its characteristics. BTL -3 Applying 13 Show various types of constructors with example. BTL -3 Applying 14 Point out the characteristics of member functions. BTL -4 Analyzing 15 Generalize about friend function. BTL -6 Creating 16 Quote the properties of a static data member and function. BTL -1 Remembering 17 Discuss about proxy class and container class BTL -2 Understanding 18 Demonstrate function overloading and operator overloading. BTL -3 Applying Page 1

2 19 Give the types of operator overloading with an example. BTL -2 Understanding 20 Describe any four operators that cannot be overloaded in C++. BTL -1 Remembering PART B S. No 1 Discuss in detail about the basic concepts of object oriented programming. (13) BTL -2 Understanding 2 Compare the concept of constructor and destructor? Explain with suitable example the different types of constructors in C++. (13) BTL -4 Analyzing 3 Define a supplier class. Assume that the items supplied by any given supplier are different and varying in number. Use dynamic memory allocation in the constructor function to achieve the solution. (13) BTL -1 Remembering 4 i) Write a Program For Fibonacci Series Using Loop In C++. (10) ii) Write a program to swap two numbers in C++. (3) BTL- 1 Remembering i) Describe in detail about structure and compare the members of 5 structure and class with an example program. BTL -1 Remembering ii) Examine in detail about friend function with an example Develop a program to get the student details and print the same using pointers to objects and pointers to members of a class. Create a class student. And use appropriate functions and data members. i) Assess the advantages of using default arguments Explain with example program. ii) Write a member function and friend function to test the subtraction of two complex numbers in C++. i) Express a C++ program to find the mean value of a given number using friend function. ii) Express a Program to Find Prime Number Using For Loop In C++. What is a proxy class and identify container classes and integrators with suitable code? i) Demonstrate the ways in which member function of the class can be derived and called using a suitable example program. ii) Apply an example to static members. Differentiate between pointer to constant and constant pointers? Give an example program and explain it. i) Give a program to interpret how a static data is accessed b y a static member function. ii) Express a member function to extend the concept of matrix addition, simple addition and string concatenation by overloading + operator. (13) BTL-6 Creating BTL -5 Evaluating BTL- 2 Understanding (13) BTL -1 Remembering BTL- 3 Applying (13) BTL- 4 Analyzing BTL-2 Understanding Page 2

3 13 14 Illustrate about Unary Operator and Binary Operator Overloading with program. i) Connect function overloading concept with an example program. ii) Point out the concept of reference variables. With example (13) BTL -3 Applying BTL -4 Analyzing PART C 1 2 Consider A book shop maintains the inventory of books that are being sold at the shop. The list includes details such as author, title, price, publisher and stock position. Whenever a customer wants a book, the sales person inputs the title and author and the system searches the list and displays whether it is available or not. If it is not, an appropriate message is displayed. If it is, then the system displays the book details and requests for the number of copies required. If the requested copies are available, the total cost of the requested copies is displayed; otherwise the message required copies not in stock is displayed. Deduce a system using a class called books with suitable member functions and constructors. Use new operator in constructors to allocate memory space required. Create a base class called shape. Use this class to store to store two double type values that could be used to compute the area of figures. Derive two specific classes called triangle from the base shape. Add to the base class, a member function get_data() to initialize base class data members and another member function display_area() to compute and display the area of figures. Make display_area() as a virtual function and redefine this function in the derived classes to suit their requirements. Using these three classes, design a program that will accept dimensions of a triangle or a rectangle interactively, and display the area. Remember the two values given as input will be treated as lengths of two sides in the case of rectangles, and as base and height in the case of triangles, and used as follows: Area of rectangle = x * y Area of triangle = ½ * x * y (15) BTL -5 Evaluating (15) BTL-6 Creating UNIT-II INHERITANCE AND POLYMORPHISM PART-A S. No 1 Define Message Passing. BTL -1 Remembering Page 3

4 2 There are several restrictions in C++ while using static keyword. Support your views. BTL -5 Evaluating 3 Create syntax for overriding. BTL -6 Creating 4 Demonstrate on how a private member be made inheritable? BTL -3 Applying 5 List out the types of inheritance. BTL -1 Remembering 6 Give the syntax for inheritance. BTL -2 Understanding 7 When did you use the multi-level inheritance? BTL -1 Remembering 8 Examine multiple inheritances. BTL -1 Remembering 9 Infer concept of Hierarchical inheritance. BTL -4 Analyzing 10 Assess about Hybrid inheritance. BTL -5 Evaluating 11 Describe cross casting and down casting. BTL -1 Remembering 12 Illustrate the role of constructors and destructors in derived classes. BTL -3 Applying 13 Identify the syntax for virtual base class. BTL -1 Remembering 14 Differentiate Compositions versus. Inheritance. BTL-4 Analyzing 15 Discuss about virtual function. BTL -2 Understanding 16 Apply your understanding about this pointer. Write a sample code to show the usage of this pointer in C++. BTL -3 Applying 17 Generalize the term Abstract base class. BTL -6 Creating 18 Extend your views about Abstract class and concrete class. BTL -2 Understanding 19 Compare virtual function and pure virtual function. BTL -4 Analyzing 20 Summaries thevirtual destructor. BTL -2 Understanding PART-B S. No 1 Interpret the various types of Inheritance with suitable example program. (13) BTL -2 Understanding 2 Develop a C++ code to construct classes of a person name and age as public properties, account details as private properties and percentage of mark as protected properties. Construct the class with sports details of the person. Construct a class to rank the based on the equal weightage to academic and sports details. Use inheritance concept. (13) BTL -6 Creating Infer a student class. Inherit that into MCAStudent class and NonMCAStudent. MCA Students inherits into GLSStudents and 3 NonGLSStudents. A function HowPracticalHours can only be applied to MCAStudents. We have a base class Student pointer to a (13) BTL -4 Analyzing GLSStudentobject. Usedynamic_cast to check that NonMCA Students do not Show PracticalHours. 4 List out the use of template? Write an overloaded function template called max( ), which will find the maximum of any two given integers. (13) BTL -1 Remembering 5 Discuss in detail about casting class pointers and member functions. (13) BTL -2 Understanding Page 4

5 6 Examine the different forms of inheritance supported in C++? Discuss on the visibility of base class members in privately and publicly inherited (13) BTL -1 Remembering classes. 7 Criticize class object to Base and Base to class object conversions using C++ with suitable examples. (13) BTL-5 Understanding i) Discover your understanding about this pointer? Explain with 8 example. BTL- 3 Applying ii) Show your understanding about concreate classes with example. 9 Express the abstract classes? Give an example (with the program) to illustrate the use of abstract class. (13) BTL -2 Understanding 10 Explain virtual functions and pure virtual functions with example. What are the rules associated with virtual functions? (13) BTL -4 Analyzing 11 i) Describe in detail about Dynamic Binding with example. ii) Define virtual destructor? Explain the use of it with an example. BTL -1 Remembering 12 i) When constructor overloading is used confer with example. ii) Identify Dynamic initialization through constructors.with example BTL- 1 Remembering 13 Apply your understanding about static binding and dynamic binding. (13) BTL- 3 Applying 14 Differentiate Overloading and Overriding with an example program. (13) BTL- 4 Analyzing PART C 1 Test the code and correct the errors. Write the corrected code and output. #include<iostream.h> class room float mwidth; float mlength; public: room() } room(float w, float h) :mwidth(w), mlength(h) } operator float() return (float)mwidth * mlength; } float getwidth() } (15) BTL-5 Understanding Page 5

6 float getlength() return mlength; } }; void main() room objroom1(2.5, 2.5); float ftotalarea; ftotalarea=objroom1; cout << ftotalarea; } 2 Assume that a bank maintains two kinds of accounts for customers, one called as savings account and the other as current account. The savings account provides compound interest and withdrawal facilities but no cheque book facility. The current account provides cheque book facility but no interest. Current account holders should also maintain a minimum balance and if the balance falls below this level, a service charge is imposed. Prepare a class account that stores customer name, account number and type of account. From this derive the classes cur_acct and sav_acct to make them more specific to their requirements. Include necessary member functions in order to achieve the following tasks: a) Accept deposit from a customer and update the balance. b) Display the balance. c) Compute and deposit interest. d) Permit withdrawal and update the balance. e) Check for the minimum balance, impose penalty, necessary, and update the balance. Do not use any constructors. Use member functions to initialize the class members. Rewrite the code with these modifications. (15) BTL -6 Creating UNIT III LINEAR DATA STRUCTURES PART-A S. No 1 Where did you use the Data structure in the computer system? BTL -1 Remembering 2 Name ADT (Abstract Data Type) operations. BTL -1 Remembering 3 Summarize linear data structure and Non linear data structure. BTL -5 Understanding 4 List the different types of Linked List. BTL -1 Remembering Page 6

7 5 contrast between array and linked list BTL -2 Understanding 6 Explain the term single linked list. BTL -4 Analyzing 7 Show how to create a new node. BTL -3 Applying 8 Generalize the use of header pointer and Null pointer in a linked list. BTL -6 Creating 9 Apply your understanding about dummy header. BTL -3 Applying 10 Illustrate about circular linked list. BTL -3 Applying 11 Define push and pop operations. BTL -1 Remembering 12 When did you use the stack in the computer system? BTL -1 Remembering 13 Differentiate stack and queue. BTL -4 Analyzing 14 Associate the conditions that are followed in the array implementation of queue. BTL -2 Understanding 15 Differentiate between stack and queue and give its application. BTL -2 Analyzing 16 Point out any two data structures used in Operating System. BTL -4 Analyzing 17 Tabulate prefix, infix and postfix notations. BTL -1 Remembering 18 Rewrite the following expression into postfix and prefix forms. A+B*(C-D)/(P-R) BTL -6 Creating 19 Evaluate the value of the expression ab+c*d- using stack. BTL -5 Evaluating 20 Give ADT representation used to evaluate arithmetic expressions? BTL -2 Understanding PART B S. No 1 Explain Array based implementation of list with an example program. (13) BTL -4 Analyzing 2 Summarize in detail about linked list ADT with suitable example. (13) BTL -2 Understanding 3 Name the Queue ADT operation for insertion and deletion routine in linked lists. (13) BTL -1 Remembering 4 i) Demonstrate the concept of pointer implementation and cursor implementation. ii) Show a C++ function to test whether a linked list is empty using cursor implementation. BTL 3 Applying 5 i) Point out the application of stack. ii) Infer in detail about Circular linked list. BTL 4 Analyzing 6 Describe in detail about the implementation stack using linked list. (13) BTL 1 Remembering 7 Identify the ADT operation for insertion and deletion routine in stack using array implementation. (13) BTL-1 Remembering 8 Explain the array and linked list implementation of queue operation (13) BTL -3 Applying 9 i) Write the applications of queue. ii) Differentiate between stack and queue. BTL 2 Understanding 10 Evaluate the following postfix expression * * -. (13) BTL -5 Evaluating 11 Givea procedure to convert an infix expression a+b*c+(d*e+f)*g to postfix notation. (13) BTL -2 Understanding Page 7

8 i) Tabulate the process of postfix valuation with an example. ii) Identify balancing symbols with example. Analyze the process of conversion from infix expression to postfix using stack. Formulate an algorithm to add and subtract two polynomials P1 and P2. BTL -1 Remembering (13) BTL -4 Analyzing (13) BTL -6 Creating PART C 1 A deque is a data structure consisting of a list of items, on which the following operations are possible: Push (X,D): Insert item X on the front end of deque D. Pop(D): remove the front item from deque D and return it. Inject(x,D): Insert item X on the rear end of deque D. Eject(D): Remove the rear item from deque that take O(1) time per operation. Combine the above mentioned operations and write a C++ code to formulate deque operations. 2 Recommend a suitable C++ code to swap two adjacent elements by adjusting only the pointers using: a. Singly linked lists. b. Doubly linked lists. (15) BTL -6 Creating (15) BTL -5 Evaluating UNIT-IV NON-LINEAR DATA STRUCTURES PART A S.No 1 Compose the term height and depth of the tree. BTL -6 Creating 2 Show the number of trees possible with 3 nodes? BTL -3 Applying 3 Define Binary tree and list its properties? BTL -1 Remembering 4 Describe the two methods of binary tree implementation? BTL -1 Remembering 5 Calculate the maximum number of nodes in a binary tree of Height H is 2 H+1-1. BTL -3 Applying 6 Point out the applications of binary tree. BTL -4 Analyzing 7 Grade the different type of tree traversal. BTL -5 Evaluating 8 Name the type of binary tree. BTL -1 Remembering 9 Generalize the term equivalence relation. BTL -6 Creating 10 Discuss about union operation. BTL -2 Understanding 11 Label the different types of union. BTL -1 Remembering 12 Tabulate Graph and Acyclic graph. BTL -1 Remembering 13 Compare and contrast in-degree and out degree of the graph. BTL -4 Analyzing Page 8

9 14 Demonstrate an acyclic graph. BTL -3 Applying 15 List out the different ways of representing graph. BTL -1 Remembering 16 Analyze the two traversal strategies used in traversing graph. BTL -4 Analyzing 17 Differentiate path and Cycle of the graph. BTL -2 Understanding 18 Associate DFS and BFS. BTL -2 Understanding 19 Express the tree and a graph. BTL -2 Analyzing 20 Summarize about connected components. BTL -5 Evaluating PART B S.N o Write short note on the following terms related to tree: i) Path (2) ii) Degree (2) 1 iii) Level (3) BTL -1 Remembering iv) Leaves (2) v) Child (2) vi) Height (2) 2 Apply your understanding to explain about binary search tree and draw the binary search tree for the following input list 60, 25,75,15,50,66,33,44. Trace an algorithm to delete the nodes 25, 75, (13) BTL -3 Applying 44 from the tree. 3 Infer the various tree traversal and predict a binary tree with Preorder:ABCDEFGHI and Inorder:BCAEDGHF (13) BTL -4 Analyzing 4 Summarize the two applications of tree with a neat example. (13) BTL -2 Understanding 5 Conclude the types of tree traversal methods? Explain it with example and deduce a routine for each of them. (13) BTL -5 Evaluating i) Express your understanding by finding the inorder, preorder and postorder form for the following graph: (10) 6 BTL - 2 Understanding 7 8 (3) ii) Give some applications of trees. Analyze in detail the implementation of Binary Search Tree and perform its operations. (13) BTL - 4 Analyzing i) Point out and evaluate the dynamic equivalence problem. BTL -4 Analyzing Page 9

10 ii) Explain the path compression algorithm and analyze the Union/Find algorithm used. 9 Describe in detail about the smart union algorithm. (13) BTL -1 Remembering 10 Define graph? List out the different ways for representing the graph and explain them with example? (13) BTL -1 Remembering i) Tabulate the following graph using breadth first search. (8) 11 BTL - 1 Remembering ii) Examine BFS and DFS with suitable example. i) Illustrate the following graph using depth first search. (8) 12 BTL - 3 Applying (5) ii) Demonstrate a C++ routine for BFS and DFS. 13 Interpret in detail about BFS and DFS with suitable examples. (13) BTL -2 Understanding 14 Compose an example in detail about connected component. (13) BTL -6 Creating PART C 1 Generalize the trem binary search tree and do the following operations. a) Show the result of inserting 3,1,4,6,9,2,5,7 into an initially empty binary search tree. b) Show the result of deleting the root. (15) BTL -6 Creating 2 Consider the following graph: a) Measure the shortest path from A to all other vertices for the following (8) graph: b) Evaluate the shortest unweighted path from B to all other vertices for the graph. BTL -5 Evaluating Page 10

11 UNIT-V SORTING AND SEARCHING PART A Level Competence Level Competence 1 Express your views about sorting. BTL -2 Understanding 2 Label the two main classifications of sorting based on the source of data. BTL -1 Remembering 3 Analyze the applications of external and internal sorting. BTL -4 Analyzing 4 Identify the purpose of quick sort. BTL -1 Remembering 5 Assess the advantage of merge sort. BTL -5 Evaluating 6 Define median three partitioning. BTL -1 Remembering 7 Associate divide and conquer technique with merge sort. BTL -2 Understanding 8 Examine the purpose of insertion sort. BTL -1 Remembering 9 Summarize about merge sort. BTL -2 Understanding 10 List out the advantages of merge sort. BTL -1 Remembering 11 Point out the key characteristics of binary search. BTL -4 Analyzing 12 Differentiate linear search and binary search. BTL -2 Understanding 13 Name the techniques used to choose the pivot element for quick sort. BTL -1 Remembering 14 Infer why quick sort is more efficient than merge sort. BTL -4 Analyzing 15 Show the advantage of merge sort. BTL -3 Applying 16 Create algorithm for quick sort and insertion sort. BTL -6 Creating 17 Support your views about insertion sort with example BTL -5 Evaluating 18 Trace the steps of insertion sort 12, 19, 33, 26, 29, 35, 22. Illustrate the total number of comparisons made during sorting. BTL -3 Applying 19 Calculate the time complexity of quick sort and binary search. BTL -3 Applying 20 Rearrange the following numbers 45,22,6,77,47,8 using insertion sort. BTL -6 Creating PART B Page 11

12 Le vel Competence Level Competence 1 Identify the correct sequence 3, 1, 4,7,5,9,2,6,5 using Insertion sort with (13) BTL -1 Remembering routine. 2 Explain in detail about insertion sort with example and code. (13) BTL -5 Evaluating 3 Point out an algorithm for quick sort with example. (13) BTL -4 Analyzing 4 Summarize quick sort algorithm and trace the following list of numbers: (13) BTL -2 Understanding 90,77,60,99,55,88,66, Examine Merge sort routine and trace the following numbers 1, 13, 24, (13) BTL -1 Remembering 26, 2, 15, 27, Associate an algorithm for merge sort and give its worst case, best case (13) BTL -2 Understanding and average case analysis. 7 Demonstrate linear search & binary search algorithm in detail with an (13) BTL -3 Applying example for each. 8 Differentiate linear search algorithm with binary search algorithm. (13) BTL -4 Analyzing 9 Write C++ code and explain the implementation of linear search technique with an example. 10 Generalize your view about bubble sort technique with suitable example. PART C (13) BTL -1 Remembering (13) BTL -6 Creating 11 Discuss Merge sort and quick sort with example. (13) BTL - 2 Understanding Describe binary search algorithm and search the element 22 from the given list 2,7,14,4,17,5,19,8,22,9,25,12,27,14,28,33. Illustrate the technique insertion sort for the following 9,7, 6, 15, 16, 5, 10, 2 5,26,18, 11. Analyze the algorithm for i) Quick sort ii) Insertion sort (13) (13) BTL - 1 BTL - 3 BTL - 4 Remembering Applying Analyzing 1 a. Conclude how quick sort processes the input 142, 543, 123, 65, 453, 879, 572, 434, 111, 242, 811, 102. b. For the quicksort implementation, what is the running time when all keys are equal? 2 Given an array containing only 0s and 1s in sorted order. Create a strategy using any of the sorting techniques to do the following: a. Find the first occurrence of 1 in array. b. Find the last occurance of 0. c. Find number of instances of 0s in sorted array. (15) BTL -5 Evaluating (15) BTL -6 Creating Page 12

PROGRAMMING IN C++ (Regulation 2008) Answer ALL questions PART A (10 2 = 20 Marks) PART B (5 16 = 80 Marks) function? (8)

PROGRAMMING IN C++ (Regulation 2008) Answer ALL questions PART A (10 2 = 20 Marks) PART B (5 16 = 80 Marks) function? (8) B.E./B.Tech. DEGREE EXAMINATION, NOVEMBER/DECEMBER 2009 EC 2202 DATA STRUCTURES AND OBJECT ORIENTED Time: Three hours PROGRAMMING IN C++ Answer ALL questions Maximum: 100 Marks 1. When do we declare a

More information

VALLIAMMAI ENGINEERING COLLEGE

VALLIAMMAI ENGINEERING COLLEGE VALLIAMMAI ENGINEERING COLLEGE SRM Nagar, Kattankulathur 603 203 DEPARTMENT OF INFORMATION TECHNOLOGY QUESTION BANK III SEMESTER CS8391-Data Structures Regulation 2017 Academic Year 2018 19(odd Semester)

More information

Lesson Plan. Subject: OBJECT ORIENTED PROGRAMMING USING C++ :15 weeks (From January, 2018 to April,2018)

Lesson Plan. Subject: OBJECT ORIENTED PROGRAMMING USING C++ :15 weeks (From January, 2018 to April,2018) Lesson Plan Name of the Faculty Discipline Semester :Mrs. Reena Rani : Computer Engineering : IV Subject: OBJECT ORIENTED PROGRAMMING USING C++ Lesson Plan Duration :15 weeks (From January, 2018 to April,2018)

More information

MULTIMEDIA COLLEGE JALAN GURNEY KIRI KUALA LUMPUR

MULTIMEDIA COLLEGE JALAN GURNEY KIRI KUALA LUMPUR STUDENT IDENTIFICATION NO MULTIMEDIA COLLEGE JALAN GURNEY KIRI 54100 KUALA LUMPUR FIFTH SEMESTER FINAL EXAMINATION, 2014/2015 SESSION PSD2023 ALGORITHM & DATA STRUCTURE DSEW-E-F-2/13 25 MAY 2015 9.00 AM

More information

VALLIAMMAI ENGINEERING COLLEGE SRM Nagar, Kattankulathur

VALLIAMMAI ENGINEERING COLLEGE SRM Nagar, Kattankulathur VALLIAMMAI ENGINEERING COLLEGE SRM Nagar, Kattankulathur 60 0 DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING QUESTION BANK III SEMESTER CS89- DATA STRUCTURES Regulation 07 Academic Year 08 9 Prepared by

More information

VALLIAMMAI ENGINEERING COLLEGE

VALLIAMMAI ENGINEERING COLLEGE VALLIAMMAI ENGINEERING COLLEGE SRM Nagar, Kattankulathur 603 203 DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING QUESTION BANK B.E. - Electrical and Electronics Engineering IV SEMESTER CS6456 - OBJECT ORIENTED

More information

R13. II B. Tech I Semester Supplementary Examinations, May/June DATA STRUCTURES (Com. to ECE, CSE, EIE, IT, ECC)

R13. II B. Tech I Semester Supplementary Examinations, May/June DATA STRUCTURES (Com. to ECE, CSE, EIE, IT, ECC) SET - 1 II B. Tech I Semester Supplementary Examinations, May/June - 2016 PART A 1. a) Write a procedure for the Tower of Hanoi problem? b) What you mean by enqueue and dequeue operations in a queue? c)

More information

R10 SET - 1. Code No: R II B. Tech I Semester, Supplementary Examinations, May

R10 SET - 1. Code No: R II B. Tech I Semester, Supplementary Examinations, May www.jwjobs.net R10 SET - 1 II B. Tech I Semester, Supplementary Examinations, May - 2012 (Com. to CSE, IT, ECC ) Time: 3 hours Max Marks: 75 *******-****** 1. a) Which of the given options provides the

More information

SRM ARTS AND SCIENCE COLLEGE SRM NAGAR, KATTANKULATHUR

SRM ARTS AND SCIENCE COLLEGE SRM NAGAR, KATTANKULATHUR SRM ARTS AND SCIENCE COLLEGE SRM NAGAR, KATTANKULATHUR 603203 DEPARTMENT OF COMPUTER SCIENCE & APPLICATIONS QUESTION BANK (2017-2018) Course / Branch : M.Sc CST Semester / Year : EVEN / II Subject Name

More information

DEPARTMENT OF COMPUTER APPLICATIONS B.C.A. - FIRST YEAR ( REGULATION) SECOND SEMESTER LESSON PLAN SRM INSTITUTE OF SCIENCE AND TECHNOLOGY

DEPARTMENT OF COMPUTER APPLICATIONS B.C.A. - FIRST YEAR ( REGULATION) SECOND SEMESTER LESSON PLAN SRM INSTITUTE OF SCIENCE AND TECHNOLOGY DEPARTMENT OF COMPUTER APPLICATIONS B.C.A. - FIRST YEAR (2015-2016 REGULATION) SECOND SEMESTER LESSON PLAN SRM INSTITUTE OF SCIENCE AND TECHNOLOGY FACULTY OF SCIENCE AND HUMANITIES SRM NAGAR, KATTANKULATHUR

More information

LESSON PLAN B.C.A. - FIRST YEAR ( REGULATION) SECOND SEMESTER

LESSON PLAN B.C.A. - FIRST YEAR ( REGULATION) SECOND SEMESTER DEPARTMENT OF COMPUTER APPLICATIONS LESSON PLAN B.C.A. - FIRST YEAR (2014-2015 REGULATION) SECOND SEMESTER SRM UNIVERSITY FACULTY OF SCIENCE AND HUMANITIES SRM NAGAR, KATTANKULATHUR 603 203 SRM UNIVERSITY

More information

SAURASHTRA UNIVERSITY

SAURASHTRA UNIVERSITY SAURASHTRA UNIVERSITY RAJKOT INDIA Accredited Grade A by NAAC (CGPA 3.05) CURRICULAM FOR B.Sc. (Computer Science) Bachelor of Science (Computer Science) (Semester - 1 Semester - 2) Effective From June

More information

17CS33:Data Structures Using C QUESTION BANK

17CS33:Data Structures Using C QUESTION BANK 17CS33:Data Structures Using C QUESTION BANK REVIEW OF STRUCTURES AND POINTERS, INTRODUCTION TO SPECIAL FEATURES OF C Learn : Usage of structures, unions - a conventional tool for handling a group of logically

More information

Object Oriented Programming 2012

Object Oriented Programming 2012 1. Write a program to display the following output using single cout statement. Maths = 90 Physics =77 Chemestry =69 2. Write a program to read two numbers from the keyboard and display the larger value

More information

DYNAMIC MEMORY ALLOCATION AND DEALLOCATION

DYNAMIC MEMORY ALLOCATION AND DEALLOCATION COURSE TITLE DATA STRUCTURE DETAILED SYLLABUS SR.NO NAME OF CHAPTERS & DETAILS HOURS ALLOTTED 1 USER DEFINED DATATYPE /STRUCTURE About structure Defining structure Accessing structure element Array of

More information

INSTITUTE OF AERONAUTICAL ENGINEERING

INSTITUTE OF AERONAUTICAL ENGINEERING INSTITUTE OF AERONAUTICAL ENGINEERING (Autonomous) Dundigal, Hyderabad - 500 043 COMPUTER SCIENCE AND ENGINEERING TUTORIAL QUESTION BANK Course Name Course Code Class Branch DATA STRUCTURES ACS002 B. Tech

More information

E.G.S. PILLAY ENGINEERING COLLEGE (An Autonomous Institution, Affiliated to Anna University, Chennai) Nagore Post, Nagapattinam , Tamilnadu.

E.G.S. PILLAY ENGINEERING COLLEGE (An Autonomous Institution, Affiliated to Anna University, Chennai) Nagore Post, Nagapattinam , Tamilnadu. 17CA 104DATA STRUCTURES Academic Year : 018-019 Programme : MCA Year / Semester : I / I Question Bank Course Coordinator: Mrs. C.Mallika Course Objectives The student should be able to 1. To understand

More information

Draw a diagram of an empty circular queue and describe it to the reader.

Draw a diagram of an empty circular queue and describe it to the reader. 1020_1030_testquestions.text Wed Sep 10 10:40:46 2014 1 1983/84 COSC1020/30 Tests >>> The following was given to students. >>> Students can have a good idea of test questions by examining and trying the

More information

PESIT Bangalore South Campus Department of MCA Course Information for

PESIT Bangalore South Campus Department of MCA Course Information for 1. GENERAL INFORMATION: PESIT Bangalore South Campus Department of MCA Course Information for Data Structures Using C(13MCA21) Academic Year: 2015 Semester: II Title Code Duration (hrs) Lectures 48 Hrs

More information

CS301 - Data Structures Glossary By

CS301 - Data Structures Glossary By CS301 - Data Structures Glossary By Abstract Data Type : A set of data values and associated operations that are precisely specified independent of any particular implementation. Also known as ADT Algorithm

More information

FORTH SEMESTER DIPLOMA EXAMINATION IN ENGINEERING/ TECHNOLIGY- MARCH, 2012 DATA STRUCTURE (Common to CT and IF) [Time: 3 hours

FORTH SEMESTER DIPLOMA EXAMINATION IN ENGINEERING/ TECHNOLIGY- MARCH, 2012 DATA STRUCTURE (Common to CT and IF) [Time: 3 hours TED (10)-3071 Reg. No.. (REVISION-2010) (Maximum marks: 100) Signature. FORTH SEMESTER DIPLOMA EXAMINATION IN ENGINEERING/ TECHNOLIGY- MARCH, 2012 DATA STRUCTURE (Common to CT and IF) [Time: 3 hours PART

More information

Get Unique study materials from

Get Unique study materials from Downloaded from www.rejinpaul.com VALLIAMMAI ENGNIEERING COLLEGE SRM Nagar, Kattankulathur 603203. DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING Year & Semester : IV Section : EEE - 1 & 2 Subject Code

More information

1 P a g e A r y a n C o l l e g e \ B S c _ I T \ C \

1 P a g e A r y a n C o l l e g e \ B S c _ I T \ C \ BSc IT C Programming (2013-2017) Unit I Q1. What do you understand by type conversion? (2013) Q2. Why we need different data types? (2013) Q3 What is the output of the following (2013) main() Printf( %d,

More information

OBJECT ORIENTED DATA STRUCTURE & ALGORITHMS

OBJECT ORIENTED DATA STRUCTURE & ALGORITHMS OBJECT ORIENTED DATA STRUCTURE & ALGORITHMS C++ PROGRAMMING LANGUAGE CONTENT C++ Language Contents: Introduction to C++ Language Difference and Similarities between C and C++ Role Of Compilers and Assemblers

More information

12 Abstract Data Types

12 Abstract Data Types 12 Abstract Data Types 12.1 Foundations of Computer Science Cengage Learning Objectives After studying this chapter, the student should be able to: Define the concept of an abstract data type (ADT). Define

More information

VALLIAMMAI ENGNIEERING COLLEGE SRM Nagar, Kattankulathur 603203. DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING Year & Semester : II / III Section : CSE - 1 & 2 Subject Code : CS 6301 Subject Name : Programming

More information

Preface... (vii) CHAPTER 1 INTRODUCTION TO COMPUTERS

Preface... (vii) CHAPTER 1 INTRODUCTION TO COMPUTERS Contents Preface... (vii) CHAPTER 1 INTRODUCTION TO COMPUTERS 1.1. INTRODUCTION TO COMPUTERS... 1 1.2. HISTORY OF C & C++... 3 1.3. DESIGN, DEVELOPMENT AND EXECUTION OF A PROGRAM... 3 1.4 TESTING OF PROGRAMS...

More information

APJ ABDUL KALAM TECHNOLOGICAL UNIVERSITY THIRD SEMESTER B.TECH DEGREE EXAMINATION, JULY 2017 CS205: DATA STRUCTURES (CS, IT)

APJ ABDUL KALAM TECHNOLOGICAL UNIVERSITY THIRD SEMESTER B.TECH DEGREE EXAMINATION, JULY 2017 CS205: DATA STRUCTURES (CS, IT) D B3D042 Pages: 2 Reg. No. Name: APJ ABDUL KALAM TECHNOLOGICAL UNIVERSITY THIRD SEMESTER B.TECH DEGREE EXAMINATION, JULY 2017 Max. Marks: 100 CS205: DATA STRUCTURES (CS, IT) PART A Answer all questions.

More information

End-Term Examination Second Semester [MCA] MAY-JUNE 2006

End-Term Examination Second Semester [MCA] MAY-JUNE 2006 (Please write your Roll No. immediately) Roll No. Paper Code: MCA-102 End-Term Examination Second Semester [MCA] MAY-JUNE 2006 Subject: Data Structure Time: 3 Hours Maximum Marks: 60 Note: Question 1.

More information

Prepared By: Ms. Nidhi Solanki (Assist. Prof.) Page 1

Prepared By: Ms. Nidhi Solanki (Assist. Prof.) Page 1 QUESTION BANK ON COURSE: 304: PRELIMINARIES: 1. What is array of pointer, explain with appropriate example? 2 2. Differentiate between call by value and call by reference, give example. 3. Explain pointer

More information

CS8391-DATA STRUCTURES QUESTION BANK UNIT I

CS8391-DATA STRUCTURES QUESTION BANK UNIT I CS8391-DATA STRUCTURES QUESTION BANK UNIT I 2MARKS 1.Define data structure. The data structure can be defined as the collection of elements and all the possible operations which are required for those

More information

I BCS-031 BACHELOR OF COMPUTER APPLICATIONS (BCA) (Revised) Term-End Examination. June, 2015 BCS-031 : PROGRAMMING IN C ++

I BCS-031 BACHELOR OF COMPUTER APPLICATIONS (BCA) (Revised) Term-End Examination. June, 2015 BCS-031 : PROGRAMMING IN C ++ No. of Printed Pages : 3 I BCS-031 BACHELOR OF COMPUTER APPLICATIONS (BCA) (Revised) Term-End Examination 05723. June, 2015 BCS-031 : PROGRAMMING IN C ++ Time : 3 hours Maximum Marks : 100 (Weightage 75%)

More information

STRUCTURE AND SYLLABUS APPROVED IN THE BOARD OF STUDIES MEETING ON 2001 TO BE EFFECTIVE FROM THE ACADEMIC YEAR

STRUCTURE AND SYLLABUS APPROVED IN THE BOARD OF STUDIES MEETING ON 2001 TO BE EFFECTIVE FROM THE ACADEMIC YEAR STRUCTURE AND SYLLABUS APPROVED IN THE BOARD OF STUDIES MEETING ON 2001 TO BE EFFECTIVE FROM THE ACADEMIC YEAR 2000-2001. MCA II SEMESTER Scheme of Evaluation Max. Marks Min. Marks to pass L P C Int. Ext.

More information

Table of Contents. Chapter 1: Introduction to Data Structures... 1

Table of Contents. Chapter 1: Introduction to Data Structures... 1 Table of Contents Chapter 1: Introduction to Data Structures... 1 1.1 Data Types in C++... 2 Integer Types... 2 Character Types... 3 Floating-point Types... 3 Variables Names... 4 1.2 Arrays... 4 Extraction

More information

GUJARAT TECHNOLOGICAL UNIVERSITY COMPUTER ENGINEERING (07) / INFORMATION TECHNOLOGY (16) / INFORMATION & COMMUNICATION TECHNOLOGY (32) DATA STRUCTURES

GUJARAT TECHNOLOGICAL UNIVERSITY COMPUTER ENGINEERING (07) / INFORMATION TECHNOLOGY (16) / INFORMATION & COMMUNICATION TECHNOLOGY (32) DATA STRUCTURES GUJARAT TECHNOLOGICAL UNIVERSITY COMPUTER ENGINEERING () / INFMATION TECHNOLOGY (6) / INFMATION & COMMUNICATION TECHNOLOGY (32) DATA STRUCTURES Type of course: Compulsory SUBJECT CODE: 2302 B.E. 3 rd Semester

More information

CS8391-DATA STRUCTURES

CS8391-DATA STRUCTURES ST.JOSEPH COLLEGE OF ENGINEERING DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERI NG CS8391-DATA STRUCTURES QUESTION BANK UNIT I 2MARKS 1.Explain the term data structure. The data structure can be defined

More information

M.C.A DEGREE EXAMINATION,NOVEMBER/DECEMBER 2010 Second Semester MC 9222-OBJECT ORIENTED PROGRAMMING (Regulation 2009)

M.C.A DEGREE EXAMINATION,NOVEMBER/DECEMBER 2010 Second Semester MC 9222-OBJECT ORIENTED PROGRAMMING (Regulation 2009) M.C.A DEGREE EXAMINATION,NOVEMBER/DECEMBER 2010 MC 9222-OBJECT ORIENTED PROGRAMMING (Regulation 2009) Max:100 Marks 1. How are data and function organized in an object oriented programming? 2. Compare

More information

Bachelor Level/ First Year/ Second Semester/ Science Full Marks: 60 Computer Science and Information Technology (CSc. 154) Pass Marks: 24

Bachelor Level/ First Year/ Second Semester/ Science Full Marks: 60 Computer Science and Information Technology (CSc. 154) Pass Marks: 24 Prepared By ASCOL CSIT 2070 Batch Institute of Science and Technology 2065 Bachelor Level/ First Year/ Second Semester/ Science Full Marks: 60 Computer Science and Information Technology (CSc. 154) Pass

More information

PROGRAMMING IN C AND C++:

PROGRAMMING IN C AND C++: PROGRAMMING IN C AND C++: Week 1 1. Introductions 2. Using Dos commands, make a directory: C:\users\YearOfJoining\Sectionx\USERNAME\CS101 3. Getting started with Visual C++. 4. Write a program to print

More information

Cpt S 122 Data Structures. Course Review FINAL. Nirmalya Roy School of Electrical Engineering and Computer Science Washington State University

Cpt S 122 Data Structures. Course Review FINAL. Nirmalya Roy School of Electrical Engineering and Computer Science Washington State University Cpt S 122 Data Structures Course Review FINAL Nirmalya Roy School of Electrical Engineering and Computer Science Washington State University Final When: Wednesday (12/12) 1:00 pm -3:00 pm Where: In Class

More information

EC8393FUNDAMENTALS OF DATA STRUCTURES IN C Unit 3

EC8393FUNDAMENTALS OF DATA STRUCTURES IN C Unit 3 UNIT 3 LINEAR DATA STRUCTURES 1. Define Data Structures Data Structures is defined as the way of organizing all data items that consider not only the elements stored but also stores the relationship between

More information

CS 8391 DATA STRUCTURES

CS 8391 DATA STRUCTURES DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING QUESTION BANK CS 8391 DATA STRUCTURES UNIT- I PART A 1. Define: data structure. A data structure is a way of storing and organizing data in the memory for

More information

Code No: R Set No. 1

Code No: R Set No. 1 Code No: R05010106 Set No. 1 1. (a) Draw a Flowchart for the following The average score for 3 tests has to be greater than 80 for a candidate to qualify for the interview. Representing the conditional

More information

DATA STRUCTURE : A MCQ QUESTION SET Code : RBMCQ0305

DATA STRUCTURE : A MCQ QUESTION SET Code : RBMCQ0305 Q.1 If h is any hashing function and is used to hash n keys in to a table of size m, where n

More information

Time: 3 HOURS Maximum Marks: 100

Time: 3 HOURS Maximum Marks: 100 ANNA UNIVERSITY:CHENNAI 600 025 M.E/M.Tech. DEGREE EXAMINATIONS, NOV./DEC. 2014 Regulations 2013 Third Semester B.E. Computer Science and Engineering CS6311: PROGRAMMING AND DATA STRUCTURES LABORATORY

More information

CS DATA STRUCTURES AND ALGORITHMS

CS DATA STRUCTURES AND ALGORITHMS Computer Science and Engineering Third Semester CS1211 - DATA STRUCTURES AND ALGORITHMS UNIT-I - INTRODUCTION TO DATASTRUCTURES 1.Write down the definition of data structures? PART -A A data structure

More information

Reg. No. : Question Paper Code : 27157

Reg. No. : Question Paper Code : 27157 WK 3 Reg. No. : Question Paper Code : 27157 B.E./B.Tech. DEGREE EXAMINATION, NOVEMBER/DECEMBER 2015. Time : Three hours Second Semester Computer Science and Engineering CS 6202 PROGRAMMING AND DATA STRUCTURES

More information

SARDAR RAJA COLLEGE OF ENGINEERING

SARDAR RAJA COLLEGE OF ENGINEERING SARDAR RAJA COLLEGE OF ENGINEERING RAJA NAGAR, ALANGULAM Department of Electronics & Communication Engineering Subject Name : DATA STRUCTURES AND OBJECT ORIENTED PROGRAMMING IN C++ Subject Code : EC 2202

More information

DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING UNIT-1

DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING UNIT-1 DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING Year & Semester : I / II Section : CSE - 1 & 2 Subject Code : CS6202 Subject Name : Programming and Data Structures-I Degree & Branch : B.E C.S.E. 2 MARK

More information

Object Oriented Programming. Solved MCQs - Part 2

Object Oriented Programming. Solved MCQs - Part 2 Object Oriented Programming Solved MCQs - Part 2 Object Oriented Programming Solved MCQs - Part 2 It is possible to declare as a friend A member function A global function A class All of the above What

More information

R10 SET - 1. Code No: R II B. Tech I Semester, Supplementary Examinations, May

R10 SET - 1. Code No: R II B. Tech I Semester, Supplementary Examinations, May Code No: R21051 R10 SET - 1 II B. Tech I Semester, Supplementary Examinations, May - 2012 DATA STRUCTURES (Com. to CSE, IT, ECC ) Time: 3 hours Max Marks: 75 Answer any FIVE Questions All Questions carry

More information

A6-R3: DATA STRUCTURE THROUGH C LANGUAGE

A6-R3: DATA STRUCTURE THROUGH C LANGUAGE A6-R3: DATA STRUCTURE THROUGH C LANGUAGE NOTE: 1. There are TWO PARTS in this Module/Paper. PART ONE contains FOUR questions and PART TWO contains FIVE questions. 2. PART ONE is to be answered in the TEAR-OFF

More information

MID TERM MEGA FILE SOLVED BY VU HELPER Which one of the following statement is NOT correct.

MID TERM MEGA FILE SOLVED BY VU HELPER Which one of the following statement is NOT correct. MID TERM MEGA FILE SOLVED BY VU HELPER Which one of the following statement is NOT correct. In linked list the elements are necessarily to be contiguous In linked list the elements may locate at far positions

More information

DATA STRUCTURES THROUGH C++

DATA STRUCTURES THROUGH C++ II Year I Semester DATA STRUCTURES THROUGH C++ L T P C 4 0 0 3 OBJECTIVES: To be familiar with basic techniques of object oriented principles and exception handling using C++ To be familiar with the concepts

More information

Largest Online Community of VU Students

Largest Online Community of VU Students WWW.VUPages.com http://forum.vupages.com WWW.VUTUBE.EDU.PK Largest Online Community of VU Students MIDTERM EXAMINATION SEMESTER FALL 2003 CS301-DATA STRUCTURE Total Marks:86 Duration: 60min Instructions

More information

END TERM EXAMINATION

END TERM EXAMINATION END TERM EXAMINATION THIRD SEMESTER [BCA] DECEMBER 2007 Paper Code: BCA 209 Subject: Object Oriented Programming Time: 3 hours Maximum Marks: 75 Note: Attempt all questions. Internal choice is indicated.

More information

INSTITUTE OF AERONAUTICAL ENGINEERING (Autonomous) Dundigal, Hyderabad

INSTITUTE OF AERONAUTICAL ENGINEERING (Autonomous) Dundigal, Hyderabad INSTITUTE OF AERONAUTICAL ENGINEERING (Autonomous) Dundigal, Hyderabad -500 043 COMPUTER SCIENCE AND ENGINEERING TUTORIAL QUESTION BANK Course Name : DATA STRUCTURES Course Code : A30502 Class : II B.

More information

CS 445: Data Structures Final Examination: Study Guide

CS 445: Data Structures Final Examination: Study Guide CS 445: Data Structures Final Examination: Study Guide Java prerequisites Classes, objects, and references Access modifiers Arguments and parameters Garbage collection Self-test questions: Appendix C Designing

More information

MLR Institute of Technology

MLR Institute of Technology MLR Institute of Technology Laxma Reddy Avenue, Dundigal, Quthbullapur (M), Hyderabad 500 043 Phone Nos: 08418 204066 / 204088, Fax : 08418 204088 TUTORIAL QUESTION BANK Course Name : DATA STRUCTURES Course

More information

Note: Select one full question from each unit

Note: Select one full question from each unit P.E.S COLLEGE OF ENGINEERING, MANDYA-571401 (An Autonomous Institution Under VTU Belgaum) Department of Master of Computer Applications Model Question Paper Data Structures Using C (P18MCA21) Credits :

More information

VALLIAMMAI ENGINEERING COLLEGE

VALLIAMMAI ENGINEERING COLLEGE VALLIAMMAI ENGINEERING COLLEGE SRM Nagar, Kattankulathur 60 0 DEPARTMENT OF INFORMATION TECHNOLOGY QUESTION BANK III SEMESTER CS89- Object Oriented Programming Regulation 07 Academic Year 08 9 Prepared

More information

Department of Computer Science and Technology

Department of Computer Science and Technology UNIT : Stack & Queue Short Questions 1 1 1 1 1 1 1 1 20) 2 What is the difference between Data and Information? Define Data, Information, and Data Structure. List the primitive data structure. List the

More information

Revised time table of BCA (2011 admission) record submission

Revised time table of BCA (2011 admission) record submission Revised time table of BCA (2011 admission) record submission Enrollment Number CA11BCA001 GB11BCA001 - GB11BCA019 Date 01/06/2012 GB11BCA020 - GB11BCA039 02/06/2012 GB11BCA040 - GB11BCA059 04/06/2012 GB11BCA060

More information

Introduction to Programming Using Java (98-388)

Introduction to Programming Using Java (98-388) Introduction to Programming Using Java (98-388) Understand Java fundamentals Describe the use of main in a Java application Signature of main, why it is static; how to consume an instance of your own class;

More information

Sample Question Paper

Sample Question Paper Scheme - I Sample Question Paper Marks : 70 Time: 3 Hrs. Q.1) Attempt any FIVE of the following. 10 Marks a. Write any four applications of data structure. b. Sketch the diagram of circular queue. c. State

More information

Preface to the Second Edition Preface to the First Edition Brief Contents Introduction to C++ p. 1 A Review of Structures p.

Preface to the Second Edition Preface to the First Edition Brief Contents Introduction to C++ p. 1 A Review of Structures p. Preface to the Second Edition p. iii Preface to the First Edition p. vi Brief Contents p. ix Introduction to C++ p. 1 A Review of Structures p. 1 The Need for Structures p. 1 Creating a New Data Type Using

More information

DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING B.E SECOND SEMESTER CS 6202 PROGRAMMING AND DATA STRUCTURES I TWO MARKS UNIT I- 2 MARKS

DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING B.E SECOND SEMESTER CS 6202 PROGRAMMING AND DATA STRUCTURES I TWO MARKS UNIT I- 2 MARKS DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING B.E SECOND SEMESTER CS 6202 PROGRAMMING AND DATA STRUCTURES I TWO MARKS UNIT I- 2 MARKS 1. Define global declaration? The variables that are used in more

More information

Course Review for Finals. Cpt S 223 Fall 2008

Course Review for Finals. Cpt S 223 Fall 2008 Course Review for Finals Cpt S 223 Fall 2008 1 Course Overview Introduction to advanced data structures Algorithmic asymptotic analysis Programming data structures Program design based on performance i.e.,

More information

TIME: 3 HOURS MARKS: a. Develop a java program to sort an array of N numbers in ascending order. (40)

TIME: 3 HOURS MARKS: a. Develop a java program to sort an array of N numbers in ascending order. (40) ANNA UNIVERSITY: CHENNAI-600 025 B.E/B.TECH DEGREE EXAMINATIONS, OCT/NOV. 2013 Regulations -2008 Fifth Semester B.TECH INFORMATION TECHNOLOGY IT2305 JAVA PROGRAMMING LAB TIME: 3 HOURS MARKS: 100 1. a.

More information

Babaria Institute of Technology Computer Science and Engineering Department Practical List of Object Oriented Programming with C

Babaria Institute of Technology Computer Science and Engineering Department Practical List of Object Oriented Programming with C Practical -1 Babaria Institute of Technology LEARN CONCEPTS OF OOP 1. Explain Object Oriented Paradigm with figure. 2. Explain basic Concepts of OOP with example a. Class b. Object c. Data Encapsulation

More information

Total No. of Questions :09] [Total No. of Pages : 02. II/IV B.Tech. DEGREE EXAMINATIONS, NOV/DEC First Semester CSE/IT DATA STRUCTURES USING C

Total No. of Questions :09] [Total No. of Pages : 02. II/IV B.Tech. DEGREE EXAMINATIONS, NOV/DEC First Semester CSE/IT DATA STRUCTURES USING C CSE/IT 216 (CR) Total No. of Questions :09] [Total No. of Pages : 02 Time: Three Hours 1. a. ADT II/IV B.Tech. DEGREE EXAMINATIONS, NOV/DEC- 2015 First Semester CSE/IT DATA STRUCTURES USING C Answer Question

More information

CS 6456 OBJCET ORIENTED PROGRAMMING IV SEMESTER/EEE

CS 6456 OBJCET ORIENTED PROGRAMMING IV SEMESTER/EEE CS 6456 OBJCET ORIENTED PROGRAMMING IV SEMESTER/EEE PART A UNIT I 1. Differentiate object oriented programming from procedure oriented programming. 2. Define abstraction and encapsulation. 3. Differentiate

More information

Visit ::: Original Website For Placement Papers. ::: Data Structure

Visit  ::: Original Website For Placement Papers. ::: Data Structure Data Structure 1. What is data structure? A data structure is a way of organizing data that considers not only the items stored, but also their relationship to each other. Advance knowledge about the relationship

More information

CGS 2405 Advanced Programming with C++ Course Justification

CGS 2405 Advanced Programming with C++ Course Justification Course Justification This course is the second C++ computer programming course in the Computer Science Associate in Arts degree program. This course is required for an Associate in Arts Computer Science

More information

About this exam review

About this exam review Final Exam Review About this exam review I ve prepared an outline of the material covered in class May not be totally complete! Exam may ask about things that were covered in class but not in this review

More information

Bharati Vidyapeeth s College Of Engineering for Women Pune-43 Department E & TC. SE- Unit Test I Subject-DS

Bharati Vidyapeeth s College Of Engineering for Women Pune-43 Department E & TC. SE- Unit Test I Subject-DS Bharati Vidyapeeth s College Of Engineering for Women Pune-43 SE- Unit Test I Subject-DS Date: 25/02/2010 Q-1 a) What is sorting? State different types of sorting and write a function in C to implement

More information

1) What is the primary purpose of template functions? 2) Suppose bag is a template class, what is the syntax for declaring a bag b of integers?

1) What is the primary purpose of template functions? 2) Suppose bag is a template class, what is the syntax for declaring a bag b of integers? Review for Final (Chapter 6 13, 15) 6. Template functions & classes 1) What is the primary purpose of template functions? A. To allow a single function to be used with varying types of arguments B. To

More information

Question Paper Code : 97044

Question Paper Code : 97044 Reg. No. : Question Paper Code : 97044 B.E./B.Tech. DEGREE EXAMINATION NOVEMBER/DECEMBER 2014 Third Semester Computer Science and Engineering CS 6301 PROGRAMMING AND DATA STRUCTURES-II (Regulation 2013)

More information

OBJECT ORIENTED PROGRAMMING USING C++ CSCI Object Oriented Analysis and Design By Manali Torpe

OBJECT ORIENTED PROGRAMMING USING C++ CSCI Object Oriented Analysis and Design By Manali Torpe OBJECT ORIENTED PROGRAMMING USING C++ CSCI 5448- Object Oriented Analysis and Design By Manali Torpe Fundamentals of OOP Class Object Encapsulation Abstraction Inheritance Polymorphism Reusability C++

More information

Syllabus for Bachelor of Technology. Computer Engineering. Subject Code: 01CE1303. B.Tech. Year - II

Syllabus for Bachelor of Technology. Computer Engineering. Subject Code: 01CE1303. B.Tech. Year - II Subject Code: 01CE1303 Subject Name: Object Oriented Design and Programming B.Tech. Year - II Objective: The objectives of the course are to have students identify and practice the object-oriented programming

More information

DS ata Structures Aptitude

DS ata Structures Aptitude DS ata Structures Aptitude 1. What is data structure? A data structure is a way of organizing data that considers not only the items stored, but also their relationship to each other. Advance knowledge

More information

Syllabus for Bachelor of Technology. Computer Engineering. Subject Code: 01CE0301. Subject Name: Data Structure. B.Tech. Year - II

Syllabus for Bachelor of Technology. Computer Engineering. Subject Code: 01CE0301. Subject Name: Data Structure. B.Tech. Year - II Subject Code: 01CE0301 Subject Name: Data Structure B.Tech. Year - II Objective: Data structure has high importance in the field of Computer & IT. Organization of data is crucial for implementation and

More information

Dynamic Data Structures

Dynamic Data Structures Dynamic Data Structures We have seen that the STL containers vector, deque, list, set and map can grow and shrink dynamically. We now examine how some of these containers can be implemented in C++. To

More information

Data Structure (CS301)

Data Structure (CS301) WWW.VUPages.com http://forum.vupages.com WWW.VUTUBE.EDU.PK Largest Online Community of VU Students Virtual University Government of Pakistan Midterm Examination Spring 2003 Data Structure (CS301) StudentID/LoginID

More information

Object Oriented Programming with c++ Question Bank

Object Oriented Programming with c++ Question Bank Object Oriented Programming with c++ Question Bank UNIT-1: Introduction to C++ 1. Describe the following characteristics of OOP. i Encapsulation ii Polymorphism, iii Inheritance 2. Discuss function prototyping,

More information

MIDTERM EXAMINATION Spring 2010 CS301- Data Structures

MIDTERM EXAMINATION Spring 2010 CS301- Data Structures MIDTERM EXAMINATION Spring 2010 CS301- Data Structures Question No: 1 Which one of the following statement is NOT correct. In linked list the elements are necessarily to be contiguous In linked list the

More information

Introduction p. 1 Pseudocode p. 2 Algorithm Header p. 2 Purpose, Conditions, and Return p. 3 Statement Numbers p. 4 Variables p. 4 Algorithm Analysis

Introduction p. 1 Pseudocode p. 2 Algorithm Header p. 2 Purpose, Conditions, and Return p. 3 Statement Numbers p. 4 Variables p. 4 Algorithm Analysis Introduction p. 1 Pseudocode p. 2 Algorithm Header p. 2 Purpose, Conditions, and Return p. 3 Statement Numbers p. 4 Variables p. 4 Algorithm Analysis p. 5 Statement Constructs p. 5 Pseudocode Example p.

More information

M.C.A. DEGREE EXAMINATION, MAY First Year. Paper I INFORMATION TECHNOLOGY. SECTION A (3 15 = 45 marks) Answer any THREE of the following.

M.C.A. DEGREE EXAMINATION, MAY First Year. Paper I INFORMATION TECHNOLOGY. SECTION A (3 15 = 45 marks) Answer any THREE of the following. Paper I INFORMATION TECHNOLOGY Answer any THREE of the following. 1. Explain Architecture of computer in detail. 2. Explain in detail about Input and Output technologies. 3. What is MODEM? What factors

More information

M.C.A. DEGREE EXAMINATION, DEC First Year. Time : 03 Hours Maximum Marks : 75

M.C.A. DEGREE EXAMINATION, DEC First Year. Time : 03 Hours Maximum Marks : 75 (DMCA 101) M.C.A. DEGREE EXAMINATION, DEC. - 2012 First Year Paper - I : INFORMATION TECHNOLOGY Time : 03 Hours Maximum Marks : 75 Section - A Answer any Three of the following (3 15 = 45) 1) Define the

More information

Discuss the following operations on One-Dimensional array with algorithms.

Discuss the following operations on One-Dimensional array with algorithms. (i). Searching (ii). Sorting (iii). Traversing (16CS503) DATA STRUCTURES THROUGH C UNIT-I Discuss the following operations on One-Dimensional array with algorithms. 2.Discuss the following operations on

More information

B.C.A 2017 OBJECT ORIENTED PROGRAMMING USING C++ BCA303T MODULE SPECIFICATION SHEET

B.C.A 2017 OBJECT ORIENTED PROGRAMMING USING C++ BCA303T MODULE SPECIFICATION SHEET B.C.A 2017 OBJECT ORIENTED PROGRAMMING USING C++ BCA303T MODULE SPECIFICATION SHEET Course Outline The main objective of this course is to introduce students to the basic concepts of a selected language

More information

FINALTERM EXAMINATION Fall 2009 CS301- Data Structures Question No: 1 ( Marks: 1 ) - Please choose one The data of the problem is of 2GB and the hard

FINALTERM EXAMINATION Fall 2009 CS301- Data Structures Question No: 1 ( Marks: 1 ) - Please choose one The data of the problem is of 2GB and the hard FINALTERM EXAMINATION Fall 2009 CS301- Data Structures Question No: 1 The data of the problem is of 2GB and the hard disk is of 1GB capacity, to solve this problem we should Use better data structures

More information

Tribhuvan University Institute of Science and Technology Computer Science and Information Technology (CSC. 154) Section A Attempt any Two questions:

Tribhuvan University Institute of Science and Technology Computer Science and Information Technology (CSC. 154) Section A Attempt any Two questions: Tribhuvan University 2065 Bachelor Level/ First Year/ Second Semester/ Science Full Marks: 60 Computer Science and Information Technology (CSC. 154) Pass Marks: 24 (Data Structure and Algorithm) Time:

More information

QUESTION BANK. Prepared by,mrs.d.maladhy AP/IT,RGCET. Page 1

QUESTION BANK. Prepared by,mrs.d.maladhy AP/IT,RGCET. Page 1 UNIT I 1.Write statements to declare integer Pointer and Float Pointer. Also write the statement to convert float pointer.(apr/may 2016) 2. What is a Stack? Mention the order followed to add or delete

More information

Object Oriented Programming Using C ++ Page No. : 1. ASSIGNMENT SHEET WITHOUT USING OBJECT AND CLASSES

Object Oriented Programming Using C ++ Page No. : 1. ASSIGNMENT SHEET WITHOUT USING OBJECT AND CLASSES Object Oriented Programming Using C ++ Page No. : 1. ASSIGNMENT SHEET WITHOUT USING OBJECT AND CLASSES 1. Write a program to calculate the sum of two numbers using function. 2. Write a program to calculate

More information

Intro to OOP Visibility/protection levels and constructors Friend, convert constructor, destructor Operator overloading a<=b a.

Intro to OOP Visibility/protection levels and constructors Friend, convert constructor, destructor Operator overloading a<=b a. Intro to OOP - Object and class - The sequence to define and use a class in a program - How/when to use scope resolution operator - How/when to the dot operator - Should be able to write the prototype

More information

Object Oriented Programming

Object Oriented Programming Object Oriented Programming Course Title: Object Oriented Programming Full Marks: 60 20 20 Course No: CSC161 Pass Marks: 24 8 8 Nature of Course: Theory Lab Credit Hrs: 3 Semester: II Course Description:

More information

Absolute C++ Walter Savitch

Absolute C++ Walter Savitch Absolute C++ sixth edition Walter Savitch Global edition This page intentionally left blank Absolute C++, Global Edition Cover Title Page Copyright Page Preface Acknowledgments Brief Contents Contents

More information

CompuScholar, Inc. Alignment to Nevada "Computer Science" Course Standards

CompuScholar, Inc. Alignment to Nevada Computer Science Course Standards CompuScholar, Inc. Alignment to Nevada "Computer Science" Course Standards Nevada Course Details: Course Name: Computer Science Primary Cluster: Information and Media Technologies Standards Course Code(s):

More information

Data Structures Question Bank Multiple Choice

Data Structures Question Bank Multiple Choice Section 1. Fundamentals: Complexity, Algorthm Analysis 1. An algorithm solves A single problem or function Multiple problems or functions Has a single programming language implementation 2. A solution

More information