BTech (CSIT)
BTech (CSIT)
Bachelor of Technology
(Computer Science and Engineering/Information
Technology)
Curriculum Structure
BANASTHALI VIDYAPITH
P.O. BANASTHALI VIDYAPITH
(Rajasthan)-304022
July, 2019 69
2
No. F. 9-6/81-U.3
Government of India
Ministry of Education and Culture
(Department of Education)
NOTIFICATION
Sd/-
(M. R. Kolhatkar)
Joint Secretary of the Government of India
NOTICE
Changes in Bye-laws/Syllabi and Books may from time to time be
made by amendment or remaking, and a Candidate shall, except in
so far as the Vidyapith determines otherwise, comply with any
change that applies to years she has not completed at the time of
change.
© BANASTHALI VIDYAPITH
3
CONTENTS
Page
Sr.No. Curriculum Structure
No.
Bachelor of Technology (Computer Science and
1. 11
Engineering)
2. Bachelor of Technology (Information Technology) 16
Discipline Electives
1. Computer Vision 103
2. Distributed Computing 104
3. Digital Image Processing 106
4. Real Time Systems 107
5. Soft Computing 109
6. Internet of Things 110
7. Pattern Recognition 112
8. Geoinformatics 113
9. Modeling and Simulation 115
10. Robotics and Automation 116
11. Multimedia Systems 118
Reading Electives
1. Client-Server Computing and Applications 120
2. Parallel Computing 121
3. Electronic Commerce 122
4. Enterprise Resource Planning 123
5. IT in Bussiness 124
6. Agile Software Development 125
7. Organizational Behavior 126
8. Software as a Service 127
9. Blockchain 128
6
Programme Outcomes
A Computer Science Engineering graduate will achieve the following:
PO1. Engineering knowledge: Apply the knowledge of mathematics,
science, and computer science to the solution of computer science
engineering problems.
PO2. Problem analysis: Identify, formulate and develop solutions to
computational challenges.
PO3. Design/development of solutions: Design, implement and
evaluate computational systems and system components/processes
that meet the desired needs within realistic constraints.
PO4. Conduct investigations of complex problems: Use research-
based knowledge and methods including design of experiments,
analysis and interpretation of data, and synthesis of the
information to provide valid conclusions.
PO5. Modern tool usage: Select and apply appropriate techniques,
resources and engineering tools to engineering activities with an
understanding of their limitations.
PO6. The engineer and society: Understanding of professional, ethical,
legal, security and social issues and responsibilities relevant to the
professional engineering practice.
PO7. Environment and sustainability: Understand the impact of the
professional engineering solutions in societal and environmental
contexts, and demonstrate the knowledge for sustainable
development.
PO8. Ethics: Commit to professional ethics and responsibilities and
norms of the engineering practice.
PO9. Individual and team work: Function effectively as an individual
as well as a member or leader in diverse teams, and in
multidisciplinary settings.
PO10. Communication: Communicate effectively on engineering
activities with the engineering community and with the society at
large, work collaboratively and exhibit high levels of
professionalism.
PO11. Project management and finance: Demonstrate knowledge and
understanding of the engineering and management principles and
apply these to one’s own work, as a member and leader in a team,
to manage projects in multidisciplinary environments.
PO12. Life-long learning: Able to engage in independent and life-long
learning to adapt to the rapidly changing engineering scenario.
9
Programme Outcomes
An Information Technology graduate will achieve the following:
PO1. Engineering knowledge: Apply the knowledge of mathematics,
science, and computer science to the solution of computer science
engineering problems.
PO2. Problem analysis: Identify, formulate and develop solutions to
computational challenges.
PO3. Design/development of solutions: Design, implement and
evaluate computational systems and system components/processes
that meet the desired needs within realistic constraints.
PO4. Conduct investigations of complex problems: Use research-
based knowledge and methods including design of experiments,
analysis and interpretation of data, and synthesis of the
information to provide valid conclusions.
PO5. Modern tool usage: Select and apply appropriate techniques,
resources and engineering tools to engineering activities with an
understanding of their limitations.
PO6. The engineer and society: Understanding of professional, ethical,
legal, security and social issues and responsibilities relevant to the
professional engineering practice.
PO7. Environment and sustainability: Understand the impact of the
professional engineering solutions in societal and environmental
contexts, and demonstrate the knowledge for sustainable
development.
PO8. Ethics: Commit to professional ethics and responsibilities and
norms of the engineering practice.
PO9. Individual and team work: Function effectively as an individual
as well as a member or leader in diverse teams, and in
multidisciplinary settings.
PO10. Communication: Communicate effectively on engineering
activities with the engineering community and with the society at
large, work collaboratively and exhibit high levels of
professionalism.
PO11. Project management and finance: Demonstrate knowledge and
understanding of the engineering and management principles and
apply these to one’s own work, as a member and leader in a team,
to manage projects in multidisciplinary environments.
PO12. Life-long learning: Able to engage in independent and life-long
learning to adapt to the rapidly changing engineering scenario.
11
Semester – II
Course Code Course Name L T P C*
BVF 011/ lkekU; fgUnh / General English 2 0 0 2
BVF 014
Core Foundation Course-II 2 0 0 2
MATH 107/ Linear Algebra/Calculus 3 1 0 4
MATH 103
PHY 106/ Modern Physics/ Applied Optics 3 1 0 4
PHY 101
BIO 101/ Biology/Chemistry 3 1 0 4
CHEM 101
PHY 109/ Engineering Mechanics/ 3 1 0 4
CHE 102 Thermodynamics
EEE 101/ Electrical Engineering/Computer 4 0 0 4
CS 109 Fundamentals and Programming
EEE 101L/ Electrical Engineering Lab/Computer 0 0 4 2
CS 109L Fundamentals and Programming Lab
ENGG 103L/ Measurement Techniques Lab / 0 0 6 3
ENGG 101L Engineering Drawing and Graphics Lab
Semester Total: 20 4 10 29
12
Semester – III
Course Code Course Name L T P C*
Core Foundation Course - III 2 0 0 2
Elective Foundation Course - I 2 0 0 2
MATH 209/ Complex Variables/ Differential 3 1 0 4
MATH 210 Equations
ENGG 201/ Structure and Properties of Materials/ 4 0 0 4
ENGG 202 Basic Electronics
MATH 211 Introduction to Discrete Mathematics 3 1 0 4
CS 207 Computer Organization and 4 0 0 4
Architecture
CS 209 Data Structures 4 0 0 4
CS 209L Data Structures Lab 0 0 4 2
CS 212 Database Management System 4 0 0 4
CS 212L Database Management System Lab 0 0 4 2
Semester Total: 26 2 8 32
Semester - IV
Course Code Course Name L T P C*
Core Foundation Course - IV 2 0 0 2
Elective Foundation Course - II 2 0 0 2
MATH 210/ Differential Equations/ Complex 3 1 0 4
MATH 209 Variables
ENGG 202/ Basic Electronics/ 4 0 0 4
ENGG 201 Structure and Properties of Materials
CS 313 Software Engineering 4 0 0 4
CS 213 Design and Analysis of Algorithms 4 0 0 4
CS 213L Design and Analysis of Algorithms Lab 0 0 4 2
CS 214 Object Oriented Programming 4 0 0 4
CS 214L Object Oriented Programming Lab 0 0 4 2
CS 216 Systems Programming 4 0 0 4
Semester Total: 27 1 8 32
13
Semester - V
Course Code Course Name L T P C*
Vocational Course - I 2 0 0 2
Core Foundation Course - V/ 2 0 0 2
Elective Foundation Course - III
ECO 307/ Fundamentals of Economics/ 3 0 0 3
MGMT 310 Principles of Management
MATH 311/ Numerical Methods/ 3 1 0 4
STAT 204 Probability and Statistical Methods
CS 304 Java Programming 4 0 0 4
CS 304L Java Programming Lab 0 0 6 3
CS 302 Data Communication and Networks 4 0 0 4
CS 308 Operating Systems 4 0 0 4
CS 324L Operating Systems Lab 0 0 2 1
CS 312S Seminar 0 0 4 2
Semester Total: 22 1 12 29
Semester - VI
Course Code Course Name L T P C*
Vocational Course - II 2 0 0 2
Elective Foundation Course - III/ 2 0 0 2
Core Foundation Course - V
MGMT 310/ Principles of Management/ 3 0 0 3
ECO 307 Fundamentals of Economics
STAT 204/ Probability and Statistical 3 1 0 4
MATH 311 Methods/Numerical Methods
CS 315 Theory of Computation 4 0 0 4
CS 317 Artificial Intelligence and Machine 4 0 0 4
Learning
CS 317L Artificial Intelligence and Machine 0 0 4 2
Learning Lab
ELE 509 Microprocessors and Microcontrollers 4 0 0 4
ELE 306L Microprocessors and Microcontrollers Lab 0 0 2 1
CS 311P Project 0 0 8 4
Semester Total: 22 1 14 30
14
Semester - VII
Course Code Course Name L T P C*
CS 449P UIL Project 0 0 48 24
Reading Elective 0 0 0 2
Semester Total: 0 0 48 26
Semester - VIII
Course Code Course Name L T P C*
CS 405 Compiler Design 4 0 0 4
CS 439L Compiler Design Lab 0 0 2 1
CS 411 Computer Graphics 4 0 0 4
CS 411L Computer Graphics Lab 0 0 4 2
CS 508 Big Data Analytics 4 0 0 4
CS 508L Big Data Analytics Lab 0 0 6 3
Discipline Elective 4 0 0 4
Open Elective 4 0 0 4
Semester Total: 20 0 12 26
15
Semester – III
Course Code Course Name L T P C*
Core Foundation Course - III 2 0 0 2
Elective Foundation Course - I 2 0 0 2
MATH 209/ Complex Variables/ Differential 3 1 0 4
MATH 210 Equations
ENGG 201/ Structure and Properties of Materials/ 4 0 0 4
ENGG 202 Basic Electronics
MATH 211 Introduction to Discrete Mathematics 3 1 0 4
CS 207 Computer Organization and Architecture 4 0 0 4
CS 209 Data Structures 4 0 0 4
CS 209L Data Structures Lab 0 0 4 2
CS 212 Database Management System 4 0 0 4
CS 212L Database Management System Lab 0 0 4 2
Semester Total: 26 2 8 32
Semester - IV
Course Code Course Name L T P C*
Core Foundation Course - IV 2 0 0 2
Elective Foundation Course - II 2 0 0 2
MATH 210/ Differential Equations/ Complex 3 1 0 4
MATH 209 Variables
ENGG 202/ Basic Electronics/ 4 0 0 4
ENGG 201 Structure and Properties of Materials
CS 313 Software Engineering 4 0 0 4
CS 213 Design and Analysis of Algorithms 4 0 0 4
CS 213L Design and Analysis of Algorithms Lab 0 0 4 2
CS 214 Object Oriented Programming 4 0 0 4
CS 214L Object Oriented Programming Lab 0 0 4 2
CS 216 Systems Programming 4 0 0 4
Semester Total: 27 1 8 32
18
Semester - V
Course Code Course Name L T P C*
Vocational Course - I 2 0 0 2
Core Foundation Course - V/ 2 0 0 2
Elective Foundation Course - III
ECO 307/ Fundamentals of Economics/ 3 0 0 3
MGMT 310 Principles of Management
MATH 311/ Numerical Methods/ 3 1 0 4
STAT 204 Probability and Statistical Methods
CS 304 Java Programming 4 0 0 4
CS 304L Java Programming Lab 0 0 6 3
CS 302 Data Communication and Networks 4 0 0 4
CS 308 Operating Systems 4 0 0 4
CS 324L Operating Systems Lab 0 0 2 1
IT 303S Seminar 0 0 4 2
Semester Total: 22 1 12 29
Semester - VI
Course Code Course Name L T P C*
Vocational Course - II 2 0 0 2
Elective Foundation Course - III/ 2 0 0 2
Core Foundation Course - V
MGMT 310 / Principles of Management/ 3 0 0 3
ECO 307 Fundamentals of Economics
STAT 204/ Probability and Statistical 3 1 0 4
MATH 311 Methods/Numerical Methods
CS 315 Theory of Computation 4 0 0 4
CS 317 Artificial Intelligence and Machine 4 0 0 4
Learning
CS 317L Artificial Intelligence and Machine 0 0 4 2
Learning Lab
IT 302 Internet and Web Technology 4 0 0 4
IT 302L Internet and Web Technology Lab 0 0 4 2
CS 311P Project 0 0 8 4
Semester Total: 22 1 16 31
19
Semester - VII
Course Code Course Name L T P C*
CS 411 Computer Graphics 4 0 0 4
CS 411L Computer Graphics Lab 0 0 4 2
IT 410 Information Systems and Securities 4 0 0 4
IT 401 Data Mining and Warehousing 4 0 0 4
IT 401L Data Mining and Warehousing Lab 0 0 4 2
Discipline Elective 4 0 0 4
Open Elective 4 0 0 4
Semester Total: 20 0 8 24
Semester - VIII
Course Code Course Name L T P C*
IT 415P UIL Project 0 0 48 24
Reading Elective 0 0 0 2
Semester Total: 0 0 48 26
grading and GPi is the letter grade point obtained in the ith course. The
courses which are given Non-Letter Grades are not considered in the
calculation of SGPA.
The Cumulative Grade Point Average (CGPA) at the end of each semester
shall be computed as under:
Where n is the number of all the courses (with letter grading) that a student
has taken up to the previous semester.
Student shall be required to maintain a minimum of 4.00 CGPA at the end
of each semester. If a student's CGPA remains below 4.00 in two
consecutive semesters, then the student will be placed under probation and
the case will be referred to Academic Performance Review Committee
(APRC) which will decide the course load of the student for successive
semester till the student comes out of the probationary clause.
To clear a course of a degree program, a student should obtain letter grade
C and above. However, D/E grade in two/one of the courses throughout the
UG/PG degree program respectively shall be deemed to have cleared the
respective course(s). The excess of two/one D/E course(s) in UG/PG degree
program shall become the backlog course(s) and the student will be
required to repeat and clear them in successive semester(s) by obtaining
grade C or above.
After successfully clearing all the courses of the degree program, the
student shall be awarded division as per following table.
Division CGPA
Distinction 7.50 and above
First Division 6.00 to 7.49
Second Division 5.00 to 5.99
Pass 4.00 to 4.99
______
24
Detailed Syllabus
MATH 103 Calculus
Max. Marks : 100 L T P C
(CA: 40 + ESA: 60) 3 1 0 4
Learning Outcomes:
After successful completion of the course, students will be able to:
Define limit, infinite series and sequence of partial sums of an
infinite series, Convergence and Divergence of an infinite series.
Relate the limit of a function at a point to the limit of a sequence at
that point and tell when a function will fail to have a limit at a point.
Define monotonic functions and find a connection between
monotonicity of a function and derivative of a function.
Demonstrate the concept of Divergence, Curl, Green’s theorem,
Stokes’s theorem.
Section A
Sequences, series, test for convergence, power series, radius of
convergence; limit, continuity and differentiability (analytic definitions
with simple examples); Rolle’s Theorem, mean value theorem and Taylor’s
theorem; Successive differentiation: Leibnitz’ theorem (without proof).
Section B
Review of vectors, Cylinders and quadric surfaces, Vector functions of one
variable and their derivatives,Partial derivatives: Chain rule, exact
differentials, Gradient, Directional derivative, Tangent planes and normals,
Maxima and minima (two variables) including Lagrange’s multipliers,
Asymptotes and Curve tracing.
Section C
Riemann integral and the fundamental theorem of integral calculus,
Reduction Formulae, Multiple integrals, Applications to multiple integrals
to find length, area, surface area, volume, surface area of revolution,
Improper integral.
Vector fields, Surface integral, Line integral, Independence of path,
Conservative fields, Divergence, Curl, Green’s theorem, Stokes’s theorem.
Suggested Books:
1. Thomas, G.B., Weir, M.D., & Hass, J. (2011). Thomas’ Calculus
(11th ed.).Boston, MA: Pearson Education, Inc.
25
Section A
Vectors, Algebra of vectors, vector spaces, subspaces, Linear sum and
direct sum of subspaces, Linear combination, Linear span, Linear
dependence and independence of vectors and its properties. Basis and
dimension of vector space and subspace. Linear mappings, Kernel and
Range of linear mapping, Singular and non-singular mappings.
Section B
Linear operator, Algebra of linear operators, Invertible operators, Matrix
representation of a linear transformation, Change of basis, Range, rank and
Kernel, nullity of a matrix, Elementary transformations, Matrix inversion
with elementary transformations, Normal form of a matrix, System of linear
equations.
Section C
Characteristics polynomial of a matrix, Characteristics values,
Characteristics vector, Cayley-Hamilton theorem, Diagonalization of
Matrices, Properties of characteristic values and characteristic vectors of
Hermitian, skew-Hermitian, Unitary and Normal matrices (including
Symmetric, Skew-symmetric and Orthogonal matrices).
Inner product spaces, Orthogonality, Orthogonal sets and bases, Gram-
Schmidt orthogonalization process.
Suggested Books:
1. Axler, S. J. (1996). Linear algebra done right. New York: Springer.
2. Krishnamurthy, V., Mainra, V. P., & Arora, J. L. (1976). An
introduction to linear algebra. New Delhi: East-West Press.
3. Friedberg, S. H., Insel, A. J., Spence, L. E., & Thiel, L.
(2017). Linear algebra. Pearson Education.
4. Halmos, P. R. (2013). Linear Algebra Problem Book. Cambridge:
Cambridge University Press.
5. Kumaresan, S. (2000). Linear Algebra: A Geometric Approach. New
Delhi: Prentice-Hall (India).
Suggested E-Learning Material:
1. Lecture notes on linear Algebra
https://nptel.ac.in/downloads/111102011/
2. Videos on Linear Algebra topics
http://web.mit.edu/18.06/www/videos.shtml
27
NH3, H2O, H3O+, PCl5, SF4, CIF3, I3-, SF6, IF7, ICI2-, and POCl3; MO
theory, sigma, pi and delta molecular orbitals, homonuclear and
heteronuclear (CO and NO) diatomic molecules and their ions.
Section B
Electrochemistry:Electric transport in electrolytic solutions, specific
conductance and equivalent conductance, measurement of equivalent
conductance, variation of equivalent and specific conductance with dilution,
migration of ions and Kohlrausch law, Arrhenius theory of electrolyte
dissociation and its uses and limitations, Debye-Huckel-Onsager’s equation
for strong electrolytes (elementary treatment only), applications of
conductivity measurement: determination of degree of dissociation,
determination of Ka of acids, determination of solubility product of
sparingly soluble salt, conductometric titrations.
Phase Rule: Phase, component, degree of freedom or variance; phase
diagram of one-component system: -water system, sulphur system, CO2
system, phase rule for two-component system: - Pb-Ag system and its
applications, reduced phase rule, eutectic point.
Corrosion:Definition and its significance, Mechanisms of corrosion:
Chemical (Dry) corrosion and Electrochemical (Wet) corrosion, Protection
from corrosion: Protective coatings, cathodic protection, sacrificial anode
and modification in designs etc.
Section C
Water: Hardness of water, determination of hardness by Clark’s test and
Complex metric (EDTA) method, degree of hardness, numerical based on
hardness and EDTA method, Softening of water by Lime-Soda Method,
Permutit (Zeolite) Method and Deionization or Demineralization Method,
Boiler troubles their causes, disadvantages and prevention, Formation of
solids (Scale and Sludge), Carry over (Priming and Foaming), Corrosion
and Caustic Embrittlement, Advanced methods of water starelization,
Numerical problems based on Lime-Soda and Zeolite softening methods
Organic Electronic Materials: Including conducting polymers- poly (p-
phenylene), polythiophenes, Polyphenylenevinylenes, polypyroles,
polyaniline.
Optical Fibers- Introduction, properties, preparation, optical fiber grade
glass and uses.
Nano-chemistry- Introduction, Size dependent properties, Synthesis
(bottom-up and top-down method) and Applications of nanomaterials,
Future prospective of nanomaterials.
32
LIST OF EXPERIMENTS
1. Drawing sheet related to lettering.
2. Drawing sheet related to scale.
3. Drawing sheets related to conic sections.
4. Drawing sheets related to Engineering Curves.
5. Drawing sheet related to Projection of points.
6. Drawing sheet related to Projection of lines.
7. Drawing sheet related to orthographic projection by 1 st angle.
8. Drawing sheet related to orthographic projection by 3 rd angle.
Section B
Conformal map, Bilinear Transformation, Line integral in complex plane,
Cauchy's Integral theorem, Cauchy's integral formula, Derivative of
analytic functions, Power series, Taylor's series, Laurent series,
Section C
Singularities, Residue, Residue theorem and Evaluation of real integrals.
Fourier series, half-range expansions, Fourier integrals, Fourier transforms:
Fourier sine and cosine transform, Inverse Fourier transforms.
Suggested Books:
1. Kasana, H. S. (2005).Complex Variables: Theory and Applications
(2nd ed.). India, Delhi:PHI Learning Pvt. Ltd.
2. Ramana, B.V. (2015), Higher Engineering Mathematics (25th
ed.).India, Delhi: Tata McGraw Hill Co. Ltd.
3. Kreyszig, E. (2011). Advanced Engineering Mathematics (9thed.).
Hoboken, NJ : John Wiley & Sons, Inc.
Suggested E-Learning Material:
1. Complex Analysis
https://nptel.ac.in/courses/111103070/
Section A
Ordinary differential equation of the 1st order and 1st degree; Ordinary
linear differential equation of nth order- homogeneous and non-
homogeneous with constant coefficient; Euler Cauchy differential
equations, Variation of parameters, Methods of undetermined coefficients,
System of linear differential equations.
Section B
Power series solutions of ordinary differential equations, Frobenius
Method, Legendre equation and Legendre polynomials, Bessel equations
and Bessel functions of first and second kind.
Laplace transform and its properties; Convolutions, Inverse Laplace
transform, application of Laplace transform for solving ordinary differential
equations.
Section C
Partial differential equations of first order, homogeneous and non-
homogeneous linear partial differential equations with constant coefficients,
Classification of second order Partial differential equations; Solution of one
dimensional wave and heat equation, solution of Laplace equation
Suggested Books:
1. Ramana, B.V. (2017). Higher engineering mathematics. Mc Graw
Hill.
2. Kreyszig, E. (2005). Advance engineering mathematics. Wiley
Eastern.
3. Zill, D.G. (2013). A first course in differential equation with
modeling application. Cengage Learning.
Suggested E-Learning Material:
1. Differential Equations for Engineers
https://nptel.ac.in/courses/111106100/
2. Differential Equations
https://ocw.mit.edu/courses/mathematics/18-03-differential-
equations-spring-2010/
3. Differential Equations
https://freevideolectures.com/course/3302/differential-equations-i
4. Differential Equations
https://www.khanacademy.org/math/differential-equations
49
Emitter follower, Darlington pair, Miller theorem & its Dual, cascading
amplifier
Section C
Biasing and stabilization - Static & Dynamic, Bias stability, load line, Need
of stabilization, self-bias, fixed bias, emitter bias, feedback bias, Transistor
as an Inverter, brief introduction of different coupling techniques
FET- Pinch off, V-I characteristics, MOSFET- Depletion & Enhancement
type, Oscillators- Barkhausen criterion, phase shift oscillator, General form
of oscillator circuit - Colpitts, Hartley, Wein bridge, crystal oscillator
Suggested Books:
Section C
Pigeon hole Principle: Inclusion-Exclusion principle, Generating functions
and Discrete numeric functions, manipulation of numeric functions,
Asymptotic behavior of numeric function, Recurrence relations, Linear
recurrence relation with constant coefficients and their solutions,
Homogeneous solution, particular solution & total solutions, Solution by
the method of generating functions.
Suggested Books:
1. Rosen, K.H. (1999). Discrete Mathematics and it’s Applications.
McGraw Hil.
2. Liu, C.L. & Mohapatra, D. P. (2008). Elements of Discrete
Mathematics, Tata McGraw Hill.
3. Deo, N. (2004). Graph Theory. Prentice Hall of India, New Delhi.
4. Biggs, N.L. (1985). Discrete Mathematics. Oxford Science
Publication.
5. Koshy, T. (2005). Discrete Mathematics with Applications.
Academic Press.
Suggested E-Learning Material:
1. Rosen, K. H. (2011). Discrete mathematics and its applications.
New York: McGraw-Hill.
https://mathcs.clarku.edu/~djoyce/ma114/Rosen6E.pdf
2. Discrete Mathematical Structures
https://nptel.ac.in/courses/106106094/
Searching and Sorting: Linear search and Binary Search, Bubble sort,
Selection sort, Insertion sort, Quick sort, Radix sort.
Section B
Linked List: Linear, doubly or two way, circular, header and various
operations; Representation of polynomial using linked list, addition and
subtraction of polynomials. Dynamic implementation of stacks and queues.
Dynamic memory management: fixed and variable block storage, storage
techniques: first-fit, best-fit, worst-fit, next-fit; data compaction, and
garbage collection.
Section C
Non linear data structures: Tree concepts, General Tree, binary tree and
types, binary search tree, implementation of various operations on Binary
Search Tree (tree traversal, searching, insertion and deletion, counting leaf
and non-leaf nodes, height), Heap and heap sort, Balanced tree: concepts,
rotations, insertion and deletion.
Suggested Books:
1. Langsam, Y., Augenstein, M., & Tenenbaum, A. M. (1996). Data
Structures using C and C++. New Jersey: Prentice Hall.
2. Tremblay, J. P., & Sorenson, P. G. (1976). An introduction to data
structures with applications. New York: McGraw-Hill.
3. Horowitz, E., Sahni, S., & Anderson-Freed, S. (2008).
Fundamentals of data structures in C.Universities Press: Computer
Science.
4. Aho, A. V., Hopcroft, J. E., & Ullman, J. D. (1983). Data Structures
and algorithms. Addison Wesley Publishing Company.
Suggested E-Learning Material:
1. Programming and Data Structures
https://swayam.gov.in/course/1407-programming-and-data-structures
2. Data Structures and Program Methodology
https://nptel.ac.in/courses/106103069/
57
Section B
System Design: design concepts and principles (modularization,
abstraction, refinement, cohesion, and coupling), object oriented concepts:
class and object definitions, encapsulation, polymorphism, inheritance,
association, multiplicity, composition and aggregation, generalization,
specialization. Object Oriented Modelling using Unified Modelling
Language (UML): class diagrams, use case diagrams, sequence diagrams,
activity, and state diagrams. Implementation: language classes, coding
style, efficiency.
Section C
Software Quality Assurance: quality factors and criteria, SQA metrics, SQA
techniques. Verification and Validation: software testing methods (WBT,
BBT), software testing strategy (unit testing, integration testing, system,
testing), Maintenance: types of maintenance, software maintenance process,
maintainability, software reuse, re-engineering, reverse engineering, CASE.
Suggested Books:
1. Pressman, R. S. (2005). Software engineering: a practitioner's
approach. Palgrave Macmillan.
2. Jalote, P. (2012). An integrated approach to software engineering.
Springer Science & Business Media.
3. Godbole, N. S. (2004). Software quality assurance: Principles and
practice. Narosa Publications.
4. Sommerville, I. (2011). Software engineering. Boston: Pearson.
5. Fairley, R. (1985). Software engineering concepts. McGraw-Hill,
Inc.
6. Offutt, J., & Ammann, P. (2008). Introduction to software testing.
Cambridge: Cambridge University Press.
Suggested E-Learning Material:
1. Software Engineering
https://nptel.ac.in/courses/106101061/
2. Pressman, R. S. (2005). Software engineering: a practitioner's
approach. Palgrave Macmillan.
http://qiau.ac.ir/teacher/files/911610/13-11-1387-17-31-03.pdf
62
Suggested Books:
1. Horowitz, E., Sahni, S., & Rajsekran S. (2003). Fundamentals of
Computer Algorithms.Orient Black Swan.
2. Aho, A. V., Hopcroft J. E., & Ullman J. D. (2016). The Design and
Analysis of Computer Algorithms. Addison Wesley.
3. Cormen, T. H., Leiserson, C. E., Rivest, R. L., & Stein, C.
(2009). Introduction to algorithms. MIT press.
4. Berlioux, P., & Bizard, P. Algorithms - The Construction, Proof and
Analysis of Programs. Wiley.
5. Mehlhorn, K. (2013). Data structures and algorithms Vol. 1 & Vol.
2. Springer Science & Business Media.
Suggested E-Learning Material:
1. Design and Analysis of Algorithms
https://nptel.ac.in/courses/106101060/
2. Algorithms Specialization
https://www.coursera.org/specializations/algorithms
3. Cormen, T. H., Leiserson, C. E., Rivest, R. L., & Stein, C.
(2009). Introduction to algorithms. MIT press.
https://mcdtu.files.wordpress.com/2017/03/introduction-to-
algorithms-3rd-edition-sep-2010.pdf
Section B
Production function and Laws of Production.Optimal Input combination.
Cost concepts and cost output relationship.
Types of market structures; Determination of equilibrium price and output
under perfect competition.
Section C
Timevalue of Money and Project Evaluation: Interest Formulas; Cash Flow
Diagram; Principles of Economic Equivalance, Evaluation of Engineering
Projects using methods of Present Value and Internal Rate of Return.
Capital Budgeting: Concept and significance of capital budgeting.
Depreciation Analysis: Meaning and causes of depreciation; methods of
calculating depreciation – straightline and declining balance methods.
Recommended Books:
1. Thuesen. G.J., and Fabrycky, N.Engineering Economy, (9 ed) PHI
Learining Private Limited, New Delhi.
2. S. ParkChan: Contemporary Engineering Economics: 3rd Edition,
Prentice Hall.
3. M. Parkin: Economics: 5th Edition, Addison Wesley.
4. Mahendra P. Agasty: Engineering Economics and Costing, Second
Edition: Scitech Publications (India) Pvt. Ltd.
5. R. Panneerselvam: Engineering Economics, Tenth Printing: PHI
Learning Private Limited, New Delhi.
Suggested E-Learning Material:
1. Agrawal, D. (2017, Mar8). Indifference Curve. Retrieved from
Youtube:
https://www.youtube.com/watch?v=31_rYca4eio.
2. econ (2012). Cost, Retrieved from:
Guide:https://www2,econ.iastate,edu/classes/econ301/jintanakul/Not
es/Ch7.pdf
3. Khan, Y. (2014, Dec 18). Production Function. Retrieved from
Youtube:
https://www.youtube.com/watch?v=MwuTt3L2hEQ.
4. Bhogal, S. (2018, June 04). Income and Cross Elasticity. Retrieved
from Youtube:
https://www.youtube.com/watch?v=i7O4CriwwrY.
70
Suggested Books:
1. Johnson, R. A., Miller, I., & Freund, J. E. (2011). Probability and
Statistics for Engineers, Prentice Hall.
2. Goon, A. M., Gupta, B. D. & M. K. Gupta.(1980). Fundamental of
Statistics. (Vol. I & II).The World Press Pvt. Ltd. Kolkata.
3. Mood, A. M., Graybill, F. A., &Boes, D. C. (2001). Introduction to
Theory of Statistics (3rd ed.). McGraw- Hill International.
Suggested E-Learning Material:
1. Probability and Random variables
https://ocw.mit.edu/courses/mathematics/18-440-probability-and-
random-variables-spring-2014/lecture-notes/
2. Probability and Statistics
https://nptel.ac.in/courses/111105041/27
3. Statistical Inference
https://nptel.ac.in/courses/111105043/]
Suggested Books:
1. Tanenbaum, A. S. (2014). Computer networks. PHI
2. Stallings, W. (2007). Data and computer communications. Pearson
Education India.
3. Gupta, P. C. (2013). Data communications and computer networks.
PHI Learning Pvt. Ltd.
4. Kurose, J. F., & Ross, K. W. (2009). Computer networking: a top-
down approach.Pearson Education
5. Forouzan, A. B. (2007). Data communications & networking. Tata
McGraw-Hill Education.
Suggested E-Learning Material:
1. Computer Networking: A Top-Down Approach by James F. Kurose
and Keith W. Ross
https://www.bau.edu.jo/UserPortal/UserProfile/PostsAttach/10617_1
870_1.pdf
2. Data Communication by IIT Kharagpur
https://nptel.ac.in/courses/106105082/
Section A
History of operating systems, OS Functions, OS Goals, OS classification:
single user, multiuser, Batch Processing Operating System, Time Sharing,
Real Time Operating System (RTOS), Multiprogramming Operating
System, Multiprocessing System, Networking Operating System,
Distributed Operating System, Operating Systems for Embedded Devices,
Introduction to popular operating systems like UNIX, Windows, etc.
Process management: Process status, schedulers, scheduling algorithms,
Threads
Inter process communication: Process Synchronization, Critical Section
problem and its solutions, classical problems in concurrent programming.
Deadlock: Prevention, Avoidance, Detection and recovery.
Section B
Information Management: Management file supports, access methods,
allocation methods, contiguous, linked and indexed allocation, directory
system.
Memory management: swapping, paging and segmentation demand paging,
virtual memory, page replacement algorithms, working set model.
Secondary storage: Disks, disk space management, Scheduling algorithms.
Input/output: device controllers and device drivers, I/O processor
management: I/O scheduler.
Section C
Protection and Security - Accessibility and Capability Lists
Multiprocessor Systems: Bus-oriented System, Crossbar-connected System,
Hypercube System, Multistage Switch-based System
Parallel processing and distributed processing: concept, differences, OS.
Case study: Unix (History, Design principles, interface, file system, process
management, memory management, I/O management, vi editor, shell.
Suggested Books:
1. Godbole, A. S. (2005). Operating systems. Tata McGraw-Hill
Education.
2. Silberschatz, A., Gagne, G., & Galvin, P. B. (2018). Operating
system concepts. Wiley Publications.
3. Tanenbaum, A. S. (2009). Modern operating system. Pearson
Education, Inc.
80
15. Write a Lex code which return type of relational operator like
>,<,<=,>=,==
16. Write a Lex code to count escape sequences from C file
17. Write a Lex program to count the type of numbers
18. Write a Lex code to find longest word from the file
19. Write a Yacc code to check expressions are valid or not
20. Write a Yacc code to check given string is Keyword
21. Write a Yacc code to check variable declaration is correct or not like
type varname
22. Write a Yacc code for checking parenthesis
23. Write a Yacc code to check compound statements are valid or not
24. Write a Lex and Yacc code for a simple desk calculator
25. Write a Lex and Yacc code for arithmetic operations on float
variables
26. Write a Lex and Yacc code for checking if else statement from C file
(2 Labs)
27. Write a Lex and Yacc code for evaluating postfix expressions (2
Labs)
Section C
Understanding Hive, Hive Variables, Properties, Queries and Data Types.
Built in Functions in Hive. Working with Databases in Hive: Creating,
Viewing, Droping and Altering. Creating and Modifying Tables. Using Hive
DDL Statements and DML Statements. Executing HiveQL. Applying Joins,
Group By and Order By clauses.
Pig Architecture. Properties of Pig, Running Pig Programs, Working with
Operators in Pig, Working with Functions in Pig.
Suggested Books:
1. White, Tom. (2012). Hadoop: The definitive guide. O'Reilly Media,
Inc.
2. Miner, D. & Shook, A. (2012). MapReduce Design Patterns:
Building Effective Algorithms and Analytics for Hadoop and Other
Systems. O'Reilly Media, Inc.
3. Loshin, D. (2013). Big data analytics: from strategic planning to
enterprise integration with tools, techniques, NoSQL, and graph.
Elsevier.
Suggested E-Learning Material:
1. Big Data & Analytics by Kent State University
https://www.cs.kent.edu/~jin/BigData/index.html
2. Big Data Specialization by University of California San Diego
http://www.coursera.org/specializations/big-data
Section A
Foundations of Cryptography and Security, Ciphers and Secret Messages,
Security Attacks and Services, Mathematical Tools for Cryptography,
Substitutions and Permutations, Modular Arithmetic, Euclid’s Algorithm,
Conventional Symmetric Encryption Algorithms, Theory of Block Cipher
Design, DES and Triple DES, Modes of Operation (ECB, CBC, OFB,
CFB), Strength of DES, Modern Symmetric Encryption Algorithms, RC5
Stream Ciphers, One Time Pad, Cryptanalysis.
Section B
Public Key Cryptography, Prime Numbers and Primality testing, Factoring
Large Numbers, RSA, attacks on RSA, Diffie-Hellman, Algorithm, Public-
Key Cryptography Standards, Hashes and Message Digests, Message
Authentication, MD5, SHA, Digital Signatures, Certificates, Digital
Signature Standard (DSS and DSA),
Section C
Authentication of Systems, Kerberos (V4 and V5) and VeriSign, Electronic
Mail Security (Pretty Good Privacy, S/MIME), IPSec and Web Security,
Intrusion detection systems, Secure Sockets and Transport Layer (SSL and
TLS), Electronic Commerce Security, Secure Electronic Transaction (SET),
E-Cash (DigiCash), Digital Watermarking and Steganography.
Suggested Books:
1. William, S. (1999). Cryptography and network security: principles
and practice. Prentice-Hall, Inc.
2. Schneier, B. (2007). Applied cryptography: protocols, algorithms,
and source code in C. John wiley & sons.
3. Schneier, B. (2011). Secrets and lies: digital security in a networked
world. John Wiley & Sons.
Suggested E-Learning Material:
1. Introduction to Computer Security
https://www.cs.northwestern.edu/~ychen/classes/cs350-
w07/lectures.html
2. Cryptography and Network Security
https://nptel.ac.in/courses/106105031/
101
Suggested Books:
1. Han, J., Pei, J., & Kamber, M. (2011). Data mining: concepts and
techniques. Elsevier.
2. Roiger, R. J. (2017). Data mining: a tutorial-based primer. Chapman
and Hall/CRC.
3. Berry, M. J., & Linoff, G. S. (2009). Data mining techniques. John
Wiley & Sons.
4. Adriaans, P., & Zantinge, D. (2000). Data Mining. Addison Wesley.
Suggested E-Learning Material:
1. Data Mining
https://nptel.ac.in/courses/106105174/
2. Data Mining: Concepts and Techniques
https://hanj.cs.illinois.edu/bk3/bk3_slidesindex.htm
Discipline Electives
CS 441 Computer Vision
Max. Marks : 100 L T P C
(CA: 40 + ESA: 60) 4 0 0 4
Learning Outcomes:
After successful completion of the course students will be able to
Identify basic concepts, terminology, theories, models and methods
in the field of computer vision.
Describe basic methods of computer vision related to multi-scale
representation, edge detection and detection of other primitives,
stereo, motion and object recognition.
Assess which methods to use for solving a given problem, and
analyze the accuracy of the methods.
Section A
Introduction: Motivation, Introduction to Computer Vision and Image
Analysis, Human Eye, Camera model, CCD camera, Human colour
perception, Colour models.
Segmentation: Threshold based segmentation, Edge based segmentation,
Border detection, Hough transform, Region based segmentation, Watershed
segmentation, Evaluation issues in segmentation, Mean shift segmentation,
Active contour models, Level sets and Geodesic active contours, Optimal
single and multiple surface segmentation.
Section B
Shape Representation and Description: Region identification, Contour
based shape representation and description, Boundary description, B-
splines, Shape invariants, Moments, Shape classes.
Object Recognition: Classification principles, SVM, Neural nets, Syntactic
pattern recognition,
Image Understanding: Image understanding control strategies, Hierarchical
control, Bottom-up control, Model-based control, Classification based
segmentation, Contextual image classification, Scene labelling, Semantic
image segmentation, Hidden Markov models, Bayesian belief network.
Section C
3D Vision: Marr’s theory, Active and Purposive vision, A single
perspective camera, Camera Calibration from a known scene, Scene
reconstruction from multiple views, Two camera, Stereopsis, Relative
104
Section A
Introduction of IoT, M2M (Machine-to-Machine) towards IoT-the global
context, Differing Characteristics.
M2M to IoT – Introduction, Some Definitions, industrial structure for IoT,
architecture for conversion of M2M to IoT, design principles ,capabilities
of IoT, IoT architecture , standard protocol, IoT Architecture Reference
Model, Functional View, Information View, Deployment and Operational
View, Domain specific applications of IoT: Home automation, Industrial
applications, Surveillance applications, Other IoT applications
Section B
Introduction to concept of IoT devices, IoT devices versus computers, IoT
configurations, basic components, networking, sensors, introduction to
embedded systems Introduction to Arduino, types of Arduino, Arduino
toolchain, Arduino programming structure, Sketches, Pins, Input-output
from pins using sketches, Introduction to Arduino shields, Introduction to
Raspberry-Pi microcomputer Accessing GPIO pins, Sending and receiving
signals using GPIO pins
Section C
IoT Access Technologies: Physical and MAC layers, topology and Security
of IEEE 802.15.4, 802.15.4g, 802.15.4e, 1901.2a, 802.11ah and LoRaWAN
– Network Layer: IP versions, Constrained Nodes and Constrained
Networks – Optimizing IP for IoT: From 6LoWPAN to 6Lo, Routing over
Low Power and Lossy Networks – Application Transport Methods:
Supervisory Control and Data Acquisition – Application Layer Protocols:
CoAP and MQTT,Security in IoT protocols.
Suggested Books:
1. Holler, J., Tsiatsis, V., Mulligan, C., Karnouskos, S., Avesand, S., &
Boyle, D. (2014). Internet of Things. Academic Press.
2. Bahga, A., & Madisetti, V. (2014). Internet of Things: A hands-on
approach. Vpt.
3. DaCosta, F. (2014). Rethinking the Internet of Things: a scalable
approach to connecting everything. Apress.
Suggested E-Learning Material:
1. Introduction to Internet of Things
https://onlinecourses.nptel.ac.in/noc19_cs31
2. Introduction to the Internet of Things (IoT)
https://www.edx.org/course/introduction-to-the-internet-of-things-
iot-1
3. IoT Sensors and Devices
https://www.edx.org/course/sensors-and-devices-in-the-iot
112
Section C
Artificial Neural Networks: Biological Motivation, Gradient descent,
Multilayer networks, Back-Propagation algorithms, Hidden layer
representation, Example of Face recognition.
Non-Metric Methods: Recognition with Strings, String Matching.
Algorithm-Independent Machine Learning: No-Free Lunch Theorem, Bias
and Variance, Resampling for Estimation, Bagging and Boosting,
Estimation of Misclassification, Classifier Combination.
Suggested Books:
1. Bishop, C. M. (2006). Pattern recognition and machine learning.
Springer.
2. Duda, R. O., Hart, P. E., & Stork, D. G. (2012). Pattern
classification. John Wiley & Sons.
3. Theodoridis, S., & Koutroumbas, K. (2010). Pattern Recognition.
Academic Press, Inc.
Suggested E-Learning Material:
1. Introduction to Pattern Recognition
https://cedar.buffalo.edu/~srihari/CSE555/
2. Introduction to Pattern Recognition, Artificial Neural Networks,
and Machine Learning
http://www.cs.ucsb.edu/~yfwang/courses/c
RS 401 Geoinformatics
Max. Marks : 100 L T P C
(CA: 40 + ESA: 60) 4 0 0 4
Learning Outcomes:
After successful completion of the course students will be able to
Describe spatial database, Co-ordinate and projection system
Analyze vector and raster based analysis in Geographical
Information Sciences
Describe different types of satellite system and digital image
processing
Describe global cover based global position systems i.e. GPS,
GLONASS
Describe applications of remote sensing and GIS in natural resources
management
114
Section A
Geographical Information System: Definition, Components of GIS,
Hardware and software requirements for GIS, Coordinate system and
projections, Database structure and formats, Spatial data models - raster and
vector. Data inputting, Data base design - editing and topology creation.
Linkage between spatial and Non spatial data, Query (Attribute/Spatial),
Vector based analysis. Raster based analysis. Errors, Digital Elevation
Model, Network analysis, O’pen source and WebGIS.
Section B
Remote Sensing: Definition - components of remote sensing - energy
sensor, interacting body; Type - active and passive remote sensing. Satellite
System - meteorological, communication and remote sensing. Platforms -
aerial and space, synoptivity and repeativity. Electromagnetic Radiation
(EMR) - EMR spectrum- visible, infrared [IR) middle IR, thermal IR and
microwave. EMR interaction with earth surface material, radiance,
irradiance, incident, reflected, absorbed and transmitted energy, spectral
response pattern - spectral signature curves (water, soil and vegetation].
Digital Image Processing : Digital Image, Satellite Image - characteristics
and formats. Resolution - spatial, spectral, radiometric and temporal;
Introduction to rectification, enhancement; Classification - Unsupervised
and Supervised classification.
Section C
Global Positioning System: Global Navigation Satellite System (GNSS),
GPS, GLONASS, GALILEO, Segments - space, control, user, GPS
Satellite signals, sources of errors and corrections.
Applications of Remote Sensing and GIS:
Applications of GIS and Remote Sensing in resource management (forestry,
agriculture, urban telecommunication, transportation, water resources and
environment).
Suggested Books:
1. Lo, C. P., & Yeung, A. K. (2002). Concepts and techniques of
geographic information systems. Upper Saddle River, NJ: Prentice
Hall.
2. Ian, H. (2010). An introduction to geographical information systems.
Pearson Education India.
3. Joseph, G. (2005). Fundamentals of remote sensing. Universities
press.
115
Section A
Basic Concepts - Automation and Robotics – An over view of Robotics –
present and future applications – classification by coordinate system and
control system, Dynamic stabilization of Robotics.
Power Sources and Sensors- Hydraulic, Pneumatic and electric drivers –
Determination HP of motor and gearing ratio, variable speed arrangements,
Path Determination - Machinery Vision – Ranging – Laser – Acoustic,
Magnetic Fiber Optic and Tactile Sensor.
Section B
Manupulators - Construction of Manupulators, Manupulator Dynamic and
Force Control, Electronic and Pneumatic manupulators.
Acuators and Grippers - Pneumatic, Hydraulic Actuators, Stepper Motor
Control Circuits, End Effecter, Various types of Grippers, Design
consideration.
Differential transformation and manipulators, Jacobians –
problems.Dynamics: Lagrange – Euler and Newton – Euler formations –
Problems.
Section C
Kinematics - Forward and Inverse Kinematic Problems, Solutions of
Inverse Kinematic problems, Multiple Solution, Jacobian Work Envelop –
Hill Climbing Techniques.
Path Planning - Trajectory planning and avoidance of obstacles, path
planning, Skew motion, joint integrated motion – straight line motion –
Robot programming, languages and software packages.
Case Study - Multiple Robots – Machine Interface – Robots in
Manufacturing and Non-Manufacturing applications – Robot Cell Design
Selection of a Robot.
Suggested Books:
1. Groover,M. P.(2017). Industrial Robotics: Technology,
Programming, and Applications (2nded.). Pearson Education.
2. Niku, S. B. (2011). Introduction to Robotics (2nded.). Wiley.
3. Fu, K.S., Lee,C.S. G. &Gonzalez, R. (1987) . Robotics:
Control,Sensing, vision and intelligence. Tata McGraw-Hill
Education
4. Mittal, R.K.& Nagrath, I. J.(2018). Robotics and Control. Tata
McGraw-Hill Education.
118
Reading Electives
CS 404R Client Server Computing and Applications
Max. Marks : 100 L T P C
0 0 0 2
Learning Outcomes:
After successful completion of the course students will be able to
Understand real life application using client-server architecture.
Learn concepts of network and its usage in client-server model.
Design distributed database for various application.
Section A
Evolution of PC, Introduction to Local Area Network, PC LANS,
Mainframe Computers, PC Connected to mainframes.
Section B
Distributed Systems and database. Client Server Computing model, Client-
Server Hardware and software need, issues in Client Server Computing –
shared access, connectivity, security advantages of client server computing.
Examples UNIX & Windows NT.
Section C
Client Server Applications: Database Server Networks, Gateways, Video
Conferencing and multimedia applications. Client – server architectures:
segmentation, switched FDDI, Peer-to-Peer architecture.
Suggested Books:
1. Dewire, D. T. (1993). Client/server computing. McGraw-Hill, Inc.
2. Berson, A. (1992). Client-server architecture. McGraw-Hill.
3. Orfali, R., Harkey, D., & Edwards, J. (2007). Client/server survival
guide. John Wiley & Sons.
4. Trivedi, M. & Khanna M. Client Server Computing. Book Publishing
Co. Pvt. Ltd
121
IT 404R IT in Bussiness
Max. Marks : 100 L T P C
0 0 0 2
Learning Outcomes:
After successful completion of the course students will be able to
Understand the role of Information Technology in Management.
Develop strategies for corporate and management secotrs.
Understand the role of Information Technology in modern industry.
Section A
Business Drivers IT’s Competitive Potential.
Strategic Alignment.
Strategic Management and Competitive Strategy.
Incorporating Business Innovation into the Corporate IT Strategy.
'
125
Section B
Rethinking Business Through IT Developing a Competitive Strategy
Interorganization Information Systems Business–To–Business Systems
Electronic Commerce and Market Systems.
Forming a Corporate IT Strategy.
Developing an Information Architecture.
Section C
The Changing Role of IT in International Business.
The Changing Global IT Practices.
The Impact and Value of Information Technology in Competitive Strategy.
Changing the Focus of Strategy.
Trends Beyond 2000.
Suggested Books:
1. Callon, J. D. (1996).Competitive Advantage Through Information
Technology. McGraw – Hill.
2. Tapscott, D. (1996). The Digital Economy. McGraw–Hill.
Organizational Behavior
Max. Marks : 100 L T P C
0 0 0 2
Brief Description
After studying the course the students will be able to:
Understand and apply principles of organizational dynamics relating
to systems, culture, structure• and change processes
Develop critical analytical skills that will help them diagnose
situations pertaining to human behaviour and generate effective
solutions for the same.
Understand performance behaviour at individual and group levels.
Develop the ability to lead and motivate others to succeed.
Brief Course Outline
Introduction to Organizational Behaviour: Concept of Organizational
Behaviour (OB), History, Nature and scope of OB, Key elements in
OB, Inter-disciplinary contribution to OB, Managerial Roles
Individual Behaviour,
Values & Personality: Concept of Individual Differences, Values
commonly studied across culture, Fundamentals and Determinants of
Personality, Big Five Dimensions, Personality Theory, Personality
Traits
Learning & Perception : Fundamentals of Learning, Learning
Theories - Classical Conditioning Theory, Operant Conditioning
Theory, Social Learning Theory, Behaviour Modification, Definition
of Perception, Perceptual Process, Common Perceptual Errors
Motivation : Basic concept of Motivation, Theories of Motivation –
Maslow, Herzberg’s Two Factor Theory, ERG, McClelland, Equity
and Vroom’s Expectancy Theory
Leadership: Introduction, Leadership Theories - Trait Theories,
Behavioural Theories and Situational Theories
Group Dynamics : Defining and classifying groups, Stages of group
development, Group Properties – Roles, Norms, Status, Size and
Cohesiveness, Group Decision making
127
Software as a Service
Max. Marks : 100 L T P C
0 0 0 2
Brief Description
After studying the course the students will be able to:
Create more sophisticated apps by adding relationships between
models in apps and by enhancing their apps with JavaScript.
Learn about what happens after the apps are deployed to real users,
including how to monitor performance, identify and fix common
performance problems, and avoid compromising customer data.
Learn how to apply Agile techniques to enhance and refactor legacy
code, a critical skill for professional programmers.
Course Outline:
How to form, organize and manage small programming teams
Introduction to design patterns: what they are and how to recognize
opportunities to apply them
Using Rails for more advanced features like third-party
authentication and elegantly expressing design patterns that arise
frequently in SaaS.
128
Suggested Books:
1. Engineering Software as a Service (ELLS), Beta edition (0.10.1; 16-
April-2013), by Fox and Patterson
Suggested E-Learning Material:
1. https://www.edx.org/course/software-service-uc-berkeleyx-cs-169-
2x
Blockchain
Max. Marks : 100 L T P C
0 0 0 2
Brief Description
This course of the Blockchain provides a broad overview of the essential
concepts of blockchain technology – by initially exploring the
Bitcoin protocol followed by the Ethereum protocol – to lay the
foundation necessary for developing applications and programming.
Brief Course Outline
Basics of Ethereum blockchain, creating accounts, unlocking
accounts, concept of miners, transacting, transfer Ethers, and check
balances.
Learning decentralized peer-to-peer network, an immutable
distributed ledger and the trust model that defines a blockchain.
Explanation of the basic components of a blockchain (transaction,
block, block header, and the chain) its operations (verification,
validation, and consensus model) underlying algorithms, and
essentials of trust (hard fork and soft fork).
Content includes the hashing and cryptography foundations
indispensable to blockchain programming, which is the focus of two
subsequent specialization courses, Smart Contracts and
Decentralized Applications (Dapps).
Suggested E-Learning Material:
1. Blockchain
https://www.coursera.org/learn/blockchain-basics
____________