6th sem syllabus revised sem syllabus.pdf · 2019. 11. 7. · co3 analyze and design object...
TRANSCRIPT
SRI SIDDHARTHA INSTITUTE OF TECHNOLOGY(A constituent College of Siddhartha Academy of Hi
Computer Science and Engineering
Sl.
No Sub. Code Name of the subject
1 CS6T01 Object-
2 CS6T02 System Software and
3 CS6T03 Computer Networks
4 CS6T04 Computer
5 CS6PE5Y/
IS6PE5Y
Professional
6 CS6OE6Y/
IS6OE6Y
Open Elective
7 CS6L01 Computer
8 CS6L02 System Programming Laboratory
Total
Professional
Elective – I
Sub. Code
CS6PE511
CS6PE512
CS6PE513
CS6PE514
CS6PE515
Open Electives offered by CSE/ISE Board:
Open
Elective – I
Sub. Code
CS6OE611
CS6OE612
CS6OE613
* Students are expected to study Open
(except CSE and ISE Board).
SRI SIDDHARTHA INSTITUTE OF TECHNOLOGY- TUMAKURU(A constituent College of Siddhartha Academy of Higher Education, Tumakuru)
Computer Science and Engineering
VI SEMESTER
Name of the subject L T
Oriented Modeling and Design 3 2
System Software and Compiler Design 3 2
Computer Networks 4 0
Computer Graphics and Visualization 3 0
Professional Elective – I 3 0
Open Elective-II* 3 0
Computer GraphicsLaboratory 0 0
System Programming Laboratory 0 0
19 4
essional
I Credits: 3-0-0-0-3
Subject Title
Artificial Intelligence
Data Mining and Data Warehousing
Python Programming
Distributed Operating System
Unix System Programming
Open Electives offered by CSE/ISE Board:
II Credits: 3-0-0-0-3
Subject Title
Object-Oriented Programming with C++
Software Engineering
Artificial Intelligence
* Students are expected to study Open Electives offered by other branches of Engineering
(except CSE and ISE Board).
TUMAKURU gher Education, Tumakuru)
T P S C
2 0 0 4
2 0 0 4
0 0 0 4
0 0 1 4
0 0 0 3
0 0 0 3
0 3 0 1.5
0 3 0 1.5
4 6 1 25
Oriented Programming with C++
Electives offered by other branches of Engineering
SRI SIDDHARTHA INSTITUTE OF TECHNOLOGY(A constituent College of Siddhartha Academy of Hi
Computer Science and Engineering
Syllabus for the Academic Year
Department: Computer Science and Engineering
Subject Name: OBJECT ORIENTED MODELING AND DESIGN
Subject Code: CS6T01
Course Objectives :
Course Outcomes
Sl.No Course Objectives
1 Describe object based views for generic software system.
2 Demonstrate the concepts of usemodel for a given problem
3 Translate the requirements into object
4 Choose an appropriate design pattern to facilitate system development
Course outcome
Descriptions
CO1 Describe the concepts involved in objectbenefits.
CO2 Demonstrate the ability to apply the knowledge of object oriented concepts for a
CO3 Analyze and design object oriented models using UML notations.
CO4 Illustrate the concept of
SRI SIDDHARTHA INSTITUTE OF TECHNOLOGY- TUMAKURU(A constituent College of Siddhartha Academy of Higher Education, Tumakuru)
Computer Science and Engineering
Syllabus for the Academic Year – 2019 - 2020
Department: Computer Science and Engineering
Subject Name: OBJECT ORIENTED MODELING AND DESIGN
CS6T01 L
Course Objectives
Describe object based views for generic software system.
Demonstrate the concepts of use-case model, sequence model, state chart model for a given problem.
Translate the requirements into object-oriented design for implementation
Choose an appropriate design pattern to facilitate system development
Descriptions
Describe the concepts involved in object-oriented modeling and their
te the ability to apply the knowledge of object oriented concepts for a given application.
Analyze and design object oriented models using UML notations.
Illustrate the concept of patterns for designing the architecture
TUMAKURU gher Education, Tumakuru)
2020
Semester: 6
L-T-P-S-C: 3-2-0-0-4
case model, sequence model, state chart
oriented design for implementation.
Choose an appropriate design pattern to facilitate system development.
oriented modeling and their
te the ability to apply the knowledge of object oriented
Analyze and design object oriented models using UML notations.
architecture.
SRI SIDDHARTHA INSTITUTE OF TECHNOLOGY(A constituent College of Siddhartha Academy of Hi
Computer Science and Engineering
UNIT
I
Introduction, Modeling Concepts: What is Object Orientation? What is OO development? OO themes; Evidence for usefulness of OO development; OO modeling history. Modeling as Design Technique: Modeling; abstraction; The three models. Class Modeling: Object and class concepts; Link and associations concepts; Generalization and inheritance; A sample class model; Navigation of class models. Advanced class modeling: Adconcepts; Association ends; Nclasses; Multiple inheritance; Metadata; Reification; Constraints; Derived data; Packages;
II
State Modeling:
State Modeling: Events, States, Transitions and Conditions; State diagrams; State diagram behavior; Advanced State Modeling: Nested state diagrams; Nested states; Signal genersample state model; Relation of class and state models; Practical tips. Interaction Modeling: Use case models; Sequence models; Activity models; Use case relationships; Procedural sequence models; Special constructs for activity m
III
Process Overview, System Conception: Process Overview: Development stages; Development life cycle. System Conception: Devising a system concept; elaborating a concept; preparing a problem statement Domain Analysis, Appl Domain Analysis: Overview of analysis; Domain class model; Domain state model; Domain interaction model; Iterating the analysis. Application Analysis: Application interaction model; model; Application state model; Adding operations
SRI SIDDHARTHA INSTITUTE OF TECHNOLOGY- TUMAKURU(A constituent College of Siddhartha Academy of Higher Education, Tumakuru)
Computer Science and Engineering
Description
Introduction, Modeling Concepts:
What is Object Orientation? What is OO development? OO themes; Evidence for usefulness of OO development; OO modeling history. Modeling as Design Technique: Modeling; abstraction; The three
Object and class concepts; Link and associations concepts; Generalization and inheritance; A sample class model; Navigation of class models. Advanced class modeling: Advanced object and class concepts; Association ends; N-ary associations; Aggregation; Abstract classes; Multiple inheritance; Metadata; Reification; Constraints; Derived data; Packages;
State Modeling: Events, States, Transitions and Conditions; State diagrams; State diagram behavior; Advanced State Modeling: Nested state diagrams; Nested states; Signal generalization; Concurrency; A sample state model; Relation of class and state models; Practical tips. Interaction Modeling: Use case models; Sequence models; Activity models; Use case relationships; Procedural sequence models; Special constructs for activity models.
Process Overview, System Conception:
Process Overview: Development stages; Development life cycle. System Conception: Devising a system concept; elaborating a concept; preparing a problem statement
Domain Analysis, Application Analysis:
Domain Analysis: Overview of analysis; Domain class model; Domain state model; Domain interaction model; Iterating the analysis. Application Analysis: Application interaction model; Application class model; Application state model; Adding operations
TUMAKURU gher Education, Tumakuru)
Hours
What is Object Orientation? What is OO development? OO themes; Evidence for usefulness of OO development; OO modeling history. Modeling as Design Technique: Modeling; abstraction; The three
Object and class concepts; Link and associations concepts; Generalization and inheritance; A sample class model; Navigation of
vanced object and class ary associations; Aggregation; Abstract
classes; Multiple inheritance; Metadata; Reification; Constraints;
8
State Modeling: Events, States, Transitions and Conditions; State diagrams; State diagram behavior; Advanced State Modeling: Nested
alization; Concurrency; A sample state model; Relation of class and state models; Practical tips. Interaction Modeling: Use case models; Sequence models; Activity models; Use case relationships; Procedural sequence models; Special
7
Process Overview: Development stages; Development life cycle. System Conception: Devising a system concept; elaborating a concept;
Domain Analysis: Overview of analysis; Domain class model; Domain state model; Domain interaction model; Iterating the analysis.
Application class
8
SRI SIDDHARTHA INSTITUTE OF TECHNOLOGY(A constituent College of Siddhartha Academy of Hi
Computer Science and Engineering
IV
System Design: Overview of system design; Estimating performance; Making a reuse plan; Breaking a system in to subAllocation of sub-systems; Managglobal resources; Choosing a software control strategy; Handling boundary conditions; Setting the tradearchitectural styles; Architecture of the ATM system as the example.
V
Class Design, Implement
Class Design: Overview of class design; Bridging the gap; Realizing use cases; Designing algorithms; Recursing downwards, Refactoring; Design optimizatiinheritance; Organizing a class design; ATM example. Implementation modeling: Overview of implementation, Fine tuning classes, Fine tuning generalizations, Realizing associations. Design Patterns: What is a pattern?, What makes a pattern?, Pattern categories, Relationship between patterns, pattern description, Idioms: Introduction, What can idioms provide?, Idioms and style, Where to find idioms, Counted pointer example.
Question paper Pattern:
From Each unit, two questions of 20 marks each have to be prepared, the student has to answer one full question of his/her choice.
Text Books:
Sl No
Text Book title
1
Object-Oriented Modeling and Design with UML
2.
Pattern-Oriented Software Architecture, A System of Patterns
SRI SIDDHARTHA INSTITUTE OF TECHNOLOGY- TUMAKURU(A constituent College of Siddhartha Academy of Higher Education, Tumakuru)
Computer Science and Engineering
Overview of system design; Estimating performance; Making a reuse plan; Breaking a system in to sub-systems; Identifying concurrency;
systems; Management of data storage; Handling global resources; Choosing a software control strategy; Handling boundary conditions; Setting the trade-off priorities; Common architectural styles; Architecture of the ATM system as the example.
Class Design, Implementation Modeling:
Class Design: Overview of class design; Bridging the gap; Realizing use cases; Designing algorithms; Recursing downwards, Refactoring; Design optimization; Reification of behavior; Adjustment of inheritance; Organizing a class design; ATM example. Implementation modeling: Overview of implementation, Fine tuning classes, Fine tuning generalizations, Realizing associations.
is a pattern?, What makes a pattern?, Pattern categories, Relationship between patterns, pattern description, Idioms: Introduction, What can idioms provide?, Idioms and style, Where to find idioms, Counted pointer example.
m Each unit, two questions of 20 marks each have to be prepared, the student has to answer one full question of his/her choice.
Text Book title Author
Oriented Modeling and
Michael R Blaha, James R Rumbaugh
Oriented Software Architecture, A System of Patterns
Frank Buschmann, RegineMeunier, Hans Rohnert, Peter Sommerlad, Michael Stal,
TUMAKURU gher Education, Tumakuru)
Overview of system design; Estimating performance; Making a reuse systems; Identifying concurrency;
ement of data storage; Handling global resources; Choosing a software control strategy; Handling
off priorities; Common architectural styles; Architecture of the ATM system as the example.
8
Class Design: Overview of class design; Bridging the gap; Realizing use cases; Designing algorithms; Recursing downwards, Refactoring;
on; Reification of behavior; Adjustment of inheritance; Organizing a class design; ATM example. Implementation modeling: Overview of implementation, Fine tuning classes, Fine
is a pattern?, What makes a pattern?, Pattern categories, Relationship between patterns, pattern description, Idioms: Introduction, What can idioms provide?, Idioms and style, Where to
8
m Each unit, two questions of 20 marks each have to be prepared, the student has
Volume and Year of Edition
2nd Edition, Pearson Education, 2005.ISBN-13:978-0130159205
John Wiley and Sons, 2006 ISBN:978-0-471958697
SRI SIDDHARTHA INSTITUTE OF TECHNOLOGY(A constituent College of Siddhartha Academy of Hi
Computer Science and Engineering
Reference Books:
Sl No
Text Book title
1 Object-Oriented Analysis and Design with Applications
2. Practical Object-Oriented Design with UML
3. The Unified Modeling Language UserGuide
SRI SIDDHARTHA INSTITUTE OF TECHNOLOGY- TUMAKURU(A constituent College of Siddhartha Academy of Higher Education, Tumakuru)
Computer Science and Engineering
Text Book title Author Volume and Year of Edition
Oriented Analysis and Design with Applications
Grady Booch et al
3rd Edition, Pearson, 2007.ISBN:97802
Oriented Mark Priestley
2nd Edition, TataMcGrawHill,2003.ISBN:9780077103934
The Unified Modeling Language UserGuide
Booch, G., Rumbaugh, J., and Jacobson
2nd Edition, Pearson, 2005.
ISBN:9780201571684
TUMAKURU gher Education, Tumakuru)
Volume and Year of
3rd Edition, Pearson, 2007. ISBN:9780201895513
Edition, TataMcGraw-Hill,2003. ISBN:9780077103934
2nd Edition, Pearson, 2005.
ISBN:9780201571684
SRI SIDDHARTHA INSTITUTE OF TECHNOLOGY(A constituent College of Siddhartha Academy of Hi
Computer Science and Engineering
Syllabus for the Academic Year
Department: Computer Science and Engineering Subject Name: System Software and
Subject Code: CS6T02
Course Objectives:
Course Outcomes
Sl.No Course Objectives
1 Learn fundamentals of system software.
2 Understand the working of assemblers, loaders and linkers
3 Learn different phases of compiler design.
4 Gain knowledge about the construction of parsing taand bottom-up approach.
5 Gain knowledge about intermediate code generation.
Course outcome
Descriptions
CO1 Describe the basic concepts and working principle of system software.
CO2 Apply concepts of regular expresperforming Lexical and Syntax Analysis.
CO3 Explain the process of Syntax Directed translation, Intermediate code generation and Target code generation.
CO4 Develop syntax directed translation schemes to generate intermand optimize it for the target machine.
SRI SIDDHARTHA INSTITUTE OF TECHNOLOGY- TUMAKURU(A constituent College of Siddhartha Academy of Higher Education, Tumakuru)
Computer Science and Engineering
Syllabus for the Academic Year – 2019 - 2020
Department: Computer Science and Engineering
System Software and Compiler Design
L-T-P-S
Course Objectives
Learn fundamentals of system software.
Understand the working of assemblers, loaders and linkers
Learn different phases of compiler design.
Gain knowledge about the construction of parsing table using topup approach.
Gain knowledge about intermediate code generation.
Descriptions
Describe the basic concepts and working principle of system software.
Apply concepts of regular expressions and context free grammar for performing Lexical and Syntax Analysis.
Explain the process of Syntax Directed translation, Intermediate code generation and Target code generation.
Develop syntax directed translation schemes to generate intermand optimize it for the target machine.
TUMAKURU gher Education, Tumakuru)
2020
Semester: 6
S-C: 3-2-0-0-4
Understand the working of assemblers, loaders and linkers
ble using top-down
Describe the basic concepts and working principle of system software.
sions and context free grammar for
Explain the process of Syntax Directed translation, Intermediate code
Develop syntax directed translation schemes to generate intermediate code
SRI SIDDHARTHA INSTITUTE OF TECHNOLOGY(A constituent College of Siddhartha Academy of Hi
Computer Science and Engineering
UNIT
I
Machine Architecture, Assemblers Introduction, System Software and Machine Architecture, The Simplified Instructional Computer (SIC)SIC/XE Machine Architecture, Basic Assembler Functions, Machine Dependent Assembler Features, Instruction Formats and Addressing Modes.
II Assembler - II, Loaders and Linkers Machine Independent Assembler Features, Basic Loader Functions, Machine-Dependent Loader Features.
III
Introduction, Lexical Analysis, Syntax Analysis Language Processors; The structure of a Compiler; The Role of the Lexical Analyzer, Input Buffering, RecoThe role of the parser, Syntaxstrategies. Writing a Grammar: Elimination of leftfactoring.
IV
Syntax Analysis –Top-down Parsing: RecursiveLL(1) Grammars, Nonrecursive Predictive Parsing. BottomReductions, Shift-parsing. Introduction to LR parsing: Simple LR: Why LRItems and the LR(0) automaton , The LR parsing algorithm , Constructing SLR-parsing tables.
V
Syntax-Directed Translation, IntermediateGeneration Syntax-Directed definitions; Evaluation order for SDsyntax trees: Directed Acyclic Graphs for expressions; ThreeCode: Addresses and Instructions, Quadruples, Triples, ; Issues in the design of a Code Generator, The Target language.
Question paper Pattern:
From each unit , two questions of 20 marks each have to be given, the student has to answer one full question of his/her choice.
SRI SIDDHARTHA INSTITUTE OF TECHNOLOGY- TUMAKURU(A constituent College of Siddhartha Academy of Higher Education, Tumakuru)
Computer Science and Engineering
Description
Machine Architecture, Assemblers - I Introduction, System Software and Machine Architecture, The Simplified Instructional Computer (SIC)- SIC Machine Architecture, SIC/XE Machine Architecture, Basic Assembler Functions, Machine Dependent Assembler Features, Instruction Formats and Addressing
II, Loaders and Linkers dependent Assembler Features, Basic Loader Functions,
Dependent Loader Features.
Introduction, Lexical Analysis, Syntax Analysis - I Language Processors; The structure of a Compiler; The Role of the Lexical Analyzer, Input Buffering, Recognition of Tokens; Introduction: The role of the parser, Syntax-Error Handling, Errorstrategies. Writing a Grammar: Elimination of left-recursion, Left
– II down Parsing: Recursive-Descent Parsing , FIRST and FOLLOW ;
LL(1) Grammars, Nonrecursive Predictive Parsing. Bottom--Reduce parsing, Conflicts during shift
parsing. Introduction to LR parsing: Simple LR: Why LRItems and the LR(0) automaton , The LR parsing algorithm ,
parsing tables.
Directed Translation, Intermediate-Code Generation, Code neration
Directed definitions; Evaluation order for SDDs, Variants of syntax trees: Directed Acyclic Graphs for expressions; Three-Code: Addresses and Instructions, Quadruples, Triples, ; Issues in the design of a Code Generator, The Target language.
estions of 20 marks each have to be given, the student has to answer one full question of his/her choice.
TUMAKURU gher Education, Tumakuru)
Hours
Introduction, System Software and Machine Architecture, The
SIC Machine Architecture, SIC/XE Machine Architecture, Basic Assembler Functions, Machine Dependent Assembler Features, Instruction Formats and Addressing
8
dependent Assembler Features, Basic Loader Functions,
7
Language Processors; The structure of a Compiler; The Role of the
gnition of Tokens; Introduction: Error Handling, Error-recovery
recursion, Left-
8
Descent Parsing , FIRST and FOLLOW ;
-up Parsing: Reduce parsing, Conflicts during shift-reduce
parsing. Introduction to LR parsing: Simple LR: Why LR Parsers? , Items and the LR(0) automaton , The LR parsing algorithm ,
8
Code Generation, Code
Ds, Variants of -Address
Code: Addresses and Instructions, Quadruples, Triples, ; Issues in the
8
estions of 20 marks each have to be given, the student
SRI SIDDHARTHA INSTITUTE OF TECHNOLOGY(A constituent College of Siddhartha Academy of Hi
Computer Science and Engineering
Text Books:
Sl No
Text Book title
1 System Software
2 Compilers-Principles, Techniques and Tools
Reference Book:
Sl No
Text Book title
1 System Programming and Operating Systems,
2 Crafting a Compiler
3 Modern Compiler Implementation in C,
4 Compiler Construction Principles & Practice;
SRI SIDDHARTHA INSTITUTE OF TECHNOLOGY- TUMAKURU(A constituent College of Siddhartha Academy of Higher Education, Tumakuru)
Computer Science and Engineering
Text Book title Author
Leland.L.Beck
Principles, Techniques Alfred V Aho, Monica S. Lam, Ravi Sethi, Jeffrey D Ullman:
Author
System Programming and Operating Systems, D.M.Dhamdhere
Charles N. Fischer, Richard J. leBlanc, Jr.:
Modern Compiler Implementation in C, Andrew W Apple;
Compiler Construction Principles & Practice;
Kenneth C Louden;
TUMAKURU gher Education, Tumakuru)
Volume and Year of Edition 3th Revised Edition, Pearson 1996 ISBN- 13: 978-0201423006
2nd Edition, Pearson Education, 2014. ISBN: 13-978-1-292-02434-9
Volume and Year of Edition
2nd Revised Edition, Tata McGraw -Hill, 1999. ISBN: 13-978-0074630839
1st Edition; Pearson Education, 2010 ISBN-13: 978-0138017859
Second Edition, Cambridge University Press, 2012. ISBN-13:978-1139174930
Course Technology Inc; International edition 1997 ISBN-13: 978-0534939724
SRI SIDDHARTHA INSTITUTE OF TECHNOLOGY(A constituent College of Siddhartha Academy of Hi
Computer Science and Engineering
Syllabus for the Academic Year
Department: Computer Science and Engineering Subject Name: COMPUTER NETWORKS Subject Code: CS6T03 Course Objectives : This course will enable students to
Course Outcomes: After successful completion of the course, the student would be able to:
Sl.No Course Objectives
1 Explain routers, IP and Routing Algorithms in network layer.
2 Discuss transport layer services and understand UDP and TCP protocols.
3 Demonstration of applica
4 Illustrate concepts of Security and Network Management.
Course outcome
Descriptions
CO1 Analyze the requirements and design issues for astructure and provide the most appropriate networking architecture and technologies.
CO2 Describe routing algorithms in network layer and services of transport layer.
CO3 Analyze the merits and demerits of different protocols in netransport layer.
CO4 Outline the concepts of advanced networking technologies and internet security system.
SRI SIDDHARTHA INSTITUTE OF TECHNOLOGY- TUMAKURU(A constituent College of Siddhartha Academy of Higher Education, Tumakuru)
Computer Science and Engineering
Syllabus for the Academic Year – 2019 - 2020
Computer Science and Engineering
COMPUTER NETWORKS
L-T-P-S
This course will enable students to
After successful completion of the course, the student would be
Course Objectives
Explain routers, IP and Routing Algorithms in network layer.
Discuss transport layer services and understand UDP and TCP protocols.
Demonstration of application layer protocols.
Illustrate concepts of Security and Network Management.
Descriptions
Analyze the requirements and design issues for a given organizational structure and provide the most appropriate networking architecture and
Describe routing algorithms in network layer and services of transport
Analyze the merits and demerits of different protocols in netransport layer.
Outline the concepts of advanced networking technologies and internet security system.
TUMAKURU gher Education, Tumakuru)
2020
Semester: 6
S-C: 4-0-0-0-4
After successful completion of the course, the student would be
Explain routers, IP and Routing Algorithms in network layer.
Discuss transport layer services and understand UDP and TCP protocols.
Illustrate concepts of Security and Network Management.
given organizational structure and provide the most appropriate networking architecture and
Describe routing algorithms in network layer and services of transport
Analyze the merits and demerits of different protocols in network and
Outline the concepts of advanced networking technologies and internet
SRI SIDDHARTHA INSTITUTE OF TECHNOLOGY(A constituent College of Siddhartha Academy of Hi
Computer Science and Engineering
UNIT
I
Network Layer -I Network Layer Design Issues:Services Provided to the TransporConnectionless Service, Implementation of ConnectionService, Comparison of VirtualRouting Algorithms: Flooding, Distance Vector Routing, Routing, Broadcast routing, Multicast routing, Anycast routing, Routing for mobile hosts, to Congestion Control, TrafficTraffic throttling, Load S
II
Network Layer-II Quality of Service: scheduling, Admission control, Integrated services, Differentiated services. Internetworking: connected, Tunneling, Internetwork routing, Packet fragmentation.The Network Layer in the Internet:addresses, IP version 6, Internet control protocols, OSPF, BGP.
III
Transport Layer Services Provided tElements of Transport protocols:establishment, Connection release, Error control and Flow control, Multiplexing, Crash recovery, Introduction to UDP , Remote Procedure Call. Introduction to TCP, The TCP Service Model, The TCP Protocol, The TCP Segment Header, TCP Connection Establishment, TCP Connection Release.
IV
Transport layer continued.. Standard Client Server protocolsTCP Connection Management Modeling, TCP Sliding winTimer Management, TCP Congestion Control6.1.4 from Book-1), Two Connections, Control Connection, Data Connection, Security for FTP, Electronic mail: Architecture, Web baseTelnet: Local versus Remote logging, Domain Name system: Name space, DNS in the Internet, Caching, Resource Record, DNS messages, Security of DNS.(26.1 to 26.6, except 26.5, 26.63,26.67,26.68 from Book-2)
V
Networks Securitylayer security: Two modes, Two security protocols, Services provided by IPSec, Security association, Internet key exchange, Virtual private network, Transport layer security: SSL Architecture, Four Protocols, Firewalls: Packet filter firewall, Proxy firewall (32.1, 32.2 and 32.4 from Book-2). Network Management System: Introduction: Configuration
SRI SIDDHARTHA INSTITUTE OF TECHNOLOGY- TUMAKURU(A constituent College of Siddhartha Academy of Higher Education, Tumakuru)
Computer Science and Engineering
Network Layer Design Issues: Store-and-Forward Packet Switching, Services Provided to the Transport Layer, Implementation of Connectionless Service, Implementation of ConnectionService, Comparison of Virtual-Circuit and Datagram Networks. Routing Algorithms: The Optimality Principle, Shortest Path Routing, Flooding, Distance Vector Routing, Link State Routing, Hierarchical Routing, Broadcast routing, Multicast routing, Anycast routing, Routing for mobile hosts, Congestion Control Algorithms: to Congestion Control, Traffic-aware routing, Admission control, Traffic throttling, Load Shedding. (5.1.1 to 5.3.5 from Book-
Application requirements, Traffic shaping, Packet scheduling, Admission control, Integrated services, Differentiated
Internetworking: How networks differ, How networks can be connected, Tunneling, Internetwork routing, Packet fragmentation.The Network Layer in the Internet: The IP version 4 protocol, IP addresses, IP version 6, Internet control protocols, OSPF, BGP.
Services Provided to the Upper Layers, Transport Service Primitives, Elements of Transport protocols: Addressing, Connection establishment, Connection release, Error control and Flow control, Multiplexing, Crash recovery, Introduction to UDP , Remote Procedure
tion to TCP, The TCP Service Model, The TCP Protocol, The TCP Segment Header, TCP Connection Establishment, TCP Connection Release.
Transport layer continued.. Standard Client Server protocolsTCP Connection Management Modeling, TCP Sliding winTimer Management, TCP Congestion Control. (6.1.1 to 6.5.10 except
1), World wide web, Hypertext transfer protocol, FTP: Two Connections, Control Connection, Data Connection, Security for FTP, Electronic mail: Architecture, Web based mail, E-Mail security, Telnet: Local versus Remote logging, Domain Name system: Name space, DNS in the Internet, Caching, Resource Record, DNS messages, Security of DNS.(26.1 to 26.6, except 26.5, 26.63,26.67,26.68 from
Networks Security and Network Management System layer security: Two modes, Two security protocols, Services provided by IPSec, Security association, Internet key exchange, Virtual private network, Transport layer security: SSL Architecture, Four Protocols,
s: Packet filter firewall, Proxy firewall (32.1, 32.2 and 32.4
Network Management System: Introduction: Configuration
TUMAKURU gher Education, Tumakuru)
Hours
Forward Packet Switching, t Layer, Implementation of
Connectionless Service, Implementation of Connection-Oriented Circuit and Datagram Networks.
The Optimality Principle, Shortest Path Routing, Link State Routing, Hierarchical
Routing, Broadcast routing, Multicast routing, Anycast routing, Approaches
aware routing, Admission control, -1)
11
Application requirements, Traffic shaping, Packet scheduling, Admission control, Integrated services, Differentiated
etworks can be connected, Tunneling, Internetwork routing, Packet fragmentation.
The IP version 4 protocol, IP addresses, IP version 6, Internet control protocols, OSPF, BGP.
12
o the Upper Layers, Transport Service Primitives, Addressing, Connection
establishment, Connection release, Error control and Flow control, Multiplexing, Crash recovery, Introduction to UDP , Remote Procedure
tion to TCP, The TCP Service Model, The TCP Protocol, The TCP Segment Header, TCP Connection Establishment, TCP
11
Transport layer continued.. Standard Client Server protocols TCP Connection Management Modeling, TCP Sliding window, TCP
. (6.1.1 to 6.5.10 except World wide web, Hypertext transfer protocol, FTP:
Two Connections, Control Connection, Data Connection, Security for Mail security,
Telnet: Local versus Remote logging, Domain Name system: Name space, DNS in the Internet, Caching, Resource Record, DNS messages, Security of DNS.(26.1 to 26.6, except 26.5, 26.63,26.67,26.68 from
10
Network layer security: Two modes, Two security protocols, Services provided by IPSec, Security association, Internet key exchange, Virtual private network, Transport layer security: SSL Architecture, Four Protocols,
s: Packet filter firewall, Proxy firewall (32.1, 32.2 and 32.4
Network Management System: Introduction: Configuration
08
SRI SIDDHARTHA INSTITUTE OF TECHNOLOGY(A constituent College of Siddhartha Academy of Hi
Computer Science and Engineering
Management, Fault Management, Performance management, Security Management, Accounting Management, SNMP: Managers and AgentsManagement Components, An Overview, SMI, MIB, SNMP. (27.1, 27.2 from Book -2))
Question paper Pattern:
From each unit , two questions of 20 marks each have to be given, the student has to answer one full question of his/her choice.
Text Books:
Sl No
Text Book title
1 Computer Networks
2 Data Communications and Networking
Reference Books:
Sl No
Text Book title
1 Communication Networks Fundamental Concepts and Key architectures
2 Data and Computer Communication
3 Computer and Communication Networks
SRI SIDDHARTHA INSTITUTE OF TECHNOLOGY- TUMAKURU(A constituent College of Siddhartha Academy of Higher Education, Tumakuru)
Computer Science and Engineering
Management, Fault Management, Performance management, Security Management, Accounting Management, SNMP: Managers and AgentsManagement Components, An Overview, SMI, MIB, SNMP. (27.1, 27.2
From each unit , two questions of 20 marks each have to be given, the student has to answer one full question of his/her choice.
Text Book title Author
Computer Networks Andrew S. Tanenbaum and Wetherall.
Data Communications and Behrouz A. Forouzan
Text Book title Author
Communication Networks – Fundamental Concepts and Key Alberto Leon-Garcia
and IndraWidjaja
Data and Computer Communication William Stallings:
Computer and Communication Nader F.Mir:”
TUMAKURU gher Education, Tumakuru)
Management, Fault Management, Performance management, Security Management, Accounting Management, SNMP: Managers and Agents, Management Components, An Overview, SMI, MIB, SNMP. (27.1, 27.2
From each unit , two questions of 20 marks each have to be given, the student
Volume and Year of Edition
5th Edition,ISBN-13: 978-0-13-212695-3
5th Edition,ISBN 978-0-07-337622-6
Volume and Year of Edition
Garcia 2nd Edition, Tata McGraw-Hill,ISBN-13: 978-0072463521
8th Edition, Pearson Education, ISBN-0-13-243310-9
Pearson Education,2007
ISBN-0-13-174799-1
SRI SIDDHARTHA INSTITUTE OF TECHNOLOGY(A constituent College of Siddhartha Academy of Hi
Computer Science and Engineering
Syllabus for the Academic Year
Department: Computer Science and Engineering Subject Name: COMPUTER GRAPHICS AND VISUALIZATION Subject Code: CS6T04
Course Objectives :
Course Outcomes
Sl.No Course Objectives
1
Knowledge of graphic system and computer graphics applications.
2
An understanding of different OpenGL functions and graphics models.
3 Knowledge of geometrical objects, transformations and their implementations.
4 An understanding the importance ographics applications
Course outcome
Descriptions
CO1 Outline the basics of computer graphics
CO2 Identify and analyze various graphics functions for solving problems
CO3 Apply graphical opera
CO4 Develop graphical solutions for different applications.
SRI SIDDHARTHA INSTITUTE OF TECHNOLOGY- TUMAKURU(A constituent College of Siddhartha Academy of Higher Education, Tumakuru)
Computer Science and Engineering
Syllabus for the Academic Year – 2019 - 2020
Department: Computer Science and Engineering
COMPUTER GRAPHICS AND VISUALIZATION
CS6T04 L-T-P-
Course Objectives
Knowledge of graphic system and computer graphics applications.
An understanding of different OpenGL functions and graphics models.
Knowledge of geometrical objects, transformations and their implementations.
An understanding the importance of viewing, lightening and shading in graphics applications
Descriptions
Outline the basics of computer graphics
Identify and analyze various graphics functions for solving problems
Apply graphical operations to construct various graphical models.
Develop graphical solutions for different applications.
TUMAKURU gher Education, Tumakuru)
2020
Semester: 6
-C: 3-0-0-1-4
Knowledge of graphic system and computer graphics applications.
An understanding of different OpenGL functions and graphics models.
Knowledge of geometrical objects, transformations and their
f viewing, lightening and shading in
Identify and analyze various graphics functions for solving problems
tions to construct various graphical models.
Develop graphical solutions for different applications.
SRI SIDDHARTHA INSTITUTE OF TECHNOLOGY(A constituent College of Siddhartha Academy of Hi
Computer Science and Engineering
UNIT
I
INTRODUCTION: Applications of computer graphics; A graphics system; Images: Physical and synthetic; Imaging systemssynthetic camera model; Graphics architectures; Graphics Programming: The Sierpinski gasket; programming 2D applications.
II THE OPENGL: The OpenGL API; Primitives and attributes; color, Viewing,Control functions; The Gasket program; Polygons anrecursion; the three
III
INPUT AND INTERACTIONand modeling; Programming eventsimple CAD program, Building interactive interactive programs;
IV
GEOMETRIC OBJECTS AND TRANSFORMATIONSand vectors; 3-dimensional primitives, Coordinate systems and frames, frames in OpenGL, Modeling a colored cube; affine transformations; Rotation, transhomogeneous coordinates; Concatenation of transformations; OpenGL transformation matrices.
V
VIEWING, LIGHTENING AND SHADING Viewing: Classical and computer viewing, Viewing with a computer, positioning of the camera, Projections in OpenGL, Hiddenremoval. Lighting and Shadinglighting model, Polygonal shading, Light sources in OpenGL, Specification of materials in OpenGL.
Question paper Pattern:
From each unit, two questions of 20 marks each to be given. The student has to answer one full question of his / her choice.
SRI SIDDHARTHA INSTITUTE OF TECHNOLOGY- TUMAKURU(A constituent College of Siddhartha Academy of Higher Education, Tumakuru)
Computer Science and Engineering
Description
: Applications of computer graphics; A graphics system; Images: Physical and synthetic; Imaging systemssynthetic camera model; Graphics architectures; Graphics Programming: The Sierpinski gasket; programming 2D applications.
: The OpenGL API; Primitives and attributes; color, Viewing,Control functions; The Gasket program; Polygons anrecursion; the three-dimensional gasket, plotting of implicit functions.
INPUT AND INTERACTION: Input devices; Display lists; Display lists and modeling; Programming event-driven input; Menus; Picking; A simple CAD program, Building interactive models; Animating interactive programs;
GEOMETRIC OBJECTS AND TRANSFORMATIONS: Scalars, points, dimensional primitives, Coordinate systems and
frames, frames in OpenGL, Modeling a colored cube; affine transformations; Rotation, translation and scaling. Transformations in homogeneous coordinates; Concatenation of transformations; OpenGL transformation matrices.
VIEWING, LIGHTENING AND SHADING
: Classical and computer viewing, Viewing with a computer, ositioning of the camera, Projections in OpenGL, Hidden-surface
Lighting and Shading: Light and matter; Light sources, The Phong lighting model, Polygonal shading, Light sources in OpenGL, Specification of materials in OpenGL.
From each unit, two questions of 20 marks each to be given. The student has to answer one full question of his / her choice.
TUMAKURU gher Education, Tumakuru)
Hours
: Applications of computer graphics; A graphics system; Images: Physical and synthetic; Imaging systems; The synthetic camera model; Graphics architectures; Graphics Programming: The Sierpinski gasket; programming 2D applications.
6
: The OpenGL API; Primitives and attributes; color, Viewing,Control functions; The Gasket program; Polygons and
dimensional gasket, plotting of implicit functions.
7
: Input devices; Display lists; Display lists driven input; Menus; Picking; A
models; Animating
8
: Scalars, points, dimensional primitives, Coordinate systems and
frames, frames in OpenGL, Modeling a colored cube; affine lation and scaling. Transformations in
homogeneous coordinates; Concatenation of transformations; OpenGL
9
: Classical and computer viewing, Viewing with a computer, surface
: Light and matter; Light sources, The Phong lighting model, Polygonal shading, Light sources in OpenGL,
9
From each unit, two questions of 20 marks each to be given. The student has to answer
SRI SIDDHARTHA INSTITUTE OF TECHNOLOGY(A constituent College of Siddhartha Academy of Hi
Computer Science and Engineering
Text Books:
Sl. No.
Text Book title
1 Interactive ComputeTop-Down Approach with OpenGL
Reference Books:
Sl. No.
Reference Book title
1 Computer Graphics with OpenGL
2 Computer Graphics Using OpenGL
3 Computer Graphics
SRI SIDDHARTHA INSTITUTE OF TECHNOLOGY- TUMAKURU(A constituent College of Siddhartha Academy of Higher Education, Tumakuru)
Computer Science and Engineering
Text Book title Author
Interactive Computer Graphics A Down Approach with OpenGL Edward Angel
Reference Book title Author
Computer Graphics with OpenGL Donald Hearn and Pauline Baker
Computer Graphics Using OpenGL F.S. Hill, Jr.
Computer Graphics James D Foley, Andries Van Dam, Steven K Feiner, John F Hughes,
TUMAKURU gher Education, Tumakuru)
Volume and Year of Edition
5th Edition, Addison-Wesley, 2008.
Volume and Year of Edition
4th edition, Pearson Education, 2011.
2 nd Edition, Pearson Education, 2001.
Addison-Wesley 1997.
SRI SIDDHARTHA INSTITUTE OF TECHNOLOGY(A constituent College of Siddhartha Academy of Hi
Computer Science and Engineering
Syllabus for the Academic Year
Department:Computer Science and Subject Name: COMPUTER GRAPHICS AND VISUALIZATION LAB
Subject Code: CS6L01
Course Objectives:
Course Outcomes:
Sl.No Course Objectives
1 An understanding of different OpenGL functions and their implementations.
2 Knowledge to develop a simple graphics package
Course outcome
Descriptions
CO1 Implement graphics
CO2 Develop simple graphics package with OpenGL
SRI SIDDHARTHA INSTITUTE OF TECHNOLOGY- TUMAKURU(A constituent College of Siddhartha Academy of Higher Education, Tumakuru)
Computer Science and Engineering
Syllabus for the Academic Year – 2019 - 2020
cience and Engineering
COMPUTER GRAPHICS AND VISUALIZATION LAB
L-T
Course Objectives
An understanding of different OpenGL functions and their implementations.
Knowledge to develop a simple graphics package
Descriptions
Implement graphics programs using C++ and OpenGL.
Develop simple graphics package with OpenGL
TUMAKURU gher Education, Tumakuru)
2020
Semester: 6
COMPUTER GRAPHICS AND VISUALIZATION LAB
T-P-C: 0-0-3-0-1.5
An understanding of different OpenGL functions and their
programs using C++ and OpenGL.
SRI SIDDHARTHA INSTITUTE OF TECHNOLOGY(A constituent College of Siddhartha Academy of Hi
Computer Science and Engineering
Lab cycles
I
1. Write a program to demonstrate the OpenGL primitives.2. Write a program to demonstrate the plotting of implicit functions with marching squares technique. 3. Write a simple CAD program to model the polygons as follows: i) Creating 2D polygons. ii)Selection of a Polygon. Iii) Deletion of a polygon. 4. Write a Program to recursively subdivides a tetrahedron to from 3D Sierpinski gasket. The number of recursive steps is to be specified by the user. 5. Write a Program to implement Bresenham’s line drawing algorithm.
II
6.Write a Program for drawing Bezier curves.7.Program to draw a color cube and spin it using OpenGL transformation matrices8. Program to create a house like figure and rotate it about a given fixed point using OpenGL functions9. Program to create a cylinder and a parallelepiped by extruding a circle and quadrilateral Respectively. Allow and the quadrilateral 10. Program to draw a color cube and allow the user to move the camera suitably to experiment with perspective viewing. Use OpenGL functions.
III Develop a suitable Graphics package to theory and the exercises indicated in above cycle. Use the OpenGL.
Pattern for practical exam conduction:
In the examination, a student has to execute one program (Among 10 programs) for 30 marks. Project demo for
SRI SIDDHARTHA INSTITUTE OF TECHNOLOGY- TUMAKURU(A constituent College of Siddhartha Academy of Higher Education, Tumakuru)
Computer Science and Engineering
Description
1. Write a program to demonstrate the OpenGL primitives.2. Write a program to demonstrate the plotting of implicit functions with
squares technique. 3. Write a simple CAD program to model the polygons as follows:
i) Creating 2D polygons. ii)Selection of a Polygon. Iii) Deletion of a polygon.
4. Write a Program to recursively subdivides a tetrahedron to from 3Dski gasket. The number of recursive steps is to be specified by
5. Write a Program to implement Bresenham’s line drawing algorithm.
6.Write a Program for drawing Bezier curves. 7.Program to draw a color cube and spin it using OpenGL
transformation matrices 8. Program to create a house like figure and rotate it about a given fixed
point using OpenGL functions 9. Program to create a cylinder and a parallelepiped by extruding a circle
and quadrilateral Respectively. Allow the user to specify the circleand the quadrilateral
10. Program to draw a color cube and allow the user to move the camerasuitably to experiment with perspective viewing. Use OpenGL
Develop a suitable Graphics package to implement the skills learnt in the theory and the exercises indicated in above cycle. Use the OpenGL.
Pattern for practical exam conduction:
In the examination, a student has to execute one program (Among 10 programs) for Project demo for 20 marks
TUMAKURU gher Education, Tumakuru)
1. Write a program to demonstrate the OpenGL primitives. 2. Write a program to demonstrate the plotting of implicit functions with
3. Write a simple CAD program to model the polygons as follows:
4. Write a Program to recursively subdivides a tetrahedron to from 3D ski gasket. The number of recursive steps is to be specified by
5. Write a Program to implement Bresenham’s line drawing algorithm.
7.Program to draw a color cube and spin it using OpenGL
8. Program to create a house like figure and rotate it about a given fixed
9. Program to create a cylinder and a parallelepiped by extruding a circle the user to specify the circle
10. Program to draw a color cube and allow the user to move the camera suitably to experiment with perspective viewing. Use OpenGL
implement the skills learnt in the theory and the exercises indicated in above cycle. Use the OpenGL.
In the examination, a student has to execute one program (Among 10 programs) for
SRI SIDDHARTHA INSTITUTE OF TECHNOLOGY(A constituent College of Siddhartha Academy of Hi
Computer Science and Engineering
Syllabus for the Academic Year
Department: Computer Science and Engineering Subject Name: System Programming Lab
Subject Code: CS6L02 L
Course Objectives:
Course Outcomes:
Lab cycles
I
Execute the following programs using LEX:
1. Program to count the number of characters, words, spaces and lines in a given input file.
2. Program to count the number of comment lines in a given C program. Also eliminate them and cfile.
3. Program to recognize a valid arithmetic expression and print the operators and operands present in the expression separately.
4. Program to recognize whether a given sentence is simple or compound.
5. Program thspaces by a single blank.
Sl.No Course Objectives
1 Make students familiar with Lexical Analysis and Syntax Analysis phases of Compiler Design.
2 Implement the Concept of Scanners and Parsers using LEX & YACC tools
3
To acquire the implementation knowledge of gr
LEX & YACC tools.
Course outcome
Descriptions
CO1 Implement parser, scanner using LEX & YACC tools.
CO2 Acquire knowledge of soft computing fundamentals and to design system programs to solve real world problems.
SRI SIDDHARTHA INSTITUTE OF TECHNOLOGY- TUMAKURU(A constituent College of Siddhartha Academy of Higher Education, Tumakuru)
Computer Science and Engineering
Syllabus for the Academic Year – 2019 - 2020
Department: Computer Science and Engineering Semester: 6
Subject Name: System Programming Lab
Subject Code: CS6L02 L-T-
Description
Execute the following programs using LEX:
Program to count the number of characters, words, spaces and lines in a given input file.
Program to count the number of comment lines in a given C program. Also eliminate them and copy the resulting program into a separate
Program to recognize a valid arithmetic expression and print the operators and operands present in the expression separately.
Program to recognize whether a given sentence is simple or compound.
Program that copies a file, replacing each nonempty sequence of white spaces by a single blank.
Course Objectives
Make students familiar with Lexical Analysis and Syntax Analysis phases of Compiler Design.
Implement the Concept of Scanners and Parsers using LEX & YACC tools
To acquire the implementation knowledge of grammar concepts through
LEX & YACC tools.
Descriptions
Implement parser, scanner using LEX & YACC tools.
Acquire knowledge of soft computing fundamentals and to design system programs to solve real world problems.
TUMAKURU gher Education, Tumakuru)
2020
Semester: 6
-P-S-C: 0-0-0-3-1.5
Program to count the number of characters, words, spaces and lines
Program to count the number of comment lines in a given C program. opy the resulting program into a separate
Program to recognize a valid arithmetic expression and print the operators and operands present in the expression separately.
Program to recognize whether a given sentence is simple or
at copies a file, replacing each nonempty sequence of white
Make students familiar with Lexical Analysis and Syntax Analysis phases
Implement the Concept of Scanners and Parsers using LEX & YACC tools
ammar concepts through
Acquire knowledge of soft computing fundamentals and to design system
SRI SIDDHARTHA INSTITUTE OF TECHNOLOGY(A constituent College of Siddhartha Academy of Hi
Computer Science and Engineering
II
Execute the following programs using YACC:
1. Program to recognize a valid variable which starts with a letter followed by any number of letters or digits.
2. Program to+, -, * and /.
3. Program to recognize the strings in the language { a
4. Program to a read Boolean expression as input, evaluate it and print the result as output.
5. Program to recognize
III
Compiler Design programs1. Design a Lexical analyzer for a simple C program using Lex tool.
2. Write a C program to implement recursive descent parser for the
arithmetic expression grammar.
3. Write a YACC progra
expression.
4. Write a YACC/C program to demonstrate Shift Reduce Parsing
technique for the language
{ anbn | n>= 0 }.
5. Write a C program to implement the syntax
E then S1” and “if
Compilers-
Sethi, Jeffrey D Ullman, Addison
Pattern for practical exam conduction:
In the examination, a student has to e50 marks.
SRI SIDDHARTHA INSTITUTE OF TECHNOLOGY- TUMAKURU(A constituent College of Siddhartha Academy of Higher Education, Tumakuru)
Computer Science and Engineering
Execute the following programs using YACC:
Program to recognize a valid variable which starts with a letter followed by any number of letters or digits.
Program to evaluate an arithmetic expression involving the operators , * and /.
Program to recognize the strings in the language { a
Program to a read Boolean expression as input, evaluate it and print the result as output.
Program to recognize strings of the form wcwR where w
Compiler Design programs Design a Lexical analyzer for a simple C program using Lex tool.
Write a C program to implement recursive descent parser for the
arithmetic expression grammar.
Write a YACC program to convert a given infix expression to postfix
expression.
Write a YACC/C program to demonstrate Shift Reduce Parsing
technique for the language
| n>= 0 }.
Write a C program to implement the syntax-directed definition of “if
E then S1” and “if E then S1 else S2”. (Refer Fig. 8.23 in the text book
- Principles, Techniques and Tools by Alfred V Aho, Ravi
Sethi, Jeffrey D Ullman, Addison-Wesley, 2007).
Pattern for practical exam conduction:
In the examination, a student has to execute one program from each part for a total of
TUMAKURU gher Education, Tumakuru)
Program to recognize a valid variable which starts with a letter
evaluate an arithmetic expression involving the operators
Program to recognize the strings in the language { anb | n>= 10}.
Program to a read Boolean expression as input, evaluate it and print
where w ∈ {a, b}*.
Design a Lexical analyzer for a simple C program using Lex tool.
Write a C program to implement recursive descent parser for the
m to convert a given infix expression to postfix
Write a YACC/C program to demonstrate Shift Reduce Parsing
directed definition of “if
E then S1 else S2”. (Refer Fig. 8.23 in the text book
Principles, Techniques and Tools by Alfred V Aho, Ravi
xecute one program from each part for a total of
SRI SIDDHARTHA INSTITUTE OF TECHNOLOGY(A constituent College of Siddhartha Academy of Hi
Computer Science and Engineering
Syllabus for the Academic Year
Department: Computer Science and Engineering Semester: 6 Subject Name: ARTIFICIAL INTELLIGENCE
Subject Code: CS6PE511
Course Objectives :
Course Outcomes:
Sl.No Course Objectives
1 To create appreciation and understanding of both the achievements of AI and the theory underlying those achievements
2 To impart basic proficiency in repspace representation so as to solve them using different AI techniques
3 To create an understanding of the basic issues of knowledge representation and heuristic search techniques
4 To solve problems us
Course outcome
Descriptions
CO1 Demonstrate the knowledge of building blocks of AI
CO2 Analyze and formalize the problem as a state space tree, design heuristics and solve using different search techniques.
CO3 Analyze and demonstrate knowledge representation using various techniques.
CO4 Develop AI solutions for a given problem.
SRI SIDDHARTHA INSTITUTE OF TECHNOLOGY- TUMAKURU(A constituent College of Siddhartha Academy of Higher Education, Tumakuru)
Computer Science and Engineering
Syllabus for the Academic Year – 2019 - 2020
Department: Computer Science and Engineering Semester: 6
ARTIFICIAL INTELLIGENCE
1 L-T-P-C:
Course Objectives
To create appreciation and understanding of both the achievements of AI and the theory underlying those achievements
To impart basic proficiency in representing real life problems in a state space representation so as to solve them using different AI techniques
To create an understanding of the basic issues of knowledge representation and heuristic search techniques
To solve problems using AI technique
Descriptions
Demonstrate the knowledge of building blocks of AI
Analyze and formalize the problem as a state space tree, design heuristics and solve using different search techniques.
lyze and demonstrate knowledge representation using various
Develop AI solutions for a given problem.
TUMAKURU gher Education, Tumakuru)
2020
Department: Computer Science and Engineering Semester: 6
C: 3-0-0-0-3
To create appreciation and understanding of both the achievements of AI
resenting real life problems in a state space representation so as to solve them using different AI techniques
To create an understanding of the basic issues of knowledge representation
Analyze and formalize the problem as a state space tree, design heuristics and solve using different search techniques.
lyze and demonstrate knowledge representation using various
SRI SIDDHARTHA INSTITUTE OF TECHNOLOGY(A constituent College of Siddhartha Academy of Hi
Computer Science and Engineering
UNIT
I
Introduction What is Artificial Intelligence?, AI Problems, The underlying Assumption, What is an AI TProblems, problem spaces, and search:Defining the problem as a State Space Search, Production Systems, Problem Characteristics, Production System Characteristics, Issues in the Design of search programs, Additional Problems.
II
Heuristic Search TechniquesGenerate-and-Test, Hill Climbing, BestReduction, Constraint satisfaction, Means
III
Knowledge representation IssuesRepresentation and Mappings, Approaches to knowledge Representation, IssueWeak Slot Filler Structures: Semantic Nets, Frames
IV
Using Predicate LogicRepresenting the simple facts in logic, Representing Instance and ISA Relationships, Computable functions and predicates, Resolution, Natural Deduction
V
Strong slot-and-Filter StructuresConceptual Dependency, Scripts, CYCExpert Systems Representation and Using Domain Knowledge, Expert Systems shells, Explanation, Knowledge Acquisition
Question paper Pattern:
From each unit two questions of 20 marks each have to be given. The student has to answer one full question of his/her choice.
SRI SIDDHARTHA INSTITUTE OF TECHNOLOGY- TUMAKURU(A constituent College of Siddhartha Academy of Higher Education, Tumakuru)
Computer Science and Engineering
Description
What is Artificial Intelligence?, AI Problems, The underlying Assumption, What is an AI Technique, Problems, problem spaces, and search: Defining the problem as a State Space Search, Production Systems, Problem Characteristics, Production System Characteristics, Issues in the Design of search programs, Additional Problems.
ic Search Techniques Test, Hill Climbing, Best-First Search, Problem
Reduction, Constraint satisfaction, Means-Ends Analysis
Knowledge representation Issues Representation and Mappings, Approaches to knowledge Representation, Issues in knowledge Representation, Weak Slot Filler Structures: Semantic Nets, Frames
Using Predicate Logic Representing the simple facts in logic, Representing Instance and ISA Relationships, Computable functions and predicates, Resolution,
Filter Structures Conceptual Dependency, Scripts, CYC
Representation and Using Domain Knowledge, Expert Systems shells, Explanation, Knowledge Acquisition
wo questions of 20 marks each have to be given. The student has to answer one full question of his/her choice.
TUMAKURU gher Education, Tumakuru)
Hours
What is Artificial Intelligence?, AI Problems, The underlying
Defining the problem as a State Space Search, Production Systems, Problem Characteristics, Production System Characteristics, Issues in
8
First Search, Problem
8
Representation and Mappings, Approaches to knowledge 8
Representing the simple facts in logic, Representing Instance and ISA Relationships, Computable functions and predicates, Resolution,
8
Representation and Using Domain Knowledge, Expert Systems shells,
7
wo questions of 20 marks each have to be given. The student has to
SRI SIDDHARTHA INSTITUTE OF TECHNOLOGY(A constituent College of Siddhartha Academy of Hi
Computer Science and Engineering
Text Books:
Sl No
Text Book title
1 Elaine Rich, Kevin Knight, Shivashankar B Nair
Reference Books:
Sl No
Text Book title
1 Artificial Intelligence A Modern Approach
2 Principles of Artificial Intelligence
SRI SIDDHARTHA INSTITUTE OF TECHNOLOGY- TUMAKURU(A constituent College of Siddhartha Academy of Higher Education, Tumakuru)
Computer Science and Engineering
Text Book title Author Volume and Year of Edition
Elaine Rich, Kevin Knight, Nair
Artificial Intelligence
3rd Edition, Tata McGraw Hill publication, 2017
Text Book title Author Volume and Year of Edition
Artificial Intelligence A Modern Stuart Russel, Peter Norvig
2nd
Education, 2003
Principles of Artificial Intelligence Nils J. Nilsson Elsevier, 1980
TUMAKURU gher Education, Tumakuru)
Volume and Year of Edition
3rd Edition, Tata McGraw Hill publication, 2017
Volume and Year of Edition
nd Edition, Pearson Education, 2003
Elsevier, 1980
SRI SIDDHARTHA INSTITUTE OF TECHNOLOGY(A constituent College of Siddhartha Academy of Hi
Computer Science and Engineering
Syllabus for the Academic Year
Department: Computer Science and engineering Subject Name: DATA MINING AND DATA WEARHOU
Subject Code: CS6PE512
Course Objectives :
Course Outcomes
Sl.No Course Objectives
1 Knowledge of data warehousing and data mining.
2 Understanding of association analysis and classific
3 Analyzation of various clustering techniques and their application.
4 Understanding the importance of web mining in data mining.
Course outcome
Descriptions
CO1 Demonstrate the concepts of data mining, data warehousing , OLand Web Mining.
CO2 Apply relevant data mining functionalities for a given application.
CO3 Illustrate the suitability of different Mining techniques for variety of problems.
CO4 Implement data presolution for a given problem.
SRI SIDDHARTHA INSTITUTE OF TECHNOLOGY- TUMAKURU(A constituent College of Siddhartha Academy of Higher Education, Tumakuru)
Computer Science and Engineering
Syllabus for the Academic Year – 2019 - 2020
Department: Computer Science and engineering
DATA MINING AND DATA WEARHOUSING
Course Objectives
Knowledge of data warehousing and data mining.
Understanding of association analysis and classification.
Analyzation of various clustering techniques and their application.
Understanding the importance of web mining in data mining.
Descriptions
Demonstrate the concepts of data mining, data warehousing , OLand Web Mining.
Apply relevant data mining functionalities for a given application.
Illustrate the suitability of different Mining techniques for variety of
Implement data pre- processing and mining algorithms to obtain for a given problem.
TUMAKURU gher Education, Tumakuru)
2020
Semester: 6
L-T-P-C: 3-0-0-0-3
Analyzation of various clustering techniques and their application.
Understanding the importance of web mining in data mining.
Demonstrate the concepts of data mining, data warehousing , OLAP
Apply relevant data mining functionalities for a given application.
Illustrate the suitability of different Mining techniques for variety of
processing and mining algorithms to obtain
SRI SIDDHARTHA INSTITUTE OF TECHNOLOGY(A constituent College of Siddhartha Academy of Hi
Computer Science and Engineering
UNIT
I
Data Warehousing and Online Analytical Processing (OLAPIntroduction, Operational Data Stores (ODS), Extraction Transformation Loading (ETL), Data Warehouses. Design Issues, Guidelines for Data WarehMetadata Introduction, Characteristics of OLAP systems, Multidimensional view and Data cube, Data Cube Implementations, Data Cube operations, Implementation of OLAP and overview on OLAP Softwares.
II
Data Mining and Association Analysis: Basic Concepts and Algorithms Introduction, Challenges, Data Mining Tasks, Types of Data, Data Preprocessing, Measures of Similarity and Dissimilarity, Data Mining Applications Frequent Itemset Generation, Rule Generation, ComRepresentation of Frequent Itemsets, Alternative methods for generating Frequent Itemsets, FP Growth Algorithm, Evaluation of Association Patterns
III
Classification -1 and Classification Basics, General approach to solve classificatiTrees, Rule Based Classifiers, Nearest Neighbor Classifiers.Bayesian Classifiers, Estimating Predictive accuracy of classification methods, Improving accuracy of clarification methods, Evaluation criteria for classification methods, M
IV
Clustering Techniques Overview, Features of cluster analysis, Types of Data and Computing Distance, Types of Cluster Analysis Methods, Partitional Methods, Hierarchical Methods, Density Based Methods, Quality and ValidCluster Analysis
V
Web Mining Introduction, Web content mining, Text Mining, Unstructured Text, Text clustering, Mining Spatial and Temporal Databases.
Question paper Pattern:
From each unit, two questions of 20 marks each hhas to answer one full question of his/her choice
SRI SIDDHARTHA INSTITUTE OF TECHNOLOGY- TUMAKURU(A constituent College of Siddhartha Academy of Higher Education, Tumakuru)
Computer Science and Engineering
Description
Data Warehousing and Online Analytical Processing (OLAPIntroduction, Operational Data Stores (ODS), Extraction Transformation Loading (ETL), Data Warehouses. Design Issues, Guidelines for Data Warehouse Implementation, Data Warehouse
Introduction, Characteristics of OLAP systems, Multidimensional view and Data cube, Data Cube Implementations, Data Cube operations, Implementation of OLAP and overview on OLAP Softwares.
and Association Analysis: Basic Concepts and
Introduction, Challenges, Data Mining Tasks, Types of Data, Data Preprocessing, Measures of Similarity and Dissimilarity, Data Mining
Frequent Itemset Generation, Rule Generation, ComRepresentation of Frequent Itemsets, Alternative methods for generating Frequent Itemsets, FP Growth Algorithm, Evaluation of Association Patterns
1 and Classification - 2
Basics, General approach to solve classification problem, Decision Trees, Rule Based Classifiers, Nearest Neighbor Classifiers.Bayesian Classifiers, Estimating Predictive accuracy of classification methods, Improving accuracy of clarification methods, Evaluation criteria for classification methods, Multiclass Problem.
Clustering Techniques Overview, Features of cluster analysis, Types of Data and Computing Distance, Types of Cluster Analysis Methods, Partitional Methods, Hierarchical Methods, Density Based Methods, Quality and Valid
Introduction, Web content mining, Text Mining, Unstructured Text, Text clustering, Mining Spatial and Temporal Databases.
From each unit, two questions of 20 marks each have to be given , the student has to answer one full question of his/her choice
TUMAKURU gher Education, Tumakuru)
Hours
Data Warehousing and Online Analytical Processing (OLAP) Introduction, Operational Data Stores (ODS), Extraction Transformation Loading (ETL), Data Warehouses. Design Issues,
ouse Implementation, Data Warehouse
Introduction, Characteristics of OLAP systems, Multidimensional view and Data cube, Data Cube Implementations, Data Cube operations,
8
and Association Analysis: Basic Concepts and
Introduction, Challenges, Data Mining Tasks, Types of Data, Data Preprocessing, Measures of Similarity and Dissimilarity, Data Mining
Frequent Itemset Generation, Rule Generation, Compact Representation of Frequent Itemsets, Alternative methods for generating Frequent Itemsets, FP Growth Algorithm, Evaluation of
9
on problem, Decision Trees, Rule Based Classifiers, Nearest Neighbor Classifiers. Bayesian Classifiers, Estimating Predictive accuracy of classification methods, Improving accuracy of clarification methods, Evaluation
8
Overview, Features of cluster analysis, Types of Data and Computing Distance, Types of Cluster Analysis Methods, Partitional Methods, Hierarchical Methods, Density Based Methods, Quality and Validity of
7
Introduction, Web content mining, Text Mining, Unstructured Text,
7
ave to be given , the student
SRI SIDDHARTHA INSTITUTE OF TECHNOLOGY(A constituent College of Siddhartha Academy of Hi
Computer Science and Engineering
Text Books:
Sl No
Text Book title
1 Introduction to Data Mining
2 Introduction to Data Mining with Case Studies
Reference Books:
Sl No Text Book title
Author
1 DataMining Techniques
Arun K Pujari
2 Data Mining - Concepts and Techniques
Jiawei Han and MichelineKamber
3 Data Warehousing, Data Mining, and OLAP Computing
Alex Berson and Stephen J. Smith:
SRI SIDDHARTHA INSTITUTE OF TECHNOLOGY- TUMAKURU(A constituent College of Siddhartha Academy of Higher Education, Tumakuru)
Computer Science and Engineering
Text Book title Author
Introduction to Data Mining Pang-Ning Tan, Michael Steinbach, Vipin Kumar
Introduction to Data Mining with G. K. Gupta
Author Volume and Year of Edition
Arun K Pujari University Press, 2nd Edition, 2009, ISBN 10: 81737167223716720
Jiawei Han and MichelineKamber
2nd Edition, Morgan Kaufmann Publisher, 2006, ISBN1558609013
ISBN-10: 1558609016
Alex Berson and Stephen J. Smith:
McGrawHill Publisher, 1997, ISBN0070062722
ISBN-13: 978-0070062726
TUMAKURU gher Education, Tumakuru)
Volume and Year of Edition
Addison-Wesley ,2008, ISBN: 0-32-134136-7
3rd Edition, PHI, New Delhi ,2009, ISBN 10: 8120350022 ISBN 13: 9788120350021
and Year of Edition
University Press, 2nd Edition, 2009, 8173716722 ISBN 13: 978817
Edition, Morgan Kaufmann ISBN-13: 978-
10: 1558609016
McGrawHill Publisher, 1997, ISBN-10:
0070062726
SRI SIDDHARTHA INSTITUTE OF TECHNOLOGY(A constituent College of Siddhartha Academy of Hi
Computer Science and Engineering
Syllabus for the Academic Year 2019
Department:Computer Science & Engineering Subject Name:Python Programming Subject Code: CS6PE513
Course Objectives:
Course Outcomes:
Sl.No Course Objectives
1 Learn the procedure of Python interpreter installation and its working.
2 Understand the concepts of conditional and loop statements.
3 Implement built-in and user defined functions
4 Build and execute lists, tuples, dictionaries and sets in Python
Course outcome
Descriptions
CO1
Explain the Python syntax
and iterations.
CO2 Explicate the type of operators, built
CO3 Analyze and Design Python programs using List and object concepts.
CO4
Create, run and manipulate the Python progr
structures like tuples, dictionaries and sets.
SRI SIDDHARTHA INSTITUTE OF TECHNOLOGY- TUMAKURU(A constituent College of Siddhartha Academy of Higher Education, Tumakuru)
Computer Science and Engineering
Syllabus for the Academic Year 2019 - 2020
tment:Computer Science & Engineering Semester: 6
Subject Name:Python Programming
L-T-P-S
Course Objectives
Learn the procedure of Python interpreter installation and its working.
Understand the concepts of conditional and loop statements.
in and user defined functions
Build and execute lists, tuples, dictionaries and sets in Python
Descriptions
Explain the Python syntax and be fluent in the use of Python flow control
Explicate the type of operators, built-in libraries and functions.
Analyze and Design Python programs using List and object concepts.
Create, run and manipulate the Python programs using core data
structures like tuples, dictionaries and sets.
TUMAKURU gher Education, Tumakuru)
2020
Semester: 6
S-C: 3-0-0-0-3
Learn the procedure of Python interpreter installation and its working.
Understand the concepts of conditional and loop statements.
Build and execute lists, tuples, dictionaries and sets in Python
and be fluent in the use of Python flow control
in libraries and functions.
Analyze and Design Python programs using List and object concepts.
ams using core data
SRI SIDDHARTHA INSTITUTE OF TECHNOLOGY(A constituent College of Siddhartha Academy of Hi
Computer Science and Engineering
UNIT
I
The Context of Software Development
About Python, Installing Python, The Python Interpreter, Python
editors and IDEs, Learning Programming with Python, Writin
Program, A Longer Python program,
Values and Variables
Integer Values, Variables and Assignment, Identifiers, Floating
Types, Control Codes within Strings ,User Input, The eval Function
Controlling the print Function.
Expressions and Arith
Expressions ,Operator Precedence and Associativity, Comments,
Errors, Syntax Errors, Run
Examples, More Arithmetic Operators, Algorithms.
II
Conditional Execution
Boolean Expressions, Boolean Expressions, The
The if/else Statement, Compound Boolean Expressions, Nested
Conditionals, Multi-
Errors in Conditional Statements.
Iteration
The while Statement, Definite Loops vs. Indefinite Loops, The
Statement, Nested Loops, Abnormal Loop Termination, The break
statement, The continue Statement,Infinite Loops, Iteration Examples,
Computing Square Root, Drawing a Tree, Printing Prime Numbers,
Insisting on the Proper Input .
III
Using Functions
Introduction to Using Functions, Standard Mathematical Functions,
time Functions, Random Numbers, Importing Issues.
Writing Functions
Function Basics, Using Functions, Main Function, Parameter Passing,
Function Examples, Better Organized Prime Generator,
Interpreter ,Restricted Input, Better Die Rolling Simulator, Tree
Drawing Function , Floating
Standard Functions.
More on Functions
Global Variables, Default Parameters, Recursion, Making
FunctionsReusable, Doc
as Data
SRI SIDDHARTHA INSTITUTE OF TECHNOLOGY- TUMAKURU(A constituent College of Siddhartha Academy of Higher Education, Tumakuru)
Computer Science and Engineering
Description
The Context of Software Development
About Python, Installing Python, The Python Interpreter, Python
editors and IDEs, Learning Programming with Python, Writin
Program, A Longer Python program,
Values and Variables
Integer Values, Variables and Assignment, Identifiers, Floating
Types, Control Codes within Strings ,User Input, The eval Function
Controlling the print Function.
Expressions and Arithmetic
Expressions ,Operator Precedence and Associativity, Comments,
Errors, Syntax Errors, Run-time Errors, Logic Errors, Arithmetic
Examples, More Arithmetic Operators, Algorithms.
Conditional Execution
Boolean Expressions, Boolean Expressions, The Simple if Statement
The if/else Statement, Compound Boolean Expressions, Nested
-way Decision Statements, Conditional Expressions,
Errors in Conditional Statements.
The while Statement, Definite Loops vs. Indefinite Loops, The
Statement, Nested Loops, Abnormal Loop Termination, The break
statement, The continue Statement,Infinite Loops, Iteration Examples,
Computing Square Root, Drawing a Tree, Printing Prime Numbers,
Insisting on the Proper Input .
Introduction to Using Functions, Standard Mathematical Functions,
time Functions, Random Numbers, Importing Issues.
Function Basics, Using Functions, Main Function, Parameter Passing,
Function Examples, Better Organized Prime Generator,
Interpreter ,Restricted Input, Better Die Rolling Simulator, Tree
Drawing Function , Floating-point Equality , Custom Functions vs.
Standard Functions.
Global Variables, Default Parameters, Recursion, Making
FunctionsReusable, Documenting Functions and Modules, Functions
TUMAKURU gher Education, Tumakuru)
Hours
About Python, Installing Python, The Python Interpreter, Python
editors and IDEs, Learning Programming with Python, Writing a Python
Integer Values, Variables and Assignment, Identifiers, Floating-point
Types, Control Codes within Strings ,User Input, The eval Function
Expressions ,Operator Precedence and Associativity, Comments,
time Errors, Logic Errors, Arithmetic
7
Simple if Statement
The if/else Statement, Compound Boolean Expressions, Nested
way Decision Statements, Conditional Expressions,
The while Statement, Definite Loops vs. Indefinite Loops, The for
Statement, Nested Loops, Abnormal Loop Termination, The break
statement, The continue Statement,Infinite Loops, Iteration Examples,
Computing Square Root, Drawing a Tree, Printing Prime Numbers,
8
Introduction to Using Functions, Standard Mathematical Functions,
Function Basics, Using Functions, Main Function, Parameter Passing,
Function Examples, Better Organized Prime Generator, Command
Interpreter ,Restricted Input, Better Die Rolling Simulator, Tree
point Equality , Custom Functions vs.
Global Variables, Default Parameters, Recursion, Making
umenting Functions and Modules, Functions
8
SRI SIDDHARTHA INSTITUTE OF TECHNOLOGY(A constituent College of Siddhartha Academy of Hi
Computer Science and Engineering
IV
Lists
Motivation, List Structures, Lists (Sequences) in Python, Iterating Over
Lists (Sequences) in Python, More on Python Lists.
Dictionaries and Sets
Motivation, Dictionary Type in Python, Set Data
V
Objects
Using Objects, String Objects, List Objects
Text Files
Motivation, What Is a Text File?, Using Text Files, String Processing,
Exception Handling
Question paper Pattern:
From each unit, two questions of 20 marks each have to be givenhas to answer one full question of his/her choice.
Text Books:
Sl No
Text Book title
1 Learning To Program With Python
2 Introduction to Computer Science
Using Python: A Computational
Problem-Solving Focus
Reference Books:
Sl No
Text Book title
1 Think Python
2 Learning Python
SRI SIDDHARTHA INSTITUTE OF TECHNOLOGY- TUMAKURU(A constituent College of Siddhartha Academy of Higher Education, Tumakuru)
Computer Science and Engineering
otivation, List Structures, Lists (Sequences) in Python, Iterating Over
Lists (Sequences) in Python, More on Python Lists.
Dictionaries and Sets
Motivation, Dictionary Type in Python, Set Data Type.
Using Objects, String Objects, List Objects
Motivation, What Is a Text File?, Using Text Files, String Processing,
From each unit, two questions of 20 marks each have to be givenhas to answer one full question of his/her choice.
Text Book title Author Volume and Year of Edition
Learning To Program With Python Richard L.
Halterman
Copyright © 2011 Richard
L. Halterman , P
by alkaline123
Introduction to Computer Science
Using Python: A Computational
Solving Focus
Charles Dierbach Copyright © 2013 Jhon
Wiley & Sons, Inc.
Publications.
Text Book title Author Volume and Year of Edition
Think Python Version 2.0.15 March
2015, Green Tea Press
B.Nagesh Rao Copyright © 2016
cyberplus publication
TUMAKURU gher Education, Tumakuru)
otivation, List Structures, Lists (Sequences) in Python, Iterating Over
8
Motivation, What Is a Text File?, Using Text Files, String Processing, 8
From each unit, two questions of 20 marks each have to be given, the student
Volume and Year of Edition
Copyright © 2011 Richard
L. Halterman , Published
by alkaline123
Copyright © 2013 Jhon
Wiley & Sons, Inc.
Publications.
olume and Year of Edition
Version 2.0.15 March
2015, Green Tea Press
Copyright © 2016 – 17 A
cyberplus publication
SRI SIDDHARTHA INSTITUTE OF TECHNOLOGY(A constituent College of Siddhartha Academy of Hi
Computer Science and Engineering
Syllabus for the Academic Year Syllabus for the Academic Year Syllabus for the Academic Year Syllabus for the Academic Year
Department: Computer Science and Engineering Subject Name: Distributed Operating System
Subject Code: CS6PE514
Course Objectives :
Course Outcomes
Sl.No Course Objectives
1 To study the concepts of Distributed Operating System.
2 To study the concepts of remote procedure calls and message passing mechanisms used in Distributed Operating System.
3 To gain knowledge on distributed concepts that includes architecture, synchronization algorithms and deadlock handling algorithms
4 To know the concepts of distributed shared memory
Course outcome
Descriptions
CO1 Outline the concepts and des
CO2 Describe the various process communication mechanisms in distributed environment.
CO3 Discuss process critical issues in distributed operating system.
CO4 Interpret the mechanisms adopted for distributed share
SRI SIDDHARTHA INSTITUTE OF TECHNOLOGY- TUMAKURU(A constituent College of Siddhartha Academy of Higher Education, Tumakuru)
Computer Science and Engineering
Syllabus for the Academic Year Syllabus for the Academic Year Syllabus for the Academic Year Syllabus for the Academic Year –––– 2019 2019 2019 2019 ---- 2020202020202020
Computer Science and Engineering Semester:
Distributed Operating System
4 L-3 T
Course Objectives
To study the concepts of Distributed Operating System.
To study the concepts of remote procedure calls and message passing mechanisms used in Distributed Operating System.
To gain knowledge on distributed operating system concepts that includes architecture, synchronization algorithms and deadlock handling algorithms
To know the concepts of distributed shared memory
Descriptions
Outline the concepts and design principles of distributed systems.
Describe the various process communication mechanisms in distributed environment.
Discuss process critical issues in distributed operating system.
Interpret the mechanisms adopted for distributed share
TUMAKURU gher Education, Tumakuru)
Semester: 6
T-0 P-0 C-3
To study the concepts of Distributed Operating
To study the concepts of remote procedure calls and message passing mechanisms used in Distributed
operating system concepts that includes architecture, synchronization algorithms and deadlock handling algorithms
To know the concepts of distributed shared memory
ign principles of distributed systems.
Describe the various process communication mechanisms in
Discuss process critical issues in distributed operating system.
Interpret the mechanisms adopted for distributed shared memory.
SRI SIDDHARTHA INSTITUTE OF TECHNOLOGY(A constituent College of Siddhartha Academy of Hi
Computer Science and Engineering
UNIT
I
Fundamentals: What is Distributed Computing System?, Why are Distributed System gaining popularity?, Distributed Computing System Models, What is Distributed Operating System?, Issues in Designing a Distributed Opera
II
Message Passing :Desirable Issues of s Good Message Passing, Issues in IPC by Message Passing, Synchronization, Buffering, Multidatagram Messages, Encoding and Decoding of Message Data, Process Addressing, Failure Handling.
III
Remote Procedure Calls: The RPC Model, Transparency of RPC, Implementing RPC Mechanism, Stub Generation, RPC Messages, Marshaling Arguments and Results. Server Management, Parameter Passing Semantics, Call semantics, CommRPCs, Complicated RPCs, Client
IV
Synchronization: Clock Synchronization, Centralized and Distributed clock synchronization algorithms., Dead Lock : modeling, handling dead locks.
V
Distributed Shared Memory: General Architecture of DSM Systems, Design and Implementation Issues of DSM. Granularity, Structure of Shared Memory Space, Replacement Strategy, Thrashing .
Question paper Pattern:
Two questions of 20 marks answer any one full question of his/her choice.
SRI SIDDHARTHA INSTITUTE OF TECHNOLOGY- TUMAKURU(A constituent College of Siddhartha Academy of Higher Education, Tumakuru)
Computer Science and Engineering
Description
Fundamentals: What is Distributed Computing System?, Why are Distributed System gaining popularity?, Distributed Computing System Models, What is Distributed Operating System?, Issues in Designing a Distributed Operating System,
Message Passing :Desirable Issues of s Good Message Passing, Issues in IPC by Message Passing, Synchronization, Buffering, Multidatagram Messages, Encoding and Decoding of Message Data, Process Addressing, Failure Handling.
Remote Procedure Calls: The RPC Model, Transparency of RPC, Implementing RPC Mechanism, Stub Generation, RPC Messages, Marshaling Arguments and Results. Server Management, Parameter Passing Semantics, Call semantics, Communication Protocols for RPCs, Complicated RPCs, Client-Server Binding.
Synchronization: Clock Synchronization, Centralized and Distributed clock synchronization algorithms., Dead Lock : modeling, handling
Distributed Shared Memory: General Architecture of DSM Systems, Design and Implementation Issues of DSM. Granularity, Structure of Shared Memory Space, Replacement Strategy, Thrashing .
Two questions of 20 marks will be given from each unit. Student has to answer any one full question of his/her choice.
TUMAKURU gher Education, Tumakuru)
Hours
Fundamentals: What is Distributed Computing System?, Why are Distributed System gaining popularity?, Distributed Computing System Models, What is Distributed Operating System?, Issues in
8
Message Passing :Desirable Issues of s Good Message Passing, Issues in IPC by Message Passing, Synchronization, Buffering, Multidatagram Messages, Encoding and Decoding of Message Data, Process
7
Remote Procedure Calls: The RPC Model, Transparency of RPC, Implementing RPC Mechanism, Stub Generation, RPC Messages, Marshaling Arguments and Results. Server Management, Parameter -
unication Protocols for Server Binding.
8
Synchronization: Clock Synchronization, Centralized and Distributed clock synchronization algorithms., Dead Lock : modeling, handling
9
Distributed Shared Memory: General Architecture of DSM Systems, Design and Implementation Issues of DSM. Granularity, Structure of
7
will be given from each unit. Student has to
SRI SIDDHARTHA INSTITUTE OF TECHNOLOGY(A constituent College of Siddhartha Academy of Hi
Computer Science and Engineering
Text Books:
Sl No
Text Book title
1 Distributed Operating System: Concepts
and Design, ISBN-13: 978-8120313804
Reference Book:
Sl No
Text Book title
1 Distributed Operating System,
ISBN-13: 978-8177581799
SRI SIDDHARTHA INSTITUTE OF TECHNOLOGY- TUMAKURU(A constituent College of Siddhartha Academy of Higher Education, Tumakuru)
Computer Science and Engineering
Text Book title Author
Distributed Operating System: Concepts
8120313804
Pradeep. K. Sinha,
Text Book title Author
Distributed Operating System,
8177581799
Andrew S.
Tanenbaum,
TUMAKURU gher Education, Tumakuru)
Volume and Year of Edition
1st edition
Prentice Hall India
Learning Private
Limited.
Volume and Year of Edition
Edition 1
Pearson Education,
2002
SRI SIDDHARTHA INSTITUTE OF TECHNOLOGY(A constituent College of Siddhartha Academy of Hi
Computer Science and Engineering
Syllabus for the Academic Year Syllabus for the Academic Year Syllabus for the Academic Year Syllabus for the Academic Year
Department: Computer S Subject Name: Unix system
Subject Code: CS6PE515
Course Objectives :
Course Outcomes
Sl.No Course Objectives
1 Be familiar with basic UNIX OS
2 Understanding UNIX process, process groups, signals.
3 How to design communication between the process using IPCs.
4 Understanding the concept of RPC.
Course outcome
Descriptions
CO1 Identify and describe the
CO2 Develop solutions for managing the processes.
CO3 Illustrate the capability to handle the asynchronous events.
CO4 Implement the solutions for inter process communication.
SRI SIDDHARTHA INSTITUTE OF TECHNOLOGY- TUMAKURU(A constituent College of Siddhartha Academy of Higher Education, Tumakuru)
Computer Science and Engineering
Syllabus for the Academic Year Syllabus for the Academic Year Syllabus for the Academic Year Syllabus for the Academic Year –––– 2019201920192019---- 2020202020202020
Computer Science and Engineering
system programming
5
Course Objectives
Be familiar with basic UNIX OS concepts.
Understanding UNIX process, process groups, signals.
How to design communication between the process using IPCs.
Understanding the concept of RPC.
Descriptions
Identify and describe the features of UNIX operating system.
Develop solutions for managing the processes.
Illustrate the capability to handle the asynchronous events.
Implement the solutions for inter process communication.
TUMAKURU gher Education, Tumakuru)
Semester: 6
L-T-P-C: 3-0-0-0-3
Understanding UNIX process, process groups,
How to design communication between the process
features of UNIX operating system.
Illustrate the capability to handle the asynchronous events.
Implement the solutions for inter process communication.
SRI SIDDHARTHA INSTITUTE OF TECHNOLOGY(A constituent College of Siddhartha Academy of Hi
Computer Science and Engineering
UNIT
I
UNIX File APIs Inodes in UNIX System V, Application Program Interface to Files, UNIX Kernel support for files, Relationship of C Stream pointers and file descriptors. General File APIs, File and Record Locking.
II
UNIX Process and its Control Introduction, main function, Process Termination, CommandArguments, Environment List, Memory Layout of a C Program, Shared Libraries, Memory Allocation, Environment Variables, setjmp and longjmp Functions, getrlimit, setrlimit Functions. Introdufork, vfork, exit, wait, waitpid, Functions, Race Conditions, exec Functions, system Function.
III
Process Relationships and SignalsIntroduction, Terminal Logins, Network Logins, Process Group, Sessions, Controlling Terminal, Tcgetpgrp, tcsetpgrp and tcgetsid functions, Job Control. Signal Concepts, Signal function, Kill functions.
IV
Daemon Process, InteIntroduction, Daemon Characteristics, Coding Rules, Error Logging, ClientServer Model. Introduction, Pipes, popen and pclose functions, FIFOs, Shared memory, Message Queues,
V Socket Programming anexample using Socket APIs .
Question paper Pattern:
From each unit, two questions of 20 marks each have to be given, the student has to answer one full question of his/her choice.
SRI SIDDHARTHA INSTITUTE OF TECHNOLOGY- TUMAKURU(A constituent College of Siddhartha Academy of Higher Education, Tumakuru)
Computer Science and Engineering
Description
Inodes in UNIX System V, Application Program Interface to Files, UNIX Kernel support for files, Relationship of C Stream pointers and file descriptors. General File APIs, File and Record Locking.
UNIX Process and its Control Introduction, main function, Process Termination, Command
Arguments, Environment List, Memory Layout of a C Program, Shared Libraries, Memory Allocation, Environment Variables, setjmp and longjmp Functions, getrlimit, setrlimit Functions. Introduction, Process Identifiers, fork, vfork, exit, wait, waitpid, Functions, Race Conditions, exec Functions,
Process Relationships and Signals Introduction, Terminal Logins, Network Logins, Process Group, Sessions, Controlling Terminal, Tcgetpgrp, tcsetpgrp and tcgetsid functions, Job Control. Signal Concepts, Signal function, Kill functions.
Daemon Process, Inter Process Communication Introduction, Daemon Characteristics, Coding Rules, Error Logging, ClientServer Model. Introduction, Pipes, popen and pclose functions, FIFOs, Shared memory, Message Queues,
Socket Programming and Remote Procedure Calls Socket APIs, Simple example using Socket APIs .
From each unit, two questions of 20 marks each have to be given, the student has to answer one full question of his/her choice.
TUMAKURU gher Education, Tumakuru)
Hours
File Types, Inodes in UNIX System V, Application Program Interface to Files, UNIX Kernel support for files, Relationship of C Stream pointers and file descriptors.
8
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
ction, Process Identifiers, fork, vfork, exit, wait, waitpid, Functions, Race Conditions, exec Functions,
8
Introduction, Terminal Logins, Network Logins, Process Group, Sessions, Controlling Terminal, Tcgetpgrp, tcsetpgrp and tcgetsid functions, Job
7
Introduction, Daemon Characteristics, Coding Rules, Error Logging, Client-Server Model. Introduction, Pipes, popen and pclose functions, FIFOs,
8
Socket APIs, Simple
8
From each unit, two questions of 20 marks each have to be given, the student
SRI SIDDHARTHA INSTITUTE OF TECHNOLOGY(A constituent College of Siddhartha Academy of Hi
Computer Science and Engineering
Text Books:
Sl No
Text Book title
1 Unix System Programming Using C++
2 Advanced Programming in the UNIX Environment
Reference Book:
Sl No
Text Book title
1 The Design of the UNIX Operating System
2 Advanced Unix Programming
SRI SIDDHARTHA INSTITUTE OF TECHNOLOGY- TUMAKURU(A constituent College of Siddhartha Academy of Higher Education, Tumakuru)
Computer Science and Engineering
Text Book title Author Volume and Year of Edition
Unix System Programming Using Terrence Chan 2010
Advanced Programming in the
W.Richard Stevens 2nd Edition, 2005
Text Book title Author Volume and Year of Edition
The Design of the UNIX Operating Maurice.J.Bach 1987
Advanced Unix Programming Marc J. Rochkind 2nd Edition, 2005
TUMAKURU gher Education, Tumakuru)
Volume and Year of Edition
2010
2nd Edition, 2005
Volume and Year of Edition
1987
2nd Edition, 2005
SRI SIDDHARTHA INSTITUTE OF TECHNOLOGY(A constituent College of Siddhartha Academy of Hi
Computer Science and Engineering
Syllabus for the Academic Year Department : Computer Science and Subject Name: Object Oriented Programming with C++
Subject Code: CS6OE611
Course Objectives:
Course Outcomes
Sl.No Course Objectives
1 To learn the basic principles of objectan object-oriented programm
2 To understand the skillfulness of object oriented programming in developing solutions to problems demonstrating usage of data abstraction, encapsulation, inheritance and polymorphism
Course outcome
Descriptions
CO1 Map features of real world entities into class objects.
CO2 Design and implement object oriented solutions involving multiple objects.
CO3 Illustrate reusability of code through inheritance.
CO4 Design, Develop and implement classes to solve the real world
SRI SIDDHARTHA INSTITUTE OF TECHNOLOGY- TUMAKURU(A constituent College of Siddhartha Academy of Higher Education, Tumakuru)
Computer Science and Engineering
yllabus for the Academic Year – 2019 - 2020
Department : Computer Science and Engineering
Subject Name: Object Oriented Programming with C++
CS6OE611 L
Course Objectives
To learn the basic principles of object-oriented design and characteristics of oriented programming language.
To understand the skillfulness of object oriented programming in developing solutions to problems demonstrating usage of data abstraction, encapsulation, inheritance and polymorphism
Descriptions
features of real world entities into class objects.
Design and implement object oriented solutions involving multiple
Illustrate reusability of code through inheritance.
Design, Develop and implement classes to solve the real world
TUMAKURU gher Education, Tumakuru)
2020
Semester: 6
L-T-P-S-C: 3-0-0-0-3
oriented design and characteristics of
To understand the skillfulness of object oriented programming in developing solutions to problems demonstrating usage of data abstraction,
Design and implement object oriented solutions involving multiple
Design, Develop and implement classes to solve the real world problems.
SRI SIDDHARTHA INSTITUTE OF TECHNOLOGY(A constituent College of Siddhartha Academy of Hi
Computer Science and Engineering
UNIT
I
Principles of Object Oriented ProgrammingSoftware Evolution, A look at procedure oriented Programming, Object Oriented programming paradigm, Basic concepts of object oriented Programming, benefits of OOP, OApplications of OOP. Some C++ fundamentals, old style v/s modern C++, Namespaces, introducing C++ classes, constructors and destructors, C++ keywords, The general form of a C++ program, Classes, structures and classes are related,related.
II
Classes and Objects and Arrays Friend functions, Friend classes, Inline Functions, Parameterized Constructors, Static Class members, When constructors and destructors are executed, the scope resolution classes, Local classes, Passing objects to functions, returning objects, object assignment, Arrays of objects.
III
Pointers, References and the Dynamic Allocation Operators, Function Overloading, Copy Constructors and Default Argu pointers to objects, type checking C++ pointers, the ‘this’ pointer, Pointers to class members, References: reference parameters. C++ dynamic allocation operators: Initializing Allocated Memory, Allocating Arrays, Allocating Objects,Function overlconstructors, copy constructors, Default function arguments, Function overloading and ambiguity.
IV
Operator Overloading and InheritanceCreating member operator function, operator overloading using a friend function, overand >>, Base-class access control, Inheritance and protected members, inheriting multiple base classes, constructors, destructors and inheritance, granting access, virtual base classes
V
Virtual Function System Basics and C++ File I/O Virtual functions, the virtual attribute is inherited, Virtual functions are hierarchical, pure virtual function, using virtual functions, early v/s late binding. Geneclasses, Formatted I/O, <fstream> and the File classes, Opening and closing a file, reading and writing a text files.
SRI SIDDHARTHA INSTITUTE OF TECHNOLOGY- TUMAKURU(A constituent College of Siddhartha Academy of Higher Education, Tumakuru)
Computer Science and Engineering
Description
Principles of Object Oriented Programming Software Evolution, A look at procedure oriented Programming, Object Oriented programming paradigm, Basic concepts of object oriented Programming, benefits of OOP, Object Oriented Languages, Applications of OOP. Some C++ fundamentals, old style v/s modern C++, Namespaces, introducing C++ classes, constructors and destructors, C++ keywords, The general form of a C++ program, Classes, structures and classes are related, Union and Classes are
Classes and Objects and Arrays
Friend functions, Friend classes, Inline Functions, Parameterized Constructors, Static Class members, When constructors and destructors are executed, the scope resolution operator, Nested classes, Local classes, Passing objects to functions, returning objects, object assignment, Arrays of objects.
Pointers, References and the Dynamic Allocation Operators, Function Overloading, Copy Constructors and Default Argu
pointers to objects, type checking C++ pointers, the ‘this’ pointer, Pointers to class members, References: reference parameters. C++ dynamic allocation operators: Initializing Allocated Memory, Allocating Arrays, Allocating Objects,Function overloading, Overloading constructors, copy constructors, Default function arguments, Function overloading and ambiguity.
Operator Overloading and Inheritance Creating member operator function, operator overloading using a friend function, overloading some special operator. Overloading <<
class access control, Inheritance and protected members, inheriting multiple base classes, constructors, destructors and inheritance, granting access, virtual base classes
Virtual Function and Polymorphism, Templates, the C++ I/O System Basics and C++ File I/O
Virtual functions, the virtual attribute is inherited, Virtual functions are hierarchical, pure virtual function, using virtual functions, early v/s late binding. Generic functions, Generic Classes. The C++ stream classes, Formatted I/O, <fstream> and the File classes, Opening and closing a file, reading and writing a text files.
TUMAKURU gher Education, Tumakuru)
Hours
Software Evolution, A look at procedure oriented Programming, Object Oriented programming paradigm, Basic concepts of object oriented
bject Oriented Languages, Applications of OOP. Some C++ fundamentals, old style v/s modern C++, Namespaces, introducing C++ classes, constructors and destructors, C++ keywords, The general form of a C++ program,
Union and Classes are
7
Friend functions, Friend classes, Inline Functions, Parameterized Constructors, Static Class members, When constructors and
operator, Nested classes, Local classes, Passing objects to functions, returning objects,
8
Pointers, References and the Dynamic Allocation Operators, Function Overloading, Copy Constructors and Default Arguments
pointers to objects, type checking C++ pointers, the ‘this’ pointer, Pointers to class members, References: reference parameters. C++ dynamic allocation operators: Initializing Allocated Memory, Allocating
oading, Overloading constructors, copy constructors, Default function arguments,
8
Creating member operator function, operator overloading using a
loading some special operator. Overloading << class access control, Inheritance and protected
members, inheriting multiple base classes, constructors, destructors
8
and Polymorphism, Templates, the C++ I/O
Virtual functions, the virtual attribute is inherited, Virtual functions are hierarchical, pure virtual function, using virtual functions, early
ric functions, Generic Classes. The C++ stream classes, Formatted I/O, <fstream> and the File classes, Opening and
8
SRI SIDDHARTHA INSTITUTE OF TECHNOLOGY(A constituent College of Siddhartha Academy of Hi
Computer Science and Engineering
Question paper Pattern:
Two questions of 20 marks each will be given from each uone full question of his/her choice
Text Books:
Sl No
Text Book title
1 The Complete Reference C++
ISBN-13: 978-0070532465
2 Object Oriented Programming with C++
ISBN-13: 978-1259029936
Reference Books:
Sl No
Text Book title
1 C++ Primer
ISBN-13: 978-0672315916
2 Object-Oriented Programming in C++
ISBN-13: 978-8131722824
SRI SIDDHARTHA INSTITUTE OF TECHNOLOGY- TUMAKURU(A constituent College of Siddhartha Academy of Higher Education, Tumakuru)
Computer Science and Engineering
Two questions of 20 marks each will be given from each unit. Student has to answer one full question of his/her choice
Text Book title Author
The Complete Reference C++
0070532465
Herbert Schildt
Object Oriented Programming with
1259029936
E Balagurusamy:
Author
0672315916
Stanley B.Lippmann, JoseeLajore
Oriented Programming in
8131722824
Robert Lafore:
TUMAKURU gher Education, Tumakuru)
nit. Student has to answer
Volume and Year of Edition
5th Edition, Tata McGraw Hill, 2003.
5th Edition, McGraw Hill, 2011
Volume and Year of Edition
4th Edition, Pearson Education, 2005.
4th Edition, SAMS publication, 2002
SRI SIDDHARTHA INSTITUTE OF TECHNOLOGY(A constituent College of Siddhartha Academy of Hi
Computer Science and Engineering
Syllabus for the Academic Year
Department: Computer Science and Subject Name: SOFTWARE ENGINEERING
Subject Code: CS6OE612
Course Objectives :
Course Outcomes
Sl.No Course Objectives
1 Comprehend software process, procesengineering process.
2 Identify requirements engineering process and write the functional and nonfunctional requirements.
3 Explore various design and development concepts using structural, object oriented and rapid application.
4 Carryout software testing and formal verification and validation of software.
Course outcome
Descriptions
CO1 Implement professional and ethical responsibility of a software engineer.
CO2 Analyze and design client/
CO3 Design and development of software using structural, object oriented and rapid software development.
CO4 Test software using conventional verification and validation techniques and provide software quality assurance.
SRI SIDDHARTHA INSTITUTE OF TECHNOLOGY- TUMAKURU(A constituent College of Siddhartha Academy of Higher Education, Tumakuru)
Computer Science and Engineering
Syllabus for the Academic Year – 2019 - 2020
Department: Computer Science and Engineering
SOFTWARE ENGINEERING
2
Course Objectives
Comprehend software process, process models, activities involved in software engineering process.
Identify requirements engineering process and write the functional and nonfunctional requirements.
Explore various design and development concepts using structural, object apid application.
Carryout software testing and formal verification and validation of software.
Descriptions
Implement professional and ethical responsibility of a software engineer.
Analyze and design client/customer requirement.
Design and development of software using structural, object oriented and rapid software development.
Test software using conventional verification and validation techniques and provide software quality assurance.
TUMAKURU gher Education, Tumakuru)
2020
Semester: 6
L-T-P-C: 3-0-0-0-3
s models, activities involved in software
Identify requirements engineering process and write the functional and non-
Explore various design and development concepts using structural, object
Carryout software testing and formal verification and validation of software.
Implement professional and ethical responsibility of a software engineer.
Design and development of software using structural, object oriented and
Test software using conventional verification and validation techniques
SRI SIDDHARTHA INSTITUTE OF TECHNOLOGY(A constituent College of Siddhartha Academy of Hi
Computer Science and Engineering
UNIT
I
Overview: Introduction: FAQ's about software engineering, Professional and ethical responsibility.Socio-Technical systemsOrganizations, people and computer systems, Legacy systems.Software ProcessesRational Unified Process.
II
Requirements: Software Requirementsfunctional requirements, User requirements, System requirements,The software requirements document.Requirements EnRequirements elicitation and analysis, Requirements validation.
III System Models: Context models, Behavioral models, Data models, Object models.
IV
Software Design and Development : Architectural Desiorganization, Modular decomposition styles, Control styles. Rapid Software DevelopmentRapid application development.
V
Verification and ValidationSoftware inspections, Verification and formal methods.Software testing: System testing, Component testing, Test case design. Managing PeopleGroups.
Question paper Pattern:
From each unit, two questions of 20 marks each have to be given , the student has to answer one full question of his/her choice
SRI SIDDHARTHA INSTITUTE OF TECHNOLOGY- TUMAKURU(A constituent College of Siddhartha Academy of Higher Education, Tumakuru)
Computer Science and Engineering
Description
: FAQ's about software engineering, Professional and ethical responsibility.
Technical systems: Emergent system properties, Organizations, people and computer systems, Legacy systems.Software Processes: Models, Process iteration, Process activities, The Rational Unified Process.
Requirements: Software Requirements: Functional and Nonfunctional requirements, User requirements, System requirements,The software requirements document. Requirements Engineering Processes: Feasibility studies, Requirements elicitation and analysis, Requirements validation.
: Context models, Behavioral models, Data models,
Software Design and Development : Architectural Design: Architectural design decisions, System organization, Modular decomposition styles, Control styles.
Rapid Software Development: Agile methods, Extreme programming, Rapid application development.
Verification and Validation: Planning verification and validation, Software inspections, Verification and formal methods.
: System testing, Component testing, Test case
Managing People: Selecting Staff, Motivating People, Managing
rom each unit, two questions of 20 marks each have to be given , the student has to answer one full question of his/her choice
TUMAKURU gher Education, Tumakuru)
Hours
: FAQ's about software engineering, Professional and
: Emergent system properties, Organizations, people and computer systems, Legacy systems.
els, Process iteration, Process activities, The
9
: Functional and Non-functional requirements, User requirements, System
: Feasibility studies, Requirements elicitation and analysis, Requirements validation.
8
: Context models, Behavioral models, Data models, 6
: Architectural design decisions, System organization, Modular decomposition styles, Control styles.
: Agile methods, Extreme programming,
7
ification and validation,
: System testing, Component testing, Test case
: Selecting Staff, Motivating People, Managing
9
rom each unit, two questions of 20 marks each have to be given , the student
SRI SIDDHARTHA INSTITUTE OF TECHNOLOGY(A constituent College of Siddhartha Academy of Hi
Computer Science and Engineering
Text Books:
Sl No
Text Book title
1 Software Engineering, 8th Edition
Reference Books:
Sl No
Text Book title
1 Software EngineeringPractitioners approach
2 Software Engineering Theory and Practice
3 Waman S Jawadekar
SRI SIDDHARTHA INSTITUTE OF TECHNOLOGY- TUMAKURU(A constituent College of Siddhartha Academy of Higher Education, Tumakuru)
Computer Science and Engineering
Text Book title Author Volume and Year of Edition
Software Engineering, 8th Ian Sommerville Pearson EducationLtd., 2007,ISBN0321313798
Text Book title Author Volume and Year of Edition
Software Engineering-A Practitioners approach
Roger.S.Pressman 7thEdition, McGraw Hill,2007,978007337597
Software Engineering Theory Shari LawrencePfleeger, Joanne M. Atlee
3rdEdition, Pearson Education, 2006,ISBN1313
Waman S Jawadekar Software Engineering Principles and Practice
TataMcGraw Hill,2004,0070583714 ISBN 13: 9780070583719
TUMAKURU gher Education, Tumakuru)
Volume and Year of Edition
Pearson EducationLtd., 2007,ISBN-10: 0321313798
Volume and Year of Edition
7thEdition, McGraw ill,2007, ISBN
978007337597–7
3rdEdition, Pearson Education, 2006,ISBN-13: 978-0-13-146913-6, ISBN: 0-13-146913-4
TataMcGraw Hill,2004, ISBN 10: 0070583714 ISBN 13: 9780070583719
SRI SIDDHARTHA INSTITUTE OF TECHNOLOGY(A constituent College of Siddhartha Academy of Hi
Computer Science and Engineering
Syllabus for the Academic Year Syllabus for the Academic Year Syllabus for the Academic Year Syllabus for the Academic Year
Department: Computer Science and Engineering
Subject Name: ARTIFICIAL INTELLIGENCE
Subject Code: CSOE0613
Course Objectives :
Course Outcomes:
Sl.No Course Objectives
1 To create appreciation and understanding of both the achievements of AIthose achievements
2 To impart basic proficiency in representing real life problems in a state space as to solve them using different AI techniques
3 To create an understanding of the basic issues of knowledge representation and heuristic search techniques
4 To solve problems using AI technique
Course outcome
Descriptions
CO1 Demonstrate the knowledge of building blocks of AI
CO2 Analyze and formalize the problem as a state space tree, design heuristics and solve using different search techniques.
CO3 Analyze and demonstrate knowledge techniques.
CO4 Develop AI solutions for a given problem.
SRI SIDDHARTHA INSTITUTE OF TECHNOLOGY- TUMAKURU(A constituent College of Siddhartha Academy of Higher Education, Tumakuru)
Computer Science and Engineering
Syllabus for the Academic Year Syllabus for the Academic Year Syllabus for the Academic Year Syllabus for the Academic Year –––– 2019 2019 2019 2019 ---- 2020202020202020
Computer Science and Engineering Semester:
ARTIFICIAL INTELLIGENCE
L-T-P-C:
Course Objectives
To create appreciation and understanding of both the achievements of AI and the theory underlying those achievements
To impart basic proficiency in representing real life problems in a state space representation so as to solve them using different AI techniques
To create an understanding of the basic issues of knowledge representation and heuristic search techniques
To solve problems using AI technique
Descriptions
Demonstrate the knowledge of building blocks of AI
Analyze and formalize the problem as a state space tree, design heuristics and solve using different search techniques.
Analyze and demonstrate knowledge representation using various
Develop AI solutions for a given problem.
TUMAKURU gher Education, Tumakuru)
Semester: 6
C: 3-0-0-0-3
To create appreciation and understanding of both and the theory underlying
To impart basic proficiency in representing real representation so
as to solve them using different AI techniques
To create an understanding of the basic issues of knowledge representation and heuristic search
Analyze and formalize the problem as a state space tree, design
representation using various
SRI SIDDHARTHA INSTITUTE OF TECHNOLOGY(A constituent College of Siddhartha Academy of Hi
Computer Science and Engineering
UNIT
I
Introduction What is Artificial Intelligence?, AI Problems, The underlying Assumption, What is an AI Technique, Problems, problem Defining the problem as a State Space Search, Production Systems, Problem Characteristics, Production System Characteristics, Issues in the Design of search programs, Additional Problems.
II
Heuristic Search TechniquesGenerate-and-Test, Hill Climbing, BestReduction
III
Knowledge representation Representation and Mappings, Approaches to knowledge Representation, Issues in knowledge RepresentationWeak Slot Filler Structures:
IV
Using Predicate LogicRepresenting the simple facts in logic, Representing Instance and ISA Relationships, Computable functions and predicates, Resolution, Natural Deduction
V
Strong slot-and-Filter StructuresConceptual Dependency, ScriptsExpert Systems Representation and Using Domain Knowledge, Expert Systems shells, Explanation, Knowledge Acquisition
Question paper Pattern:
From each unit two questions of 20 marks each have to be answer one full question of his/her choice.
SRI SIDDHARTHA INSTITUTE OF TECHNOLOGY- TUMAKURU(A constituent College of Siddhartha Academy of Higher Education, Tumakuru)
Computer Science and Engineering
Description
What is Artificial Intelligence?, AI Problems, The underlying Assumption, What is an AI Technique, Problems, problem spaces, and search: Defining the problem as a State Space Search, Production Systems, Problem Characteristics, Production System Characteristics, Issues in the Design of search programs, Additional Problems.
Heuristic Search Techniques Test, Hill Climbing, Best-First Search, Problem
Knowledge representation and issues Representation and Mappings, Approaches to knowledge
Issues in knowledge Representation Weak Slot Filler Structures: Semantic Nets
Using Predicate Logic Representing the simple facts in logic, Representing Instance and ISA Relationships, Computable functions and predicates, Resolution,
Filter Structures and Expert systems Conceptual Dependency, Scripts
Representation and Using Domain Knowledge, Expert Systems shells, Explanation, Knowledge Acquisition
From each unit two questions of 20 marks each have to be given. The student has to answer one full question of his/her choice.
TUMAKURU gher Education, Tumakuru)
Hours
What is Artificial Intelligence?, AI Problems, The underlying
Defining the problem as a State Space Search, Production Systems, Problem Characteristics, Production System Characteristics, Issues in
8Hrs
irst Search, Problem
8Hrs
8Hrs
Representing the simple facts in logic, Representing Instance and ISA Relationships, Computable functions and predicates, Resolution,
8Hrs
Representation and Using Domain Knowledge, Expert Systems shells,
7Hrs
given. The student has to
SRI SIDDHARTHA INSTITUTE OF TECHNOLOGY(A constituent College of Siddhartha Academy of Hi
Computer Science and Engineering
Text Books:
Sl No
Text Book title
1 Elaine Rich, Kevin Knight, Shivashankar
B Nair
Reference Book:
Sl No
Text Book title
1 Artificial Intelligence A Modern Approach
2 Principles of Artificial Intelligence
SRI SIDDHARTHA INSTITUTE OF TECHNOLOGY- TUMAKURU(A constituent College of Siddhartha Academy of Higher Education, Tumakuru)
Computer Science and Engineering
Text Book title Author Volume and Year of Edition
Elaine Rich, Kevin Knight, Shivashankar
Artificial Intelligence 3rd Edition,
Hill publications, 2017
Text Book title Author Volume and Year of Edition
Artificial Intelligence A Modern Approach Stuart Russel, Peter
Norvig 2
nd
Education, 2003
Principles of Artificial Intelligence Nils J. Nilsson Elsevier, 1980
TUMAKURU gher Education, Tumakuru)
Volume and Year of Edition
3rd Edition, Tata McGraw
Hill publications, 2017
Volume and Year of Edition
nd Edition, Pearson
Education, 2003
Elsevier, 1980