Third Year CORE COURSE V Semester V

FUNDAMENTALS OF ALGORITHMS
Code (Theory) Credit: 5

COURSE OBJECTIVES:

 To study the fundamentals of algorithms

 To understand trees, traversals and about shortest path.
 To know about the different algorithms related to sorting, optimality and
backtracking

UNIT - I:

Introduction – Algorithm Specification, Pseudo code for expressing algorithms,

Performance Analysis-Space complexity, Time complexity, Asymptotic Notation- Big oh
notation, Omega notation, Theta notation and Little oh notation, Performance
Measurement, Randomized algorithms.

UNIT - II:

Trees – Binary tree representations – Tree Traversal – Threaded Binary Trees – Binary
Tree Representation of Trees – Graphs and Representations – Traversals, Connected
Components and Spanning Trees – Shortest Paths and Transitive closure – Activity
Networks – Topological Sort and Critical Paths.

UNIT - III:

Algorithms – Priority Queues - Heaps – Heap Sort – Merge Sort – Quick Sort – Binary
Search – Finding the Maximum and Minimum.

UNIT - IV:

Greedy Method: The General Method – Optimal Storage on Tapes – Knapsack Problem –
Job Sequencing with Deadlines – Optimal Merge Patterns.

UNIT - V:

Back tracking: The General Method – The 8-Queens Problem – Sum of Subsets – Graph
Coloring.

UNIT VI: CURRENT CONTOURS (for Continuous Internal Assessment Only):

Contemporary Developments Related to the Course during the Semester Concerned

REFERENCES:

1. Ellis Horowiz, SartajSahni, "Fundamentals of Data Structure",Galgotia Publications,

2008.
2. Ellis Horowiz, Sartaj Sahni and Sanguthevar Rajasekaran, "Computer Algorithms",
University Press, 2008.
3. Seymour Lipschutz, "Data Structures",TataMcgraw Hill, Schaum’s Outline Series,
2014.
4. Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest and Clifford Stein,
“Introduction to Algorithms”, Third Edition, PHI Learning Private Limited, 2012.

22
5. Alfred V. Aho, John E. Hopcroft and Jeffrey D. Ullman, “Data Structures and
Algorithms
6. Anany Levitin, “Introduction to the Design and Analysis of Algorithms”, Third
Edition, Pearson Education, 2012.
7. Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein,
"Introduction to Algorithms",MIT Press, 2022.
8. [Link]
9. [Link]

COURSE OUTCOMES:

Upon successful completion of this course the students would be able to:

 Know the basic concepts of algorithms

 Understand trees and shortest path algorithms.
 Compare and contrast different sorting algorithms
 Comprehend greedy and optimality algorithms.
 Appreciate the backtracking concept and its different algorithms.

*****

23
Third Year CORE COURSE VI Semester V
COMPUTER NETWORKS
Code (Theory) Credit: 5

COURSE OBJECTIVES:

 To describe the general principles of Computer Networks.

 To describe how the different layers in a computer network work
 To know about Wired LAN: IEEE Standards and Satellite networks.

UNIT - I:

Data Communication – Networks – The Internet – Protocols and Standards – OSI Model-
Layers in OSI Model - TCP/IP Protocol Suite – Addressing.

UNIT - II:

Analog and Digital – Digital Signals – Transmission Impairment – Performance –

Multiplexing – Guided Media – Unguided Media. Switching: Circuit Switched Networks –
Datagram Networks – Virtual Circuit Networks

UNIT -III:

Data Link Layer: Error Detection and Correction -Introduction – Block Coding: Error
detection, Error correction – Data Link Control: Framing – Flow and Error Control –
Protocols – Noiseless Channels – Noisy channels – HDLC – Point to Point Protocol.

UNIT - IV:

Wired LAN: IEEE Standards – Standard Ethernet. Wireless LAN: IEEE 802.11 –
Bluetooth. Connecting LANs: Connecting Devices – Virtual LANs. Wireless WAN: Cellular
Telephony – Satellite Networks. Network Layer-Logical Addressing: IPv4 Addresses – IPv6
Addresses.

UNIT - V:

Transport Layer: Process to Process Delivery – User Datagram Protocol - TCP. Application
Layer: Domain Name Space – DNS in the Internet – Electronic Mail – File Transfer.
WWW: Architecture – HTTP.

UNIT - VI CURRENT CONTOURS (for Continuous Internal Assessment Only):

Contemporary Developments Related to the Course during the Semester Concerned.

REFERENCES:

1. Behrouz A. Forouzan, “Data Communications and Networking”, McGraw-Hill

Companies, New York, 5th Edition, 2017.

2. William Stallings “Data and computer communications”, Prentice Hall of India, 7th
Edition, 2004.
3. Andrew S Tanenbaum, “Computer Networks”, Prentice Hall of India, New Delhi,
2013.
4. Dr M. P. Vani, "Data Communication and Computer Network", Notion Press, 2019.

24
5. Hazim Gaber, "Understanding Computer Networks 2020", Independently Published,
2020.
6. Grigorios N. Beligiannis, Ram Palanisamy, S. Smys, Álvaro Rocha, "Computer
Networks and Inventive Communication Technologies", Springer, 2021.
7. [Link]

COURSE OUTCOMES:

Upon successful completion of this course the students would be able to:

 Recall the basic concepts of computer networks

 Summarize the technical specifications of various layers of the OSI model in a
computer network
 Identify the appropriate protocols and standards for computer networks
 Classify technical factors of cellular networks and satellite communication
 Know about the different functionalities of an application layer.

*****

25
Third Year CORE COURSE VII Semester V
DIGITAL ELECTRONICS AND MICROPROCESSOR
Code (Theory) Credit: 5

COURSE OBJECTIVES:

 To impart knowledge about the basics of Digital Systems

 To focus on the study of Boolean algebra, Combinational circuits.
 To impart knowledge about basic parts and functions of microprocessor and
to have an understanding of the Registers, Interrupts, Interfaces, Buses, Pins,
Instructions of 8085 microprocessor

UNIT - I:

Digital Systems and Binary Numbers - Digital Systems - Binary Numbers -

Number Base Conversions - Octal and Hexadecimal Numbers - Complements of
Numbers. Signed Binary Numbers - Binary Codes - Binary Storage and Registers
- Binary Logic

UNIT - II:

Boolean Algebra and Logic Gates - Introduction - Basic Definitions - Axiomatic

Definition of Boolean Algebra - Basic Theorems and Properties of Boolean
Algebra. Boolean Functions - Canonical and Standard Forms - Other Logic
Operations - Digital Logic Gates - Integrated Circuits.

UNIT - III:

Combinational Logic - Introduction - Combinational Circuits - Analysis of

Combinational Circuits - Design Procedure - Binary Adder - Subtractor - Decimal
Adder - Binary Multiplier - Magnitude Comparator - Decoders - Encoders -
Multiplexers - HDL Models of Combinational Circuits.

UNIT - IV:

Evolution of Microprocessor – Single chip Microcomputer – Microprocessor

Applications –Buses- Memory Addressing capacity and CPU – Microcomputers –
Processor Architecture – Intel 8085 – Instruction cycle – Timing Diagram.

UNIT - V:

Instruction Set of Intel 8085 – Instruction and Data Format – Address Modes –
Status Flags – Intel 8085 instruction - Programming Microprocessor – Assembly
language – Assembler.

UNIT - VI CURRENT CONTOURS (for Continuous Internal Assessment Only):

Contemporary Developments Related to the Course during the Semester

Concerned.

26
REFERENCES:

1. M. Morris R. Mano, Michael D. Ciletti. Digital Design: With an Introduction to

the Verilog HDL, VHDL, and System Verilog, 6th Edition, 2018
2. Badri Ram, “Fundamentals of Microprocessors and Microcomputers”,
Dhanpat Rai Publications, 2012.
3. Dhanasekharan Natarajan, "Fundamentals of Digital Electronics", Springer
International Publishing, 2020
4. Dr. S Salivahanan,"Analog and Digital Electronic", McGraw-Hill
Education, 2019.
5. Soumitra Kumar Mandal, "Digital Electronics", McGraw-Hill Education, 2018.
6. A. Anand Kumar, "Fundamentals of Digital Circuits", Prentice Hall India Pvt.
Limited, 2016.
7. Senthil Kumar Saravanan, Jeevananthan, “Microprocessors and
Microcontrollers”, Oxford University Press, 2010.

COURSE OUTCOMES:

Upon successful completion of this course the students would be able to:

 Understand about various number systems

 Know about Boolean Algebra and Logic Gates
 Draw and explain Combinational circuits
 Explain the Evolution of Microprocessors
 Use the Instruction Set of Intel 8085 in simple programs.

*****

27
Third Year CORE PRACTICAL V Semester V
DIGITAL ELECTRONICS AND MICROPROCESSOR
LAB
Code (Practical) Credit: 4

COURSE OBJECTIVES:

 To have hands-on experience with digital electronics concepts.

 To experiment the design of basic logic circuits, combinational and sequential
circuits
 To write ALP and to execute them with a microprocessor kit.

A. Digital Electronics Experiments

1. Verification of Logic gates

2. Construction of half and full adder
3. K-Map
4. Shift register
5. Up Down Counters

B. Microprocessor Experiments

1. Eight Bit Addition and Subtraction

2. Sum of series
3. Data transfer
4. Maximum of N Numbers
5. Decimal to Hexadecimal

COURSE OUTCOMES:

Upon successful completion of this course the students would be able to:

 Verify the logic gate and the working of Adder and subtractors
 Construct and study the function of Shift registers
 Understand the working of Up Down Counters
 To write simple ALPs and execute them
 To manipulate an array with ALP.

*****

28
Third Year MAJOR BASED ELECTIVE I Semester V
1) ARTIFICIAL INTELLIGENCE AND EXPERT
SYSTEMS
Code (Theory) Credit: 4

COURSE OBJECTIVES:

 To study about the basic concepts in Artificial intelligence and reasoning

 To know about knowledge representation and its subsequent inference
 To study the concept of expert systems

UNIT - I:

Problems and Search : Searching strategies- Uninformed Search- breadth first

search, depth first search, uniform cost search, depth limited search, iterative
deepening search, bidirectional search - Informed Search- Best first search
,Greedy Best first search , A* search – Constraint satisfaction problem , Local
searching strategies.

UNIT - II:

Reasoning: Symbolic Reasoning Under Uncertainty- Statistical Reasoning - Weak

Slot-And-Filler-Structure - Semantic nets – Frames- Strong Slot-And-Filler
Structure-Conceptual Dependency-Scripts- CYC.

UNIT - III:

Knowledge Representation: Knowledge Representation - Knowledge representation

issues - Using predicate logic - Representing Knowledge Using Rules. Syntactic-
Semantic of Representation – Logic & slot and filler - Game Playing – Minimal
search- Alpha beta cutoffs –Iterative deepening planning – component of planning
system – Goal stack planning.

UNIT - IV:

Natural Language Processing: Natural Language Processing –Syntactic

processing, semantic analysis-Parallel and Distributed AI-Psychological modeling-
parallelism and distributed in reasoning systems – Learning Connectionist
Models – Hopfield networks, neural networks.

UNIT - V:

Expert Systems: Common Sense –qualitative physics, common sense ontologies-

memory organization -Expert systems –Expert system shells- explanation –
Knowledge acquisition -Perception and Action – Real time search- robot
architecture.

UNIT - VI CURRENT CONTOURS (for Continuous Internal Assessment Only):

Contemporary Developments Related to the Course during the Semester

Concerned
29
REFERENCES:

1. Elaine Rich, Kevin Knight, “Artificial Intelligence”, 3/e, Tata McGraw Hill,
2017.
2. Russell , “ Artificial intelligence :A modern Approach , Pearson Education ,3rd
edition,2013
3. I. Gupta, G. Nagpal, "Artificial Intelligence and Expert Systems", Mercury
Learning & Information, 2020.
4. C.S. Krishnamoorthy, S. Rajeev, "Artificial Intelligence and Expert Systems for
Engineers", CRC Press, 2018.
5. V. Daniel Hunt, "Artificial Intelligence & Expert Systems Sourcebook, Springer
US, 2012.
6. Artificial Intelligence and Expert system by [Link] hunt, Springer press,
2011.
7. Nilsson N.J., ”Principles of Artificial Intelligence”, Morgan Kaufmann.1998.

COURSE OUTCOMES:

Upon successful completion of this course the students would be able to:

 Understand the history of artificial intelligence (AI) and its foundations.

 Describe the modern view of AI as the study of agents that receive percepts
from the Environment and perform actions.
 Demonstrate awareness of informed search and exploration methods.
 Create knowledge of decision making and learning methods
 Recall the concepts of expert systems.

*****

30
Third Year MAJOR BASED ELECTIVE I Semester V
2) COMPUTER GRAPHICS
Code (Theory) Credit: 4

COURSE OBJECTIVES:

 To understand the basic objectives and scope of computer graphics.

 To identify computer graphics applications and common graphics APIs.
 To know the basic structures of 2D and 3D graphics systems.

UNIT - I:

Overview of Computer Graphics System: Video Display Devices – Raster Scan

Systems – Random – Scan Systems - Graphics Monitors and Workstations –
Input Devices – Hardcopy Devices – Graphics Software.

UNIT - II:

Output Primitives: Line Drawing Algorithms – Loading the Frame Buffer – Line
Function – Circle – Generating Algorithms. Attributes of Output Primitives: Line
Attributes – Curve Attributes – Color and Grayscale levels– Area fill Attributes –
Character Attributes – Bundled Attributes – Inquiry Functions.

UNIT - III:

2D Geometric Transformations: Basic Transformation – Matrix Representations –

Composite Transformations – Window to View port Co-Ordinate Transformations.
Clipping: Point Clipping – Line Clipping – Cohen-Sutherland Line Clipping – Liang
Barsky Line Clipping – Polygon Clipping – Sutherland – Hodgman Polygon
Clipping – Curve Clipping – Text Clipping.

UNIT - IV:

Graphical User Interfaces and Interactive Input Methods: The User Dialogue –
Input of Graphical Data – Input Functions – Interactive Picture Construction
Techniques. Three Dimensional Concepts: 3D-Display Methods – #Three
Dimensional Graphics Packages.

UNIT - V:

3D Geometric and Modelling Transformations: Translation – Scaling – Rotation –

Other Transformations. Visible Surface Detection Methods: Classification of
Visible Surface Detection Algorithm –Blackface Detection – Depth-Buffer Method
– A-Buffer Method – Scan-Line Method –Applications of Computer Graphics.

UNIT VI CURRENT CONTOURS (for Continuous Internal Assessment Only):

Contemporary Developments Related to the Course during the Semester

Concerned

31
REFERENCES:

1. Donald Hearn M. Pauline Baker, Computer Graphics C Version, Pearson

Education, 2014.
2. Alexey Boreskov, Evgeniy Shikin, "Computer Graphics From Pixels to
Programmable Graphics Hardware", CRC Press, 2013.
3. Donald Hearn M. Pauline Baker, "Computer Graphics C Version", Pearson
Education, 2014.
4. Branislav Sobota, "Computer Graphics and Imaging", Intech Open
Publication, 2019.
5. Dr. Deepali A. Godse, Atul P. Godse, "Computer Graphics", UNICORN
Publishing Group, 2020.
6. Gabriel Gambetta, "Computer Graphics from Scratch A Programmer's
Introduction to 3D Rendering", No Starch Press, 2021.

COURSE OUTCOMES:

Upon successful completion of this course the students would be able to:

 Understand the basics of Computer Graphics, Different Graphics Systems

and Applications of Computer Graphics.
 Learn Algorithms for Scan Conversion and filling of Basic Objects and their
Comparative Analysis.
 Use of Geometric Transformations on Graphical Objects and their Application
in Composite form.
 Apply 2D Geometric Transformations
 Use 3D Geometric and Modelling Transformations.

*****

32
Third Year SKILL BASED ELECTIVE I Semester V
WEB TECHNOLOGY
Code (Theory) Credit: 2
COURSE OBJECTIVES:

 To understand the basic concepts related to HTML, JavaScript and VB script.

 To familiarize various concepts associated with Dynamic webpages
 To know about data representation with XML and XSL.

UNIT - I:

HTML: Introduction – SGML – Outline of an HTML Document – Head Section –

Body Section – HTML Forms.

UNIT - II:

Java Script: Introduction – Language Elements – Objects of Java Script – Other

Objects – Arrays.

UNIT - III:

VB Script: Introduction – Embedding VBScript Code in an HTML Document –

Comments – Variables – Operators – Procedures – Conditional Statements –
Looping Constructs – Object and VB Script – Cookies.

UNIT - IV:

Dynamic HTML (DHTML): Introduction – Cascading Style Sheets (CSS) – DHTML

Document Object Model and Collections – Event Handling.

UNIT - V:

Extensible Mark-Up Language (XML): Introduction – HTML vs XML – Syntax of

the XML Document – XML Attributes – XML Validation – XML DTD – The Building
Blocks of XML Documents – DTD Elements – DTD Attributes – DTD Entities –
DTD Validation – XSL – XSL Transformation.

UNIT - VI CURRENT CONTOURS (for Continuous Internal Assessment Only):

Contemporary Developments Related to the Course during the Semester

Concerned.

REFERENCES:

1. N.P. Gopalan and J. Akilandeswari, Web Technology – A Developer’s

Perspective, Prentice Hall of India Private Ltd, New Delhi, Second Edition,
2016.
2. [Link], Web Technology and Design, NEW AGE; First edition, 2018
3. Steven M. Schafer, "HTML, XHTML, and CSS Bible", Wiley Publication, 2011
4. Keith Grant, "CSS in Depth", Manning Publication, 2018.
33
5. William Alvin Newton, Steven Webber, "Computer Programming JavaScript,
Python, HTML, SQL, CSS", Independently Published, 2019.
6. Hasanraza ANSARI, "Learn VBScript", Independently Published, 2021.
7. [Link]

COURSE OUTCOMES:

Upon successful completion of this course the students would be able to:

 Understand and apply the webpage concepts.

 Develop static and dynamic web pages
 Understand the feature of JavaScript and VB Script
 Develop knowledge about XML fundamentals and usage of XML technology.
 Understand about the web design with XSL and data validation with DTD.

*****

34
Third Year CORE COURSE VIII Semester VI
OPERATING SYSTEMS
Code (Theory) Credit: 5

COURSE OBJECTIVES:

 To understand the basics of Operating systems and their working

 To Learn and understand operating system services and methods
 To understand the different types of devices connected with Operating systems.

UNIT - I:

Introduction - What Is an Operating System-Operating System Software -A Brief History

of Machine Hardware -Types of Operating Systems - Brief History of Operating System
Development-Object-Oriented Design

UNIT - II:

Early Systems: Single-User Contiguous Scheme -Fixed Partitions-Dynamic Partitions-

Best-Fit versus First-Fit Allocation -Deallocation - Relocatable Dynamic Partitions.
Virtual Memory: Paged Memory Allocation-Demand Paging-Page Replacement Policies
and Concepts -Segmented Memory Allocation-Segmented/Demand Paged Memory
Allocation - Virtual Memory-Cache Memory

UNIT - III:

Overview-About Multi-Core Technologies-Job Scheduling Versus Process Scheduling-

Process Scheduler-Process Scheduling Policies-Process Scheduling Algorithms –A Word
About Interrupts-Deadlock-Seven Cases of Deadlock -Conditions for Deadlock- Modeling
Deadlock-Strategies for Handling Deadlocks –Starvation- Concurrent Processes: What Is
Parallel Processing-Evolution of Multiprocessors- Introduction to Multi-Core Processors-
Typical Multiprocessing Configurations--Process Synchronization Software.

UNIT - IV:

Types of Devices-Sequential Access Storage Media-Direct Access Storage Devices-

Magnetic Disk Drive Access Times- Components of the I/O Subsystem- Communication
among Devices-Management of I/O Requests

UNIT - V:

The File Manager -Interacting with the File Manager -File Organization – Physical Storage
Allocation -Access Methods-Levels in a File Management System – Access Control
Verification Module

UNIT - VI CURRENT CONTOURS (for Continuous Internal Assessment Only):

Contemporary Developments Related to the Course during the Semester Concerned

REFERENCES:

1. Ann McIver Mc Hoes, Ida M. Flynn, "Understanding Operating Systems", Course

Technology, Cengage Learning, 2011.
2. Greg Tomsho,"Guide to Operating Systems", Cengage Learning, 2020.

35
3. Cesar Herrera, Darrell Hajek, Flor Narciso, "Principles of Operating
Systems", Amazon Digital Services LLC - KDP Print US, 2020.
4. Cesar Herrera, Darrell Hajek,"Principles of Operating Systems", Independently
Published, 2019.
5. Remzi H. Arpaci-Dusseau, Andrea C. Arpaci-Dusseau,"Operating Systems: Three
Easy Pieces", Create Space Independent Publishing Platform, 2018.
6. Abraham Silberschatz, Peter B. Galvin, Greg Gagne, "Operating System Concepts",
Wiley Publisher, 2018.
7. [Link]

COURSE OUTCOMES:

Upon successful completion of this course the students would be able to:

 Recall the basic principles and importance of the operating system in a computer
 Illustrate the objectives and functions of the operating system components
 Identify the various operating system techniques
 Analyse the issues and challenges of the operating system and security mechanisms
 Evaluate the functions and features of file management in operating systems

*****

36