INSTRUCTORS:
Dr. Shylaja S S
Chairperson, CSE - UG StudiesAddress
Crucible of Continuing Education (CCE)PES University Campus
100 Feet Ring Road, BSK III Stage
Bengaluru – 560 085 View map
About the Course
This course aims to build basic CS Skills in students. CS is a subject which gels with every other discipline and is the need of the hour. Having sound knowledge on the core of CS would be beneficial for students from Industry readiness point of view.
The course is significant for a student who has the keen interest in joining an IT firm as it focuses on placements as well as in their job profile. Non cs student will get an exposure thro this important topic with a combination of classroom teaching and hands on exercise/problem solving
Course Objectives(What will you learn)
- Students will understand the central need and importance for DS and its relation to algorithm development
- Understand and Analyse the working of existing algorithms
- Gain insight for designing new algorithms
- Students will be exposed to various design and implementation trade offs and choices of DS and algorithms
- Implement the data structures in C++
Who should attend
B.Tech Non CS branch students
Out station students / candidates have to make their arrangements for accommodation and boarding
Course Outline and schedule
Day-01
(Session 1 ) 8.30 to 9.00 (AM): Welcome address and Introductions
9.00 to 10.30 (AM): Class and object,Access specifiers,Friend Functions,reference variables,new and delete operators,constructors and destructors
Break : 10.30 to 11.00 (AM)
(Session 2 ) 11.00 to 12.30 (PM):Operator Overloading,Function Overloading
Lunch : 12.30 to 13.30 (PM)
(Session 3) 13.30 to 16.00 (PM): Hands on Praticals –
Designing and Building classes with the features discussed in the sessions and execution of the programs
Day-02
(Session 1 ) 8.30 to 9.00 (AM):Quiz
9.00 to 10.30 (AM):Inheritance,Polymorphism
Break : 10.30 to 11.00 (AM)
(Session 2 ) 11.00 to 12.30 (PM): Generic programming,,Class and Function templates,Exception handling
Lunch : 12.30 to 13.30 (PM)
(Session 3) 13.30 to 16.00 (PM): Hands on Praticals –
Problem solving examples involving Inheritance,Polymorphism Ex:Person class inherited for different purposes like deriving profession,student etc , Calculator,sorting,search etc for template examples
Day-03
(Session 1 ) 8.30 to 9.00 (AM):Quiz
9.00 to 10.30 (AM): Recursive Algorithms, Data Abstraction, Introduction to linear and Non Linear structures, Linked Lists
Break : 10.30 to 11.00 (AM)
(Session 2 ) 11.00 to 12.30 (PM):Stack & Queue.Applications Asymptotic Notation
Lunch : 12.30 to 13.30 (PM)
(Session 3) 13.30 to 16.00 (PM):Hands on Praticals –
Problems related o LL,Stack and Queues Ex : Expressions, Reservation Systems, finding max,power,count of digits et
Day-04
(Session 1 ) 8.30 to 9.00 (AM):Quiz
9.00 to 10.30 (AM): Binary Trees:Definitions and applications,
Break : 10.30 to 11.00 (AM)
(Session 2 ) 11.00 to 12.30 (PM): AVL, B Tree, Hashing
Lunch : 12.30 to 13.30 (PM)
(Session 3) 13.30 to 16.00 (PM): Hands on Praticals –
Open addressing and linking implementation of Hash,Tree related Problems Ex: Height of the tree, path sum,
Day-05
(Session 1 ) 8.30 to 9.00 (AM):Quiz
9.00 to 10.30 (AM): Design strategies Divide & Conquer,Space & Time Tradeoff,
Break : 10.30 to 11.00 (AM)
(Session 2 ) 11.00 to 12.30 (PM):Dynamic Programming and Greedy approach. One classic problem from each of the design techniques
Lunch : 12.30 to 13.30 (PM)
(Session 3) 13.30 to 16.00 (PM): Problems of higher order.