Académique Documents
Professionnel Documents
Culture Documents
Reference Books:
1. Bjarne stroustrup, The C++ programming Language, Addison Wesley, 4th edition, 2013
2. Harvey M. Deitel and Paul J. Deitel, C++ How to Program, 7th edition, Prentice Hall, 2010.
3. Maureen Sprankle and Jim Hubbard, Problem solving and Programming concepts, 9th edition, Pearson
Eduction, 2014
Sl. List of Challenging Experiments
No
1. Postman Problem
A postman needs to walk down every street in his area in order to deliver the mail. Assume that the
distances between the streets along the roads are given. The postman starts at the post office and
returns back to the post office after delivering all the mails. Implement an algorithm to help the
post man to walk minimum distance for the purpose.
2. Budget Allocation for Marketing Campaign
A mobile manufacturing company has got several marketing options such as Radio advertisement
campaign, TV non peak hours campaign, City top paper network, Viral marketing campaign, Web
advertising. From their previous experience, they have got a statistics about paybacks for each
marketing option. Given the marketing budget (rupees in crores) for the current year and details of
paybacks for each option, implement an algorithm to determine the amount that shall spent on each
marketing option so that the company attains the maximum profit.
Course Description
Knowledge Areas that contain topics and learning outcomes covered in the course
This course is
University core.
Suitable from 2nd semester onwards.
Basic skill in problem solving techniques is essential.
This Course is designed with 300 minutes of lab hours (3 sessions each 100 minutes) per week. In every
practice session, the teacher will explain the concepts by taking one or two problems from the problem set
then student is expected to solve these problems during this session. Remaining problems will be solved by
the students as a home assignment/practice problem.
Friend functions
2 Friend class Usage T1,R1,R2
2 Function overloading concept Usage T1,R1,R2
2 Operator overloading – unary operator Usage T1,R1,R2
2 Operator overloading -subscript operator [] Usage T1,R1,R2
Operator overloading – all operators Video lecture/Self study
2 Operator overloading – binary operator using friend Usage T1,R1,R2
and member function
2 Operator overloading – Type Conversion Usage T1,R1,R2
2 Assessment – III
Overview of Greedy Technique - Scheduling R3
Problem* Familiarity T1,R1,R2
2 Case study - Railway Reservation Systems** and Usage
formatted iostreams
manipulators Video lecture/Self study
2 Manipulators , overloading Inserters(<<) and Usage T1,R1,R2
Extractors(>>)
2 Sequential – writing and reading objects into/from Usage T1,R1,R2
files
Random files - writing and reading objects into/from Usage T1,R1,R2
2
files
2 Assessment – VI
2 Assessment -Challenging Task
* The programming concepts and the problem given must be related
**The case study must be extensively discussed while introducing the OOP concepts