Academic Year: 2017-2018 III B.Tech I Sem
(HS105) ENGINEERING ETHICS
COURSE OBJECTIVES:
1) Instill the moral values that ought to guide their profession.
2) Resolve the moral issues in the profession.
3) Infer moral judgment concerning the profession.
4) Correlate the concepts in addressing the ethical dilemmas.
5) Judge a global issue by presenting an optimum solution.
COURSE OUTCOMES:
1) Distinguish between ethical and non ethical situations.
2) Practice moral judgment in conditions of dilemma.
3) Relate the code of ethics to social experimentation.
4) Develop concepts based on moral issues and enquiry.
5) Resolve moral responsibilities in complications.
6) Defend one’s views in supporting the moral concerns.
7) Apply risk and safety measures in various engineering fields.
8) Develop cognitive skills in solving social problems.
Unit wise Learning Objectives:
UNIT- I
1. To analyze the difference between ethics and moral values
2. To understand the difference between personal and professional ethics
3. To understand the need for ethics in a work place
4. To gain knowledge on different codes of ethics
5. To learn various ethical aspects with respect to society like civic virtue, honesty, etc.
UNIT-II
1. To understand the advantages and disadvantages of consequentialism
2. To know in detail about Kantianism
3. To gain knowledge on duty ethics
4. To analyze the difference between western and eastern theories
5. To differentiate kohlbergs and Gilligans theory
Academic Year: 2017-2018 III B.Tech I Sem
UNIT-III
1. To analyze the do`s and donts of electrical safety
2. To understand the need for fire safety
3. To analyze the importance of road safety
4. To know why rail and aerospace safety is important
5. To understand the need for risk benefit analysis with a case study
UNIT-IV
1. To understand the concepts of collective bargaining and conflict of interest
2. To analyze the eight cardinal rules of plagiarism
3. To understand the importance of IPR
4. To analyze the need for obtaining patents, trademarks etc.
5. To understand the concept of ethics with respect to education
UNIT-V
1. To analyze the need for computer ethics
2. To understand the ten commandments of computer ethics
3. To understand the role of business ethics in multinational corporations
4. To know why ethics is important in weapons development.
5. To analyze ethics by considering various case studies
Academic Year: 2017-2018 III B.Tech I Sem
LESSON PLAN
Course Number : HS105 Course Name : EE
Program : UG Branch : CSE
Year / Semester : III/I Section : A
S.No Topic Proposed
Date
Actual
Date
UNIT – I
1 Scope for ethics in Engineering: Human values 12/06/2017
2 Morals and Ethics, Integrity, Work ethic 13/06/2017
3 Service learning, Civic Virtue, Honesty, Courage 19/06/2017
4 Valuing time, Cooperation and Commitment 20/06/2017
5 Empathy, Self confidence, Engineers as responsible
experimenters
26/06/2017
6 The code of ethics for engineers-NSPE guidelines 27/06/2017
Content beyond the syllabus
NA
UNIT – II
7 Ethical theories-philosophical point of view 03/07/2017
8 Western theories: Utilitarian 04/07/2017
9 Western theories: Deontology 10/07/2017
10 Western theories: Virtue theory 11/07/2017
11 Moral dilemmas: Kohlberg`s theory, Gilligan`s theory 17/07/2017
12 Indian system of Moral values: customs and religion-
consensus and controversy
18/07/2017
13 Engineers, Managers and Heads and their role in Ethics 24/07/2017
Content Beyond the Syllabus
NA
Academic Year: 2017-2018 III B.Tech I Sem
UNIT – III
14 Safety: Responsibility as an engineer 25/07/2017
15 Safety and Risk, Risk/Benefit analysis and reducing risk 07/08/2017
16 Road and Rail safety 08/08/2017
17 Fire safety 14/08/2017
18 Electrical and Industrial safety 15/08/2017
Content Beyond the Syllabus
NA
UNIT – IV
19 Engineering ethics and global issues 21/08/2017
20 Confidentiality, Conflicts of interest 22/08/2017
21 Professional rights, Plagiarism 28/08/2017
22 Intellectual Property rights(IPR), discrimination 29/08/2017
Content Beyond the Syllabus
NA
UNIT – V
23 Multinational Corporations – Business Ethics 04/09/2017
24 Environmental ethics, Computer ethics 05/09/2017
25 Ethics related to weapon development 11/09/2017
26 Role of Engineer as Manager – 12/09/2017
27 Expert Witnesses and Advisors - Case Studies . 12/09/2017
Content Beyond the Syllabus
NA
TEXT BOOKS:
1. Mike Martin and Roland Schinzinger, “Ethics in Engineering”, McGraw Hill, New
York,2005.(Reprinted-2013.
2. Ibo Van de Poel and Lamber Royakkers “Ethics, Technology, and Engineering - An
Introduction”, John wiley publication, 2011.
Academic Year: 2017-2018 III B.Tech I Sem
REFERENCE BOOKS:
1. Edumund G.Seebauer and Robert L. Barry, “Fundamental of Ethics for Scientists and
Engineers”, Oxford University Press, 2014.
Caraline whitbeck, “Ethics in Engineering practice and Research”, Cambridge university
press, 2012.
Academic Year: 2017-2018 III B.Tech I Sem
(ES113) MECHATRONICS
LESSON PLAN
Name of the Faculty : Ch.Rajendra Prasad Academic Year: 2017 - 2018
Course Code : ES113 Course Name : MECHATRONICS
Program : B.Tech Branch : CSE
Year/Semester : III / I Section : A
S. No. Topic
Scheduled
Date
DD/MM/YY
YY
Actual date
UNIT- I
INTRODUCTION
1 Introduction to Mechatronics 13/06/2017
2 Key elements of Mechatronics 14/06/2017
3 Microprocessor fundamentals 15/06/2017
4 Microcontroller fundamentals 16/06/2017
5 Comparison of microprocessors and microcontrollers 17/06/2017
6 Introduction to Arduino board 20/06/2017
7 ATmega2560 Microcontroller 21/06/2017
8 Pin map of arduino board 22/06/2017
9 Procedural programming 23/06/2017
10 Embedded programming 24/06/2017
11 Embedded programming 28/06/2017
12 Simple programs on Bit manipulation 29/06/2017
13 Simple programs on Bit manipulation 30/06/2017
UNIT- II
SENSORS
14 Introduction, Classification of sensors 01/07/2017
15 Static characteristics of sensors 04/07/2017
16 Dynamic characteristics 05/07/2017
17 Selection of Sensors 06/07/2017
18 Displacement sensor 07/07/2017 19 Displacement sensor 11/07/2017
20 Displacement sensor 12/07/2017
Academic Year: 2017-2018 III B.Tech I Sem
21 Force sensor, Strain Gauge sensor 13/07/2017
22 Temperature sensor 14/07/2017
23 Temperature sensor 15/07/2017
24 Photo Sensors 18/07/2017
25 Photo Sensors 19/07/2017
26 Digital Sensors : Proximity sensor 20/07/2017
27 Proximity sensor 21/07/2017
28 Applications of Sensors 22/07/2017
UNIT- III
ACTUATORS
29 Mechanical Drives – Introduction 25/07/2017
30 Gears 26/07/2017
31 Belts 27/07/2017
32 Chain Drives 28/07/2017
33 Bearings 29/07/2017
34 Electrical Actuation systems – Introduction 01/08/2017
35 Relays 02/08/2017
36 Solid State Switches – Diodes 03/08/2017
37 Transistors 04/08/2017
38 MOSFET 05/08/2017
I- Internal Examination
08th
to 10th
August, 2017
39 Thyristors and Triacs 11/08/2017
40 Solenoids 16/08/2017
41 Fundamentals of DC Motors 17/08/2017
42 Fundamentals of AC Motors 18/08/2017
43 Fundamentals of Stepper Motor 19/08/2017
UNIT- IV
SIGNAL PROCESSING AND CONDITIONING
44 Introduction to Signal Processing and conditioning 22/08/2017
45 Rectifiers
23/08/2017
46 Filters, Regulators 24/08/2017
47 Introduction to Operational Amplifier (OP Amp) 26/08/2017
48 Amplifying signals using Operational Amplifier 29/08/2017
Academic Year: 2017-2018 III B.Tech I Sem
Time Table:
Monday : Thursday : 1:40 to 2:30 PM
Tuesday : 11:20 to 12:10 PM Friday : 11:20 to 12:10 PM
Wednesday : 10:20 to11:10AM Saturday : 9:30 to 10:20 AM
49 Fundamentals of ADC 30/08/2017
50 Fundamentals of DAC 31/08/2017
51 Comparator 01/09/2017
UNIT- V
POWER AND SPEED CONTROL
52 Working of SCR 05/09/2017
53 Power Control of DC Motor using SCR 06/09/2017
54 Power Control of AC Motor using SCR 07/09/2017
55 Power Control of AC Motor using Triac 08/09/2017
56 Fundamentals of Pulse Width Modulation Technique 12/09/2017
57 Speed Control of DC Motor using PWM technique 13/09/2017
58 Speed Control of DC Motor using PWM technique 14/09/2017
59 Stepper Motor control 15/09/2017
60 Excitation Stepper Motor control 16/09/2017
Revision 19/09/2017 to
11/10/2017
II- Internal Examination
12th
to 16th
October,
2017
Academic Year: 2017-2018 III B.Tech I Sem
COURSE PLAN
B.TECH (Computer Science and Engineering)
Year: III Semester: I
Course Title: Design and Analysis of Algorithms Course Code: CS 112
Total Contact Hours: 3+1 Duration of ESE: 3 Hours
Marks in ESE: 70 Marks in CIE: 30
Lesson Plan Author: Dr. C. V. Guru Rao Date: 12-06-2017
Checked By: Dr. C. V. Guru Rao Date: 12-06-2017
Course Objectives (COBs):
Upon completion of this course, students will be able to do the following:
COB .No. Course Objectives
COB112.1 Analyze the asymptotic performance of algorithms.
COB112.2 Write rigorous correctness proofs for algorithms.
COB112.3 Demonstrate a familiarity with major algorithms and data structures.
COB112.4 Apply important algorithmic design paradigms and methods of analysis.
COB112.5 Synthesize efficient algorithms in common engineering design situations.
COB112.6
Describe and use major algorithmic techniques (divide-and-conquer, greedy,
dynamic programming, backtracking, branch-and-bound paradigm) and cite
problems for which each technique is suitable.
COB112.7 Understand the difference between the lower and upper bounds of various
problems and their importance in deciding the optimality of an algorithm.
Course Outcomes (COs):
Students who complete the course will have demonstrated the ability to do the following:
CO.No. Course Outcome
CO112.1 Argue the correctness of algorithms using inductive proofs and invariants.
CO112.2 Evaluate and compare different algorithms using worst-, average-, and
best-case Analysis.
CO112.3 Describe the divide-and-conquer paradigm and explain when an algorithmic
design situation calls for it. Recite algorithms that employ this paradigm.
Synthesize divide-and-conquer algorithms. Derive and solve recurrences
describing the performance of divide-and-conquer algorithms.
CO112.4 Describe the greedy paradigm and explain when an algorithmic design situation
Academic Year: 2017-2018 III B.Tech I Sem
calls for it. Recite algorithms that employ this paradigm. Synthesize greedy
algorithms, and analyze them.
CO112.5 Describe the dynamic-programming paradigm and explain when an algorithmic
design situation calls for it. Recite algorithms that employ this paradigm.
Synthesize dynamic-programming algorithms, and analyze them.
CO112.6 Describe the backtracking paradigm and explain when an algorithmic design
situation calls for it. Recite algorithms that employ this paradigm. Synthesize
backtracking algorithms, and analyze them.
CO112.7 Describe the branch-and-bound paradigm and explain when an algorithmic design
situation calls for it. Recite algorithms that employ this paradigm. Synthesize
branch-and-bound algorithms, and analyze them.
CO112.8 Analyze worst-case running times of algorithms using asymptotic analysis.
CO112.9 Explain the difference between tractable and intractable problems, and identify
the basic
complexity classes, such as P, NP and NP-complete
Academic Year: 2017-2018 III B.Tech I Sem
Learning Outcomes:
At the end of the topic the student should be able to:
TLO No Topic Learning Outcomes (TLOs) CO's BL PI
Code
TLO112
. 1.1
Fundamentals of Computer Algorithms:
The student understands the fundamentals of computer
algorithms and can categorize unfamiliar problems in
mathematical terms so as to elucidate a given
problem's relation to known problems, choose a
paradigm for solving the problem, and design an
algorithm to solve the problem.
CO112.1 L2 2.1.3
TLO112.
1.2
Analysis:
The student can analyze algorithms belonging to those
algorithmic paradigms for their asymptotic worst-case
behavior in terms of time and space. Further, the
student can analyze algorithms empirically (under
simplifying assumptions) and understands the
relationship of empirical analysis to average-case
behavior.
CO112.2 L4 12.3.2
TLO112.
1.3
Efficiency:
The student can distinguish between efficient and
inefficient solutions and can relate these distinctions to
the complexity classes of problems, namely P, NP,
and NP-Complete.
CO112.8 L5 12.3.2
TLO112.
1.4
Correctness:
The student can prove the correctness of a subset of
the algorithms considered in the course.
CO112.1 L5 12.3.2
TLO112.
1.5
Implementation:
The student can independently implement selected
algorithms in the context of motivating applications
using appropriate programming language in the
amicable environment.
CO112.9 L6 13.1.1
UNIT-I
Lesson Schedule
Lecture No. Portion covered per hour Date
L112.1.1 Introduction to Algorithms and its importance 12-06-2017
L112.1.2 Fundamentals of the analysis of algorithm efficiency 13-06-2017
(CS 112 ) DESIGN AND ANALYSIS OF ALGORITHMS
UNIT-WISE PLAN
Academic Year: 2017-2018 III B.Tech I Sem
L112.1.3 Analysis frame work 14-06-2017
L112.1.4 Asymptotic notations – Big Oh Notation 15-06-2017
L112.1.5 DAA (Tutorial) 16-06-2017
L112.1.6 Omega Notation 19-06-2017
L112.1.7 Theta Notation 20-06-2017
L112.1.8 Little Oh Notation 21-06-2017
L112.1.9 sorting algorithms design and analysis: Insertion sort 22-06-2017
L112.1.10 DAA (Tutorial) 23-06-2017
L112.1.11 selection sort 28-06-2017
L112.1.12 Review 29-06-2017
UNIT-WISE PLAN
Course Code and Title: CS 112 / Design and Analysis of Algorithms
Unit Number: II Planned Hours: 10+04
UNIT-II
Lesson Schedule
Lecture No. Portion covered per hour Date
L112.2.1 DAA (Tutorial) 30-06-2017
L112.2.2 Divide and conquer - General method 03-07-2017
L112.2.3 Applications – binary search 04-07-2017
L112.2.4 quick sort 05-07-2017
L112.2.5 merge sort 06-07-2017
L112.2.6 DAA (Tutorial) 07-07-2017
L112.2.7 Strassen’s matrix multiplication 11-07-2017
L112.2.8 Greedy method – General method 12-07-2017
L112.2.9 Applications – job sequencing with deadlines 13-07-2017
L112.2.10 DAA (Tutorial) 14-07-2017
L112.2.11 Knapsack problem 17-07-2017
L112.2.12 Minimum cost spanning trees – Prim’s Algorithm 18-07-2017
L112.2.13 Minimum cost spanning trees – Kruskal’s Algorithm 19-07-2017
L112.2.14 Single source shortest path problem 20-07-2017
L112.2.15 DAA (Tutorial) 21-07-2017
Academic Year: 2017-2018 III B.Tech I Sem
UNIT-WISE PLAN
Learning Outcomes:
At the end of the topic the student should be able to:
TLO No Topic Learning Outcomes (TLOs) CO's BL PI
Code
TLO112
. 3.1
Fundamentals of Computer Algorithms:
The student understands the fundamentals of algorithm
paradigms such as dynamic programming.
CO112.5 L2 2.1.3
TLO112.
3.2
Analysis:
The student can analyze algorithms belonging to those
algorithmic paradigms for their asymptotic worst-case
behavior in terms of time and space. Further, the
student can analyze algorithms empirically (under
simplifying assumptions) and understands the
relationship of empirical analysis to average-case
behavior.
CO112.8 L4 12.3.2
TLO112.
3.3
Efficiency:
The student can distinguish between efficient and
inefficient solutions and can relate these distinctions to
the complexity classes of problems, namely P, NP, and
NP-Complete.
CO112.2 L5 12.3.2
TLO112.
3.4
Correctness:
The student can prove the correctness of a subset of the
algorithms considered in the course.
CO112.1 L5 12.3.2
TLO112.
3.5
Implementation:
The student can independently implement selected
algorithms in the context of motivating applications
using appropriate programming language in the
amicable environment.
CO112.9 L6 13.1.1
Course Code and Title: CS 112 / Design and Analysis of Algorithms
Unit Number: III Planned Hours: 07+03
Academic Year: 2017-2018 III B.Tech I Sem
UNIT-III
Lesson Schedule
Lecture No. Portion covered per hour Date
L112.3.1 Dynamic Programming - General method 24-07-2017
L112.3.2 Applications: Matrix chain multiplication 25-07-2017
L112.3.3 Matrix chain multiplication 26-07-2017
L112.3.4 Matrix chain multiplication 27-07-2017
L112.3.5 DAA (Tutorial) 28-07-2017
L112.3.6 Optimal binary search 31-07-2017
L112.3.7 Optimal binary search 01-08-2017
L112.3.8 0/1 knapsack problem 02-08-2017
L112.3.9 0/1 knapsack problem 03-08-2017
L112.3.10 DAA (Tutorial) 04-08-2017
L112.3.11 All pairs shortest path problem 07-08-2017
I Mid Examination From 08-08-2017 to 10-08-2017
L112.3.12 DAA (Tutorial) 11-08-2017
L112.3.13 Traveling sales person problem 16-08-2017
L112.3.14 Reliability design 17-08-2017
L112.3.15 DAA (Tutorial) 18-08-2017
L112.3.16 Review 21-08-2017
Academic Year: 2017-2018 III B.Tech I Sem
UNIT-WISE PLAN
Learning Outcomes:
At the end of the topic the student should be able to:
TLO No Topic Learning Outcomes (TLOs) CO's BL PI
Code TLO112
. 4.1
Fundamentals of Computer Algorithms:
The student understands the fundamentals of algorithm
paradigms such as backtracking.
CO112.5 L2 2.1.3
TLO112.
4.2
Analysis:
The student can analyze algorithms belonging to those
algorithmic paradigms for their asymptotic worst-case
behavior in terms of time and space. Further, the
student can analyze algorithms empirically (under
simplifying assumptions) and understands the
relationship of empirical analysis to average-case
behavior.
CO112.8 L4 12.3.2
TLO112.
4.3
Efficiency:
The student can distinguish between efficient and
inefficient solutions and can relate these distinctions to
the complexity classes of problems, namely P, NP, and
NP-Complete.
CO112.2 L5 12.3.2
TLO112.
4.4
Correctness:
The student can prove the correctness of a subset of the
algorithms considered in the course.
CO112.1 L5 12.3.2
TLO112.
4.5
Implementation:
The student can independently implement selected
algorithms in the context of motivating applications
using appropriate programming language in the
amicable environment.
CO112.9 L6 13.1.1
UNIT-IV
Lesson Schedule
Lecture
No. Portion covered per hour Date
L112.4.1 Backtracking – General method 22-08-2017
L112.4.2 Applications – n-queen problem 23-08-2017
Course Code and Title: CS 112 / Design and Analysis of Algorithms
Unit Number: IV Planned Hours:07+02
Academic Year: 2017-2018 III B.Tech I Sem
L112.4.3 n-queen problem 24-08-2017
L112.4.4 sum of subsets problem 28-08-2017
L112.4.5 sum of subsets problem 29-08-2017
L112.4.6 Graph coloring 30-08-2017
L112.4.7 Hamiltonian cycles 31-08-2017
L112.4.8 DAA (Tutorial) 01-09-2017
L112.4.9 Branch and Bound - General method 04-09-2017
L112.4.1
0 Applications - Travelling salesperson problem 05-09-2017
L112.4.1
1 0/1 knapsack problem - LC Branch and bound solutions 06-09-2017
L112.4.1
2 0/1 knapsack problem - FIFO Branch and bound solutions 07-09-2017
L112.4.1
3 DAA (Tutorial) 08-09-2017
L112.4.1
4 Review 11-09-2017
L112.4.1
5 Review 12-09-2017
Academic Year: 2017-2018 III B.Tech I Sem
UNIT-WISE PLAN
Learning Outcomes:
At the end of the topic the student should be able to:
TLO No Topic Learning Outcomes (TLOs) CO's BL PI
Code TLO112
.5.1
Fundamentals of Computer Algorithms:
The student understands the fundamentals of algorithm
paradigms such as branch and bound, non-deterministic
algorithms.
CO112.5 L2 2.1.3
TLO112.
5.2
Analysis:
The student can analyze algorithms belonging to those
algorithmic paradigms for their asymptotic worst-case
behavior in terms of time and space. Further, the
student can analyze algorithms empirically (under
simplifying assumptions) and understands the
relationship of empirical analysis to average-case
behavior.
CO112.8 L4 12.3.2
TLO112.
5.3
Efficiency:
The student can distinguish between efficient and
inefficient solutions and can relate these distinctions to
the complexity classes of problems, namely P, NP, and
NP-Complete.
CO112.2 L5 12.3.2
TLO112.
5.4
Correctness:
The student can prove the correctness of a subset of the
algorithms considered in the course.
CO112.1 L5 12.3.2
TLO112.
5.5
Implementation:
The student can independently implement selected
algorithms in the context of motivating applications
using appropriate programming language in the
amicable environment.
CO112.9 L6 13.1.1
UNIT-V
Lesson Schedule
Lecture
No. Portion covered per hour Date
L112.
5.1 String matching: Robin – Karp algorithm 13-09-2017
L112. Knuth – Morris Pratt algorithm 14-09-2017
Course Code and Title: CS 112 / Design and Analysis of Algorithms
Unit Number: V Planned Hours: 10+04
Academic Year: 2017-2018 III B.Tech I Sem
5.2
L112.
5.3 DAA (Tutorial) 15-09-2017
L112.
5.4 Algorithm for parallel computers 18-09-2017
L112.
5.5 Parallelism 19-09-2017
L112.
5.6 Parallelism 21-09-2017
L112.
5.7 DAA (Tutorial) 22-09-2017
L112.
5.8 The PRAM models 25-09-2017
L112.
5.9 The PRAM models 26-09-2017
L112.
5.10 Simple PRAM algorithms 27-09-2017
L112.
5.11 P and NP Class 02-10-2017
L112.
5.12 P and NP Class 03-10-2017
L112.
5.13 Some NP – complete problems. 04-10-2017
L112.
5.14 Some NP – complete problems. 05-10-2017
L112.
5.15 DAA (Tutorial) 06-10-2017
L112.
5.16 Review 09-10-2017
L112.
5.17 Review 10-10-2017
L112.
5.18 Review 11-10-2017
II Mid Examination From 12-10-2017 to 16-10-2017
Academic Year: 2017-2018 III B.Tech I Sem
(HS104) ECONOMICS AND FINANCE FOR ENGINEERS
(Common to all branches)
COURSE DESCRIPTION:
The course is designed to provide students with fundamental principles of Economics. Students
are engaged in the study of basic concepts of demand analysis and forecasting, elasticity of
demand their applications. This course also helps students to develop the skills to analyze break-
even point and to understand its applications in business. This course include Financial
Accounting modules which enables the students to prepare financial statements and to interpret
them using ratio analysis. The course structure is designed to enable the students to select a
project by the application of capital budgeting techniques.
COURSE OBJECTIVES
1. Explain importance of Economics and its application into business practice.
2. Develop least cost combination of inputs in production
3. Formulate suitable pricing policy pricing method
4. Apply the concepts of Accounting in calculating the profits of business
5. Identify relevant Capital budgeting techniques and appraise the projects
COURSE OUTCOMES
1. Forecast the demand for product / service for a profitable Business administration.
2. Apply the demand forecasting techniques to estimate the demand
3. Minimize the cost incurred in Production and estimate the profit zone.
4. Recognize the time value in cash flows
5. Evaluate various investment opportunities and select best project
6. Develop least cost combination of inputs in production
7. Analyze Capital Budgeting techniques.
8. Build Financial Reports and evaluate financial status of the organization.
Note: Present value tables need to be permitted into the examination hall.
UNIT–I
Introduction to Economics: Definition, Nature and Scope – Demand Determinants, Law of
Demand and its exceptions - Elasticity of Demand: Definition, Types, Measurement and
Significance, Demand forecasting: factors and methods
Academic Year: 2017-2018 III B.Tech I Sem
UNIT–II
Theory of Production and Cost Analysis: Production Function - Least Cost Combination of
Inputs. Break-Even Analysis (BEA) - Cost Concepts - Determination of Break-Even Point
(Simple problems)
UNIT–III
Introduction to Markets and Pricing: Types of Market - Price-Output Determination in case of
Perfect Competition, Monopoly and monopolistic – Pricing objectives and Methods
UNIT–IV
Financial Accounting and analysis: Double-Entry Book Keeping, Journal, Ledger, and Trial
Balance – Final Accounts (Trading, Profit & Loss Account and Balance Sheet) with simple
adjustments). Financial Analysis: Liquidity, Activity, Capital structure and Profitability ratios
UNIT–V
Capital Budgeting: Time Value of Money – Simple and Compound techniques. Nature and scope
of Capital Budgeting, Payback Method, Accounting Rate of Return (ARR), Net Present Value
and IRR Methods (simple problems).
TEXT BOOKS:
1. EWilliam G. Sullivan , “Engineering Economy”, Pearson.
2. V.S. Bagad, “Managerial Economics and Financial Analysis”, Technical Publications, Pune.
3.A.R.Aryasri “Managerial Economics and Financial Analysis”,McGrawHill
REFERENCE BOOKS:
1. Sasmita Mishra , “Engineering Economics & Costing” , PHI.
2. M.Kasi Reddy & S.Saraswathi, “Managerial Economics and Financial Accounting”, PHI
Web Links:
1. www.jntu.ac.in
2. www.nptel.ac.in
Academic Year: 2017-2018 III B.Tech I Sem
LECTURE PLAN
Sl.
No
.
Topics in syllabus Modules and Sub modules Lecture
No.
Suggested books
with Page Nos.
UNIT – I Introduction to Economics: (No. of Lectures – 12)
1 Definition, Macro,Micro concepts L1
TB3, 1.3
2 Nature
Macro-economics, Micro
economics, normative,
prescriptive, applied,
interdisciplinary
L2 TB3, 1.7
3 Scope Production, reduction in cost,
pricing, Inventory decisions. L3 TB3,1.8
4 Law of
consumption
Law of marginal, utility and
exceptions, Indifference centre -
properties.
L4 TB3, 2.1-2.5
5 Demand analysis-I Nature of demand
L5
L6
TB3,2.6-2.8
6 Demand analysis-I Law of demand and its
determinants
L7
L8 TB3,2.9-2.16
7
Demand analysis-II
Definition and types of elasticity
of demand. Measurement and
significance of ED
L9
L10 TB3,3.3-3.21
8 Demand analysis-II Demand forecasting- Factors.
Methods of demand forecasting.
L11
L12 TB3,4.1-4.18
UNIT –II Theory of Production and Cost Analysis-Introduction (No. of Lectures – 16)
9
Production function One variable inputs L13 TB3, 5.3-5.6
10 Production function Two and multi variable inputs L14 TB3, 5.6-5.7
11 Isoquants , Isocost Properties, Least cost
combination of input
L15
L16
TB3,5.7-5.14
12 Cobb-douglas
production Laws of returns.
L17
L18 TB3, 5.14-5.16
Academic Year: 2017-2018 III B.Tech I Sem
function.
13 Economies of scale Internal economies of scale.
L19 TB3,5.16-5.17
14 Economies of scale External economies of scale. L20
TB3, 5.17-5.18
15 Cost Analysis Definitions L21
TB3,6.1-6.2
16 Cost Analysis Cost concepts, comparison of
costs
L22
TB3, 6.2-6.9
17 Cost-output relation Long & Short run L23
TB3,6.10-6.16
18 Break-even analysis Break-even analysis and it
limitations
L24
L25 TB3,7.1-7.5
19 Break-even analysis Applications L26 TB3,7.6-7.10
20 Break-even analysis
Impact of changes in selling
price, significance and limitations
of BEP
L27 TB3,7.11-7.14
21 Break-even analysis Determination of BEP L28 TB3,7.14-7.15
UNIT –III Introduction to Markets and Pricing Policies-Introduction (No. of Lectures –
08)
22
Markets meaning,
types,
characteristics
Meaning, types, characteristics L29
TB2, 7.1
23 Perfect Market Characteristics, Price output
determination L30 TB2, 7.2-7.3
24 Monopoly Market
Characteristics, Price output
determination ,Monopolistic
Market its Features,
L31
L32 TB2, 7.4-7.7
25 Pricing objectives Objectives ,Policies, methods
L33
L34
L35
TB2, 7.7-7.9
TB2, 7.11-7.13
TB2, 7.13-7.18
26 Pricing Pricing strategies in Times of
Stiff Price Competition
L36
TB3,7.18-7.21
UNIT – IV Introduction to Financial Accounting (No. of Lectures – 11)
27 Accounting Definition,users,branches L37 TB3,13.3-13.8
28 Accounting Accounting Cycle, Concepts and
Conventions L38 TB3,13.8-13.13
Academic Year: 2017-2018 III B.Tech I Sem
29 Accounting Double Entry Rules,
Journal,Ledger
L39
L40
L41
TB3,13.13-13.21
30 Accounting Trial balance
L42
TB3,13.34-13.36
31 Accounting Capital V/s Revenue Items L43 TB3,13.39-13.40
32 Accounting Financial accounts - problems L44 TB3,13.40-13.47
33 Accounting Financial accounts - problems L45 TB3,13.40-13.47
34 Accounting Ratios- Introduction L46 TB3,14.2-14.18
35 Accounting problems L47 TB3,14.2-14.18
UNIT –V Capital and Capital Budgeting (No. of Lectures – 10)
36 Capital Budgeting Introduction L48 TB3,16.2-16.4
37 Capital Budgeting Types of capital. L49 TB3,16.4-16.6
38 Capital Budgeting Estimation of fixed and working
capital. L50 TB3,16.7-16.10
39 Capital Budgeting Methods and sources of finance. L51 TB3,16.10-16.15
40 Capital Budgeting Nature and scope of capital
budgeting. L52 TB3,17.2-17.4
41 Capital Budgeting Methods of capital budgeting . L53 TB3,17.8-17.10
42 PBP Pay back method - problems. L54 TB3,17.8-17.10
43 ARR Problems L55 TB3,17.10-17.12
44 IRR Problems. L56 TB3,17.17-17.20
45 NPV Problems. L57
TB3,17.21-17.26
Academic Year: 2017-2018 III B.Tech I Sem
(ES114) MECHATRONICS LABORATORY
COURSE OBJECTIVES
1. Study the Arduino and its Importance to Engineering
2. Study applications such as Interfacing RC components, DC and AC motor Control using
Arduino
3. Study and Develop the Load Measurement of Strain Gage, Conveyer belt and
Mechatronic Systerm
4. Construct various circuits using OP Amp
5. Choose various methods of Stepper Motor Control using Arduino
COURSE OUTCOMES
At the end of the course, the student will be able to
1. Demonstrate the importance of Arduino
2. Assess the controlling of Output & Input base circuits using Arduino
3. Develop an RC circuit and Interface with Arduino
4. Interpret the Bidirectional control of DC motor using Arduino
5. Examine the control of DC and AC Motors using Arduino
6. Develop a circuit with Stepper Motor drive using Arduino
7. Build various circuits using OP Amps an Interface with Arduino
8. Construct circuits for Load Measurement, Speed Control using Conveyer belt using
Arduino and build a Mechatronic system
LIST OF EXPERIMENTS:
1. Study of Arduino
2. Controlling output LEDs based on inputs (toggle switches) and light-controlled switch
using arduino.
3. Design and build circuits using RC components interfacing them to arduino.
4. Bi-directional control of DC motor using arduino
5. Speed control of DC motor using arduino
6. Position control of DC motor using PWM technique.
7. Speed control of AC motor using arduino.
8. Control of unipolar, bipolar, and full-step stepper motor drive using arduino
9. Study and calibration of load measurement using strain gauge.
10. Configure and test different types of operational amplifiers and interface with arduino
11. Build a small conveyer belt with adjustable speed control.
12. Design a complete mechatronic system incorporating sensors, signal conditioning,
amplification, actuation and drives.
Academic Year: 2017-2018 III B.Tech I Sem
LESSON PLAN
Name of the Faculty : CH.RAJENDRA PRASAD Academic Year: 2017 - 2018
Course Number : ES114 Course Name : MECHATRONICS LAB
Program : B.Tech Branch : CSE
Year / Semester : III/I Section : A
S.No. Topic Schedule Dates
(Batch-I)
Schedule
Dates
(Batch-II)
1 Introduction to Mechatronics Lab
Study of Arduino 12-06-2017 15-06-2017
2 Controlling output LEDs based on inputs (toggle
switches) and light-controlled switch using Arduino. 19-062017 22-06-2017
3 Design and build circuits using RC components
Interfacing them to Arduino. 03-07-2017 29-06-2017
4 Bi-directional control of DC motor using Arduino 17-07-2017 06-07-2017
5 Speed control of DC motor using Arduino 24-07-2017 13-07-2017
6 Position control of DC motor using PWM technique. 31-07-2017 20-07-2017
7 Speed control of AC motor using Arduino. 07-08-2017 27-07-2017
LAB INTERNAL EXAM-I 21-08-2017 03-08-2017
8 Control of Unipolar, Bipolar, and Full-Step stepper
motor drive using Arduino 28-08-2017 17-08-2017
9 Study and calibration of load measurement using
strain gauge. 04-09-2017 24-08-2017
10
Configure and test different types of Operational
Amplifiers and Interface with Arduino 11-09-2017 31-08-2017
11 Build a small conveyer belt with adjustable speed
control. 18-09-2017 07-09-2017
12 Automatic control of AC using temperature sensor 25-09-2017 14-09-2017
LAB INTERNAL EXAM-II 09-10-2017 21-09-2017/
05-10-2017
Academic Year: 2017-2018 III B.Tech I Sem
Time Table:
Monday : 10:20AM- 1:00PM Thursday : 9:30AM-12:10PM
Tuesday : Friday :
Wednesday : Saturday :
Top Related