Download 2.Data Structures and Object Oriented Programming

VANDAYAR ENGINEERING COLLEGE, THANJAVUR.
EC 2202: DATA STRUCTURES AND OBJECT ORIENTED PROGRAMMING
(Computer Science and Engineering)
UNIT- I : Principles Of Object Oriented Programming - Assignment Sheet -I
Regulation
Year / Sem
Faculty I/c
Q. NO
1.
2.
3.
4.
5.
6.
7.
8.
9.
10.
Q. NO
: 2008
: II / 3rd
: (1)
No of Periods:9
Academic Year :2013-14
(2)
PART A
What are objects? Illustrate with an example?
What is data abstraction?
Define encapsulation.
What is a default constructor?
Define the term abstraction.
List down any four operators that cannot be overloaded?
How is a class declared in C++?
What is a scope resolution operator and how can it be used for global variable?
When do we declare a member of a class static?
Why is it necessary to overload an operator?
PART B
YEAR
May ‘12
May ‘12
Nov ‘11
Nov ‘11
Nov ‘11
Nov ‘11
May ‘10
May ‘10
Dec ‘09
Dec ‘09
YEAR
(i)
(ii)
13.(i)
(ii)
Explain the major principles of object oriented programming with illustrations and neat sketches.
Explain in detail about
Inline function and Friend function.
Const function and volatile with suitable illustrations.
Explain the merits and demerits of object oriented paradigm.
Write a C++ program to define overload constructor and to perform string initialization and string copy.
May ‘12
May ‘12
May ‘12
May ‘12
Nov ‘11
Nov ‘11
14.
Illustrate the use of copy constructor and function overloading with C++ program.
Nov ‘11
15.(i)
What are the major advantages of object oriented programming over the traditional structured
programming.
Give a brief account on scope and storage classes of data, with suitable examples.
Nov ‘11
Write a C++ program to multiply two matrices with the necessary validations.
May ‘10
Giving a sample program, explain the mechanism of call by reference
May ‘10
Give the syntax and usage of the reserved word inline with two examples.
May ‘10
Explain the importance of constructors and destructors with example.
May ‘10
What is operator overloading? Overload the numerical operators ‘+’ and ‘/’ for complex numbers
“addition” and “division” respectively.
What is a friend function? What are the merits and demerits of using friend function?
May ‘10
Define a class ‘string’, Use overload ‘==’ operator to compare two strings.
Nov ‘09
What is a parameterized constructor? Explain with example.
What is a conversion function? How is it created? Explain its syntax.
Nov ‘09
Nov ‘09
11.
12.
(ii)
16.(i)
(ii)
17.(i)
(ii)
18.
19.(i)
(ii)
20.(i)
(ii)
Nov ‘11
Nov ‘09
Date of Submission to the Faculty I/c by the students:
FACULTY IN-CHARGE
HOD
PRINCIPAL
VANDAYAR ENGINEERING COLLEGE, THANJAVUR.
EC 2202: DATA STRUCTURES AND OBJECT ORIENTED PROGRAMMING
(Computer Science and Engineering)
UNIT- II : Advanced Object Oriented Programming - Assignment Sheet – II
Regulation
Year / Sem
Faculty I/c
Q. NO
1.
2.
3.
4.
5.
6.
7.
8.
9.
10.
Q. NO
: 2008
: II / 3rd
: (1)
No of Periods:9
Academic Year :2013-14
(2)
PART A
What is a pure virtual function?
What is a template?
When do we need the use of ‘this’ pointer?
Distinguish between multiple inheritance and multi-level inheritance.
Write the properties of a static member function.
What is an inline function?
What is meant by binding?
How the pointer is implemented in C++?
What is an abstract class?
What does ‘this’ pointer point to?
PART B
YEAR
May ‘12
May ‘12
Nov ‘11
Nov ‘11
Nov ‘11
Nov ‘11
May ‘10
May ‘10
Dec ‘09
Dec ‘09
YEAR
May ‘12
May ‘12
15.(i)
(ii)
What is a function template? Write a C++ program to illustrate the concept of function overloading.
Discuss in detail about exception handling constructs and write a program to illustrate divide by zero
exception.
What is meant by function overloading? Write a C++ program to illustrate the concept of function
overloading.
What is application of virtual function?Explain with an example how late binding is achieved using virtual
function.
Explain the basic exception handling mechanism of C++ with an example program.
What is meant by dynamic binding? Explain with a sample C++ code as to how it can be implemented.
16.
What are the different forms of inheritance supported by C++? Explain with relevant examples code.
Nov ‘11
17.
Explain the following concepts with example code:
Nov ‘11
(i)
Exception handling mechanism
Nov ‘11
(ii)
Run-time polymorphism
Nov ‘11
Define friend class and specify its importance. Explain with suitable example.
May ‘10
Discuss virtual function and polymorphism with example.
May ‘10
19.(i)
Explain the concept of inheritance by considering an example of “vehicle”.
May ‘10
(ii)
Explain the operators used for dynamic memopry allocation with examples.
May ‘10
Describe the syntax of multiple inheritance.When do we use such an inheritance?
Nov ‘09
What is a virtual function?when do we make a virtual function “pure”?
Nov ‘09
11.
12.
13.
14.
18.(i)
(ii)
20.(i)
(ii)
May ‘12
May ‘12
Nov ‘11
Nov ‘11
Date of Submission to the Faculty I/c by the students:
FACULTY IN-CHARGE
HOD
PRINCIPAL
VANDAYAR ENGINEERING COLLEGE, THANJAVUR.
EC 2202: DATA STRUCTURES AND OBJECT ORIENTED PROGRAMMING
(Computer Science and Engineering)
UNIT- III: Data Structures And Algorithms- Assignment Sheet –III
Regulation
Year / Sem
Faculty I/c
Q. NO
1.
2.
3.
4.
5.
6.
7.
8.
9.
10.
Q. NO
: 2008
: II / 3rd
: (1)
No of Periods:9
Academic Year :2013-14
(2)
PART A
Define queue.
Define big O notation.
What are the postfix and prefix forms of the expression? A+b*(C-D)/(P-R)
Distinguish between the constraints of shape property and heap property.
Write any two data structures used in Operation System?
What are the representations of Big and small ‘O’ notations?
How is an algorithm’s time efficiency measured?
List the applications of stack.
What is deque?
What is a heap and mention its types?
PART B
YEAR
May ‘12
May ‘12
Dec ‘11
Dec ‘11
May ‘10
May ‘10
Nov ‘10
Nov ‘10
Nov ‘09
Nov ‘09
YEAR
11.(i)
(ii)
12.(i)
(ii)
13.(i)
14.
Estimate the average case,best case and worst case time complexity of linear search.
Discuss the amortized time complexity analysis with an example.
Explain different types of analysis that can be performed on an algorithm.
Explain the various asymptotic notations.
Write an algorithm and C++ program for inserting and deleating an element from doubly linked list.
Describe hash function.Explain the concept of Conflict Resolution Techniques in hashing
May ‘12
May ‘12
May ‘12
May ‘12
Nov ‘11
Nov ‘11
15.(i)
Explain Priority Queue and how are binary heaps used in that.
May ‘10
Explain the properties of heap.
May ‘10
16.(i)
Write a C++ program to implement stack and its operation PUSH and POP.
May ‘10
(ii)
What is hashing? Classify hashing function based on the various methods.
May ‘10
Explain the various criteria used for analyzing algorithms.
Nov ‘10
List the properties of various asymptotic notations.
Nov ‘10
Write an algorithm to find the sum of n elements and also compute its time and space complexity.
Nov ‘10
(ii)
Briefly explain the performance of a recursive algorithm.
Nov ‘09
19.
Define double linked list. Explain the various operation of double linked list with algorithm.
Nov ‘09
What is hashing? Explain the various hash functions with example.
Nov ‘09
What is priority queue?Discuss the array implementation of priority queue.
Nov ‘09
(ii)
17.(i)
(ii)
18.(i)
20.(i)
(ii)
Date of Submission to the Faculty I/c by the students:
FACULTY IN-CHARGE
HOD
PRINCIPAL
VANDAYAR ENGINEERING COLLEGE, THANJAVUR.
EC 2202: DATA STRUCTURES AND OBJECT ORIENTED PROGRAMMING
(Computer Science and Engineering)
UNIT- IV: Non Linear Data Structures- Assignment Sheet –IV
Regulation
Year / Sem
Faculty I/c
Q. NO
1.
2.
3.
4.
5.
6.
7.
8.
9.
10.
Q. NO
: 2008
: II / 3rd
: (1)
No of Periods:9
Academic Year :2013-14
(2)
PART A
What is a binary tree?
What is an expression tree?
Distinguish between the constraints of shape property and heap property.
Define binary tree
How many trees are possible with 3 nodes?
What is a spanning tree?
Define graph.
How do you find the strongly connected components?
What is AVL tree?
When does a graph become tree?
PART B
YEAR
May ‘12
May ‘12
May ‘11
May ‘11
May ‘10
May ‘10
Nov ‘10
Nov ‘10
Nov ‘09
Nov ‘09
YEAR
Write the Dijikstra‘s algorithm to find the shortest path with suitable example.
Explain the Prim’s algorithm with an example.
Describe an AVL tree,Write the algorithm to perform insertion and deletion of a node in an AVL tree and
justify its worst-case with suitable example.
Write the Kruskal‘s and Prim’s algorithms for comuting minimal Spanning tree.
Explain the minimum spanning tree with an example.
Write a short note on AVL trees.
May ‘12
May ‘12
Dec ‘11
Discuss the different representation of a binary tree.
Nov ‘10
(ii)
Explain the various binary tree traversal methods with an example
Nov ‘10
18.
Explain the method of finding the minimum spanning tree for a connected graph using Prim’s algorithm
with an example.
Discuss the different methods of traversing a binary tree with algorithm.
May ‘10
Discuss Prim’s and Krushkal’s algorithm for computing the minimal spanning tree weighted undirected
graph.
Nov ‘09
11.
12.
13.
14.
15.
16.
17.(i)
19.
20.
Dec ‘11
May ‘10
May ‘10
Nov ‘09
Date of Submission to the Faculty I/c by the students:
FACULTY IN-CHARGE
HOD
PRINCIPAL
VANDAYAR ENGINEERING COLLEGE, THANJAVUR.
EC 2202: DATA STRUCTURES AND OBJECT ORIENTED PROGRAMMING
(Computer Science and Engineering)
UNIT- V: Sorting And Searching- Assignment Sheet –V
Regulation
Year / Sem
Faculty I/c
Q. NO
1.
2.
3.
4.
5.
6.
7.
8.
9.
10.
Q. NO
: 2008
: II / 3rd
: (1)
No of Periods:9
Academic Year :2013-14
(2)
PART A
What is the objective of bubble sort?
How many passes are required for k-way merging?
What is sorting?
What is external sorting?
What is the features of bucket sort algorithm?
Define dynamic programming.
Define divide and conquer method.
What is pivot?
What is the worst case and best case time complexity of binary tree sort?
What is indexed sequential search?
PART B
YEAR
Write the algorithm of heap sort and bucket sort. Implement the C++ program for heap sort.
Explain Greedy algorithm with an example.
What is dynamic programming? List its application and explain any one.
Explain the algorithm of Quick sort by sorting the following set of numbers as an example:
42,47,52,57,62,37,32,27,22
Describe divide and conquer techniques with the help of mergesort.
Write a program to make a copy of a given list.
Nov ‘11
Nov ‘11
Nov ‘11
May ‘10
Nov ‘10
(ii)
Explain compaction techniques.Develope an algorithm to accomplish this task.
Nov ‘10
16.
Explain the floyd’s algorithm with an example
Nov ‘10
17.
Explain the bubble sort algorithm with suitable example.
18.
Write a C program to implement binary search and compute its complexity
19.
Compare the worst case and best case time complexity of various sorting techniques.
Nov ‘10
Nov ‘09
Nov ‘09
20.
Explain the all pairs shortest path algorithm with an example.
Nov ‘09
11.
12.(i)
(ii)
13.
14.
15.(i)
Nov ‘11
Nov ‘11
Dec ‘10
Dec ‘10
May ‘10
May ‘10
Dec ‘10
Dec ‘10
Nov ‘09
Nov ‘09
YEAR
May ‘10
Date of Submission to the Faculty I/c by the students:
FACULTY IN-CHARGE
HOD
PRINCIPAL