DHENKANAL AUTONOMOUS COLLEGE, DHENKANAL

B. Sc. (Computer Science)

CHOICE BASED CREDIT SYSTEM

CLASS/ COURSE TITLE OF PAPER CRE MARK

SEMESTER DIT
Ability Enhancement MIL 4 100
Compulsory Course-I
Core Course-I Programming using C 4 75
Core Course-I Practical Programming using C LAB 2 25
I
Core Course-II Computer Organization 4 75
Core Course-II Practical Computer Organization LAB 2 25
Generic Elective-I (A1) Calculus and Differential 6 100
Equation
1st
Ability Enhancement Environmental Science 4 100
Year
Compulsory Course-II
Core Course-III Programming using C++ 4 75
Core Course-III Practical Programming using C++ LAB 2 25
II Core Course-IV Data Structure 4 75
Core Course-IV Practical Data Structure LAB 2 25
Generic Elective-II (B1) Mechanics (Minor-Physics) 4 75
Generic Elective-II (B1) Mechanics (Minor-Physics)- 25
Practical LAB 2
Core Course-V Operating Systems 4 75
Core Course-V Practical Operating Systems LAB 2 25
Core Course-VI Database Management System 4 75
Database Management System 25
III Core Course-VI Practical LAB 2
Core Course-VII Discrete Structures 4 75
Core Course-VII Practical Discrete Structures LAB 2 25
Skill Enhancement Course-I English Proficiency 4 100
Generic Elective-III (A2) Linear Algebra 6 100
2nd Core Course-VIII JAVA Programming 4 75
Year Core Course-VIII Practical JAVA Programming LAB 2 25
Core Course-IX Computer Network 4 75
Core Course-IX Practical Computer Network LAB 2 25
Core Course-X Computer Graphics 4 75
IV Core Course-X Practical Computer Graphics LAB 2 25
Skill Enhancement Course-II Android Programming 4 100
Electricity & Magnetism and 75
Generic Elective-IV (B2) EMT 4
General Elective-IV (B2) Electricity & Magnetism and 2 25
Practical EMT LAB
 CLASS/ COURSE TITLE OF PAPER CRE MARK
SEMESTER DIT
4 75
Core Course-XI Internet Technology
Core Course-XI Practical Internet Technology LAB 2 25
Core Course-XII Software Engineering 4 75
Core Course-XII Practical Software Engineering LAB 2 25
V
Discipline Specific Elective-I Information Security 4 75
Discipline Specific-I Practical Information Security LAB 2 25
Discipline Specific Elective-II Microprocessor 4 75
Discipline Specific Elective-II 2 25
3rd Practical Microprocessor LAB
Year Core Course-XIII Artificial Intelligence 4 75
Core Course-XIII Practical Artificial Intelligence LAB 2 25
Design & Analysis of 4 75
Core Course-XIV Algorithms
Design & Analysis of 2 25
VI Core Course-XIV Practical Algorithms LAB
Discipline Specific Elective-III Cloud Computing 4 75
Discipline Specific Elective-III Cloud Computing LAB 2 25
Practical
Discipline Specific Elective-IV Project Work (and Seminar) 6 100 (80
+ 20)
Total 148 2600

NOTE: Out of 75 marks (in Core/DSE), 60 marks will be counted from semester
exam and 15 marks from midterm exam.
 SEMESTER-I

C-1: PROGRAMMING USING C

(Credit: 6, Theory: 4, Practical: 2)

PROGRAMMING USING “C”

UNIT- I
Introduction to Programming Language, Introduction to C Programming , Character
Set, C Tokens, Keywords & Identifiers, Constants, Variables, Data Types, Variables,
Storage Classes, Operators (Arithmetic, Relational, Logical , Assignment, Increment &
Decrement, Conditional , Bitwise), Expressions, Input and Output Operations.

UNIT- II
Decision Making and Branching: Simple IF Statement, IF ….. ELSE Statement, Nesting
IF …. ELSE Statement, ELSE IF Ladder, Switch Statement, Operator, GOTO Statement.
Decision Making and Looping: The WHILE Statement, The DO Statement, The FOR
Statement, Jumps in LOOPS. Arrays, Character Arrays and Strings.

UNIT- III
User-defined Functions: Need, Elements & Definition, Function Calls, Function
Definition, Category of Functions, Recursion. Structures and Unions: Defining,
Declaring, Accessing, Initialization Structure, Arrays of Structures, Arrays within
Structures, Structures and Functions, Unions.

UNIT- IV
Pointers: Accessing the Address of a Variable, Declaring Pointer Variables,
Initializations of Pointer Variable, Accessing a Variable through its Pointer, Chain of
Pointers, Pointer Expressions, Pointer Increments and Scale Factor, Pointers and Arrays,,
Pointers and Character Strings, Array of Pointers, Pointers as Function Arguments,
Functions Returning Pointers, Pointers to Functions, Pointers to Structures, Troubles with
Pointers.

UNIT- V
File Management in C: Defining and Opening a File, Closing a File, Input/ Output
Operations on Files, Error Handling during I/O Operations, Random Access to Files,
Command Line Arguments, Dynamic Memory Allocation.

Text Book:
1. E. Balaguruswamy, Programming in ANSI C, 4/e, (TMH).
Reference Books:
1. Paul Deitel, Harvey Deitel, C: How to Program, 8/e, Prentice Hall.
2. J. R. Hanly, Problem Solving & Program Design in C, 7/e, Pearson.
3. B. Kernighan & D.M. Ritche, The C Programming Language, 2/e PHI.
 C1-PRACTICAL: PROGRAMMING USING C LAB

[A] C-PROGRAMMING: [15 Marks]

 Exercise to study various features of C-language.
 Writing well structure modular program using function, array, control structure,
Structure, union, files

[B] RECORD [4 Marks ]

[C] VIVA-VOCE [6 Marks ]

C-2: COMPUTER ORGANIZATION

(Credit: 6, Theory: 4, Practical: 2)

UNIT-I
Character Codes, Decimal System, Binary System, Decimal to Binary Conversion,
Hexadecimal Notation, Boolean Algebra, Basic Logic Functions: Electronic Logic Gates,
Synthesis of Logic Functions, Minimization of Logic Expressions, Minimization using
Karnaugh Maps, Synthesis with NAND and NOR Gates.

UNIT-II
Flip-Flops Gated Latches, Master-Slave Flip-Flops, Edge-Triggering, T Flip-Flops, JK
Flip-Flops. Registers and Shift Registers, Counters, Decoders, Multiplexers,
Programmable Logic Devices (PLDs), Programmable Array Logic (PAL), Complex
Programmable Logic Devices (CPLDs), Field-Programmable Gate Array (FPGA),
Sequential Circuits, Timing Diagrams, The Finite State Machine Model, Synthesis of
Finite State Machines,

UNIT-III
Basic Structure of Computers: Computer Types, Functional Units, Input Unit, Memory
Unit, Arithmetic and Logic Unit, Output Unit, Control Unit, Basic Operational Concepts,
Bus Structures, Software. Machine Instructions and Programs: Numbers, Arithmetic
Operations, and Characters: Number Representation, Addition of Positive Numbers,
Addition and Subtraction of Signed Numbers, Overflow of Integer Arithmetic,
Characters, Memory Locations and Addresses, Byte Addressability, Word Alignment,
Accessing Numbers, Characters, and Character Strings, Memory Operations, Instructions
and Instruction Sequencing, Register Transfer Notation, Basic Instruction Types,
Instruction Execution and Straight-Line Sequencing, Branching, Condition Codes,
Generating Memory Addresses, Addressing Modes, Implementation of Variables and
Constants, Indirection and Pointers, Indexing and Arrays, Relative Addressing.

UNIT-IV
THE ARM EXAMPLE: Registers, Memory Access, and Data Transfer, Register
Structure, Memory Access Instructions and Addressing Modes, Register Move
Instructions, Arithmetic and Logic Instructions: Arithmetic Instructions, Logic
Instructions, Branch Instructions, Setting Condition Codes, Assembly Language, Psedo-
Instructions, I/O Operations, Subroutines, Vector Dot Product Program, Byte-Sorting
Program, Linked-List Insertion and Deletion Subroutines. Basic Input-Output Operations,
Stacks and Queues, Subroutines. PowerPC Example: Basic PowerPC Processor
Organization, Load and Store Instructions, Arithmetic and Logic Instructions, Flow
Control Instructions, Compare Instructions, Logic Instructions, Subroutines.

UNIT-V
Memory System: Semiconductor RAM Memories, Internal Organization of Memory
Chips, Static Memories, Asynchronous DRAMS, Synchronous DRAMS, Structure of
Large Memories, Memory System Considerations, RAMBUS Memory. Read-Only
Memories: ROM, PROM, EPROM, EEPROM, Flash Memory, Speed, Size, and Cost of
Memory. Secondary Storage: Magnetic Hard Disks, Optical Disks, Magnetic Tape
Systems.

Text Book:
1. Carl Hamacher, Z. Vranesic, S. Zaky: Computer Organization, 5/e (TMH).
Reference Books:
1. William Stallings: Computer Organization and Architecture (Design for
erformance), 9/e.
2. S. Brown, & Z. Vranesic, Fundamentals of Digital Logic Design with VHDL, 2/e,
McGraw-Hill
3. J. P. Uyemura, A First Course in Digital System Design, An Integrated
Approach, Cengage Learning.

C2: PRACTICAL: COMPUTER ORGANIZATION LAB

[A] Study the truth table of [15 Marks]

 Logic gates (AND,NAND,OR,NOR,XOR,XNOR,INVERTER,BUFFER etc.)
 Verification of Boolean Expression(sum of products & products of sum)
 De Morgan’s Theorem
 Construction of Half Adder and Full Adder
 Familiarity with the characteristics of different flip-flops(JK,SR,D and T)
 Converter(BCD to Decimal Decoder and Decimal to Binary Encoder)

[B] RECORD [4 Marks ]

[C] VIVA-VOCE [6 Marks ]
 SEMESTER-2

C3: PROGRAMMING USING C++

(Credit: 6, Theory: 4, Practical: 2)

UNIT- I
Principles of Object-Oriented Programming: Object-Oriented Programming (OOP)
Paradigm, Basic Concepts of OOP, Benefits of OOP, Object Oriented Languages,
Applications of OOP. Beginning with C++: Applications of C++, C++ statements,
Example with Class, Structure of C++ Program, Creating the Source File, Compiling and
Linking. Tokens, Expressions and Control Structures: Tokens, Keywords, Identifiers &
Constants, Basic Data Types, User-Defined Data Types, Derived Data Types, Symbolic
Constants, Type Compatibility, Declaration of Variables, Dynamic Initialization of
Variables, Reference Variables, Operators in C++, Scope Resolution Operator, Member
Differencing Operators, Memory Management Operators, Manipulators, Type Cast
Operators, Expressions and their Types, Special Assignment Expressions, Implicit
Conversions, Operator Overloading, Operator Precedence, Control Structures.

UNIT- II
Functions in C++: The Main Function, Function Prototyping, Call By Reference, Return
by Reference, Inline Functions, Default Arguments, Const. Arguments, Function
Overloading, Friend & Virtual Functions, Math. Library Functions. Classes and Objects:
Specifying a Class, Defining Member Functions, Making an outside Function Inline,
Nested Member Functions, Private Member Functions, Arrays within a Class, Memory
Allocation for Objects, Static Data Members, Static Member Functions, Arrays of
Objects, Objects as Function Arguments, Friendly Functions, Returning Objects, Cons.
Member Functions, Pointer to Members, Local Classes.

UNIT- III
Constructors & Destructors: Constructors, Parameterized Constructors, Multiple
Constructors in a Class, Constructors with Default Arguments, Dynamic Initialization of
Objects, Copy Constructor, Dynamic Constructors, Constructing Two-Dimensional
Arrays, Const. Objects, Destructors. Operator Overloading and Type Conversions:
Defining Operator Overloading, Overloading Unary Operators, Overloading Binary
Operators, Overloading Binary Operators using Friends, Manipulation of Strings using
Operators, Rules for Overloading Operators, Type Conversions.

UNIT- IV
Inheritance: Defining Derived Classes, Single Inheritance, Making a Private Member
Inheritance, Multilevel Inheritance, Multiple Inheritance, Hierarchical Inheritance,
Hybrid Inheritance, Virtual Base Classes, Abstract Classes, Constructors in Derived
Classes, Member Classes, Nesting of Classes. Pointers, Virtual Functions and
Polymorphism: Pointers, Pointers to Objects, this Pointer, Pointers to Derived Classes,
Virtual Functions, Pure Virtual Functions.
UNIT- V
Managing Console I/O Operations: C++ Streams, C++ Stream Classes, Unformatted I/O
Operations, Formatted Console I/O Operations, Managing Output with Manipulators.
Files: Classes for File Stream Operations, Opening and Closing a File, Detecting end-of-
file, File Modes, File Pointers and their Manipulations, Sequential Input and Output
Operations, Updating a File: Random Access, Error Handling during File Operations,
Command-line Arguments.

Text Books:
1. E. Balgurusamy, Object Oriented Programming with C++ :, 4/e (TMH).
Reference Books:
1. Paul Deitel, Harvey Deitel, ”C++: How to Program”,9/e. Prentice Hall.
2. J. Farrell, Object-Oriented Programming, Cengage Learning.
3. BjarneStroustroup, ”Programming – Principles and Practice using C++”, 2/e,
Addison-Wesley 2014.

C3-PRACTICAL: PROGRAMMING USING C++ LAB

[A] [15 Marks]

C++ PROGRAMMING.
OOPs and C++ features:
 class & class derivations
 membership function
 constructors
 destructors
 friend class operators and function.

[B] RECORD [4 Marks ]

[C] VIVA-VOCE [6 Marks ]

C4: DATA STRUCTURE

(Credit: 6, Theory: 4, Practical: 2)

UNIT-I
Introduction and Overview: Definitions, Concept of Data Structures, Overview of Data
Structures, Implementation of Data Structures. Arrays: Terminology, One-Dimensional
Array, Multi-Dimensional Arrays, Pointer Arrays.

UNIT-II
Linked Lists: Single Linked List, Circular Linked List, Double Linked List, Circular
Double Linked List, Application of Linked Lists, Memory Representation, Boundary Tag
System, De-allocation Strategy, Buddy System, Compaction.
UNIT-III
Stacks: Definition, Representation of Stack (Array, Linked List), Operations on Stacks,
Applications of Stack (Evaluation of Arithmetic Expressions, Code Generation,
Implementation of Recursion, Factorial Calculation, Quick Sort, Tower of Hanoi,
Activation Record Management).

UNIT – IV
Queues: Definition, Representation of Queues (Array, Linked List), Circular Queue,
Deque, Priority Queue, Application of Queues (Simulation, CPU Scheduling in
Multiprogramming Environment, Round Robin Algorithm).

UNIT –V
Tree: Binary Trees, Properties of Binary Tree, Linear Representation of Binary a Binary
Tree, Linked Representation of a Binary Tree, Physical Implementation of Binary Tree in
Memory, Operations on Binary Tree (Insertion, Deletion, Traversal, Merging of two
Binary Trees), Types of Binary Trees (Expression Tree, Binary Search Tree, Heap Tree,
Threaded Binary Trees, Height Balanced Binary Tree, Weighted Binary Tree, Decision
Trees).

Text Book:
1. D. Samanta, Classic Data Structures:, 2/e (PHI).
Reference Books:
1. D.S Malik, Data Structure using C++, 2/e, Cengage Learning, 2010.
2. Adam Drozdek, ”Data Structures and algorithm in C++”, 3/e, Cengage Learning,
2012.
3. Robert L. Kruse,”Data Structures and Program Design in C++”, Pearson.

C4-PRACTICAL: DATA STRUCTURE LAB

[A] Case studies of use various data structure [15 Marks]

 Stack
 Queue
 Linked List using Array and pointer
 Different sorting technique
 Different searching technique
 String manipulation
 List

[B] RECORD [4 Marks ]

[C] VIVA-VOCE [6 Marks ]
 SEMESTER-III

C5: OPERATING SYSTEMS

(Credit: 6, Theory: 4, Practical: 2)

UNIT- I
Operating System, Computer-System Organization, Computer-System Architecture,
Operating-System Structure, Operating-System Operations, Process Management,
Memory Management, Storage Management, Protection and Security, Distributed
Systems, Special Purpose Systems, Computing Environments, Open-Source Operating
Systems. Operating System Services, User Operating System Interface, System Calls,
Types of System Calls, System Programs, Operating-System Design and Implementation,
Operating System Structure, Virtual Machines, Operating System Debugging, Operating
System Generations. System Boot.

UNIT- II
Process: Process Concept, Process Scheduling, Operations on Processes, Inter-Process
Communication, Examples of IPC Systems, Communication in Client-Server Systems.
Multithreaded Programming: Multithreading Models, Thread Libraries, Threading
Issues, Operating-System Examples.

UNIT- III
Process Scheduling: Basic Concepts, Scheduling Criteria, Scheduling Algorithms, Thread
Scheduling. Multiple-Process Scheduling. Synchronization: The Critical Section
Problem, Peterson’s Solution, Synchronization Hardware, Semaphores, Classical
Problems of Synchronization, Monitors, Synchronization Examples, Atomic
Transactions.

UNIT- IV
Deadlocks: System Model, Deadlock Characterization, Methods of Handling Deadlocks,
Deadlock Prevention, Deadlock avoidance, Deadlock Detection, Recovery from
Deadlock. Memory Management Strategies: Swapping, Contiguous Memory Allocation,
Paging, Structure of the Page Table, Segmentation, Example: The Intel Pentium.

UNIT- V
Virtual-Memory Management: Demand Paging, Copy-on-Write, Page Replacement,
Allocation of Frames, Thrashing, Memory-Mapped Files, Allocating Kernel Memory.
File System: File Concept, Access Methods, Directory and Disk Structure, File-System
Mounting, File Sharing, Protection.

Text Book:
1. Operating System Concepts: Silberschatz, Galvin, Gagne, 8/e (Wiley-India)
Reference Books:
1. A.S. Tanenbaum, Modern Operating Systems, 3/e, Pearson Education 2007.
2. W. Stallings, Operating Systems, Internals & Design Principles, 5/e, Prentice
 Hall of India 2008
C5-PRACTICAL: OPERATING SYSTEMS LAB

[A] LINUX OPERATING SYSTEM: [15 Marks]

 Familiarity of LINUX file system and LINUX commands.
 File, Directory and Communication commands.
 Use of VI editor and Simple Shell programming.

[B] RECORD [4 Marks ]

[C] VIVA-VOCE [6 Marks ]

C6: DATABASE MANAGEMENT SYSTEM

(Credit: 6, Theory: 4, Practical: 2)

UNIT-I
Databases and Database Users, Database System Concepts and Architecture, Data
Modelling using the Entity-Relationship(ER) Model, The Enhanced Entity-Relationship
(EER) Model.

UNIT-II
Relational Model: The Relational Data Model and Relational Database Constraints, The
Relational Algebra and Relational Calculus.

UNIT-III
Relational Database Design by ER- and EER-to-Relational Mapping, SQL-99: Schema
Definition, Constraints, Queries, and Views, Introduction to SQL Programming
Techniques.

UNIT-IV
Functional Dependencies and Normalization for Relational Databases, Relational
Database Algorithms and Further Dependencies, Practical Database Design Methodology
and use of UML Diagrams.

UNIT-V
Disk Storage, Basic File Structures, and Hashing, Indexing Structures for Files,
Algorithms for Query Processing and Optimization, Physical Database Design and
Tuning.

Text Book:
1. R. Elmasri, S.B. Navathe, Fundamentals of Database Systems, 6/e, Pearson
Education, 2010.
Reference Books:
1. A. Silberschatz, H.F. Korth, S. Sudarshan, Database System Concepts 6/e,
McGraw Hill, 2010.
 2. R. Ramakrishanan, J. Gehrke, Database Management Systems, McGraw-Hill.

C6-PRACTICAL: DBMS LAB

[A] ORACLE: [15 Marks]

 Creating, Deleting, Altering tables.
 Insert, Delete, Modify records.
 SQL commands, Query.
 PL/SQL

[B] RECORD [4 Marks ]

[C] VIVA-VOCE [6 Marks ]

C7: DISCRETE STRUCTURES

(Credit: 6, Theory: 4, Practical: 2)

UNIT-I
Logic and Proofs: Propositional Logic, Propositional Equivalences, Predicates and
Quantifiers, Nested Quantifiers, Rules of Inference, Introduction to Proofs, Normal
Forms, Proof Methods and Strategy, Mathematical Induction, Strong Induction and Well-
Ordering, Recursive Definitions and Structural Induction, Recursive Algorithms.

UNIT-II
Basic Structures: Sets, Set Operations, Functions, Recursive Functions, Sequences and
Summations. Relations: Relations and their Properties, n-ary Relations and their
Applications, Representing Relations, Closures of Relations, Equivalence Relations,
Partial Ordering. Boolean

UNIT-III
Algebra: Boolean Functions, Representing Boolean Functions, Logic Gates,
Minimization of Circuits. Algebraic Structures & Coding Theory: The Structure of
Algebras, Semi-groups, Monoids and Groups, Homomorphism, Normal Subgroups, and
Congruence Relations, Rings, Integral Domains and Fields, Quotient and Product
Algebras, Coding Theory. Polynomial Rings and Polynomial Codes.

UNIT-IV
Counting: Basics of Counting, The Pigeonhole Principle, Permutations and
Combinations, Binomial Coefficients, Generalized Permutations and Combinations,
Generating Permutations and Combinations. Advanced Counting Techniques,
Applications of Inclusion-Exclusion, Discrete probability, Conditional probability,
Bayes’ Theorem.
UNIT-V Graphs:
Graphs and Graph Models, Graph Terminology and Special Types of Graphs, Havel-
Hakimi Theorem, Representing Graphs and Graph Isomorphism, Connectivity, Cut-Sets,
Euler and Hamiltonian Paths, Shortest-Path Problem, Planar Graphs, Graph Coloring,
Network Flows.

Text Book:
1. Kenneth H Rosen, Discrete Mathematics & Its Applications, McGraw-Hill. 7/e
Reference Books:
1. J. L. Hein, Discrete Structures, Logic, and Computability, 3rd Edition,
Jones and Bartlett publishers 2009.
2. C.L. Liu , D.P. Mahopatra, Elements of Discrete mathematics, 2nd Edition , Tata
McGraw Hill,1985
3. M. O. Albertson and J. P. Hutchinson, Discrete Mathematics with Algorithms
, John wiley Publication, 1988.

C7-PRACTICAL: DISCRETE STRUCTURES LAB

[A] GRAPH: [15 Marks]

 Depth First Search
 Breadth First Search
 Spanning Tree using Kruskal’s Algorithm
 Dijkstra’s shortest path algorithm

[B] RECORD [4 Marks ]

[C] VIVA-VOCE [6 Marks ]

SEMESTER-IV

C8: JAVA PROGRAMMING

(Credit: 6, Theory: 4, Practical: 2)

UNIT-I
Introduction to Java: Java Architecture and Features, Understanding the semantic and
syntax differences between C++ and Java, Compiling and Executing a Java Program,
Variables, Constants, Keywords Data Types, Operators (Arithmetic, Logical and Bitwise)
and Expressions, Comments, Doing Basic Program Output, Decision Making Constructs
(conditional statements and loops) and Nesting, Java Methods (Defining, Scope, Passing
and Returning Arguments, Type Conversion and Type and Checking, Built-in Java Class
Methods),
UNIT-II
Arrays, Strings and I/O: Creating & Using Arrays (One Dimension and Multi-
dimensional), Referencing Arrays Dynamically, Java Strings: The Java String class,
Creating & Using String Objects, Manipulating Strings, String Immutability & Equality,
Passing Strings To & From Methods, String Buffer Classes.
Simple I/O using System. Out and the Scanner class, Byte and Character streams,
Reading/Writing from console and files. Object-Oriented Programming Overview:
Principles of Object-Oriented Programming, Defining & Using Classes, Controlling
Access to Class Members, Class Constructors, Method Overloading, Class Variables &
Methods, Objects as parameters, final classes, Object class, Garbage Collection.

UNIT-III
Inheritance, Interfaces, Packages, Enumerations, Auto boxing and Metadata: Inheritance:
(Single Level and Multilevel, Method Overriding, Dynamic Method Dispatch, Abstract
Classes), Interfaces and Packages, Extending interfaces and packages, Package and Class
Visibility, Using Standard Java Packages (util, lang, io, net), Wrapper Classes,
Autoboxing/Unboxing, Enumerations and Metadata.

UNIT-IV
Exception Handling, Threading, Networking and Database Connectivity: Exception
types, uncaught exceptions, throw, built-in exceptions, Creating your own exceptions;
Multi-threading: The Thread class and Runnable interface, creating single and multiple
threads, Thread prioritization, synchronization and communication, suspending/resuming
threads. Using java.net package, Overview of TCP/IP and Datagram programming.
Accessing and manipulating databases using JDBC.

UNIT-V
Applets and Event Handling: Java Applets: Introduction to Applets, Writing Java
Applets, Working with Graphics, Incorporating Images & Sounds. Event Handling
Mechanisms, Listener Interfaces, Adapter and Inner Classes. The design and
Implementation of GUIs using the AWT controls, Swing components of Java Foundation
Classes such as labels, buttons, text fields, layout managers, menus, events and listeners;
Graphic objects for drawing figures such as lines, rectangles, ovals, using different fonts.
Overview of servlets.

Text BooK:
1. Programming with Java: A Primer, 5Th Edition by E.Balagurusamy.
Reference Books:
1. Java: The Complete Reference 9th edition by Herbert Schildt
2. Paul Deitel, Harvey Deitel, "Java: How to Program", 10th Edition, Prentice Hall,
2011.

C8-PRACTICAL: JAVA PROGRAMMING LAB

[A] Java Programming [15 Marks]

 Installation and setting of PATH and CLASSPATH for JDK.
 Simple programming on java using class, abstract class.
  Programming on Operators (Arithmetic, logical, relational, bitwise, shift etc)
 Programming using loop, array, strings and methods.
 Inheritance (single, multilevel)
 Polymorphism (overloading, overriding)
 Programming using interface, exception-handling & package.
 Programming using AWT & Events components.(Introduction to Applet)

[B] RECORD [4 Marks ]

[C] VIVA-VOCE [6 Marks ]

C9: COMPUTER NETWORK

(Credit: 6, Theory: 4, Practical: 2)

UNIT-I
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.

UNIT-II
Data and Signals: Analog and Digital, Periodic Analog Signals, Digital Signals,
Transmission Impairment, Data Rate Limits, Performance. Digital Transmission: Digital-
To-Digital Conversion, Analog-To-Digital Conversion, Transmission Modes. Analog
Transmission: Digital-To-Analog Conversion, Analog-To-Analog Conversion.

UNIT-III
Multiplexing and Spreading: Multiplexing, Spread Spectrum. Transmission Media:
Guided Media, Unguided Media (Wireless). Switching: Circuit Switched, Datagrams,
Virtual Circuit Networks, Structure of a Switch. Telephone Network, Dial-Up
MODEMS, Digital Subscriber Line (DSL), Cable TV Networks, Cable TV for Data
Transfer.

UNIT-IV
Error Detection and Correction: Introduction, 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 Access:
Random Access, Controlled Access, Channelization. Wired LANs: IEEE Standards,
Standard Ethernet, Changes in the Standard, Fast Ethernet, Gigabit Ethernet: Wireless
LANs: IEEE 802.11, Bluetooth.

UNIT-V
Connecting LANs: Connecting Devices, Backbone Networks, Virtual LANs. Wireless
LANs: Cellular Telephony, Satellite Networks. SONET: Architecture, SONET Layers,
SONET Frames, STS Multiplexing, SONET Networks, Virtual Tributaries. Virtual-
Circuit Networks. Frame Relay, ATM, ATM LANs,
Text Book:
Data Communications and Networking, 4/e, Forouzan, B. (TMH)
Reference Books:
A. S. Tanenbaum, & David J. Wetherall, Computer Networks, 5/e, Pearson

C9-PRACTICAL: COMPUTER NETWORK LAB.

[A] Computer Network [15 Marks]

 Installation of LAN
 Pre- installation
 Cable Installation, type of cable, connectors, crimping with RJ45 connector etc.)
 Network Equipment (Hub, Switch etc) Installation
 Post-installation
 Networking Commands.
 Installation & Administration of Window NT/2000 server
 Server & workstation installation
 Network Printer management

[B] RECORD [4 Marks ]

[C] VIVA-VOCE [6 Marks ]

C10: COMPUTER GRAPHICS

(Credit: 6, Theory: 4, Practical: 2)

UNIT-I
Computer Graphics: A Survey of Computer graphics, Overview of Graphics System:
Video Display Devices, Raster-Scan Systems, Input Devices, Hard-Copy Devices,
Graphics Software, Introduction to OpenGL. Graphics Output Primitives: Point and
Lines, Algorithms for line, circle & ellipse generation, Filled-Area Primitives. Attributes
of Graphics Primitives: Point, line, curve attributes, fill area attributes, fill methods for
areas with irregular boundaries, Antialiasing.

UNIT-II
Geometric Transformations (both 2-D & 3-D): Basic Geometric Transformations, Matrix
Representation and Homogeneous Coordinates, Composite Transformations, Inverse
Transformations, Other Transformations (Reflection, shear), Transformation between
coordinate systems, Affine Transformations. Two Dimensional Viewing: Viewing
pipeline, Clipping Window, Normalization & Viewport coordinate Transformations,
Clipping Algorithms: Point clipping, Line clipping and Polygon clipping. Three
Dimensional Viewing: 3-dimensional Viewing Concepts, Viewing pipeline, Projection
Transformations (Orthogonal, Oblique parallel, Perspective), Clipping Algorithms.
UNIT-III
Three Dimensional Object Representations: Curved Surfaces, Quadratic Surfaces, Spline
Representations, Bezier Spline Curves and Surfaces, B-Spline Curves and Surfaces,
Octrees, BSP Trees, Fractal Geometry Methods, Gamma correction.

UNIT-IV
Visible Surface Detection Methods: Classification of Visible-Surface Detection
Algorithms, Back-Face Detection, Depth-Buffer method, A-Buffer Method, Scan line
and Depth Sorting, Area subdivision Method, Ray Casting Method.

UNIT-V
Illumination Models: Basic Illumination Models, Displaying light Intensities, Halftone
Patterns and Dithering techniques, Polygon-Rendering Methods (Gouroud Shading,
Phong Shading), Ray-Tracing Methods (Basic Ray-Tracing Algorithm, Ray-Surface
Intersection Calculations). Computer Animation, Hierarchical Modeling (introductory
idea only).

Text Book :
Donald Hearn & M. Pauline Baker, “Computer Graphics with OpenGL”, Pearson
Education, Inc. New Delhi.

Reference Books:
1. A.V. Dan, F.H. Jones, J.D. Foley, S.K. Feiner, Computer Graphics Principles &
Practices in C, 2/e, Pearson.
2. D. F. Rogers, Procedural Elements for Computer Graphics, McGraw Hill.
3. D. F. Rogers, & J. A. Adams, Mathematical Elements for Computer Graphics,
2/e, McGrawHill.

C10-PRACTICAL: COMPUTER GRAPHICS LAB

[A] Write simple program for [15 Marks]
 Drawing a line using DDA Algorithm
 Drawing a line, circle , ellipse etc. using Mid-point Algorithm
 Making a coin rotate on its own axis
 Ball hitting the corners of the window
 Designing Flying Balloons
 Implementation of Rotation, scaling and Translation
 Line clipping

[B] RECORD [4 Marks ]

[C] VIVA-VOCE [6 Marks ]
 SEC-2: ANDROID PROGRAMMING
(Credit: 04)

UNIT-I
Introduction: History of Android, Introduction to Android Operating Systems, Android
Development Tools, Android Architecture. Overview of object oriented programming
using Java: OOPs Concepts: Inheritance, Polymorphism, Interfaces, Abstract class,
Threads, Overloading and Overriding, Java Virtual Machine.

UNIT-II
Development Tools: Installing and using Eclipse with ADT plug-in, Installing Virtual
machine for Android sandwich/Jelly bean (Emulator), configuring the installed tools,
creating a android project , – Hello Word, run on emulator, Deploy it on USB-connected
Android device.

UNIT-III
User Interface Architecture: Application context, intents, Activity life cycle, multiple
screen sizes.

UNIT-IV
User Interface Design: Form widgets, Text Fields, Layouts, Button control, toggle
buttons, Spinners (Combo boxes), Images, Menu, Dialog.

UNIT-V
Database: Understanding of SQLite database, connecting with the database.

Text Book:
Android application Development for Java Programmers: James C. Sheusi.
Cengage Learning, 2013.

Reference Books:
M. Burton, & D. Felker, Android Application Development for Dummies, 2/e,
Wiley India.
 SEMESTER-V

C11: INTERNET TECHNOLOGY

(Credit: 6, Theory: 4, Practical: 2)

Unit-I:
Java: Class, Object, different ways of creating objects, Use of objects, Array: Creating
and using Arrays (one dimensional and multidimensional), referencing Arrays.
Limits of Arrays, Introduction to ArrayList class of Collection framework. Creation and
usage of ArrayList class. Advantages of ArrayList class over Arrays.

Unit-II:
JavaScript: Introduction to JavaScript, applications of JavaScript. Programming using
JavaScript: Keywords, Data types: primitive data types (number, string, boolean,
undefined) and Complex data types, Literals (constants), variables, statements,
comments, JavaScript output possibilities, Pop up boxes (alert, confirm and prompt).
Operators (Arithmetic, Assignment, Comparison, Logical, Bitwise, Conditional, Type
operator, Special operators).
Control statements (Conditional statement, switch statement, loop statement (for, for in,
while, do while). Function: Introduction to function, creation and use of function, Events
and event handling.

Unit-III:
JDBC: JDBC fundamentals: Components of JDBC, JDBC Architecture, Types of JDBC
Drivers, Connectivity and working with Connection Interface: Communicating with
databases by using JDBC APIs, Understanding and using Connection Interface.
Working with JDBC Statements: Understanding and using Statement Interface and basic
methods. Working with PreparedStatement: Advantage and disadvantage of
PreparedStatement, using PreparedStatement. Working with CallableStatement: Stored
Procedure, IN, OUT, INOUT parameter, using CallableStatement. Working with
ResultSet object: Resultset methods, reading column values, retrieving rows in a table,
Handling NULL values.

Unit-IV:
JSP: Introduction to Java Server Pages, HTTP and Servlet Basics, The Problem with
Servlets, The Anatomy of a JSP Page, JSP Processing, JSP Application Design with
MVC, Setting Up the JSP Environment, Implicit JSP Objects, Conditional Processing,
Displaying Values, Using an expression to Set an Attribute, Declaring Variables and
Methods, Error Handling and Debugging, Sharing Data Between JSP Pages, Requests,
and Users, Database Access.

Unit-V:
Java Beans: Java Beans Fundamentals, Introspection, Design pattern for Properties,
Events, Methods. BeanInfo Interface, Bound and Constrained property, Persistence,
Customizers, Introspector class, JAR Files. Developing a simple Bean, Connecting to
DB.
Text Book:
1. Ivan Bayross, Web Enabled Commercial Application Development Using Html,
DHTML, JavaScript, Perl CGI , BPB Publications, 2009.

Reference Books:
1. Cay Horstmann, BIG Java, Wiley Publication , 3rd Edition., 2009
2. Herbert Schildt , Java 7, The Complete Reference, , 8th Edition, 2009.
3. Jim Keogh ,The Complete Reference J2EE, TMH, , 2002.
4. O'Reilly , Java Server Pages, Hans Bergsten, Third Edition, 2003.

C11- PRACTICAL: INTERNET TECHNOLOGY LAB

[A] [15 Marks]

HTML and Java Script Programming

 Basic HTML commands.
 Exercise to study various features of Java script, write well structure modular
program using functions, control structure, events and event handling.
JDBC Programming
 Connect to a DB
 Program to Create table, Insert into table, Update table, Retrieve from table.
 Statement, PreparedStatement, CallableStatement.
Servlets, JSP and Java Bean Programming.
 Sample Servlet programming
 Sample JSP programming.
 Sample Java Bean.
[B] RECORD [4 Marks ]
[C] VIVA-VOCE [6 Marks ]

C12: SOFTWRE ENGINEERING

(Credit: 06, Theory: 04, Practical: 02)

UNIT-I
Professional Software Development, Software Engineering Ethics, Software Processes,
Software Process Models, Process Activities, Coping with Change, The Rational Unified
Process, Agile Software Development, Agile Methods, Plan-Driven and Agile
Development, Extreme Programming, Agile Project Management, Scaling Agile
Methods.

UNIT-II
Requirements Engineering, Functional and Non-Functional Requirements, The Software
Requirements Document, Requirements Specification, Requirements Engineering
Processes, Requirements Elicitation and Analysis, Requirements Validation,
Requirements Management, System Modelling, Context Models, Interaction Models,
Structural Models, Behavioural Models, Model-Driven, Engineering

UNIT-III
Architectural Design, Architectural Design Decisions, Architectural Views, Architectural
Patterns, Application Architectures.
Design and Implementation: Object-Oriented Design using the UML, Design Patterns,
Implementation Issues, Open Source Development, Software Testing: Development
Testing, Test-Driven Development, Release Testing, User Testing.

UNIT-IV
Software Evolution: Evolution Processes, Program Evolution Dynamics, Software
Maintenance, Legacy System Management, Dependability and Security.
Socio-technical Systems: Complex Systems, Systems Engineering, System Procurement,
System Development, System Operation.

UNIT-V
Dependability and Security: Dependability Properties, Availability and Reliability,
Safety, Security. Dependability and Security Specification: Risk-Driven Requirements,
Specification, Safety Specification, Reliability Specification, Security, Specification,
Formal Specification.

Text Book:
Software Engineering, Ian Sommerville, 9/e (Pearson Education)
Reference Books:
1. R. Mall, Fundamentals of Software Engineering, 3/e, PHI.
2. R.S. Pressman, Software Engineering, A Practitioners Approach, 7/e, McGraw-
Hill, 2009.
3. K.K. Aggarwal and Y. Singh, Software Engineering,2/e, New Age International
Publishers, 2008.

C12-PRACTICAL: SOFTWARE ENGINEERING LAB

[A] [15 Marks]

 Case study of any of water fall model, spiral model, Incremental model.
 Preparation of report on Requirement analysis and SRS taking a study on any
given software.
 Preparation of structural Design document of any given software.
 Prepare the DFD of Library Information System/Academic Management System/
Payroll system of your College.
 Preparation of OOD (Object Oriented Design) document of any given software.
 Case study of any three Black Box testing techniques.
 Case study of any three White Box testing techniques.
 Preparation of web based software Design document of any given software.
[B] RECORD [4 Marks ]
[C] VIVA-VOCE [6 Marks ]

DSE1: INFORMATION SECURITY

(Credit: 06, Theory: 04, Practical:02)

UNIT-I
Introduction: Security, Attacks, Computer Criminals, Security Services, Security
Mechanisms. Cryptography: Substitution ciphers, Transpositions Cipher, Confusion,
diffusion, Symmetric, Asymmetric Encryption. DES Modes of DES, Uses of Encryption,
Hash function, key exchange, Digital Signatures, Digital Certificates.

UNIT-II
Program Security: Secure programs, Non malicious Program errors, Malicious codes
virus, Trap doors, Salami attacks, Covert channels, Control against program

UNIT-III
Threats: Protection in OS: Memory and Address Protection, Access control, File
Protection, User Authentication. Database Security: Requirements, Reliability, Integrity,
Sensitive data, Inference, Multilevel Security.

UNIT-IV
Security in Networks: Threats in Networks, Security Controls, firewalls, Intrusion
detection systems, Secure e-mails

UNIT-V
Administrating Security: Security Planning, Risk Analysis, Organisational Security
Policy, Physical Security. Ethical issues in Security: Protecting Programs and data.
Information and law.

Text Book:
1. C. P. Pfleeger, S. L. Pfleeger; Security in Computing, PHI, 2006
2. W. Stallings; Network Security Essentials: Applications and Standards, 4/E, 2010

DSE1- PRACTICAL: INFORMATION SECURITY LAB

[A] Write simple program for [15 Marks]
 simple encryption algorithms like Caesar Cipher, Hill Cipher, Transposition
Cipher
 WAP to encrypt & decrypt a password file.
 WAP using any Cipher algorithm to encrypt & decrypt a text file.

[B] RECORD [4 Marks ]

[C] VIVA-VOCE [6 Marks ]
 DSE2: MICROPROCESSOR
(Credit: 06, Theory: 04, Practical:02)

UNIT-I
An Introduction to Processor Design: Processor architecture and organization ,
Abstraction in hardware design, MU0 - a simple processor, Instruction set design
,Processor design trade-offs ,The Reduced Instruction Set Computer, Design for low
power consumption .The ARM Architecture: The Acorn RISC Machine ,Architectural
inheritance, The ARM programmer's model, ARM development tools.

UNIT-II
ARM Assembly Language Programming: Data processing instructions, Data transfer
instructions, Control flow instructions, Writing simple assembly language programs.
ARM Organization and Implementation: Pipeline, Types, 3-stage pipeline ARM
organization , 5-stage pipeline ARM organization, ARM instruction execution, ARM
implementation, The ARM coprocessor interface.

UNIT-III
The ARM Instruction Set: Introduction, Exceptions, Conditional execution , Branch and
Branch with Link (B, BL),Branch, Branch with Link and exchange (BX, BLX) , Software
Interrupt (SWI) ,Data processing instructions, Multiply instructions, Single word and
unsigned byte data transfer instructions , Half-word and signed byte data transfer
instructions, Multiple register transfer instructions , Status register to general register
transfer instructions ,General register to status register transfer instructions , Coprocessor
instructions. Coprocessor data operations, Coprocessor data transfers, Coprocessor
register transfers, Breakpoint instruction (BRK - architecture v5T only), Unused
instruction space, Memory faults, ARM architecture variants.

UNIT-IV
Architectural Support for High-Level Languages: Abstraction in software design, Data
types, Floating-point data types, The ARM floating-point architecture, Expressions,
Conditional statements, Loops , Functions and procedures , Use of memory, Run-time
environment , Examples and exercises.

UNIT-V
Thumb Instruction Set: The Thumb bit in the CPSR, The Thumb programmer's model
,Thumb branch instructions, Thumb software interrupt instruction , Thumb data
processing instructions , Thumb single register data transfer instructions, Thumb multiple
register data transfer instructions, Thumb breakpoint instruction, Thumb
implementation ,Thumb applications .
Architectural Support for System Development: The ARM memory interface, The
Advanced Microcontroller Bus Architecture (AMBA), The ARM reference peripheral
specification, Hardware system prototyping tools, The ARMulator.

Text Book:
Steve Furber :”ARM System-On-Chip Architecture”.
 DSE2- PRACTICAL: MICROPROCESSOR LAB
[A] Write an assembly language program for ARM [15 Marks]
 To add 23 with 47 & store result in r7.
 To evaluate the expression r3=2*45-3*37+4*50
 To evaluate any arithmetic expression
 To implement repetitive statements(for, while, do-while)
 To produce cross development code.
 To implement memory interfacing

[B] RECORD [4 Marks ]

[C] VIVA-VOCE [6 Marks ]

SEMESTER-VI

C13: ARTIFICIAL INTELLIGENCE

(Credit: 06, Theory: 04, Practical: 02)

UNIT-I
Intelligent Agents, Solving problems by searching, Uninformed search strategies(BFS,
DFS, DLS, IDS, BD and Uniform cost search), Informed search and exploration (Greedy
Best first, A* and its variations) Constraint satisfaction Problems, Adversarial
search(Alpha-beta pruning)

UNIT-II
Knowledge and reasoning, logical agent (Wumpus world), Propositional logic, First order
logic, Inference in first order logic (Forward chaining, backward chaining, Resolution),
Knowledge representation.

UNIT-III
Planning, Partial-Order planning, Planning Graphs, Planning and acting in the real world,
Uncertain knowledge and reasoning.

UNIT-IV
Learning from Observations, Decision trees, Neural network (Multilayer), Reinforcement
Learning.

UNIT-V
NLP, Communication, A formal grammar for a fragment of English, Syntactic analysis
(chat parsing), semantic Interpretation, Ambiguity of grammar, Machine Translation.

Text Book:
Stuart Russell and Peter Norvig, “ARTIFICIAL INTELLIGENCE A MODERN
APPROACH” 2/e
Reference Books:
1. D.W. Patterson, Introduction to A.I and Expert Systems, PHI, 2007.
2. Rich & Knight, Artificial Intelligence, 2/e, Tata McGraw Hill, 1991.

C13-PRACTICAL: ARTIFICIAL INTELLIGENCE LAB

[A] Programming on LISP [15 Marks]

 Installation of Prolog 7.3.2
 Programming on fact and on sequence
 Introduction to LISP
 Programming using datatypes, operators, loop, array, backtracking, piggybacking.

[B] RECORD [4 Marks ]

[C] VIVA-VOCE [6 Marks ]

C14: DESIGN AND ANALYSIS OF ALGORITHMS

(Credit: 06, Theory: 04, Practical: 02)

UNIT-I
Analysis and Design of Algorithm (Case study insertion sort and merge sort)Asymptotic
Analysis, Divide and Conquer, Recurrence Relations, Strassen’s Matrix Multiplication.

UNIT-II
Sorting: Quick sort, heap sort, Counting sort, lower bound for sorting, Randomized
quicksort, Order Statistics.

UNIT-III
Amortized Analysis (Aggregate analysis, Accounting analysis, Potential analysis), 2-3-4
tree Advanced Data structure: Fibonacci heap, Red Black tree, hashing, data structure on
disjoint set, Succinct Data Structure.

UNIT-IV
Dynamic Programming: Matrix Chain multiplication, LCS, TSP, Branch and Bound.
Greedy Algorithm: MST: Kruskal’s, Prim’s, Dijkstra Algorithm, Huffman Coding,
Maxflow matching, Computational geometry: Convex Hall, 0-1-knaplock, fractional
knapsack, Back tracking (4-Queen Prob.)

UNIT-V
Complexity Class: P. PSPACE, NP, NP-Hard, NP Complete, Satisfiability, Clique,
Vertex Cover, Independent set, Exact cover, Graph Coloring, Hamiltonian, Cycle
Matching. Approximation Algorithm: Vertex Cove, TSP, Independent Set, Sum of subset
Text Book:
Introduction to Algorithm: Corman Leisenm, Rives & Stein
Reference Books:
1. Sarabasse & A.V. Gelder Computer Algorithm, Introduction to Design and
Analysis, Pearson 3/e, 1999.
2. E. Horowitz, S. Sahni, & S. Rajasekaran, Fundamentals of Computer Algorithms,
2/e, University Press.
3. A.V. Aho, J.E. Hopcroft, & J.D. Ullman, The Design and Analysis of Computer
Algorithm, Pearson.

C14-PRACTICAL: DESIGN & ANALYSIS OF ALGORITHMS LAB

[A] Programming using advance algorithms. [15 Marks]

 Algorithm design using divide and conquer
 Algorithm design using dynamic programming.
 Algorithm design using backtracking.
 Algorithm design for NP-complete.
[B] RECORD [4 Marks ]
[C] VIVA-VOCE [6 Marks ]

DSE3: CLOUD COMPUTING

(Credit: 06, Theory: 04, Practical: 02)

UNIT-I
Overview of Computing Paradigm: Recent trends in Computing: Grid Computing,
Cluster Computing, Distributed Computing, Utility Computing, Cloud Computing.
Introduction to Cloud Computing: Introduction to Cloud Computing, History of Cloud
Computing, Cloud service providers, Benefits and limitations of Cloud Computing.

UNIT-II
Cloud Computing Architecture: Comparison with traditional computing architecture
(client/server), Services provided at various levels, Service Models- Infrastructure as a
Service (IaaS), Platform as a Service (PaaS), Software as a Service(SaaS), How Cloud
Computing Works, Deployment , Models- Public cloud, Private cloud, Hybrid cloud,
Community cloud, Case study of NIST architecture.

UNIT-III
Case Studies: Case Study of Service, Model using Google App Engine, Microsoft Azure,
Amazon EC2, Eucalyptus.
UNIT-IV
Service Management in Cloud Computing, Service Level Agreements (SLAs), Billing &
Accounting, Comparing Scaling Hardware: Traditional vs. Cloud, Economics of Scaling.

UNIT-V
Cloud Security: Infrastructure Security- Network level security, Host level security,
Application level security, Data security and Storage- Data privacy and security Issues,
Jurisdictional issues raised by Data location, Authentication in Cloud Computing.

Text Books
1. Cloud Computing Bible, Barrie Sosinsky, Wiley-India, 2010
2. Cloud Computing: Principles and Paradigms, Editors: Rajkumar Buyya, James
Broberg, Andrzej M. Goscinski, Wile, 2011
3. Cloud Computing: Principles, Systems and Applications, Editors: Nikos

DSE3- PRACTICAL: CLOUD COMPUTING LAB

[A] Cloud OS installation and operation. [15 Marks]
 Installation of Cloud Operating System.
 Creation of resources, deletion of resources on the cloud OS.
Write simple program for
 Resource Allocation
 Resource Management
 Load sharing
 Load Balancing

[B] RECORD [4 Marks ]

[C] VIVA-VOCE [6 Marks ]

DSE4: PROJECT WORK

(Credit: 06)
Project (80) and Seminar (20)