UNIT III - Web viewStudents who complete the course will have demonstrated the ability to do the following:

Scheme of Syllabus for 5th Semester B.E. Computer Science & Engineering (2014-15 Batch)

Sl.No

Subject Code Subjects Hrs/Week C CIE *SEE TotalL T P

1 UCS521C Analysis and Design of Algorithms 3 0 2# 4 50 50 1002 UCS512C System Software 3 0 0 3 50 50 1003 UCS523C Data Communications 4 0 0 4 50 50 1004 UCS524C Software Engineering 4 0 0 4 50 50 1005 - Elective – 1 3 0 0 3 50 50 1006 - Elective - 2 3 0 0 3 50 50 1007 UCS525L System Software Lab 0 1 3 2 50 50 1008 UCS526L Operating Systems Lab 0 2 2 2 50 50 100

Total 20 3 7 25 400 400 800

L: Lecturer Hours per Week T: Tutorial hours per weekP: Practical Hours per Week C: Credit points*CIE: Continuous Internal Evaluation *SEE: Semester End Examination

# Lab is to be evaluated for 20 marks in CIE only, theory is to be evaluated for 30 marks in CIE and 50 marks in SEE and the same scheme is applicable to elective courses on programming languages.

ANALYSIS AND DESIGN OF ALGORITHMS

Sub Code : UCS521C Credits : 04Hours/Week : Theory: 03, Practical: 2 CIE MARKS : 50 (30 theory, 20 lab)Total Hours : 40 SEE Marks : 50

Course Objectives

Upon completion of this course, students will be able to do the following:

Analyze and compare the asymptotic performance of algorithms. Write the correctness proofs for algorithms. Demonstrate a acquaintance with major algorithms and data structures. Apply important algorithmic design paradigms and methods of analysis. Synthesize efficient algorithms in to address common engineering challenges.

Course Outcomes

Students who complete the course will have demonstrated the ability to do the following:

Analyze worst-case, best case and average case running times of algorithms using asymptotic analysis.

Describe the various algorithmic paradigms like Brute Force, Divide and Conquer, Transform and Conquer,Dynamic Programming, Greedy technique.

Explain the major graph algorithms and their analyses. Use the above techniques to synthesize solutions to new emerging engineering problems.

UNIT I (10 Hours)

Introduction: Notion of Algorithm, Fundamentals of Algorithmic Problem Solving, Important Problem Types, Fundamental Data Structures.Fundamentals of the Analysis of Algorithm Efficiency: Analysis Framework, Asymptotic Notations and Basic Efficiency Classes, Mathematical Analysis of Non-recursive and Recursive Algorithms, Example – Fibonacci Numbers. Brute Force: Selection Sort and Bubble Sort, Sequential Search and Brute-Force String Matching, Exhaustive Search.

UNIT II (10 Hours)

Divide and Conquer: Mergesort, Quicksort, Binary Search, Binary tree traversals and related properties, Multiplication of large integers and Stressen’s Matrix Multiplication.Decrease and Conquer: Insertion Sort, Depth First Search, Breadth First Search, Topological Sorting, Algorithms for Generating Combinatorial Objects.

UNIT III (10 Hours)

Transform and Conquer: Presorting, Balanced Search Trees, Heaps and Heapsort, Problem Reduction Space and Time Tradeoffs: Sorting by Counting, Input Enhancement in String Matching , Hashing, B-Trees Dynamic Programming: Computing a Binomial Coefficient, Warshall’s and Floyd’s Algorithms, Optimal Binary Search Trees. The Knapsack Problem and Memory Functions.

UNIT IV (10 Hours)

Greedy Technique: Prim’s Algorithm, Kruskal’s Algorithm, Dijkstra’s Algorithm, Huffman Trees Limitations of Algorithm Power: Lower-Bound Arguments, Decision Trees ,ProblemsCoping with the Limitations of Algorithm Power: Backtracking, Branch-and-Bound,

Text Books:

1. Anany Levitin, 2007,’Introduction to The Design & Analysis of Algorithms’, 2nd Edition, Pearson Education.

Reference Books

1. Thomas H. Cormen, Charles E. Leiserson, Ronal L. Rivest, Clifford Stein, 2006,’ Introduction to Algorithms’, 2nd Edition, PHI.

2. Horowitz E., Sahni S., Rajasekaran S.,Galgotia Publications, 2001, ’Computer Algorithms’ .

Note: It also includes laboratory (3 Hours Theory and 2 Hours Practical/Week)

SYSTEMS SOFTWARE

Sub Code : UCS512C Credits : 03Hours/Week : 03 CIE MARKS : 50

Total Hours : 40 SEE Marks : 50

Course Description

i) Course Learning objectives (CLO):

At the end of the course student will learn/understand/ think/experience/appreciate:

1. Basic concepts and types of system softwares.2. Design and characteristics of various machine architectures such as SIC, SIC/XE, RISC

and CISC.3. Basic concepts, algorithms and implementation methods of assembler, loader, linker and

compiler.4. Lex and Yacc programming languages, their structures etc. to design lexical analyzer and

syntactic analyzer for given applications.5. Characteristics, algorithms and implementation methods of Macro-processor.

ii) Course outcomes:At the end of the course student should be able to:

1. List and define features/concepts of machine architectures and system softwares.2. Explain characteristics/concepts/basic operations of machines architectures, system

softwares and Lex and Yacc tools.3. Write programs to implement simple assembler, loader, linker, macroprocessor, lexical

analyzer and syntactic analyzer.4. Compare and contrast types of softwares, machine architectures, system softwares and

Lexical and syntactic analyzer.5. Analyze, Design and implement system softwares for different architectures.

UNIT I (10 Hours)

Machine Architecture: Introduction, System Software and Machine Architecture, Simplified Instructional Computer (SIC) - SIC Machine Architecture, SIC/XE Machine Architecture, SIC Programming Examples, Traditional (CISC) Machines - VAX Architecture, RISC Machines - Ultra SP ARC Architecture. Assemblers: Basic Assembler Function - A Simple SIC Assembler, Assembler Algorithm and Data Structures, Machine Dependent Assembler Features - Instruction Formats & Addressing Modes, Program Relocation, Machine Independent Assembler Features - Literals, Symbol-Definition Statements, Expression, Program

Blocks, Control Sections and Programming Linking.

UNIT II (10 Hours)

Loaders And Linkers: Basic Loader Functions - Design of an Absolute loader, A Simple Bootstrap Loader, Machine-Dependent Loader Features - Relocation, Program Linking, Algorithm and Data Structures for a Linking Loader, Machine-Independent Loader Features - Automatic Library Search, Loader Options, Loader Design Options - Linkage Editor, Dynamic Linkage, Bootstrap Loaders.

UNIT III (10 Hours)

Compilers: Basic Compiler Function - Grammars, Lexical Analysis, Syntactic Analysis, Code Generation, Machine Dependent Compiler Features Intermediate Form of the Program. Machine-Dependent Code Optimization, Machine Independent Compiler Features - Structured Variables, Machine Independent Code Optimization, Storage Allocation, Block Structured Languages.

UNIT IV (10 Hours)

Macro Processor: Basic Macro Processor Functions - Macro Definitions and Expansion, Macro Processor Algorithm and Data Structures, Machine-Independent Macro Processor Features - Concatenation of Macro Parameters, Generation of Unique Labels, Conditional Macro Expansion, Keyword Macro Parameters, Macro Processor Design Options - Recursive Macro Expansion, General-Purpose Macro Processors, Macro Processing Within Language Translators. Lex And Yacc: Lex and Yacc - The Simplest Lex Program, Recognizing Words with LEX, Grammars, Parser-Lexer Communication, A Y ACC Parser, The Rules Section, Running LEX and Y ACC, LEX and Hand- Written Lexers, Using LEX - Regular Expression, Examples of Regular Expressions, A Word Counting Program, Using Y ACC - Grammars, Recursive Rules, Shift/Reduce Parsing, What Y ACC Cannot Parse, A Y ACC Parser - The Definition Section, The Rules Section, Symbol Values and Actions, The LEXER, Compiling and Running a Simple Parser, Arithmetic Expressions and Ambiguity, Variables and Typed Tokens.

TEXT BOOKS:

1) Leyland.L.Beck, 1997, System Software, 3rd Edition, Addison-Wesley.2) John.R.Levine, 1999, Tony Mason and Doug Brown, Lex and Yacc, O’Reilly, SPD.

REFERENCE BOOK:

1) D.M.Dhamdhere, 1999, System Programming and Operating Systems, 2nd Edition, TMH.

DATA COMMUNICATIONS



Course Objectives:

1. To understand the concept of data communication and modulation techniques.

2. To comprehend the use of different types of transmission media and network devices.

3. To understand the error detection and correction in transmission of data.

4. To understand the concept of flow control, error control and LAN protocols.

5. To understand the functions performed by Network Management System.

COURSE LEARNING OUTCOMES :(Knowledge based)

1. understand the basic principles of network design;

2. Understand the concept data communication within the network environment;

3. Understand the conflicting issues and resolution techniques in data transmission.

4. Understand the setting up of a network environment with all the necessary data.

communication components, procedure and techniques that make it functional

UNIT – I (12 Hours)

Introduction: Data Communications; Networks; the Internet; Protocols and Standards; Network Models: Layered tasks; The OSI Model, Layers in the OSI model; TCP / IP Protocol Suite, Addressing. Data and Signals: Analog and digital signals; Periodic Analog Signals, Digital Signals, Transmission impairment; Data rate limits; Performance.

UNIT – II (12 Hours)

Digital Transmission, Analog Transmission And Multiplexing: Digital-to-Digital conversion; Analog-to-Digital conversion: PCM; Transmission modes, Digital - to - Analog conversion; Analog - to - Analog conversion; Multiplexing. Transmission Media: Guided media, unguided media: Wireless.

UNIT – III (12 Hours)

Error Detection and Correction:

Introduction to Error Detection and Correction; Block Coding; Linear Block Codes; Cyclic codes, Checksum.Data Link Control: Framing; Flow and Error control; Protocols; Noiseless channels; Noisy channels; HDLC; Point-to-point Protocol. Multiple Accesses: Random Access; Controlled Access; Channelization.

UNIT – IV (12 Hours)

Ethernet: EEE standards; Standard Ethernet and changes in the standard; Fast Ethernet; Gigabit Ethernet.Wireless LANs and Connection of LANs: IEEE 802.11; Bluetooth. Connecting devices; Backbone Networks; Virtual LANs.Other Technologies: Cellular telephony; SONET / SDH: Architecture, Layers, Frames; STS multiplexing.

TEXT BOOK:

1) Behrouz A. Forouzan, 4th Edition, Tata McGraw-Hill, 2006, Data Communications and Networking.

REFERENCE BOOKS:

1) Alberto Leon, Garcia and Indra Widjaja, 3rd Edition, Tata McGraw- Hill, 2004, Communication Networks: Fundamental Concepts and Key Architectures.

2) William Stallings, 8th Edition, Pearson Education, 2007, Data and Computer Communication.

SOFTWARE ENGINEERING


Total Hours : 48 SEE Marks : 50Course Outcomes

1. Describing the software and software engineering, types of systems and their properties, concept of software process and models.

2. Demonstrating different requirements documents, designs, models, verifying and validating.

3. Analyzing different models, designs and methods of software development, and verification and validation and software architecture.

4. To judge the different software process activities, system process activities, management and software architecture.

5. Able to use all the approaches to develop different models, designs, requirements document and creating skeletal system

Course Objectives

1. Knowledge of basic software engineering methods and practices, and their appropriate application and understanding of some ethical and professional issues.

2. An understanding of software requirements, different software architectural styles and implementation issues.

3. An understanding of approaches to verification and validation, software evolution and related issues.

4. An understanding on quality control and how to ensure good quality software.

5. Development of significant teamwork and project based experience.

6. To gain a broad understanding of the discipline of software engineering and its application and management.

UNIT –I (12 Hours)

OVERVIEW: Introduction: FAQ's about software engineering, Professional and ethical responsibility. Socio-Technical systems: Emergent system properties; Systems engineering; Organizations, people and computer systems; Legacy systems.

CRITICAL SYSTEMS, SOFTWARE PROCESSES: Critical Systems: A simple safety-critical system; System dependability; Availability and reliability. Software Processes: Models, Process iteration, Process activities; The Rational Unified Process; Computer-Aided Software Engineering.

UNIT –II (12 Hours)

REQUIREMENTS: Software Requirements: Functional and Non-functional requirements; User requirements; System requirements; Interface specification; The software requirements document. Requirements Engineering Processes: Feasibility studies; Requirements elicitation and analysis; Requirements validation; Requirements management.SYSTEM MODELS, PROJECT MANAGEMENT: System Models: Context models; Behavioral models; Data models; Object models; Structured methods. Project Management: Management activities; Project planning; Project scheduling; Risk management.

UNIT –III (12 Hours)

SOFTWARE DESIGN: Architectural Design: Architectural design decisions; System organization; Modular decomposition styles; Control styles. Object-Oriented design: Objects and Object Classes; An Object- Oriented design process; Design evolution.DEVELOPMENT: Rapid Software Development: Agile methods; Extreme programming; Rapid application development. Software Evolution: Program evolution dynamics; Software maintenance; Evolution processes; Legacy system evolution.

UNIT –IV (12 Hours)

VERIFICATION AND VALIDATION: Verification and Validation: Planning; Software inspections; Automated static analysis; Verification and formal methods. Software testing: System testing; Component testing; Test case design; Test automation.MANAGEMENT: Managing People: Selecting staff; Motivating people; Managing people; The People Capability Maturity Model. Software Cost Estimation: Productivity; DESIGNING AND DOCUMENTING SOFTWARE ARCHITECTURE: Architecture in the life cycle; Designing the architecture; Forming the team structure; Creating a skeletal system.

TEXT BOOK:

1) Ian Somerville, 8th Edition, Pearson Education, 2007, Software Engineering.2) Len Bass, Paul Clements, Rick Kazman, Pearson Education, 2003. Software Architecture in Practice ,

2nd Edition,

REFERENCE BOOKS:

1) Roger S. Pressman, 7th Edition, McGraw-Hill, 2007, Software Engineering: A Practitioners Approach.

2) Shari Lawrence Pfleeger, Joanne M. Atlee, 3rd Edition, Pearson Education, 2006, Software Engineering Theory and Practice.

3) Waman S Jawadekar, Tata McGraw Hill, 2004, Software Engineering Principles and Practice.

SYSTEMS SOFTWARE LABORATORY

Sub Code : UCS525L Credits : 02Hours/Week : 04 CIE MARKS : 50

Exam Hours : 03 SEE Marks : 50

i. Course learning Objectives:

At the end of the course student will learn/practice/ think/experience/appreciate:

1. Design and implement of system softwares using C or C++.2. Design and implement of scanners using Lex tool.3. Design and implement of parser using Yacc tool.

ii. Course outcomes:

At the end of the semester student should be able to:

1. Implement the system softwares such as assembler, loader and linker etc using C or C++.

2. Design and write Lex program to implement lexical analyzer for given problem statement.

3. Design and write Yacc program to implement parser for the given structure recognition.

4. Modify the existing design of the algorithm of system softwares to enhance the efficiency.

Part I

1. Write a C program to implement pass one of two pass assembler.2. Write a C program to implement absolute loader.3. Write a C program to implement pass one of two pass macroprocessor.4. Write a C program to implement pass two of two pass macroprocessor 5. Write a C program to generate a lexical analyzer to identify the C keywords6. Design recursive descent parser for parsing pascal read & write statements.

Part II

Design lexical analysers using Lex tool to accomplish the following.

1. Design Lexical analyzer to count the no of occurrences of the words from a given text file.The program should accept the text file and list of words as input.

2. Design Lexical analyzer to count no of positive numbers and negative numbers from the input given.

3. Design Lexical analyzer to count number of printf and scanf statements and replace them by sprintf and sscanf respectively.

4. Design Lexical analyzer to count number of integers , float, double,char variable from C declaration statements

5. Design Lexical analyzer to count number of blank spaces lines, characters, words from a given text file.

6. Design Lexical analyzer to check whether a given simple arithmetic operation is valid or not. If valid print number of positive, negative, multiplication and division operators separately

Part III

Design parsers using Yacc tool to accomplish the following.

1. Design parser using Yacc tool to test the validity of a simple expression involving operators ‘+’,’-‘,’/’,’*’.

2. Design parser using Yacc tool to evaluate the given arithmetic expression involving operators ‘+’,’-‘,’/’,’*’.

3. Design parser using Yacc tool to recognize a valid variable which starts with a letter followed by any number of letters and digits.The length of the identifier should not exceed 15.

4. Design parser using Yacc tool to recognize the grammar an b where n>=10.5. Design parser using Yacc tool to recognize the validity of nested if statements and also display the

number of levels of nesting

Note:

Continuous Internal Evaluation (50 marks) :

Marks are based on execution of assignments and lab internal test. The marks are distributed as below;1. 30 marks for lab assignment execution.2. 20 marks for lab internal test.

Semester End Examination (50 marks):

In semester end examination two questions will be given. One from Part-I and one from Part-II and Part-III respectively.

OPERATING SYSTEM LABORATORY



OBJECTIVE: 1. to gain practical experience with designing and implementing concepts of operating systems.2. to study system calls.3. to implement commands using system calls.4. to study and use different interprocess communication methods in concurrent application. OUTCOMES: Upon the completion of Operating Systems practical course, the student will be able to: 1. implement and analyze basic services and functionalities of the operating system using system calls. 2. implement multithreaded applications .3. develop applications using concurrent processes considering synchronization problems.4.compare benefits of thread over process.5. Simulate and analyze CPU Scheduling Algorithms like FCFS, Round Robin, SJF, and Priority.6. Implement memory management schemes and page replacement schemes

PART A

1. Write a C program to sort the given set of numbers. Let the parent process sort the first half of the list and child process sort the second half of the list. Finally let the parent process merge the two sorted sublists and display the result.

2. Write a C program to sort the given set of numbers. Let the parent sort the first half of the list and child thread sort the second half of the list. Finally let the parent thread merge the two sorted sublists and display the result.

3. Write a C program to implement Shortest Request Next Scheduling Policy(Non-Preemptive).4. Write a C program to implement the following memory allocation schemes by considering the

problem of external fragmentation.a. Best Fitb. Worst Fit

5. Write a C program to implement FIFO page replacement technique,also check Beladays anomaly.6. Write a C program to implement LRU page replacement technique.7. Write a C program to implement Producer-Consumer problem using Dekkers algorithm8. Write a C program to implement Bankers Algorithm.

PART B

1. Write a C program to implement the following functions using File APIsa. a.displayfile(filename)b. b.readfrom(filename,position,buff,size)

2. Write a C program to print the type of file for each command line argument.

3. Write a C program to display environment variables of the parent process, then create a child process and execute a new program with new environment(Use appropriate exec system call)

4. Write a C program to display process times.5. Write a C program to generate SIGINT and SIGSTOP signals using signal() API, Count number of

CTRL_C pressings of user and display the CTRL_C pressing count when user presses CTRL_Z.6. Write a C program to handle signal generated during arithmetic operations.7. Write a C program to demonstrate interprocess communication using pipes. A parent process reads

data from a file and writes it to a pipe whereas as the child process reads data from the pipe and displays it on screen.

8. Write a C program to implement the solution for producer-Consumer problem using Semaphores.

Part C (Not for SEE)Adding system calls to the kernel.

Scheme of Syllabus for 6th Semester B.E. Computer Science & Engineering (2014-15 Batch)

Sl.No


1 UCS611C Computer Networks 4 0 0 4 50 50 1002 UCS612C Advanced Computer Architectures 3 0 2# 4 50 50 100

3 UCS613C Computer Graphics and Visualization 4 0 0 4 50 50 100

4 - Elective - 3 3 0 0 3 50 50 1005 - Elective -4 3 0 0 3 50 50 1006 - Elective -5 3 0 0 3 50 50 1007 UCS614L Computer Graphics Lab 0 0 3 1.5 50 50 1008 UCS615L Computer Networks Lab 0 0 3 1.5 50 50 100

Total 20 0 6 24 400 400 800



COMPUTER NETWORKS



Course Objectives:

1. Build an understanding of the fundamental concepts of computer networking also Introduce the student to advanced networking concepts, preparing the student for entry Advanced courses in computer networking.

2. Allow the student to gain expertise in some specific areas of networking such as the design and maintenance of individual networks.

Course Outcomes:

After completing this course the student must demonstrate the knowledge and ability to:

1 Explain different versions of network protocols along with address mapping, delivery, forwarding and routing.

2 Solve the basic network design problems using knowledge of common local and wide area

network architectures.

3 Explain the protocols (such as UDP, TCP, SCTP) used in Transport layer.

3 Explain techniques to control congestion in a network and techniques to improve the quality of service.

4 Explain the applications of application layer. and network management systems, multimedia and introduction part of cryptography and network security aspects


Network Layer: Logical Addressing: IPv4 Addresses, IPv6 Addresses. Internet Protocol: Internetworking, IPv4, IPv6, Transition from IPv4 to IPv6. Address Mapping, Error Reporting & Multicasting: Address Mapping, ICMP, and IGMP. Delivery, Forwarding & Routing: Delivery, Forwarding, Unicast Routing Protocols.


Transport Layer: Peer-to-Peer Delivery: UDP, TCP, and SCTP. Congestion Control and Quality of Service: Data traffic, Congestion, Congestion Control, Two Examples, Quality of Service, Techniques to improve QoS, Integrated Services, QoS in Switched Networks.


Application Layer: Domain Name System: Name Space, Domain Name Space, Distribution of Name Space, DNS In The Internet, Resolution, DNS Messages, Types of records, Registrars, Dynamic Domain Name System, Encapsulation. Remote Logging, Electronic Mail, File Transfer. WWW and HTTP: Architecture, Web Documents, HTTP.


Network Management: Network Management System, SNMP. Multimedia: Digitizing Audio and Video, Audio and Video Compression, Streaming Stored Audio/Video, Streaming Live Audio/Video, Real-Time Interactive Audio/Video, RTP, RTCP, Voice Over IP. Cryptography: Introduction, Symmetric-Key Cryptography, Asymmetric-key Cryptography, Network Security services.

TEXT BOOK:

1. Behrouz A. Forouzan, 4th Edition, Tata McGraw-Hill, 2006, Data Communications and Networking.

REFERENCE BOOKS:

1. James F. Kurose, Keith W. Ross, Third Edition, Pearson Education, 2008, Computer Networking-A top-down approach featuring the Internet.

2. William Stallings, 8th Edition, Pearson Education, 2007, Data and Computer Communication.3. Larry L. Peterson and Bruce S. David – 4th Edition, Elsevier, 2007, Computer Networks A Systems

Approach. 4. Wayne Tomasi, Pearson Education, 2005, Introduction to Data Communications and Networking.

ADVANCED COMPUTER ARCHITECTURES

Sub Code : UCS612C Credits : 03Hours/Week : 03 (Theory + 2 Hrs Lab) CIE MARKS : 50


Course Objectives:

1. Technical competence in computer architecture and high performance computing2. Ability to describe the operation of modern and high performance computers. 3. Ability to undertake performance comparisons of modern and high performance

computers. 4. Development of software to solve computationally intensive problems.

Course Outcomes:

At the end of the course students are able to

1. Explain the basic concepts of high performance computers

2. Compare the relationship between different computer architectures and their corresponding instruction sets.

3. Calculate and Contrast performance attributes for various computer architecture components.

4. Analyze the performance of various computer architectures

5. Design and develop simple parallel programs using Openmp


Parallel Computer Models : The State of Computing, Computer Development Milestones, Elements of Modem Computers, Evolution of Computer Architecture, System Attributes to Performance, Multiprocessors and Multicomputers, Shared -Memory Multiprocessors, Distributed -Memory Multiprocessors, A Taxonomy of MIMD Computers, Multivector and SIMD computers, Vector Supercomputers, SIMD Supercomputers, Program and Network Properties, Conditions of Parallelism, Data and Resource Dependencies, Hardware and Software Parallelism, Program flow Mechanisms, Control Flow Versus Data Flow , Demand-Driven Mechanisms, Comparisons of Flow MechanismsPARALLEL PROGRAMMING: Message passing Programming, Shared memory programming, open MP Libraries.


System Interconnect Architecture: Network properties and Routing, Static Connection Networks, Dynamic Connection Networks, Processor and Memory Technologies, Advanced Processor Technology, Instruction Pipelines, Processors and Co-processors, Instruction-Set Architectures, CISC Scalar Processor, RISC Scalar Processors, Superscalar and Vector Processor, Superscalar Processors, VLIW Architecture

Backplane Bus System, Backplane Bus Specification, Addressing and Timing Protocols, Arbitration, Transaction and Interrupt, IEEE Futurebus+ Standards, Shared-Memory, Organizations, Interleaved Memory Organization, Bandwidth and fault Tolerance, Memory Allocation Schemes.


Pipelining and Superscalar Techniques: Linear Pipeline Processors, Asynchronous and Synchronous Models, Clocking and Timing control, Speed up, Efficiency and Throughput, Non-linear Pipeline Processors, Reservation and Latency Analysis, Collision-Free Scheduling, Instruction Pipeline Design, Instruction Execution Phases, Mechanism for Instruction, Pipelining, Dynamic Instruction Scheduling, Branch Handling Techniques, Arithmetic Pipeline Design, Computer Arithmetic Principles, Static Arithmetic Pipeline, Multifunctional Arithmetic Pipeline.


Multiprocessors and Multi-computers: Multiprocessor System Interconnects, Hierarchical Bus Systems: Crossbar Switch and Multiport Memory, Multistage and Combing Networks, Cache Coherence and Synchronization Mechanisms, The Cache Coherence Problem, Snoopy Bus Protocol, Directory-based protocols, Single core and Multicore architecture: Architectural Design space, Introduction to heterogeneous computing, GPU architecture and OpenCL.

TEXT BOOKS:

1. Kai Hwang, 1993, “Advanced Computer Architecture- Parallelism, Scalability, Programmability”, McGraw Hill (Chapter 1.1-1.3, 2.1-204, 4. 1 (only specified topics), 4.2.1, 4.2.2, 5.1, 5.3, 6.1 , 604, 7.1, 7.2, 704.1, 704.2, 704.3).

2. V Rajararnan, C Siva Ram Murthy, 2000,”Parallel Computers - Architecture and Programming “, PHI.3. Benedict R. Gaster, Lee Howes, David R, Perhaad Mistry, Dana Schaa, “Heterogeneous Computing

with OpenCL” Morgan Kaufmann, 2012.

REFERENCE BOOKS:

1. David E Culler, J P Singh, Anoop Gupta, Harcourt Asia and Morgan Kaufmann 1999, “Parallel Computer Architecture”.

2. John P Hayes, 1998, “Computer Architecture and Organization”, 3rd Edition, McGraw-Hill.3. Michael Quinn, “Parallel Programming in C with MPI and OpenMP”, Tata McGraw Hill, 2011.

Note: It also includes laboratory (3hrs theory and 2hrs practical/week).

UCS613C COMPUTER GRAPHICS AND VISUALIZATION 4 CREDITS

Hours/Week: 04 CIE Marks: 50 Total Hours: 48 SEE Marks:50

Course Objectives To learn techniques of computer graphics and to provide foundation in graphics applications

programming.

Demonstrate an understanding of computer graphics hardware and architecture.

Understand the 2D and 3D geometric transformations.

To develop a facility with the relevant mathematics of computer graphics and understand 2D and 3D visualization.

Understand and create interactive graphics applications using OpenGL API.

Course Outcomes

Study the Graphics and imaging systems and their architectures.

Know about how to interact with graphics system.

Develop interactive graphics programs using 2D and 3D graphics using OpenGL API.

Represent basic geometric types and convert between various representations.

Apply lighting and shading effects on the graphical models.

UNIT –I 12 Hrs

Overview of Graphics Systems: Video Display Devices, Raster-Scan Displays,

GraphicsWorkstations and Viewing Systems, Introduction to OpenGL, Graphics Output

Primitives : Coordinate Reference Frames, Specifying A Two-Dimensional World-Coordinate

Reference Frame in OpenGL, OpenGL Point Functions, OpenGL Line Functions, Line drawing

algorithms: Bresenham’s Line-Drawing Algorithm, OpenGL Curve Functions, Circle

generating Algorithms: Midpoint Circle Algorithm, Fill-Area primitives, OpenGL Polygon Fill-

Area Functions, OpenGL Vertex Arrays, Pixel-Array Primitives, OpenGL Pixel-Array

Functions, Character Primitives, OpenGL Character Functions, OpenGL Display Lists, OpenGL

Display-Window Reshape Function, Attributes of Graphics Primitives: OpenGL State

Variables, Color and Grayscale, OpenGL Color Functions, OpenGL Point-Attribute Functions,

OpenGL Line-Attribute Functions

UNIT–II 12 Hrs

Interactive Input Methods and Graphical User Interfaces:

Graphical Input Data, Logical Classification of Input Devices, Input Functions for Graphical

Data, Interactive Picture-Construction Techniques, OpenGL Interactive Input-Device Functions ,

OpenGL Menu Functions, Designing a Graphical User Interface

Geometric Transformations-1: Basic Two-Dimensional Geometric Transformations, Matrix

Representations and Homogeneous Coordinates, Inverse Transformations, Two-Dimensional

Composite Transformations, Other Two-Dimensional Transformations, Raster Methods for

Geometric Transformations, OpenGL Raster Transformations, Transformations between Two-

Dimensional Coordinate Systems

UNIT- III 12 Hrs

Geometric Transformations-2:Geometric Transformations in Three-Dimensional Space,

Three-Dimensional Translation, Three-Dimensional Rotation, Three-Dimensional Scaling,

Composite Three Dimensional Transformations, Other Three Dimensional Transformations,

Transformations between Three Dimensional Coordinate Systems, Affine Tranformations,

OpenGL Geometric Transformations Functions

Two-Dimensional Viewing: The Two-Dimensional Viewing Pipeline, The clipping Window,

Normalization and Viewport Transformations, OpenGL Two-Dimensional Viewing Functions,

Clipping Algorithms, Two-Dimensional Point Clipping, Two-Dimensional Line Clipping:

Cohen-Sutherland line Clipping, Polygon Fill-Area Clipping: Sutherlan-Hodgman Polygon

Clipping, Curve Clipping, Text Clipping

UNIT-IV 12 Hrs

Three-Dimensional Viewing: Overview of Three-Dimensional Viewing Concepts, The Three-

Dimensional Viewing Pipeline, Three-Dimensional Viewing-Coordinate Parameters,

Transformation from World to Viewing Coordinates, Projection Transformations, Orthogonal

Projections, Oblique Parallel Projections, Perspective Projections, The Viewport

Transformation and Three- Dimensional Screen Coordinates, OpenGL Three-dimensional

Viewing Functions, Three-Dimensional Clipping Algorithms, OpenGL Optional Clipping Planes

Illumination Models and Surface-Rendering Methods: Light Sources, Surface Lighting Effects,

Basic Illumination Models, Transparent Surfaces, Atmospheric effects, Shadows, Camera

Parameters, Displaying Light Intensities, Polygon Rendering Methods, Ray-Tracing methods,

Radiocity Lighting Models, OpenGL Illumination and Surface-Rendering Functions, OpenGL

Texture Functions

Text Books:

1. Donald Hearn and Pauline Baker, 3rd Edition ,Pearson Education, 2004, Computer Graphics with OpenGL

References:

1. Edvard Angel, 5th Edition, Addison-Wesley, 2008, Interactive Computer Graphics A Top-

Down Approach with openGL

2. F.S.Hill Jr.2nd Edition, Pearson Education, 2001, Computer Graphics using OpenGL

3. James D. Foley, Andries Van Dam, Steven K Feiner, John F. Hughes, Addison-wesley

19997, Computer Graphics

COMPUTER GRAPHICS LABORATORY

Sub Code : UCS614L Credits : 1.5Hours/Week : 03 CIE MARKS : 50Exam Hours : 03 SEE Marks : 50

Course Objectives

To write program functions to render 2D and 3D graphics primitives.

To write programs that demonstrate geometrical transformations.

To write program functions to implement visibility detection in 2D and 3D images.

To write programs that demonstrate computer graphics animation along with lighting and

shading effects.

To demonstrate an understanding of the use of object hierarchy in graphics applications.

Course Outcomes

Design graphics program to construct 2D and 3D objects.

Develop the program to create the animation using graphics operations.

Implement the Graphics system for viewing.

Design the program to illustrate polygon fill and shading pattern.

Develop graphics applications using OpenGL programming tool.

Part-A1. Write OpenGL program to implement line drawing algorithm.2. Write OpenGL program to implement circle drawing algorithm.3. Implement OpenGL program to draw bar chart and pie chart.4. Design and implement program on interface device.5. Keyboard to draw the greeting message.6. Mouse device to illustrate interactive drawing.7. Implement interactive animation programs.

Kite flying Rotating wheel Moving car

8. Program to recursively subdivide a triangle to form 2D Sierpinski gasket. The number of recursive steps is to be specified by the user.

9. Program to draw a cube and spin it using OpenGL transformation matrices.10. Program to create a house like figure and rotate it about a given fixed point using OpenGL functions.11. Program to implement the Cohen- Sutherland line-clipping algorithm.12. Program to create a cylinder and a parallelepiped by extruding a circle and quadrilateral

respectively. Allow the user to specify the circle and the quadrilateral

Part- BDevelop a suitable graphics package to implement the skills learnt in the theory and the exercises indicated in Part A. Use the OpenGL.

Lab Assessment:1. Each laboratory subject is evaluated for 100 marks (50 CIE and 50 SEE)2. Allocation of 50 marks for CIE

1. Marks for each experiment = 20 marks/No. Of proposed experiments2. 10 marks for graphics package3. one practical test for 20 marks(25% write up ,50% conduction, calculation, 25% results)

3. Allocation of 50 marks for SEE 30 marks for evaluating program (25% write up ,50% conduction, calculation, 25% results) 20 marks for evaluating graphics package.

COMPUTER NETWORK LABORATORY


Course Objectives: To develop an understanding of modern network architectures from a design and

performance perspective.

Course Outcomes: 1. Create network topology and analyze the performance of the network in terms of

bandwidth, packet drop and throughput. 2. Demonstrate how error detection, correction and how data can be secured. 3. Analyze routing algorithms to find the suitable path for transmission and demonstrate the

control of flow rate. 4. Demonstrate the client-server communication using TCP/IP sockets and also explain how

inter-process communication established using different method.

PART –ASimulation ExercisesIntroduction Part

Introduce students to network simulation through the Network simulation Package, Create a simple network model with multiple scenarios, Collect statistics on network performance through the use of simulator tools, Analyze and draw conclusion on network performance1. Simulate two nodes point-to-point network and study the impact of bit error rate on packet error

rate and investigate the impact of error of a simple hub based CSMA / CD network.2. Simulate four nodes point-to-point network and study how the loss, utilization and transmission of

wireless LAN (IEEE 802.11b) network varies as the distance between access point and wireless nodes.

3. Simulate point-to-point network which consists of 4 to 6 nodes and study network performance analysis of different scheduling technique like First in out (FIFO), Priority, Round Robin, Weight Fair Queue (WFQ) using NetSim.

4. Simulate and study the throughputs of slow start, Congestion avoidance (also known as Old Tahoe) and First Retransmit (also known as Tahoe), Congestion Control Algorithms during client-server TCP downloads.

5. Create a network topology which consists six nodes, simulate and study the working and routing table formation of Interior Routing Protocol i.e. Routing Information Protocol (RIP) and Open Shortest Path First (OSPF).

6. Simulate seven cells GSM network and study and compare the effect of dynamic channel allocation (DCA) and fixed channel allocation (FCA) using NetSim.

7. Simulate seven cells GSM network and study how call blocking probability varies as the load on a GSM network is continuously increased.

PART – B

Implement the following in C/C++:

1. Write a program for error detecting code using CRC-CCITT (16- bits). 2. Write a program for Hamming code generation for error detection and correction. 3. Write a program for even / odd parity checking on binary data.4. Write a program to perform stuffing and destuffing on given information.5. Write a program for distance vector algorithm to find suitable path for transmission.6. Write a program for congestion control using leaky bucket algorithm7. Using TCP/IP sockets, write a client – server program to make the client send the file name and to

make the server send back the contents of the requested file if present.8. Implement the program 7 using the message queues IPC channels. 9. Implement the program 7 using the FIFO IPC channels: 10. Write a program for simple RSA algorithm to encrypt and decrypt the data.

Note: Student is required to solve one problem from PART-A and one problem from PART-B. The questions are allotted based on lots. Both questions carry equal marks.

COMPILER DESIGN

Sub Code : UCS020E Credits : 03Hours/Week : 03 CIE MARKS : 50Total Hours : 40 SEE Marks : 50

Course Objectives

1. To understand the theory and practice of compiler implementation.2. To learn finite state machines and lexical scanning.3. To learn context free grammars, compiler parsing techniques, construction of abstract

syntax trees, symbol tables, intermediate machine representations and actual code generation

4. To understand code optimization principles.

Course Learning Outcomes

After the completion of the course, students must able to;

1. Explain the concepts and design issues of compilers.2. Employ techniques for specification/and design of the phases of compilers.3. Comprehend the techniques of code optimization and generation.Design and develop applications involving lexical analysis, parsers and intermediate code

generationUNIT – I (10 Hours)

INTRODUCTION, LEXICAL ANALYSIS: Language processors; The structure of a Compilers; The evolution of programming languages; The science of building a compiler; Applications of Compiler technology; Lexical analysis: The Role of Lexical Analyzer; Input Buffering; Specifications of Tokens; Recognition of Tokens. SYNTAX ANALYSIS – 1: Introduction; Context-free Grammars; Writing a Grammar; Top-down Parsing.


SYNTAX ANALYSIS – 2: Bottom-up Parsing; Introduction to LR Parsing: Simple LR.,Parser Generators.SYNTAX-DIRECTED TRANSLATION: Syntax-Directed definitions; Evaluation order for SDDs; Applications of Syntax-directed translation; Syntax-directed translation schemes.


INTERMEDIATE CODE GENERATION: Variants of syntax trees; Three-address code; Types and declarations; Translation of expressions; Type checking; Control flow; Back patching.RUN-TIME ENVIRONMENTS: Storage Organization; Stack allocation of space.


RUN-TIME ENVIRONMENTS: contd. : Access to non-local data on the stack; Heap management; Introduction to garbage collection. CODE GENERATION: Issues in the design of Code Generator; The Target language; Addresses in the target code; Basic blocks and Flow graphs; Optimization of basic blocks; A Simple Code Generator.

TEXT BOOK:

1. Alfred V Aho, Monica S. Lam, Ravi Sethi, Jeffrey D Ullman, 2007,Compilers-Principles, Techniques and Tools –– 2nd Edition, Addison-Wesley. (chapter 1:1.1 -1.5,chapter 3:3.1 to 3.4,Chapter 4:4.1-4.6.4,Chapter 5:5.1-5.4.4,Chapter 6:6.1 -6.5.2,6.7-6.7.3,Chapter 7:7.1-7.5,Chapter 8:8.1-8.6)

REFERENCE BOOKS:

1. Charles N. Fischer, Richard J. leBlanc, Jr, 1991, Crafting a Compiler with C –, Pearson Education.2. Andrew W Apple, 1997,Modern Compiler Implementation in C –Cambridge University Press.3. Kenneth C Louden,1997, Compiler Construction Principles & Practice, Thomson Education.

C# PROGRAMMING AND .NET


Course Objectives:

1. To make student to know the core aspects of the .NET platform.

2. To make student Know various development tools used during the construction of .NET applications.

3. To make student learn basic concepts of C# programming Language

4. To make student learn advanced features of C# programming language , building & deploying applications

Course Outcomes:

After undergoing this course student will

1.Have through knowledge about e core aspects of the .NET platform.

2. Know various development tools used during the construction of .NET applications.

3.Have through knowledge about basic details of C# programming Language

4. Have through knowledge about advanced features of C# programming language , building & deploying applications


THE PHILOSOPHY OF .NET: Understanding the Previous State of Affairs, The .NET Solution, The Building Block of the .NET Platform (CLR,CTS, and CLS), The Role of the .NET Base Class Libraries, What C# Brings to the Table, An Overview of .NET Binaries ( aka Assemblies ), the Role of the Common Intermediate Language, The Role of .NET Type Metadata, The Role of the Assembly Manifast, Compiling CIL to Platform – Specific Instructions, Understanding the Common Type System, Intrinsic CTS Data Types, Understanding the Common Languages Specification, Understanding the Common Language Runtime A tour of the .NET Namespaces, Increasing Your Namespace Nomenclature, Deploying the .NET Runtime.BUILDING C# APPLICATIONS: The Role of the Command Line Complier (csc.exe), Building C # Application using csc.exe Working with csc.exe Response Files, Generating Bug Reports , Remaining C# Compiler Options, The Command Line Debugger (cordbg.exe)


C# LANGUAGE FUNDAMENTALS: The Anatomy of a Basic C# Class, Creating objects: Constructor Basics, The Composition of a C# Application, Default Assignment and Variable Scope, The C# Member Initialization Syntax, Basic Input and Output with the Console Class, Understanding Value Types and Reference Types, The Master Node: System, Object, The System Data Types (and C# Aliases), Converting Between Value Types and Reference Types: Boxing and Unboxing, Defining Program Constants, C# Iteration Constructs, C# Controls Flow Constructs, The Complete Set of C# Operators, Defining Custom Class Methods, Understating Static Methods, Methods Parameter Modifies, Array Manipulation in C #, String Manipulation in C#, C# Enumerations, Defining Structures in C#, Defining Custom Namespaces.OBJECT- ORIENTED PROGRAMMING WITH C#: Forms Defining of the C# Class, Definition the “Default Public Interface” of a Type, Recapping the Pillars of OOP, The First Pillars: C#’s Encapsulation Services, Pseudo- Encapsulation: Creating Read-Only Fields, The Second Pillar: C#’s Inheritance Supports, keeping Family Secrets: The “Protected” Keyword, Nested Type Definitions, The Third Pillar: C #’s Polymorphic Support, Casting Between.


EXCEPTIONS AND OBJECT LIFETIME: Ode to Errors, Bugs, and Exceptions, The Role of .NET Exception Handing, the System. Exception Base Class, Throwing a Generic Exception, Catching Exception, CLR System – Level Exception (System. System Exception), Custom Application-Level Exception (System. System Exception), Handling Multiple Exception, The Family Block, the Last Chance Exception Dynamically Identifying Application – and System Level Exception Debugging System Exception Using VS. NET, Understanding Object Lifetime, the CIT of “new’, The Basics of Garbage Collection,, Finalization a Type, The Finalization Process, Building an Ad Hoc Destruction Method, Garbage Collection Optimizations, The System. GC Type.

INTERFACES AND COLLECTIONS: Defining Interfaces Using C# Invoking Interface Members at the object Level, Exercising the Shapes Hierarchy, Understanding Explicit Interface Implementation, Interfaces As Polymorphic Agents, Building Interface Hierarchies, Implementing, Implementation, Interfaces Using VS .NET, understanding the IConvertible Interface, Building a Custom Enumerator (IEnumerable and Enumerator), Building Cloneable objects ( ICloneable), Building Comparable Objects ( IComparable ), Exploring the system. Collections Namespace, Building a Custom Container (Retrofitting the Cars Type).


Callback Interfaces, Delegates, and Events, Advanced Techniques: Understanding Callback Interfaces, Understanding the .NET Delegate Type, Members of System. Multicast Delegate, The Simplest Possible Delegate Example, Building More a Elaborate Delegate Example, Understanding Asynchronous Delegates, Understanding (and Using) Events. The Advances Keywords of C#, A Catalog of C# Keywords Building a Custom Indexer, A Variation of the Cars Indexer Internal Representation of Type Indexer. Using C# Indexer from VB .NET. Overloading operators, The Internal Representation of Overloading Operators, interacting with Overload Operator from Overloaded- Operator- Challenged Languages, Creating Custom Conversion Routines, Defining Implicit Conversion Routines, The Internal Representations of Customs Conversion Routines

UNDERSTANDING .NET ASSEMBLES: Problems with Classic COM Binaries, An Overview of .NET Assembly, Building a Simple File Test Assembly, A C#. Client Application, A Visual Basic .NET Client

Application, Cross Language Inheritance, Exploring the CarLibrary’s, Manifest, Exploring the CarLibrary’s Types, Building the Multifile Assembly ,Using Assembly,.

TEXT BOOKS:

1. Andrew Troelsen, 2007, Pro C# with .NET 3.0 Special Edition, Dream tech Press, India.2. E. Balagurusamy, 2004, Programming in C# 5th Reprint, Tata McGraw Hill.. (For Programming

Examples)

REFERENCE BOOKS:

1. Tom Archer, Inside C# , 2001, WP Publishers,.2. Herbert Schildt, 2004, C#: The Complete Reference –Tata McGraw Hill.

OPERATIONS RESEARCH


COURSE OBJECTIVES AND OUTCOMES

Course learning objectives

1. Explain the need of using operational research for effective decision making.

2. Identify and develop operational research models from the description of the real system.

3. Understand the mathematical tools that are needed to solve optimization problems in different fields.

4. Solve specialized linear programming problems like the transportation and assignment, network models like the shortest path, minimum spanning tree, and maximum flow problems

UNIT - I (10 Hours)

Introduction, Linear Programming Introduction: The origin, nature and impact of OR; Defining the problem and gathering data; Formulating a mathematical model; Deriving solutions from the model; Testing the model; Implementation.Introduction to Linear Programming: Prototype example; The linear programming (LP)model. Assumptions of LP: Additional example. The essence of simplex method; setting up the simplex method;Algebra of the simplex method; The simplex method in tabular form;Tie breaking in the simplex method.

UNIT - II (10 Hours)

Simplex Method (continued): Assumptions of LP; Additional examples.The essence of the simplex method; Setting up the simplex method; Algebra of the simplex method; The simplex method in tabular form; Tie breaking in the simplex method. Post optimality analysis.The revised simplex method, a fundamental insight. The essence of duality theory; Economic interpretation of duality. Primal dual relationship.

UNIT - III (10 Hours)

Transportation and Assignment Problems :The transportation problem; A streamlined simplex method for the transportation problem; The assignment problem; A special algorithm for the assignment problem.Network Optimization models: Prototype example, terminology of network, shortest path problem, Minimum cost flow problem, Network model for projects—critical path.

UNIT - IV (10 Hours)

Game Theory, Decision Analysis: Game Theory: The formulation of two persons, zero sum games; Solving simple games- a prototype example; Games with mixed strategies; Graphical solution procedure; Solving by linear programming, Extensions. Decision Analysis: A prototype example; Decision making without experimentation; Decision making with experimentation; Decision trees.

Text Books:

1. Frederick S. Hillier and Gerald J. Lieberman: 2005,Introduction to Operations Research, 8th Edition, Tata McGraw Hill.

Reference Books:

1. Wayne L. Winston, 2003, Operations Research Applications and Algorithms, 4th Edition, Thomson Course Technology.

2. Hamdy A Taha, 2007, Operations Research, An Introduction, 8th Edition, Prentice Hall India.

MULTICAST COMMUNICATION



Introduction: The Basic of Group Communication: Types of Communication; Multicast vs. Unicast; Scalability; Applications of Group Communication; Characteristics of Groups; Special Aspects of Group Communication; Support within the Communication System. Multicast Routing: Basic Routing Algorithms; Group Dynamics; Scoping and Multicast Address Allocation; Concepts for Multicast Routing; Multicast routing on the Internet.


Quality of Service: Integrated Services; Differentiated Services; Differences and Integration Options. Multicast in A TM Networks: The Switching Technology ATM; ATM Multicast.


Transport Protocols:UDP; XTP; MTP; RMP; LBRM; SRM; RMTP; PGM; MFTP.


MBone - The Multicast Backbone of the Internet, bone Architecture; MBone Applications; MBone Tools; Outlook: Multicast Routing and Mobile Systems; Multicast and DiffiServ; Active Networks for Supporting Group Communication; Group Management for Large Dynamic Groups.

TEXT BOOK:

1. Ralph Wittmann and Martina Zitterbart, “Multicast Communication Protocols and Applications“, Morgan Kaufmann Publishers,

Scheme of Syllabus for 5th Semester B.E. Computer Science & Engineering (2015-16 Batch onwards)

Sl.No


1 UCS521C Analysis and Design of Algorithms 3 0 2# 4 50 50 1002 UCS512C System Software 3 0 0 3 50 50 1003 UCS523C Data Communications 4 0 0 4 50 50 1004 UCS524C Software Engineering 4 0 0 4 50 50 1005 UCS063E Elective – 1 (FAFL) 3 0 0 3 50 50 1006 UCS061E Elective - 2 (USP) 3 0 0 3 50 50 1007 UCS525L System Software Lab 0 1 3 2 50 50 1008 UCS526L Operating Systems Lab 0 2 2 2 50 50 100

Total 20 3 7 25 400 400 800



ANALYSIS AND DESIGN OF ALGORITHMS

Sub Code : UCS521C Credits : 04Hours/Week : Theory: 03, Practical: 2 CIE MARKS : 50 (30 theory, 20 lab)Total Hours : 40 SEE Marks : 50

Course Objectives

Upon completion of this course, students will be able to do the following:

Analyze and compare the asymptotic performance of algorithms. Write the correctness proofs for algorithms. Demonstrate a acquaintance with major algorithms and data structures. Apply important algorithmic design paradigms and methods of analysis. Synthesize efficient algorithms in to address common engineering challenges.

Course Outcomes

Students who complete the course will have demonstrated the ability to do the following:

Analyze worst-case, best case and average case running times of algorithms using asymptotic analysis.

Describe the various algorithmic paradigms like Brute Force, Divide and Conquer, Transform and Conquer,Dynamic Programming, Greedy technique.

Explain the major graph algorithms and their analyses. Use the above techniques to synthesize solutions to new emerging engineering problems.

UNIT I (10 Hours)

Introduction: Notion of Algorithm, Fundamentals of Algorithmic Problem Solving, Important Problem Types, Fundamental Data Structures.Fundamentals of the Analysis of Algorithm Efficiency: Analysis Framework, Asymptotic Notations and Basic Efficiency Classes, Mathematical Analysis of Non-recursive and Recursive Algorithms, Example – Fibonacci Numbers. Brute Force: Selection Sort and Bubble Sort, Sequential Search and Brute-Force String Matching, Exhaustive Search.

UNIT II (10 Hours)

Divide and Conquer: Mergesort, Quicksort, Binary Search, Binary tree traversals and related properties, Multiplication of large integers and Stressen’s Matrix Multiplication.Decrease and Conquer: Insertion Sort, Depth First Search, Breadth First Search, Topological Sorting, Algorithms for Generating Combinatorial Objects.

UNIT III (10 Hours)

Transform and Conquer: Presorting, Balanced Search Trees, Heaps and Heapsort, Problem Reduction Space and Time Tradeoffs: Sorting by Counting, Input Enhancement in String Matching , Hashing, B-Trees Dynamic Programming: Computing a Binomial Coefficient, Warshall’s and Floyd’s Algorithms, Optimal Binary Search Trees. The Knapsack Problem and Memory Functions.

UNIT IV (10 Hours)

Greedy Technique: Prim’s Algorithm,Kruskal’s Algorithm, Dijkstra’s Algorithm, Huffman Trees. Limitations of Algorithm Power: Lower-Bound Arguments, Decision Trees, ProblemsCoping with the Limitations of Algorithm Power: Backtracking, Branch-and-Bound,

Text Books:

1. Anany Levitin, 2007,’Introduction to The Design & Analysis of Algorithms’, 2nd Edition, Pearson Education.

Reference Books

1. Thomas H. Cormen, Charles E. Leiserson, Ronal L. Rivest, Clifford Stein, 2006,’ Introduction to Algorithms’, 2nd Edition, PHI.

2. Horowitz E., Sahni S., Rajasekaran S.,Galgotia Publications, 2001, ’Computer Algorithms’ .

Note: It also includes laboratory (3 Hours Theory and 2 Hours Practical/Week)

SYSTEMS SOFTWARE



Course Description

iii) Course Learning objectives (CLO):

At the end of the course student will learn/understand/ think/experience/appreciate:

6. Basic concepts and types of system softwares.7. Design and characteristics of various machine architectures such as SIC, SIC/XE, RISC

and CISC.8. Basic concepts, algorithms and implementation methods of assembler, loader, linker and

compiler.9. Lex and Yacc programming languages, their structures etc. to design lexical analyzer and

syntactic analyzer for given applications.10. Characteristics, algorithms and implementation methods of Macro-processor.

iv) Course outcomes:At the end of the course student should be able to:

6. List and define features/concepts of machine architectures and system softwares.7. Explain characteristics/concepts/basic operations of machines architectures, system

softwares and Lex and Yacc tools.8. Write programs to implement simple assembler, loader, linker, macroprocessor, lexical

analyzer and syntactic analyzer.9. Compare and contrast types of softwares, machine architectures, system softwares and

Lexical and syntactic analyzer.10. Analyze, Design and implement system softwares for different architectures.

UNIT I (10 Hours)

Machine Architecture: Introduction, System Software and Machine Architecture, Simplified Instructional Computer (SIC) - SIC Machine Architecture, SIC/XE Machine Architecture, SIC Programming Examples, Traditional (CISC) Machines - VAX Architecture, RISC Machines - Ultra SP ARC Architecture. Assemblers: Basic Assembler Function - A Simple SIC Assembler, Assembler Algorithm and Data Structures, Machine Dependent Assembler Features - Instruction Formats & Addressing Modes, Program Relocation, Machine Independent Assembler Features - Literals, Symbol-Definition Statements, Expression, Program

Blocks, Control Sections and Programming Linking.

UNIT II (10 Hours)

Loaders And Linkers: Basic Loader Functions - Design of an Absolute loader, A Simple Bootstrap Loader, Machine-Dependent Loader Features - Relocation, Program Linking, Algorithm and Data Structures for a Linking Loader, Machine-Independent Loader Features - Automatic Library Search, Loader Options, Loader Design Options - Linkage Editor, Dynamic Linkage, Bootstrap Loaders.

UNIT III (10 Hours)

Compilers: Basic Compiler Function - Grammars, Lexical Analysis, Syntactic Analysis, Code Generation, Machine Dependent Compiler Features Intermediate Form of the Program. Machine-Dependent Code Optimization, Machine Independent Compiler Features - Structured Variables, Machine Independent Code Optimization, Storage Allocation, Block Structured Languages.

UNIT IV (10 Hours)

Macro Processor: Basic Macro Processor Functions - Macro Definitions and Expansion, Macro Processor Algorithm and Data Structures, Machine-Independent Macro Processor Features - Concatenation of Macro Parameters, Generation of Unique Labels, Conditional Macro Expansion, Keyword Macro Parameters, Macro Processor Design Options - Recursive Macro Expansion, General-Purpose Macro Processors, Macro Processing Within Language Translators. Lex And Yacc: Lex and Yacc - The Simplest Lex Program, Recognizing Words with LEX, Grammars, Parser-Lexer Communication, A Y ACC Parser, The Rules Section, Running LEX and Y ACC, LEX and Hand- Written Lexers, Using LEX - Regular Expression, Examples of Regular Expressions, A Word Counting Program, Using Y ACC - Grammars, Recursive Rules, Shift/Reduce Parsing, What Y ACC Cannot Parse, A Y ACC Parser - The Definition Section, The Rules Section, Symbol Values and Actions, The LEXER, Compiling and Running a Simple Parser, Arithmetic Expressions and Ambiguity, Variables and Typed Tokens.

TEXT BOOKS:

1) Leyland.L.Beck, 1997, System Software, 3rd Edition, Addison-Wesley.2) John.R.Levine, 1999, Tony Mason and Doug Brown, Lex and Yacc, O’Reilly, SPD.

REFERENCE BOOK:

1) D.M.Dhamdhere, 1999,System Programming and Operating Systems, 2nd Edition, TMH.

DATA COMMUNICATIONS



Course Objectives:

6. To understand the concept of data communication and modulation techniques.

7. To comprehend the use of different types of transmission media and network devices.

8. To understand the error detection and correction in transmission of data.

9. To understand the concept of flow control, error control and LAN protocols.

10. To understand the functions performed by Network Management System.

COURSE LEARNING OUTCOMES :(Knowledge based)

5. understand the basic principles of network design;

6. Understand the concept data communication within the network environment;

7. Understand the conflicting issues and resolution techniques in data transmission.

8. Understand the setting up of a network environment with all the necessary data.

communication components, procedure and techniques that make it functional


Introduction: Data Communications; Networks; the Internet; Protocols and Standards; Network Models: Layered tasks; The OSI Model, Layers in the OSI model; TCP / IP Protocol Suite, Addressing. Data and Signals: Analog and digital signals; Periodic Analog Signals, Digital Signals, Transmission impairment; Data rate limits; Performance.


Digital Transmission, Analog Transmission And Multiplexing: Digital-to-Digital conversion; Analog-to-Digital conversion: PCM; Transmission modes, Digital - to - Analog conversion; Analog - to - Analog conversion; Multiplexing. Transmission Media: Guided media, unguided media: Wireless.


Error Detection and Correction:

Introduction to Error Detection and Correction; Block Coding; Linear Block Codes; Cyclic codes, Checksum.Data Link Control: Framing; Flow and Error control; Protocols; Noiseless channels; Noisy channels; HDLC; Point-to-point Protocol. Multiple Accesses: Random Access; Controlled Access; Channelization.


Ethernet: EEE standards; Standard Ethernet and changes in the standard; Fast Ethernet; Gigabit Ethernet.Wireless LANs and Connection of LANs: IEEE 802.11; Bluetooth. Connecting devices; Backbone Networks; Virtual LANs.Other Technologies: Cellular telephony; SONET / SDH: Architecture, Layers, Frames; STS multiplexing.

TEXT BOOK:

1) Behrouz A. Forouzan, 4th Edition, Tata McGraw-Hill, 2006, Data Communications and Networking.

REFERENCE BOOKS:

1) Alberto Leon, Garcia and Indra Widjaja, 3rd Edition, Tata McGraw- Hill, 2004, Communication Networks: Fundamental Concepts and Key Architectures.

2) William Stallings, 8th Edition, Pearson Education, 2007, Data and Computer Communication.

SOFTWARE ENGINEERING



Course Outcomes

1. Describing the software and software engineering, types of systems and their properties, concept of software process and models.

2. Demonstrating different requirements documents, designs, models, verifying and validating.

3. Analyzing different models, designs and methods of software development, and verification and validation and software architecture.

4. To judge the different software process activities, system process activities, management and software architecture.

5. Able to use all the approaches to develop different models, designs, requirements document and creating skeletal system

Course Objectives

7. Knowledge of basic software engineering methods and practices, and their appropriate application and understanding of some ethical and professional issues.

8. An understanding of software requirements, different software architectural styles and implementation issues.

9. An understanding of approaches to verification and validation, software evolution and related issues.

10. An understanding on quality control and how to ensure good quality software.

11. Development of significant teamwork and project based experience.

12. To gain a broad understanding of the discipline of software engineering and its application and management.

UNIT –I (12 Hours)

OVERVIEW: Introduction: FAQ's about software engineering, Professional and ethical responsibility. Socio-Technical systems: Emergent system properties; Systems engineering; Organizations, people and computer systems; Legacy systems.

CRITICAL SYSTEMS, SOFTWARE PROCESSES: Critical Systems: A simple safety-critical system; System dependability; Availability and reliability. Software Processes: Models, Process iteration, Process activities; The Rational Unified Process; Computer-Aided Software Engineering.

UNIT –II (12 Hours)

REQUIREMENTS: Software Requirements: Functional and Non-functional requirements; User requirements; System requirements; Interface specification; The software requirements document. Requirements Engineering Processes: Feasibility studies; Requirements elicitation and analysis; Requirements validation; Requirements management.SYSTEM MODELS, PROJECT MANAGEMENT: System Models: Context models; Behavioral models; Data models; Object models; Structured methods. Project Management: Management activities; Project planning; Project scheduling; Risk management.

UNIT –III (12 Hours)

SOFTWARE DESIGN: Architectural Design: Architectural design decisions; System organization; Modular decomposition styles; Control styles. Object-Oriented design: Objects and Object Classes; An Object- Oriented design process; Design evolution.DEVELOPMENT: Rapid Software Development: Agile methods; Extreme programming; Rapid application development. Software Evolution: Program evolution dynamics; Software maintenance; Evolution processes; Legacy system evolution.

UNIT –IV (12 Hours)

VERIFICATION AND VALIDATION: Verification and Validation: Planning; Software inspections; Automated static analysis; Verification and formal methods. Software testing: System testing; Component testing; Test case design; Test automation.MANAGEMENT: Managing People: Selecting staff; Motivating people; Managing people; The People Capability Maturity Model. Software Cost Estimation: Productivity; DESIGNING AND DOCUMENTING SOFTWARE ARCHITECTURE: Architecture in the life cycle; Designing the architecture; Forming the team structure; Creating a skeletal system.

TEXT BOOK:

1) Ian Somerville, 8th Edition, Pearson Education, 2007, Software Engineering.2) Len Bass, Paul Clements, Rick Kazman, Pearson Education, 2003. Software Architecture in Practice ,

2nd Edition,

REFERENCE BOOKS:

1) Roger S. Pressman, 7th Edition, McGraw-Hill, 2007, Software Engineering: A Practitioners Approach.

2) Shari Lawrence Pfleeger, Joanne M. Atlee, 3rd Edition, Pearson Education, 2006, Software Engineering Theory and Practice.

3) Waman S Jawadekar, Tata McGraw Hill, 2004, Software Engineering Principles and Practice.

SYSTEMS SOFTWARE LABORATORY



Course learning Objectives:

At the end of the course student will learn/practice/ think/experience/appreciate:

1. Design and implement of system softwares using C or C++.2. Design and implement of scanners using Lex tool.3. Design and implement of parser using Yacc tool.

Course outcomes:

At the end of the semester student should be able to:

1. Implement the system softwares such as assembler, loader and linker etc using C or C++.

2. Design and write Lex program to implement lexical analyzer for given problem statement.

3. Design and write Yacc program to implement parser for the given structure recognition.

4. Modify the existing design of the algorithm of system softwares to enhance the efficiency.

Part I

1. Write a C program to implement pass one of two pass assembler.2. Write a C program to implement absolute loader.3. Write a C program to implement pass one of two pass macroprocessor.4. Write a C program to implement pass two of two pass macroprocessor 5. Write a C program to generate a lexical analyzer to identify the C keywords6. Design recursive descent parser for parsing pascal read & write statements.

Part II

Design lexical analysers using Lex tool to accomplish the following.

1. Design Lexical analyzer to count the no of occurrences of the words from a given text file.The program should accept the text file and list of words as input.

2. Design Lexical analyzer to count no of positive numbers and negative numbers from the input given.3. Design Lexical analyzer to count number of printf and scanf statements and replace them by sprintf

and sscanf respectively.4. Design Lexical analyzer to count number of integers , float, double,char variable from C declaration

statements 5. Design Lexical analyzer to count number of blank spaces lines, characters, words from a given text

file. 6. Design Lexical analyzer to check whether a given simple arithmetic operation is valid or not. If valid

print number of positive, negative, multiplication and division operators separately

Part III

Design parsers using Yacc tool to accomplish the following.

1. Design parser using Yacc tool to test the validity of a simple expression involving operators ‘+’,’-‘,’/’,’*’.

2. Design parser using Yacc tool to evaluate the given arithmetic expression involving operators ‘+’,’-‘,’/’,’*’.

3. Design parser using Yacc tool to recognize a valid variable which starts with a letter followed by any number of letters and digits.The length of the identifier should not exceed 15.

4. Design parser using Yacc tool to recognize the grammar an b where n>=10.5. Design parser using Yacc tool to recognize the validity of nested if statements and also display the

number of levels of nesting

Note:

Continuous Internal Evaluation (50 marks) :

Marks are based on execution of assignments and lab internal test. The marks are distributed as below;1. 30 marks for lab assignment execution.2. 20 marks for lab internal test.

Semester End Examination (50 marks):

In semester end examination two questions will be given. One from Part-I and one from Part-II and Part-III respectively.

OPERATING SYSTEM LABORATORY



OBJECTIVE: 1. to gain practical experience with designing and implementing concepts of operating systems.2. to study system calls.3. to implement commands using system calls.4. to study and use different interprocess communication methods in concurrent application. OUTCOMES: Upon the completion of Operating Systems practical course, the student will be able to: 1. implement and analyze basic services and functionalities of the operating system using system calls. 2. implement multithreaded applications .3. develop applications using concurrent processes considering synchronization problems.4.compare benefits of thread over process.5. Simulate and analyze CPU Scheduling Algorithms like FCFS, Round Robin, SJF, and Priority.6. Implement memory management schemes and page replacement schemes

PART A

1. Write a C program to sort the given set of numbers. Let the parent process sort the first half of the list and child process sort the second half of the list. Finally let the parent process merge the two sorted sublists and display the result.

2. Write a C program to sort the given set of numbers. Let the parent sort the first half of the list and child thread sort the second half of the list. Finally let the parent thread merge the two sorted sublists and display the result.

3. Write a C program to implement Shortest Request Next Scheduling Policy (Non-Preemptive).4. Write a C program to implement the following memory allocation schemes by considering the

problem of external fragmentation.a. Best Fitb. Worst Fit

5. Write a C program to implement FIFO page replacement technique,also check Beladays anomaly.6. Write a C program to implement LRU page replacement technique.7. Write a C program to implement Producer-Consumer problem using Dekkers algorithm8. Write a C program to implement Bankers Algorithm.

PART B

1. Write a C program to implement the following functions using File APIs1. a.displayfile(filename)2. b.readfrom(filename,position,buff,size)

2. Write a C program to print the type of file for each command line argument.

3. Write a C program to display environment variables of the parent process,then create a child process and execute a new program with new environment(Use apprpriate exec system call)

4. Write a C program to display process times.5. 5. Write a C program to generate SIGINT and SIGSTOP signals using signal() API,Count number of

CTRL_C pressings of user and display the CTRL_C pressing count when user presses CTRL_Z.6. Write a C program to handle signal generated during arithemetic operations.7. Write a C program to demonstrate interprocess communication using pipes. A parent process

reads data from a file and writes it to a pipe wheres as the child process reads data from the pipe and displays it on screen.

8. Write a C program to implement the solution for producer-Consumer problem using Semaphores.

Part C (Not for SEE)Adding system calls to the kernel.

FINITE AUTOMATA AND FORMAL LANGUAGES

Sub Code : UCS063E Credits : 03

Hours/

Week: 03 CIE MARKS : 50


Course Objectives: The goal of this course is to provide students with an understanding of basic concepts in the theory of computation. At the end of this course students will:

Be able to construct finite state machines and the equivalent regular expressions. Be able to prove the equivalence of languages described by finite state machines and

regular expressions. Be able to construct pushdown automata and the equivalent context free grammars. Be able to prove the equivalence of languages described by pushdown automata and

context free grammars. Be able to construct Turing machines.

Course Outcomes:

After completion of this course, the student should be able to:

Prove properties of languages, grammars and automata with rigorously formal mathematical methods;

Design automata, regular expressions and context-free grammars accepting or generating a certain language;

Describe the language accepted by an automata or generated by a regular expression or a context-free grammar;

Transform between equivalent deterministic and non-deterministic finite automata, and regular expressions;

Simplify automata and context-free grammars;


Introduction To Theory of Computation: Three basic concepts; some applications.

Finite Automata: Deterministic Finite Accepters; Nondeterministic Finite Accepters; Equivalence of deterministic and Nondeterministic Finite Accepters; Reduction of the number of states in Finite Automata.


Regular Languages and Regular Grammars: Regular expressions; Connection between Regular Expression and Regular Languages; Regular Grammars.

Properties of Regular Languages: Closure Properties of Regular Languages; Elementary Questions about Regular Languages; Identifying Nonregular Languages.


Context-Free Languages: Context-Free Grammars; Parsing and Ambiguity; Context-Free Grammars and Programming Languages.

Simplification of Context-Free Grammars and Normal Forms: Methods of Transforming Grammars; Two Important Normal Forms.


Pushdown Automata: Nondeterministic Pushdown Automata; Pushdown Automata and Context-Free Languages; Deterministic Pushdown Automata and Deterministic Context-Free Languages.

Properties of Context-Free Languages: Two Pumping Lemmas; Closure Properties and Decision Algorithms for Context Free Languages.

Turing Machines: The Standard Turing Machine.

TEXT BOOK:

1. An Introduction to Formal Languages and Automata, Peter Linz, Norosa Publication, 4th Edition, 5th printing, 2007.

REFERENCE BOOK:

1. Introduction to Languages and Automata Theory, John C Martin, 3rd Edition, Tata McGraw-Hill, 2007.

2. Introduction to Automata Therory, Langages and Computation, John E Hopcroft, Rajeev Motwani, Jeffery D. Ullman, 3rd C Edition, Person Education, 2007

UNIX SYSTEMS PROGRAMMING


Learning objectives

1. Understand UNIX operating system and terminology.

2. Study about POSIX standards, system configuration parameters

3. Study different classes of systems calls provided in the UNIX environment.

4. Learn processes, process relationships and inter-process communication .

5. To be able to design and build an application/service over the UNIX system.

Course Learning Outcomes

After the completion of the course, students must be able to

1. List Different classes of APIs and select appropriate API.

2. Create different types of file using UNIX APIs and perform various operations on files.

3. Build programs similar to standard UNIX utilities using UNIX system calls.

4. Develop programs with multiple co-operative processes.

5. Compare different methods of process creation and inter process communication methods.

6. Develop applications using multiple threads, multiple processes and Synchronization

using signals and semaphores.

UNIT-I (10 Hours)

IntroductionUNIX and POSIX APIs: The POSIX APIs, The UNIX and POSIX Development Environment, API Common Characteristics.UNIX FilesFile Types, The UNIX and POSIX File System, The UNIX and POSIX File Attributes, Inodes in UNIX System V, Application Program Interface to Files, UNIX Kernel Support for Files, Relationship of C Stream Pointers and File Descriptors, Directory Files, Hard and Symbolic Links.UNIX File APIs:General File APIs, File and Record Locking, Directory File APIs, Device File APIs, FIFO File APIs, Symbolic Link File APIs, General File Class, regfile Class for Regular Files, dirfile Class for Directory Files, FIFO File Class, Device File Class, Symbolic Link File Class

UNIT-II (10 Hours)

UNIX ProcessesThe Environment of a UNIX Process: Introduction, main function, Process Termination, Command-Line Arguments, Environment List, Memory Layout of a C Program, Shared Libraries, Memory Allocation, Environment Variables, setjmp and longjmp Functions, getrlimit, setrlimit Functions, UNIX Kernel Support for Processes.Process Control:Introduction, Process Identifiers, fork, vfork, exit, wait, waitpid, wait3, wait4 Functions, Race Conditions, exec Functions, Changing User IDs and Group IDs, Interpreter Files, system Function, Process Accounting, User Identification, Process Times, I/O Redirection.

UNIT-III (10 Hours)

Process Relationships:Introduction, Terminal Logins, Network Logins, Process Groups, Sessions, Controlling Terminal, tcgetpgrp and tcsetpgrp Functions, Job Control, Shell Execution of Programs, Orphaned Process Groups.Signals:The UNIX Kernel Support for Signals, signal, Signal Mask, sigaction, The SIGCHLD Signal and the waitpid Function, The sigsetjrnp and siglongjrnp Functions, Kill, Alarm, Interval Timers, POSIX.lb Timers.

UNIT-IV (10 Hours)

Interprocess Communication: Overview of IPC Methods, Pipes, popen, pclose Functions, Coprocesses, FIFOs, System V IPC, Message Queues, Semaphores, Shared Memory, Client-Server Properties, Stream Pipes, Passing File Descriptors, An Open Server-Version 1, Client-Server Connection Functions.

TEXT BOOKS:

1. Terrence Chan: 1999, Unix System Programming Using C++, Prentice Hall India. [Chapters: 1,5,6, 7, 8,9, 10]

2. W.Richard Stevens: Advanced Programming in the UNIX Environment, Addison- Wesley/PHI. [Chapters: 7, 8,9, 13, 14, 15]

REFERENCE BOOKS:

1. MauriceJ.Bach: The Design of the UNIX Operating System, Pearson Education/Prentice Hall of India. 2. Uresh Vahalia: 2001, Unix Intemals, Pearson Education, ASIA.

Scheme of Syllabus for 6th Semester B.E. Computer Science & Engineering (2015-16 Batch onwards)

Sl.No


1 UCS611C Computer Networks 4 0 0 4 50 50 1002 UCS612C Advanced Computer Architectures 3 0 2# 4 50 50 100

3 UCS613C Computer Graphics and Visualization 4 0 0 4 50 50 100

4 - Elective - 3 3 0 0 3 50 50 1005 - Elective -4 3 0 0 3 50 50 1006 - Elective -5 3 0 0 3 50 50 1007 UCS614L Computer Graphics Lab 0 0 3 1.5 50 50 1008 UCS615L Computer Networks Lab 0 0 3 1.5 50 50 1009 UCS616S Seminar 2 1 50 50 100

Total 20 0 6 25 400 400 800



COMPUTER NETWORKS



Course Objectives:

1. Build an understanding of the fundamental concepts of computer networking also Introduce the student to advanced networking concepts, preparing the student for entry Advanced courses in computer networking.

2. Allow the student to gain expertise in some specific areas of networking such as the design and maintenance of individual networks.

Course Outcomes:

After completing this course the student must demonstrate the knowledge and ability to:

1 Explain different versions of network protocols along with address mapping, delivery, forwarding and routing.

2 Solve the basic network design problems using knowledge of common local and wide area

network architectures.

3 Explain the protocols (such as UDP, TCP, SCTP) used in Transport layer.

3 Explain techniques to control congestion in a network and techniques to improve the quality of service.

4 Explain the applications of application layer. and network management systems, multimedia and introduction part of cryptography and network security aspects


Network Layer: Logical Addressing: IPv4 Addresses, IPv6 Addresses. Internet Protocol: Internetworking, IPv4, IPv6, Transition from IPv4 to IPv6. Address Mapping, Error Reporting & Multicasting: Address Mapping, ICMP, and IGMP. Delivery, Forwarding & Routing: Delivery, Forwarding, Unicast Routing Protocols.


Transport Layer: Peer-to-Peer Delivery: UDP, TCP, and SCTP. Congestion Control and Quality of Service: Data traffic, Congestion, Congestion Control, Two Examples, Quality of Service, Techniques to improve QoS, Integrated Services, QoS in Switched Networks.


Application Layer: Domain Name System: Name Space, Domain Name Space, Distribution of Name Space, DNS In The Internet, Resolution, DNS Messages, Types of records, Registrars, Dynamic Domain Name System, Encapsulation. Remote Logging, Electronic Mail, File Transfer. WWW and HTTP: Architecture, Web Documents, HTTP.


Network Management: Network Management System, SNMP. Multimedia: Digitizing Audio and Video, Audio and Video Compression, Streaming Stored Audio/Video, Streaming Live Audio/Video, Real-Time Interactive Audio/Video, RTP, RTCP, Voice Over IP. Cryptography: Introduction, Symmetric-Key Cryptography, Asymmetric-key Cryptography, Network Security services.

TEXT BOOK:

1. Behrouz A. Forouzan, 4th Edition, Tata McGraw-Hill, 2006, Data Communications and Networking.

REFERENCE BOOKS:

1. James F. Kurose, Keith W. Ross, Third Edition, Pearson Education, 2008, Computer Networking-A top-down approach featuring the Internet.

2. William Stallings, 8th Edition, Pearson Education, 2007, Data and Computer Communication.3. Larry L. Peterson and Bruce S. David – 4th Edition, Elsevier, 2007, Computer Networks A

Systems Approach. 4. Wayne Tomasi, Pearson Education, 2005, Introduction to Data Communications and

Networking.

ADVANCED COMPUTER ARCHITECTURES

Sub Code : UCS612C Credits : 03Hours/Week : 03 (Theory + 2 Hrs Lab) CIE MARKS : 50


Course Objectives:

5. Technical competence in computer architecture and high performance computing6. Ability to describe the operation of modern and high performance computers. 7. Ability to undertake performance comparisons of modern and high performance

computers. 8. Development of software to solve computationally intensive problems.

Course Outcomes:

At the end of the course students are able to

6. Explain the basic concepts of high performance computers

7. Compare the relationship between different computer architectures and their corresponding instruction sets.

8. Calculate and Contrast performance attributes for various computer architecture components.

9. Analyze the performance of various computer architectures

10. Design and develop simple parallel programs using Openmp


Parallel Computer Models : The State of Computing, Computer Development Milestones, Elements of Modem Computers, Evolution of Computer Architecture, System Attributes to Performance, Multiprocessors and Multicomputers, Shared -Memory Multiprocessors, Distributed -Memory Multiprocessors, A Taxonomy of MIMD Computers, Multivector and SIMD computers, Vector Supercomputers, SIMD Supercomputers, Program and Network Properties, Conditions of Parallelism, Data and Resource Dependencies, Hardware and Software Parallelism, Program flow Mechanisms, Control Flow Versus Data Flow , Demand-Driven Mechanisms, Comparisons of Flow MechanismsPARALLEL PROGRAMMING: Message passing Programming, Shared memory programming, open MP Libraries.


System Interconnect Architecture: Network properties and Routing, Static Connection Networks,

Dynamic Connection Networks, Processor and Memory Technologies, Advanced Processor Technology, Instruction Pipelines, Processors and Co-processors, Instruction-Set Architectures, CISC Scalar Processor, RISC Scalar Processors, Superscalar and Vector Processor, Superscalar Processors, VLIW Architecture

Backplane Bus System, Backplane Bus Specification, Addressing and Timing Protocols, Arbitration, Transaction and Interrupt, IEEE Futurebus+ Standards, Shared-Memory, Organizations, Interleaved Memory Organization, Bandwidth and fault Tolerance, Memory Allocation Schemes.


Pipelining and Superscalar Techniques: Linear Pipeline Processors, Asynchronous and Synchronous Models, Clocking and Timing control, Speed up, Efficiency and Throughput, Non-linear Pipeline Processors, Reservation and Latency Analysis, Collision-Free Scheduling, Instruction Pipeline Design, Instruction Execution Phases, Mechanism for Instruction, Pipelining, Dynamic Instruction Scheduling, Branch Handling Techniques, Arithmetic Pipeline Design, Computer Arithmetic Principles, Static Arithmetic Pipeline, Multifunctional Arithmetic Pipeline.


Multiprocessors and Multi-computers: Multiprocessor System Interconnects, Hierarchical Bus Systems: Crossbar Switch and Multiport Memory, Multistage and Combing Networks, Cache Coherence and Synchronization Mechanisms, The Cache Coherence Problem, Snoopy Bus Protocol, Directory-based protocols, Single core and Multicore architecture: Architectural Design space, Introduction to heterogeneous computing, GPU architecture and OpenCL.

TEXT BOOKS:

1. Kai Hwang, 1993, “Advanced Computer Architecture- Parallelism, Scalability, Programmability”, McGraw Hill (Chapter 1.1-1.3, 2.1-204, 4. 1 (only specified topics), 4.2.1, 4.2.2, 5.1, 5.3, 6.1 , 604, 7.1, 7.2, 704.1, 704.2, 704.3).

2. V Rajararnan, C Siva Ram Murthy, 2000,”Parallel Computers - Architecture and Programming “, PHI.3. Benedict R. Gaster, Lee Howes, David R, Perhaad Mistry, Dana Schaa, “Heterogeneous Computing

with OpenCL” Morgan Kaufmann, 2012.

REFERENCE BOOKS:

1. David E Culler, J P Singh, Anoop Gupta, Harcourt Asia and Morgan Kaufmann 1999, “Parallel Computer Architecture”.

2. John P Hayes, 1998, “Computer Architecture and Organization”, 3rd Edition, McGraw-Hill.3. Michael Quinn, “Parallel Programming in C with MPI and OpenMP”, Tata McGraw Hill, 2011.

Note: It also includes laboratory (3hrs theory and 2hrs practical/week).

COMPUTER GRAPHICS AND VISUALIZATION



Course Objectives To learn techniques of computer graphics and to provide foundation in graphics applications

programming.

Demonstrate an understanding of computer graphics hardware and architecture.

Understand the 2D and 3D geometric transformations.

To develop a facility with the relevant mathematics of computer graphics and understand 2D and 3D visualization.

Understand and create interactive graphics applications using OpenGL API.

Course Outcomes

Study the Graphics and imaging systems and their architectures.

Know about how to interact with graphics system.

Develop interactive graphics programs using 2D and 3D graphics using OpenGL API.

Represent basic geometric types and convert between various representations.

Apply lighting and shading effects on the graphical models.

UNIT I (12 Hours)

INTRODUCTION: Applications of computer graphics; A graphics system; Images: Physical and synthetic; Imaging systems; The synthetic camera model; The programmer’s interface; Graphics architectures; Programmable pipelines; Performance characteristics. Graphics Programming: The Sierpinski gasket Programming two-dimensional applications.

THE OPENGL: The OpenGL API; Primitives and attributes; Color; Viewing; Control functions; The Gasket program; Polygons and recursion; The three-dimensional gasket; Plotting implicit functions.

UNIT II (12 Hours)

INPUT AND INTERACTION: Interaction; Input devices; Clients and servers; Display lists; Display lists and modeling; Programming event-driven input; Menus; A simple CAD program; Building interactive models; Animating interactive programs; Design of interactive programs; Logic operations.

GEOMETRIC OBJECTS AND TRANSFORMATIONS – 1: Scalars, points, and vectors; Three-dimensional primitives; Coordinate systems and frames; Modeling a colored cube; Affine transformations; Rotation, translation and scaling.

UNIT III (12 Hours)

GEOMETRIC OBJECTS AND TRANSFORMATIONS – 2:Transformations in homogeneous coordinates; Concatenation of transformations; OpenGL transformation matrices; Interfaces to three dimensional applications;

VIEWING: Classical and computer viewing; Viewing with a computer; Positioning of the camera; Simple projections; Projections in OpenGL; Hidden-surface removal; Interactive mesh displays; Parallel-projection matrices; Perspective-projection matrices; Projections and shadows.

UNIT IV (12 Hours)

LIGHTING AND SHADING: Light and matter; Light sources; The Phong lighting model; Computation of vectors; Polygonal shading; Approximation of a sphere by recursive subdivisions; Light sources in OpenGL; Specification of materials in OpenGL; Shading of the sphere model; Global illumination.IMPLEMENTATION: Basic implementation strategies; The major tasks; Clipping; Line-segment clipping; Polygon clipping; Clipping of other primitives; Clipping in three dimensions; Rasterization; Bresenham’s algorithm; Polygon rasterization; Hidden-surface removal; Antialiasing; Display considerations.

TEXT BOOK:

1. Edward Angel, 5th Edition, Addison-Wesley, 2008, Interactive Computer Graphics A Top-Down Approach with OpenGL.

REFERENCE BOOKS:

1. F.S. Hill,Jr. 2nd Edition, Pearson Education, 2001, Computer Graphics Using OpenGL.2. James D Foley, Andries Van Dam, Steven K Feiner, John F Hughes, Addison-wesley 1997, Computer

Graphics.3. OpenGL Version – Donald Hearn and Pauline Baker, 2nd Edition, Pearson Education, 2003, Computer

Graphics.

COMPUTER GRAPHICS LABORATORY


Course Objectives

To write program functions to render 2D and 3D graphics primitives.

To write programs that demonstrate geometrical transformations.

To write program functions to implement visibility detection in 2D and 3D images.

To write programs that demonstrate computer graphics animation along with lighting and

shading effects.

To demonstrate an understanding of the use of object hierarchy in graphics applications.

Course Outcomes

Design graphics program to construct 2D and 3D objects.

Develop the program to create the animation using graphics operations.

Implement the Graphics system for viewing.

Design the program to illustrate polygon fill and shading pattern.

Develop graphics applications using OpenGL programming tool.

Part-A1. Write OpenGL program to implement line drawing algorithm.2. Write OpenGL program to implement circle drawing algorithm.3. Implement OpenGL program to draw bar chart and pie chart.4. Design and implement program on interface device.5. Keyboard to draw the greeting message.6. Mouse device to illustrate interactive drawing.7. Implement interactive animation programs.

Kite flying Rotating wheel Moving car

8. Program to recursively subdivide a triangle to form 2D Sierpinski gasket. The number of recursive steps is to be specified by the user.

9. Program to draw a cube and spin it using OpenGL transformation matrices.10. Program to create a house like figure and rotate it about a given fixed point using OpenGL functions.11. Program to implement the Cohen- Sutherland line-clipping algorithm.12. Program to create a cylinder and a parallelepiped by extruding a circle and quadrilateral

respectively. Allow the user to specify the circle and the quadrilateral

Part- BDevelop a suitable graphics package to implement the skills learnt in the theory and the exercises indicated in Part A. Use the OpenGL.

Lab Assessment:1. Each laboratory subject is evaluated for 100 marks (50 CIE and 50 SEE)2. Allocation of 50 marks for CIE

1. Marks for each experiment = 20 marks/No. Of proposed experiments2. 10 marks for graphics package3. one practical test for 20 marks(25% write up ,50% conduction, calculation, 25% results)

3. Allocation of 50 marks for SEE 30 marks for evaluating program (25% write up ,50% conduction, calculation, 25% results) 20 marks for evaluating graphics package.

COMPUTER NETWORK LABORATORY


Course Objectives: To develop an understanding of modern network architectures from a design and

performance perspective.

Course Outcomes: 1. Create network topology and analyze the performance of the network in terms of

bandwidth, packet drop and throughput. 2. Demonstrate how error detection, correction and how data can be secured. 3. Analyze routing algorithms to find the suitable path for transmission and demonstrate the

control of flow rate. 4. Demonstrate the client-server communication using TCP/IP sockets and also explain how

inter-process communication established using different method.

PART –ASimulation ExercisesIntroduction Part

Introduce students to network simulation through the Network simulation Package, Create a simple network model with multiple scenarios, Collect statistics on network performance through the use of simulator tools, Analyze and draw conclusion on network performance1. Simulate two nodes point-to-point network and study the impact of bit error rate on packet error

rate and investigate the impact of error of a simple hub based CSMA / CD network.2. Simulate four nodes point-to-point network and study how the loss, utilization and transmission of

wireless LAN (IEEE 802.11b) network varies as the distance between access point and wireless nodes.

3. Simulate point-to-point network which consists of 4 to 6 nodes and study network performance analysis of different scheduling technique like First In Out (FIFO), Priority, Round Robin, Weight Fair Queue (WFQ) using NetSim.

4. Simulate and study the throughputs of slow start, Congestion avoidance (also known as Old Tahoe) and First Retransmit (also known as Tahoe), Congestion Control Algorithms during client-server TCP downloads.

5. Create a network topology which consists six nodes, simulate and study the working and routing table formation of Interior Routing Protocol i.e. Routing Information Protocol (RIP) and Open Shortest Path First (OSPF).

6. Simulate seven cells GSM network and study and compare the effect of dynamic channel allocation (DCA) and fixed channel allocation (FCA) using NetSim.

7. Simulate seven cells GSM network and study how call blocking probability varies as the load on a GSM network is continuously increased.

PART – B

Implement the following in C/C++:

1. Write a program for error detecting code using CRC-CCITT (16- bits). 2. Write a program for Hamming code generation for error detection and correction. 3. Write a program for even / odd parity checking on binary data.4. Write a program to perform stuffing and destuffing on given information.5. Write a program for distance vector algorithm to find suitable path for transmission.6. Write a program for congestion control using leaky bucket algorithm7. Using TCP/IP sockets, write a client – server program to make the client send the file name and to

make the server send back the contents of the requested file if present.8. Implement the program 7 using the message queues IPC channels. 9. Implement the program 7 using the FIFO IPC channels: 10. Write a program for simple RSA algorithm to encrypt and decrypt the data.

Note: Student is required to solve one problem from PART-A and one problem from PART-B. The questions are allotted based on lots. Both questions carry equal marks.