1

########################################################################################

GE8151 PROBLEM SOLVING AND PYTHON PROGRAMMING L T P C

3003
OBJECTIVES:
 To know the basics of algorithmic problem solving
 To read and write simple Python programs.
 To develop Python programs with conditionals and loops.
 To define Python functions and call them.
 To use Python data structures –- lists, tuples, dictionaries.
 To do input/output with files in Python.
UNIT I ALGORITHMIC PROBLEM SOLVING 9
Algorithms, building blocks of algorithms (statements, state, control flow, functions), notation (pseudo
code, flow chart, programming language), algorithmic problem solving, simple strategies for
developing algorithms (iteration, recursion). Illustrative problems: find minimum in a list, insert a card
in a list of sorted cards, guess an integer number in a range, Towers of Hanoi.
UNIT II DATA, EXPRESSIONS, STATEMENTS 9
Python interpreter and interactive mode; values and types: int, float, boolean, string, and list;
variables, expressions, statements, tuple assignment, precedence of operators, comments; modules
and functions, function definition and use, flow of execution, parameters and arguments; Illustrative
programs: exchange the values of two variables, circulate the values of n variables, distance between
two points.
UNIT III CONTROL FLOW, FUNCTIONS 9
Conditionals: Boolean values and operators, conditional (if), alternative (if-else), chained conditional
(if-elif-else); Iteration: state, while, for, break, continue, pass; Fruitful functions: return values,
parameters, local and global scope, function composition, recursion; Strings: string slices,
immutability, string functions and methods, string module; Lists as arrays. Illustrative programs:
square root, gcd, exponentiation, sum an array of numbers, linear search, binary search.
UNIT IV LISTS, TUPLES, DICTIONARIES 9
Lists: list operations, list slices, list methods, list loop, mutability, aliasing, cloning lists, list parameters;
Tuples: tuple assignment, tuple as return value; Dictionaries: operations and methods; advanced list
processing - list comprehension; Illustrative programs: selection sort, insertion sort, mergesort,
histogram.
UNIT V FILES, MODULES, PACKAGES 9
Files and exception: text files, reading and writing files, format operator; command line arguments,
errors and exceptions, handling exceptions, modules, packages; Illustrative programs: word count,
copy file.
OUTCOMES:
Upon completion of the course, students will be able to
 Develop algorithmic solutions to simple computational problems
 Read, write, execute by hand simple Python programs.
 Structure simple Python programs for solving problems.
 Decompose a Python program into functions.
 Represent compound data using Python lists, tuples, dictionaries.
 Read and write data from/to files in Python Programs.
TOTAL : 45 PERIODS
TEXT BOOKS:
1. Allen B. Downey, ``Think Python: How to Think Like a Computer Scientist’’, 2 nd edition, Updated
for Python 3, Shroff/O’Reilly Publishers, 2016 (http://greenteapress.com/wp/think-python/)
2. Guido van Rossum and Fred L. Drake Jr, “An Introduction to Python – Revised and updated for
Python 3.2, Network Theory Ltd., 2011.
REFERENCES:
1. John V Guttag, “Introduction to Computation and Programming Using Python’’, Revised and
expanded Edition, MIT Press , 2013
2. Robert Sedgewick, Kevin Wayne, Robert Dondero, “Introduction to Programming in Python: An
Inter-disciplinary Approach, Pearson India Education Services Pvt. Ltd., 2016.
3. Timothy A. Budd, “Exploring Python”, Mc-Graw Hill Education (India) Private Ltd.,, 2015.
4. Kenneth A. Lambert, “Fundamentals of Python: First Programs”, CENGAGE Learning, 2012.
Computer Science using Python 3”, Second edition, Pragmatic Programmers, LLC, 2013

###############################################################################################2
MT8591 SENSORS AND INSTRUMENTATION

OBJECTIVES:
• To understand the concepts of measurement technology.
• To learn the various sensors used to measure various physical parameters.
• To learn the fundamentals of signal conditioning, data acquisition and communication systems
used in mechatronics system development.
UNIT I INTRODUCTION 9
Basics of Measurement – Classification of errors – Error analysis – Static and dynamic
characteristics of transducers – Performance measures of sensors – Classification of sensors –
Sensor calibration techniques – Sensor Output Signal Types.
UNIT II MOTION, PROXIMITY AND RANGING SENSORS 9
Motion Sensors – Potentiometers, Resolver, Encoders – Optical, Magnetic, Inductive, Capacitive,
LVDT – RVDT – Synchro – Microsyn, Accelerometer – GPS, Bluetooth, Range Sensors – RF
beacons, Ultrasonic Ranging, Reflective beacons, Laser Range Sensor (LIDAR).
UNIT III FORCE, MAGNETIC AND HEADING SENSORS 7
Strain Gage, Load Cell, Magnetic Sensors –types, principle, requirement and advantages:
Magneto resistive – Hall Effect – Current sensor Heading Sensors – Compass, Gyroscope,
Inclinometers.
UNIT IV OPTICAL, PRESSURE AND TEMPERATURE SENSORS 11
Photo conductive cell, photo voltaic, Photo resistive, LDR – Fiber optic sensors – Pressure –
Diaphragm, Bellows, Piezoelectric – Tactile sensors, Temperature – IC, Thermistor, RTD,
Thermocouple. Acoustic Sensors – flow and level measurement, Radiation Sensors - Smart
Sensors - Film sensor, MEMS & Nano Sensors, LASER sensors.
UNIT V SIGNAL CONDITIONING AND DAQ SYSTEMS 9
Amplification – Filtering – Sample and Hold circuits – Data Acquisition: Single channel and multi
channel data acquisition – Data logging - applications - Automobile, Aerospace, Home appliances,
Manufacturing, Environmental monitoring.
TOTAL : 45 PERIODS
OUTCOMES:
Upon Completion of the course the students will be able to
CO1: Familiar with various calibration techniques and signal types for sensors.
CO2: Apply the various sensors in the Automotive and Mechatronics applications
CO3: Describe the working principle and characteristics of force, magnetic and heading sensors.
CO4: Understand the basic principles of various pressure and temperature, smart sensors.
CO5: Ability to implement the DAQ systems with different sensors for real time applications.
TEXT BOOKS:
1.Ernest O Doebelin, “Measurement Systems – Applications and Design”, Tata McGraw-Hill, 2009
2.Sawney A K and Puneet Sawney, “A Course in Mechanical Measurements and Instrumentation
and Control”, 12th edition, Dhanpat Rai & Co, New Delhi, 2013.
REFERENCES
1.C. Sujatha ... Dyer, S.A., Survey of Instrumentation and Measurement, John Wiley & Sons,
Canada, 2001
2.Hans Kurt Tonshoff (Editor), Ichiro , “Sensors in Manufacturing” Volume 1, Wiley-VCH April
2001.
3.John Turner and Martyn Hill, “Instrumentation for Engineers and Scientists”, Oxford Science
Publications, 1999.
4.Patranabis D, “Sensors and Transducers”, 2 nd Edition, PHI, New Delhi, 2011.
5.Richard Zurawski, “Industrial Communication Technology Handbook” 2 nd edition, CRC Press,
2015
##############################################################################################

3 EC8301 OBJECT ORIENTED PROGRAMMING AND DATA STRUCTURES

OBJECTIVES:
 To comprehend the fundamentals of object oriented programming, particularly in C++.
 To use object oriented programming to implement data structures.
 To introduce linear data structures.
 To study about the non-linear data structures
 To understand about the different algorithms
UNIT I DATA ABSTRACTION & OVERLOADING 9
Overview of C++ – Structures – Class Scope and Accessing Class Members – Reference Variables –
Initialization – Constructors – Destructors – Member Functions and Classes – Friend Function –
Dynamic Memory Allocation – Static Class Members – Container Classes and Integrators – Proxy
Classes – Overloading: Function overloading and Operator Overloading.
UNIT II INHERITANCE & POLYMORPHISM 9
Base Classes and Derived Classes – Protected Members – Casting Class pointers and Member
Functions – Overriding – Public, Protected and Private Inheritance – Constructors and Destructors in
derived Classes – Implicit Derived – Class Object To Base – Class Object Conversion – Composition
Vs. Inheritance – Virtual functions – This Pointer – Abstract Base Classes and Concrete Classes –
Virtual Destructors – Dynamic Binding.
UNIT III LINEAR DATA STRUCTURES 10
Abstract Data Types (ADTs) – List ADT – array-based implementation – linked list implementation ––
singly linked lists –Polynomial Manipulation - Stack ADT – Queue ADT - Evaluating arithmetic
expressions
UNIT IV NON-LINEAR DATA STRUCTURES 9
Trees – Binary Trees – Binary tree representation and traversals – Application of trees: Set
representation and Union-Find operations – Graph and its representations – Graph Traversals –
Representation of Graphs – Breadth-first search – Depth-first search - Connected components.
UNIT V SORTING AND SEARCHING 8
Sorting algorithms: Insertion sort - Quick sort - Merge sort - Searching: Linear search –Binary Search
TOTAL: 45 PERIODS
OUTCOMES:
Upon completion of the course, students will be able to:
 To know about data abstraction
 Explain the concepts of Object oriented programming.
 Write simple applications using C++.
 To demonstrate different linearity in data structures.
 Discuss the different methods of organizing large amount of data.
TEXT BOOKS:
1. Deitel and Deitel, “C++, How To Program”, Fifth Edition, Pearson Education, 2005.
2. Mark Allen Weiss, “Data Structures and Algorithm Analysis in C++”, Third Edition, Addison-
Wesley, 2007.
REFERENCES:
1. Bhushan Trivedi, “Programming with ANSI C++, A Step-By-Step approach”, Oxford University
Press, 2010.
2. Goodrich, Michael T., Roberto Tamassia, David Mount, “Data Structures and Algorithms in C++”,
7th Edition, Wiley. 2004.
3. Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest and Clifford Stein, "Introduction to
Algorithms", Second Edition, Mc Graw Hill, 2002.
4. Bjarne Stroustrup, “The C++ Programming Language”, 3rd Edition, Pearson Education, 2007.
5. Ellis Horowitz, Sartaj Sahni and Dinesh Mehta, “Fundamentals of Data Structures in C++”,
Galgotia Publications, 2007.
##############################################################################################
RO8403 KINEMATICS AND DYNAMICS OF MACHINCES L T P C
3204
OBJECTIVES:
 To understand the basic knowledge about kinematics of machines.
 To understand the basic components and layout of linkages in the assembly of a system/
machine.
 To understand the principles in analyzing the assembly with respect to the displacement,
velocity, and acceleration at any point in a link of a mechanism.
 To understand the motion resulting from a specified set of linkages, design few linkage
mechanisms and cam mechanisms for specified output motions.
SEMESTER I
1. GE8151 Problem Solving and Python Programming
SEMESTER – III
2. MT8591 Sensors and Instrumentation
3. EC8301 Object Oriented Programming and Data Structures
SEMESTER – IV
4. RO8403 Kinematics and Dynamics of Machines
SEMESTER – V
5. RO8591 Principles of Robotics
6. RO8502 Microcontrollers and PLC
7. CS8491 Computer Architecture
SEMESTER – VI
8. RO8601 Embedded Controllers and Real time Operating Systems
9. RO8602 Machine Vision Systems
10. RO8603 Automation System Design
SEMESTER – VII
11. RO8791 Modeling and Simulation
12. RO8701 Field and Service Robotics
PROFESSIONAL ELECTIVES FOR ROBOTICS AND AUTOMATION
SEMESTER VI, ELECTIVE – I
13. RO8001 Advanced Microprocessors and Microcontrollers
14. RO8002 System Software
15. GE8075 Intellectual Property Rights
SEMESTER VII, ELECTIVE – III
16. MT8071 Virtual Instrumentation
17. RO8003 Artificial Intelligence for Robotics
18. RO8005 Advanced Control Systems
SEMESTER VII, ELECTIVE – IV
19. RO8007 Neural Networks and Fuzzy Systems
20. RO8008 Industrial Robotics and Material Handling Systems
21. RO8009 Totally Integrated Automation
SEMESTER VIII, ELECTIVE – V
21. MT8791 Embedded System Design
22. RO8010 Wireless Sensors Networks for Robotics
23. RO8011 Industrial Networking
24. EE8091 Micro Electro Mechanical Systems
SEMESTER VIII, ELECTIVE – VI
25. RO8012 Digital Signal Processors and its Applications
26. RO8013 Internet Tools and Java Programming
27. ME8094 Computer Integrated Manufacturing Systems

###############################################################################################
1. GE8151 Problem Solving and Python Programming
2. MT8591 Sensors and Instrumentation
3. EC8301 Object Oriented Programming and Data Structures
4. RO8403 Kinematics and Dynamics of Machines
5. RO8591 Principles of Robotics
6. RO8502 Microcontrollers and PLC
7. CS8491 Computer Architecture
8. RO8601 Embedded Controllers and Real time Operating Systems
9. RO8602 Machine Vision Systems
10. RO8603 Automation System Design
11. RO8791 Modeling and Simulation
12. RO8701 Field and Service Robotics
13. RO8001 Advanced Microprocessors and Microcontrollers
14. RO8002 System Software
15. GE8075 Intellectual Property Rights
16. MT8071 Virtual Instrumentation
17. RO8003 Artificial Intelligence for Robotics
18. RO8005 Advanced Control Systems
19. RO8007 Neural Networks and Fuzzy Systems
20. RO8008 Industrial Robotics and Material Handling Systems
21. RO8009 Totally Integrated Automation
21. MT8791 Embedded System Design

22. RO8010 Wireless Sensors Networks for Robotics

23. RO8011 Industrial Networking
24. EE8091 Micro Electro Mechanical Systems
25. RO8012 Digital Signal Processors and its Applications
26. RO8013 Internet Tools and Java Programming
27. ME8094 Computer Integrated Manufacturing Systems
4. HS8581 Professional Communication

##############################################################################################

###########################################################################################

SEMESTER I
1. GE8151
RO8591 Problem
PrinciplesSolving
of Robotics
and Python Programming
SEMESTER
2. RO8601 Embedded
MT8591 –Sensors
III andControllers
Instrumentation
and Real time Operating Systems
2. EC8301
3. MT8591Object
RO8602 Machine
SensorsOriented
and
Vision
Instrumentation
Systems
Programming and Data Structures
3. RO8403
4. EC8301 Object
RO8603 Automation
Kinematics
Oriented
and
System
Dynamics
Programming
Designof Machines
and Data Structures
SEMESTER
5. RO8791 Microcontrollers
RO8502 Modeling
– IV and Simulation
and PLC
4. CS8491
6. RO8403Computer
RO8701 Kinematics
Field and Service
Architecture
and Dynamics
Roboticsof Machines
SEMESTER
7. RO8001 Advanced
–V Microprocessors and Microcontrollers
5. RO8002
8. RO8591 System
Principles Software
of Robotics
6. MT8071
9. RO8502 Microcontrollers
Virtual Instrumentation
and PLC
7. CS8491
10. RO8003Computer
Artificial Architecture
Intelligence for Robotics
SEMESTER
11. RO8005–Advanced
VI Control Systems
8. RO8601
12. RO8007Embedded
Neural Networks
Controllers
and and
FuzzyReal
Systems
time Operating Systems
9. RO8602
13. RO8008Machine
IndustrialVision
Robotics
Systems
and Material Handling Systems
10. RO8009
14. RO8603 Totally
Automation
Integrated
System Automation
Design
SEMESTER
15. MT8791–Embedded
VII System Design
11. RO8791 Modeling and Simulation
12. RO8701 Field and Service Robotics
PROFESSIONAL ELECTIVES FOR ROBOTICS AND AUTOMATION
SEMESTER VI, ELECTIVE – I
13. RO8001 Advanced Microprocessors and Microcontrollers
14. RO8002 System Software
15. GE8075 Intellectual Property Rights
SEMESTER VII, ELECTIVE – III
16. MT8071 Virtual Instrumentation
17. RO8003 Artificial Intelligence for Robotics
18. RO8005 Advanced Control Systems
SEMESTER VII, ELECTIVE – IV
19. RO8007 Neural Networks and Fuzzy Systems
20. RO8008 Industrial Robotics and Material Handling Systems
21. RO8009 Totally Integrated Automation
SEMESTER VIII, ELECTIVE – V
21. MT8791 Embedded System Design

22. RO8010 Wireless Sensors Networks for Robotics

23. RO8011 Industrial Networking
24. EE8091 Micro Electro Mechanical Systems
SEMESTER VIII, ELECTIVE – VI
25. RO8012 Digital Signal Processors and its Applications
26. RO8013 Internet Tools and Java Programming
27. ME8094 Computer Integrated Manufacturing Systems
############################################################################################

IMPORTANT TO STUDY

ALREADY KNOWN

UNIMPORTANT
1. GE8075 Intellectual Property Rights
2. RO8010 Wireless Sensors Networks for Robotics
3. RO8011 Industrial Networking
4. EE8091 Micro Electro Mechanical Systems
5. RO8012 Digital Signal Processors and its Applications
6. RO8013 Internet Tools and Java Programming
7. ME8094 Computer Int1
########################################################################################

GE8151 PROBLEM SOLVING AND PYTHON PROGRAMMING L T P C

3003
OBJECTIVES:
 To know the basics of algorithmic problem solving
 To read and write simple Python programs.
 To develop Python programs with conditionals and loops.
 To define Python functions and call them.
 To use Python data structures –- lists, tuples, dictionaries.
 To do input/output with files in Python.
UNIT I ALGORITHMIC PROBLEM SOLVING 9
Algorithms, building blocks of algorithms (statements, state, control flow, functions), notation (pseudo
code, flow chart, programming language), algorithmic problem solving, simple strategies for
developing algorithms (iteration, recursion). Illustrative problems: find minimum in a list, insert a card
in a list of sorted cards, guess an integer number in a range, Towers of Hanoi.
UNIT II DATA, EXPRESSIONS, STATEMENTS 9
Python interpreter and interactive mode; values and types: int, float, boolean, string, and list;
variables, expressions, statements, tuple assignment, precedence of operators, comments; modules
and functions, function definition and use, flow of execution, parameters and arguments; Illustrative
programs: exchange the values of two variables, circulate the values of n variables, distance between
two points.
UNIT III CONTROL FLOW, FUNCTIONS 9
Conditionals: Boolean values and operators, conditional (if), alternative (if-else), chained conditional
(if-elif-else); Iteration: state, while, for, break, continue, pass; Fruitful functions: return values,
parameters, local and global scope, function composition, recursion; Strings: string slices,
immutability, string functions and methods, string module; Lists as arrays. Illustrative programs:
square root, gcd, exponentiation, sum an array of numbers, linear search, binary search.
UNIT IV LISTS, TUPLES, DICTIONARIES 9
Lists: list operations, list slices, list methods, list loop, mutability, aliasing, cloning lists, list parameters;
Tuples: tuple assignment, tuple as return value; Dictionaries: operations and methods; advanced list
processing - list comprehension; Illustrative programs: selection sort, insertion sort, mergesort,
histogram.
UNIT V FILES, MODULES, PACKAGES 9
Files and exception: text files, reading and writing files, format operator; command line arguments,
errors and exceptions, handling exceptions, modules, packages; Illustrative programs: word count,
copy file.
OUTCOMES:
Upon completion of the course, students will be able to
 Develop algorithmic solutions to simple computational problems
 Read, write, execute by hand simple Python programs.
 Structure simple Python programs for solving problems.
 Decompose a Python program into functions.
 Represent compound data using Python lists, tuples, dictionaries.
 Read and write data from/to files in Python Programs.
TOTAL : 45 PERIODS
TEXT BOOKS:
1. Allen B. Downey, ``Think Python: How to Think Like a Computer Scientist’’, 2 nd edition, Updated
for Python 3, Shroff/O’Reilly Publishers, 2016 (http://greenteapress.com/wp/think-python/)
2. Guido van Rossum and Fred L. Drake Jr, “An Introduction to Python – Revised and updated for
Python 3.2, Network Theory Ltd., 2011.
REFERENCES:
Computer Science using Python 3”, Second edition, Pragmatic Programmers, LLC, 2013

###############################################################################################2
MT8591 SENSORS AND INSTRUMENTATION

OBJECTIVES:
• To understand the concepts of measurement technology.
• To learn the various sensors used to measure various physical parameters.
• To learn the fundamentals of signal conditioning, data acquisition and communication systems
used in mechatronics system development.
UNIT I INTRODUCTION 9
Basics of Measurement – Classification of errors – Error analysis – Static and dynamic
characteristics of transducers – Performance measures of sensors – Classification of sensors –
Sensor calibration techniques – Sensor Output Signal Types.
UNIT II MOTION, PROXIMITY AND RANGING SENSORS 9
Motion Sensors – Potentiometers, Resolver, Encoders – Optical, Magnetic, Inductive, Capacitive,
LVDT – RVDT – Synchro – Microsyn, Accelerometer – GPS, Bluetooth, Range Sensors – RF
beacons, Ultrasonic Ranging, Reflective beacons, Laser Range Sensor (LIDAR).
UNIT III FORCE, MAGNETIC AND HEADING SENSORS 7
Strain Gage, Load Cell, Magnetic Sensors –types, principle, requirement and advantages:
Magneto resistive – Hall Effect – Current sensor Heading Sensors – Compass, Gyroscope,
Inclinometers.
UNIT IV OPTICAL, PRESSURE AND TEMPERATURE SENSORS 11
Photo conductive cell, photo voltaic, Photo resistive, LDR – Fiber optic sensors – Pressure –
Diaphragm, Bellows, Piezoelectric – Tactile sensors, Temperature – IC, Thermistor, RTD,
Thermocouple. Acoustic Sensors – flow and level measurement, Radiation Sensors - Smart
Sensors - Film sensor, MEMS & Nano Sensors, LASER sensors.
UNIT V SIGNAL CONDITIONING AND DAQ SYSTEMS 9
Amplification – Filtering – Sample and Hold circuits – Data Acquisition: Single channel and multi
channel data acquisition – Data logging - applications - Automobile, Aerospace, Home appliances,
Manufacturing, Environmental monitoring.
TOTAL : 45 PERIODS
OUTCOMES:
Upon Completion of the course the students will be able to
CO1: Familiar with various calibration techniques and signal types for sensors.
CO2: Apply the various sensors in the Automotive and Mechatronics applications
CO3: Describe the working principle and characteristics of force, magnetic and heading sensors.
CO4: Understand the basic principles of various pressure and temperature, smart sensors.
CO5: Ability to implement the DAQ systems with different sensors for real time applications.
TEXT BOOKS:
1.Ernest O Doebelin, “Measurement Systems – Applications and Design”, Tata McGraw-Hill, 2009
2.Sawney A K and Puneet Sawney, “A Course in Mechanical Measurements and Instrumentation
and Control”, 12th edition, Dhanpat Rai & Co, New Delhi, 2013.
REFERENCES
1.C. Sujatha ... Dyer, S.A., Survey of Instrumentation and Measurement, John Wiley & Sons,
Canada, 2001
2.Hans Kurt Tonshoff (Editor), Ichiro , “Sensors in Manufacturing” Volume 1, Wiley-VCH April
2001.
3.John Turner and Martyn Hill, “Instrumentation for Engineers and Scientists”, Oxford Science
Publications, 1999.
4.Patranabis D, “Sensors and Transducers”, 2 nd Edition, PHI, New Delhi, 2011.
5.Richard Zurawski, “Industrial Communication Technology Handbook” 2 nd edition, CRC Press,
2015
##############################################################################################

3 EC8301 OBJECT ORIENTED PROGRAMMING AND DATA STRUCTURES

OBJECTIVES:
 To comprehend the fundamentals of object oriented programming, particularly in C++.
 To use object oriented programming to implement data structures.
 To introduce linear data structures.
 To study about the non-linear data structures
 To understand about the different algorithms
UNIT I DATA ABSTRACTION & OVERLOADING 9
Overview of C++ – Structures – Class Scope and Accessing Class Members – Reference Variables –
Initialization – Constructors – Destructors – Member Functions and Classes – Friend Function –
Dynamic Memory Allocation – Static Class Members – Container Classes and Integrators – Proxy
Classes – Overloading: Function overloading and Operator Overloading.
UNIT II INHERITANCE & POLYMORPHISM 9
Base Classes and Derived Classes – Protected Members – Casting Class pointers and Member
Functions – Overriding – Public, Protected and Private Inheritance – Constructors and Destructors in
derived Classes – Implicit Derived – Class Object To Base – Class Object Conversion – Composition
Vs. Inheritance – Virtual functions – This Pointer – Abstract Base Classes and Concrete Classes –
Virtual Destructors – Dynamic Binding.
UNIT III LINEAR DATA STRUCTURES 10
Abstract Data Types (ADTs) – List ADT – array-based implementation – linked list implementation ––
singly linked lists –Polynomial Manipulation - Stack ADT – Queue ADT - Evaluating arithmetic
expressions
UNIT IV NON-LINEAR DATA STRUCTURES 9
Trees – Binary Trees – Binary tree representation and traversals – Application of trees: Set
representation and Union-Find operations – Graph and its representations – Graph Traversals –
Representation of Graphs – Breadth-first search – Depth-first search - Connected components.
UNIT V SORTING AND SEARCHING 8
Sorting algorithms: Insertion sort - Quick sort - Merge sort - Searching: Linear search –Binary Search
TOTAL: 45 PERIODS
OUTCOMES:
Upon completion of the course, students will be able to:
 To know about data abstraction
 Explain the concepts of Object oriented programming.
 Write simple applications using C++.
 To demonstrate different linearity in data structures.
 Discuss the different methods of organizing large amount of data.
TEXT BOOKS:
1. Deitel and Deitel, “C++, How To Program”, Fifth Edition, Pearson Education, 2005.
2. Mark Allen Weiss, “Data Structures and Algorithm Analysis in C++”, Third Edition, Addison-
Wesley, 2007.
REFERENCES:
1. Bhushan Trivedi, “Programming with ANSI C++, A Step-By-Step approach”, Oxford University
Press, 2010.
2. Goodrich, Michael T., Roberto Tamassia, David Mount, “Data Structures and Algorithms in C++”,
7th Edition, Wiley. 2004.
3. Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest and Clifford Stein, "Introduction to
Algorithms", Second Edition, Mc Graw Hill, 2002.
4. Bjarne Stroustrup, “The C++ Programming Language”, 3rd Edition, Pearson Education, 2007.
5. Ellis Horowitz, Sartaj Sahni and Dinesh Mehta, “Fundamentals of Data Structures in C++”,
Galgotia Publications, 2007.
##############################################################################################
RO8403 KINEMATICS AND DYNAMICS OF MACHINCES L T P C
3204
OBJECTIVES:
 To understand the basic knowledge about kinematics of machines.
 To understand the basic components and layout of linkages in the assembly of a system/
machine.
 To understand the principles in analyzing the assembly with respect to the displacement,
velocity, and acceleration at any point in a link of a mechanism.
 To understand the motion resulting from a specified set of linkages, design few linkage
mechanisms and cam mechanisms for specified output motions.
egrated Manufacturing Systems