EC6312 OOPS AND DATA STRUCTURES LABORATORY SYLLABUS REG-2013 FOR 3RD SEM ECE DEPARTMENT - Anna University Internal marks 2018

EC6312 OOPS AND DATA STRUCTURES LABORATORY SYLLABUS REG-2013 FOR 3RD SEM ECE DEPARTMENT

EC6312 OOPS AND DATA STRUCTURES LABORATORY SYLLABUS FOR ANNA UNIVERSITY THIRD SEMESTER ELECTRICAL AND COMMUNICATION ENGINEERING ECE DEPARTMENT STUDENTS
EC6312 OOPS AND DATA STRUCTURES LABORATORY SYLLABUS
EC6312 OOPS AND DATA STRUCTURES LABORATORY
  • University : Anna university
  • Semester : 3rd sem
  • Department : ECE
  • Year : Second Yr
  • Regulation : 2013
  • Subject Name : OOPS AND DATA STRUCTURES LABORATORY
  • Subject Code : EC6312 
  • Subject Credits : 2
EC6312 OOPS AND DATA STRUCTURES LABORATORY SYLLABUS
SYLLABUS
REGULATION 2013

OBJECTIVES:
The student should be made to:
  • Learn C++ programming language.
  • Be exposed to the different data structures
  • Be familiar with applications using different data structures
LIST OF EXPERIMENTS:
1. Basic Programs for C++ Concepts
2. Array implementation of List Abstract Data Type (ADT)
3. Linked list implementation of List ADT
4. Cursor implementation of List ADT
5. Stack ADT - Array and linked list implementations
6. The next two exercises are to be done by implementing the following source files
i. Program source files for Stack Application 1
ii. Array implementation of Stack ADT
iii. Linked list implementation of Stack ADT
iv. Program source files for Stack Application 2
v. An appropriate header file for the Stack ADT should be included in (i) and (iv)

7. Implement any Stack Application using array implementation of Stack ADT (by implementing files (i) and (ii) given above) and then using linked list

8. Implementation of Stack ADT (by using files (i) and implementing file (iii))

9. Implement another Stack Application using array and linked list implementations of Stack ADT (by implementing files (iv) and using file (ii), and then by using files (iv) and (iii))

11. Queue ADT – Array and linked list implementations
12. Search Tree ADT - Binary Search Tree
13. Implement an interesting application as separate source files and using any of the searchable ADT files developed earlier. Replace the ADT file alone with other appropriate ADT files. Compare the performance.
14. Quick Sort

TOTAL: 45 PERIODS

REFERENCE:
spoken-tutorial.org.

OUTCOMES:
At the end of the course, the student should be able to:
  • Design and implement C++ programs for manipulating stacks, queues, linked lists, trees, and graphs.
  • Apply good programming design methods for program development.
  • Apply the different data structures for implementing solutions to practical problems.
LAB EQUIPMENT FOR A BATCH OF 30 STUDENTS:
Standalone desktops with C++ Compiler - 30 Nos.
(or)
Server with C++ compiler supporting 30 terminals or more.

No comments:

Post a Comment