New Scheme Based On AICTE Flexible Curricula Robotics and Artificial Intelligence, III Semester

Branch- Common to All Discipline

OBJECTIVES: The objective of this course is to fulfill the needs of engineers to understand applications of Numerical Analysis, Transform Calculus and Statistical techniques in order to acquire mathematical knowledge and to solving wide range of practical problems appearing in different sections of science and engineering. More precisely, the objectives are:

• To introduce effective mathematical tools for the Numerical Solutions algebraic and transcendental equations.

• To enable young technocrats to acquire mathematical knowledge to understand Laplace transformation, Inverse Laplace transformation and Fourier Transform which are used in various branches of engineering.

• To acquaint the student with mathematical tools available in Statistics needed in various field of science and engineering.

Unit I: Numerical Methods: Solution of polynomial and transcendental equations

– Bisection method, Newton-Raphson method and Regula-Falsi method. Finite differences, Relation between operators, Interpolation using Newton’s forward and backward difference formulae. Interpolation with unequal intervals: Newton’s divided difference and Lagrange’s formulae.

Unit II: Numerical Methods: Numerical Differentiation, Numerical integration: Trapezoidal rule and Simpson’s 1/3rd and 3/8 rules. Solution of Simultaneous Linear Algebraic Equations by Gauss’s Elimination, Gauss’s Jordan, Crout’s methods, Jacobi’s, Gauss-Seidal, and Relaxation method.,

Unit III: Numerical Methods: Ordinary differential equations: Taylor’s series, Euler and modified Euler’s methods. RungeKutta method of fourth order for solving first and second order equations. Milne’s and Adam’s predicator-corrector methods. Partial differential equations: Finite difference solution two dimensional Laplace equation and Poission equation, Implicit and explicit methods for one dimensional heat equation (Bender-Schmidt and Crank-Nicholson methods), Finite difference explicit method for wave equation.

Unit IV: Transform Calculus: Laplace Transform, Properties of Laplace Transform, Laplace transform of periodic functions. Finding inverse Laplace transform by different methods, convolution theorem. Evaluation of integrals by Laplace transform, solving ODEs by Laplace Transform method, Fourier transforms.

Unit V: Concept of Probability: Probability Mass function, Probability Density Function, Discrete Distribution: Binomial, Poisson’s, Continuous Distribution: Normal Distribution, Exponential Distribution.

1. P. Kandasamy, K. Thilagavathy, K. Gunavathi, Numerical Methods, S. Chand & Company, 2ndEdition, Reprint 2012.

2. S.S. Sastry, Introductory methods of numerical analysis, PHI, 4th Edition, 2005.

3. Erwin kreyszig, Advanced Engineering Mathematics, 9th Edition, John Wiley & Sons, 2006.

4. B.S. Grewal, Higher Engineering Mathematics, Khanna Publishers, 35th Edition, 2010.

5. N.P. Bali and Manish Goyal, A text book of Engineering Mathematics, Laxmi Publications, Reprint,2010.

6. Veerarajan T., Engineering Mathematics, Tata McGraw-Hill, New Delhi, 2008.

7. P. G. Hoel, S. C. Port and C. J. Stone, Introduction to Probability Theory, Universal Book Stall, 2003(Reprint).

8. S. Ross, A First Course in Probability, 6th Ed., Pearson Education India, 2002.

9. W. Feller, An Introduction to Probability Theory and its Applications, Vol. 1, 3rd Ed., Wiley, 1968.Statistics

   
   

   RA302- Strength of Materials

   
   

   Course Objectives:

   To familiarize the students with the fundamentals of deformation, stresses, strains in structural elements.

   Course Outcomes: At the completion of this course, students should be able to

   1. Know the concepts of stress and strain.

   2. Understand the importance of elastic constants in design of any engineering components

   3. Analyze the beam of different cross sections for shear force, bending moment, slope anddeflection.

   4. Understand the concepts necessary to design the structural elements and pressure vessels.

   5. Apply different theories of failures in designing of structural or machine components

UNIT-I: Simple Stress and Strain

Concept of Elastic body, stress and Strain, stress strain diagram, Hooke’s law, Various types of stress and strains, Elastic constants, Stresses in compound bars, composite and tapering bars, Temperature stresses. strain energy under axial loads and stresses due to impact of falling weights.

Two dimensional and three-dimensional stress system. Normal and tangential stresses, Principal Planes, Principal Stresses and Strains, Mohr’s circle of stresses.

UNIT-II: Bending and Shearing Stresses

Bending: Theory of simple bending, Concept of pure bending and bending stress, Equation of bending, Neutral axis, Section-Modulus, Determination of bending stresses in simply supported, Cantilever and Overhanging beams subjected to point load and uniformly distributed loading, Bending stress distribution across a section of beam, strain energy in bending.

Shearing Stress: Shearing Stress in a beam and shear stress distribution across a section in Beams.

UNIT III: Slopes and Deflection

Differential equation of the elastic curve, Determination of Slope and Deflection of beams by Double Integration Method, Area Moment Method,

UNIT IV: Torsion of Shafts and Theories of Failure

Concept of pure torsion, Torsion equation, Determination of shear stress and angle of twist of shafts of circular section, Torsion of solid and hollow circular shafts, Analyses of problems based on combined Bending and Torsion, Theories of Failure

Columns & struts: Theory of columns, Slenderness ratio, Direct and bending stresses in short columns, Stability of structures, Euler’s formula for columns with different end conditions, Rankine’sformula, Eccentric loads and the Secant formula, Imperfections in columns

EVALUATION

Evaluation will be continuous an integral part of the class as well through external assessment.

References:

1. Beer FP, Johnson Mechanics of Materials ,Sixth Edition ;Mc Graw Hills

2. Debabrata Nag & Abhijet Chanda :Strength of Materials : Wiley

3. Rajput R.K.; Strength of Materials, S.Chand Publications,New Delhi

4. Rattan; Strength of materials;Second Edition , Mc Graw Hills

5. Nash William; Schaum’s Outline Series; forth Edition Strength of Materials;Mc Graw Hills

6. Singh Arbind K; Mechanics of Solids; PHI

7. Khurmi R.S.; Strength of Materials. S.Chand

8. Sadhu Singh; Strength of Materials; Khanna Pub.

9. R Subramannian , Strength of materials OXFORD University Press ,Third Edition .

10. S Ramamurthum , Strength of materials , Dhanpat Rai

RA 303N23- Data Structures

Course Objectives:

1. To understand basic data structures, their implementation and some of their standard applications.

2. To assess how the choice of data structures and algorithm design methods impacts the performance of programs.

3. To develop skills to apply appropriate data structures in problem solving.

   
   

   Expected Course Outcome:

   
   

   1. Clear knowledge about problem solving skills in DS & Algorithms concepts Syllabus:

      UNIT I: Introduction to Data Structure: Concepts of Data and Information, Classification of Data structures, Abstract Data Types, Implementation aspects: Memory representation. Data Structures operations and its cost estimation.

      Introduction to Linear Data Structures- Arrays, Linked List: Representation of Linked List in memory, different implementations of Linked List i.e. Static(Array) Implementation and Dynamic Implementation, Circular Linked List, Doubly Linked List, etc. Application of Linked List: Polynomial Manipulation using Linked List, etc.

      
      

      UNIT II: Stacks: Stacks as ADT, Different implementation of Stack, multiple stacks. Application of Stack: Conversion of Infix to Postfix notation using Stack, evaluation of Postfix Expression, Recursion. Queues: Queues as ADT, Different implementation of Queue, Circular Queue, Concept of Deque ( Double Ended Queue) and Priority Queue, Queue simulation, Application of Queues.

      
      

      UNIT III: Tree: Definitions - Height, Depth, Order, Degree etc. Binary Search Tree - Operations, Traversal, Search. AVL Tree, Heap, Applications and Comparison of various types of Trees ; Introduction to Forest, Multi-Way Tree, B tree, B+ tree, B* Tree and Red-Black Tree.

      
      

      UNIT IV: Graphs: Introduction, Classification of Graph: Directed and Undirected Graphs, etc, Representation, Graph Traversal: Depth First Search (DFS), Breadth First Search (BFS), Graph algorithm: Minimum Spanning Tree (MST)- Kruskal, Prim’s algorithms. Dijkstra’s Shortest Path Algorithm; Comparison between different Graph Algorithms. Application of Graphs.

      UNIT V: Sorting: Introduction, Sort methods like: Bubble Sort, Quick Sort, Selection Sort, Heap Sort, Insertion Sort, Shell Sort, Merge Sort and Radix Sort; comparison of various Sorting Techniques.

      Searching:Basic Search Techniques: Sequential Search, Binary Search, Comparison of Search methods. Hashing & Indexing. Case Study: Application of various data structures in Operating System, DBMS etc.

      EVALUATION: Evaluation will be continuous an integral part of the class as well through external assessment.

      
      

      Text Books

      1. AM Tanenbaum, Y Langsam& MJ Augustein, “Data structure using C and C++”, Prentice Hall India.

      2. Robert Kruse, Bruse Leung, “Data structures & Program Design in C”, Pearson Education.

Reference Books

1. Aho, Hopcroft, Ullman, “Data Structures and Algorithms”, Pearson Education.

2. N. Wirth, “Algorithms + Data Structure = Programs”, Prentice Hall.

3. Jean – Paul Trembly , Paul Sorenson, “An Introduction to Structure with application”, TMH.

4. Richard, Gilberg Behrouz, Forouzan ,“Data structure – A Pseudocode Approach with C”, Thomson press.

5. Data Structures using C & C++, As per AICTE by Rajesh Shukla Wiley publication

Suggested List of Experiments:

1. Write a program that uses functions to perform the following operations on Singly Linked List

   1. Creation ii) Insertion iii) Deletion iv) Traversal.

2. Write a program that uses functions to perform the following operations on Doubly Linked List

   1. Creation ii) Insertion iii) Deletion iv) Traversal.

3. Write a program that uses functions to perform the following operations on Circular Linked List

   1. Creation ii) Insertion iii) Deletion iv) Traversal.

4. Write a program that implement Stack & its operations using

   1. Arrays (Static Implementation) ii) Linked List (Dynamic Implementation).

5. Write a program that implement Queue & its operations using

   1. Arrays (Static Implementation) ii) Linked List (Dynamic Implementation).

6. Write a program that implements Circular Queue using Arrays.

7. Write a program that uses both recursive and non recursive functions to perform the following searching operations for a Key value in a given list of integers:

   1. Linear search ii) Binary Search.

8. Write a program that implements the following sorting methods

   1. Bubble Sort ii) Selection Sort iii) Quick Sort.

9. Write a program that implements the following sorting methods

   1. Insertion Sort ii) Merge Sort iii) Heap Sort.

10. Write a program to implement all the functions of a dictionary (ADT) using Linked List.

11. Write a program to perform the following operations:

    1. Insert an element into a Binary Search Tree.

    2. Delete an element from a Binary Search Tree.

    3. Search for a key element in a Binary Search Tree.

12. Write a program to implement the Tree Traversal Methods

13. Write a program to perform the following operations:

    1. Insert an element into AVL tree.

    2. Delete an element from AVL tree.

    3. Search for a key element in AVL tree.

RAJIV GANDHI PROUDYOGIKI VISHWAVIDYALAYA, BHOPAL

New Scheme Based On AICTE Flexible Curricula Robotics and Artificial Intelligence, III-Semester

RA 304N23- Theory of Machines and Mechanisms

Unit I: Introduction, kinematics and kinetics, mechanisms and machines, degree of freedom, types of motions, kinematic concept of links, basic terminology and definitions, joints and kinematic chains, inversions, absolute and relative motions, different mechanisms and applications,

Unit II: kinematic synthesis of linkages, dynamic motion analysis of mechanisms and machines, number synthesis, displacement, velocity and acceleration diagrams kinematic and dynamic quantities and their relationships, analytical method and graphical method

Unit III: Cams, introduction, classifications of cams and followers, nomenclature, analysis of cam and follower motion, pressure angle, radius and undercutting, motion constrains and program, critical path motion, torque on cam shaft

Unit IV: Power transmission, kinematics of belt- pulley, flat and v –belt, rope, condition of maximum power transmission, efficiency, friction, friction devices, pivot and collars, power screw, friction circle, friction axis,

Unit V: Gears, laws of gearing, classification and basic terminology, tooth profiles, kinematic considerations, types of gears, spur, bevel, worm, helical, hypoid etc, gear trains, epicyclic, compound, balancing- static and dynamic, in same/ different planes, Introduction to vibration, single degree of freedom.

BOOKS:

1. R.L.Norton, kinematics& dynamics of machinery, Tata McGraw Hill, ISBN13 978 0 07

   014480 4

2. A.Ghosh & A.Malik, Theory of Mechanisms and Machines, EWP Pvt Ltd, ISB 81 85095 72 8

   
   

   Tutorials:

   1. Displacement diagrams of slider crank and other linkages, analytical and graphical

   2. Velocity diagrams and acceleration diagrams

   3. Diagrams of cam and followers for different applications

   4. Gears and gear trains transmission diagrams, analytical and graphical applications

   5. Solutions to problems of industrial application using software

Syllabus

UNIT I: Semiconductor Devices

Theory of P-N junction: Temperature dependence, breakdown characteristics, and junction capacitances. Diodes: Zener diode, varactor diode, PIN diode, LED, and photodiode. Transistors: BJT, FET, and MOSFET - types, working principles, characteristics, regions of operation, load line biasing method. Transistor as an amplifier: Gain, bandwidth, frequency response, h-parameters equivalent, types of amplifiers

UNIT II: Feedback Amplifiers and Oscillators

Feedback amplifier: Negative feedback, voltage-series, voltage-shunt, current-series, and current- shunt feedback. Sinusoidal oscillators: L-C (Hartley-Colpitts) oscillators, RC phase-shift, Wien bridge, and crystal oscillators. Power amplifiers: Class A, class B, class AB, class C amplifiers - efficiency and power dissipation

UNIT III: Operational Amplifiers and Applications

Operational amplifier characteristics: Slew rate, full power bandwidth, offset voltage, bias current. Amplifier configurations: Inverting amplifier, non-inverting amplifier, summing amplifier, differentiator, integrator. Differential amplifier: Calculation of differential and common-mode gain, CMRR. Darlington pair, log and antilog amplifier, voltage-to-current and current-to-voltage converters, comparators, Schmitt trigger, active filters

UNIT IV: Integrated Circuits and Sensors

555 timer and its applications. Multivibrators: Bistable, monostable, and astable multivibrators. ICs and sensors: Study of different sensors such as temperature (LM35), infrared sensors, motor drive (L293D), Humidity and Temperature Sensor (DHT22), 3-Axis Magnetometer (LIS3MDL), Light Sensor (BH1750), Temperature and Humidity Sensor (SHT31)

UNIT V: Power Supplies and Regulators

Regulated power supplies: Series and shunt regulators, current limiting circuits. Introduction to IC voltage regulators: Fixed and adjustable regulators. Switching regulators: SMPS, UPS

References: -

1. Milliman Hallkias - Integrated Electronics; TMH Pub.

2. Gayakwad; OP-amp and linear Integrated Circuits; Pearson Education

3. Electronics Device and circuits By S Salivahanan and N Suresh Kumar ; McGraw Hill Publication; Second Edition

4. Electronic Devices and Circuits, 2ed by Anil Maini Wiley Publication

5. Electronics Device and Circuits By Jacob Milman, Christos C. Halkias, Chetan D. Parikh; Tata Macgraw Hill Publication

6. Basic Electronics devices and Circuits By Mahesh B Patil ; PHI Learning PVT. Ltd.

7. Electronic Devices & Circuit Theory By Boylestad ; PHI

8. Salivahanan; Linear Integrated Circuits; TMH-

9. Miliman Grabel; Micro electronics , TMH

10. RobertBoylestad & Nashetsky; Electronics Devices and circuit Theory; Pearson Ed.

List of Experiments:

1. Diode and Transistor characteristics

2. Transistor Applications (Amplifier and switching)

3. OP-Amp and its Applications

4. 555 timer and its Applications

   
   

   
   

   Proposed list of Experiments:

   
   

   • PCB making process and soldering and desoldering, Creating circuits on zero PCB.

   • Simple Transistor based circuits.

     
     

   • Interfacing of various sensors like Infrared Sensor, Ultrasonic Sensor, Temperature Sensor, Humidity Sensor, moisture sensors, etc.

   • Interfacing different types of motors like, DC Motor, Stepper Motor, Servo Motor with Arduino. Different types of Motor Driving ICs, L293D, ULN2003, etc.

.

New Scheme Based On AICTE Flexible Curricula Robotics and Artificial Intelligence, III Semester

Branch- Common to All Discipline

OBJECTIVES: The objective of this course is to fulfill the needs of engineers to understand applications of Numerical Analysis, Transform Calculus and Statistical techniques in order to acquire mathematical knowledge and to solving wide range of practical problems appearing in different sections of science and engineering. More precisely, the objectives are:

• To introduce effective mathematical tools for the Numerical Solutions algebraic and transcendental equations.

• To enable young technocrats to acquire mathematical knowledge to understand Laplace transformation, Inverse Laplace transformation and Fourier Transform which are used in various branches of engineering.

• To acquaint the student with mathematical tools available in Statistics needed in various field of science and engineering.

Unit I: Numerical Methods: Solution of polynomial and transcendental equations

– Bisection method, Newton-Raphson method and Regula-Falsi method. Finite differences, Relation between operators, Interpolation using Newton’s forward and backward difference formulae. Interpolation with unequal intervals: Newton’s divided difference and Lagrange’s formulae.

Unit II: Numerical Methods: Numerical Differentiation, Numerical integration: Trapezoidal rule and Simpson’s 1/3rd and 3/8 rules. Solution of Simultaneous Linear Algebraic Equations by Gauss’s Elimination, Gauss’s Jordan, Crout’s methods, Jacobi’s, Gauss-Seidal, and Relaxation method.,

Unit III: Numerical Methods: Ordinary differential equations: Taylor’s series, Euler and modified Euler’s methods. RungeKutta method of fourth order for solving first and second order equations. Milne’s and Adam’s predicator-corrector methods. Partial differential equations: Finite difference solution two dimensional Laplace equation and Poission equation, Implicit and explicit methods for one dimensional heat equation (Bender-Schmidt and Crank-Nicholson methods), Finite difference explicit method for wave equation.

Unit IV: Transform Calculus: Laplace Transform, Properties of Laplace Transform, Laplace transform of periodic functions. Finding inverse Laplace transform by different methods, convolution theorem. Evaluation of integrals by Laplace transform, solving ODEs by Laplace Transform method, Fourier transforms.

Unit V: Concept of Probability: Probability Mass function, Probability Density Function, Discrete Distribution: Binomial, Poisson’s, Continuous Distribution: Normal Distribution, Exponential Distribution.

1. P. Kandasamy, K. Thilagavathy, K. Gunavathi, Numerical Methods, S. Chand & Company, 2ndEdition, Reprint 2012.

2. S.S. Sastry, Introductory methods of numerical analysis, PHI, 4th Edition, 2005.

3. Erwin kreyszig, Advanced Engineering Mathematics, 9th Edition, John Wiley & Sons, 2006.

4. B.S. Grewal, Higher Engineering Mathematics, Khanna Publishers, 35th Edition, 2010.

5. N.P. Bali and Manish Goyal, A text book of Engineering Mathematics, Laxmi Publications, Reprint,2010.

6. Veerarajan T., Engineering Mathematics, Tata McGraw-Hill, New Delhi, 2008.

7. P. G. Hoel, S. C. Port and C. J. Stone, Introduction to Probability Theory, Universal Book Stall, 2003(Reprint).

8. S. Ross, A First Course in Probability, 6th Ed., Pearson Education India, 2002.

9. W. Feller, An Introduction to Probability Theory and its Applications, Vol. 1, 3rd Ed., Wiley, 1968.Statistics

   
   

   RA302- Strength of Materials

   
   

   Course Objectives:

   To familiarize the students with the fundamentals of deformation, stresses, strains in structural elements.

   Course Outcomes: At the completion of this course, students should be able to

   1. Know the concepts of stress and strain.

   2. Understand the importance of elastic constants in design of any engineering components

   3. Analyze the beam of different cross sections for shear force, bending moment, slope anddeflection.

   4. Understand the concepts necessary to design the structural elements and pressure vessels.

   5. Apply different theories of failures in designing of structural or machine components

UNIT-I: Simple Stress and Strain

Concept of Elastic body, stress and Strain, stress strain diagram, Hooke’s law, Various types of stress and strains, Elastic constants, Stresses in compound bars, composite and tapering bars, Temperature stresses. strain energy under axial loads and stresses due to impact of falling weights.

Two dimensional and three-dimensional stress system. Normal and tangential stresses, Principal Planes, Principal Stresses and Strains, Mohr’s circle of stresses.

UNIT-II: Bending and Shearing Stresses

Bending: Theory of simple bending, Concept of pure bending and bending stress, Equation of bending, Neutral axis, Section-Modulus, Determination of bending stresses in simply supported, Cantilever and Overhanging beams subjected to point load and uniformly distributed loading, Bending stress distribution across a section of beam, strain energy in bending.

Shearing Stress: Shearing Stress in a beam and shear stress distribution across a section in Beams.

UNIT III: Slopes and Deflection

Differential equation of the elastic curve, Determination of Slope and Deflection of beams by Double Integration Method, Area Moment Method,

UNIT IV: Torsion of Shafts and Theories of Failure

Concept of pure torsion, Torsion equation, Determination of shear stress and angle of twist of shafts of circular section, Torsion of solid and hollow circular shafts, Analyses of problems based on combined Bending and Torsion, Theories of Failure

Columns & struts: Theory of columns, Slenderness ratio, Direct and bending stresses in short columns, Stability of structures, Euler’s formula for columns with different end conditions, Rankine’sformula, Eccentric loads and the Secant formula, Imperfections in columns

EVALUATION

Evaluation will be continuous an integral part of the class as well through external assessment.

References:

1. Beer FP, Johnson Mechanics of Materials ,Sixth Edition ;Mc Graw Hills

2. Debabrata Nag & Abhijet Chanda :Strength of Materials : Wiley

3. Rajput R.K.; Strength of Materials, S.Chand Publications,New Delhi

4. Rattan; Strength of materials;Second Edition , Mc Graw Hills

5. Nash William; Schaum’s Outline Series; forth Edition Strength of Materials;Mc Graw Hills

6. Singh Arbind K; Mechanics of Solids; PHI

7. Khurmi R.S.; Strength of Materials. S.Chand

8. Sadhu Singh; Strength of Materials; Khanna Pub.

9. R Subramannian , Strength of materials OXFORD University Press ,Third Edition .

10. S Ramamurthum , Strength of materials , Dhanpat Rai

RA 303N23- Data Structures

Course Objectives:

1. To understand basic data structures, their implementation and some of their standard applications.

2. To assess how the choice of data structures and algorithm design methods impacts the performance of programs.

3. To develop skills to apply appropriate data structures in problem solving.

   
   

   Expected Course Outcome:

   
   

   1. Clear knowledge about problem solving skills in DS & Algorithms concepts Syllabus:

      UNIT I: Introduction to Data Structure: Concepts of Data and Information, Classification of Data structures, Abstract Data Types, Implementation aspects: Memory representation. Data Structures operations and its cost estimation.

      Introduction to Linear Data Structures- Arrays, Linked List: Representation of Linked List in memory, different implementations of Linked List i.e. Static(Array) Implementation and Dynamic Implementation, Circular Linked List, Doubly Linked List, etc. Application of Linked List: Polynomial Manipulation using Linked List, etc.

      
      

      UNIT II: Stacks: Stacks as ADT, Different implementation of Stack, multiple stacks. Application of Stack: Conversion of Infix to Postfix notation using Stack, evaluation of Postfix Expression, Recursion. Queues: Queues as ADT, Different implementation of Queue, Circular Queue, Concept of Deque ( Double Ended Queue) and Priority Queue, Queue simulation, Application of Queues.

      
      

      UNIT III: Tree: Definitions - Height, Depth, Order, Degree etc. Binary Search Tree - Operations, Traversal, Search. AVL Tree, Heap, Applications and Comparison of various types of Trees ; Introduction to Forest, Multi-Way Tree, B tree, B+ tree, B* Tree and Red-Black Tree.

      
      

      UNIT IV: Graphs: Introduction, Classification of Graph: Directed and Undirected Graphs, etc, Representation, Graph Traversal: Depth First Search (DFS), Breadth First Search (BFS), Graph algorithm: Minimum Spanning Tree (MST)- Kruskal, Prim’s algorithms. Dijkstra’s Shortest Path Algorithm; Comparison between different Graph Algorithms. Application of Graphs.

      UNIT V: Sorting: Introduction, Sort methods like: Bubble Sort, Quick Sort, Selection Sort, Heap Sort, Insertion Sort, Shell Sort, Merge Sort and Radix Sort; comparison of various Sorting Techniques.

      Searching:Basic Search Techniques: Sequential Search, Binary Search, Comparison of Search methods. Hashing & Indexing. Case Study: Application of various data structures in Operating System, DBMS etc.

      EVALUATION: Evaluation will be continuous an integral part of the class as well through external assessment.

      
      

      Text Books

      1. AM Tanenbaum, Y Langsam& MJ Augustein, “Data structure using C and C++”, Prentice Hall India.

      2. Robert Kruse, Bruse Leung, “Data structures & Program Design in C”, Pearson Education.

Reference Books

1. Aho, Hopcroft, Ullman, “Data Structures and Algorithms”, Pearson Education.

2. N. Wirth, “Algorithms + Data Structure = Programs”, Prentice Hall.

3. Jean – Paul Trembly , Paul Sorenson, “An Introduction to Structure with application”, TMH.

4. Richard, Gilberg Behrouz, Forouzan ,“Data structure – A Pseudocode Approach with C”, Thomson press.

5. Data Structures using C & C++, As per AICTE by Rajesh Shukla Wiley publication

Suggested List of Experiments:

1. Write a program that uses functions to perform the following operations on Singly Linked List

   1. Creation ii) Insertion iii) Deletion iv) Traversal.

2. Write a program that uses functions to perform the following operations on Doubly Linked List

   1. Creation ii) Insertion iii) Deletion iv) Traversal.

3. Write a program that uses functions to perform the following operations on Circular Linked List

   1. Creation ii) Insertion iii) Deletion iv) Traversal.

4. Write a program that implement Stack & its operations using

   1. Arrays (Static Implementation) ii) Linked List (Dynamic Implementation).

5. Write a program that implement Queue & its operations using

   1. Arrays (Static Implementation) ii) Linked List (Dynamic Implementation).

6. Write a program that implements Circular Queue using Arrays.

7. Write a program that uses both recursive and non recursive functions to perform the following searching operations for a Key value in a given list of integers:

   1. Linear search ii) Binary Search.

8. Write a program that implements the following sorting methods

   1. Bubble Sort ii) Selection Sort iii) Quick Sort.

9. Write a program that implements the following sorting methods

   1. Insertion Sort ii) Merge Sort iii) Heap Sort.

10. Write a program to implement all the functions of a dictionary (ADT) using Linked List.

11. Write a program to perform the following operations:

    1. Insert an element into a Binary Search Tree.

    2. Delete an element from a Binary Search Tree.

    3. Search for a key element in a Binary Search Tree.

12. Write a program to implement the Tree Traversal Methods

13. Write a program to perform the following operations:

    1. Insert an element into AVL tree.

    2. Delete an element from AVL tree.

    3. Search for a key element in AVL tree.

RAJIV GANDHI PROUDYOGIKI VISHWAVIDYALAYA, BHOPAL

New Scheme Based On AICTE Flexible Curricula Robotics and Artificial Intelligence, III-Semester

RA 304N23- Theory of Machines and Mechanisms

Unit I: Introduction, kinematics and kinetics, mechanisms and machines, degree of freedom, types of motions, kinematic concept of links, basic terminology and definitions, joints and kinematic chains, inversions, absolute and relative motions, different mechanisms and applications,

Unit II: kinematic synthesis of linkages, dynamic motion analysis of mechanisms and machines, number synthesis, displacement, velocity and acceleration diagrams kinematic and dynamic quantities and their relationships, analytical method and graphical method

Unit III: Cams, introduction, classifications of cams and followers, nomenclature, analysis of cam and follower motion, pressure angle, radius and undercutting, motion constrains and program, critical path motion, torque on cam shaft

Unit IV: Power transmission, kinematics of belt- pulley, flat and v –belt, rope, condition of maximum power transmission, efficiency, friction, friction devices, pivot and collars, power screw, friction circle, friction axis,

Unit V: Gears, laws of gearing, classification and basic terminology, tooth profiles, kinematic considerations, types of gears, spur, bevel, worm, helical, hypoid etc, gear trains, epicyclic, compound, balancing- static and dynamic, in same/ different planes, Introduction to vibration, single degree of freedom.

BOOKS:

1. R.L.Norton, kinematics& dynamics of machinery, Tata McGraw Hill, ISBN13 978 0 07

   014480 4

2. A.Ghosh & A.Malik, Theory of Mechanisms and Machines, EWP Pvt Ltd, ISB 81 85095 72 8

   
   

   Tutorials:

   1. Displacement diagrams of slider crank and other linkages, analytical and graphical

   2. Velocity diagrams and acceleration diagrams

   3. Diagrams of cam and followers for different applications

   4. Gears and gear trains transmission diagrams, analytical and graphical applications

   5. Solutions to problems of industrial application using software

Syllabus

UNIT I: Semiconductor Devices

Theory of P-N junction: Temperature dependence, breakdown characteristics, and junction capacitances. Diodes: Zener diode, varactor diode, PIN diode, LED, and photodiode. Transistors: BJT, FET, and MOSFET - types, working principles, characteristics, regions of operation, load line biasing method. Transistor as an amplifier: Gain, bandwidth, frequency response, h-parameters equivalent, types of amplifiers

UNIT II: Feedback Amplifiers and Oscillators

Feedback amplifier: Negative feedback, voltage-series, voltage-shunt, current-series, and current- shunt feedback. Sinusoidal oscillators: L-C (Hartley-Colpitts) oscillators, RC phase-shift, Wien bridge, and crystal oscillators. Power amplifiers: Class A, class B, class AB, class C amplifiers - efficiency and power dissipation

UNIT III: Operational Amplifiers and Applications

Operational amplifier characteristics: Slew rate, full power bandwidth, offset voltage, bias current. Amplifier configurations: Inverting amplifier, non-inverting amplifier, summing amplifier, differentiator, integrator. Differential amplifier: Calculation of differential and common-mode gain, CMRR. Darlington pair, log and antilog amplifier, voltage-to-current and current-to-voltage converters, comparators, Schmitt trigger, active filters

UNIT IV: Integrated Circuits and Sensors

555 timer and its applications. Multivibrators: Bistable, monostable, and astable multivibrators. ICs and sensors: Study of different sensors such as temperature (LM35), infrared sensors, motor drive (L293D), Humidity and Temperature Sensor (DHT22), 3-Axis Magnetometer (LIS3MDL), Light Sensor (BH1750), Temperature and Humidity Sensor (SHT31)

UNIT V: Power Supplies and Regulators

Regulated power supplies: Series and shunt regulators, current limiting circuits. Introduction to IC voltage regulators: Fixed and adjustable regulators. Switching regulators: SMPS, UPS

References: -

1. Milliman Hallkias - Integrated Electronics; TMH Pub.

2. Gayakwad; OP-amp and linear Integrated Circuits; Pearson Education

3. Electronics Device and circuits By S Salivahanan and N Suresh Kumar ; McGraw Hill Publication; Second Edition

4. Electronic Devices and Circuits, 2ed by Anil Maini Wiley Publication

5. Electronics Device and Circuits By Jacob Milman, Christos C. Halkias, Chetan D. Parikh; Tata Macgraw Hill Publication

6. Basic Electronics devices and Circuits By Mahesh B Patil ; PHI Learning PVT. Ltd.

7. Electronic Devices & Circuit Theory By Boylestad ; PHI

8. Salivahanan; Linear Integrated Circuits; TMH-

9. Miliman Grabel; Micro electronics , TMH

10. RobertBoylestad & Nashetsky; Electronics Devices and circuit Theory; Pearson Ed.

List of Experiments:

1. Diode and Transistor characteristics

2. Transistor Applications (Amplifier and switching)

3. OP-Amp and its Applications

4. 555 timer and its Applications

   
   

   
   

   Proposed list of Experiments:

   
   

   • PCB making process and soldering and desoldering, Creating circuits on zero PCB.

   • Simple Transistor based circuits.

     
     

   • Interfacing of various sensors like Infrared Sensor, Ultrasonic Sensor, Temperature Sensor, Humidity Sensor, moisture sensors, etc.

   • Interfacing different types of motors like, DC Motor, Stepper Motor, Servo Motor with Arduino. Different types of Motor Driving ICs, L293D, ULN2003, etc.

.