B.tech It R-20
B.tech It R-20
BACHELOR OF TECHNOLOGY
INFORMATIONTECHNOLOGY
Note: The regulations here under are subject to amendments as may be made by the
Academic Council of the College from time to time. Any or all such amendments will be
effective from such date and to such batches of candidates (including those already pursuing
the program) as may be decided by the Academic Council.
―AcademicAutonomy‖meansfreedomtotheCollegeinallaspectsofconductingits
academic programs, granted by the University for promotingexcellence.
―College‖meansMallaReddyCollegeofEngineering&Technology,Secunderabad unless
indicated otherwise by thecontext.
―Program‖means:
Bachelor of Technology (B.Tech) degreeprogram
UG Degree Program:B.Tech
―Course‖or―Subject‖meansatheoryorpracticalsubject,identifiedbyitscourse– number
and course-title, which is normally studied in asemester.
FOREWORD
The autonomy is conferred on Malla Reddy College of Engineering & Technology (MRCET)
by UGC based on its performance as well as future commitment and competency to impart
quality education. It is a mark of its ability to function independently in accordance with the
set norms of the monitoring bodies like UGC and AICTE. It reflects the confidence of the
UGC in the autonomous institution to uphold and maintain standards it expects to deliver on
its own behalf and thus awards degrees on behalf of the college. Thus, an autonomous
institution is given the freedom to have its own curriculum, examination system and
monitoring mechanism, independent of the affiliating University but under its observance.
Malla Reddy College of Engineering & Technology (MRCET) is proud to win the credence
of all the above bodies monitoring the quality of education and has gladly accepted the
responsibility of sustaining, and also improving upon the values and beliefs for which it has
been striving for more than a decade in reaching its present standing in the arena of
contemporary technical education. As a follow up, statutory bodies like Academic Council
and Boards of Studies are constituted with the guidance of the Governing Body of the
College and recommendations of the JNTU Hyderabad to frame the regulations, course
structure and syllabi under autonomous status.
The autonomous regulations, course structure and syllabi have been prepared after prolonged
and detailed interaction with several experts drawn from academics, industry and research, in
accordance with the vision and mission of the college which reflects the mindset of the
institution in order to produce quality engineering graduates to the society.
All the faculty, parents and students are requested to go through all the rules and regulations
carefully. Any clarifications, if needed, are to be sought at appropriate time with principal of
the college, without presumptions, to avoid unwanted subsequent inconveniences and
embarrassments. The cooperation of all the stakeholders is sought for the successful
implementation of the autonomous system in the larger interests of the institution and brighter
prospects of engineering graduates.
PRINCIPAL
VISION
To establish a pedestal for the integral innovation, team spirit, originality and
competence in the students, expose them to face the global challenges and become
technology leaders of Indian vision of modern society.
MISSION
To become a model institution in the fields of Engineering, Technology and
Management.
To impart holistic education to the students to render them as industry ready
engineers.
To ensure synchronization of MRCET ideologies with challenging demands of
International Pioneering Organizations.
QUALITY POLICY
To implement best practices in Teaching and Learning process for both UG and PG
courses meticulously.
To provide state of art infrastructure and expertise to impart quality education.
To groom the students to become intellectually creative and professionally
competitive.
To channelize the activities and tune them in heights of commitment and sincerity, the
requisites to claim the never - ending ladder of SUCCESS year after year.
MAX.
S.NO SUBJECT CODE SUBJECT L T P C MARKS
INT EXT
1 R20A0002 Professional English 2 0 0 2 30 70
2 R20A0022 Mathematics – II 3 1 0 4 30 70
3 R20A0011 Applied Physics 3 0 0 3 30 70
4 R20A0401 Analog and Digital Electronics 3 0 0 3 30 70
5 R20A0502 Python Programming 3 0 0 3 30 70
6 R20A0082 Applied Physics Lab - 0 3 1.5 30 70
7 R20A0582 Python Programming Lab - 0 3 1.5 30 70
8 R20A0084 Engineering and IT Workshop - 0 2 1 30 70
9* R20A0064* Financial Institutions, Markets and Services 1 - - 1 100 -
TOTAL 15 1 8 20 340 560
*Mandatory course: Non-credit course, 50% of scoring is required for the award of the degree
2 R20A0504 30 70
Operating Systems 3 0 0 3
3 R20A0505 30 70
Design and Analysis of Algorithms 3 0 0 3
4 R20A1201 30 70
Computer Organization& Microprocessors 3 0 0 3
5 R20A0024 30 70
Probability and Statistics 3 0 0 3
6 R20A0061 30 70
Managerial Economics and Financial Analysis 3 0 0 3
7 R20A0583 30 70
Data Structures using Python Lab - 0 3 1.5
8 R20A0584 30 70
Operating Systems Lab - 0 3 1.5
9 R20A0004* Foreign Language: French 2 - - 0 100 -
TOTAL 20 0 6 21 340 560
*Mandatory course: Non-credit course, 50% of scoring is required for the award of the degree
MAX. MARKS
S.NO SUBJECT CODE SUBJECT L T P C
INT EXT
1 R20A0026 30 70
Discrete Mathematics 3 0 0 3
2 R20A1202 30 70
Automata and Compiler Design 3 0 0 3
3 R20A0508 30 70
Object Oriented Programming through Java 3 0 0 3
OPEN ELECTIVE I
S.NO SUBJECT CODE SUBJECT
1 R20A1251 WEB DESIGNING TOOLS
2 R20A0551 INTRODUCTION TO DBMS
3 R20A0351 NTELLECTUAL PROPERTY RIGHTS
4 R20A0051 ENTERPRISE RESOURCE PLANNING
5 R20A0451 BASICS OF COMPUTER ORGANIZATION
OPEN ELECTIVE II
S.NO SUBJECT CODE SUBJECT
MAX.
S.NO SUBJECT CODE SUBJECT L T P C MARKS
INT EXT
1 R20A0463 Embedded Systems 0 30 70
3 0 3
2 R20A1205 Data Warehousing and Data Mining 3 0 0 3 30 70
3 R20A1206 Machine Learning 0 30 70
3 0 3
4 R20A1284 Mini Project - 30 70
- 6 3
Professional Elective-II
R20A1207
R20A0527 Computer Vision
5 3 0 0 3 30 70
R20A0530 Scripting Languages
IT Service Management and Automation
6 OE III Open Elective-III 3 0 0 3 30 70
7 R20A1282 Data Warehousing and Data Mining Lab 30 70
0 0 3 1.5
8 R20A1283 Machine Learning Lab 30 70
0 0 3 1.5
9* R20A0007* Constitution of INDIA 100
2 - - 0 -
TOTAL 17 0 12 21 340 560
*Mandatory course: Non-credit course, 50% of scoring is required for the award of the degree
5 R20A1255 DEV-OPS
MAX.
S.NO SUBJECT CODE SUBJECT L T P MARKS
C
INT EXT
1 R20A0519 Cyber Security 0 30 70
3 0 3
2 R20A0525 Block Chain Technology 0 30 70
3 0 3
3 R20A0523 Big Data Analytics 0 30 70
3 0 3
Professional Elective-III
Text Analytics and Natural language
4 R20A1208 30 70
Processing 3 0 0 3
R20A1209
R20A0528 Parallel Programming
Software Testing Methodologies
Professional Elective-IV
R20A1210
5 Virtual and Augmented Reality 3 0 0 3 30 70
R20A0524
R20A0529 Cloud Computing
Micro services
6 R20A1285 Major Project- Phase1 30 70
- - 6 3
7 R20A0592 Block Chain Technology Lab 30 70
- - 3 1.5
8 R20A0593 Big Data Analytics Lab 30 70
- - 3 1.5
TOTAL 15 0 12 21 240 560
MAX.
S.NO SUBJECT CODE SUBJECT L T P C MARKS
INT EXT
1 R20A1286 Start-up & Innovation - - 8 4 30 70
2 R20A1287 Entrepreneurship - - 6 3 30 70
3 R20A1288 Major Project - Phase 2 - - 16 8 30 70
TOTAL - - 30 15 90 210
(R20A001) ENGLISH
COURSE OBJECTIVES:
UNIT –I:
“The Road not taken "by Robert Frost
Grammar –Tenses and Punctuation(Sequences of Tenses)
Vocabulary –Word Formation - Prefixes and Suffixes
Writing –Paragraph Writing (Focusing on Tenses and Punctuations)
Reading –The art of skimming and scanning -Reading Exercise Type 1
(Match the statements to the text they refer to)
UNIT –II:
Act II from ‘Pygmalion’ by G.B. Shaw
Grammar –Direct and Indirect Speech
Vocabulary– Synonyms, Antonyms
Writing –Essay Writing (Introduction, body and conclusion)
Reading –Comprehending the context– Reading Exercise Type 2
(Place the missing statement)
UNIT-III:
Satya Nadella’s Email to His Employees on his First Day as CEO of Microsoft
Grammar – Voices
Vocabulary –One-Word Substitutes, Standard Abbreviations
Writing –E-mail Writing, Letter Writing (complaints, requisitions, apologies).
Reading –Reading Comprehension- Reading Exercise Type 3
(Reading between the lines)
UNIT –IV:
J K Rowling’s Convocation Speech at Harvard
Grammar – Articles, Misplaced Modifiers
Vocabulary –Phrasal Verbs
Writing – Précis Writing
Reading –Reading Exercise Type 4
(Cloze test)
UNIT –V:
Abdul Kalam’s Biography
Grammar – Subject-Verb Agreement, Noun-Pronoun Agreement
Vocabulary – Commonly Confused Words
Writing – Memo Writing
Reading –Reading Exercise Type 5
(Identifying errors)
* Exercises apart from the textbook shall also be used for classroom tasks.
REFERENCE BOOKS:
1. Practical English Usage. Michael Swan. OUP. 1995.
2. Remedial English Grammar. F.T. Wood. Macmillan.2007
3. On Writing Well. William Zinsser. Harper Resource Book. 2001
4. Study Writing. Liz Hamp-Lyons and Ben Heasly. Cambridge University Press. 2006.
5. Communication Skills. Sanjay Kumar and Pushpa Lata. Oxford University Press. 2011.
6. Exercises in Spoken English. Parts. I-III. CIEFL, Hyderabad. Oxford University Press
COURSE OUTCOMES:
Students will be able to:
1. Gain competence and proficiency in ‘productive’ skills, i.e., writing and speaking with
the recognition of the need for life-long learning of the same
2. Hone their language abilities in terms of comprehending complex technical texts
with a potential to review literature
3. Present ideas clearly and logically to analyze data and provide valid conclusions in
written communication
4. Enrich their grammatical accuracy and fluency to be adept at both the active and
passive skills
5. Represent old conventions with a set of the new by professional verbal
communicative ability
(R20A0021) MATHEMATICS - I
COURSE OBJECTIVES:
1. The concept of a Rank of the matrix and applying the concept to know the
consistency and solving the system of linear equations.
2. The concept of Eigen values, Eigen vectors and Diagonolisation.
3. The maxima and minima of functions of several variables.
4. The Applications of first order ordinary differential equations and methods to solve
higher order differential equations.
5. The properties of Laplace Transform, Inverse Laplace Transform and Convolution
theorem
UNIT –I:Matrices
Introduction, Rank of a matrix - Echelon form, Normal form, Consistency of system of linear
equations (Homogeneous and Non-Homogeneous)-Gauss-Siedel method, Linear
dependence and independence of vectors, Eigen values and Eigen vectors and their
properties (without proof), Cayley-Hamilton theorem(without proof), Diagonalisation of a
matrix.
UNIT –II:Multi Variable Calculus ( Differentiation)
Functions of two variables, Limit, Continuity, Partial derivatives, Total differential and
differentiability, Derivatives of composite and implicit functions, Jacobian-functional
dependence and independence, Maxima and minima and saddle points, Method of
Lagrange multipliers, Taylors theorem for two variables.
TEXT BOOKS
REFERENCE BOOKS
COURSE OUTCOMES:
After learning the concepts of this paper the student will be able to
Analyze the solutions of the system of linear equations and find the Eigen values
and Eigen vectors of a matrix, which are used to analyze the long term behavior of
any system.
Find the extreme values of functions of two variables with / without constraints.
Solve first order, first degree differential equations and their applications.
Form a differential equation for typical engineering problems and hence can solve
those higher order differential equations.
Solve differential equations with initial conditions using Laplace Transformation
1. To understand the basic concepts of electrical circuits & networks and their analysis
which is the foundation for all the subjects in the electrical engineering discipline.
2. To emphasize on the basic elements in electrical circuits and analyze Circuits using
Network Theorems.
3. To analyze Single-Phase AC Circuits.
4. To illustrate Single-Phase Transformers and DC Machines.
6. To get overview of basic electrical installations and calculations for energy
Consumption
UNIT –I:
Introduction to Electrical Circuits: Concept of Circuit and Network, Types of elements, R-L-C
Parameters, Independent and Dependent sources, Source transformation and Kirchhoff’s
Laws
UNIT –II:
Network Analysis: Network Reduction Techniques- Series and parallel connections of
resistive networks, Star–to-Delta and Delta-to-Star Transformations for Resistive Networks,
Mesh Analysis, and Nodal Analysis,
Network Theorems: Thevenin’s theorem, Norton’s theorem, Maximum Power Transfer
theorem and Superposition theorem, Illustrative variables.
UNIT-III:
Single Phase A.C. Circuits: Average value, R.M.S. value, form factor and peak factor for
sinusoidal wave form. Steady State Analysis of series R-L-C circuits. Concept of Reactance,
Impedance, Susceptance, Admittance, Concept of Power Factor, Real, Reactive and Complex
power and Illustrative Problems.
UNIT –IV:
Electrical Machines (elementary treatment only):
Single phase transformers: principle of operation, constructional features and emf equation.
DC.Generator: principle of operation, constructional features, emf equation. DC Motor:
principle of operation, Back emf, torque equation.
UNIT –V:
Electrical Installations:
Components of LT Switchgear: Switch Fuse Unit (SFU), MCB, ELCB, Types of Wires and
Cables, Earthing. Elementary calculations for energy consumption and battery backup.
transform
TEXT BOOKS
REFERENCE BOOKS
COURSE OUTCOMES:
Apply the basic RLC circuit elements and its concepts to networks and circuits.
Analyze the circuits by applying network theorems to solve them to find various
electrical parameters.
Illustrate the single-phase AC circuits along with the concept of impedance
parameters and power.
Understand the Constructional Details and Principle of Operation of DC Machines
and Transformers
Understand the basic LT Switch gear and calculations for energy consumption.
COURSE OBJECTIVES:
UNIT –I:
Introduction to Computer Aided Engineering Graphics
Introduction, Drawing Instruments and their uses, BIS conventions, lettering Dimensioning
& free hand practicing. AutoCAD User Interface – Menu system – coordinate systems, axes,
poly-lines, square, rectangle, polygons, splines, circles, ellipse,– tool bars (draw, modify,
annotations, layers etc.) – status bar (ortho, grid, snap, iso etc.),
Generation of points, lines, curves, polygons, dimensioning, layers, blocks, electrical
symbols
Geometrical constructions
Curves Used In Engineering Practice
a) Conic Sections (General Method only- Eccentricity Method)
b) Cycloid, Epicycloid and Hypocycloid
UNIT –II:
2D PRJECTIONS
Orthographic Projections: – Conventions – First and Third Angle projections.
Projections of Points, Projections of Lines, Projections of planes, Circuits Designs – Basic
Circuit Symbols & Sensors
UNIT-III:
Projections of Solids: Projections of regular solids prism and pyramid inclined to both
planes.
Sections of solids: Section planes and sectional view of right regular solids- prism, cylinder,
pyramid and cone, True shapes of the sections.
UNIT –V:
Transformation of Projections: Visualize the 2D &3D View of Engineering Objects for
Conversion of Isometric Views to Orthographic Views. Conversion of orthographic views to
isometric views – simple objects in AutoCAD
TEXT BOOKS
REFERENCE BOOKS
COURSE OUTCOMES:
After learning the concepts of this paper the student will be able to
1. Analyze the solutions of the system of linear equations and find the Eigen values
and Eigen vectors of a matrix, which are used to analyze the long term behavior of
any system.
2. Find the extreme values of functions of two variables with / without constraints.
3. Solve first order, first degree differential equations and their applications.
4. Form a differential equation for typical engineering problems and hence can solve
those higher order differential equations.
5. Solve differential equations with initial conditions using Laplace Transformation
COURSE OBJECTIVES:
UNIT –I:
Introduction to Computing – Computer Systems, Computing Environments, Computer
Languages, Algorithms and Flowcharts, Steps for Creating and Running programs.
Introduction to C – History of C, Features of C, Structure of C Program, Character Set,
C Tokens - keywords, Identifiers, Constants, Data types, Variables. Operators, Expressions,
Precedence and Associativity, Expression Evaluation, Type conversion, typedef, enum
Control Structures: Selection Statements(Decision Making) – if and switch statements,
Repetition Statements (Loops) - while, for, do-while statements, Unconditional Statements
– break, continue, goto, Command line arguments.
UNIT –II:
Pointers – Pointer variable, pointer declaration, Initialization of pointer, Accessing variables
through pointers, Pointer Arithmetic, pointers to pointers, void pointers
Arrays – Definition, declaration of array, Initialization, storing values in array, Two
dimensional arrays, Multi-dimensional arrays. Arrays and Pointers, Array of pointers
Strings – Declaration and Initialization, String Input / Output functions, Arrays of strings,
String manipulation functions, Unformatted I/O functions, strings and pointers
UNIT-III:
Designing Structured Programs using Functions - Types of Functions- user defined functions,
Standard Functions, Categories of functions, Parameter Passing techniques, Scope – Local
Vs Global, Storage classes, Recursive functions .Passing arrays as parameters to functions,
Pointers to functions, Dynamic Memory allocation.
UNIT –IV:
Structures and Unions - Declaration, initialization, accessing structures, operations on
structures, structures containing arrays, structures containing pointers, nested structures,
self referential structures, arrays of structures, structures and functions, structures and
pointers, unions.
Files – Concept of a file, Streams, Text files and Binary files, Opening and Closing files,
File input / output functions. Sequential Access and Random Access Functions
UNIT –V:
Basic Data Structures – Linear and Non Linear Structures – Implementation of Stacks,
Queues, Linked Lists and their applications.
Case Studies
Case 1: Student Record Management System
The main features of this project include basic file handling operations; you will learn how
to add, list, modify and delete data to/from file. The source code is relatively short, so
thoroughly go through the mini project, and try to analyze how things such as functions,
pointers, files, and arrays are implemented.
Currently, listed below are the only features that make up this project, but you can add new
features as you like to make this project a better one!
Add record
List record
Modify record
Delete record
1. You can create a structure for a student that uniquely identify each student. When a
student borrows a book from the library, you link his ID to Book ID so that librarian
can find how a particular book is borrowed .
2. You can create a feature to bulk import the books from CSV file.
3. You can add REGEX to search so that a book can be searched using ID, title, author
or any of the field.
4. You can add the student login section.
TEXT BOOKS
REFERENCE BOOKS
COURSE OUTCOMES:
After learning the concepts of this paper the student will be able to
COURSE OBJECTIVES:
Week 1:
a. Write a program to find sum and average of three numbers
b. Write a program to calculate simple interest(SI) for a given principal (P), time (T), and
rate of interest (R) (SI = P*T*R/100)
Week 2:
a. Write a program to swap two variables values with and without using third variable
b. Write a program to find the roots of a quadratic equation.
Week 3:
a. Write a program to find the sum of individual digits of a given positive integer.
b. Write a program, which takes two integer operands and one operator from the user,
performs the operation and then prints the result.
c. (Consider the operators +,-,*, /, % and use Switch Statement)
Week 4:
a. Write a program to find both the largest and smallest number in a list of integers.
b. Write a program to find the sum of integer array elements using pointers
Week 5:
a. Write a program to perform addition of two matrices.
b. Write a program to perform multiplication of two matrices.
Week 6:
a. Write a program to find the length of the string using Pointer.
b. Write a program to count the number of lines, words and characters in a given text.
Week 7:
a. Write a program to find factorial of a given integer using non-recursive function and
recursive function.
b. Write program to find GCD of two integers using non-recursive function and
recursive function.
Week 8:
a. Write a program using user defined functions to determine whether the given string
is palindrome or not.
b. Write a Program to swap the values of two variables using
I) Call by Value ii) Call by Reference
Week 9:
a. Write a program to find the sum of integer array elements using pointers, use
dynamic memory allocation to allocate memory.
b. Write a program to perform subtraction of two matrices, Design functions to
perform read, display and subtract
Week 10:
a. Write a program to create a structure named book and display the contents of a
book.
b. Write a Program to Calculate Total and Percentage marks of a student using
structure.
Week 11:
a. Write a program that uses functions to perform the following operations:
i) Reading a complex number ii) Writing a complex number
iii) Addition of two complex numbers iv) Multiplication of two complex numbers
b. Write a program to reverse the first n characters in a file.
(Note: The file name and n are specified on the command line.)
Week 12:
a. Write a program to copy the contents of one file to another.
b. Write a program to merge two files into a third file (i.e., the contents of the first file
followed by those of the second are put in the third.
Week 13:
a. Write a program for static implementation of stack
b. Write a program for static implementation of Queue
Week 14:
a. Write a program to perform various operations on single list
Week 15:
a. Write a program for dynamic implementation of stack
b. Write a program for Dynamic implementation of Queue
Case Studies
Case 1: Student Record Management System
The main features of this project include basic file handling operations; you will learn how
to add, list, modify and delete data to/from file. The source code is relatively short, so
thoroughly go through the mini project, and try to analyze how things such as functions,
pointers, files, and arrays are implemented.
Currently, listed below are the only features that make up this project, but you can add new
features as you like to make this project a better one!
Add record
List record
Modify record
Delete record
A librarian can add, search, edit and delete books. This section is password protected. That
means you need administrative credentials to log in as a librarian.
A student can search for the book and check the status of the book if it is available. Here is
list of features that you can add to the project.
1. You can create a structure for a student that uniquely identify each student. When a
student borrows a book from the library, you link his ID to Book ID so that librarian
can find how a particular book is borrowed .
2. You can create a feature to bulk import the books from CSV file.
3. You can add REGEX to search so that a book can be searched using ID, title, author
or any of the field.
4. You can add the student login section.
TEXT BOOKS
1. C Programming and Data Structures, P.Padmanabham, Third Edition, BS Publications
2. Computer programming in C.V.RAjaraman, PHI Publishers.
3. C Programming, E.Balagurusamy, 3rd edition, TMHPublishers.
4. C Programming, M.V.S.S.N Venkateswarlu and E.V.Prasad,S.Chand Publishers
5. Mastering C,K.R.Venugopal and S.R.Prasad, TMH Publishers.
Program Outcomes:
Ability to apply solving and logical skills to programming in C language.
Able to apply various conditional expressions and looping statements to
solveproblems associated with conditions.
Acquire knowledge about role of Functions involving the idea of modularity.
Understand and apply the Concept of Array,Strings and pointers dealing
withmemory management.
Acquire knowledge about basic data structures and their implementation.
CYCLE – I
CYCLE - II
COURSE OUTCOMES:
At the end of the course, students would be able to
Calculate the branch currents and mesh voltages by conducting KCL and KVL test
on given circuit.
Prove the various circuit theorems like Superposition, Thevenin’s, Norton’s,
Maximum power transfer and Reciprocity theorems.
Plot the Magnetization characteristics of DC shunt generator.
Plot the characteristics of DC shunt motor by conducting Brake Test.
Determine the Efficiency of single-phase transformer by conducting OC, SC and
Load tests
The following course content is prescribed for the English Language Communication Skills
Lab
UNIT –I
UNIT –II
UNIT–III
UNIT –IV
ICS Lab: Information transfer – from visual to verbal - maps, charts, tables and graphs
UNIT –V
CALL Lab: Errors in Pronunciation- Accent - the Influence of Mother Tongue (MTI)
ELCS Lab:
Computer network with LAN with minimum 60 multimedia systems with the
following specifications:
i) P –IV Processor
a)Speed –2.8 GHZ
b)RAM –512 MB Minimum
c)Hard Disk –80 GB
ii) Headphones of High quality
2. 2. Interactive Communication Skills (ICS) Lab :
A Spacious room with movable chairs and audio-visual aids with a Public Address
System, a T. V., a digital stereo –audio & video system and camcorder etc.
COURSE OUTCOMES:
COURSE OBJECTIVES:
This introductory course input is intended:
1. To help the students appreciate the essential complementarily between 'VALUES'
and 'SKILLS' to ensure sustained happiness and prosperity which are the core
aspirations of all human beings.
2. To facilitate the development of a holistic perspective among students towards life,
profession and happiness, based on a correct understanding of the Human reality
and the rest of Existence. Such a holistic perspective forms the basis of value based
living in a natural way.
3. To highlight plausible implications of such a holistic understanding in terms of ethical
human conduct, trustful and mutually satisfying human behavior and mutually
enriching interaction with
UNIT - I:
Course Introduction - Need, Basic Guidelines, Content and Process for Value Education:
Understanding the need, basic guidelines, content and process for Value Education.
Self Exploration - what is it? - its content and process; 'Natural Acceptance' and Experiential
Validation - as the mechanism for self exploration. Continuous Happiness and Prosperity
A look at basic Human Aspirations- Right understanding, Relationship and Physical Facilities
- the basic requirements for fulfillment of aspirations of every human being with their
correct priority.
Understanding Happiness and Prosperity correctly - A critical appraisal of the current
scenario. Method to fulfill the above human aspirations: understanding and living in
harmony at various levels.
UNIT - II:
UNIT - III:
UNIT - IV:
TEXT BOOKS:
REFERENCE BOOKS:
1. Ivan IIIich, 1974, Energy & Equity, The Trinity Press, Worcester, and HarperCollins,
USA
2. E. F. Schumancher, 1973, Small is Beautiful: a study of economics as if people
mattered. Blond & Briggs, Britain.
3. A Nagraj, 1998 Jeevan Vidya ek Parichay, Divya Path Sansthan, Amarkantak.
4. Sussan George, 1976, How the Other Half Dies, Penguin Press, Reprinted 1986,
1991.
5. P. L. Dhar, R. R. Gaur, 1990, Science and Humanism, Commonwealth Publishers.
6. A.N. Tripathy, 2003, Human Values, New Age International Publishers.
7. Subhas Palekar, 2000, How to practice Natural Farming, Pracheen(Vaidik) Krishi
Tantra Shodh, Amravati.
8. Donella H. Meadows, Dennis L. Meadows, Jorgen Randers, William W. Behrens III,
1972, Limits to Growth - Club of Rome's report, Universe Books.
9. E G Seebauer & Robert L.Berry, 2000, Fundamentals of Ethics for Scientists &
Engineers, Oxford University Press.
10. M Govindrajan, S Natrajan & V. S Senthil kumar, Engineering Ethics ( including
Humna Values), Eastern Economy Edition, Prentice Hall of India Ltd.
COURSE OUTCOMES:
The students will be able to obtain happiness and prosperity in their life.
They will develop harmony at all levels.
They can have satisfying human behavior throughout their life.
(R20A0002)PROFESSIONAL ENGLISH
COURSE OBJECTIVES:
SYLLABUS:
UNIT-I
Unit –III
Unit – IV
Unit – V
* Exercises apart from the text book shall also be referred for classroom tasks.
REFERENCE BOOKS:
COURSE OUTCOMES:
Analyze and interpret a diverse range of engineering concepts through the synthesis
of information
Understand the impact of professional engineering solutions is societal contexts and
demonstrate its knowledge
Achieve communicative ability in their personal and professional relations with
clarity of speech and creativity in content
Function effectively as an individual and a team; and would be able to prepare
themselves to be market ready
Comprehend and write effective reports and design documentation, manage
projects and make effective presentations.
(R20A0022) MATHEMATICS-II
COURSE OBJECTIVES:
1. The aim of numerical methods is to provide systematic methods for solving problems
in a numerical form using the given initial data, also used to find the roots of an
equation and to solve differential equations.
2. The objective of interpolation is to find an unknown function which approximates
the given data points and the objective of curve fitting is to find the relation between
the variables x and y from given data and such relationships which exactly pass
through the data (or) approximately satisfy the data under the condition of sum of
least squares of errors.
3. PDE aims at forming a function with many variables and also their solution methods,
Method of separation of variables technique is learnt to solve typical second order
PDE.
4. Evaluation of multiple integrals.
5. In many engineering fields the physical quantities involved are vector valued
functions. Hence the vector calculus aims at basic properties of vector-valued
functions and their applications to line, surface and volume integrals.
Double and triple integrals (Cartesian and polar), Change of order of integration in double
integrals, Change of variables (Cartesian to polar).
Introduction, Scalar point function and vector point function, Directional derivative,
Gradient, Divergence, Curl and their related properties, Laplacian operator, Line integral -
work done, Surface integrals, Volume integral. Green’s theorem, Stoke’s theorem and
Gauss’s Divergence theorems (Statement & their Verification).
TEXT BOOKS:
REFERENCE BOOKS:
1. Elementary Numerical Analysis by Atkinson-Han, Wiley Student Edition.
2. Advanced Engineering Mathematics by Michael Greenberg –Pearson publishers.
3. Introductory Methods of Numerical Analysis by S.S. Sastry, PHI
COURSE OUTCOMES: After learning the concepts of this paper the student will be able to
independently
Find the roots of algebraic, non algebraic equations and predict the value at an
intermediate point from a given discrete data.
Find the most appropriate relation of the data variables using curve fitting and this
method of data analysis helps engineers to understand the system for better
interpretation and decision making.
Solve first order linear and non-linear partial differential equations which are very
important in engineering field.
Evaluate multiple integrals; hence this concept can be used to evaluate Volumes and
Areas of an object.
Evaluate the line, surface, volume integrals and converting them from one to
another using vector integral theorems.
COURSE OBJECTIVES:
The main COURSE OBJECTIVES of the course are:
1. To familiarize the student with the principal of operation, analysis and design of
junction diode and BJT.
2. To understand basic number systems codes and logical gates.
3. To introduce the methods for simplifying Boolean expressions
4. To outline the formal procedures for the analysis and design of combinational
circuits and sequential circuits
UNIT-I
P-N Junction diode: Qualitative Theory of P-N Junction, P-N Junction as a diode , diode
equation, volt-ampere characteristics temperature dependence of V-I characteristic , ideal
versus practical, diode equivalent circuits, Zener diode characteristics.
UNIT-II
UNIT-III
UNIT IV:
Number System and Boolean Algebra: Number Systems, Base Conversion Methods,
Complements of Numbers, Codes- Binary Codes, Binary Coded Decimal, Unit Distance Code,
Digital Logic Gates (AND, NAND, OR, NOR, EX-OR, EX-NOR), Properties of XOR Gates,
Universal Gates, Basic Theorems and Properties, Switching Functions, Canonical and
Standard Form.
UNIT-V
Minimization Techniques: The Karnaugh Map Method, Three, Four and Five Variable Maps,
Prime and Essential Implications, Don’t Care Map Entries, Using the Maps for Simplifying,
Multilevel NAND/NOR realizations.
Combinational Circuits: Design procedure – Half adder, Full Adder, Half subtractor, Full
subtractor, Multiplexer/Demultiplexer, decoder, encoder, Code converters, Magnitude
Comparator.
TEXT BOOKS:
REFERENCE BOOKS:
COURSE OUTCOMES:
Understand and Analyze the PN and Zener diodes, operation and its characteristics
Understand and analyze the BJT Transistor.
Understand the basic postulates of Boolean algebra and shows the correlation
between Boolean expressions
Learn the methods for simplifying Boolean expressions
Understand the formal procedures for the analysis and design of combinational
circuits and sequential circuits
UNIT –I:
Introduction to Python Programming Language: Introduction to Python Language and
installation, overview on python interpreters, working with python, Numeric Data Types:
int, float, Boolean, complex and string and its operations, Standard Data Types: List, tuples,
set and Dictionaries, Data Type conversions, commenting in python.
UNIT –II:
Variables and Operators: Understanding Python variables, Multiple variable declarations,
Python basic statements, Python basic operators: Arithmetic operators, Assignment
operators, Comparison operators, Logical operators, Identity operators, Membership
operators, Bitwise operators, Precedence of operators, Expressions
UNIT-III:
CONTROL FLOW AND LOOPS
conditional (if), alternative (if-else), chained conditional (if- elif -else), Loops: For loop using
ranges, string, Use of while loops in python, Loop manipulation using pass, continue and
break
UNIT –IV:
Defining Your Own Functions, Calling Functions, passing parameters and arguments, Python
Function arguments: Keyword Arguments, Default Arguments, Variable-length arguments,
Anonymous Functions, Fruitful Functions (Function Returning Values), Scope of the
Variables in a Function - Global and Local Variables. Powerful Lambda functions in python,
Brief on other functions like sort, sorted and range.
UNIT –V:
Files and Error Handling
Introduction, Access Modes, Writing Data to a File, Reading Data from a File, Additional File
Methods introduction to Errors and Exceptions, Handling IO Exceptions, Run Time Errors,
Handling Multiple Exceptions. Other topics: Modules, some Standard Modules – sys, math,
time
TEXT BOOKS:
REFERENCE BOOKS:
COURSE OUTCOMES:
1. To analyze the ordinary light with a laser light and realize the transfer of light
through optical fibers.
2. To identify dual nature of the matter and behavior of a particle quantum
mechanically.
3. To explore band structure of the solids and classification of materials.
4. To acquire the basic knowledge of various types of semiconductor devices and find
the applications in science and technology.
5. To Compare dielectric and magnetic properties of the materials and enable them to
design and apply in different
Free electron theory(Classical & Quantum)- Assumptions, Merits and drawbacks, Fermi
level, Density of states, Periodic potential, Bloch’s theorem, Kronig – Penny model
(qualitative) , E – K diagram, Effective mass, Origin of energy bands in solids, Classification of
materials : Metals, semiconductors and insulators.
Intrinsic and extrinsic semiconductors, Direct and indirect band gap semiconductors, Carrier
concentration in intrinsic and extrinsic semiconductors. Dependence of Fermi level on
carrier concentration and temperature, carrier transport: mechanism of diffusion and drift,
Formation of PN junction, V-I characteristics of PN diode, energy diagram of PN diode, Hall
experiment, semiconductor materials for optoelectronic devices - LED, Solar cell.
UNIT –V: DIELECTRICS AND MAGNETIC PROPERTIES OF MATERIALS (10 Hours)
REFERENCE BOOKS:
1. Engineering Physics – R.K. Gaur and S.L. Gupta, DhanpatRai Publishers.
2. Engineering Physics, S Mani Naidu- Pearson Publishers.
3. Engineering physics 2nd edition –H.K. Malik and A.K. Singh.
4. Engineering Physics – P.K. Palaniswamy, Scitech publications.
5. Physics by Resnick and Haliday.
COURSE OUTCOMES:
LIST OF EXPERIMENTS: ``
1. Torsional pendulum-Rigidity modulus of given wire.
2. Melde’s experiment –Transverse and Longitudinal modes.
3. Stewart and Gee’s method- Magnetic field along the axis of current carrying coil.
4. Spectrometer-Dispersive power of the material of a prism
5. Diffraction grating-using laser -Wave length of light.
6. Newton’s Rings –Radius of curvature of Plano convex lens.
7. LED -Characteristics of LED.
8. Solar cell -Characteristics of a Solar cell.
9. Optical fiber- Evaluation of numerical aperture of optical fiber.
10. Hall effect –To study Hall effect in semiconducting samples.
REFERENCE BOOKS:
COURSE OUTCOMES:
Students are able to measure the elastic constants of the given material of the wire
andalso determinetheacfrequency of vibrating bar.
Students are able to determine the magnetic induction of a circular coil carrying
current by applying the principles of terrestrial magnetism.
Students are able to frame relativistic ideas of light phenomenon
Students are able to achieve the analysis of V-I characteristics of opto electronic
devices
Students are able to determine the carrier concentration and identify the given
semiconductor material with the help of hall effect
Week 1:
A. Write python program to print Hello World
B. Write a python program to get string, int, float input from user
C. Write a python program to add 2 numbers
Week 2:
A) Create a list and perform the following methods
1) insert() 2) remove() 3) append() 4) len() 5) pop() 6) clear()
B) Write a python program to find the length of list?
C) Write a python program to find the smallest and largest number in the list?
Week 3:
A) Create a tuple and perform the following methods
1) Add items 2) len() 3) check for item in tuple 4)Access iems
B) Write a python program using the following methods: 1) count 2) index
C) Write a python program using “+” and “*” operations which resulting a new tuple?
Week 4:
A) Create a dictionary and apply the following methods
1) Print dictionary items 2) access items 3) use get() 4)change values 5) use len()
B) Write a python code to convert list of tuples into dictionaries?
C) Write python program to store data in list, tuple, set, dictionary and then try to print
them.
Week 5:
A) Write a python program to perform arithmetic, assignment, logical and comparison
operators.
B) Write a Python program to add two positive integers without using the '+' operator.
(use bitwise operator)
C) Write a Python program to perform the basic four operators (+, -, *, /)
Week 6:
A. Write a simple python program to declare a variable in different possible ways?
B. Write a python program to show precedence of operators using the expression: z =
(v+w) * x / y
C. Write a python program to check whether the values of a list exist or not (use
membership operator) and also perform identity operation?
Week 7:
A) Write a python program to print a number is positive/negative using if-else.
B) Write a python program to find largest number among three numbers.
C) Write a python Program to read a number and display corresponding day using
if_elif_else?
D)Write a python program to print list of numbers using range and for loop
Week 8:
A) Write a python code to print the sum of natural numbers using while loop.
B) Write a python program to print the factorial of given number.
C) Write a python program to find the sum of all numbers stored in a list using for
loop.
Week 9:
A) Write a Python function that takes two lists and returns True if they are equal
otherwise false
B) Write python program in which an function is defined and calling that function
prints Hello World
C) Write python program in which an function (with single string parameter ) is
defined and calling that function prints the string parameters given to function.
D) Write a python program using with any one of python function argument?
Week 10:
A. Write a program to double a given number and add two numbers using lambda().
B. Write a program for filter() to filter only even numbers from a given list.
C. Write a program for map() function to double all the items in the list.
D. Write a program to find sum of the numbers for the elements of the list by using
reduce().
Week 11:
A. Write a python program to open and write “hello world” into a file.
B. Write a python program to write the content “hi python programming” for the
existing file.
C. Write a python program to read the content of a file?
Week 12:
TEXT BOOKS:
COURSE OUTCOMES:
Students will be able to:
Evaluate Problem solving and programming capability
Describe the Numbers, Math functions, Strings, List, Tuples and Dictionaries in
Python
Implement conditional and loop for python programs
Express different Decision Making statements and Functions
Understand and summarize different File handling operations and exceptions
Task- 1: PC HARDWARE
Identification of the peripherals of a computer, components in a CPU and its functions.
Block diagram of the CPU along with the configuration of each peripherals. Functions of
Motherboard. Assembling and Disassembling of PC. Installing of OS.
Task- 2: TROUBLESHOOTING
Hardware Troubleshooting: Students are to be given a PC which does not boot due to
proper assembly or defective peripherals and the students should be taught to identify and
correct the problem.
Software Troubleshooting: Students have to be given a malfunctioning CPU due to system
software problems. They should identify the problem and fix it to get the computer back to
working condition.
Task 3: INTERNET
Web Browsers, Access of websites, Surfing the Web, Search Engines, Customization of web
browsers, proxy settings, bookmarks, search toolbars, pop-up blockers. Antivirus
downloads, Protection from various threats.
MS OFFICE
Task 4: MICROSOFT WORD
Introduction to Word Processor, Editing and Formatting features, overview of toolbars,
saving files, Using help and resources, rulers, fonts, styles, format painter, Drop Cap in
word, Applying Text effects, Using Character Spacing, Borders and colors, Inserting Header
and Footer, Using Date and Time option in Word &Formatting Styles, Inserting table, Bullets
and Numbering, Changing Text Direction, Cell alignment, Footnote, Hyperlink, Symbols,
Spell Check, Track Changes. Table of Content, Newspaper columns, Images from files and
clipart, Drawing toolbar and Word Art, Formatting Images, Textboxes, Paragraphs and Mail
Merge in word. Using Word to create Project Certificate, Project Abstract, News Letter,
Resume.
Task 5: MICROSOFT EXCEL
Excel Orientation: The importance of Excel as a Spreadsheet tool, Accessing, overview of
toolbars, saving excel files, Using help and resources. Excel formulae &Functions : formulae,
logical functions, text functions, statistical functions, mathematical functions, lookup
functions, conditional formatting, Charts, Hyper linking, Renaming and Inserting
worksheets, Data Analysis functions.
Creating a Scheduler ( Features:- Gridlines, Format Cells, Summation, auto fill, Formatting)
Calculating GPA (Features:- Cell Referencing, Formulae and functions in excel)
Task 6: MICROSOFT POWER POINT
Basic power point utilities and tools, PPT Orientation, Slide Layouts, Inserting Text, Word
Art, Formatting Text, Bullets and Numbering, Auto Shapes, Drawing toolbar-Lines and
Arrows, Text boxes, Clipart, Insertion of images, slide transition, Custom animation,
Hyperlinks.
Task 7: LIBRE OFFICE
Overview of LibreOffice and its features of Writer, Calc, Impress, Draw, Base, Math, Charts.
Libre office Math: Introduction , Creating & Editing Formulas, formulas as separated
documents or files, formulas in office document, Creating formulas, Formula layout
Libre Office Draw : Introduction, Basic shapes, working with objects, flowcharts,
organization charts.
Text Books:
1.Introduction to Information Technology, ITL Education Solutions limited, Pearson
Education
2.PC Hardware and A+ Handbook-Kate J.Chase PHI(Microsoft)
3. Excel Functions and Formulas, Bernd held, Theodor Richardson, Third Edition
4. Libre Office Documentation : https://documentation.libreoffice.org/en/english-
documentation
Outcomes:
Ability to identify the major components of a computer and its peripherals. They are
capable of assembling a personal computer, and can perform installation of system
software like MS Windows and required device drivers.
Students can detect and perform minor hardware and software level
troubleshooting.
Capacity to work on Internet & World Wide Web and make effective usage of the
internet for academics.
Ability to prepare professional word documents, excel spread sheets and power
point presentations using the Microsoft suite of office tools.
Course Objectives:
List of Experiments:
1. Residential house wiring using switches, fuse, indicator, lamp and energy meter.
2. Fluorescent lampwiring
3. Stair casewiring
4. Soldering and Disordering practice – components, devices and circuits using general
purpose PCB.
Course Outcomes:
1. Introduction to AutoCAD
2. Design Process, AutoCAD Installation Process, AutoCAD user Interface, Function Keys
3. Commands: Drawing Commands, Editing Commands, Drawings aids
4. D Wireframe Modeling
5. CAD Practice Exercises
CAD -2D, CAD - Isometric
REFERENCE BOOKS
COURSE OUTCOMES: The basic concepts included in this course will help the student to:
COURSE OBJECTIVES:
UNIT – II
Data Structures – Definition,Linear Data Structures,Non-Linear Data Structures,Python Specific Data
Structures, List,Tuples, Set, Dictionaries, Comprehensions and its Types,Strings,slicing.
UNIT -III
Arrays - Overview, Types of Arrays, Operations on Arrays, Arrays vs List.
Searching - Linear Search and Binary Search.
Sorting - Bubble Sort, Selection Sort, Insertion Sort, Merge Sort, Quick Sort.
UNIT -IV
Linked Lists – Implementation ofSingly Linked Lists, Doubly Linked Lists, Circular Linked Lists.
Stacks - Overview of Stack, Implementation of Stack (List & Linked list), Applications of Stack
Queues:Overview of Queue, Implementation of Queue(List & Linked list), Applications of Queues, Priority
Queues.
UNIT -V
Graphs -Introduction, Directed vs Undirected Graphs, Weighted vs Unweighted Graphs, Representations,
Breadth First Search, Depth First Search.
Trees - Overview of Trees, Tree Terminology, Binary Trees: Introduction, Implementation, Applications. Tree
Traversals, Binary Search Trees: Introduction, Implementation, AVL Trees: Introduction, Rotations,
Implementation.
TEXTBOOKS:
REFERENCE BOOKS:
1. Hands-On Data Structures and Algorithms with Python: Write complex and powerful code using the
latest features of Python 3.7, 2nd Edition by Dr. Basant Agarwal, Benjamin Baka.
2. Data Structures and Algorithms with Python by Kent D. Lee and Steve Hubbard.
3. Problem Solving with Algorithms and Data Structures Using Python by Bradley N Miller and David L.
Ranum.
4. Core Python Programming -Second Edition,R. Nageswara Rao, Dreamtech Press
COURSE OUTCOMES:
1. Examine Python syntax and semantics and apply Python flow control and functions.
2. Create, run and manipulate Python Programs using core data structures like Lists,
3. Apply Dictionaries and use Regular Expressions.
4. Interpret the concepts of Object-Oriented Programming as used in Python.
5. Master object-oriented programming to create an entire python project using objects and classes
UNIT - I
Operating System-Introduction, Structures-Simple Batch, Multi-programmed, Time-shared, Personal
Computer, Parallel, Distributed Systems, Real-Time Systems, System components, Operating System services.
Introduction to Linux operating system, Linux file system, Linux Utilities
UNIT - II
Linux:Introduction to shell, Types of Shell's, example shell programs.
Process and CPU Scheduling - Process concepts and scheduling, Operations on processes,Cooperating
Processes, Threads, Scheduling Criteria, Scheduling Algorithms, Multiple -Processor Scheduling.
UNIT - III
Deadlocks - System Model, Deadlocks Characterization, Methods for Handling Deadlocks,
DeadlockPrevention, Deadlock Avoidance, Deadlock Detection, and Recovery from Deadlock
Process Management and Synchronization - The Critical Section Problem, Synchronization Hardware,
Semaphores, and Classical Problems of Synchronization, Critical Regions, Monitors
UNIT - IV
Interprocess Communication Mechanisms: IPC between processes on a single computer system, IPC between
processes on different systems, using pipes, FIFOs, message queues, shared memory implementation in
Linux.Corresponding system calls.
Memory Management and Virtual Memory - Logical versus Physical Address Space, Swapping, Contiguous
Allocation, Paging, Segmentation, Segmentation with Paging, Demand Paging, Page Replacement, Page
Replacement Algorithms.
UNIT - V
File System Interface and Operations -Access methods, Directory Structure, Protection, File System Structure,
Allocation methods, kernel support for files, system calls for file I/O operations open, create, read, write,
close, l seek, stat, ioctl
Disk Management: Disk Scheduling Algorithms-FCFS, SSTF, SCAN, C-SCAN
TEXT BOOKS:
REFERENCE BOOKS:
1. Operating Systems – Internals and Design Principles Stallings, Fifth Edition–2005, Pearson
Education/PHI
2. Operating System A Design Approach- Crowley, TMH.
3. Modern Operating Systems, Andrew S. Tanenbaum 2nd edition, Pearson/PHI
4. UNIX programming environment, Kernighan and Pike, PHI/ Pearson Education
5. UNIX Internals -The New Frontiers, U. Vahalia, Pearson Education.
UNIT I
Introduction: Algorithms, Pseudo code for expressing algorithms, performance analysis- Space complexity,
Time Complexity, Asymptotic notation- Big oh notation, omega notation, theta notation and little oh
notation.
Divide and Conquer: General method. Applications- Binary search, Quick sort, merge sort, Strassen’s matrix
multiplication.
UNIT II
Disjoint set operations, Union and Find algorithms, AND/OR graphs, Connected components, Bi-connected
components.
Greedy method: General method, applications- Job sequencing with deadlines, Knapsack problem,Spanning
trees, Minimum cost spanning trees, Single source shortest path problem.
UNIT III
Dynamic Programming: General method, applications- Matrix chained multiplication, Optimal binary search
trees, 0/1 Knapsack problem, All pairs shortest path problem, Traveling sales person problem, Reliability
design.
UNIT IV
Backtracking: General method, Applications- n-queue problem, Sum of subsets problem, Graph coloring,
Hamiltonian cycles.
UNIT V
Branch and Bound: General method, applications- Travelling sales person problem, 0/1 Knapsack problem- LC
branch and Bound solution, FIFO branch and Bound solution.
NP-Hard and NP-Complete Problems: Basic concepts, Non deterministic algorithms, NP-Hard and NP-
Complete classes, NP-Hard problems, Cook’s theorem.
TEXT BOOKS:
REFERENCES:
1. Introduction to the Design And Analysis of Algorithms A Levitin Pearson Education
2. Algorithm Design foundations Analysis and Internet examples, M.T.Goodrich and R
Tomassia John Wiley and sons
3. Design and Analysis of Algorithms, S. Sridhar, Oxford Univ.Press
4. Design and Analysis of Algorithms,Aho , Ulman and Hopcraft , Pearson Education.
5. Foundations of Algorithms, R. NeapolitanandK.Naimipour , 4th edition
COURSE OUTCOMES:
COURSE OBJECTIVES:
Students should be able:
1. To understand basic components of computers and architecture of 8086
microprocessor
2. To learn to classify the instruction formats and various addressing modes of8086
microprocessor.
3. To know how to represent the data and understand how computations are
performed at machine level.
4. To have knowledge of the memory organization and I/O Organization.
5. To understand the parallelism both in terms of single and multiple processors.
UNIT - I
Digital Computers: Introduction, Block diagram of Digital Computer, Definition of Computer
Organization, Computer Design and Computer Architecture.
Basic Computer Organization and Design: Instruction codes, Computer Registers, Computer
instructions, Timing and Control, Instruction cycle, Memory Reference Instructions, Input –
Output and Interrupt, Complete Computer Description.
Micro Programmed Control: Control memory, Address sequencing, micro program
example, design of control unit.
UNIT - II
Central Processing Unit: The 8086 Processor Architecture, Register organization, Physical
memoryorganization,GeneralBusOperation,I/OAddressingCapability,SpecialProcessorActiviti
es,Minimum and Maximum mode system andtimings.
8086 Instruction Set and Assembler Directives-Machine language instruction formats,
Addressing modes, Instruction set of 8086, Assembler directives and operators.
UNIT - III
Assembly Language Programming with 8086- Machine level programs, Machine coding the
programs, Programming with an assembler, Assembly Language example programs. Stack
structure of 8086, Interrupts and Interrupt service routines, Interrupt cycle of 8086,
Interrupt programming, Passing parameters to procedures, Macros, Timings and Delays.
UNIT - IV
Computer Arithmetic: Introduction, Addition and Subtraction, Multiplication Algorithms,
Division Algorithms, Floating - point Arithmetic operations.
Input-Output Organization: Peripheral Devices, Input-Output Interface, Asynchronous
datatransfer, Modes of Transfer, Priority Interrupt, Direct memory Access, Input –Output
Processor (IOP),Intel 8089 IOP.
UNIT - V
Memory Organization: Memory Hierarchy, Main Memory, Auxiliary memory, Associate
Memory, Cache Memory.
Pipeline and Vector Processing: Parallel Processing, Pipelining, Arithmetic Pipeline,
Instruction Pipeline, RISC Pipeline, Vector Processing, Array Processors.
TEXT BOOKS:
1. Computer Organization and Architecture, William Stallings, 9th Edition, Pearson.
2. Microprocessors and Interfacing, D V Hall, SSSP Rao, 3rd edition, McGraw Hill India
Education PrivateLtd.
REFERENCE BOOKS:
1. Carl Hamacher, Zvonko Vranesic, Safwat Zaky: Computer Organization, 5th
Edition, Tata McGraw Hill,2002
2. David A. Patterson, John L. Hennessy: Computer Organization and Design – The
Hardware/ Software Interface ARM Edition, 4th Edition, Elsevier, 2009.
COURSE OUTCOMES:
Students will be able:
To identify the basic components and the design of CPU, ALU and Control Unit.
To interpret memory hierarchy and describe the impact on computer
cost/performance.
To express instruction level parallelism and pipelining for high performance
Processor design.
To represent the instruction set, instruction formats and addressing modes
of8086.
To write assembly language programs to solve problems.
TEXT BOOKS:
REFERENCE BOOKS:
1. Introduction to Probability and Statistics for Engineers and Scientists by Sheldon M.Ross.
2. Probability and Statistics for Engineers by Dr. J. Ravichandran
COURSE OUTCOMES:
After completion of the course, the student will be able to
Evaluate randomness in certain realistic situation which can be either discrete or continuous type and
compute statistical constants of these random variables.
Provide very good insight which is essential for industrial applications by learning probability
distributions.
Higher up thinking skills to make objective, data-driven decisions by using correlation and regression.
Assess the importance of sampling distribution of a given statistic of a random sample.
Analyze and interpret statistical inference using samples of a given size which is taken from a
population.
COURSE OBJECTIVES:
1. To enable the student with a practical insight upon the importance of certain basic issues governing
the business operations which are needed for sound economic decision making.
2. Toprovideinputsonanoverallanalysisofanindividualfirm,itsproductionfunction,costanalysis
andbreak-even-point
3. To make students understand different market structures, pricing of the product
orservicesanddifferentformsofbusiness organisations.
4. To understand capital requirements of the business and basic rule of accounting of
thebusiness.
5. To learn analytical techniques and arriving at conclusions from financial information forthe
purposeofbusiness decisionmaking.
UNIT-I
Introduction to Managerial Economics: Definition, Nature and Scope of Managerial Economics, Micro and
Macroeconomic Concepts.
Demand Analysis: Demand Determinants, Law of Demand and exceptions.
Elasticity ofDemand:Definition, Types, Measurement and Significance of elasticity of Demand.
Demand Forecasting: Factors governing Demand Forecasting, Methods of Demand Forecasting (Survey
Methods, Expert Opinion, Test Marketing, Controlled Experience, Judgemental Approach, and Time Series
Analysis).
UNIT-II
Production & Cost Analysis: Production Function- Isocost and Isoquants, MRTS, Least Cost Combination of
Inputs, Cobb-Douglas Production Function, Laws of Returns, Internal and External Economies of Scale.
Cost Analysis: Cost Concepts. Break-Even Analysis (BEA) - Determination of Break-Even Point (Simple
Problems)
UNIT-III
Markets: Types of Competition and Markets, Features of Perfect Competition, Monopoly and Monopolistic
Competition;
Pricing: Objectives, Methods of Pricing;
Business: Features of different forms of Business Organisation (Sole Trader, Partnership, Joint Stock
Company, Cooperative Society, and Public Enterprises).
UNIT-IV
Introduction to Capital and Financial Accounting: Need for Capital, Types of Capital, Working Capital
Analysis, Methods and Sources of raising Finance.
Accounting: Definition, Concepts and Conventions (GAAP); Accounting Cycle; Formats for preparation of Trial
Balance and Final Accounts (Trading Account, Profit and Loss Account and Balance Sheet).
UNIT-V
Investment Decision: Capital Budgeting - Features, Objectives, and Methods (Payback Method, Accounting
Rate of Return and Net Present Value) - advantages & disadvantages. (Simple Problems)
Financial Analysis: Analysis and Interpretation of Liquidity Ratios, Activity Ratios, Capital Structure Ratios and
Profitability Ratios. (Simple Problems)
References:
1. Managerial Economics & Financial Analysis, Special Edition-MRCET. McGraw Hill Publications, 2017
2. D.N. Dwivedi, Managerial Economics, Vikas Publications.
3. Justin Paul, Leena, Sebastian, Managerial Economics, Cengage
4. P. L. Mehta, Managerial Economics: Analysis, Problems and Cases, Sultan Chand & Sons.
5. S. N. Maheswari & S. K. Maheswari, Financial Accounting, Vikas Publications.
6. M. Y. Khan and P. K. Jain, Financial Management, McGraw Hill
COURSE OUTCOMES:
Followingarethecourseoutcomes:
1. Makesstudentsunderstandtheconceptsandapplicationsofmanagerialeconomicsintakingbusin
ess decisions.
2. Empowersstudentstocomprehendwiththeproductionprocessandtechnicalrelationshipamong
factors of production,differentcostconcepts andoptimizationof cost.
3. Enablesstudentstoknowtheclassificationofmarketsandhowfirmsdeterminetheirpriceoutputd
ecisions indifferentkinds of marketswithdifferentforms ofbusiness.
4. Allowsstudentstoknowdifferentsourcesofcapitalforthebusinessandhowfinancialaccountingis
done forsmoothbusinessfunctioning.
5. Equipsstudentswithdifferentfinancialanalysistoolsandtechniquestoevaluatefinancialperform
ance ofthebusiness.
COURSEOBJECTIVES:
1. Write a Python program for class, Flower, that has three instance variables of type
str,int, and float, that respectively represent the name of the flower, its number of
petals, and its price. Your class must include a constructor method that initializes
each variable to an appropriate value, and your class should include methods for
setting the value of each type, and retrieving the value of each type.
2. Develop an inheritance hierarchy based upon a Polygon class that has abstract
methods area( ) and perimeter( ). Implement classes Triangle, Quadrilateral,
Pentagon,that extend this base class, with the obvious meanings for the area( ) and
perimeter( ) methods.Write a simple program that allows users to create polygons
of the various types and input their geometric dimensions, and the program then
outputs their area and perimeter.
COURSE OUTCOMES:
1. Examine Python syntax and semantics and apply Python flow control and functions.
2.Create, run and manipulate Python Programs using core data structures like Lists,
3. Apply Dictionaries and use Regular Expressions.
4.Interpret the concepts of Object-Oriented Programming as used in Python.
5.Master object-oriented programming to create an entire python project using
objects
and classes
COURSE OBJECTIVES:
LISTOF EXPERIMENTS:
Week 1: Practice File handling utilities, Process utilities, Disk utilities, Networking
commands, Filters, Text processing utilities and Backup utilities.
Week 2:
Write a shell script that receives any number of file names as arguments checks if every
argument supplied is a file or directory and reports accordingly. Whenever the argument
is a file it reports no of lines present init.
Week 3: Simulate the following CPU scheduling algorithms.
a)FCFS b) SJF c) Round Robin d) Priority.
Week 4:
Simulate Bankers Algorithm for Dead Lock Avoidance; Simulate Bankers Algorithm for Dead
Lock Prevention.
Week 5:
A) Write a C program to simulate the concept of Dining-philosophers problem.
B) Write a C program to simulate producer-consumer problem using Semaphores
Week 6:
a) Write a C program to implement kill(), raise() and sleep()functions.
b) Write a C program to implement alarm(), pause() and abort()functions
c) Write a program that illustrate communication between two process using unnamed
pipes
Week 7:
a) Write a program that illustrates communication between two process using named pipes
or FIFO.
b) Write a C program that receives a message from message queue and display them.
Week 8:
Write a C program that illustrates two processes communicating using Shared memory.
Week 9:
Simulate all page replacement algorithms a) FIFO b) LRU c) OPTIMAL
Week 10:
Write a C program that takes one or more file/directory names as command line input and
reports following information
A) File Type B) Number Of Links C) Time of last Access D) Read, write and execute
permissions
Week 11:
a) Implement in c language the following UNIX commands using system calls
i) cat ii) ls iii) Scanning Directories (Ex: opendir(),readdir(),etc.)
b) Write a C program to create child process and allow parent process to display “parent”
and the child to display “child” on the screen
Week 12:
TEXT BOOKS:
1. Operating System Principles- Abraham Silberchatz, Peter B. Galvin, Greg Gagne 7th
Edition, John Wiley
2. Advanced programming in the Unix environment, W.R.Stevens, Pearson education.
REFERENCE BOOKS:
1. Operating Systems – Internals and Design Principles, William Stallings, Fifth Edition–
2005, Pearson Education/PHI
2. Operating System - A Design Approach-Crowley, TMH.
3. Modern Operating Systems, Andrew S Tanenbaum, 2nd edition, Pearson/PHI
4. UNIX Programming Environment, Kernighan and Pike, PHI/Pearson Education
5. UNIX Internals: The New Frontiers, U. Vahalia, Pearson Education
COURSE OUTCOMES:
To provide an understanding of the design aspects of operating system concepts
through simulation
Introduce basic Linux commands, system call interface for process management,
inter process communication and I/O in Unix.
Student will learn various process and CPU scheduling Algorithms through
simulation programs
Student will have exposure to System calls and simulate them.
Student will learn deadlocks and process management & Inter Process
communication and simulate them
UNIT - I:
Speaking: Introduction to the French language and culture –Salutations - French
alphabet - Introducing people
Writing: Understand and fill out a form
Grammar: The verbs “to be ' and “to have '' in the present tense of the indicative
Vocabulary: The numbers from 1 to 20 - Professions- Nationalities
UNIT - II:
Speaking: Talk about one’s family – description of a person - express his tastes and
preferences - express possession - express negation
Writing: Write and understand a short message
Grammar: Nouns (gender and number) - Articles - The–erverbs in the present-
Possessive adjectives - Qualifying adjectives
Vocabulary: The family – Clothes-Colors- The numbers from 1 to 100-The classroom
UNIT - III
Speaking: Talk about your daily activities - be in time - ask and indicate the date and
time - talk about sports and recreation - express the frequency
Writing: A letter to a friend
Grammar: The expression of time– The –ir verbs in the present- The verbs do, go, take,
come,- Adverbs-Reflexive verbs
Vocabulary: The days and months of the year- The sports-Hobbies
UNIT - IV
Speaking: Express the quantity - ask and give the price - express the need, the will and
the capacity - compare (adjective) - speak at the restaurant / in the shops
Writing: A dialogue between a vendor and a customer at the market
Grammar: Verbs “to want”, “to can”- Express capacity / possibility- Express will / desire
– the future tense
Vocabulary: The food – Meals-Fruits and vegetables– The parts of the body
UNIT - V
Speaking: Express the prohibition and the obligation - describe an apartment - talk
about the weather / ask the weather - ask the opinion - give your opinion -
express your agreement or disagreement
Writing: Descriptions
Grammar: Demonstrative adjectives- Prepositions- The verb 'must' to indicate
obligation and necessity in the present
Vocabulary: Seasons – Holidays-The city– Furniture
NOTE: The students are exposed to simple listening and reading activities.
REFERENCE BOOKS
COURSE OUTCOMES
UNIT –I:
Introduction: Network, Uses of Networks, Types of Networks, Reference Models: TCP/IP
Model, The OSI Model, Comparison of the OSI and TCP/IP reference model.
Physical Layer: Guided transmission media, Wireless transmission media, Switching
UNIT - II
Data Link Layer - Design issues, Error Detection & Correction, Elementary Data Link Layer
Protocols, Sliding window protocols
Multiple Access Protocols - ALOHA, CSMA, CSMA/CD, CSMA/CA, Collision free protocols,
Ethernet- Physical Layer, Ethernet Mac Sub layer.
UNIT - III
Network Layer: Network Layer Design issues, store and forward packet switching
connection less and connection oriented networks, routing algorithms: optimality principle,
shortest path, flooding, Distance Vector Routing, Count to Infinity Problem, Link State
Routing, Path Vector Routing, Hierarchical Routing; Congestion control algorithms,
IP addresses, CIDR, Sub netting, Super Netting, IPv4, Packet Fragmentation, IPv6 Protocol,
Transition from IPv4 to IPv6, ARP, RARP.
UNIT - IV
Transport Layer: Services provided to the upper layers elements of transport protocol,
addressing, connection establishment, Connection release, Error Control & Flow Control,
Crash Recovery.
The Internet Transport Protocols: UDP, Introduction to TCP, The TCP Service Model, The TCP
Segment Header, The Connection Establishment, The TCP Connection Release, The TCP
Sliding Window, The TCP Congestion Control Algorithm.
UNIT - V
Application Layer- Introduction, providing services, Applications layer paradigms: Client
server model, HTTP, E-mail, WWW, TELNET, DNS.
Components of LT Switchgear: Switch Fuse Unit (SFU), MCB, ELCB, Types of Wires and
Cables, Earthing. Elementary calculations for energy consumption and battery backup.
transform
TEXT BOOKS:
REFERENCE BOOKS:
COURSE OUTCOMES:
UNIT - I
Formal Language and Regular Expressions: Languages, Definition Languages regular
expressions, Finite Automata - DFA, NFA. Conversion of regular expression to NFA, NFA to
DFA. Context Free grammars and parsing, derivation, parse trees, Application of Finite
Automata.
UNIT - II
Introduction To Compiler, Phases of Compilation, ambiguity LL(K) grammars and LL(1)
parsing.
Bottom up parsing, Handle pruning, LR Grammar Parsing, LALR parsing, parsing ambiguous
grammars, YACC programming specification.
Semantics: Syntax directed translation, S-attributed and L-attributed grammars.
UNIT - III
Intermediate code - abstract syntax tree, translation of simple statements and control flow
statements.
Context Sensitive features -Chomsky hierarchy of languages and recognizers. Type checking,
type conversions, equivalence of type expressions, overloading of functions and
operations.
UNIT - IV
Run time storage: Storage organization, storage allocation strategies scope access to now
local names.
Code optimization: Principal sources of optimization, optimization of basic blocks, peephole
optimization.
UNIT - V
Code generation: Machine dependent code generation, object code forms, generic code
generation algorithm, Register allocation and assignment. Using DAG representation of
Block.
TEXT BOOKS:
1. Introduction to Theory of computation .Sipser, 2nd Edition, Thomson.
2. Compilers Principles, Techniques and Tools Aho, Ullman, Ravisethi, Pearson
Education.
REFERENCE BOOKS:
1. Modern Compiler Implementation in C- Andrew N. Apple, Cambridge University
Press.
2. Lex & yacc – John R. Levine, Tony Mason, Doug Brown, O’reilly
3. Modern Compiler Design- Dick Grune, Henry E. Bal, Cariel T. H. Jacobs,Wiley
dreamtech.
4. Engineering a Compiler-Cooper & Linda, Elsevier.
5. Compiler Construction, Louden, Thomson.
6. Introduction to Automat a Theory Languages and Computation”. Hopcroft H.E. and
Ullman J.D.Pearson Education.
COURSE OUTCOMES:
At the end of the course the students are able to:
UNIT –I:
Java Programming- History of Java, comments, Java Buzz words, Data types, Variables,
Constants, Scope and Lifetime of variables, Operators, Type conversion and casting,
Enumerated types, Control flow- block scope, conditional statements, loops, break and
continue statements, arrays, simple java stand alone programs, class, object, and its
methods constructors, methods, static fields and methods, access control, this reference,
overloading constructors, recursion, exploring string class, garbage collection
UNIT –II:
Inheritance – Inheritance types, super keyword, preventing inheritance: final classes and
methods.
Polymorphism – method overloading and method overriding, abstract classes and methods.
Interfaces- Interfaces Vs Abstract classes, defining an interface, implement interfaces,
accessing implementations through interface references, extending interface, inner class.
Packages- Defining, creating and accessing a package, importing packages.
UNIT-III:
Exception handling-Benefits of exception handling, the classification of exceptions -
exception hierarchy, checked exceptions and unchecked exceptions, usage of try, catch,
throw, throws and finally, creating own exception subclasses.
Multithreading – Differences between multiple processes and multiple threads, thread life
cycle, creating threads, interrupting threads, thread priorities,
REFERENCE BOOKS:
1. Java for Programmers, P.J.Deitel and H.M.Deitel, PEA (or) Java: How to Program ,
P.J.Deitel and H.M.Deitel,PHI
2. ObjectOrientedProgrammingthroughJava,P.RadhaKrishna,UniversitiesPress.
3. Thinking in Java, Bruce Eckel,PE
4. Programming in Java, S. Malhotra and S. Choudhary, Oxford Universities Press.
5. Design Patterns Erich Gamma, Richard Helm, Ralph Johnson and John Vlissides.
COURSE OUTCOMES:
An understanding and appreciation for the principles of object oriented analysis and
design in the construction maintainable programs which satisfy their requirements;
A competence to design, write, compile, test and execute straightforward programs
using a high level language.
An awareness of the need for a professional approach to design and the importance
of good documentation to the finished programs.
Be able to implement, compile, test and run Java programs comprising more than
oneclass, to address a particular software problem.
Able to develop applications using Applet, AWT, JDBC and Swings
1. To study the physical and logical database designs, database modeling, relational,
hierarchical, and network models
2. To understand and use data manipulation language to query, update, and manage a
database
3. To develop an understanding of essential DBMS concepts such as: database security,
integrity, concurrency, distributed database, and intelligent database, Client/Server
(Database Server), Data Warehousing.
4. To design and build a simple database system and demonstrate competence with
the fundamental tasks involved with modeling, designing, and implementing a
DBMS.
UNIT –I:
Database System Applications, Purpose of Database Systems, View of Data – Data
Abstraction –Instances and Schemas – Database Languages – database Access for
applications Programs – Database Users and Administrator – Transaction Management –
Database Architecture – Storage Manager – the Query Processor.
Data Models: Introduction to the Relational Model – Structure – Database Schema, Keys –
Schema Diagrams. Database design– Other Models, ER diagrams – ER Model - Entities,
Attributes and Entity sets – Relationships and Relationship sets – ER Design Issues – Concept
Design – Conceptual Design with relevant Examples. Relational Query Languages, Relational
Operations.
UNIT –II:
Relational Algebra – Selection and projection set operations – renaming – Joins – Division –
Examples of Algebra overviews – Relational calculus – Tuple Relational Calculus (TRC) –
Domain relational calculus (DRC).
Overview of the SQL Query Language – Basic Structure of SQL Queries, Set Operations,
Aggregate Functions – GROUPBY – HAVING, Nested Sub queries, Views, Triggers,
Procedures.
UNIT III:
Normalization – Introduction, Non loss decomposition and functional dependencies, First,
Second, and third normal forms – dependency preservation, Boyce/Codd normal form.
Higher Normal Forms - Introduction, Multi-valued dependencies and Fourth normal form,
Join dependencies and Fifth normal form
UNIT IV:
Transaction Concept- Transaction State- Implementation of Atomicity and Durability –
Concurrent Executions – Serializability- Recoverability – Implementation of Isolation –
Testing for serializability- Lock –Based Protocols – Timestamp Based Protocols- Validation-
Based Protocols – Multiple Granularity.
UNIT V:
Recovery and Atomicity – Log – Based Recovery – Recovery with Concurrent Transactions –
Check Points - Buffer Management – Failure with loss of nonvolatile storage.
TEXT BOOKS:
1. Database System Concepts, Silberschatz, Korth, McGraw hill, Sixth Edition.(All UNITS
except III th)
2. Database Management Systems, Raghu Ramakrishna, Johannes Gehrke, TATA
McGraw-Hill 3rd Edition.
REFERENCE BOOKS:
COURSE OUTCOMES:
OPEN ELECTIVE - I
UNIT –I:
Web Basics- Introduction, Concept of Internet- History of Internet, Protocols of Internet,
World Wide Web, URL, Web Server, Web Browser,HTML-Introduction HTML-Basic
Formatting Tags , HTML-Grouping Using Div Span, HTML-Lists,: HTML-Images, HTML-
Hyperlink, HTML-Table, HTML-Iframe,HTML – Form HTML – Headers, HTML-Miscellaneous
using tool Dreamweaver/ Visual studio
UNIT –II:
CSS –Introduction, Syntax, CSS-Selectors, CSS-Color Background Cursor, CSS-Text Fonts, CSS-
Lists Tables, CSS -Box Model, CSS-Display Positioning, CSS Floats. Using tool using tool
Dreamweaver/ Visual studio, Net Bean
UNIT-III:
Introduction of Java Script, JavaScript characteristics, Objects in Java Script, Dynamic HTML
with Java Script. XMLHttpRequest- Introduction, XMLHttpRequest, The XMLHttpRequest
Object, Events for the XMLHttpRequest Object, Request Object for XMLHttpRequest,
Response Object for XMLHttpRequest. Using tool using tool Visual studio, Net Bean &
Eclipse
UNIT –IV:
AJAX Introduction- Introduction, AJAX Introduction, AJAX Components, Handling Dynamic
HTML with Ajax, CSS to Define Look and Feel, Understand the XML Mark-up,
XMLHttpRequest. AJAX using XML and XML HttpRequest- Introduction, Ajax Using XML and
XMLHttpRequest, Accessing, Creating and Modifying XML Nodes, Loading XML Data into
anHTML Page, Receiving XML Responses, Handling Response XML. Using tool using tool
Visual studio, Net Bean & Eclipse
Unit V
PHP Introduction- PHP Introduction, Structure of PHP, PHP Functions, AJAX with PHP, PHP
Code and the Complete AJAX Example. AJAX with Database- Introduction, AJAX Database,
Working of AJAX with PHP, Ajax PHP Database Form, AJAX PHP MySQL Select Query. Using
tool using tool Visual studio, Net Bean & Eclipse
TEXT BOOKS:
REFERENCE BOOKS:
1. Internet and World Wide Web – How to program, Dietel and Nieto PHI/Pearson
2. Ajax: The Complete Reference By Thomas Powell
3. PHP: The Complete reference-steven Holzner Tata McGraw-Hill.
4. An Introduction to web Design and Programming –Wang-Thomson
5. Web Warrior Guide to Web Programming -Bai/Ekedaw-Thomas
6. Beginning Web Programming-Jon Duckett WROX
COURSE OUTCOMES:
Students will be able:
To design a web application.
To build creative style sheets using CSS
To write java scripts for web application.
To frame web template using Ajax
To associate AJAX with PHP
TEXT BOOKS:
REFERENCE BOOKS:
1. RaghuRamakrishnan,JohannesGehrke,―DatabaseManagementSystem‖, McGraw
Hill., 3rd Edition2007.
2. Elmasri&Navathe,‖Fundamentals of Database System,‖ Addison-Wesley Publishing,
5th Edition,2008.
3. Date.C.J,―AnIntroductiontoDatabase‖,Addison-WesleyPubCo,8th Edition,2006.
4. Peterrob, Carlos Coronel, ―Database Systems – Design, Implementation, and
Management‖, 9th Edition, Thomson Learning, 2009.
COURSE OUTCOMES:
UNIT –I:
INTRODUCTION: Overview and Benefits of ERP, ERP Related Technologies- Business Process
Reengineering (BPR), Online Analytical Processing (OLAP), Supply chain Management
(SCM). Applications of ERP.
UNIT II
ERP IMPLEMENTATION: Implementation and Product Lifecycle, Implementation
Methodology, Planning Evaluation and selection of ERP systems, Organizing the Project
Management and Monitoring. Case Study on Manufacturing.
UNIT III
ERP MODULES: Business modules in an ERP Package- Manufacturing, Human Resources,
Plant Maintenance, Materials Management, Data Warehousing, Data Mining, Quality
Management, Sales and Distribution. Case Study in Banking Sector.
UNIT IV
POST IMPLEMENTATION: Overview of ERP software solution. Maintenance of ERP-
Organizational and Industrial impact; Success and Failure factors of ERP Implementation.
Case Study of Success Story and Failure of Processing Sector.
UNIT V
EMERGING TRENDS IN ERP: Extended ERP system, ERP add–ons –Customer Relations
Management (CRM), Customer satisfaction (CS). Business analytics etc- Future trends in
REFERENCE BOOKS:
COURSE OUTCOMES:
COURSE OBJECTIVES:
UNIT – II
Trade Marks: Purpose and function of trademarks, Acquisition of trade mark rights,
transfer of rights, Selecting and evaluating trademark, registration of trademarks, claims.
Trade Secrets: Trade secret law, determination of trade secret status, liability for
misappropriation of trade secrets, trade secret litigation.
Geographical Indication of Goods: Basic aspects and need for the registration
UNIT – III
Copyrights: Fundamentals of copyright law, originality of material, right of
reproduction, right to perform the work publicly, copyright ownership issues, notice of
copyright.
Patents: Foundation of patent law, patent searching process, Basic Criteria of
Patentability
Industrial Designs: Kind of protection provided in Industrial design
UNIT – IV:
Managing IP Rights: Acquiring IP Rights: letters of instruction, joint collaboration
agreement, Protecting IP Rights: non disclosure agreement, cease and desist letter,
settlement memorandum. Transferring IP Rights: Assignment contract, license
agreement, deed of assignment
UNIT- V
Introduction to Cyber law: Information Technology Act, cyber crime and e-commerce,
data security, confidentiality, privacy, international aspects of computer and online
crime.
COURSE OUTCOMES:
TEXT BOOKS:
REFERENCES:
UNIT –I:
Basic Structure of Computers: Computer Types, Functional Units, Computer Registers, Basic
Operational Concepts, Bus Structures, Software, Performance, Multiprocessors and Multi
Computers. Data Representation: Fixed Point Representation, Floating – Point
Representation.
Register Transfer Language and Micro Operations: RTL- Register transfers, Bus and Memory
Transfers. Micro operations: Arithmetic, Logic, Shift micro operations, Arithmetic logic shift
unit.
UNIT –II:
Computer Arithmetic: Addition and Subtraction, Multiplication Algorithms, Division
Algorithms. Error detection and Correction Codes
Basic Computer Organization and Design: Instruction codes, Timing and Control, Computer
Instructions: Memory Reference Instructions, Register Transfer Instructions, Input
– Output Instructions, Instruction cycle. Interrupt and Interrupt cycle, Complete Computer
Description
UNIT-III:
Central Processing Unit organization: General Register Organization, Stack organization,
Instruction formats, Addressing Modes, Data Transfer and Manipulation, Program Control,
CISC and RISC processors.
Control Unit Design: Control Memory, Address sequencing, Design of CU: Micro
Programmed Control, Hardware Control, Micro Program example. Case Study- Introduction
to x86architecture.
UNIT –IV:
Memory Organization: Memory Hierarchy, Memory Interleaving, Main Memory-RAM and
ROM chips, Associative Memory-Hardware Organization, Match logic. Mapping functions-
Associate, Direct, Set Associative Mapping. Cache Memory: Hit Ratio, Cache Coherence,
Cache writes policies. Auxiliary memory: Magnetic Disks, Magnetic Tapes Optical devices,
Page Replacement Algorithms.
UNIT –V:
Input –Output Organization: Peripheral Devices, Input-Output Subsystems, I/O Device
Interface, I/O Processor, I/O Transfers–Program Controlled, Interrupt Driven, and DMA,
Interrupts and Exceptions. I/O Device Interfaces – SCII, USB.
Pipelining and Vector Processing: Basic Concepts, Instruction level Parallelism Throughput
and Speedup, Pipeline hazards. Vector Processing: Applications, an Example for Vector
Processing.
TEXT BOOKS:
REFERENCE BOOKS:
COURSE OUTCOMES:
Able to understand functional components and micro operations in a computer.
Able to understand arithmetic operations and computer instructions.
Able to understand CPU organization and design of control unit.
Able to understand the Memory organization.
Able to understand I/O Transfer and Parallel Processing.
UNIT –I:
Mathematical Logic: Statements and notations, connectives, well-formed formulas, truth
tables, tautology, equivalence implication; Normal forms: Disjunctive normal forms,
conjunctive normal forms, principle disjunctive normal forms, principle conjunctive normal
forms.
Predicates : Predicative logic, statement functions, variables and quantifiers, free and
bound variables, rules of inference, consistency, proof of contradiction, automatic theorem
proving.
UNIT –II:
Posets and Lattices : Relations and their properties, Properties of binary relations,
equivalence, compatibility and partial ordering relations, lattices, Hasse diagram; Functions-
Inverse function, composition of functions, recursive functions.
Lattices as partially ordered sets; Definition and examples, properties of lattices, sub
lattices, some special lattices.
UNIT-III:
Groups :Algebraic structure, Groupoid, Monoid, Semi groups, Group ,Sub groups,
Homomorphism and Isomorphism of groups.
Elementary Combinatorics : Basics of counting, The permutations, disarrangements,
combinations, permutations and combinations with repetitions, constrained repetitions,
the principal of Inclusion-Exclusion, Pigeon hole principle.
UNIT –IV:
Advanced Counting Techniques : Generating Function of Sequences, Recurrence relations,
Solving Recurrence Relations by substitution and Generating function ,The method of
Characteristic roots, Solutions of Inhomogeneous Recurrence Relations.
UNIT –V:
Graphs Theory : Introduction to Graphs ,Isomorphic graphs, Euler graphs, Hamiltonian
graphs, Planar graphs, Graph coloring, Directed graphs, Weighted digraphs, chromatic
numbers. Trees and their properties , Spanning trees, Directed trees, Binary trees Minimal
Spanning Trees.
TEXT BOOKS:
1. L. Liu, D. P. Mohapatra, ―Elements of Discrete Mathematics, Tata McGraw-Hill,
India, 3rdEdition,2008.
2. J. P. Tremblay, R. Manohar, Discrete Mathematical Structures with Applications to
Computer Science , Tata McGraw Hill, India, 1stEdition,1997.
3. JoeL.Mott, Abraham Kandel, Theodore P.Baker,―Discrete Mathematics for Computer
Scientists and Mathematicians, Prentice Hall of India Learning Private Limited, New
Delhi, India, 2nd Edition,2010.
REFERENCE BOOKS :
1. Kenneth H. Rosen, ―Discrete Mathematics and Its Applications, Tata Mcgraw-Hill,
New Delhi, India,6thEdition,2012.
2. Ralph P. Grimaldi, B. V. Ramana, ―Discrete and Combinatorial Mathematics - An
Applied Introduction, Pearson Education, India, 5thEdition,2011.
3. S. Malik, M. K. Sen, ―Discrete Mathematical Structures: Theory and Applications,
Thomson Course Technology, India, 1stEdition,2004.
COURSE OUTCOMES:
After learning the concepts of this paper the student will be able to
1. To prepare students to become familiar with the Standard Java technologies ofJ2SE
2. To prepare students to excel in Object Oriented programming and to succeed as a Java
Developer through global rigorous education.
3. To provide Students with a solid foundation in OOP fundamentals required to solve
programming problems and also to learn Advanced Java topics like J2ME, J2EE,
JSP,JavaScript
4. To inculcate in students professional and ethical attitude, multidisciplinary approach
and an ability to relate Java programming issues to broader application context.
5. To provide student with an academic environment aware of excellence, written ethical
codes and guidelines and lifelong learning needed for a successful professional career.
Write a Java program to find the Fibonacci series using recursive and non recursive
1.
functions
2. Write a Java program to multiply two given matrices.
Write a Java program for Method overloading and Constructor overloading
Write a Java program to display the employee details using Scanner class
3.
4. Write a Java program that checks whether a given string is palindrome or not
Write a Java program to represent Abstract class with example
5.
Write a Java program to implement Interface using extends keyword
Write a Java program to create user defined package
6. Write a Java program to create inner classes
Write a Java program for producer and consumer problem using Threads
Write a Java program that implements a multi-thread application that has three
8.
threads
12. Write a Java program for handling Mouse events and Key events
Write a Java program to connect to a database using JDBC and insert values into it
14.
Write a Java program to connect to a database using JDBC and delete values from it
15.
Write a Java program that works as a simple calculator. Use a Grid Layout to arrange
16. Buttons for digits and for the + - * % operations. Add a text field to display the result
COURSE OUTCOMES:
Upon successful completion of this course, the students will be able to:
Able to analyze the necessity for Object Oriented Programming paradigm and over
structured programming and become familiar with the fundamental concepts in OOP.
Demonstrate an ability to design and develop Java programs, analyze, and interpret
object oriented data and report results.
Demonstrate an ability to design an object oriented system, AWT components or
multithreaded process as per needs and specifications.
Demonstrate an ability to visualize and work on laboratory and multidisciplinary tasks
like console and windows applications both for standalone and Applets programs.
The above Process involves many steps like 1. Analyzing the problem and identifying the
Entities and Relationships, 2. E-R Model, 3. Relational Model 4. Normalization 5. Creating the
database 6. Querying. Students are supposed to work on these steps week wise and finally
create a complete "Database System" to Roadway Travels.
Relate the entities appropriately. Apply cardinalities for each relationship. Identify strong
entities and weak entities (if any). Indicate the type of relationships (total/partial).Try to
incorporate Generalization, Aggregation,
Specialization etc wherever required.
Note: The student is required to submit a document by drawing the E-R diagram to the lab
teacher.
Experiment 4: Normalization
Database normalization is a technique for designing relational database tables to minimize
duplication of information and, in so doing, to safeguard the database against certain types of
logical or structural problems, namely data anomalies. For example, when multiple instances of
a given piece of information occur in a table, the possibility exists that these instances will not
be kept consistent when the data within the table is updated, leading to a loss of data integrity.
A table that is sufficiently normalized is less vulnerable to problems of this kind, because its
structure reflects the basic assumptions for when multiple instances of the same information
should be represented by a single instance only For the above table in the First normalization
we can remove the multi valued attribute Ticket_id and place it in another table along with the
primary key of passenger.
First Normal Form: The above table can be divided into two tables as shown below.
Passenger Name Age Sex Address PassportID
Passport_id Ticket_id
You can do the second and third normal forms if required. Any how Normalized tables are
given at theend.
>show
collections
mycollectio
n
system.ind
exes
5.c) Installation ofNoSQL
and the value can be a JSON, BLOB(Binary Large Objects), string, etc.
Redis, Dynamo, Riak are some examples of key-value store DataBases. They are all
based on Amazon's Dynamo paper.
Column-based NoSQL databases are widely used to manage data warehouses,
business intelligence, CRM, Library card catalogs,
Document-Oriented:
Document-Oriented NoSQL DB stores and retrieves data as a key value pair but the value part
is
stored as a document. The document is stored in JSON or XML formats. The value is
understood by the DB and can be queried.
Graph-Based
A graph type database stores entities as well the relations amongst those entities. The
entity is stored as a node with the relationship as edges. An edge gives a relationship
In this week you are going to practice queries (along with sub queries) using
Display the number of days in a week on which the 9W01 bus is available.
Find number of tickets booked for each PNR_no using GROUP BY CLAUSE. Hint: Use GROUP
BY on PNR_No.
Find the distinct PNR numbers that are present.
Find the number of tickets booked by a passenger where the number of seats is greater
than 1.Hint: Use GROUP BY, WHERE and HAVING CLAUSES.
Find the total number of cancelled seats.
Eg: CREATE TRIGGER updcheck BEFORE UPDATE ON passenger FOR EACH ROW BEGIN
IF NEW.Tickent N0 > 60 THEN SET New.Tickent no = Ticket no; ELSE SET New.Ticket no = 0;
END IF;
END;
Experiment 11: Stored Procedures
In this session you are going to learn Creation of stored procedure, Execution of procedure
and modification of procedure. Practice procedures using the above database.
Eg: CREATE PROCEDURE myProc()
BEGIN
SELECT COUNT(Tickets) FROM Ticket WHERE age>=40; End;
REFERENCE BOOKS:
1. Introduction to SQL,Rick F.Vander Lans,Pearsoneducation..
2. Oracle PL/SQL, B.Rosenzweig and E.Silvestrova,Pearsoneducation.
3. Oracle PL/SQL Programming,StevenFeuerstein,SPD.
4. SQL&PL/SQLforOracle10g,BlackBook,Dr.P.S.Deshpande,DreamTech.
5. Ora cle D atab a se 11 g P L/S QL P ro gra m ming, M .M cLaughlin,TMH.
6. SQL Fundamentals, J.J.Patrick,PearsonEducation.
COURSE OUTCOMES:
The students will be able:
COURSE OBJECTIVES:
Unit 1
COURSE OUTCOMES