Computer Science and Engineering (Detailed Syllabus of 5th Semester)

L: Lecture, T: Tutorial, P: Practical, C: Credit

SEMESTER V

CODE SUBJECT L T P C

CSE3116 Theory of Computation 3 1 0 4

CSE3117 Microprocessors & Interfacing 3 1 0 4

CSE3118 Operating System 3 0 0 3

CSE3119(1-4) Professional Elective-I(CSE Annexure - I) 3 0 0 3

CSE3120 Microprocessors & Interfacing Lab 0 0 3 2

CSE3121 APP development Lab 0 0 3 2

CSE3122(1-3) Elective Lab – I (CSE Annexure - II) 0 0 3 2

CSE3123 Industrial Training and Seminar 0 0 2 1

HSS3103 Humanities & Social Sciences 1 0 0 1

PFD3105 Professional Development 0 0 1 1

TOTAL 13 2 12 23

Assessment:

PRE ESE

TA Mid semester Total

20 30 50 50

PRE- Progressive Review Examination TA- Teacher Assessment ESE-End Semester Examination

Semester: V Branch: Computer Science & Engineering Subject: Theory of Computation Code: CSE3116

…………………………………………………………………………………………………… Course Description: The course introduces fundamental concepts in automata theory including grammar, finite automaton, regular expression, formal language, pushdown automaton, and Turing machine. Not only they form basic models of computation, they are also the foundation of many branches of computer science, e.g. compilers, software engineering, concurrent systems, etc. The properties of these models will be studied and various rigorous techniques for analyzing and comparing them will be discussed, by using both formalism and examples.

Course Objectives:

1. To understand the basic properties of formal languages and formal grammars. 2. Understanding how to construct finite state machines and the equivalent

regular expressions. 3. To learn writing context free grammar and designing acceptors for various

context free languages. 4. Construction of Turing machines and Post machines and also to prove the

equivalence of languages described by these machines. 5. To understand the concepts of tractability and decidability.

Course Detail:

Unit-1: Introduction: Strings and Languages, automata,

Unit-2: Finite Automata and Regular expression: DFA, NFA, Regular Expression, Pumping lemma, state minimization. Unit-3: Context Free Languages:

CFG, CNF and GNF, pumping lemma, parsing Unit-4: Push down Automata: DPDA, NPDA, Push down automata and context free languages Unit-5: Turing Machine and Computability:

TM, Recursive and RE languages, equivalent models, UTM, Undecidable problems, Turing computable functions, reduction,

Course Outcome:

At the end of the course, the student would be able to:-

1. Design various formal languages and also categorize them. 2. Design acceptors for various types of formal languages. 3. Identify the decidable and undecidable problems.

Text Books

1. Theory of Computer Science (Automata Language & Computation), K.L.P. Mishra and N. Chandrasekran, PHI.

2.

3. John E Hopcroft, Rajeev Motwani, Jeffrey D Ullman, Introduction to Automata Theory, Languages, and Computation, third edition, Prentice Hall, 2007.

Reference Books: 1. Dexter C Kozen, Automata and Computability, Springer, 1997. 2. Harry R Lewis and Christos H Papadimitriou, Elements of the Theory of

Computation, second edition, Prentice Hall, 1998. 3. Michael Sipser, Introduction to the Theory of Computation, second edition,

Course Technology, 2005.

Semester: V Branch: Computer Science & Engineering Subject: Microprocessors & Interfacing Code: CSE3117

…………………………………………………………………………………………………… Course Description The purpose of this course is to impart knowledge of microprocessor architecture & programming, interfacing and co-processors which gives foundation to advanced microprocessor architecture and microcontrollers.

Course Objectives

1. To study the Architecture of 8085 microprocessors 2. To study the Architecture of 8086 and 8088 microprocessors 3. To learn the design aspects of I/O and Memory Interfacing circuits 4. To learn basic assembly language programming. 4. To study about advance microprocessors 5. To study the Architecture of 8051 microcontroller

Course Detail:

Unit- 1: INTEL 8085 ARCHITECTURE

Introduction to 8085 - 8085 architecture - Pin Details - Addressing Modes Instruction Set and Assembler Directives - Instruction Timing Diagram - Assembly Language Programming with 8085.

Unit- 2: INTEL 8086/8088 ARCHITECTURE

Introduction to 8086/8088-8086/8088 Architecture - Pin Details - Addressing Modes - Instruction Set and Assembler Directives - Assembly Language Programming with 8086/8088-Basic Peripherals and their interfacing with 8086/8088 - Semiconductor Memory interfacing-Dynamic RAM Interfacing.

Unit- 3: I/O and MEMORY INTERFACING USING 8085/8086

Interrupt of the 8085 Microprocessor - Interrupt of 8086/8087 Microprocessor, Programmable Interrupt Controller 8259A Architecture - Command Words of 8259 - Operating modes, Interfacing I/O Ports - PIO 8255 Architecture - Modes of Operation, Programmable Interval Timer 8253 Architecture - Operating modes.

Unit- 4: COMMUNICATION AND BUS INTERFACING WITH 8085/8086

Introduction - Serial Communication Interface 8251, DMA Controller 8237 - Architecture-Register organization - DMA Operation, Keyboard and Display I/O Interface 8279 - Architecture - Modes of Operation - Command Words of 8279 - CRT Controller 8275 - Analog to Digital Interfacing Architecture - Bus Interface - UART 8250.

Unit- 5: MICROCONTROLLERS 8051

Introduction - Architecture of 8051 Microcontroller - Memory organization - Pin diagram of 8051 Microcontroller - Addressing Modes - Instruction set -

Timers/counters - serial Communication- assembly Language programs - Applications of Microcontrollers.

Course Outcomes:

At the end of the course, the student would be able to:-

1. Understand how processor works. 2. Analyse, specify, design, write and test assembly language programs of

moderate complexity. 3. Explore advance processors like 8086/8088 4. Know interrupt handling and I/O interfacing 5. Implement practical problems through microcontroller 8051

Text Books:

1. Ray A K, K M Bhurchandi, “Advanced Microprocessor & Peripherals”, Tata McGraw, Hill, Second Edition, 2012.

Reference Books:

1. Soumitra Kumar Mandal, “Microprocessor & Microcontrollers”, Tata McGraw Hill, Second Edition, 2012.

2. Barry B. Brey, “The Intel Microprocessor8086/8088, 80186”, Pearson Education, Eighth Edition, 2009.

3. Uma Rao, Andhe Pallavi, “The 8051Microcontrollers”, Pearson Education, Second Impression, 2011.

4. Krishna Kant, “Microprocessors & Microcontrollers”, PHI Learning Private Limited, Eighth Printing, 2011.

Semester: V Branch: Computer Science & Engineering Subject: Operating Systems Code: CSE3118

…………………………………………………………………………………………………… Course Description: This course will provide an introduction to operating system design and implementation. The course starts with evolution and then covers the major components of operating systems. The discussion will cover the tradeoffs that can be made between performance and functionality during the design and implementation of an operating system. Particular emphasis will be given to three major OS subsystems: process management (processes, threads, CPU scheduling, synchronization, and deadlock), memory management (segmentation, paging, swapping) and file systems. Linux / Unix is studied at the end as a case study.

Course Objectives:

1. To learn the fundamentals of Operating Systems functions, features and

services 2. To understand the concepts of process and resource management 3. To understand the memory hierarchy, memory technologies and memory

management. 4. To gain insight of Linux/Unix system 5. To know how operating system manages complexity through appropriate

abstraction of CPU, memory, files, processes etc.

Course Detail:

UNIT –1: Operating System Introduction: Operating systems objectives, functions, architecture, structures, operations, Evolution , services, Design and Implementation issues System calls , system Programs, virtual machine.

UNIT- 2: Process Management:

Process concept, Inter process communication, multithreading – concepts, issues, examples. CPU scheduling: concepts, performance, criteria, algorithms, multiprocessor scheduling.

UNIT 3: Process Coordination: critical section problem, software and hardware solutions, semaphores, monitors, atomic transactions, classical synchronization problems. Deadlock: characterization, Prevention, Avoidance and Detection, Recovery, combined approach to handle deadlocks.

UNIT- 4: Memory and File Systems: Memory management - Virtual Memory concepts Partitioning, Paging, Segmentation, performance, page Replacement algorithms, cache memory organization. File system: File Concepts – File organization and Access mechanism, File Directories, File sharing, Implementation issues.

UNIT 5: LINUX/UNIX Systems:

History and evolution, Design Principals, Process management, scheduling, memory management, file systems, IPC, System calls.

Course Outcome:

At the end of the course students will:

1. Gain an insight into how programming languages, operating systems, and architectures interacts and provide an environment to the user.

2. Get an idea regarding tradeoffs that can be made between performance and functionality during the design and implementation of an operating system.

3. get knowledge about different functions of operating system i.e. Process Management, resource management,

4. Be able to conceptualize the components involved in designing a contemporary Operating system.

Text Books

1. Operating System Concepts by Silberschatz and Galvin, Wiley India, 8th edition 2. Operating Suystems by William Stalling, Pearson Education, 6th edition

Reference Books:

1. Modern Operating Systems, Andrew S. Tanenbaum, Pearson Education, 4th Edition

2. Operating System by Achyut S Godbole and Atul Kahate, TMH, 3rd edition 3. Operating Systems a Concept Based Approach, Dhananjay Dhamdhere, TMH,

3rd edition.

Semester: V Branch: Computer Science & Engineering

Subject: Cloud Computing Code: CSE3119(1)

…………………………………………………………………………………………………… Course Description: This course is designed to introduce the concepts of Cloud Computing as a new computing paradigm. The course will expose students to different views of understanding the Cloud Computing such as theoretical, technical and commercial aspects.

Course Objectives:

1. To provide students with the fundamentals and essentials of Cloud Computing.

2. To provide students a sound foundation of the Cloud computing so that they are able to start using and adopting Cloud Computing services and tools in their real life scenarios.

3. To enable students exploring some important cloud computing driven commercial systems such as GoogleApps, Microsoft Azure and Amazon Web Services and other businesses cloud applications.

Course Detail: Unit-1 Introduction of Computing:

New Computing Paradigms & Services: Cloud computing , Edge computing , Grid computing , Utility computing , Cloud Computing Architectural Framework, Cloud Deployment Models, Virtualization in Cloud Computing, Parallelization in Cloud Computing, Security for Cloud Computing, Cloud Economics , Metering of services.

Unit-2 Service Models:

Cloud Service Models: Software as a Service (SaaS), Infrastructure as a Service

(IaaS), Platform as a Service (PaaS), Service Oriented Architecture (SoA), Elastic Computing, On Demand Computing, Cloud Architecture, and Introduction to virtualization. Types of Virtualization, Grid technology, Browser as a platform, Web 2.0, Autonomic Systems, Cloud Computing Operating System, Deployment of applications on the cloud.

Unit-3

Introduction to Map Reduce, Information retrieval through Map Reduce, Hadoop File System, GFS, Page Ranking using Map Reduce, Security threats and solutions in clouds, mobile cloud computing.

Unit-4:

Cloud Programming, Case studies- Ajax, Hadoop, Adoption and Use of Cloud, AAA Administration for Clouds, Security as a service,

Unit-5

Case studies- Xen, VMware, Eucalyptus, Amazon EC2.

Course Outcome:

At the end of the course, the student would be able:-

1. Differentiate different computing techniques. 2. Identify the appropriate cloud services for a given application 3. Compare various cloud computing providers/ Software. 4. Handle Open Source Cloud Implementation and Administration. 5. Analyze authentication, confidentiality and privacy issues in Cloud

computing environment.

Text Books:

1. Cloud Computing Principles and Paradigms, Rajkumar Buyya Wiley 2. Distributed and Cloud Computing, Kai Hwang, Mk Publication 3. Cloud computing Black Book Dreamtech Publication 4. Anothony T Velte, Toby J Velte, Robert Elsenpeter, Cloud Computing: A

Practical Approach, MGH, 2010. 5. Gautam Shroff, Enterprise Cloud Computing, Cambridge, 2010. 6. Ronald Krutz and Russell Dean Vines, Cloud Security, 1st Edition, Wiley,

2010.

Reference Books:

1. “Cloud Application Architectures” by George Reese, O’Reillly Publications, 2009

2. “Cloud Security and Privacy”, Tim Mather, Subra Kumaraswamy, O’Reilly, 2009

Semester: V Branch: Computer Science & Engineering

Subject: Internet arch. And communication protocol Code: CSE3119(2)

…………………………………………………………………………………………………… Course Description: This course is an advanced networking course focusing on present and future Internet architecture, particularly targeted for the students who want to take their professional or research career in network development, administration and service management. The course will introduce working structures and protocols for today's

Internet architecture, with a focus on how different network management and administrative tasks, like service differentiation, availability, capacity planning, monitoring etc.

Course Objectives:

1. Present students with a study of the design, operation, and challenges of the Internet as a global network

2. Provide students with advanced insight into addressing, routing, and performance on the Internet, and understand recent developments such as IPv6 and mobility.

3. Prepare students for research in the area of internet engineering

Course Detail: Unit-1 Introduction:

Revision of Computer Networks concepts - device level connectivity, network protocol stack, basic TCP/IP protocol principles. Architectural Principles: The Design of DARPA Internet Architecture. Internet Backbone Architecture: Switches, Bridges, Routers, Network access points and Internet Exchange Points, Physical characteristics of long haul backbone links. Internet Service Providers (ISP) and ISP connectivity, Economy of the backbone .Backbone routing (BGP) and routing table optimizations

Unit-2 Quality of Service (QoS) in the Internet:

QoS architecture - DiffServ and IntServ architecture, application QoS requirements . Queue management protocols and traffic shaping - priority queuing, custom queuing, weighted fair queuing, Flow based weighted fair queuing. Random early detection. IntSev - Resource reservation protocol (RSVP) DiffServ – Assured Forwarding and Expedited Forwarding

Unit-3 Mobile Internet:

Mobile IP and Mobile TCP ,Distributed Mobility Management ,Network based Mobility Management ,Content and Context based Data Delivery in Mobile Internet. Mobility First Architecture . End-point mobility, device mobility, global name resolution ,Choice Net and Nebula architecture

Unit-4 Software Defined Networking (SDN)

Management issues in present network architecture .Network Virtualization and evolution of SDN .SDN architecture - data plane vs control plane. Examples of SDN controllers – Open Flow architecture, SDN Programming.

Unit-5 Next Generation Internet Architecture:

Design Requirements for Future Internet Architecture. Internet Hourglass Model ,Content Delivery Network (CDN) ,Named Data Networking (NDN) ,Context Aware Computing.

Course Outcome:

At the end of the course, the student would be able:-

1. Describe the architecture of the Internet 2. Describe the advance functions performed by the Network protocols. 3. Optimize the design of routers for performance. 4. Describe IPv6 and addressing schemes 5. Understand the challenges involved in supporting mobility on the Internet

and the possible solutions

Text Books:

1. TCP/IP Tutorial and Technical Overview, (IBM Redbook) - Download From http://www.redbooks.ibm.com/abstracts/gg243376.html

2. D.E. Comer, Internetworking with TCP/IP: Principles, Protocols, and

Architecture , 5th ed., Pearson Prentice-Hall, 2006, ISBN 0-13-187671-6.

3. Web Technologies TCP/IP Architecture and Java Programming : Achyt S Godbole &Atul Kahate :2nd Edition :TMH.

Reference Books:

1. E.A. Hall , Internet Core Protocols , O’Reilly ,2000 , ISBN1-56592-572-6 2. L.A. Chappell , Guide to TCP/IP , O’Reilly , 2002 , ISBN 0-619-03530-7

3. B.A.Forouzan , TCP/IP Protocol Suite , McGraw-Hill , 2006 , ISBN 0-07-111583-8

4. TCP/IP Guide, Charles M. Kozierok, Available Online http://www.tcpipguide.com/

Semester: V Branch: Computer Science & Engineering

Subject: Natural Language Processing Code: CSE3119(3) …………………………………………………………………………………………………… Course Description: This course provides an introduction to computational linguistics, from morphology (word formation) and syntax (sentence structure) to semantics (meaning), and natural language processing applications such as parsing, machine translation,

generation and dialog systems.

Course Objectives:

1. To understand the approaches to process natural languages. 2. To understand various problems and their respective solutions of NLP. 3. To learn representation of linguistic structure and meaning. 4. To learn building statistical models to choose among the many legal answers.

Course Detail:

Unit-1 Basic Text Processing: Tokenization, Stemming Unit-2 Language Modeling, Morphology and Syntax: N-grams, smoothing, Parts of Speech Tagging, PCFGs, Dependency Parsing Unit-3 Distributional Semantics: Lexical Semantics, Word Sense Disambiguation Unit-4 Information Extraction: Relation extraction, Event extraction Unit-5 Text Summarization: Summarization, Text Classification, Machine Translation

Course Outcome:

At the end of the course, the student would be able:-

1. To model linguistic structure with formal grammars. 2. To understand methodology for training and evaluating empirical NLP

systems. 3. To design, implement and apply NLP algorithms in various domains.

Text Books:

1. Allen, James, Natural Language Understanding, Second Edition, Benjamin/Cumming, 1995.

2. Jurafsky, Dan and Martin, James, Speech and Language Processing, Second Edition, Prentice Hall, 2008.

Reference Books:

1. Manning, Christopher and Heinrich, Schutze, Foundations of Statistical Natural Language Processing, MIT Press, 1999.

2. Radford, Andrew et. al., Linguistics, An Introduction, Cambridge University Press, 1999.

Semester: V Branch: Computer Science & Engineering

Subject: Computer Graphics Code: CSE3119(4) …………………………………………………………………………………………………… Course Description: This course involves display, manipulation and storage of pictures and experimental data for proper visualization using a computer. It provides methods for producing images and animations. It deals with the hardware as well as software support for

generating images

Course Objectives:

1. Learn input, output devices of Computer Graphics. 2. Scan conversion of objects like line, circle, ellipse etc. 3. Understand 2D and 3D transformation and clipping techniques. 4. Explore back face removal techniques, rendering techniques and animation

Course Detail:

Unit-1 Introduction and Primitive Algorithms: Introduction to Image and Objects, Basic Graphics Pipeline, Bitmap and Vector-Based Graphics, Display Devices: CRT, Raster-Scan Display, Random-Scan Display, Flat Panel Display, Input Technology, Coordinate System Overview.

Unit-2 Output primitives:

Points and lines, line drawing algorithms, mid-point circle and ellipse algorithms. Filled area primitives: Scan line polygon fill algorithm, boundary-fill and flood-fill algorithms

Unit-3:

2-D geometrical transforms: Translation, scaling, rotation, reflection and shear transformations, matrix representations and homogeneous coordinates composite transforms, transformations between coordinate systems. 2-D viewing : The viewing pipeline, viewing coordinate reference frame, window to view-port coordinate transformation, viewing functions, Cohen-Sutherland and Cyrus-beck line clipping algorithms, Sutherland –Hodgeman polygon clipping

Unit-4:

3-D object representation: Polygon surfaces, quadric surfaces, spline representation, Hermite curve, Bezier curve and B-Spline curves, Bezier and B-Spline surfaces. Basic illumination models, polygon rendering methods. 3-D Geometric transformations: Translation, rotation, scaling, reflection and shear transformations, composite transformations. 3-D viewing: Viewing pipeline, viewing coordinates, view volume. Projection and clipping.

Unit-5: Visible surface detection methods, Object Rendering and Computer animation.

Course Outcome:

At the end of the course, the student would be able:-

1. Understand I/O graphics devices

2. Able to write programs of line, circle etc.

3. Implement 2D and 3D transformation techniques for specific application.

4. Able to design animation.

Text Books:

1. Rogers, "Procedural Elements of Computer Graphics", Tata McGraw Hill 2. Donald Hearn and M.P. Becker “Computer Graphics” Pearson Pub. 3. Parekh “Principles of Multimedia” Tata McGraw Hill 4. Maurya, “Computer Graphics with Virtual Reality System “ , Wiley India 5. Pakhira,”Computer Graphics ,Multimedia & Animation”,PHI learning

Reference Books:

1. “Computer Graphics”, second Edition, Donald Hearn and M.Pauline Baker, PHI/Pearson Education.

2. “Computer Graphics Second edition”, Zhig and Xiang, Roy Plastock, Schaum’s outlines, Tata Mc- Graw hill edition.

3. Procedural elements for Computer Graphics, David F Rogers, Tata Mc Graw hill, 2nd edition.

4. “Principles of Interactive Computer Graphics”, Neuman and Sproul, TMH. 5. Principles of Computer Graphics, Shalini Govil, Pai, 2005, Springer.

Semester: V Branch: Computer Science & Engineering

Subject: Microprocessors & Interfacing Lab Code: CSE3120

……………………………………………………………………………………………………

Course Detail:

Students will perform following experiments in lab 8086 Programs using kits and MASM

1. Basic arithmetic and Logical operations 2. Move a data block without overlap 3. Code conversion, decimal arithmetic and Matrix operations. 4. Floating point operations, string manipulations, sorting and searching 5. Password checking, Print RAM size and system date 6. Counters and Time Delay

Peripherals and Interfacing Experiments

1. Traffic light control 2. Stepper motor control 3. Digital clock 4. Key board and Display 5. Printer status 6. Serial interface and Parallel interface 7. A/D and D/A interface and Waveform Generation

8051 Experiments using kits and MASM

1. Basic arithmetic and Logical operations 2. Square and Cube program, Find 2’s complement of a number 3. Unpacked BCD to ASCII

Semester: V Branch: Computer Science & Engineering

Subject: App Development Lab Code: CSE3121

……………………………………………………………………………………………………

Course Detail:

The objective of this lab is to make the students aware of the various aspects of mobile programming. They will get an insight into linking of front-end and back-end tools through a mobile application hence understanding the fundamentals of databases. They will be able to utilize rapid prototyping techniques to design and develop sophisticated mobile interfaces, hence deploy them to the marketplace for distribution at local or global levels.

Semester: V Branch: Computer Science & Engineering

Subject: Cloud Computing Lab Code: CSE3122(1)

……………………………………………………………………………………………………

Course Detail: This lab introduces open source cloud computing tools for implementation of private cloud. It includes installation and configuration of cloud, Working with KVM to create VM, Bundling and uploading images on a cloud, Creating web based UI to launch VM, Working with Volumes, Attached to the VM, Programming using Google Apps engine and Python etc.

Semester: V Branch: Computer Science & Engineering

Subject: Dot Net Lab Code: CSE3122(2)

……………………………………………………………………………………………………

Course Detail: This lab comprises the basics of Visual Studio .NET module, highlight the programming features within Microsoft Visual Studio .NET. Students will be introduced to C#, ASP.NET and Visual Basic .NET in a variety of ways: They will look at, run, and debug code using the Visual Studio .NET Integrated Development Environment (IDE). They will take an application in Microsoft® Visual Basic® 6.0 and migrate it to Visual Basic .NET, and then extend it with additional Visual Basic .NET programming concepts. After completion of the exercises, they will be able to identify the key new features of Visual Studio .NET and the programming elements within.

Semester: V Branch: Computer Science & Engineering

Subject: Computer Graphics Lab Code: CSE3122(3)

……………………………………………………………………………………………………

Course Detail: Students will perform following experiments in lab

1. Implementation of Algorithms for drawing 2D Primitives using DDA, Midpoint

and Breshanhem’s algorithms.

Line

Circle

Ellipse 2. 2D Geometric transformations

Translation

Rotation Scaling

Reflection Shear

Window-Viewport 3. Composite 2D Transformations 4. Line Clipping 5. 3D Transformations – Translation, Rotation, Scaling. 6. 3D Projections – Parallel, Perspective. 7. Creating 3D Scenes. 8. Image Editing and Manipulation – Basic Operations on image using any image

editing software, Creating gif animated images, Image optimization. 9. 2D Animation – To create Interactive animation using any authoring tool.