Osmania University-Final year-Computer Science Dept-Syllabus

I.                      B.E.(CSE) 4/4, I- Semester

SCHEME OF INSTRUCTION & EXAMINATION

  B.E.IV/IV  (Regular)

COMPUTER SCIENCE &  ENGINEERING 

SEMESTER-I

B.E. IV/IV - I Semester:

Sl.No	Syllabus Ref.No	SUBJECT	Scheme of Instruction		Scheme of Examination
			Periods per Week		Duration in Hrs	Maximum Marks
			L/T	D/P		Unit Exam	Sessionals
		THEORY
1	CS 401	Distributed Systems	4		3	75	25
2	CS 402	Artificial Inteligence	4		3	75	25
3	CS 403	Compiler Construction	4		3	75	25
4	CS 404	Principles & Applications of Embedded Systems	4		3	75	25
5		Elective - I	4		3	75	25
		PRACTICALS
1	CS 431	Distributed Sys. Lab		3	3	50	25
2	CS 432	Embedded Systems Lab		3	3	50	25
3	CS 433	Compiler Construction Lab		3	3	50	25
4	CS 434	Project Seminar		3			25

CS 401 DISTRIBUTED SYSTEMS

UNIT I

Characterization of Distributed Systems

Introduction, Exa mples of distributed systems, Resource sharing and the web,

Challenges.

System Models

Introduction, Architectural models, Fundamental models.

Operating System Support

Introduction, The operating system layer, Protection, Processes and threads,

Communication and invocation, Operating system architecture.

UNIT II

Interprocess communication

Introduction, The API for the internet protocols, External data representation and

marshalling.

Client Server communication, Group Communication, Case stufy: Interprocess

communication Introduction UNIX.

Distributed objects and Remote Invocation

Introduction, Communication between distributed objects, Remote procedure call,

Events and notifications, Case study: Java RMI.

Name Services

Introduction, Name services and the Domain Name System, Directory services, Case

study of the X.5000 Directory Service.

UNIT III

Time and Global States

Introduction, Clocks events and process states, Synchronizing physical clocks, Logical

clocks, Global states, Distributed debugging.

Coordination and Agreement

Introduction, distributed mutual exclusion, Election, Multicast communication,

Consensus and related problems.

UNIT IV

Transactions and Concurrency Control

Introduction, Transactions, Nested transactions, Locks Optimistic concurrency control.

Timestamp ordering, Comparison of methods for concurrency control.

Distributed Transactions

Introduction, Flat and nested distributed transactions,Atomic commit process,

Concurrency control in distributed transactions, Distributed deadlocks, Transaction

recovery.

Replication

Introduction, System model and group communication, Fault-tolerant services.

Case study: The gossip architecture,CODA.

UNIT V

Distributed Shared Memory

Introduction, Design and implementation issues, Sequential consistency and Ivy case

study.

Release consistency and Munin case study, Other consistency model.

Distributed File Systems

Introduction, File service architecture, Case study: Sun Network File System.

Enhancements and further developments.

Suggesting Reading:

1. Colouris, Dollimore, Kindberg, “ Distributed Systems concepts and Design” 4th

Ed. Pearson Education, 2009.

2. Andrew S. Tanenbaum, Van Steen, “ Distributed Systems “, Pearson Education ,

2002.

3. Singhal M, Shivratari N.G, “Advanced Concepts Introduction, Operating

Systems” McGraw Hill, 1994.

4. Pradeep K Sinha, “ Distributed Opearating Systems: Concepts and Design”,

Pearson Education Asia India, 2007.

CS 402 ATRIFICAL INTELLIGENCE

UNIT-I

Introduction, Defination, history and applications of AI, Search in State Spaces:Agents

that plan, Uniformed search, Algorithm A*, Heuristic Functions and Search Efficiency,

Alternative Search Formulations and Application, Adversarial Search.

UNIT II

Knowledge Representation and Reasoning: The Propositional Calculus, Resolution in

Propositional Calculus, The Predicate Calculus, Resolution in Predicate Calculus, Rule-

Based Expert Systems, Representing Common Sense Knowledge.

UNIT III

Reasoning with Uncertain Information (Nilsson).

Planning (Nilsson): The Situation Calculus, Planning.

UNIT IV

Learning from Observations: Learning decission-trees using Information theory, Learning

General Logical Descriptions, Neural Networks: Perceptron, Multilayer feed-forward

network, Rule Learning.

UNIT-V

Natural Language Processing: Communication among agents, Speech Recognition:

Signal Processing, Speech Recognition Model(Language Model + Acoustic Model), The

Viterbi Algorithm.

Suggested Reading:

1. Nils J. Nilsson(1988) Artificial Intelligence: A New Synthesis, Elsevier.

2. Stuart Russell, Peter Norving (1995), Artificial Intelligence- A Modern Approach,

Pearson Edition/PHI.

3. Elaine Rich and Kevin Knight (2009), Artificial Intelligence, 3rd Ed. Tata McGraw

Hill.

4. George F Luger (2009), Artificial Intelligence, Structures and strategies for

Complex Problem solving, Pearson Edition.

CS 403 COMPILER CONSTRUCTION

UNIT I

Introduction: Programs related to compilers, Translation process, Major data

structured, Other issues Introduction, compiler structure, Boot strapping and porting.

Lexical Analysis The role of Lexical Analyzer, Input Buffering, Specification of Tokens,

Recognition of Tokens, The Lexical-Analyzer, Generator Lex.

UNIT II

Syntax Analysis Introduction, Top-Down parsing, Bottom-Up parsing, Introduction to LR

parsing, More powerful LR parsers, Using Ambiguous Grammars, Parser Generator

Yacc.

UNIT III

Syntax Directed Translation Syntax Directed Definitions, Evaluation Orders for SDDs,

Applications of Syntax Directed Translation.

Intermediate code generation Variants of syntax trees, Three-Address Code, Types

and Declarations, Translation of Expressions, Type Checking, Control Flow, Back

patching, Switch-Statements, Intermediate Code for Procedures.

UNIT IV

Storage Organization Stack Allocation of Space, Access to Non-local Data on the

Stack, Heap Management, Introduction to Garbage Collection.

Code Generation Issues Introduction, the Design of a Code Generator, The Target

Language, Addresses in the Target Code, Basic Blocks and Flow Graphs, Optimization

of Basic Blocks, Peephole Optimization, Register Allocation and Assignment, Machineindependent

Optimizations, The principal Sources of Optimizations.

UNIT V

Linkers and Loaders Basic Loader functions, Design of an Absolute Loader, A simple

bootstrap loader, Machine-dependent and independent features, Relocation, Program

Linking, Algorithms And Data Structures for a Linking Loader, Automatic Library Search,

Loader Options, Loader Design options, Linkage Editing, Dynamic linking.

Suggested Reading:

1. Alfred V Aho, Monica S Lam, Ravi Sethi, Jeffrey D Ullman – Compilers:

Principles, Techniques & Tools-Pearson Education.

2. Leland L Bech- System Software: An Introduction to Systems Programming –

Pearson Education Asia.

3. Kenneth C Louden – Compiler Construction: Principles and Practice- Cengage

Learning.

CS 404 PRINCIPLES & APPLICATIONS OF EMBEDDED SYSTEMS

UNIT I

Embedded Computing: Introduction, Complex Systems and Microprocessor; Embedded

System Design Process, Formalisms for System Design, Design Examples, The 8051

Architecture:Introduction, 8051 Micro Controller Hardware, Input/Output Ports and

Circuits, External Memory, Counter and Timers, Serial data Input/Output, interrupts.

UNIT II

Basic Assembly Language Programming Concepts: Assembly Language Programming

Process, Programming Tools and Techniques, Programming the 8051, Data Transfer

and Logical Instructions.

Arithmetic Operations, Decimal Arithmetic, Jump and Call Instructions, Further Details

on Interrupts.

UNIT III

Applications: Interfacing with Keyboards, Displays, D/A and NO Conversions, Multiple

Interrupts, Serial Data Communication, Introduction to Real-Time Operating

Systems:Tasks and Task States, Tasks and Data, Semaphores, Shared Data, Message

Queues, Mailboxes and Pipes, Timer Functions, Events, Memory Management, Interrupt

Routines in an RTOS Environment.

UNIT IV

Basic Design Using a Real-Time Operating System: Principles, Semaphores and

Queues, Hard Real-Time Scheduling Considerations, Saving Memory and Power, An

example RTOS like UC-OS(Open Source).

Embedded Software Development Tools:

Host and Target machines, Linker/Locators for Embedded Software, Getting Embedded

Software into the Target System, Debugging Techniques: Testing on Host Machine,

Using Laboratory Tools, An Example System.

UNIT V

Introduction to advanced architectures: ARM and SHARC, Processor and memory

organization and Instruction level parallelism, Net advanced embedded Systems, Design

Examples-Elevator Controller.

Suggested Reading:

1. Computers and Components, Wayne Wolt Elsevier.

2. The 8051 Microcontroller; Third Edition,Kenneth J.Ayala, Thomson.

3. An Embedded Software Primer, David E.Simor,Pearson Education

4. Embedding System building blocks, Labrosse, via CMP Publishers.

5. Embedded Systems, Raj Kamal, Tata Mc Graw Hill.

CS 411 INFORMATION SECURITY

(Elective – I)

UNIT I

Introduction, Characteristics of Information, Components of Information Systems,

Securing components, balancing Security and Access.

The Security System Development Life Cycle, Security Professionals and the

organization.

Security Investigation Phase, Need for security, Threats, Attacks.

UNIT II

Legal, Ethical and Professionals Issues Introduction, Information Security.

Ethical Component in System, Codes of Ethics, Certification.

Security Analysis: Risk Management, Identifying and assessing risk, Controlling Risk.

UNIT III

Logical Design: Blue print for security.

Security Policy, standards and Practices.

Design of Security Architecture .

Physical Design:Security Technology, Physical Design of Security SDLC Firewalls,

Dialup

Protection, Intrusion Detection Systems,Scanning and analysis tools, Content filters.

UNIT IV

Cryptography:The basis elements of cryptography, symmetric (Symmetric Key-DES,

IDEA, and AES) and public key cryptography (Public key Encryptions-RSA).

UNIT V

Message digest (MD-5, SHA),, Digital signatures.

SSL and SET: SSL and SET protocols, Internet transactions using both SSL and SET.

Suggested Reading:

1. Michael E. Whitman and Herbert J Mattord, Principles of Information Security, 2nd

Ed. Cengage Learning 2008.

2. William Stallings, Cryptography and Network Security, Pearson Education, 2000.

3. Nina Godbole, Information Systems Security, Wiley-2009.

CS 413 IMAGE PROCESSING

(Elective –I)

UNIT I

Introduction to Digital Image Processing , Origins and Applications of Digital Image

Processing, Fundamental Steps Introduction, Digital Image Processing, Components of

Digital Image Processing System, Elements of Visual Perception, Light and the

Electromagnetic Spectrum, Image Sensing and Acquisition, Image sampling and

Quantization.

UNIT II

Filtering Introduction, the Frequency Domain: Preliminary Concepts, Sampling and the

Fourier Transform of Sampled Functions, The Discrete Fourier Transform(DFT) of One

Variable, Extension to Function of Two Variables, Some Properties of the 2-D Discrete

Fourier Transform, Image smoothing and Sharpening using Frequency Domain Filters.

UNIT III

Tntensity Transformations and Spatial Filtering: Histogram Processing, Fundamental of

Spatial Filtering, Smoothing and Sharpening spatial Filters, Image Segmentation: Point,

Line and Edge Detection, Thresholding, Region-Based Segmentation.

UNIT IV

Image Compression: Fidelity Criteria, Image Compression Models, Image Formats,

Containers and Compression Standards, Compression Methods: Huffman Coding,

Golomb Coding, Arithmatic Coding, LZW Coding, Run-Length Coding.

UNIT V

Restoration: Noise Models, Inverse filtering, Least squares Filtering. Object Recognition:

Patterns and Pattern Classes , Recognition Based on Decision- Theoretic Methods.

Suggested Reading :

Gonzalez R.C Woods R.E: Digital Image Processing, Pearson Education, Third Edition

2008.

William K. Pratt, “Digital Image Processing”, John Wiley & Sons Inc. 3rd Edition, 2001.

Mc Andrew, Introduction to digital Image Processing, Cengage Learning 2004.

Sonka, Hlavac, Boyle, Digital Image Processing and Computer Vision, Cengage

learning, 2008

Rosenfeld A. Kak AC., Digital Picture Processing Vol. I and II Acad, Press, 2nd Edition,

1982.

CS 414 ADHOC AND SENSOR NETWORKS

(ELECTIVE-I)

UNIT I

Adhoc Networks: Introduction and Definition, Adhoc Network Application, Design

Challenges.

Evaluating Adhoc network Protocols- the Case for a Test Bed.

Routing in Mobile Adhoc Networks:

Introduction, Flooding, Proactive routing, On Demand Routing, Proactive Versus on

demand Debate, Location based Routing.

UNIT II

Multicasting in Adhoc Networks:

Introduction, Classifications of Protocols, Multicasting Protocols, Broadcasting, Protocol

Comparison, Overaching Issues.

Transport layer Protocols in Adhoc Networks:

Introduction, TCP and Adhoc Networks, Transport Layer for Adhoc Networks:Overview,

Modified TCP, TCP-aware Cross-layered Solutions.

Adhoc Transport Protocol.

UNIT III

QoS Issue in Adhoc Networks:

Introduction, Definition of QoS, Medium Access Layer, QoS Routing.

Inter –Layer Design Approaches.

Security in Mobile Adhoc Networks:

Vulnerabilities of Mobile Adhoc Networks, Potential Attacks, Attack Prevention

Techniques, Intrusion Detection Techniques.

UNIT IV

Introduction and Overview of Wireless Sensor Networks:

Introduction: Basic Overview of the Technology.

Applications of Wireless Sensor Networks:

Introduction, Background, Range of Applications, Examples of Category 2 WSN

Applications, Examples of Category 1 WSN applications Another Txonomy of WSN

Technology.

Basic Wireless Sensor Technology:

Introduction, Sensor Node Technology, Sensor Taxonomy.

UNIT V

Wireless Transmission Technology:

Introduction, Radio technology primer, Available Wireless Technologies.

Medium Access Control Protocols for Wireless Sensor Networks:

Introduction, Background, Fundamentals of MAC Protocols.

Suggested Reading:

1. Prasant Mohapatra and Sri hanamurthy, “ Ad Hoc Networks Technologies and

Protocols”, Springer, Springer International Edition, 2009.

2. Kazem sohraby, Daniel Minoli, Taieb Znati, “wireless Sensor Networks”, A John Wiley

& sons, Inc ., Publication -2007.