B.Tech CSE IV Sem Scheme and Syllabus

Download as docx, pdf, or txt
Download as docx, pdf, or txt
You are on page 1of 13

ANNEXURE-II

MEDI-CAPS UNIVERSITY, INDORE


DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING
Syllabus

B.Tech CSE-Core Semester IV Batch 2021-2025


Sr. No. Course Code Courses L T P Credit
1 CS3ELXX Elective-1 3 0 2 4
2 CS3CO35 Microprocessor and Interfacing 3 0 2 4
3 CS3CO36 Operating Systems 3 0 2 4
4 CS3CO37 Advanced Java Programming 2 0 2 3
5 CS3CO38 Theory of Computation 4 0 0 4
6 CS3CO39 Database Management Systems 3 0 2 4
7 EN3NG07 Sports 2 0 0 2
Total 20 0 10 25
Total Contact Hours 30
Elective-1:
Track : Artificial Intelligence, Data Science, Data Engineering: CS3EL11
Statistical Analysis
Track: Web Technology: CS3EL12 : Cloud Computing

B.Tech CSE-AI Semester IV Batch 2021-2025


Sr. No. Course Code Courses L T P Credit
1 CS3EL11 Elective-1: Statistical Analysis 3 0 2 4
2 CS3CO35 Microprocessor and Interfacing 3 0 2 4
3 CS3CO36 Operating Systems 3 0 2 4
4 CS3CO37 Advanced Java Programming 2 0 2 3
5 CS3CO38 Theory of Computation 4 0 0 4
6 CS3CO39 Database Management Systems 3 0 2 4
7 EN3NG07 Sports 2 0 0 2
Total 20 0 10 25
Total Contact Hours 30

B.Tech CSE-IOT Semester IV Batch 2021-2025


Sr. No. Course Code Courses L T P Credit
1 CS3EL12 Elective-1: Cloud Computing 3 0 2 4
2 CS3CO35 Microprocessor and Interfacing 3 0 2 4
3 CS3CO36 Operating Systems 3 0 2 4
4 CS3CO37 Advanced Java Programming 2 0 2 3
5 CS3CO38 Theory of Computation 4 0 0 4
6 CS3CO39 Database Management Systems 3 0 2 4
7 EN3NG07 Sports 2 0 0 2
Total 20 0 10 25
Total Contact Hours 30

B.Tech CSE-DS Semester IV Batch 2021-2025


Sr. No. Course Code Courses L T P Credit
1 CS3EL11 Elective-1: Statistical Analysis 3 0 2 4
2 CS3CO35 Microprocessor and Interfacing 3 0 2 4
3 CS3CO36 Operating Systems 3 0 2 4
4 CS3CO37 Advanced Java Programming 2 0 2 3
5 CS3CO38 Theory of Computation 4 0 0 4
6 CS3CO39 Database Management Systems 3 0 2 4
7 EN3NG07 Sports 2 0 0 2
Total 20 0 10 25
Total Contact Hours 30

Course Code Course Name Hours Per Week

CS3EL12 Cloud Computing L T P Credits


3 0 2 4

Unit I:
Introduction to cloud computing, characteristics of cloud computing as per NIST, cloud
reference model, application of cloud computing ECG analysis, protein structure prediction,
cloud deployment models.

Unit II:
Virtualization, virtualization advantages, Full virtualization, para-virtualization, hypervisors.
Cloud interoperability, cloud service management, cloud analytics, Cloud broker, Capex,
Opex, cloud architecture.

Unit III:
Platform as a service, Infrastructure as a service, software as a service, Desktop as a service,
Backup as a service, DRaaS, Introduction to SLA, SLA lifecycle, SLA management, Business
continuity plan.

Unit IV:
Cloud security fundamentals, vulnerability assessment, security architecture, identity
management and access control, data at rest, data in flight, data in motion, security in
virtualization.

Unit V:
Cloud application development platforms, Xen hypervisor, AWS, Google app engine, open
stack.

Text Books:
1. S. Chand,R.Buyya, C. Vecchiola, S.T. Selvi, “Mastering Cloud Computing,” McGraw Hill
Education
2. T. Velte, A. Velte and R. Estenpeter, “Cloud Computing –A practical approach, McGraw Hill
Education

Reference Books:
1. K. Chandrasekaran, “Essentials of Cloud Computing,” CRC Press
2. Thomas Erl, Zaigham Mahmood, RichardoPuttini, Cloud Computing: Concepts, Technology
& Architecture, ServiceTech press
3. K Jayaswal, J Kallakurchi, Donald Houde, Deven Shah, Cloud Computing Black Book,
Dreamtech Press.
Course Hours per Week
Course Name
Code L T P Credit

CS3EL11 Statistical Analysis 3 0 2 4

Unit I: Summarizing Data using Statistical Measures:

Descriptive Statistics – Measure of central tendency - Mean: Arithmetic mean, Geometric


mean and Harmonic mean with its Mathematical properties, Properties of mean, Median and
mode, Relationship among mean, median and mode, Measure of dispersion – standard
deviation, Variance, Covariance and its properties, Coefficient of variation, Quartiles,
Quartile deviation and Mean deviation.

Unit II: Theory of Random variables and Probability:

Random variables- Discrete and Continuous random variables, Mass and Density function
(pmf, pdf), Cumulative Distribution function, Expectation of a random variables, Expectation
of random variable in terms of variance, Introduction to probability theory, Trial and Event,
law of probability theory, Introduction to Conditional probability.

Unit III: Probability Distribution:

Discrete Distribution: Binomial, Poisson distribution with mean variance, Moment


generating function.
Continuous Distribution: Normal and Exponential Distribution with mean variance,
Moment generating function.

Unit IV: Curve fitting, Correlation, Regression:

Curve fitting (Method of Least Square), linear and nonlinear curves, Correlation, Karl
Pearson’s Coefficient of Correlation, Spearman’s Rank Correlation Coefficient, Linear
Regression, Regression coefficients, Properties of regression curve.

Unit V: Testing of Hypothesis and Analysis of variance:

Introduction to testing of hypothesis, Statistical assumptions, Level of significance,


Confidence level, Type I Error, Type II error, Critical value, Power of the test, sampling
distribution, Chi-Square test, small sample test – t test for one and two sample mean, F test,
Fisher Z test of population variance, Introduction to one way and two way analysis of
variance (ANOVA).
Text Books
1. S.C. Gupta and V.K. Kapoor, “Fundamentals of Mathematical Statistics”, Sultan Chand
& Sons Publication.
2. Probability and Statistics, Ravichandran, Wiley India.
Reference Books
1. Sheldon M. Ross, “Introduction to Probability Models”, Elsevier Publication, Academic
Press, UK
2. Sheldon M. Ross, “Introduction to Probability and Statistics for Engineers and
Scientists”, Elsevier Publication, Academic Press, UK
Hours per
Course Code Course Name Week Total
L T P Credits
CS3CO35 Microprocessor & Interfacing 3 0 2 4

UNIT-I

Introduction to 8 bit microprocessor: Microcomputers and microprocessors, 8/ 16/ 32/ 64-bit


microprocessor families; Internal architecture of Intel 8085 microprocessor: Block diagram,
Registers, Internal Bus Organization, Functional details of pins, Control signals, External
Address / Data bus multiplexing, De-multiplexing, Serial communication and DMA features,
Intel 8086, x86 and Pentium microprocessors Block diagrams.

UNIT-II
Assembly Language Programming: 8085 instruction set: Instructions, Classifications,
Addressing modes, Stack and Subroutines, Delay routines, Counters etc., Programming
examples.

UNIT-III
Interfacing concepts and devices: Memory interface: Concept of memory chip/ chips interface to
8085 with appropriate examples, / IO mapped I/ O, and memory mapped I/ O techniques.
Programmable interfacing devices: - Programmable peripheral interface (Intel 8255),
Programmable timer interface (Intel 8253/ 54), Programmable display / Keyboard interface (Intel
8279), Programmable serial communication interface (Intel 8251)-(their architecture, register
organization, initialization, hardware and software interface to 8085.

UNIT- IV
Instruction Timing and Interrupts: Timing Diagrams (of various instructions): T- state, Machine
cycle (Opcode fetch, Read / Write, Interrupts, Interrupt Acknowledge, Bus Idle, etc), Interrupts:
-types (h/ w and s/ w), Maskable / Non maskable and their organization.

UNIT V
Introduction to Intel Architecture, How an Intel Architecture System works, Internal architecture
of Basic Components of the Intel Core 2 Duo Processor: The CPU, Memory Controller, I/O
Controller; Intel Core i7: Architecture, The Intel Core i7 Processor, Intel QuickPath
Interconnect, The SCH; Intel Atom Architecture. Introduction to Texas Instruments’ Multi-Core
Multilayer SoC architecture for communications, infrastructure equipment.

TEXT BOOKS:
1. Gaonkar: Microprocesors, Architecture, Programming and Applications, Wiely Eastern,
4th ed.
2. K. UdayaKumar, B.S. Umasankar, “The 8085 Microprocessor-Architecture,
Programming and Interfacing”, 5e, ISBN : 978 – 81 – 7758 – 455 - 4
3. Nagoor Kani, Microprocessors, architecture and programming, RBA Publications.
4. Douglas V. Hall , Microprocessors, Interfacing and Peripherals, Tata McGraw Hill,2nd
ed.

REFERENCE BOOKS:
1. Calvin Lin. Lawrence Snyder: Principles of Parallel Programming, Pearson Education.
2. Michael J. Quinn : Parallel Programming in C with MPI and Open MP, Tata Macgraw
Hill.
3. Reinders : Intel Threading Building Blocks, O’reilly.
4. David Culler et. Al.: Parallel Computer Architecture : A Hardware/Software Approach,
Elsevier.
Hours per Week
Course Code Course Name L T P Credit
Operating
CS3CO36 3 0 2 4
Systems

Unit I: Introduction Language Processors, Language Processing Activities and Language


Processors Development Tools, Assemblers, Compiler, Macros and Macro Processors,
Linkers, Introduction to OS. Operating system functions, evaluation of O.S., Different types
of O.S.: Batch, Multi-Programmed, Time-Sharing, Real-Time, Distributed, Parallel.

Unit II: Process: Concept of Processes, Process Scheduling, Operations on Processes,


Cooperating Processes, Inter-Process Communication. Precedence Graphs, Critical Section
Problem, Semaphores, Threads. CPU Scheduling: Scheduling Criteria, Preemptive & Non-
Preemptive Scheduling, Scheduling Algorithms, Algorithm Evaluation, Multi-Processor
Scheduling, Deadlock: Deadlock Problem, Deadlock Characterization, Deadlock Prevention,
Deadlock Avoidance, Deadlock Detection, Recovery From Deadlock, Methods for Deadlock
Handling.

Unit III: Memory Management: Concepts of Memory Management, Logical and Physical
Address Space, Swapping, Fixed and Dynamic Partitions, Best Fit, First Fit and Worst Fit
Allocation, Paging, Segmentation, and Paging Combined With Segmentation.

Unit IV: Concepts of Virtual Memory, Cache Memory Organization, Demand Paging, Page
Replacement Algorithms, Allocation of Frames, Thrashing, Demand Segmentation, Role of
Operating System in Security, Security Breaches, System Protection, and Password
Management.

Unit V: Disk Scheduling, File Concepts, File Manager, File Organization, Access Methods,
Allocation Methods, Free Space Managements, Directory Systems, File Protection, File
Organization & Access Mechanism, File Sharing Implement Issue, File Management in
Linux, Introduction to Distributed Systems.

Text Books:
1. Silberschatz, Galvin, Operating Systems Concepts, Wiley Publications.
2. Andrew S. Tenenbaum, Modern Operating Systems, Pearson Education Asia / PHI.

Reference Books:

1. Terrence Chan, UNIX System Programming Using C++, Prentice Hall India.
2. W. Richard Stevens, Advanced Programming in UNIX Environment, Pearson Education.
3. William Stallings, Operating Systems, Pearson Education Asia.

Course Course Name Hours Per Week


Code

L T P Credits
CS3CO37 Advanced Java Programming
2 0 2 4

Unit-I: Collection and Generic


Introduction to Generics , Generics Types and Parameterized Types, WildCards , Java Collection
Framework, Collections (Basic Operations, Bulk Operations, Iteration) List, Set, Maps Lambda
Expressions - Lambda Type Inference, Lambda Parameters, Lambda Function Body, Returning a
Value,From a Lambda Expression, Lambdas as Objects.

Unit-II: Introduction Java EE Programming


Basics of Web Application, web client and web server, JSP Architecture, JSP building blocks,
Scripting Tags,implicit object,Introduction to Bean,standard actions,session tracking types and
methods. Custom Tags, Introduction to JSP Standard Tag Library (JSTL) and JSTL Tags.

Unit-III: Servlets
Servlets, HTTP Methods; GET, POST, PUT, DELETE, TRACE, OPTIONS, MVC design
pattern, Init Parameters, Servlet Context, Inter Servlet Communication, Servlet Listeners, Servlet
Filters.

Unit-IV: Spring Frameworks


Introduction to Spring Framework,POJO Programming Model, Lightweight Containers(Spring
IOC container, Configuration MetaData, Configuring and using the Container) Dependency
Injection with Spring- Setter Injection, Constructor Injection

Unit-V: JDBC and Spring Boot


Managing JDBC Connection, Configuring Data Source to obtain JDBC Connection, Data Access
operations with Jdbc Template and Spring, RDBMS operation classes , Modelling JDBC
Operations as Java Objects, Spring Boot and Database, Spring Boot Web Application
Development

Text Books:
(1) “Core Java for Impatients”, Cay S. Horstman
(2) “Java : The Complete Reference”, Herbert Schildt
Reference Books:
(3) “Head First Java”, Kathy Sierra, Bert Bates
(2) “Java for Dummies”, Barry A. Burd
(5) “Effective Java”, Joshua Bloch
Course Course Name Hours Per Week
Code

L T P Credits
CS3CO38 Theory of Computation
4 0 0 4

Prerequisite:
Students should have a background in discrete mathematics, data structures, and programming
languages.

COURSE CONTENTS

Unit-I: Finite Automata and Regular Languages


Motivation for studying theory of computation, Notion of formal languages and grammars, Kleene’s
Closure, Regular Expressions and Regular languages, closure properties of regular languages, Finite
Automata. Finite Automata with output: Mealy and Moore machines, applications.

Unit-II: Nondeterminism and Minimization


Nondeterministic Finite Automata, Acceptance condition. Kleene’s Theorem, Myhill-Nerode
relations, Minimization Algorithm, Non-Regular languages, Pumping Lemma for regular languages.

Unit-III: Grammars and Context-Free Languages


Grammars and Chomsky Hierarchy, Context-Free Grammars, Context-Free Languages (CFLs),
Inherent Ambiguity of CFLs, closure properties of CFLs, Eliminating useless symbols; null-
productions; and unit productions, Chomsky Normal Form, Greibach Normal Form, Cock-Younger-
Kasami(CYK) Algorithm, Applications to Parsing.

Unit-IV: Pushdown Automata


Pushdown Automata (PDAs), PDAs vs CFLs. Deterministic PDAs and CFLs, applications, notion of
acceptance for PDAs: acceptance by final states, and by empty stack; the equivalence of the two
notions, Proof that CFGs generate the same class of languages that PDAs accept, Pumping Lemma for
CFLs.

Unit-V: Turing Machines and Computability


Introduction to Turing Machines, Configurations, Halting vs Looping, Turing computability,
Nondeterministic, multitape and other versions of Turing machines. Church`s thesis, Universal Turing
Machines, Linear Bounded Automata (LBAs) and context-sensitive languages, Recursive and
Recursively enumerable languages, Undecidability of Halting Problem and unsolvable problems about
Turing Machines, the diagonalization language and proof that it is not Recursively enumerable.
Text Books:
1. Peter Linz, An Introduction to Formal Languages and Automata, Jones &Bartlett Learning,
Canada.
2. John C. Martin, Introduction to Languages and the Theory of Computation, Tata McGrawHill.

Reference Books:
1. J.E. Hopcroft, Rajeev Motwani and J.D.Ullman, Introduction to Automata, Languages and ‘
Computation, Pearson Education, Asia.
2. Daniel I.A. Cohen, Introduction to Computer Theory, John Wiley.
3. H.R. Lewis and C.H.Papadimitrou, Elements of the Theory of Computation, Prentice Hall Inc.
Hours per Week
Course Code Course Name L T P Credit

CS3CO39 Database Management System 3 0 2 4

Unit I
Basic Concepts: Data Vs Information, Definition of Database, Advantages of Database
Systems, Components of DBMS, DBMS Architecture and Data Independence, Data
modeling, Entity Relationship Model, Relational, Network, Hierarchical and Object Oriented
Models. Data Modeling Using The Entity Relationship Model.

Unit II
Relational Database: Relational Databases, Relational Algebra, Relational Algebra Operation,
Tuple Relational Calculus, Domain Relational Calculus. Data Definition with SQL, Inserts,
Delete and Update Statements in SQL, Views, Data Manipulation with SQL, PL/ SQL
constructs: Triggers, Cursors etc.

Unit III
Database Design: Design Guidelines, Key concepts, Relational Database Design, Integrity
Constraints, Domain Constraints, Referential Integrity, Functional Dependency,
decomposition,
Normalization Using Functional Dependencies: Normal Forms, First, Second and Third
Normal Forms. Boyce Codd Normal Form, Multivalued Dependencies and Forth Normal
Form, Join Dependencies and Fifth Normal Form, Decomposition in 2NF, 3NF and BCNF.

Unit IV
Database Transactions Processing: Introduction to Transaction Processing, Transaction
Concepts, Desirable Properties of Transactions, Schedules, Concepts of Recoverability and
Serializability, Concurrency control: introduction, locking protocols.

Unit V
Query Processing and Optimization, File organization and indexes, hashing techniques, B
tree, B+ tree etc. Introduction to advanced databases: Distributed databases, Object oriented
databases, mobile and web databases, Introduction to data warehousing and mining.

Text Books:
1. F.R. Mcfadden, J. Hoffer, M.Prescott, Modern Database Management, Addison Wesley.
2. Elmasri, Navathe, Fundamentals of Database System, Pearson Education Asia.

Reference Books:
1. C.J. Date, An Introduction to Database Systems, Pearson Education Asia.
2. Henry F Korth, Abraham Silbershatz, Database System Concepts, Mc Graw Hill .

You might also like