Documenti di Didattica
Documenti di Professioni
Documenti di Cultura
INSTITUTEVISIONANDMISSION
Vision:
Imparting Knowledge and instilling skills to the aspiring students in the field of Engineering,
Technology, Science and Management to face the emerging challenges of the society.
Mission:
Mission 1: Encouraging scholarly activities that transfer knowledge in the areas of Engineering,
Technology, Science and Management.
Mission 2: Ensuring students of all ability levels are well trained to meet the needs of education and
their future endeavors.
Mission 3: Inculcating human values and ethics into the education system for the all-round
development of the students.
DEPARTMENT VISIONANDMISSION
Vision:
The department of Information Technology focuses to produce technically strong graduates in
the field of Information Technology, who will be useful for the society.
Mission:
Mission 2: To train the graduates and inculcate the importance of communication skills,
research and to pursue for higher studies by conducting workshops, seminars.
PEO 1: Graduates engage in professional development and make use of the available resources.
PEO 2: Graduates of Information Technology try to improve in professional career with problem
solving ability for providing Information Technology solutions by proper plan, analysis, design,
implementation and validation.
PEO 3: Graduates of the Information Technology program are prepared for their successful
career in the Information Technology industry / seek higher studies and continue to develop.
PROGRAM OUTCOMES (PO):
11. Project management and finance:Apply project management practices to the launch of
new programs, initiatives, products, services, and events relative to the stakeholder needs
including finance.
12.Life-long learning: Recognition of the need for higher studies and inspires to update the
latest technologies by the way of life long learning process from time to time .
1. PSO1: Acquire knowledge will be used to design and modify principles in the development
of software and hardware systems to get a better quality product.
COURSECODE:53023 CREDITS:4
Date No. of
Description
From To Weeks
First Spell of Instructions 01-07-2013 24-08-2013 08
First Mid Examinations 26-08-2013 28-08-2013 3 days
Second Spell of Instructions 29-08-2013 11-10-2013 06
Continuation of Second Spell of
21-10-2013 26-10-2013 01
Instructions
Second Mid Examinations 28-10-2013 30-10-2013 3 days
Preparation & Practical
31-10-2013 08-11-2013 9 days
Examinations
End Semester Examinations 11-11-2014 23-11-2014 02
Supplementary examinations 25-11-2013 07-12-2013 02
Commencement of Class work for the next AY 2014-15 09-12-2013
Month Holidays
JUN 02,09,16,23,30 Sundays
JUL 07,14,21,28 Sundays
AUG 04,11,18,25 Sundays
15 Independence day
28 Janmashtami
01,08,15,22,29 Sundays Holidays are
SEP 9 Ganesh chathurthi subjected to
clearance
18 Ganesh nimajjanam from AP
06,13,20,27 Sundays Government
OCT 12to20 Dussehra holidays
2 Gandhi jayanthi
03,10,17,24 Sundays
03 Deewali
NOV
05 Moharram
17 Gurunanakjayanthi
3.2 SUBJECT TIME TABLE
1 2 3 7
4 5 6
(9:40 (10:30 11:20 (11:30 1:10 (3:30
(12:20 (1:50 PM (2:40 PM
DAY AM - AM - - AM - - PM
PM - 1:10
10:30 11:20 11:30 12:20 1:50 4:20
PM) 2:40 PM) 3:30 PM)
AM) AM) PM) PM)
MON CC
TUE
BREAK
LUNCH
WED CC
THU
FRI CC
SAT CC
CoursePre-Requisites(Fundamentals)
3.3 SYLLABUS
4 -/-/- 4
Objectives:
2. To discuss the implementation linear data structures such as stacks, queues and lists and
their applications.
4. To introduce various search data structures such as hashing, binary search trees,
redblack trees, splay trees andb-trees.
5. To introduce various internal sorting techniques and analyze their time complexities.
Unit I:
C++ Class Overview- Class Definition, Objects, Class Members, Access Control, ClassScope,
Constructors and destructors, parameter passing methods, Inline functions,static classmembers,
this pointer, friend functions, dynamic memory allocation and deallocation (new and delete),
exception handling.
Unit II:
Function Overloading, Operator Overloading, Generic Programming- Function and class
templates, Inheritance basics, base and derived classes, inheritance types, base classaccess
control, runtime polymorphism using virtual functions, abstract classes, streams I/O.
Unit III:
Unit IV:
Unit V:-
Priority Queues Definition, ADT, Realizing a Priority Queue using Heaps, Definition,
insertion, Deletion, Application-Heap Sort, External Sorting- Model for external sorting,
Multiway merge, Polyphase merge.
Unit VI:-
Search trees (part I): Binary search trees, definition, ADT, implementation,
operationssearching, insertion and deletion, Balanced search trees- AVL trees, definition,
height of
an AVL tree, representation, operations-insertion, deletion and searching.
Search trees (part II) :Introduction to Red Black trees and Splay Trees, B-Trees-B-Tree
of order m, height of a B-Tree, insertion, deletion and searching, Comparison of SearchTrees.
Unit VII:-
Divide and Conquer- General method, applications Binary search, merge sort, quicksort,
Strassens matrix multiplication Efficient non recursive tree traversal algorithms, Biconnected
components. Disjoint set operations, union and findalgorithms.
Unit VIII:-
Greedy method and Dynamic programming : General method (Greedy), Minimum cost
spanning trees, Job sequencing with deadlines, General method (DynamicProgramming),
Optimal binary search trees, 0/1 knapsack problem, Ordering MatrixMultiplications
TEXT BOOKS :
1. Data Structures and Algorithm Analysis in C++, Mark Allen Weiss, Pearson Education,
second edition.
2. Data structures, Algorithms and Applications in C++,S.Sahni,University press (India)
pvt ltd, 2nd edition, Orient Longman pvt.ltd.
REFERENCE :
1. Data structures and Algorithms in C++, Michael T.Goodrich, R.Tamassia and D.Mount,
Seventh Edition Wiley student edition, John Wiley and Sons.
2. Data Structures and Algorithms in C++, Third Edition, Adam Drozdek, Thomson
3. Problem solving with C++, The OOP, Fourth edition, W.Savitch, Pearson education.
4. C++, The Complete Reference, 4th Edition, Herbert Schildt, TMH.
5. Data structures using C and C++, Langsam, Augenstein and Tanenbaum, PHI/Pearson
Education.
General objectives:
1. To understand the basic structure concept such as Abstract Data Types, Linear and Non
Linear Data structures.
2. To understand the notations used to analyze the Performance of algorithms.
3. To understand the behavior of data structures such as stacks, queues, trees, hash tables,
search trees, Graph and their representations.
4. To choose the appropriate data structure for a specified application.
5. To understand and analyze various searching and sorting algorithms.
6. To write programs in C to solve problems using data structures such as array, linked lists,
queues, trees, graphs, hash tables, search trees.
Specific objectives:
1. To gain the knowledge of basic data structures, complexities like time and space
complexity, linked list.
2. To demonstrate about stacks and its applications, queues and different types of queues.
3. To demonstrate about Trees and graphs their terminology, types and traversal.
4. To understand about different types of searching and sorting techniques.
5. To demonstrate different pattern matching algorithms and tries.
PROGRAM OUTCOMES
POS PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
TOTAL 18 10 11 10 13 3 11 6 13 5 12 9
100 55 61 55 72 16 61 33 72 27 66 50
PERCENTAGE
120
100
80
60
Series3
40
20
0
PROGRAM SPECIFIC OUTCOMES PSOS
80
70
60
50
40 TOTAL
PERCENTAGE
30
20
10
0
PSO1 PSO2
3.6 COURSE OUTCOMES
Students are able to analyze algorithms and determine their time complexity and
1
space complexity.
Students are able to implement linked list data structure to solve various problems
and they are able to understand and apply various data structure such as stacks,
2 queues, trees and graphs to solve various computing problems using C-
programming language.
Able to implement and know when to apply standard algorithms for searching and
3
sorting.
Ability to analyze the problem and solve problems independently and think
4
critically.
5 Students can learn how to use data structure concepts for realistic problems.
Students will get an ability to identify appropriate data structure for solving
6 computing problems in respective language
3.7 RELATIONSHIP OF COS TO POS AND RELATIONSHIP OF COS TO PSOS
PO PO P P P P P P P P P P P PS PS
1 O O O O O O O O O O O O O
6 1 2
2 3 4 5 7 8 9 1 1 1
0 1 2
Course
outcomes
1 3 2
3 3 3 1 3 1 3 1 3 1 3 3
2 2 3
3 1 1 1 1 - 1 1 1 1 3 2
3 2 2
3 2 1 1 2 1 1 1 2 - 3 1
4 1 1
3 2 3 2 3 - 3 1 3 - 3 1
5 2 2
3 1 1 3 2 1 1 1 2 1 - 1
6 1 2
3 1 2 2 2 - 2 1 2 2 - 1
DEGREE OF 10 5 6 5 7 1 6 3 7 2 6 5 61 66
CONTRIBUT 0 5 1 5 2 6 1 3 2 7 6 0
ION % %
% % % % % % % % % % % %
Course Name: DATA STRUCTURE THROUGH C++for Academic Year 2013-14 (II-I)
CO PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
C213.1 3 3 3 1 3 1 3 1 3 1 3 3
C213.2 3 1 1 1 1 - 1 1 1 1 3 2
C213.3 3 2 1 1 2 1 1 1 2 - 3 1
C213.4 3 2 3 2 3 - 3 1 3 - 3 1
C213.5 3 1 1 3 2 1 1 1 2 1 - 1
C213.6 3 1 2 2 2 - 2 1 2 2 - 1
Avg 3 2 2 2 2 1 2 1 2 1 3 2
CO PSO1 PSO2
1 3 2
2 2 3
3 2 2
4 1 1
5 2 2
6 1 2
Average 2 2
3.8 TEACHING PLAN
TEXT BOOKS:
T-1.Data Structures and Algorithm Analysis in C++, Mark Allen Weiss, Pearson Education,
second edition.
T-2.Data structures, Algorithms and Applications in C++,S.Sahni,University press (India)
pvt ltd, 2nd edition, Orient Longman pvt.ltd.
REFERENCE BOOKS:
R -1.. Data structures and Algorithms in C++, Michael T.Goodrich, R.Tamassia and D.Mount,
Seventh Edition Wiley student edition, John Wiley and Sons.
R -2.Data Structures and Algorithms in C++, Third Edition, Adam Drozdek, Thomson
R -3.Problem solving with C++, The OOP, Fourth edition, W.Savitch, Pearson education.
R -4. C++, The Complete Reference, 4th Edition, Herbert Schildt, TMH.
R -5. Data structures using C and C++, Langsam, Augenstein and Tanenbaum, PHI/Pearson
Education.
TEACHING
UNIT DETAILS HOURS AIDS
UNIT-I
C++ Class Overview Class Definition, Objects, Class BB
Members, Access Control, Class 2
Scope
Constructors and destructors, 3 BB
parameter passing methods, Inline
functions, static class members,
this pointer
friend functions, dynamic memory 2 BB/LCD
allocation and deallocation,
exception handling
UNIT-II
Generic Programming Function Overloading, Operator 2 BB/LCD
Overloading
Generic Programming- Function 2 BB/LCD
and class templates
Inheritance basics, base and 2 BB/LCD
derived classes, inheritance types,
base class access control
runtime polymorphism using 2 BB/LCD
virtual functions, abstract classes,
streams I/O
UNIT-III
Algorithms & Review Algorithms, performance analysis- 2 BB/LCD
time complexity and space
of basic data structures complexity
3.3 Review of basic data structures - the list ADT, stack T-2 2
ADT, queue ADT
3.4 implementation
matrix
using template classes in C++, sparse T-2 3
representation
IV 8
Dictionaries& Hashing
V Priority Queues 8
VI Search trees 9
Binary search trees, definition, ADT, implementation, 2
operationssearching, insertion and deletion
Balanced search trees- AVL trees, definition, height 2
of
an AVL tree, representation, operations-insertion,
deletion and searching
Introduction to Red Black trees and Splay Trees 2
B-Trees-B-Tree of order m, height of a B-Tree, 3
insertion, deletion and searching, Comparison of
Search
Trees
VII Divide and Conquer 8
Divide and Conquer- General method, applications 3
Binary search, merge sort, quick
sort
Strassens matrix multiplication Efficient non 2
recursive tree traversal algorithms
Biconnected components. Disjoint set operations, 3
union and findalgorithms
VIII Greedy method and Dynamic programming 8
General method , Minimum cost spanning trees 2
Job sequencing with deadlines, General method 3
Optimal binary search trees, 0/1 knapsack problem, 3
Ordering Matrix Multiplications
3.9 RESULT ANALYSIS
Graph
4. LECTURE NOTES
4.1 Unit Wise Lecture Notes:
UNIT-1
UNIT-2
UNIT-3
UNIT-4
UNIT-5
1. Define input restricted queue and output restricted queue with suitable example.
2. How do you represent a queue in computers memory?
3. Write a program to implement concept of multiple queues with an example.
4. Evaluate the following postfix expression 123+*
5. Define Expression? What are types of expression
UNIT-6
1. Suppose a binary tree T is in memory. Write a procedure to delete all the terminal nodes
in T.
2. Write an algorithm to convert forest into a binary tree?
3. How the height of a BST effects its performance?
4. Describe AVL Trees insertion and deletion method?
5. Differentiate between the B+ tree index files and B-tree index files.
UNIT-7
1. Suppose a binary tree T is in memory. Write a procedure to delete all the terminal nodes
in T.
2. Write an algorithm to convert forest into a binary tree?
3. How the height of a BST effects its performance?
4. Describe AVL Trees insertion and deletion method?
5. Differentiate between the B+ tree index files and B-tree index files.
UNIT-8
1. List the different algorithms used for implementing minimum spanning tree?
2. Prove that in finite graph the number of vertices of odd degree is always even?
3. Write a procedure to compute length of shortest path of directed graph?
4. Describe AVL Trees insertion and deletion method?
5. Differentiate between the B+ tree index files and B-tree index files.
5.1 UNIVESITY QUESTION PAPERS
6. CONTINUOUS EVALUATION
2. A binary search tree whose left subtree and right subtree differ in hight by at most 1
unit is called
A) AVL tree B) Red-black tree
C) Lemma tree D) None of the above
5. Which of the following is true about the characteristics of abstract data types?
i) It exports a type.
ii) It exports a set of operations
A) True, False B) False, True
C) True, True D) False, False
6. is not the component of data structure.
A) Operations B) Storage Structures
C) Algorithms D) None of above
8. Inserting an item into the stack when stack is not full is called . Operation
and deletion of item form the stack, when stack is not empty is called ..operation.
A) push, pop B) pop, push
C) insert, delete D) delete, insert
9. . Is a pile in which items are added at one end and removed from the other.
A) Stack B) Queue
C) List D) None of the above
10. is very useful in situation when data have to stored and then retrieved in
reverse order.
A) Stack B) Queue
C) List D) Link list
11. A _________ is a special member function used to initialize the data members of a class.
(constructor)
12. The default access for members of a class is _________. (private)
13. Member functions of a class are normally made ________ and data members of a class are
normally made ________. (public, private)
14. Inheritance enables _______ which saves time in development , and encourages using
previously proven and high quality software. (reusability)
15. The three member access specifiers are ________, ________ and _________. (public,
private, protected)
16. A class is called as abstract base class if it has a ________function. (pure virtual)
17. A queue is _______ list. (linear)
18. A ______ is a function that invokes itself. (Recursion)
19. Run-time or dynamic allocation of memory may be done using the C++ operator _____.
(new)
20. Operator overloading permits to extend the applicability of existing C++ operators so that
they work with new ________ or ________. (data types, objects)
Answers:
1. D) All of the above 2. A) AVL tree
3. C) Implementation level 4. A) Last in first out
5. C) True, True 6. D) None of above
7. D) None of the above 8. A) push, pop
9. B) Queue 10. A) Stack
1. Which data structure allows deleting data elements from and inserting at rear?
A) Stacks B) Queues
C) Dequeues D) Binary search tree
2. Which of the following data structure can't store the non-homogeneous data elements?
A) Arrays B) Records
C) Pointers D) Stacks
3. A ....... is a data structure that organizes data similar to a line in the supermarket, where
the first one in line is the first one out.
A) Queue linked list B) Stacks linked list
C) Both of them D) Neither of them
4. Which of the following is non-liner data structure?
A) Stacks B) List
C) Strings D) Trees
6. Which data structure is used in breadth first search of a graph to hold nodes?
A) Stack B) queue
C) Tree D) Array
7. Identify the data structure which allows deletions at both ends of the list but insertion at
only one end.
A) Input restricted dequeue B) Output restricted qequeue
C) Priority queues D) Stack
Answers:
1. B) Queues 2. A) Arrays
3. A) Queue linked list 4. D) Trees
5. C) Binary tree 6. B) queue
7. A) Input restricted dequeue 8. D) Graph
9. D) Stack 10. C) Tree
6.2 UNIT TEST QUESTION PAPERS
UNIT TEST-1
UNITTEST-2
1. Define Circular Linked List? Explain the operations on Circular Linked List?
2. Define sparse Matrices & Explain the Linked representation of Sparse Matrix?
3. Define Time Complexity ? Write an algorithm to find smallest element in array of
integers & analyze its Time Complexity
4. Define two-dimensional array with an example program
5. Define Sparse Matrices
6. Evaluate the following postfix expression 123+* 7.
7. What are the various applications of stack
8. A)Describe Splay Trees b)Describe Red Black Trees
6.2.2 ASSIGNMENT QUESTIONS
ASSIGNMENT1
ASSIGNMENT3
ASSIGNMENT4
ASSIGNMENT5