R20 I / IV - B.Tech. I - Semester COMPUTER SCIENCE & B

79
1 SAGI RAMA KRISHNAM RAJU ENGINEERING COLLEGE (AUTONOMOUS) (Affiliated to JNTUK, Kakinada), (Recognized by AICTE, New Delhi) Accredited by NAAC with ‘A’ Grade UG Programmes CE,CSE,ECE,EEE,IT & ME are Accredited by NBA Chinna Amiram, Bhimavaram-534204. (AP) Estd:1980 Note: *- Integrated course and its evaluation guide lines are mentioned in the Syllabus Regulation: R20 I / IV - B.Tech. I - Semester COMPUTER SCIENCE & BUSINESS SYSTEM SCHEME OF INSTRUCTION & EXAMINATION (With effect from 2020-21 admitted Batch onwards) Course Code Course Name Category Cr L T P Int. Marks Ext. Marks Total Marks B20 BS 1104 Discrete Mathematics BS 3 3 0 0 30 70 100 B20 BS 1105 Introductory Topics in Statistics, Probability & Calculus BS 3 3 0 0 30 70 100 B20 BS 1106 Fundamentals of Physics BS 3 3 0 0 30 70 100 * B20 EE 1103 Principles of Electrical Engineering ES 3 2 0 0 30 70 100 0 0 2 15 35 50 B20 CB 1101 Fundamentals of Computer Science & Programming ES 3 3 0 0 30 70 100 B20 HS 1102 Business Communication & Value Science - I Lab HS 1.5 0 0 3 15 35 50 B20 BS 1109 Fundamentals of Physics Lab BS 1.5 0 0 3 15 35 50 B20 CB 1102 Fundamentals of Computer Science & Programming Lab ES 1.5 0 0 3 15 35 50 TOTAL 19.5 14 0 11 210 490 700

Transcript of R20 I / IV - B.Tech. I - Semester COMPUTER SCIENCE & B

1

SAGI RAMA KRISHNAM RAJU ENGINEERING COLLEGE (AUTONOMOUS)

(Affiliated to JNTUK, Kakinada), (Recognized by AICTE, New Delhi) Accredited by NAAC with ‘A’ Grade

UG Programmes CE,CSE,ECE,EEE,IT & ME are Accredited by NBA Chinna Amiram, Bhimavaram-534204. (AP)

Estd:1980

Note: *- Integrated course and its evaluation guide lines are mentioned in the Syllabus

Regulation: R20 I / IV - B.Tech. I - Semester

COMPUTER SCIENCE & BUSINESS SYSTEM

SCHEME OF INSTRUCTION & EXAMINATION (With effect from 2020-21 admitted Batch onwards)

Course Code

Course Name Category Cr L T P Int.

Marks Ext.

Marks Total

Marks

B20 BS 1104

Discrete Mathematics BS 3 3 0 0 30 70 100

B20 BS 1105

Introductory Topics in Statistics, Probability & Calculus

BS 3 3 0 0 30 70 100

B20 BS 1106

Fundamentals of Physics BS 3 3 0 0 30 70 100

* B20 EE 1103

Principles of Electrical Engineering

ES 3 2 0 0 30 70 100

0 0 2 15 35 50

B20 CB 1101

Fundamentals of Computer Science & Programming

ES 3 3 0 0 30 70 100

B20 HS 1102

Business Communication & Value Science - I Lab

HS 1.5 0 0 3 15 35 50

B20 BS 1109

Fundamentals of Physics Lab

BS 1.5 0 0 3 15 35 50

B20 CB 1102

Fundamentals of Computer Science & Programming Lab

ES 1.5 0 0 3 15 35 50

TOTAL 19.5 14 0 11 210 490 700

2

Course Code Category L T P C I.M E.M. Exam B20BS1104 BS 3 -- -- 3 30 70 3 Hrs.

DISCRETE MATHEMATICS

(For CSBS) Course Objectives:Students are expected to learn 1. To check the validity of arguments by using basic connective and valid rules of inference. 2. To impart knowledge on Boolean algebra and their properties. 3. To observe various properties of sets and relations. 4. To know different algebraic structures and their properties. 5. To understand different counting Techniques. 6. To identify different graphs, isomorphism of graphs, paths, cycles and circuits.

Course Outcomes: After completion of the course, the student will be able to S.No Outcome K L

1 Translate the arguments using propositions and predicates to verify their validity. K3 2 Utilize Boolean expressions and their simplifications. K3 3 Make use of sets & relations in different functioning procedures. K3 4 Illustrate the properties of Groups, Rings, Fields. K3 5 Solve different counting problems and recurrence relations. K3 6 Apply graph theory techniques to solve some problems related to computer science. K3

SYLLABUS

UNIT-I (10Hrs)

Logic: Propositional calculus - propositions and connectives, syntax; Semantics – truthassignments and truth tables, validity and satisfiability, tautology; Adequate set of connectives; Equivalence and normal forms; Compactness and resolution; Formal reducibility - natural deduction system and axiom system; Soundness and completeness.

UNIT-II (08Hrs)

Boolean algebra: Introduction of Boolean algebra, truth table, basic logic gate, basic postulates of Boolean algebra, principle of duality, canonical form, Karnaugh map.

UNIT-III (10Hrs)

Abstract Algebra: Set, relations and their properties, binary operations, algebraic system, semi group, monoid, groups and their properties, subgroup, simple examples, ring – definition and example, field – definition and example.

UNIT-IV (10Hrs)

Combinatorics: Basic counting, balls and bins problems, generating functions, recurrence relations, Methods of solving recurrence relations, principle of mathematical induction, pigeonhole principle, principle of inclusion-exclusion and related problems.

UNIT-V (12 Hrs.)

Graph Theory:Graphs and digraphs, complement, isomorphism, connectedness and reachability,adjacency matrix, Eulerian paths and circuits in graphs and digraphs, Hamiltonian paths and circuits in graphs and tournaments, trees and their properties; Planar graphs, Euler’s formula, dual of a planer graph, independence number and clique number, chromatic number, statement of Four-color theorem.

3

Text Books:

1. Trembly J.P. & Manohar, Discrete Mathematical Structures with applications to computer science, 1/e, McGraw Hill Education, 2017.

2. I. N. Herstein, Topics in Algebra, 2/e, John Wiley and Sons, 1975. 3. M. Morris Mano,Digital Logic & Computer Design, 1/e, Pearson, 2004.

4. J. A. Bondy and U. S. R. Murty, Graph Theory with Applications, 5/e, Macmillan Press, London, 1982.

Reference Books:

1. Gilbert Strang, Introduction to linear algebra, 4/e, Wellesley-Cambridge Press, 2009. 2. R. A. Brualdi, Introductory Combinatorics, 1/e, North-Holland, New York, 1977.

3. N. Deo,Graph Theory with Applications to Engineering and Computer Science, 1/e, Prentice Hall, Englewood Cliffs, 2016.

4. E. Mendelsohn, Van-Nostrand,Introduction to Mathematical Logic,4/e, Chapman & Hall, London, 1957.

5. C. L. Liu, Elements of Discrete Mathematics, 2/e, McGraw Hill, New Delhi, 2011. 6. L. Zhongwan, Mathematical Logic for Computer Science, World Scientific, Singapore, 1989.

4

Code Category L T P C I.M E.M Exam B20BS1105 BS 3 -- -- 3 30 70 3 Hrs.

INTRODUCTORY TOPICS IN STATISTICS, PROBABILITY AND CALCULUS

(For CSBS)

Course Objectives:Students are expected to 1. Familiarize themselves with the foundations of statistical methods and their representation. 2 Get an idea of basic concepts of probability and their applications. 3 Know the concepts of Mathematical expectation and Moment generating function. 4 Learn various statistical measures of a few discrete distributions 5 Learn various statistical measures of a few continuous distributions 6 Gain knowledge of basic concepts of calculus as these concepts lay a strong foundation in

Engineering applications. Course Outcomes: After completion of the course, the student will be able to S.No Outcome K L

1 Understand the concepts of data science and their applications. K3 2 Make use of the concepts of probability and their applications. K3 3 Understand the concepts of Expectations and Moment generating function.

Apply discrete probability distributions. K3

4 Predict the discrete distribution suitable for the given data from its moments. K3 5 Predict the continuous distribution suitable for the given data from its moments K3 6 Understand the concepts of calculus and application of double integral. K3

SYLLABUS

UNIT-I (12 Hrs)

Introduction to Statistics: Definition of Statistics. Basic objectives. Applications in various branches of science with examples. Collection of Data: Internal and external data, Primary and secondary Data. Population and sample, Representative sample. Descriptive Statistics: Classification and tabulation of univariate data, graphical representation, Frequency curves. Central tendency (Mean, Median and Mode) and dispersion (S.D, M.D, Q.D and Range). Bivariate data. Summarization, marginal and conditional frequency distribution.

UNIT-II (10Hrs)

Probability: Concept of experiments, sample space, event. Classical definition of Probability, axiomatic approach. Addition and Multiplication laws of Probability Conditional Probability, Baye’s Theorem.

UNIT-III (12 Hrs)

Expected values and moments: Review of basic concepts of Random Variable (no questions may be set on review). Mathematical expectation and its properties, Moments (including variance) and their properties, interpretation, Moment generating function. Discrete Probability Distributions: Binomial, Poisson and Geometric distributions - Definition, Mean, Variance, moments, m.g.f., Characteristic function and applications.

5

UNIT-IV (12 Hrs)

Continuous Probability Distributions: Uniform Distribution-Mean, variance and moments. Normal Distribution- Mean, Variance, m.g.f., Characteristic function, Applications of Normal Distribution. Exponential Distribution- Mean, Variance and Memory less property of Exponential distribution. Chi-square, Student - t and F Distributions-Definition, Characteristics like mean, variance and applications (without proofs).

UNIT-V (12Hrs)

Multi variable calculus– Functions of two variables, Partial differentiation, Homogeneous functions, Total derivative, Jacobians, Maxima and Minima of functions two variables. Basic Concepts of Double integrals, change of variables, change of order of integration and applications of double integral to find Areasof plane regions.

Text Books:

1. Fundamentals of Mathematical Statistics by S. C. Gupta and V. K. Kapoor, Sultan Chand & Sons Publishers.

2. A. Goon, M. Gupta and B. Dasgupta, Fundamentals of Statistics, vol. I & II, 1/e, World Press,2013.

3. B. S. Grewal, Higher Engineering Mathematics, 44/e, Khanna Publication, Delhi,1965. 4 Introduction of Probability Models, S.M. Ross, 10/e, Academic Press, N.Y,2010.

Reference Books:

1. S.M. Ross, A first course in Probability,8/e, Prentice Hall, 2010. 2. I.R. Miller, J.E. Freund and R. Johnson, Probability and Statistics for Engineers, 9/e, PHI, 2017.

3. A.M. Mood, F.A. Graybill and D.C. Boes, Introduction to the Theory of Statistics, 3/e, McGraw Hill Education, 1973.

4. Peter V. O'Neil, Advanced Engineering Mathematics, 7/e, Thomson Learning, 2011 5. M. D. Greenberg, Advanced Engineering Mathematics, 2/e, Pearson Education, 2002. 6. P. N. Wartikar and J. N. Wartikar, Applied Mathematics, Vol. I & II, Vidyarthi Prakashan.

6

Code Category L T P C I.M E.M Exam B20BS1106 BS 3 -- -- 3 30 70 3 Hrs.

FUNDAMENTALS OF PHYSICS

(For CSBS) Course Objectives: 1. Teaches the fundamentals of oscillatory systems and the analogy of mechanical andelectrical

systems 2. Explains the wave optics phenomena of interference, diffraction and polarization 3. Delineates the fundamentals of quantum mechanics, crystallography and solid statePhysics 4. Describes the fundamentals of lasers and few commonly used lasers 5. Introduces the optical fibers and their applications 6 Introduces the three laws of thermodynamics and their applications to a heat engine

Course Outcomes:After completion of the course, the student will be able to S.No Outcome K L

1. Use the fundamentals of oscillatory systems and the analogy of mechanicaland electrical systems

K3

2. Use interference, diffraction and polarization in optical systems K3 3. Apply the fundamentals of quantum mechanics, crystallography and solidstate physics K3 4. Describe the working of a few commonly used lasers K3 5. Classify optical fibers and describe their applications K3 6 Use the three laws of thermodynamics and apply them to a heat engine K3

SYLLABUS

UNIT-I (9 Hrs)

Oscillations: Periodic motion-simple harmonic motion-characteristics of simple harmonic motion-vibration of simple spring-mass system, damped harmonic oscillator – heavy, critical and light damping, energy decay in a damped harmonic oscillator, forced oscillations and resonance in mechanical and electrical systems, quality factor.

UNIT-II (10 Hrs)

WaveOptics:Theoryofinterferencefringes-typesofInterference-Fresnel’sprism Newton’srings,Diffraction-twokindsofdiffraction-Differencebetweeninterference and diffraction- Fraunhofer diffraction at single slit, plane diffraction grating; temporal and spatial coherence; Polarization - concept of production of polarized beam of light from two SHM actingatrightangle;plane,ellipticalandcircularlypolarizedlight,Brewster’slaw,double refraction.

UNIT-III (10 Hrs)

Quantum Mechanics: Introduction-Planck’s quantum theory-Matter waves, de-Broglie wave length, Heisenberg’s Uncertainty principle, time-independent and time-dependent Schrödinger wave equation, physical significance of wave function, particle in a one dimensional potential well, Heisenberg picture. Crystallography: Basic terms-types of crystal systems, Bravais lattices, Miller indices, d-spacing, Atomic packing factor for SC, BCC, FCC and HCP structures. Solid State Physics: Conductor, Semiconductor and Insulator; Basic concept of Band theory.

7

UNIT-IV (10 Hrs)

Lasers and Fiber Optics: Einstein’s theory of matter-radiation interaction and A and B coefficients; amplification of light by population inversion, different types of lasers: Ruby, CO2 and Neodymium lasers; properties of laser beams: mono- chromaticity, coherence, directionality and brightness, laser speckles, applications of lasers in engineering. Fiber optics and applications, types of optical fibers.

UNIT-V (9 Hrs)

Thermodynamics: Zeroth law of thermodynamics, first law of thermodynamics, brief discussion on application of first law, second law of thermodynamics and concept of engine, entropy, change in entropy in reversible and irreversible processes, third law of thermodynamics.

Text Books:

1. A Beiser, Concepts of Modern Physics, 5/e, McGraw Hill International, 1995.

2. David Halliday, Robert Resnick and Jearl Walker, Fundamentals of Physics, 10/e, Wileyplus, 2013.

Reference Books:

1. AjoyGhatak, Optics, 5/e, Tata McGraw Hill, 2012. 2. Sears &Zemansky University Physics, Addison-Wesley. 3. Jenkins and White, Fundamentals of Optics, 3/e, McGraw-Hill, 1957.

e-Resources: 1. http://library.iiti.ac.in/

2. https://onlinecourses.nptel.ac.in/

8

Code Category L T P C I.M E.M Exam

B20EE1103 ES 2 -- 2 3 Theory: 30 Theory: 70 Theory: 3 Hrs.

Lab:15 Lab:35 Lab: 3 Hrs.

PRINCIPLES OF ELECTRICAL ENGINEERING (For CSBS)

Introduction: This course introduces the student, the fundamentals of electrical engineering concepts needed for future courses to be learned. The first three units cover the fundamentals of electric circuits, circuit laws and theorems. The next two units cover the principles of Electrostatic and electromagnetism with basics learning of single phase transformer and measurement of electrical quantities, electrical safety, and batteries. Course Objectives: Students are expected to 1. Study the basic DC and AC Electrical circuits and Understand the basic electrical laws and

Theorems. 2. Study the Sinusoidal steady state response for RL,RC,RLC series circuits and Determine the

parameters of iron core inductor. 3. Demonstrate the concepts of electrostatics and electromagnetism and Determine the performance of

single phase transformer. 4. Acquaint the knowledge about the measurement of electrical quantities and Determine single phase

AC power. 5. Demonstrate the concept of electrical safety.

Course Outcomes:After completion of the course, the student will be able to S.No Outcome KL

1 Apply Mesh and Nodal analysis to solve the circuits and conduct experiments to

verify Ohm’s law and Kirchhoff’s laws for electrical circuits.

K3,K4

2 Apply Network theorems and transformation techniques to solve DC circuits and conduct experiments to verifyNetwork theorems for given electrical circuits.

K3,K4

3 Calculate form factor, peak factor and determine power in AC circuits and conduct experiment to measure the power in AC circuit and determine the parameters of iron core inductor.

K3,K4

4 Apply the concepts of electrostatics and electromagnetism to understand the operation of capacitor and transformer and conduct the experiment to determine the performance of single phase transformer.

K3,K4

5 Understand and apply electrical safety measures while handling electrical equipment.

K3

SYLLABUS (Theory)

UNIT-I (10 Hrs)

Basic concepts of Electrical circuits: Concept of Potential difference, voltage, current, Fundamental linear passive and active elements to their functional current-voltage relation, voltage sources and current sources, ideal and practical sources, concept of dependent and independent sources, Kirchhoff-s laws and applications to network solutions using mesh and nodal analysis, Concept of work, power and energy.

9

UNIT-II (10 Hrs)

DC Circuits: Current-voltage relations of the electric network by mathematical equations to analyze the network (Thevenin’s theorem, Norton's Theorem, Maximum Power Transfer theorem), Superposition theorem. Simplifications of networks using series-parallel, Star/Delta transformation.

UNIT-III (10 Hrs)

AC Circuits: AC waveform definitions, form factor, peak factor, study of R-L, R-C,RLC series circuit, phasor representation in polar and rectangular form, concept of impedance, admittance, active, reactive, apparent and complex power, power factor. Introduction to 3 phase Balanced AC Circuits, voltage and current relations (Y-∆ connection)

UNIT-IV (10 Hrs)

Electrostatics and Electromagnetism: Electrostatic field, electric field strength, concept of permittivity in dielectrics, capacitors, capacitors in series and parallel, energy stored in capacitors, charging and discharging of capacitors. Magnetic field and Faraday's law, self and mutual inductance. Single phase transformer, principle of operation, EMF equation, voltageratio, current ratio, KVA rating, efficiency. Principle of batteries, types and applications.

UNIT-V (10 Hrs)

Measurements, Sensors and Safety: Introduction to measuring devices/sensors and transducers (Piezoelectric and thermo-couple) related to electrical signals, Elementary methods for the measurement of single-phase power. Electrical Wiring: Basic layout of the distribution system, necessity of earthing, types of earthing, Safety devices & system.

SYLLABUS ( Laboratory)

1. Verification of Kirchhoff's laws. 2. Ohm’s law and resistance of a filament lamp. 3. Verification of Superposition theorem. 4. Verification of Thevenin's theorem. 5. Verification of Norton’s theorem. 6. Verification of Maximum power transfer theorem. 7. Parameters of iron core inductor. 8. Sinusoidal steady state response of R-L-C series circuit. 9. Step Response of RC circuit.

10. Verification of line and phase voltage, line and phase current relationships in a three phase balanced star and delta connected circuits.

11. Load test on a single phase transformer. Text Books:

1. Fundamentals of Electric circuits, Charles K. Alexander & Matthew N. O. Sadiku, 5/e, McGraw-Hill Book Company Inc., 2013.

2. Basic Electrical Engineering, V. K. Mehta & Rohit Mehta 6/e, S. Chand and Company Ltd., New Delhi, 2012.

3. Dr.Patranabis, “Sensors and Transducers” Second edition, PHI publications, 2001 Reference Books:

1. William H. Hayt & Jack E. Kemmerly, Engineering Circuit Analysis, 8/e, McGraw-Hill Book

10

Company Inc., 2013.

2. Network Analysis, A Sudhakar & Shyam Mohan S Palli, 3/e, McGraw Hill Book Company Inc.,2015

3. T. K. Nagsarkar and M. S. Sukhija, Basic of Electrical Engineering, 2/e, Oxford University Press, 2011.

4. Basic Electrical Engineering, C L Wadhwa, 4/e, New Age International Publishers, 2007

Evaluation guidelines for the integrated course: The Student has to pass both theory and lab examinations separately in order to complete the Integrated Course. If the Student fails in either theory or lab, he/she has to reappear for both theory and lab in supplementary examinations. Student will be declared as pass only when he/she completes both theory and lab at the same time.

11

Code Category L T P C I.M E.M Exam B20CB1101 ES 3 -- -- 3 30 70 3 Hrs.

FUNDAMENTALS OF COMPUTER SCIENCE & PROGRAMMING

(For CSBS) Introduction: The course is designed to enable the student to develop logic and convert it into programs for problem solving. After the fundamentals of algorithms and flowcharts are introduced, the characteristics of imperative programming languages are taught with the C programming language. The course also lays down the foundation for working with the Unix operating system with basic file I/O and the make file utility. Course Objectives:

1. Introduce the student to algorithm development for problem solving 2. Familiarize the student with the modular approach to program design 3. Acquaint the student with various programming constructs in C language 4. Enable the student to convert logic into C language code 5. Familiarize the student with basic operations on files in the Unix environment.

Course Outcomes: After completion of the course, the student will be able to S.No Outcome KL

1 Develop the algorithms, Programs and draw flowcharts for solving Mathematical and Engineering problems using basic elements like variables, operators and expressions.

K4

2 Utilize control statements, Functions to develop structured and unstructured programs and apply code reusability with user defined functions.

K3

3 Develop programs using arrays and pointers to implement static and dynamic memory allocation.

K4

4 Design, implement, test and debug programs that use Structures and I/O operations. K4 5 Develop C programs for simple applications using files K4

SYLLABUS

UNIT-I (8 Hrs)

General problem-solving concepts: Algorithm, and Flowchart for problem solving with Sequential Logic Structure, Decisions and Loops. Imperative languages: Introduction to imperative language; syntax and constructs of a specific language (ANSI C) Types Operator and Expressions with discussion of variable naming and Hungarian Notation: Variable Names, Data Type and Sizes (Little Endian Big Endian), Constants, Declarations, Arithmetic Operators, Relational Operators, Logical Operators, Type Conversion, Increment Decrement Operators, Bitwise Operators, Assignment Operators and Expressions, Precedence and Order of Evaluation, proper variable naming and Hungarian Notation.

UNIT-II (8 Hrs)

Control Flow with discussion on structured and unstructured programming: Statements and Blocks, If-Else-If, Switch, Loops – while, do, for, break and continue, goto Labels, structured and unstructured programming. Functions and Program Structure with discussion on standard library: Basics of

12

functions, parameter passing and returning type, C main return as integer, External, Auto, Local, Static, Register Variables, Scope Rules, Block structure, Initialization, Recursion, Preprocessor, Standard Library Functions and return types.

UNIT-III (8 Hrs)

Pointers and Arrays: Pointers and address, Pointers and Function Arguments, Pointers and Arrays, Address Arithmetic, character Pointers and Functions, Pointer Arrays, Pointer to Pointer, Multi- dimensional array and Row/column major formats, Initialization of Pointer Arrays, Command line arguments, Pointer to functions, complicated declarations and how they are evaluated.

UNIT-IV (8 Hrs)

Structures: Basic Structures, Structures and Functions, Array of structures, Pointer of structures, Self- referral Structures, Table look-up, Typedef, Unions, Bit-fields. Input and Output: Standard I/O, Formatted Output – printf, formatted Input – scanf, Variable length argument list.

UNIT-V (8 Hrs)

File: file access including FILE structure, fopen, stdin, stdout and stderr, Error Handling including exit, perror and error.h, Line I/O, related miscellaneous functions. Unix system Interface: File Descriptor, Low level I/O – read and write, Open, create, close and unlink, Random access – lseek, Discussions on Listing Directory, Storage allocator. Programming Method: Debugging, Macro, User Defined Header, User Defined Library Function, make file utility.

Text Books:

1. B. W. Kernighan and D. M. Ritchi, “The C Programming Language”, 2/e, Prentice Hall, 1988. 2. B. Gottfried, “Programming in C”, Schaum Outline Series, 2/e, McGraw-Hill Education, 1996.

Reference Books:

1. Herbert Schildt, “C: The Complete Reference”, 4/e, McGraw Hill, 2017. 2. YashavantKanetkar, “Let Us C”, 15/e,BPB Publications, 2016.

13

Code Category L T P C I.M E.M Exam B20HS1102 HS -- -- 3 1.5 15 35 3 Hrs.

BUSINESS COMMUNICATION & VALUE SCIENCE - I LAB

(For CSBS) Course Objectives: 1. To understand what life skills are and their importance in leading a happy and well-adjusted life 2. To motivate students to look within and create a better version of self 3. To introduce them to key concepts of values, life skills and business communication

Course Outcomes: After completion of the course, the student will be able to

S. No Outcome KL 1 Recognize the need for life skills and values K2 2 Recognize own strengths and opportunities K2 3 Apply the life skills to different situations K3 4 Understand the basic tenets of communication K2 5 Apply the basic communication practices in different types of communication K3

SYLLABUS

Exercise-1

Overview of LOL (include activity on introducing self) Class activity – presentation on favorite cricket captain in IPL and the skills and values they demonstrate Self-work with immersion – interview a maid, watchman, sweeper, cab driver, beggar and narrate what you think are the values that drive them

Exercise-2 Activity: Write a newspaper report on an IPL match Activity: Record a conversation between a celebrity and an interviewer Quiz Time, Self-awareness – identity, body awareness, stress management

Exercise-3

Essential Grammar – I: Refresher on Parts of Speech – Listen to an audio clip and note down the different parts of speech followed by discussion Tenses: Applications of tenses in Functional Grammar – Take a quiz and then discuss Sentence formation (general & Technical), Common errors, Voices. Show sequence from film where a character uses wrong sentence structure (e.g. Zindagi Na MilegiDobara where the characters use ‘the’ before every word)

Exercise-4

Communication Skills: Overview of Communication Skills, Barriers of communication, Effective communication Types of communication- verbal and non – verbal – Role-play based learning Importance of Questioning, Listening Skills: Law of nature- Importance of listening skills, Difference between listening and hearing, Types of listening.

Exercise-5 Expressing self, connecting with emotions, visualizing and experiencing purpose Activity: Skit based on communication skills Evaluation on Listening skills – listen to recording and answer questions based on them

Exercise-6 Email writing: Formal and informal emails, activity Verbal communication: Pronunciation, clarity of speech

14

Exercies-7

Vocabulary Enrichment: Exposure to words from General Service List (GSL) by West, Academic word list (AWL) technical specific terms related to the field of technology, phrases, idioms, significant abbreviations formal business vocabulary – Read Economic Times, Reader’s Digest, National Geographic and take part in a GD, using the words you learnt/liked from the articles. Group discussion using words learnt. Practice: Toastmaster style Table Topics speech with evaluation

Exercise-8

Written Communication: Summary writing, story writing Build your CV – start writing your comprehensive CV including every achievement in your life, no format, no page limit Project: Create a podcast on a topic that will interest college students Life skill: Stress management, working with rhythm and balance, colours, and teamwork

Exercise-9 Understanding Life Skills: Movie based learning – Pursuit of Happiness. What are the skills and values you can identify, what can you relate to? Introduction to life skills: What are the critical life skills

Exercise-10 Life skill: Community service – work with an NGO and make a presentation Life skill: Join a trek – Values to be learned: Leadership, teamwork, dealing with ambiguity, managing stress, motivating people, creativity, result orientation.

Text Books:

1. There are no prescribed texts for Semester 1 Reference Books:

1 English vocabulary in use – Alan Mc’carthy and O’dell 2 APAART: Speak Well 1 (English language and communication) 3 APAART: Speak Well 2 (Soft Skills) 4 Business Communication – Dr. Saroj Hiremath

Web References:

1 Train your mind to perform under pressure- Simon sinek https://curiosity.com/videos/simon-sinek-on-training-your-mind-to-perform- under pressure-capture-your-flag/

2 Brilliant way one CEO rallied his team in the middle of layoffs https://www.inc.com/video/simon-sinek-explains-why-you-should-put-people-beforenumbers.html

3 Will Smith's Top Ten rules for success https://www.youtube.com/watch?v=bBsT9omTeh0 Online Resources:

1 https://www.coursera.org/learn/learning-how-to-learn 2 https://www.coursera.org/specializations/effective-business-communication

15

Code Category L T P C I.M E.M Exam B20BS1109 BS -- -- 3 1.5 15 35 3 Hrs.

FUNDAMENTALS OF PHYSICS LAB

(For CSBS) Course Objectives: 1. To gain practical knowledge by applying the experimental methods to correlate with the Physics

theory. 2. Communicate their ideas effectively, both orally and in writing; and function effectively in

multidisciplinary teams. 3. To give skills that can transfer critical thinking into problem solving methods, how to identify

what data is important, how to collect that data and then draw conclusions from it. 4. To learn the usage of electrical and optical systems for various measurements. Course Outcomes: After completion of the course, the student will be able to S. No Outcome KL

1. Describe the various procedures and techniques for the experiments. K2 2. Develop design/problem solving skills, practical experience through laboratory

assignments which provide opportunities for developing team in multidisciplinary environments.

K2

3 Recognize and describe to test the optical components using principles of interference, diffraction, laser & optical fiber parameters.

K3

4 Applytheanalyticaltechniquesandgraphicalanalysistotheexperimental data. K3

LIST OF EXPERIMENTS 1 Magnetic field along the axis of current carrying coil – Stewart and Gee 2 Verification of laws of series and parallel combinations of resistances using Carey-foster’s bridge 3 To Study the Characteristics of PN Junction diode.

4 To determine the numerical aperture of a given optical fiber and hence to find its acceptance angle

5 To determine the energy gap of a semiconductor. 6 Tocalculatewavelengthsofprominentlinesusingdiffractiongratingnormalincidence. 7 Determination of wave length of light by Newton’s rings method 8 Determination of diameter of thin wire/thickness of paper piece using wedge method 9 Determination of Plank constant.

10 Determination of the frequency of the AC supply – AC Sonometer.

Reference Books: 1. Ajoy Ghatak, Optics, 5/e, Tata McGraw Hill, 2012.

2. Sears & Zemansky University Physics, Addison-Wesley. 3. Jenkins and White, Fundamentals of Optics, 3/e, McGraw-Hill, 1957.

e-Resources:

1. https://vlab.amrita.edu/

16

Code Category L T P C I.M E.M Exam B20CB1102 BS -- -- 3 1.5 15 35 3 Hrs.

FUNDAMENTALS OF COMPUTER SCIENCE & PROGRAMMING LAB

(For CSBS) Course Objectives:

1. Introduce the student to algorithm development for problem solving 2. Familiarize the student with the modular approach to program design 3. Acquaint the student with various programming constructs in C language 4. Enable the student to convert logic into C language code 5. Familiarize the student with basic operations on files in the Unix environment.

Course Outcomes: After completion of the course, the student will be able to S.No Outcome KL

1. Design the algorithms and draw flowcharts for the given mathematical and engineering problems.

K4

2. Write computer programs for the given algorithm K4 3. Design programs with the relevant control structure and parameter passing using

functions and derived data types. K4

4. Create and use header files and C pre-processor directive as utility K5 5. Use Pattern searching and parsing strategies in problem solving K3

LIST OF EXPERIMENTS

1. Introducing Raptor tool for drawing flow charts for Problem Solving. 2. Structured code writing with: a Small but tricky codes b Proper parameter passing c Command line Arguments d Variable parameter e Pointer to functions f User defined header g Make file utility h Multi file program and user defined libraries i Interesting substring matching / searching programs j Parsing related assignments

Reference Books:

1. Herbert Schildt, “C: The Complete Reference”, 4/e, McGraw Hill, 2017. 2. Yashavant Kanetkar, “Let Us C”, 15/e,BPB Publications, 2016.

17

Note: *- Integrated course and its evaluation guide lines are mentioned in the Syllabus

Regulation: R20 I / IV - B.Tech. II - Semester

COMPUTER SCIENCE & BUSINESS SYSTEM

SCHEME OF INSTRUCTION & EXAMINATION (With effect from 2020-21 admitted Batch onwards)

Course Code

Course Name Category Cr L T P Int.

Marks Ext.

Marks Total

Marks

B20 BS 1205

Linear Algebra BS 3 3 0 0 30 70 100

B20 BS 1206

Statistical Methods BS 3 3 0 0 30 70 100

* B20 EC 1201

Principles of Electronics Engineering

ES 3 2 0 0 30 70 100

0 0 2 15 35 50

B20 CB 1201

Data Structures and Algorithms

ES 3 3 0 0 30 70 100

B20 HS 1201

Fundamentals of Economics

HS 3 3 0 0 30 70 100

B20 BS 1209

Statistical Methods Lab BS 1.5 0 0 3 15 35 50

B20 CB 1202

Data Structures and Algorithms Lab

EC 1.5 0 0 3 15 35 50

B20 HS 1203

Business Communication & Value Science – II

HS 1.5 0 0 3 15 35 50

B20 MC 1201

Environmental Science MC 0 2 0 0 -- -- --

B20 MC 1203

National Service Scheme (NSS)

MC 0 0 0 2 -- -- --

TOTAL 19.5 16 0 13 210 490 700

18

Code Category L T P C I.M E.M Exam B20BS1205 BS 3 1 -- 4 30 70 3 Hrs.

LINEAR ALGEBRA

(For CSBS) Course Objectives: Students are expected to learn

1 Concepts of linear algebra and methods of solution of linear simultaneous algebraicequations. 2 LU Decomposition method and Solving Systems of Linear Equations. 3 Dimension, Basis, Orthogonality and Projectionsin Vector spaces 4 Gram-Schmidt orthogonalization and QR decomposition Methods 5 Eigen values, Eigen vectors and Linear Transformations 6 Singular value decomposition and Principal component analysis

Course Outcomes: After completion of the course, the student will be able to S.No Outcome Knowledge

Level 1 Apply knowledge of basics of Matrices, Determinants and to test for consistency

and solve systems of equation K3

2 Determine Rank of Matrix and apply LU Decomposition Method K3 3 Describe Vector Space, Orthogonality and Projection. K3 4 Apply Gram-Schmidt orthogonalization and QR decomposition methods K3 5 Calculate Eigen values and Eigen Vectors and Linear Transformations K3 6 Describe Singular value decomposition and Principal component analysis with

certain applications K3

SYLLABUS

UNIT-I (10 Hrs)

Introduction to Matrices, Determinants, Solution of Linear Equations by Triangle method, Cramer's rule and Gaussian elimination; Inverse of a Matrix by Gauss – Jorda n method.

UNIT-II (12Hrs)

Vectors and linear combinations; Rank of a matrix by Gaussian elimination; Solving Systems of Linear Equations using LU Decomposition andGauss Seidel methods

UNIT-III (12Hrs)

Vector space; Dimension; Basis; Orthogonality; Projections; Gram-Schmidt Orthogonalization and QR decomposition.

UNIT-IV (12Hrs)

Eigen Values and Eigen Vectors; Linear transformations: vector space of L.T., properties of Linear operator, Rank and Nullity of L.T.; Hermitian and unitary matrices.

UNIT-V (10Hrs)

Singular value decomposition and Principal component analysis; Introduction to their applications in Image Processing and Machine Learning.

Text Books: 1. Advanced Engineering Mathematics, Erwin Kreyszig,John Wiley & Sons, 10th Edition 2. Introduction to linear algebra, (Fifth Edition), Gilbert Strang, Wellesley-Cambridge Press.

19

3. Higher Engineering Mathematics, B. S. Grewal, Khanna Publishers.

Reference Books: 1. Advanced Engineering Mathematics, (Second Edition), Michael. D. Greenberg, Pearson. 2 Advanced Engineering Mathematics, (Seventh Edition), Peter V. O'Neil, Cengage Learning. 3 Linear Algebra, M. L. Kanna, Jai Prakash nath& Co, Meerut

4. Applied Mathematics (Vol. I & II), P. N. Wartikar& J. N. Wartikar, Pune Vidyarthi GrihaPrakashan.

5. Digital Image Processing, R C Gonzalez and R E Woods, Pearson. 6. Linear Algebraand Optimizationfor MachineLearning, Charu C. Aggarwal, Springer Publication

20

Code Category L T P C I.M E.M Exam

B20BS1206 BS 3 -- -- 3 30 70 3 Hrs.

STATISTICAL METHODS (For CSBS)

Course Objectives: Students are expected to

1 Get familiarized to different Correlation and linear regression methods. 2 Learn various sampling techniques and to find the sampling distribution to the given sample data. 3 Know how to fit best curve using method of least squares to the given data by various curve fitting

models. 4 Learn the concept of estimation and get familiar with the use of maximum likelihood estimation

method 5 Know how to design and conduct experiments by ANOVA and forecast the data by various models

in time series. 6 Learn how to test the hypothesis for non parametric data.

Course Outcomes: After completion of the course, the student will be able to S.No Outcome K L

1 Apply different Correlation and linear regression methods. K3 2 Illustrate sampling techniques and generate a sampling distribution to the given

sample data. K3

3 Understand the concept of Method of least squares and apply it to fit various types of curves.

K3

4 Make use of the concepts of estimation and predict the maximum likelihood estimate from the given model.

K3

5 Apply ANOVA techniques and forecasting methods to the given time series data. K3 6 Make use of testing of hypothesis and its applications to the non-parametric data. K3

SYLLABUS

UNIT-I (10 Hrs)

Linear Statistical Models: Scatter diagram. Correlation, Types of correlation, correlation coefficient, properties of correlation coefficient (without proofs), Rank correlation, Linear regression, Multiple regression & multiple correlation.

UNIT-II (10 Hrs)

Sampling Techniques: Types of sampling- Random sampling. Sampling from finite and infinite populations. Parameter, statistic, sampling distribution and standard error (sampling with replacement and sampling without replacement), Sampling distribution of sample mean (σ known) and variance. Sampling distribution of differences and sums.

UNIT-III (12 Hrs)

Curve fitting by Least squares method-Fitting of straight line, second degree polynomial, power and exponential curves. Estimation: Point estimation, criteria for good estimates (un-biasedness, consistency), Interval estimation, Methods of estimation - maximum likelihood estimation. Sufficient Statistic: Concept & examples, complete sufficiency, their application in

21

estimation.

UNIT-IV (12 Hrs)

ANOVA: Analysis of Variance (one-way classification), Analysis of Variance (two-way classification). Basics of Time Series Analysis & Forecasting: Stationary, ARIMA Models: Identification, Estimation and Forecasting.

UNIT-V (12 Hrs)

Test of hypothesis: Concept & formulation, Type I and Type II errors, Neyman Pearson lemma (without proof), Procedures of testing of hypothesis. Non-parametric Inference: Comparison with parametric inference, Use of order statistics. Sign test, Wilcoxon signed rank test, Mann-Whitney test, Run test, Kolmogorov-Smirnov test. Spearman’s and Kendall’s test. Tolerance region.

Text Books:

1. Probability & Statistics for Engineers & Scientists, Ronald E. Walpole, Raymond H. Myers, Sharon L. Myers, Keying Ye, 9th Edition, Prentice Hall

2. Probability and Statistics for Engineers (Fourth Edition), I.R. Miller, J.E. Freund and R. Johnson, Prentice Hall India Learning Private Limited.

3. Fundamentals of Mathematical Statistics by S. C. Gupta and V. K. Kapoor, Sultan Chand & Sons Publishers.

Reference Books:

1. Introduction to Time Series Analysis and Forecasting, Douglas C. Montgomery, Cheryl L. Jennings, Murat Kulahci, Wiley Publications, 2011A.

2. Fundamentals of Statistics, Goon, M. Gupta and B. Dasgupta, vol. I & II, 1/e, World Press,2013. 3. Advanced Engineering Mathematics, Erwin Kreyszig, John Wiley & Sons, 10th Edition 4. Introduction of Probability Models, S.M. Ross, 10/e, Academic Press, N.Y,2010. 5. Higher engineering mathematics, B V Ramana, MC Graw Hill Education publications.

Data Sources: 1. www.rbi.org.in

22

Code Category L T P C I.M E.M Exam

B20EC1201 ES 2 -- 2 3 Theory: 30 Theory: 70 Theory: 3 Hrs.

Lab:15 Lab:35 Lab: 3 Hrs.

PRINCIPLES OF ELECTRONICS ENGINEERING (For CSBS)

Course Objectives: Students are expected to learn The fundamental concepts, operation & applications in both theoretical and practical approach of Analog electronic devices & circuits and also the basics of Digital electronic circuit elements. Course Outcomes:After completion of the course, the student will be able to S.No Outcome K L

1 Understand the basics of semiconductors with respect to current carrying capability and the operation of diode, diode circuits and rectifiers and practically study and analyze characteristics of PN junction diode, Zener diode and rectifier circuits.

K3

2 Explain the structure & operation of BJT, JFET and MOSFET devices as well as amplifier circuits and analyze characteristics of BJT and FET amplifiers practically.

K3

3 Understand the principles of feedback, its advantages & disadvantages and Explain the properties &practically understand the applications of an operational amplifier.

K3

4 Explain the difference between analog and digital signals and implement basic digital system operations at component level by designing combinational and sequential logic circuits and test their operations.

K4

SYLLABUS (Theory)

UNIT-I (8 Hrs)

Semiconductors: Electrical properties, Energy band theory of solids, Fermi levels, Properties & energy band diagrams of Conductors, Semiconductors & insulators, Intrinsic & extrinsic semiconductors, P-type and N-type semiconductors, Mobility and conductivity, Dependence of conductivity on temperature, Drift & diffusion currents and their densities.

UNIT-II (8 Hrs)

Diodes: Formation of P-N junction & depletion zone, Energy band diagram, Built-in-potential, Forward and reverse biased P-N junction, V-I characteristics, Zener diode and its reverse characteristics. Diode Circuits: Half-wave & Full-wave Bridge Rectifiers, PIV, DC voltage and current, Ripple factor, Efficiency &Zener diode as a voltage regulator.

UNIT-III (8 Hrs)

Bipolar Junction Transistor (Simple theory only): BJT introduction, Principle of construction & operation, PNP & NPN transistors, Basic transistor action, CE, CB, CC configurations, Input and Output characteristics, Active, cut-off and saturation modes of operation, Transistor Biasing: Fixed bias & Self bias, Transistor as an Amplifier & Switch. Field Effect Transistors (Simple theory only): JFET structure & operation, Characteristics and parameters, MOSFETs, Depletion and Enhancement types, Basic Principles of CMOS, FET advantages & applications.

UNIT-IV (8 Hrs)

Principles of Feedback Amplifiers, Oscillators and Operational Amplifiers (Simple theory, concepts & block diagram description only): Feedback concept, Advantages,

23

Positive and negative feedback, Loop gain, Feedback factor, Topologies of feedback amplifier, Effect of negative feedback on gain, Effect of positive feedback: Instability and oscillation, Condition of oscillation, Barkhausen criteria. Introduction to integrated circuits, Operational amplifier (OPAMP) parameters & terminal properties, OP-AMP Applications: Inverting and non-inverting Amplifiers, Difference amplifier, Adders &subtractors, Comparator, Integrator, Differentiator, OP-AMP RC phase shift oscillator

UNIT-V (8 Hrs)

Digital Electronics Fundamentals: Difference between analog and digital signals, Number systems: Binary, Decimal, Octal, Hexa-decimal and conversions, Logic gates & ICs, Half & Full adder/subtractor, 2x1 & 4x1 Multiplexers, Demultiplexer, Flip-flops: SR, T, D flip-flops, Simple shift registers & counters.

SYLLABUS (Laboratory) (Hardware & Simulation Expts: 2+4)

1 V-I characteristics of a P-N junction (or Zener) diode 2 Half wave Rectifier operation and parameter calculation. 3 BJT (JFET) Characteristics in CE (CS) configuration 4 OP-AMP Applications: Inverting & Non-inverting amplifiers 5 OP-AMP Applications: Square wave generator (or RC phase shift oscillator) 6 Verification of basic Logic gates operation 7 Verification of Half/Full Adder and Half subtractor 8 Verification of Flip-flops operation 9 Verification of Shift register (or Counter) operation

10 Design & verification of a Binary to Gray code converter Text Books:

1. Electronic Devices and Circuit Theory, Robert L. Boylestad, Louis Nashelsky. 2. Electronic Principles, Albert Paul Malvino. 3. Digital Logic & Computer Design, M. Morris Mano, Pearson

Reference Books:

1. Microelectronics Circuits, Adel S.Sedra and Kenneth Carless Smith, Oxford University Press

2. Millmans’s Integrated Electronics, Jacob Milliman, Christos Halkias, Chetan Parikh, McGRaw Hill Education.

3. Electronics Circuits: Discrete & Integrated, D Schilling C Belove T Apelewicz R Saccardi. 4. Microelectronics, Jacob Milliman, Arvin Grabel. 5. Solid State Electronic Devices, 6th Edition, Ben Streetman, Sanjay Banerjee 6. Electronics Devices & Circuits, S. Salivahanan, N. Suresh Kumar, A. Vallavaraj

Evaluation guidelines for the integrated course: The Student has to pass both theory and lab examinations separately in order to complete the Integrated Course. If the Student fails in either theory or lab, he/she has to reappear for both theory and lab in supplementary examinations. Student will be declared as pass only when he/she completes both theory and lab at the same time.

24

Code Category L T P C I.M E.M Exam B20CB1201 ES 3 -- -- 3 30 70 3 Hrs.

DATA STRUCTURES AND ALGORITHMS

(For CSBS) Course Objectives: The student who successfully completes this course will have:

1 The understanding of different parameters to analyze the performance of algorithms 2 The understanding of linear data structures such as stack, queue and their applications. 3 The understanding of non-linear data structures such as trees, graphs and their applications. 4 The familiarity with various sorting, searching and hashing techniques and their performance

comparison. Course Outcomes:After completion of the course, the student will be able to S. No Outcome KL

1 Identify different parameters to analyse the performance of algorithms and implement linear data structures.

K3

2 Design algorithms to perform operations with Non Linear data structures. K4 3 Illustrate different techniques for searching and sorting for given data. K3

4 Understand the concepts of files and implement accessing schemes on data structure.

K3

SYLLABUS

UNIT-I (10 Hrs)

Basic Terminologies and Introduction to Algorithm & Data Organization: Algorithm specification, Recursion, Performance analysis, Asymptotic Notation - The Big-O, Omega and Theta notation, Programming Style, Refinement of Coding - Time-Space Trade Off, Testing, Data Abstraction

UNIT-II (10 Hrs)

Linear Data Structure: Array, Stack, Queue, Linked-list and its types, Various Representations, Operations & Applications of Linear Data Structures

UNIT-III (12 Hrs)

Non-linear Data Structure: Trees (Binary Tree, Threaded Binary Tree, Binary Search Tree, B & B+ Tree, AVL Tree, Splay Tree) and Graphs (Directed, Undirected), Various Representations, Operations & Applications of Non-Linear Data Structures.

UNIT-IV (12 Hrs)

Searching and Sorting on Various Data Structures: Sequential Search, Binary Search, Comparison Trees, Breadth First Search, Depth First Search Insertion Sort, Selection Sort, Shell Sort, Divide and Conquer Sort, Merge Sort, Quick Sort, Heap sort, Introduction to Hashing

UNIT-V (12 Hrs)

File: Organization (Sequential, Direct, Indexed Sequential, Hashed) and various types of accessing schemes. Graph: Basic Terminologies and Representations, Graph search and traversal algorithms and complexity analysis.

25

Text Books: 1. Fundamentals of Data Structures, E. Horowitz, S. Sahni,S. A-Freed, Universities Press. 2. Data Structures and Algorithms, A. V. Aho, J. E. Hopperoft, J. D.UIlman, Pearson.

Reference Books:

1. The Art of Computer Programming: Volume 1: Fundamental Algorithms, Donald E. Knuth.

2. Introduction to Algorithms, Thomas, H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein, The MIT Press.

26

Code Category L T P C I.M E.M Exam B20HS1201 HS 3 -- -- 3 30 70 3 Hrs.

FUNDAMENTALS OF ECONOMICS

(For CSBS) Course Objectives: The objective of this course is to introduce the fundamental concepts in Economics and make the Students familiarize about the concepts of Micro Economics and Macro Economics. Course Outcomes: After completion of the course, the student will be able to S.No Outcome KL

1 Understand the definitions of Economics and the classification of Economics. K2 2 Prepare Schedules of Demand, Supply and able to predict Demand. K3 3 Explain the importance of Welfare Analysis and Utility Analysis. K2 4 Describe the Production theory, Cost Analysis and Market Structures. K2 5 Analyse the role of Government in the economy and identify Government policies. K3 6 Discuss the impact of Macro Economics on the economy. K2

SYLLABUS

UNIT-I (8 Hrs)

Nature of Economics: Definitions of Economics- Wealth, Welfare and Scarcity; Classification of subject matter of Economics- Micro and Macro Economics. Demand Analysis : Definition, Law of Demand and its limitations; Demand Schedule, Demand Curve; Elasticity of Demand - Definition: Types of Elasticity and their practical importance. Demand Forecasting: Types, Objectives and Purpose of Forecasting; Methods of demand Forecasting: Survey and Opinion methods; Forecasting demand for new products. Supply Analysis: Meaning of Supply, Law of Supply and Supply function; Factors influencing change in Supply.

UNIT-II (8 Hrs)

Welfare Analysis: Definition of Welfare Economics, deference between positive economics and welfare economics. Utility Analysis: Meaning, Law of Diminishing Marginal Utility and its assumptions, exceptions and importance. Indifference Curve Analysis: Assumptions, Schedule and Map, Properties or Characteristics of Indifference Curves; Uses, importance and application value of Indifference Curves.

UNIT-III (8 Hrs)

Theory of Production: Meaning of production, Assumptions of Production Function–Use of production function in decision making. Cost Analysis: Fixed Cost, Variable Cost, Marginal Cost, Average Cost, Short Run Cost, Long Run Cost; Cost-Output relationship in Short Run and Long Run. Market Structures: Classification of Markets; Salient Features of Perfect Competition, Monopoly, Duopoly, Oligopoly and Monopolistic Competition.

27

UNIT-IV (8 Hrs)

Macro Economics: Definitions of National Income; Concepts of National Income GNP, NNP, NI,PI, DI; Measurement of National Income -Production method, Income method and expenditure method. Public Finance: Public Revenue-Taxes, Classification of taxes; Public expenditure-Importance and causes of increase in public expenditure. Inflation-Definition, Causes, Control of inflation- Monetary, Fiscal and non- monetary measures.

UNIT-V (8 Hrs)

Money – Definitions, Functions of money; Essentials of good money, demand for money and supply of money. Trade Cycles- Meaning of Trade cycles, Phases of a trade cycle, The Cobweb theory of Trade cycle , Remedial Measures of trade cycles- Monetary and Fiscal Policies.

Text Books:

1. Microeconomics , Pindyck,Robert S., and Daniel L.Rubinfeld 2. Macroeconomics,Dornbusch,Fischer and Startz 3. Economics,Paul Anthony Samuelson,William D.Nordhaus 4. Modern Economic Theory, K Dewett, S. Chand & Company Ltd., New Delhi.

5. Managerial Economics, Dr. S. Sankaran,Margham Publications, Chennai.

Reference Books:

1. Intermediate Microeconomics : A Modern Approach , Hal R,Varian 2. Principles of Macroeconomics, N.Gregory Mankiw

28

Code Category L T P C I.M E.M Exam B20BS1209 BS -- -- 3 1.5 40 60 3 Hrs.

STATISTICAL METHODS LAB

(For CSBS)

Course Objectives: The student who successfully completes this course will have 1. The knowledge to use R for statistical programming, computation, modelling and graphics. 2. The skill to write functions and use R in an efficient way. 3. The ability to fit some basic types of statistical models using R. 4. The idea to expand the knowledge of R on their own.

Course Outcomes: After completion of the course, the student will be able to

KL 1. Write the programs in R to solve the statistical problems. K3 2. Apply various built in functions in R to solve the computational and modelling

problems. K3

3. Interpret the statistical data by various functions of graphical representation K4 4. Understand- reading, writing, working and manipulating the data in various data

frames. K3

LIST OF PROGRAMS

R statistical programming language: 1 Introduction to R 2 Functions 3 Control flow and Loops 4 Working with Vectors and Matrices 5 Reading in Data 6 Writing Data 7 Working with Data 8 Manipulating Data 9 Simulation

10 Linear model 11 Data Frame 12 Graphics in R

Reference Books:

1. Introduction to Time Series Analysis and Forecasting, Douglas C. Montgomery, Cheryl L. Jennings, Murat Kulahci, Wiley Publications, 2011A.

2. Fundamentals of Statistics, Goon, M. Gupta and B. Dasgupta, vol. I & II, 1/e, World Press,2013.

29

Code Category L T P C I.M E.M Exam B20CB1202 ES -- -- 3 1.5 15 35 3 Hrs.

DATA STRUCTURES AND ALGORITHMS LAB

(For CSBS)

Course Objectives: The student who successfully completes this course will have: 1 Be familiar with basic techniques of algorithm analysis and apply the suitable data

structure for the given real world problem. 2 Master the implementation of simple linear and nonlinear data structures. 3 Be familiar with several searching and sorting algorithms. 4 It enables them to gain knowledge in practical applications of data structures.

Course Outcomes: After completion of the course, the student will be able to S. No Outcome KL

1 Design and analyze the time and space efficiency of the data structure. K4 2 Identity the appropriate data structure for given problem. K3 3 Have practical knowledge on the applications of data structures. K4 4 Have practical knowledge on handling data structures with files. K4

SYLLABUS

Data Structures And Algorithms Lab using C programming language: 1 Sorting a list using Bubble sort and then apply binary search. 2 Implement quick sort algorithm. 3 Implement the operations on stacks using Array 4 Towers of Hanoi using user defined stacks. 5 Implement the operations on queues using Array. 6 Implement the operations on circular queues using Arrays. 7 Implement the Single Linked List operations (Insertion, Deletion). 8 Reading, writing, and addition of polynomials. 9 Implement the Circular Single Linked List operations (Insertion, Deletion).

10 Implement the Double Linked List operations (Insertion, Deletion).

11 Create a binary search tree and for implementing the inorder, preorder, postorder traversal using recursion.

12 Finding the Depth First Search of a graph, and Breadth First Search of a graph 13 Finding the transitive closure of a digraph 14 Line editors with line count, word count showing on the screen.

15 Finding the shortest paths from a given source to any vertex in a digraph using Dijkstra’s algorithm.

16 Saving / retrieving non-linear data structure in/from a file Reference Books:

1. The Art of Computer Programming: Volume 1: Fundamental Algorithms, Donald E. Knuth.

2. Introduction to Algorithms, Thomas, H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Cliford Stein, The MIT Press.

30

Code Category L T P C I.M E.M Exam

B20HS1203 HS -- -- 3 1.5 15 35 3 Hrs.

BUSINESS COMMUNICATION & VALUE SCIENCE - II (For CSBS)

Course Objectives: 1. To develop effective writing, reading, presentation and group discussion skills. 2. To help students identify personality traits and evolve as a better team player. 3. To introduce them to key concepts of: Morality, Behavior and beliefs, Diversity & Inclusion

Course Outcomes: After completion of the course, the student will be able to

S. No Outcome KL 1 Understand and use tools of structured written communication K3

2 Understand the basics of presentation and apply efficacious techniques to make presentations in the electronic/social media to share concepts and ideas required for any organization.

K3

3 Design various activities of communication resulting in building a team-spirit and creating social awareness.

K3

4 Understand the basic concepts of Morality and Diversity K2 5 Create communication material to share concepts and ideas K4

SYLLABUS

Exercise-1

Icebreaker. 1) Participate in ‘Join Hands Movement’. Individual identification of social issues.2) Each Individual chooses one particular social issue which they would like to address. 3) Class to be divided in teams for the entire semester. All activities to be done in teams and the grades, credit points will be captured in the leader board in the class room.4) Theory to introduce the participant Slam book to be used for capturing individual learning points and observations. Research on the social cause each group will work for. Class discussion- Good and Bad Writing. Common errors, punctuation rules, use of words. Group Practical – As a group, they will work on the social issue identified by them. Research, read and generate a report based on the findings.(Apply the learning and recap from the session) Practical: Plan and design an E Magazine. Apply and assimilate the knowledge gathered from Sem-1 till date. Share objective & guideline. All members to contribute an article to the magazine, trainer to evaluate the content.

Exercise-2

Lucid Writing: Encourage the students to go through the links given about Catherine Morris and Joanie Mcmahon’s writing techniques. Create the magazine, SATORI – Participants share the personal take away acquired from GD, writing and reading skills activities captured in their handbook. Share the most important learning points from the activities done so far and how that learning has brought a change. Launching an E Magazine.

Exercise-3 Each group will form an NGO. Create Vision, Mission, Value statement, tagline and Design a logo.

31

Introduction to basic presentation skills& ORAI app Groups to present their NGOs. Apply the learning gathered from session 2. Presentation to be recorded by the groups. feedback from the audience/ Professor Group to come back and share their findings from the recording. Post work- individual write up to be written and evaluated for the E- magazine Prepare and publish the Second episode of the E Magazine.

Exercise-4

Speed Reading session: Introduction to skimming and scanning; practice the same. SATORI – Join the dots- Participants to connect their learning gathered from AIP Unit-2 with their existing curriculum Quiz Time

Exercise-5

Ad campaign- Brain storming session- Students to discuss and explore the means of articulating and amplifying the social issue their NGOs are working for. Design a skit- a) write the script articulating the message of their respective NGOs. Read out the script. (Skit time-5 minutes). Feedback of Theory. Promote the play through a social media and gather your audience. Enact the play. Capture the numbers of likes and reviews. Theory to assign grades to individual team. (1)Theory to find out from the participants their views, observations and experiences of working in a team (2) Intro of Dr. Meredith Belbin and his research on team work and how individuals contribute. (3) Belbin's 8 Team Roles and Lindgren's Big 5 personality traits. (4) Belbin's 8 team player styles

Exercise-6

(1)Team Falcon Practical to identify individual personality traits with Belbin's 8 team player styles (2) Similar personality types to form groups (3) Groups present their traits. Prepare and publish the third episode of the E Magazine. SATORI – (join the dots with participants personal life) Participants share the personal take away acquired from working in teams, GD, learning about presentations, presenting their NGOs

Exercise-7

Ten minutes of your time – a short film on diversity. Play the video (link to be attached in the FG) Discuss key take away of the film. Theory to connect the key take away of the film to the concept of empathy. Touch the target (Blind man) - Debriefing of the Practical.

Exercise-8

Film: “The fish and I’’ by BabakHabibifar” (1.37mins) Groups to create a story – 10 minutes of a person's life affected by the social issue groups are working on. Narrate the story in first person. Feedbacks to be shared by the other groups.

Exercise-9

Research on a book, incident or film based on the topic of your respective NGO Write a review in a blog on the topics they are covering in their research. Theory will give grades to each team. Teams to video record interviews of people from diverse groups (Ask 5 questions). Share the recordings in FB

32

Exercise-10

Debate on the topic of diversity with an angle of ethics, morality and respect for individual (In the presence of an external moderator). Groups will be graded by the professor. Prepared speech- Every student will narrate the challenges faced by a member of a diverse group in 4 minutes (speech in first person). Theory to give feedback to each student.

Exercise-11

Discussion on TCS values, Respect for Individual and Integrity. Prepare and publish the final episode of the E Magazine. SATORI –Participants share the personal take away acquired from working in teams, GD, learning about presentations and understanding diversity inclusion. Revisit your resume Include your recent achievements in your resume.

Exercise-12

Project-1) Each team to look for an NGO/ social group in the city which is working on the issue their college group is supporting. 2) Spend a day with the NGO/ social group to understand exactly how they work and the challenges they face. 3) Render voluntary service to the group for one day 4) Invite the NGO/ social group to address their university students for couple of hours. Plan the entire event, decide a suitable venue in the university, gather audience, invite faculty members etc. (they need to get their plan ratified their professor). Outcome-- Host an interactive session with the NGO spokesperson 5) The groups to present their experience of a day with the NGO and inspire students to work for the cause.

Text Books:

1. There are no prescribed texts for Semester 2 – there will be handouts and reference Reference Books:

1 Guiding Souls: Dialogues on the purpose of life; Dr. A.P.J Abdul Kalam; Publishing Year-2005; Co-author--Arun Tiwari

2 The Family and the Nation; Dr. A.P.J Abdul Kalam; Publishing year: 2015; Co-author: Acharya Mahapragya

3 The Scientific India: A twenty First Century Guide to the World around Us; Dr. A.P.JAbdul Kalam; Publishing year: 2011; Co-author- Y.S.Rajan

4 Forge Your Future: Candid, Forthright, Inspiring ; Dr. A.P.J Abdul Kalam; year: 2014 5 Abundance: The Future is Better Than You Think; Peter H. Diamandis and Steven Kotler;

Published: 21 Feb, 2012; Publisher: Free Press 6 Start With Why: How Great Leaders Inspire Everyone to Take Action; Simon Sinek; Published: 6

October 2011; Publisher: Penguin B.E. /B.Tech in Computer Science & Business Systems Semester 2

7 Advertising & IMC: Principles and Practice; Sandra Moriarty, Nancy D. Mitchell, William, D. Wells; Published: 15 June 2016; Publisher: Pearson Education India

33

Code Category L T P C I.M E.M Exam B20MC1201 MC 2 -- -- 0 -- -- --

ENVIRONMENTAL SCIENCE

Common to AIDS,CE,CSBS,EEE & ME

Course Objectives: The objectives of the course are to impart: 1. Overall understanding of the natural resources. 2. Basic understanding of the ecosystem and its diversity. 3. Acquaintance on various environmental challenges induced due to unplanned anthropogenic

activities. 4. An understanding of the environmental impact of developmental activities. 5. Awareness on the social issues, environmental legislation and global treaties.

Course outcomes : After completion of the course, students will be able to K L

1 Bring awareness among the students about the nature and natural ecosystems K2 2 Sustainable utilization of natural resources like water, land, energy and air K4 3 Resource pollution and over exploitation of land, water, air and catastrophic (events)

impacts of climate change, global warming, ozone layer depletion, marine, radioactive pollution etc to inculcate the students about environmental awareness and safe transfer of our mother earth and its natural resources to the next generation

K5

4 Constitutional provisions for the protection of natural resources K2 5 Green technologies and its applications K3

SYLLABUS

UNIT-I (8 Hrs)

Multidisciplinary nature of Environmental Studies: Definition, Scope and Importance – Sustainability: Stockholm and Rio Summit–Global Environmental Challenges: Global warming and climate change, acid rains, ozone layer depletion, population growth and explosion, effects;. Role of information technology in environment and human health. Ecosystems: Concept of an ecosystem. - Structure and function of an ecosystem; Producers, consumers and decomposers. - Energy flow in the ecosystem - Ecological succession. - Food chains, food webs and ecological pyramids; Introduction, types, characteristic features, structure and function of Forest ecosystem, Grassland ecosystem, Desert ecosystem, Aquatic ecosystems.

UNIT-II (8 Hrs)

Natural Resources: Natural resources and associated problems. Forest resources: Use and over – exploitation, deforestation – Timber extraction – Mining, dams and other effects on forest and tribal people. Water resources: Use and over utilization of surface and ground water – Floods, drought, conflicts over water, dams – benefits and problems. Mineral resources: Use and exploitation, environmental effects of extracting and using mineral resources. Food resources: World food problems, changes caused by non-agriculture activities-effects of modern agriculture, fertilizer-pesticide problems, water logging, salinity. Energy resources: Growing energy needs, renewable and non-renewable energy sources use of alternate energy sources.

34

Land resources: Land as a resource, land degradation, Wasteland reclamation, man induced landslides, soil erosion and desertification; Role of an individual in conservation of natural resources; Equitable use of resources for sustainable lifestyles.

UNIT-III (8 Hrs)

Biodiversity and its conservation: Definition: genetic, species and ecosystem diversity- classification - Value of biodiversity: consumptive use, productive use, social-Biodiversity at national and local levels. India as a mega-diversity nation - Hot-sports of biodiversity - Threats to biodiversity: habitat loss, man-wildlife conflicts. - Endangered and endemic species of India – Conservation of biodiversity: conservation ofbiodiversity.

UNIT-IV (8 Hrs)

Environmental Pollution: Definition, Cause, effects and control measures of Air pollution, Water pollution, Soil pollution, Noise pollution, Nuclear hazards. Role of an individual in prevention of pollution. - Pollution case studies, Sustainable Life Studies. Impact of Fire Crackers on Men and his well being. Solid Waste Management: Sources, Classification, effects and control measures of urban and industrial solid wastes. Consumerism and waste products, Biomedical, Hazardous and e – waste management.

UNIT-V (8 Hrs)

Social Issues and the Environment: Urban problems related to energy -Water conservation, rain water harvesting-Resettlement and rehabilitation of people; its problems and concerns. Sustainability: theory and practice, Environmental ethics: Issues and possible solutions. Environmental Protection Act -Air (Prevention and Control of Pollution) Act. –Water (Prevention and control of Pollution) Act -Wildlife Protection Act -Forest Conservation Act-Issues involved in enforcement of environmental legislation.-Public awareness.

UNIT-VI (8 Hrs)

Environmental Management: Impact Assessment and its significance various stages of EIA, preparation of EMP and EIS, Environmental audit. Ecotourism, Green Campus – Green business and Greenpolitics. Environmental dairy. The student should Visit an Industry / Ecosystem and submit a report individually on any issues related to Environmental Studies course and make a power point presentation.

Text Books:

1. Environmental Studies, K. V. S. G. Murali Krishna, VGS Publishers,Vijayawada Rani; Pearson Education, Chennai

2. Environmental Studies, R. Rajagopalan, 2nd Edition, 2011, Oxford UniversityPress. 3. Environmental Studies, P. N. Palanisamy, P. Manikandan, A. Geetha, andK.Manjula

Reference Books: 1. Text Book of Environmental Studies, Deeshita Dave & P. Udaya Bhaskar, CengageLearning. 2. A Textbook of Environmental Studies, Shaashi Chawla, TMH, NewDelhi 3. Environmental Studies, Benny Joseph, Tata McGraw Hill Co, NewDelhi

4. Perspectives in Environment Studies, Anubha Kaushik, C P Kaushik, New AgeInternational Publishers,2014

35

Code Category L T P C I.M E.M Exam B20MC1203 MC -- -- 2 -- -- -- --

NATIONAL SERVICE SCHEME(NSS)

(Common to All Branches)

Course Objectives: 1. To understand the community and understand themselves in relation to their community. 2. Identify the needs and problems of the community and involve them in problem solving process. 3. Utilize their knowledge for finding practical solution to individual and community problems.

Course Outcomes: Student will be able to S.No Knowledge

Level 1. understand general orientation about community service, voluntarism role and

responsibility of NSS volunteer. K2

2. Analyze about the community he live in. K4 3. Asses the life in adopted villages. K5 4. Identify the importance of national days and attain participation in it. K3

SYLLABUS

1. Volunteerism- community and beyond(Theory). 2. Role and responsibility of NSS volunteer (Theory). 3. General orientation about community service(Theory). 4. Arranging lectures on social issues in schools or villages(Theory). 5. Arranging rally’s on social issues. 6. Socio economic survey in adopted villages 7. Plantation of saplings. 8. Blood donation camp 9. Rainwater harvesting awareness camp.

10. Celebration of national days as per NSS list.

Page 1 of 44

SAGI RAMA KRISHNAM RAJU ENGINEERING COLLEGE (AUTONOMOUS)

(Affiliated to JNTUK, Kakinada), (Recognized by AICTE, New Delhi) Accredited by NAAC with ‘A’ Grade, UG Programmes CE,CSE,ECE,EEE,IT &ME are Accredited by NBA

CHINNA AMIRAM (P.O):: BHIMAVARAM :: W.G.Dt., A.P., INDIA :: PIN: 534 204 Estd:1980

Regulation: R20 II / IV - B.Tech. I - Semester

COMPUTER SCIENCE & BUSINESS SYSTEM

SCHEME OF INSTRUCTION & EXAMINATION (With effect from 2020-21 admitted Batch onwards)

Course Code

Course Name Catego

ry Cr L T P

Int. Marks

Ext. Marks

Total Marks

B20 BS 2104

Applied Mathematical Techniques

BS 3 3 0 0 30 70 100

B20 CB 2101

Formal Language and Automata Theory

PC 3 3 0 0 30 70 100

B20 CB 2102

Computer Organization & Architecture

PC 3 3 0 0 30 70 100

B20 CB 2103

Data Base Management Systems

PC 3 3 0 0 30 70 100

B20 CB 2104

Object Oriented Programming though JAVA

ES 3 3 0 0 30 70 100

B20 CB 2105

Data Base Management Systems Lab

PC 1.5 0 0 3 15 35 50

B20 CB 2106

Computer Organization & Architecture Lab

PC 1.5 0 0 3 15 35 50

B20 CB 2107

Object Oriented Programming through JAVA Lab

ES 1.5 0 0 3 15 35 50

B20 IT 2108

Network Administration/Spread Sheet Data Analysis

SC 2 0 0 4 -- 50 50

B20 MC 2102

Professional Ethics & Human Values

MC 0 2 0 0 -- -- --

TOTAL 21.5 17 0 13 195 505 700

Page 2 of 44

Course Code Category L T P C I.M E.M. Exam B20BS2104 BS 3 -- -- 3 30 70 3 Hrs.

APPLIED MATHEMATICAL TECHNIQUES

(For CSBS) Prerequisites: calculus of functions of one and two variables Course Objectives: Students are expected to learn 1. How to expand a periodic function in a Fourier series. 2. How to find Fourier transform for a given function and evaluate some real definite integrals. 3. Formation and solution of first order linear and non linear partial differential equations 4. The concept of interpolation and its use for equally and unequally spaced data points. Numerical

methods to solve algebraic and transcendental equations. 5. Methods for numerical evaluation of integrals and for solving a first order ODE(IVP) Course Outcomes: After completion of the course, the student will be able to S.No Outcome K L 1 Determine Fourier series and half range series of functions. K3 2 Determine Fourier transforms of non-periodic functions and also use them to evaluate

integrals. K3

3 Form partial differential equations and solve Lagrange linear equation and nonlinear first order PDEs.

K3

4 Solve linear higher order homogeneous and non-homogeneous PDEs. K3 5 Fit an interpolation formula and perform interpolation for equally spaced and unequally

spaced data.Determine a real root of an algebraic or a transcendental equation of one variable.

K3

6 Evaluate numerically certain definite integrals and solve a first order ordinary differential equation (IVP) by Euler and RK methods.

K3

SYLLABUS

UNIT-I (10 Hrs)

Fourier series: Introduction, Periodic functions, Fourier series of a periodic function, Dirichlet’s conditions, Even and odd functions, Change of interval, Half-range sine and cosine series.

UNIT-II (10 Hrs)

Fourier Transforms: Fourier integral theorem (without proof), Fourier sine and cosine integrals, Fourier transform and its inverse, Sine and cosine transforms, Properties, Parseval’s identity, inverse transforms, Finite Fourier transforms.

UNIT-III (12 Hrs)

PDEs of first order: Formation of partial differential equations by elimination of arbitrary constants and arbitrary functions – Solutions of first order linear (Lagrange) equation and nonlinear (standard types) equations. Linear higher order PDEs: Solutions of linear partial differential equations with constant coefficients – RHS term of the type .

Page 3 of 44

UNIT-IV (12 Hrs)

Interpolation: Introduction, forward differences, backward differences and Central differences. Differences of a polynomial, Newton’s forward and backward interpolation formulae. Interpolation with unequal intervals: Newton’s divided difference and Lagrange interpolation formulae. Solution of Algebraic and Transcendental Equations: Introduction, Bisection method, Method of false position, Iteration method & Newton-Raphson method.

UNIT-V (10Hrs)

Numerical Integration and solution of Ordinary Differential equations: Trapezoidal rule, Simpson’s 1/3

rd rule. Solution of first order ordinary differential equations

by Taylor’s method, Picard’s method, Euler’s method, Modified Euler’s method, Fourth order Runge - Kutta method.

Text Books: 1. B. S. Grewal, Higher Engineering Mathematics, 43rdEdition, Khanna Publishers. Reference Books:

1. Erwin Kreyszig, Advanced Engineering Mathematics, 10th Edition, Wiley-India. 2. B. V. Ramana, Higher Engineering Mathematics, 2007 Edition, Tata Mc Graw Hill Education.

3. Steven C. Chapra, Applied Numerical Methods with MATLAB for Engineering and Science, Tata Mc Graw Hill Education.

4. M. K. Jain, S.R.K. Iyengar and R.K. Jain, Numerical Methods for Scientific and Engineering Computation, New Age International Publications.

Page 4 of 44

Course Code Category L T P C I.M E.M. Exam B20CB2101 PC 3 -- -- 3 30 70 3 Hrs.

FORMAL LANGUAGE & AUTOMATA THEORY

(For CSBS)

Course Objectives: Students are expected to learn 1. To learn fundamentals of Regular and Context Free Grammars and Languages 2. To understand the relation between Regular Language and Finite Automata and machines 3. To learn how to design Automata’s and machines as Acceptors, Verifiers and Translators 4. To understand the relation between Contexts free Languages, PDA and TM 5. To learn how to design PDA as acceptor and TM as Calculators

Course Outcomes: After completion of the course, the student will be able to S.No Outcome K L

1 Ability to analyze and construct Finite Automata from a regular expression ,regular grammar or regular language.

K4

2 Ability to analyze and construct a PDA from a given CFG or CFL K4 3 Ability to analyze and construct a Turing Machine from a REL or Unrestricted Grammar K4

SYLLABUS

UNIT-I (10Hrs)

Finite Automata: Need of Automata theory, Central Concepts of Automata Theory, Automation, Finite Automation, Transition Systems, Acceptance of a String, DFA, Design of DFAs, NFA, Design of NFA, Equivalence of DFA and NFA, Conversion of NFA into DFA, Finite Automata with Є-Transitions, Minimization of Finite Automata, Finite Automata with output-Mealy and Moore Machines, Applications and Limitation of Finite Automata.

UNIT-II (08Hrs)

Regular Expressions, Regular Sets, Identity Rules, Equivalence of two RE, Manipulations of REs, Finite Automata and Regular Expressions, Inter Conversion, Equivalence between FA and RE, Pumping Lemma of Regular Sets, Closure Properties of Regular Sets, Grammars, Classification of Grammars, Chomsky Hierarchy Theorem, Right and Left Linear Regular Grammars, Equivalence between RG and FA, Inter Conversion

UNIT-III (10Hrs)

Formal Languages, Context Free Grammar, Leftmost and Rightmost Derivations, Parse Trees, Ambiguous Grammars, Simplification of Context Free Grammars-Elimination of Useless Symbols, Є-Productions and Unit Productions, Normal Forms-Chomsky Normal Form and Greibach Normal Form, Pumping Lemma, Closure Properties, Applications of Context Free Grammars.

UNIT-IV (10Hrs)

Pushdown Automata, Definition, Model, Graphical Notation, Instantaneous Description, Language Acceptance of Pushdown Automata, Design of Pushdown Automata,

Page 5 of 44

Deterministic and Non – Deterministic Pushdown Automata, Equivalence of Pushdown Automata and Context Free Grammars, Conversion, Two Stack Pushdown Automata, Application of Pushdown Automata.

UNIT-V (12 Hrs.)

Turning Machine: Definition, Model, Representation of TMs-Instantaneous Descriptions, Transition Tables and Transition Diagrams, Language of a TM, Design of TMs, Types of TMs, Church’s Thesis, Universal and Restricted TM, Decidable and Un-decidable Problems, Halting Problem of TMs, Post’s Correspondence Problem, Modified PCP, Classes of P and NP, NP-Hard and NP-Complete Problems.

Text Books:

1. Introduction to Automata Theory, Languages, and Computation John E. Hopcroft, Rajeev Motwani and Jeffrey D. Ullman.

2. Theory of Computer Science-Automata, Languages and Computation, K. L. P. Mishraand N. Chandrasekharan, 3rd Edition, PHI, 2007

Reference Books:

1. Elements of the Theory of Computation, Harry R. Lewis and Christos H. Papadimitriou. 2. Theory of Computation, V. Kulkarni, Oxford University Press,2013 3. Theory of Automata, Languages and Computation, Rajendra Kumar, McGraw Hill,2014

e-Resources:

1 https://nptel.ac.in/courses/106/104/106104028/

Page 6 of 44

Course Code Category L T P C I.M E.M. Exam B20CB2102 PC 3 -- -- 3 30 70 3 Hrs.

COMPUTER ORGANIZATION & ARCHITECHTURE

(For CSBS)

Course Objectives: Students are expected to learn 1. Principles and the Implementation of ComputerArithmetic 2. Operation of CPUs including RTL, ALU, Instruction Cycle and Busses 3. FundamentalsofdifferentInstructionSetArchitecturesandtheirrelationshiptothe CPU design 4. Memory System and I/O Organization 5. Principles of Operation of Multiprocessor Systems and Pipelining

Course Outcomes: After completion of the course, the student will be able to S.No Outcome K L

1 Illustrate the various data representations, notations, arithmetic algorithms and flow control for various instructions using micro operations in basic computer

K2

2 Detailed understanding of architecture and functionality of central processing unit and various control units

K2

3 Exemplify in a better way the I/O and memory organization K3 4 Illustrate concepts of parallel processing, pipelining and inter processor

communication K2

SYLLABUS

UNIT-I (10Hrs)

Basic Structure of Computers: Basic Organization of Computers, Historical Perspective, Bus Structures, Data Representation: Data types, Complements, Fixed Point Representation. Floating, Point Representation. Other Binary Codes, Error Detection Codes. Computer Arithmetic: Addition and Subtraction, Multiplication Algorithms, Division Algorithms.

UNIT-II (08Hrs)

Register Transfer Language and Micro operations: Register Transfer language. Register Transfer Bus and Memory Transfers, Arithmetic Micro operations, Logic Micro Operations, Shift Micro Operations, Arithmetic Logic Shift Unit. Basic Computer Organization and Design: Instruction Codes, Computer Register, Computer Instructions, Instruction Cycle, Memory – Reference Instructions. Input –Output and Interrupt, Complete Computer Description.

UNIT-III (10Hrs)

Central Processing Unit: General Register Organization, STACK Organization. Instruction Formats, Addressing Modes, Data Transfer and Manipulation, Program Control, Reduced Instruction Set Computer. Micro programmed Control: Control Memory, Address Sequencing, Micro Program example, Design of Control Unit.

Page 7 of 44

UNIT-IV (10Hrs)

Memory Organization: Memory Hierarchy, Main Memory, Auxiliary Memory, Associative Memory, Cache Memory, Virtual Memory. Input-Output Organization: Peripheral Devices, Input-Output Interface, Asynchronous data transfer, Modes of Transfer, Priority Interrupts, Direct Memory Access.

UNIT-V (12 Hrs.)

Multi Processors: Introduction, Characteristics of Multiprocessors, Inter connection Structures, Inter Processor Arbitration. Pipeline: Parallel Processing, Pipelining, Instruction Pipeline.

Text Books: 1. Computer System Architecture M. M. Mano:, 3rd ed., Prentice Hall of India, New Delhi, 1993

2. Computer Organization, Carl Hamacher, ZvonkoVranesic, SafwatZaky, 5/e, McGraw Hill,2002.

Reference Books: 1. Computer Organization and Architecture, William Stallings, 6/e, Pearson,2006. 2. Structured Computer Organization, Andrew S. Tanenbaum, 4/e, Pearson,2005.

3. Fundamentals of Computer Organization and Design, Sivarama P. Dandamudi, Springer, 2006.

e-Resources 1. https://nptel.ac.in/courses/106/105/106105163/ 2. http://www.cuc.ucc.ie/CS1101/David%20Tarnoff.pdf

Page 8 of 44

Code Category L T P C I.M E.M Exam B20CB2103 PC 3 -- -- 3 30 70 3 Hrs.

DATA BASE MANAGEMENT SYSTEMS

(For CSBS)

Course Objectives: Students are expected to learn 1 To introduce about database management systems. 2 To give a good formal foundation on the E R Model and relational model of data. 3 To introduce the concepts of basic SQL as a universal Database language. 4 To demonstrate the principles behind systematic database design approaches by covering

conceptual design, logical design through normalization. 5 To provide an overview of physical design of a database system, by discussing Database indexing

techniques and storage techniques.

Course Outcomes:After completion of the course, the student will be able to S.No Outcome K L

1. Understand the basic concepts of Database systems K2 2. Analyze requirements of an organization and develop a database schema in terms

of E R model and Relational model. K4

3 Analyze a query and formulate optimal solution using the knowledge of query languages like SQL.

K4

4 Design well structured relations by applying normalization to remove anomalies in relations.

K4

5 Analyze the issues in transaction execution, data storage and Security K2 SYLLABUS

UNIT-I (9Hrs)

Introduction: Introduction to Database Systems, File system Vs DBMS, Brief introduction to Hierarchical, Network and Relational Models. Database system architecture: Database structure, Data Abstraction, Data Independence, 2-tier,3-tier architectures, Schemas and Instances.

UNIT-II (10Hrs)

Database Design: E-R model: entities, relationships, cardinalities, participation constraints, weak entity sets, hierarchies and aggregation. Relational Model: Introduction to SQL, DDL,DML and DCL, Integrity constraints, mapping ER diagrams to relations, views.

UNIT-III (12Hrs)

Query Processing: simple queries, sub queries, joins, Aggregate functions, group by and having clause, set operations. Query Optimization: Evaluation of relational algebraic expressions, Query Equivalence, join strategies.

UNIT-IV (10Hrs)

Schema Refinement and Normalization: Purpose of Normalization, keys, functional dependencies, Normal forms: 1NF, 2NF, 3NF and BCNF, loss-less join, dependency preservation, MVDs fourth normal form, Join dependencies and fifth normal form.

Page 9 of 44

UNIT-V (10Hrs)

Transaction Processing: Transaction concepts, ACID properties, schedules, Concurrent execution of transactions, concurrency control using 2PL. Database Security: Authentication, Authorization and access control, Intrusion detection, SQL injection. Indexing: Primary, Secondary, and Cluster indexes, Hash based indexing and B+-tree Indexing.

Text Books:

1. Database System Concepts. Abraham Silberschatz, Henry F. Korth and S. Sudarshan.

Reference Books:

1. Principles of Database and Knowledge – Base Systems, Vol 1 by J. D. Ullman. 2 Fundamentals of Database Systems. R. Elmasri and S. Navathe. 3 Foundations of Databases. Serge Abiteboul, Richard Hull, Victor Vianu.

Page 10 of 44

Course Code Category L T P C I.M E.M Exam B20CB2104 ES 3 -- -- 3 30 70 3 Hrs.

OBJECT ORIENTED PROGRAMMING THROUGH JAVA

(For CSBS)

Course Objectives: Students are expected to learn 1. To identify Java language components and how they work together in applications 2. To learn the fundamentals of object-oriented programming in Java, including defining classes,

invoking methods, using class libraries. 3. To learn how to extend Java classes with inheritance and dynamic binding and how to use

exception handling in Java applications 4. To understand how to design applications with threads in Java 5. To understand how to use Java APIs for program development

Course Outcomes: After completion of the course, the student will be able to S. No Outcome K L

1 Able to realize the concept of Object Oriented Programming & Java Programming Constructs K3

2 Able to describe the basic concepts of Java such as operators, classes, objects, inheritance, packages, Enumeration and various keywords K2

3 Apply the concept of exception handling and Input/ Output operations K3 4 Able to design the applications of Java & Java applet K4 5 Able to Analyze & Design the concept of Event Handling and Abstract Window

Toolkit K4

SYLLABUS

UNIT-I (10Hrs)

Introduction to OOP: Introduction, Need of Object Oriented Programming, Principles of Object Oriented Languages, Procedural languages Vs OOP, Applications of OOP, History of JAVA, Java Virtual Machine, Java Features, Program structures. Programming Constructs: Variables, Primitive Data types, Identifiers- Naming Coventions, Keywords, Literals, Operators-Binary, Unary and ternary, Expressions, Precedence rules and Associativity, Primitive Type Conversion and Casting, Flow of control- Branching, Conditional, loops.

UNIT-II (08Hrs)

Classes and Objects- classes, Objects, Creating Objects, Methods, constructors-Constructor overloading, cleaning up unused objects-Garbage collector, Class variable and Methods-Static keyword, this keyword, Arrays, Command line arguments

UNIT-III (10Hrs)

Inheritance: Types of Inheritance, Deriving classes using extends keyword, Method overloading, method overriding, dynamic method dispatch, super keyword, final keyword, Abstract class. Interfaces, Packages and Enumeration: Interface-Extending interface, Interface Vs

Page 11 of 44

Abstract classes, Packages-Creating packages, using Packages, Access protection, java. lang package. Exceptions & Assertions – Introduction, Exception handling techniques- try… catch, throw, throws, finally block, user defined exception, Exception Encapsulation and Enrichment, Assertions.

UNIT-IV (10Hrs)

Multi Threading: java.lang.Thread, The main Thread, Creation of new threads, Thread priority, Multithreading- Using isAlive () and join (), Synchronization, suspending and Resuming threads, Communication between Threads. Input/Output: reading and writing data, java.io package Stream based I/O (java.io) – The Stream classes-Byte streams and Character streams, Reading console Input and Writing Console Output, File class, Reading and writing Files.

UNIT-V (12 Hrs.)

GUI Programming with Swing–Introduction, limitations of AWT, MVC architecture, components, containers. Understanding Layout Managers, Flow Layout, Border Layout, Grid Layout, Card Layout, Grid Bag Layout. Event Handling- The Delegation event model- Events, Event sources, Event Listeners, Event classes, Handling mouse and keyboard events, Adapter classes, Inner classes, Anonymous Inner classes. A Simple Swing Application, Applets – Applets and HTML, Applets and Applications, passing parameters to applets. Creating a Swing Applet, Painting in Swing, A Paint example, Exploring Swing Controls- JLabel and Image Icon, JText Field, The Swing Buttons- JButton, JToggle Button, JCheck Box, JRadio Button, JTabbed Pane, JScroll Pane, JList, JCombo Box, Swing Menus, Dialogs.

Text Books:

1. Java one step ahead, Anitha seth, B.L.Juneja, oxford.

2. Java The complete reference, 9th edition, Herbert Schildt, McGraw Hill Education (India) Pvt. Ltd.

3. Object Oriented Programming with Java, essentials and applications, Rajkumar Bhuyya,selvi, chu TMH.

Reference Books:

1. Introduction to Java programming, a primer , Balaguruswamy 2. Object Oriented Programming through Java, P. Radha Krishna

Page 12 of 44

Code Category L T P C I.M E.M Exam B20CB2105 PC -- -- 3 1.5 15 35 3 Hrs.

DATA BASE MANAGEMENT SYSTEMS LAB

(For CSBS)

Course Objectives: The student who successfully completes this course will have: 1 Populate and query a database using SQL DDL/DML Commands 2 Declare and enforce integrity constraints on a database 3 Writing Queries using advanced concepts of SQL 4 Programming PL/SQL including procedures, functions, cursors and triggers

Course Outcomes: After completion of the course, the student will be able to S. No Outcome KL

1 Utilize SQL to execute queries for creating database and performing data manipulation operations

K2

2 Examine integrity constraints to build efficient databases K1 3 Apply Queries using Advanced Concepts of SQL K3 4 Build PL/SQL programs including stored procedures, functions, cursors and

triggers K2

LIST OF EXPERIMENTS

1 Creation, altering and dropping of tables and inserting rows into a table (use constraints while creating tables) examples using SELECT command.

2 Queries (along with sub Queries) using ANY, ALL, IN, EXISTS, NOTEXISTS, UNION, INTERSET, Constraints. Example:- Select the roll number and name of the student who secured fourth rank in the class.

3 Queries using Aggregate functions (COUNT, SUM, AVG, MAX and MIN), GROUP BY, HAVING and Creation and dropping of Views.

4

Queries using Conversion functions (to_char, to_number and to_date), string functions (Concatenation, lpad, rpad, ltrim, rtrim, lower, upper, initcap, length, substr and instr), date functions (Sysdate, next_day, add_months, last_day, months_between, least, greatest, trunc, round, to_char, to_date)

5

Creation of simple PL/SQL program which includes declaration section, executable section and exception –Handling section (Ex. Student marks can be selected from the table and printed for those who secured first class and an exception can be raised if no records were found) Insert data into student table and use COMMIT, ROLLBACK and SAVEPOINT in PL/SQL block.

6 Develop a program that includes the features NESTED IF, CASE and CASE expression. The program can be extended using the NULLIF and COALESCE functions.

7 Program development using WHILE LOOPS, numeric FOR LOOPS, nested loops using ERROR Handling, BUILT –IN Exceptions, USE defined Exceptions, RAISE- APPLICATION ERROR

Page 13 of 44

8 Programs development using creation of procedures, passing parameters IN and OUT of 37 PROCEDURES

9 Program development using creation of stored functions, invoke functions in SQL Statements and write complex functions.

10 Develop programs using features parameters in a CURSOR, FOR UPDATE CURSOR, WHERE CURRENT of clause and CURSOR variables.

11 Develop Programs using BEFORE and AFTER Triggers, Row and Statement Triggers and INSTEAD OF Triggers

12 Create a table and perform the search operation on table using indexing and non-indexing techniques.

Reference Books:

1. Oracle: The Complete Reference by Oracle Press Nilesh Shah, "Database Systems Using Oracle”, PHI, 2007

2. Rick F Vander Lans, “Introduction to SQL”, Fourth Edition, Pearson Education, 2007

Page 14 of 44

Code Category L T P C I.M E.M Exam B20CB2106 PC -- -- 3 1.5 15 35 3 Hrs.

COMPUTER ORGANIZATION & ARCHITECTURE LAB

(For CSBS)

Course Objectives: The student who successfully completes this course will have: 1 Know the characteristics of various components. 2 Understand the utilization of components

Course Outcomes: After completion of the course, the student will be able to S. No Outcome KL

1 Understand working of logic families and logic gates. K2 2 Design and implement Combinational and Sequential logic circuits. K4 3 Solve elementary problems by assembly language programming K3 4 Implement assembly language program for given task for 8086 microprocessor. K3

SYLLABUS

1 Realization of Boolean Expressions using Gates 2 Design and realization logic gates using universal gates

3 Designs a JK Flip‐Flop, Edge triggered J‐K NAND Flip Flop and show its functionality Handle race condition and clock gating in your circuit.

4 Design a 4 – bit Adder / Subtractor 5 Combinational logic circuits: Implementation of Boolean functions using logic gates

6 Arithmetic operations using logic gates; Implementation of Multiplexers, Demultiplexers, Encoders, Decoders; Implementation of Boolean functions using Multiplexers/Decoders

7 Study of sequential logic circuits: Implementation of flip flops, Verify the excitation tables of various FLIP-FLOPS.

8 Design and realization a Synchronous and Asynchronous counter using flip-flops 9 Design and realization of an 8-bit parallel load and serial out shift register using flip flops

10 Implementation of counters, Design and realization a Synchronous and Asynchronous counter using flip-flops

11 Design and realization of 4x1 mux, 8x1mux using 2x1 mux Write assembly language programs in 8085/8086 for the following: (MASAM can also be used)

1 To add two 8 bit number (A+B=RESULT with a carry and without a carry).

2 To subtract one 8 bit number from another (A-B=RESULT with a borrow and without a borrow).

3 To find out AND, OR, NOT, XOR, NAND, NOR, XNOR of two 8 bit number 4 To find out addition of two 16 bit numbers. 5 To find out subtraction of two 16 bit numbers.

6

To evaluate the expression a = b + c –d * e Considering 8-bit, 16 bit and 32-bit binary numbers as b, c, d, e. Take the input in consecutive memory locations and results also Display the results by using “int xx” of 8086. Validate program for the boundary conditions.

7 To take N numbers as input. Perform the following operations on them

Page 15 of 44

a) Arrange in ascending and descending order. b) Find max and minimum c) Find average Considering 8-bit, 16-bit binary numbers and 2-digit, 4 digit and 8-digit

BCD numbers. Display the results by using “int xx” of 8086. Validate program for the boundary conditions.

8 To implement the above operations as procedures and call from the main procedure

9 To find the factorial of a given number as a Procedure and call from the main program which display the result.

Note: Experiments can be done using Logic board, EasyCPU, RTSlim, Little Man Computer (LMC), Assemblers for 8085 programming, 8086 based trainer kits, MIPS simulator PCSpim, Xilinx schematic editor and simulation tools or any other choice e- Resources:

1. https://nptel.ac.in/courses/106/105/106105163/ 2. http://www.cuc.ucc.ie/CS1101/David%20Tarnoff.pdf

Page 16 of 44

Code Category L T P C I.M E.M Exam

B20CB2107 PC -- -- 3 1.5 20 30 3 Hrs.

OBJECT ORIENTED PROGRAMMING THROUGH JAVA LAB (For CSBS)

Course Objectives: The aim of this lab is to 1. Practice programming in the Java 2. Gain knowledge of object-oriented paradigm in the Java programming language 3. Learn use of Java in a variety of technologies and on different platforms

Course Outcomes: By the end of the course student will be able to write java program for S.No Outcome Knowledge

Level 1. Apply primitive data types, Operations, Expressions, Control-flow, Strings

in java programming K3

2. Examine Class, Objects, Methods, Inheritance, Exception, Runtime Polymorphism, User defined Exception handling mechanism

K4

3. Analyzing simple inheritance, multi-level inheritance, Exception handling mechanism

K4

4. Analyze and Construct Threads, Event Handling, implement packages K4

LIST OF EXPERIMENTS Exercise - 1 (Basics)

1. Write a JAVA program to display default value of all primitive data type of JAVA 2. Write a java program that display the roots of a quadratic equation ax2+bx+c=0.

Calculate the discriminate D and basing on value of D, describe the nature of root. 3. Five Bikers Compete in a race such that they drive at a constant speed which may or may

not be the same as the other. To qualify the race, the speed of a racer must be more than the average speed of all 5 racers. Take as input the speed of each racer and print back the speed of qualifying racers.

Exercise - 2 (Operations, Expressions, Control-flow, Strings) 1. Write a JAVA program to search for an element in a given list of elements using

binary search mechanism. 2. Write a JAVA program to sort for an element in a given list of elements using bubble sort 3. Write a JAVA program to sort for an element in a given list of elements using merge sort. 4. Write a JAVA program using StringBuffer to delete, remove character.

Exercise - 3 (Class, Objects) 1. Write a JAVA program to implement class mechanism. – Create a class, methods and

invoke them inside main method. 2. Write a JAVA program to implement constructor.

Exercise - 4 (Methods) 1. Write a JAVA program to implement constructor overloading. 2. Write a JAVA program implement method overloading.

Page 17 of 44

Exercise - 5 (Inheritance)

1. Write a JAVA program to implement Single Inheritance 2. Write a JAVA program to implement multi level Inheritance 3. Write a java program for abstract class to find areas of different shapes

Exercise - 6 (Inheritance - Continued) 1. Write a JAVA program give example for “super” keyword.

2. Write a JAVA program to implement Interface. What kind of Inheritance can be achieved?

Exercise - 7 (Exception) 1. Write a JAVA program that describes exception handling mechanism 2. Write a JAVA program Illustrating Multiple catch clauses

Exercise – 8 (Runtime Polymorphism) 1. Write a JAVA program that implements Runtime polymorphism

2. Write a Case study on run time polymorphism, inheritance that implements in above problem

Exercise – 9 (User defined Exception) 1. Write a JAVA program for creation of Illustrating throw 2. Write a JAVA program for creation of Illustrating finally 3. Write a JAVA program for creation of Java Built-in Exceptions 4. Write a JAVA program for creation of User Defined Exception

Exercise – 10 (Threads)

1.

Write a JAVA program that creates threads by extending Thread class .First thread display “Good Morning “every 1 sec, the second thread displays “Hello “every 2 seconds and the third display “Welcome” every 3 seconds ,(Repeat the same by implementing Runnable)

2. Write a program illustrating isAlive and join () Exercise – 11 (Packages)

1. Write a JAVA program illustrate class path 2. Write a case study on including in class path in your OS environment of your package.

3. Write a JAVA program that import and use the defined your package in the previous Problem

Exercise – 12 (Event Handling)

1. Write a JAVA program that display the x and y position of the cursor movement using Mouse.

2. Write a Java program to create radio buttons(male & female) perform event handling to display relevant text when radio button selected and button press is performed.

3. Write a java program to Demonstrate KeyAdapter classes. Reference Books:

1. JAVA one step ahead, Anitha Seth, B.L.Juneja, Oxford. 2. The complete Reference Java, 8th edition, Herbert Schildt, TMH.

Page 18 of 44

Subject Code Category L T P C I.M E.M Exam B20IT2108 SC - -- 4 2 -- 50 3 Hrs.

NETWORK ADMINISTRATION (SOC-1)

(COMMON TO AIDS ,CSBS & IT) Course Objectives: On completing this course student will be able to

1 Install different Operating Systems, antivirus and components 2 Install and configure windows server. 3 Install and configure different networking protocols and network tools.

Course Outcomes: By the end of the course, the student should have the ability to: S.No Outcome KL

1 Demonstrate installation and configuration of Operating systems. K2 2 Demonstrate installation and configuration of DNS, DHCP, set up adhoc

networks. K2

3 Demonstrate different network related tools and applications. K2

SYLLABUS

1

Install MS Windows from the CD/DVD. We can try to install version from 10 to XP (8.1 recommended). Installation should include users, administrators, device configuration, patches and updates, antivir system, necessary environment configuration (i.e. NumLock, hiding of extension settings, etc.).

2 HW installation. Changing harddrives, preparing cables, setting of a separated network (course on real computers, harddrives dedicated for the course allows hardware sharing).

3 Install selected Linux distribution (Debian or Slackware recommended). Settings, as for MS Windows.

4 Text mode console commands. Cron, scripts.

5 Novell Netware administration, if anyone interested. Novell is not used for many years, but is useful to describe, how the server can work

6 Work with server - SQL, Apache, FTP/SFTP, mail. Mail robots. 7 Server as a firewall, ip sharing (NAT, DNAT, masquerade). Server behind the firewall. 8 Installation & configuration of Windows professional. 9 Installation & configuration of Windows server.

10 Installing and Configuring Terminal Services 11 Installing DNS. Implementing DNS in windows networks. 12 Installing and configuring DHCP. 13 Configuring & Implementing routing services 14 Configuration and setup of adhoc network and infrastructure network. 15 NET tools, Deployment of NETTOOLS. 16 Tracing of email origin using email trace pro utility. 17 Use of key logges and anti key logger to secure your system

Reference Books: 1 Mastering Windows 2000 Server by Mark Minasi, Sybex, ISBN: 0-7821-2774-6 2 Computer Networks- Andrew S Tanenbaum, 4th edition, Pearson Education

Page 19 of 44

SPREAD SHEET DATA ANALYSIS (SOC-1)

(COMMON TO AIDS ,CSBS & IT) Course Objectives: On completing this course student will be able to

1 To develop basic knowledge in Excel 2 To expose the various functions in Excel 3 To extend the skill to use data visualization 4 To analyze the real time datasets 5 To develop Pivot tables and VLOOKUP functions

Course Outcomes: By the end of the course, the student should have the ability to:

S.No Outcome Knowledge Level

1 Describe common Excel functionality and features used for data science K2 2 Analyze and construct the data Visualization K3 3 Configure the programming environment K2 4 Analyze real time data set K3 5 Implement Pivot tables and VLOOKUP functions K3

SYLLABUS

List of experiments 1 Study of basic functions in Excel 2 Working with Range Names and Tables 3 Cleaning Data with Text Functions. 4 Working with VLOOKUP functions and Pivot tables. 5 Demonstration of data Visualization 6 Importing data from external source into excel 7 Creating a data model 8 Exploring data with Pivot tables 9 Create a dash board for a given requirement.

10 Implement a data analytics for the real time data set.

Reference Books:

1. Julio Cesar Rodriques Martino, “ Hands – on Machine learning with Microsoft Excel”, Packt Publication 2019

2. Paul McFedries, “Excel data analysis for dunnies”, john wiley and sone 2019.

Page 20 of 44

Code Category L T P C I.M E.M Exam B20MC2102 MC 2 -- -- 0 -- -- --

PROFESSIONAL ETHICS & HUMAN VALUES

(Common to CE,EEE,ME,AIDS & CSBS) Course Objectives: The objectives of the course are to impart: 1. To create an awareness on Engineering Ethics and Human Values. 2. To instill Moral and Social Values and Loyalty. 3. To appreciate the rights of others.

Course outcomes : After completion of the course, students will be able to K L 1 Identify and analyze an ethical issue in the subject matter under investigation or in a

relevant field. K3

2 Identify the multiple ethical interests at stake in a real-world situation or practice. K2 3 Articulate what makes a particular course of action ethically defensible. K3 4 Assess their own ethical values and the social context of problems. K3 5 Identify ethical concerns in research and intellectual contexts, including academic

integrity, use and citation of sources, the objective presentation of data, and the treatment of human subjects.

K2

6 Demonstrate knowledge of ethical values in non-classroom activities, such as service learning, internships, and field work.

K3

7 Integrate, synthesize, and apply knowledge of ethical dilemmas and resolutions in academic settings, including focused and interdisciplinary research.

K4

SYLLABUS

UNIT-I (8 Hrs)

Human Values: Morals, Values and Ethics-Integrity-Work Ethic-Service learning Civic Virtue Respect for others Living Peacefully Caring Sharing Honesty -Courage-Cooperation Commitment Empathy Self Confidence Character Spirituality..

UNIT-II (8 Hrs)

Engineering Ethics: Senses of 'Engineering Ethics-Variety of moral issued- Types of inquiry Moral dilemmas Moral autonomy- Kohlberg's theory- -Consensus and controversy Models of professional roles-Theories about right action-Self-interest -Customs and religion Uses of Ethical theories Valuing time Cooperation Commitment.,

UNIT-III (8 Hrs)

Engineering as Social Experimentation: Engineering As Social Experimentation- Framing the problem- Determining the facts codes of Ethics- Clarifying Concepts- Application issues Common Ground -General Principles- Utilitarian thinking respect for persons

UNIT-IV (8 Hrs)

Engineers Responsibility for Safety and Risk: Safety and risk Assessment of safety and risk. Risk benefit analysis and reducing risk-Safety and the Engineer-Designing for the safety- Intellectual Property rights(IPR).,

Page 21 of 44

UNIT-V (8 Hrs)

Global Issues: Globalization- Cross-culture issues-Environmental Ethics- Computer Ethics Computers as the instrument of Unethical behavior Computers as the object of Unethical acts Autonomous Computers-Computer codes of Ethics- Weapons Development -Ethics and Research Analyzing Ethical Problems in research.

Text Books:

1. Engineering Ethics includes Human Values" by M.Govindarajan, S.Natarajan- and, V.S.Senthil Kumar-PHI Learning Pvt Ltd-2009.

2. "Engineering Ethics" by Harris, Pritchard and Rabins, CENGAGE Learning, India Edition, 2009.

3. "Ethics in Engineering" by Mike W. Martin and Roland Schinzinger - Tata McGraw-Hill-2003.

4. "Professional Ethics and Morals" by Prof.A.R.Aryasri, DhanikotaSuyodhana-Maruthi Publications.

5. "Professional Ethics and Human Values" by A.Alavudeen, R.Kalil Rahman and M.Jayakumaran-LaxmiPublications.

6. "Professional Ethics and Human Values" by Prof.D.R.Kiran- 7. "Indian Culture, Values and Professional Ethics" by PSR Murthy- BS Publication. 8. Professional Ethics by R.Subramaniam - Oxford publications, New Delhi

Page 22 of 44

Regulation: R20 II / IV - B.Tech. II - Semester

COMPUTER SCIENCE & BUSINESS SYSTEM

SCHEME OF INSTRUCTION & EXAMINATION (With effect from 2020-21 admitted Batch onwards)

Course Code

Course Name Catego

ry Cr L T P

Int. Marks

Ext. Marks

Total Marks

B20 CB 2201

Operating Systems PC 3 3 0 0 30 70 100

B20 CB 2202

Python Programming PC 3 3 0 0 30 70 100

B20 CB 2203

Design and Analysis of Algorithms

PC 3 3 0 0 30 70 100

B20 HS 2202

Fundamentals of Management

PC 3 3 0 0 30 70 100

B20 HS 2203

Business Communication & Value Science III

HS 3 3 0 0 30 70 100

B20 CB 2204

OS & Unix Programming Lab

PC 1.5 0 0 3 15 35 50

B20 CB 2205

Python Programming Lab PC 1.5 0 0 3 15 35 50

B20 CB 2206

Design and Analysis of Algorithms Lab

PC 1.5 0 0 3 15 35 50

B20 IT 2207

Animations / Web Design using PHP

SC 2 0 0 4 15 35 50

B20 MC 2201

English Proficiency MC 0 2 0 0 -- -- --

TOTAL 21.5 17 0 13 210 490 700

Page 23 of 44

Code Category L T P C I.M E.M Exam B20CB2201 PC 3 -- -- 3 30 70 3 Hrs.

OPERATING SYSTEMS

(For CSBS) Course Objectives: Students are expected to learn

1 Introduce to the internal operation of modern operating systems 2 Define, explain, processes and threads, mutual exclusion, CPU scheduling, deadlock,

memory management, and file systems 3 Understand File Systems in Operating System like UNIX/Linux and Windows 4 Understand Input Output Management and use of Device Driver and Secondary

Storage (Disk)Mechanism 5 Analyze Security and Protection Mechanism in Operating System

Course Outcomes:After completion of the course, the student will be able to S.No Outcome K L

1 Describe various generations of Operating System and functions of Operating System K2 2 Describe the concept of program, process and thread and analyze various CPU

Scheduling Algorithms and compare their performance K3

3 Solve Inter Process Communication problems using Mathematical Equations by various methods

K3

4 Compare various Memory Management Schemes especially paging and Segmentation in Operating System and apply various Page Replacement Techniques

K3

5 Outline the basic functionality of Operating System like UNIX/Linux and Windows. K2

SYLLABUS

UNIT-I (12Hrs)

Operating Systems Overview: Operating system functions, Operating system structure, Operating systems operations, Computing environments, Open-Source Operating Systems. System Structures: Operating System Services, User and Operating-System Interface, systems calls, Types of System Calls, system programs, operating system structure, operating system debugging, System Boot.

UNIT-II (10Hrs)

Process Concept: Process scheduling, Operations on processes, Inter-process communication, Communication in client server systems. Multithreaded Programming: Multithreading models, Thread libraries, Threading issues. Process Scheduling: Basic concepts, Scheduling criteria, Scheduling algorithms, Multiple processor scheduling, Thread scheduling. Inter-process Communication: Race conditions, Critical Regions, Mutual exclusion with Busy waiting, leep and wakeup, Semaphores, Mutexes, Monitors, Message passing, Barriers, Classical IPC Problems - Dining philosophers problem, Readers and writers problem.

Page 24 of 44

UNIT-III (14Hrs)

Memory-Management Strategies: Introduction, Swapping, Contiguous memory allocation, Paging, Segmentation. Virtual Memory Management: Introduction, Demand paging, Copy on-write, Page replacement, Frame allocation, Thrashing, Memory-mapped files, Kernel memory allocation.

UNIT-IV (10Hrs)

Deadlocks: Resources, Conditions for resource deadlocks, Ostrich algorithm, Deadlock detection and recovery, Deadlock avoidance, Deadlock prevention. File Systems: Files, Directories, File system implementation, management and optimization. Secondary-Storage Structure: Overview of disk structure, and attachment, Disk scheduling, RAID structure, Stable storage implementation

UNIT-V (12Hrs)

System Protection: Goals of protection, Principles and domain of protection, Access matrix, Access control, Revocation of access rights. System Security: Introduction, Program threats, System and network threats, Cryptography for security, User authentication, Implementing security defenses, Firewalling to protect systems and networks, Computer security classification.

Note: discuss the overview of Linux and Microsoft Windows operating systems. Text Books:

1. Silberschatz A, Galvin P B, and Gagne G, Operating System Concepts, 9th edition, Wiley, 2013.

2. Tanenbaum A S, Modern Operating Systems, 3rd edition, Pearson Education, 2008. (for Inter Process Communication and File Systems.)

Reference Books:

1. Dhamdhere D M, Operating Systems A Concept Based Approach, 3rd edition, Tata McGraw-Hill, 2012.

2 Stallings W, Operating Systems -Internals and Design Principles, 6th edition, Pearson Education,2009

3 Nutt G, Operating Systems, 3rd edition, Pearson Education,2004 e-Resources:

1 https://nptel.ac.in/courses/106/105/106105214/

Page 25 of 44

Course Code Category L T P C I.M E.M. Exam B20CB2202 PC 3 -- -- 3 30 70 3 Hrs.

PYTHON PROGRAMMING

(For CSBS)

Course Objectives: Students are expected to learn 1. To learn about Python programming language syntax, semantics, and the runtime

environment 2. To be familiarized with universal computer programming concepts like data types, containers 3. To be familiarized with general computer programming concepts like conditional execution,

loops & functions 4. To be familiarized with general coding techniques and object-oriented programming

Course Outcomes: After completion of the course, the student will be able to S.No Outcome K L

1 Develop essential programming skills in computer programming concepts like data types, containers

K4

2 Apply the basics of programming in the Python language K3 3 Solve coding tasks related conditional execution, loops K3 4 Solve coding tasks related to the fundamental notions and techniques used in

object-oriented programming K3

5 Implement user define exception and GUI application K3

SYLLABUS

UNIT-I (10Hrs)

Introduction: Introduction to Python, Program Development Cycle, Input, Processing, and Output, Displaying Output with the Print Function, Comments, Variables, Reading Input from the Keyboard, Performing Calculations, Operators. Type conversions, Expressions, More about Data Output. Data Types, and Expression: Strings Assignment, and Comment, Numeric Data Types and Character Sets, Using functions and Modules. Decision Structures and Boolean Logic: if, if-else, if-elif-else Statements, Nested Decision Structures, Comparing Strings, Logical Operators, Boolean Variables.

UNIT-II (08Hrs)

Repetition Structures: Introduction, while loop, for loop, Calculating a Running Total, Input Validation Loops, Nested Loops. Control Statement: Definite iteration for Loop Formatting Text for output. Strings and Text Files: Accessing Character and Substring in Strings, Data Encryption, Strings and Number Systems, String Methods Text Files.

UNIT-III (10Hrs)

List and Dictionaries: Lists, Defining Simple Functions, Dictionaries Design with Function: Functions as Abstraction Mechanisms, Problem Solving with Top Down Design, Design with Recursive Functions, Case Study Gathering Information from a File System, Managing a Program’s Namespace, Higher Order Function. Modules: Modules, Standard Modules, Packages.

Page 26 of 44

UNIT-IV (10Hrs)

File Operations: Reading config files in python, Writing log files in python, Understanding read functions, read(), readline() and readlines(), Understanding write functions, write() and writelines(), Manipulating file pointer using seek, Programming using file operations Object Oriented Programming: Concept of class, object and instances, Constructor, class attributes and destructors, Real time use of class in live projects, Inheritance , overlapping and overloading operators, Adding and retrieving dynamic attributes of classes, Programming using Oops support Design with Classes: Objects and Classes, Data modeling Examples, Case Study An ATM, Structuring Classes with Inheritance and Polymorphism

UNIT-V (12 Hrs.)

Errors and Exceptions: Syntax Errors, Exceptions, Handling Exceptions, Raising Exceptions, User-defined Exceptions, Defining Clean-up Actions, Redefined Clean-up Actions. Graphical User Interfaces: The Behavior of Terminal Based Programs and GUI -Based, Programs, Coding Simple GUI-Based Programs, Other Useful GUI Resources. Programming: Introduction to Programming Concepts with Scratch.

Text Books:

1. Fundamentals of Python First Programs, Kenneth. A. Lambert, Cengage. 2. Python Programming: A Modern Approach, Vamsi Kurama, Pearson

Reference Books:

1. Introduction to Python Programming, Gowrishankar.S, Veena A, CRC Press.

2. Programming and Problem Solving with Python, Ashok Namdev Kamthane, Amit Ashok Kamthane, TMH, 2019.

3. Introduction to Programming Using Python, Y. Daniel Liang, Pearson. 4. https://www.tutorialspoint.com/python3/python_tutorial.pdf

Page 27 of 44

Subject Code Category L T P C I.M E.M Exam B20CB2203 PC 3 -- -- 3 25 75 3 Hrs.

DESIGN AND ANALYSIS OF ALGORITHMS

Course Objectives: On completing this course student will be able to

1 Solve problems using algorithm design methods such as the greedy method, divide and conquer, dynamic programming, backtracking, and branch and bound and writing programs for these solutions

2 Analyze the asymptotic performance of algorithms. 3 Demonstrate a familiarity with major algorithms and data structures 4 Synthesize efficient algorithms in common engineering design situations.

Course Outcomes: By the end of the course, the student should have the ability to: S.No Outcome Knowledge

Level

1 Apply the mathematical principle to analyze the efficiency of algorithms by measuring time complexity & space complexity.

K3

2 Apply the Divide-and-Conquer strategy and Greedy Method for solving the complex problems & analyze the performance of solutions.

K3

3 Apply the optimistic strategies Dynamic Programming for computational problems in computer field.

K3

4 Apply the Backtracking and Branch-and-bound strategies for solving complex problems

K3

5 Understand the basic concepts of NP-Hard and NP- Complete and Solve string matching using various algorithms.

K2

SYLLABUS

UNIT-I (10 Hrs)

Introduction: Algorithm Definition, Algorithm Specification, performance Analysis, Randomized Algorithms. Sets & Disjoint set union: introduction, union and find operations. Basic Traversal & Search Techniques: Techniques for Graphs, connected components and Spanning Trees, Bi-connected components and DFS.

UNIT-II (10 Hrs)

Divide and Conquer: General Method, Defective chessboard, Binary Search, finding the maximum and minimum, Merge sort, Quick sort. The Greedy Method: The general Method, container loading, knapsack problem, Job sequencing with deadlines, minimum cost spanning Trees.

UNIT-III (10 Hrs)

Dynamic Programming: The general method, multistage graphs, All pairs-shortest paths, single-source shortest paths: general weights, optimal Binary search trees, 0/1 knapsack, reliability Design, The traveling salesperson problem

Page 28 of 44

UNIT-IV (8 Hrs)

Backtracking: The General Method, The 8-Queens problem, sum of subsets, Graph coloring, Hamiltonian cycles, knapsack problem. Branch and Bound: FIFO Branch-and-Bound, LC Branch-and-Bound, 0/1 Knapsack problem, Traveling salesperson problem.

UNIT-V (12 Hrs)

NP-Hard and NP-Complete problems: Basic concepts, Cook’s Theorem. String Matching: Introduction, String Matching-Meaning and Application, NaÏve String Matching Algorithm, Rabin-Karp Algorithm, Knuth-Morris-Pratt Automata, Tries, Suffix Tree.

Text Books:

1. Ellis Horowitz, SartajSahni, Sanguthevar Rajasekaran, “Fundamentals of Computer Algorithms”, 2nd Edition, Universities Press.

2. Harsh Bhasin, “Algorithms Design & Analysis”, Oxford University Press. Reference Books:

1. S. Sridhar, “Design and Analysis of Algorithms”, Oxford University Press.

Page 29 of 44

Code Category L T P C I.M E.M Exam B20HS2202 PC 3 -- -- 3 30 70 3 Hrs.

FUNDAMENTALS OF MANAGEMENT

(For CSBS)

Course Objectives: Students are expected to 1 To familiarize with the concept of management, functions and principles 2 To provide conceptual knowledge on functional management that is on Human resource

management and Marketing management 3 To provide basic insight into financial aspects and Strategic Management 4 To learn theories of motivation and deals with individual behavior, their attitude and

perception of individuals 5 To understand about Managerial Ethics in Business organizations and know how to manage

employee stress Course Outcomes: After completion of the course, the student will be able to S. No Outcome K L

1 Explain management functions and principles K2 2 Describe the concepts of functional management that is HRM and Marketing

functions K2

3 Discuss about capital and methods to raise finance K2 4 Discuss about vision, mission, goal, objective and a strategy based on which

the corporate planning depends K2

5 Discuss about Individual behaviour and motivational theories K2 6 Describe about Ethics in Business and ways in managing stress K2

SYLLABUS

UNIT-I (10 Hrs)

Introduction to Management: Management: Concept, Nature and importance of Management, Evolution of Management thought, Contribution of Management Thinkers - Taylor’s Scientific Management&Fayol’s principles of Management, Functions of Management - Planning, Organising, Staffing, Directing & Controlling

UNIT-II (10 Hrs)

Functional Management: Human Resource Management(HRM): Concept, Nature & Importance of HRM,Origin and Transmission of HRM, Basic functions of HR Manager: Manpower planning, Recruitment, Selection, Training and Development, Compensation &Performance Appraisal. Marketing Management: Concept, Functions of marketing; Marketing Mix - Product: Stages of Product life cycle, Price, Place: Channels of Distribution&Promotion: Promotion Mix

UNIT-III Financial Management: Capital - Need &Significance of capital, Types of Capital - Fixed capital & Working Capital - Components of Working Capital, Factors influencing Working

Page 30 of 44

(10Hrs) capital. Methods of Raising Finance - Long term, medium term, &Short-term financial sources. Strategic Management: Vision, Mission, Goal, Objective, Policy, Strategy. Elements of Corporate planning process; Environmental scanning; SWOT analysis

UNIT-IV (10 Hrs)

Organizational Behavior: Concept & features of Organizational Behavior, Individual Behavior Determinants: Perception-Perceptual process; Attitude-Attitudinal change, Personality. Motivation: Meaning, Theories of Motivation - Maslow’s Theory of Human Needs, Douglas McGregor’s Theory X and Theory Y, Herzberg’s Two-Factor Theory of Motivation.

UNIT-V (10 Hrs)

Managerial Ethics: Ethics and Business, Ethics of Marketing & advertising, Ethics of Finance & Accounting, Decision – making frameworks, Business and Social Responsibility, International Standards, Corporate Governance, Corporate Citizenship, Corporate Social Responsibility Stress - Causes &Consequences of stress, Types of stress, Strategies to overcome Stress at Individual and Organisational level

Text Books:

1. Richard L. Daft, Understanding the Theory and Design of Organizations Reference Books:

1. Stephen P. Robbins, Timothy A. Judge, Niharika Vohra, Organizational Behavior

Page 31 of 44

Code Category L T P C I.M E.M Exam B20HS2203 HS 3 -- -- 3 30 70 3 Hrs.

BUSINESS COMMUNICATION & VALUE SCIENCE-III

(For CSBS) Leadership Oriented Learning (LOL)

Nature of Course Behavioral Pre requisites Basic Knowledge of English (verbal and written) Completion of all units from

Semesters 1 and 2 Course Objectives:

1 Develop technical writing skills 2 Introduce students to Self-analysis techniques like SWOT & TOWS

3

Introduce students to key concepts of: a) Pluralism & cultural spaces b) Cross-cultural communication c) Science of Nation building

Course Outcomes: Upon completion of the course, students shall have ability to

1 Apply & analyze the basic principles of SWOT & understand Motivation in life scenarios.

K3

2 Identify, understand & apply pluralism & cultural communication in Global, glocal and translocational set-ups.

K4

3 Applying the scientific feature of grammar and vocabulary in everyday’s communication

K2

4 Understand, apply & analyze the tools of technical writing K3 5 Understand the role of science & recognize its impact in daily life K3

Course Contents: Objectives for Semester 4 After completing this semester, learners will be able to:

Summarize the basic principles of SWOT and Life Positions. Apply SWOT in real life scenarios. Recognize how motivation helps real life. Leverage motivation in real-life scenarios. Identify pluralism in cultural spaces. Respect pluralism in cultural spaces. Differentiate between the different cultures of India. Define the terms global, glocal and translocational. Differentiate between global, glocal and translocational culture. Recognize the implications of cross-cultural communication. Identify the common mistakes made in cross-cultural communication. Apply cross-cultural communication. Differentiate between the roles and relations of different genders. Summarize the role of science in nation building. Define AI (artificial intelligence). Recognize the importance of AI. Identify the best practices of technical writing. Apply technical writing in real-life scenarios.

Page 32 of 44

SYLLABUS

UNIT-I

(12 hrs)

SWOT Vs. TOWS: SWOT and Life Positions, SWOT vs. TOWS, Presentation on SWOT. The Balancing Act (Self Analysis) - Basic principles of SWOT & life positions. Ted talks on biomimicry Motivational Skills: Learning motivational skills through Stories and Speeches Maslow’s theory - Recognize how motivation helps real life - Leverage motivation in real-life scenarios

UNIT-II

(12 hrs)

Pluralism in cultural spaces: Identifying Pluralism and Cultural Spaces. Awareness and respect for pluralism in cultural spaces Theory/Discussion. Global, Glocal and translocational cross-cultural communication: Understanding Global, Glocal, Translocational impacts Cross-Cultural Communication, Culture Shock and Gender Awareness

UNIT-III

(8 hrs)

English Grammar & Vocabulary: Error Detection, Voice (Active & passive) Text Completion (Closed/ open) Group Discussion

UNIT-IV

(8 hrs)

Technical Writing: Basic rules of Technical Writing Basic rules of Report Writing and Ad-Making Scenario-based Assessment on technical writing

UNIT-V

(8 hrs)

Role of science in nation building: Introduction to Role of science in nation building- Discussion through Augmented Reality, Role of science post- independence Presentations: Artificial Intelligence in everyday life “Voice of Future”

Text Books: 1. There are no prescribed textbooks for Semester 4 – there will be handouts and reference links shared.

Reference Books: 1 Pringle, A. S., & O’Keefe, S. S. (2009). Technical Writing 101: A Real-World Guide to Planning and

Writing Technical Content (3rd ed.). Scriptorium Publishing Services, Inc. 2 Reynolds, S., Valentine, D., &Munter, M. M. (2019). Guide to Cross-Cultural Communications (2nd

Edition) (Guide to Series in Business Communication) (2nd ed.). Pearson. 3 Hurn, B., & Tomalin, B. (2016). Cross-Cultural Communication: Theory and Practice (1st ed. 2013

ed.). Palgrave Macmillan. 4 Eastwood, John. Oxford Learner's Grammar: Grammar Finder & Checker, 2009. OUP 5 Mc Carthy, Michael, & O’Dell, Felicity, English Vocabulary in Use, Second Ed., 2008. CUP

Web References:

1 Examples of Technical Writing for Students https://freelance-writing.lovetoknow.com/kinds-technical-writing

2 11 Skills of a Good Technical Writer https://clickhelp.com/clickhelp-technical-writing-blog/11-skills-of-a-good-technical-writer/

3 13 benefits and challenges of cultural diversity in the workplace https://www.hult.edu/blog/benefits-challenges-cultural-diversity-workplace/

Page 33 of 44

Online Resources: 1 https://youtu.be/CsaTslhSDI 2 https://m.youtube.com/watch?feature=youtu.be&v=IIKvV8_T95M 3 https://m.youtube.com/watch?feature=youtu.be&v=e80BbX05D7Y 4 https://m.youtube.com/watch?v=dT_D68RJ5T8&feature=youtu.be 5 https://m.youtube.com/watch?v=7sLLEdBgYYY&feature=youtu.be

Page 34 of 44

Code Category L T P C I.M E.M Exam B20CB2204 PC -- -- 3 1.5 15 35 3 Hrs.

OS & UNIX PROGRAMMING LAB

(For CSBS)

Course Objectives: The student who successfully completes this course will have: 1 To understand the design aspects of operating system 2 To study the process management concepts & Techniques 3 To study the storage management concepts 4 To familiarize students with the Linux environment 5 To learn the fundamentals of shell scripting/programming

Course Outcomes: After completion of the course, the student will be able to S. No Outcome KL

1 use Unix utilities and perform basic shell control of the utilities K2 2 use the Unix file system and file access control K2 3 Implement operating system concepts to develop software K3 4 Solve problems using bash for shell scripting K4

SYLLABUS

1

a) Study of Unix/Linux general purpose utility command list: man, who, cat, cd, cp, ps, ls, mv, rm, mkdir, rmdir, echo, more, date, time, kill, history, chmod, chown, finger, pwd, cal, logout, shutdown

b) Study of vi editor c) Study of Bash shell, Bourne shell and C shell in Unix/Linux operating system d) Study of Unix/Linux file system (tree structure) e) Study of .bashrc, /etc/bashrc and Environment variables.

2 Write a C program that makes a copy of a file using standard I/O, and system calls 3 Write a C program to emulate the UNIX ls –l command.

4 Write a C program that illustrates how to execute two commands concurrently with a command pipe. Ex: - ls –l | sort

5 Simulate the following CPU scheduling algorithms: (a) Round Robin (b) SJF (c) FCFS (d) Priority

6 Multiprogramming-Memory management-Implementation of fork(), wait(), exec() and exit() System calls

7 Simulate the following: (a) Multiprogramming with a fixed number of tasks (MFT) (b). Multiprogramming with a variable number of tasks (MVT)

8 Simulate Bankers Algorithm for Dead Lock Avoidance 9 9. Simulate Bankers Algorithm for Dead Lock Prevention

10 Simulate the following page replacement algorithms: (a)FIFO (b) LRU (c) LFU 11 Simulate the following File allocation strategies: (a) Sequenced (b) Indexed (c) Linked 12 Write a C program that illustrates two processes communicating using shared memory.

Page 35 of 44

Reference Books: 1. Forouzan and Gilberg, Unix and Shell Programming Cengage Learning. 2. Yashavant and P.Kanetkar, Unix Shell Programming BPB Publishing.

Page 36 of 44

Code Category L T P C I.M E.M Exam B20CB2205 PC -- -- 3 1.5 15 35 3 Hrs.

PYTHON PROGRAMMING LAB

(For CSBS)

Course Objectives: The student who successfully completes this course will have: 1 To acquire programming skills in core Python. 2 To acquire Object Oriented Skills in Python 3 To develop the skill of designing Graphical user Interfaces in Python 4 To develop the ability to write database applications in Python

Course Outcomes: After completion of the course, the student will be able to S. No Outcome KL

1 Write, Test and Debug Python Programs K4 2 Use Conditionals and Loops for Python Programs K3 3 Use functions and represent Compound data using Lists, Tuples and Dictionaries K3 4 Use various user define applications using python K3

SYLLABUS

1 Write a program that asks the user to enter three numbers (use three separate input statements). Create variables called total and average that hold the sum and average of the three numbers and print out the values of total and average.

2 Write a program that uses a for loop to print the numbers 8, 11, 14, 17, 20, .., 83, 86, 89.

3 Write a program that asks the user for their name and how many times to print it. The program should print out the user’s name the specified number of times.

4

Use a for loop to print a triangle like the one below. Allow the user to specify how high the triangle should be. * ** *** ****

5 Write a program that asks the user to enter a word and prints out whether that word contains any vowels.

6

Write a program that asks the user to enter two strings of the same length. The program should then check to see if the strings are of the same length. If they are not, the program should print an appropriate message and exit. If they are of the same length, the program should alternate the characters of the two strings. For example, if the user enters abcde and ABCDE the program should print out AaBbCcDdEe.

7 Write a program that asks the user for a large integer and inserts commas into it according to the standard American convention for commas in large numbers. For instance, if the user enters 1000000, the output should be 1,000,000.

8 Write a program that generates a list of 20 random numbers between 1 and 100.

Page 37 of 44

(a) Print the list. (b) Print the average of the elements in the list. (c) Print the largest and smallest values in the list. (d) Print the second largest and second smallest entries in the list (e) Print how many even numbers are in the list.

9 Write a function called sum_digits that is given an integer num and returns the sum of the digits of num.

10 Write a function called number_of_factors that takes an integer and returns how many factors the number has.

11 Write a function called primes that is given a number n and returns a list of the first n primes. Let the default value of n be 100.

12 Write a function called merge that takes two already sorted lists of possibly different lengths, and merges them into a single sorted list. (a) Do this using the sort method. (b) Do this without using the sort method.

13 Write a program that asks the user for a word and finds all the smaller words that can be made from the letters of that word. The number of occurrences of a letter in a smaller word can’t exceed the number of occurrences of the letter in the user’s word.

14

Write a class called Product. The class should have fields called name, amount, and price, holding the product’s name, the number of items of that product in stock, and the regular price of the product. There should be a method get_price that receives the number of items to be bought and returns a the cost of buying that many items, where the regular price is charged for orders of less than 10 items, a 10% discount is applied for orders of between 10 and 99 items, and a 20% discount is applied for orders of 100 or more items. There should also be a method called make_purchase that receives the number of items to be bought and decreases amount by that much.

15

Write a class called Time whose only field is a time in seconds. It should have a method called convert_to_minutes that returns a string of minutes and seconds formatted as in the following example: if seconds is 230, the method should return '5:50'. It should also have a method called convert_to_hours that returns a string of hours, minutes, and seconds formatted analogously to the previous method.

16 Write a Python class to implement pow(x, n). 17 Write a Python class to reverse a string word by word.

18 Write a program that opens a file dialog that allows you to select a text file. The program then displays the contents of the file in a textbox.

19 Write a program to demonstrate Try/except/else. 20 Write a program to demonstrate try/finally and with/as.

Reference Books:

1. Introduction to Python Programming, Gowrishankar.S, Veena A, CRC Press.

2. Programming and Problem Solving with Python, Ashok Namdev Kamthane, Amit Ashok Kamthane, TMH, 2019.

Page 38 of 44

Code Category L T P C I.M E.M Exam B20CB2206 PC -- -- 3 1.5 15 35 3 Hrs.

DESIGN AND ANALYSIS OF ALGORITHMS LAB

Course Objectives: 1 Solve problems using algorithm design methods such as the greedy method, divide and conquer,

dynamic programming, backtracking, and branch and bound and writing programs for these solutions

2 Analyze the asymptotic performance of algorithms. 3 Demonstrate a familiarity with major algorithms and data structures 4 Synthesize efficient algorithms in common engineering design situations.

Course Outcomes: Upon Completion of the course, the students will be able to: S. No Outcome Knowledge

Level 1 Apply the Divide-and-Conquer strategy and Greedy Method for solving the

complex problems & analyze the performance of solutions. K3

2 Apply the optimistic strategies Dynamic Programming for computational problems in computer field.

K3

3 Apply the Backtracking and Branch-and-bound strategies for solving complex problems

K3

4 Design and implement different Graph algorithms to solve different problems K4

LIST OF EXPERIMENTS 1 Write a program to implement Quick sort algorithm for sorting a list of integers in ascending

order 2 Write a program to implement Merge sort algorithm for sorting a list of integers in ascending

order. 3 Write a program to implement the DFS algorithm for a graph. 4 Write a. program to implement the BFS algorithm for a graph. 5 Write a program to implement backtracking algorithm for the N-queens problem. 6 Write a program to implement the backtracking algorithm for the sum of subsets problem. 7 Write a program to implement the backtracking algorithm for the Hamiltonian Circuits problem. 8 Write a program to implement greedy algorithm for job sequencing with deadlines. 9 Write a program to implement Dijkstra’s algorithm for the Single source shortest path problem.

10 Write a program that implements Prim’s algorithm to generate minimum cost spanning tree. 11 Write a program that implements Kruskal’s algorithm to generate minimum cost spanning tree 12 Write a program to implement Floyd’s algorithm for the all pairs shortest path problem. 13 Write a program to implement Dynamic Programming algorithm for the 0/1 Knapsack problem. 14 Write a program to implement Dynamic Programming algorithm for the Optimal Binary Search

Tree Problem. Reference Books:

1. Ellis Horowitz, SartajSahni, Sanguthevar Rajasekaran, “Fundamentals of Computer Algorithms”, 2nd Edition, Universities Press.

2. Harsh Bhasin, “Algorithms Design & Analysis”, Oxford University Press.

Page 39 of 44

Code Category L T P C I.M E.M Exam B20IT2207 SC - -- 4 2 15 35 3 Hrs

ANIMATIONS (SOC-1)

(Common to AIDS, CSBS & IT)

Course Objectives: The objectives of the course are to impart: 1. This Course will enable students to learn various aspects of animation using a variety of 2-D

software and to implement advance principles of traditional animation in Adobe animate to create high

Course outcomes : After completion of the course, students will be able to K L

1 Learn various tools of digital 2-D animation. K2 2 Understand production pipeline to create 2-D animation. K2 3 Analyze special effects in animation to bring interest and awe in the scenes and

Back grounds. K3

4 Apply the tools to create 2D animation for films and videos. K3

SYLLABUS

Adobe Photoshop

Create your visiting card Create Title for any forthcoming film Digital Matte Paint Convert Black and White to Color Convert Day mode to Night mode Design Image manipulation Smooth skin and remove blemishes & scars Create a 3D pop-out effect Create Textures Timeline Animation

Adobe Illustrator

Advertisement Digital Illustrations Brochure Packet Design(Toothpaste packet, Soap cover, any Food product) Danglers for display Menu cards Calendar Design Tracing image Vehicle Design Festival

Adobe In design

Magazine A4 Size Newspaper layout design & advertisements – Fine arts Special Supplement

Page 40 of 44

Different categories of Books Info-graphics Caricatures

Corel DRAW

Create a paper ad for advertising of any commercial agency Package Design Corporate ID Exhibition Layout Oblers

Animation

Creating Web Banners in Adobe Flash Creating a Logo Animation in Adobe Flash Creating Frame by Frame animation Draw Cartoon Animation using reference. Create Lip Sink to Characters Using filters & Special effects Create a scene by using Mask layers animation E-Learning Lab: Student Application form Video Controlling Audio Controlling Start Drag and Stop Drag Actions Interactive Keyboard Controls using Flash Action Script. Interactive Flash Game. Creating Character Animation in After Effects

Page 41 of 44

WEB PAGE DESIGN USING PHP(SOC-2)

Course Objectives: The objectives of the course are to impart: 1. Understand the principles of creating an effective web page. 2. Understand elements of design with regard to the web. 3. Learn the language of the web: HTML and CSS. 4. Develop skills in analyzing the usability of a web site. 5. Understand how to develop PHP web application with database connectivity. 6. Learn CSS grid layout.

Course outcomes : After completion of the course, students will be able to K L

1 Apply the principles of creating an effective web page. K3 2 Apply the elements of design with regard to the web. K3 3 Create the language of the web: HTML and CSS. K4 4 Develop skills in analyzing the usability of a web site. K4 5 Understand how to plan and conduct user research related to web usability. K2 6 Create CSS grid layout K4

SYLLABUS

Exercise 1

Introduction to HTML 1.1 What is HTML 1.2 HTML Documents 1.3 Basic structure of an HTML document 1.4 Creating an HTML document 1.5 Mark up Tags 1.6 Heading-Paragraphs 1.7 Line Breaks 1.8 HTML Tags.

Exercise 2

Elements of HTML 2.1 Introduction to elements of HTML 2.2 Working with Text 2.3 Working with Lists, Tables and Frames 2.4 Working with Hyperlinks, Images and Multimedia 2.5 Working with Forms and controls.

Exercise 3

Introduction to Cascading Style Sheets 3.1 Concept of CSS 3.2 Creating Style Sheet 3.3 CSS Properties 3.4 CSS Styling(Background, Text Format, Controlling Fonts) 3.5 Working with block elements and objects

3.6 Working with Lists and Tables 3.7 CSS Id and Class 3.8 Box Model (Introduction, Border properties, Padding Properties, Margin properties)

Page 42 of 44

Exercise 4

4.1 The Basic of JavaScript: Objects, 4.2 Primitives Operations and Expressions, 4.3 Screen Output and Keyboard Input,' 4.4 Object Creation and Modification, Arrays, Functions 4.5 DHTML: Positioning Moving and Changing Elements

Exercise 5

5.1 Introducing PHP: Creating PHP script, 5.2 Running PHP script. 5.3 Using variables,constants,Datatypes, Operators. 5.4 Conditional statements, Control statements, Arrays ,functions 5.5 Working with forms and Databases such as MySQL. 5.6 Develop PHP MySQL CRUD Application

Text Books:

1. Web Technologies, Uttam K Roy, Oxford

2. HTML 5 Black Book (Covers CSS3, JavaScript, XML, XHTML, AJAX, PHP, jQuery) 2Ed, Dreamtech Press; Second edition

3. The Web Warrior Guide to Web Programming, Bai, Ekedahl, Farrelll, Gosselin, Zak,Karparhi, Maclntyre, Morrissey, Cengage

Reference Books:

1. Learning PHP, MySQL & JavaScript with j Query, CSS & HTML5, Shroff Publishers & Distributers Private Limited - Mumbai; Fourth edition

2. PHP: The Complete Reference, McGraw Hill Education; Raunak php study edition

Page 43 of 44

Code Category L T P C I.M E.M Exam

B20MC2201 MC 2 -- -- -- -- -- --

ENGLISH PROFICIENCY (Common to CE,ME,AIDS & CSBS)

Course Objectives: The students will be able to 1. Communicate their ideas and views effectively 2. Practice language skills and improve their language competency. 3. Know and perform well in real life contexts 4. Identify and examine their self-attributes which require improvement and motivation. 5. Build confidence and overcome their inhibitions, stage freight, nervousness etc., 6. Improve their reading skills.

Course Outcomes: The students will S.No Outcome Knowledge

Level 1. Improve speaking skills. K3 2. Enhance their listening capabilities K3 3. Learn and practice the skills of composition writing. K3 4. Enhance their reading and understanding of different texts. K3 5. Improve their communication both in formal and informal contexts. K3 6. Be confident in presentation skills. K3

SYLLABUS

UNIT-I

Listening Skills Types of listening Hearing and Listening Listening as a receptive skill

UNIT-II

Speaking Skills Presentation skills Describing event/place/thing Extempore Debate Group Discussion

UNIT-III Reading Skills Types of Reading (Intensive and Extensive reading, Skimming, Scanning) Reading/Summarizing News Paper Articles

UNIT-IV

Writing Skills Essay Writing (Argumentative, Analytical and Descriptive) E-Mail Writing Business Letters Resume Writing

Page 44 of 44

UNIT-V Integrated Language Skills Listening Skills for Speaking and Writing Reading Skills for Writing and Speaking

Reference Books:

1. Fundamentals of Technical Communication by Meenakshiraman, Sangeta Sharma of OUP

2. English and Communication Skills for Students of Science and Engineering, by S.P. Dhanavel, Orient Blackswan Ltd. 2009

3. Enriching Speaking and Writing Skills, Orient Blackswan Publishers.

4. The Oxford Guide to Writing and Speaking by John Seely OUP.

5. Effective Technical Communication by M.AshrafRizwi. Tata Mcgraw hill.

6. Six Weeks to Words of Power by Wilfred Funk. W.R.Goyal Publishers

Note: Internal Assessment is carried out throughout the semester.