CSE 160 Credits Syllabus V To VI NEP 1 Print

Scheme of Teaching, Examination and Syllabus
B.E. COMPUTER SCIENCE AND ENGINEERING
Batch: 2021-22
ThirdYear
(V and VI SEMESTER)
(Effective from the academic year 2023-2024)
SreeSiddaganga Education Society®

Siddaganga Institute of Technology
(An Autonomous institute affiliated to Visvesvaraya Technological University, Belagavi)
(Approved by AICTE, New Delhi, Accredited by NAAC and ISO 9001-2015 certified)
B.H. Road, Tumakuru-572 103, Karnataka, India
Phone: Direct +91-816-2282696,Fax:+91-816-2282994
E-mail: principal@sit.ac.in web: www.sit.ac.in
SCHEME OF TEACHING AND EXAMINATION (160 Credits Scheme)
B.E. in Computer Science & Engineering Batch:2021-2022
V Semester
Teaching hrs/week Examination
Teaching /
Sl. Course and Practical/ Self Study
Course Title Paper setting Lecture Tutorial
Drawing Component Duration Total Credits
No. Course Code Dept. CIE Marks SEE Marks
in hrs. Marks
L T P S
1. IPCC N5CSI01 Computer Networks (I) CS 3 0 2 3 50 50 100 4
2. PCC N5CS01 Automata Theory and Compiler Design CS 3 0 0 3 50 50 100 3
3. PCC N5CCS01 Software Engineering and Project Management CS 3 0 0 3 50 50 100 3
4. PCC N5CS02 Cloud Computing CS 3 0 0 3 50 50 100 3
5. PCC
* N5CCS02 Data Base Management Systems CS 3 0 0 3 50 50 100 3
Data Base Management Systems Laboratory with no
6. PCC N5CSL01 CS 0 0 2 3 50 50 100 1
SQL
7. HSMC NSH05 Environmental Science 1 0 0 2 50 50 100 1
If offered as Theory Course
2 0 0
8. AEC N5CSA01 Java Script CS 3 50 50 100 2
If offered as Integrated Course
1 0 2
36 hrs. during the entire
9. NCMC NSH07 Soft Skills T&P semester
100 -- 100 0
Total 500 400 900 20
AAP AICTE Activity Points 40 hours community service to be documented and produced for the examination
Note: IPCC: Integrated Professional Core Course; PCC: Professional Core Course, HSMC: Humanity and Social Science & Management Courses,
AEC –Ability Enhancement Courses. INT –Internship, UHV- Universal Human Value Courses
L –Lecture, T – Tutorial, P- Practical/ Drawing, S – Self-Study Component, CIE: Continuous Internal Evaluation, SEE: Semester End Examination
Soft Skills Training Programme is a Non Credit Mandatory Course for all the Programmes. Dean Academic to schedule the even in the Academic Calendar.
Integrated Professional Core Course (IPCC): Refers to Professional Theory Core Course Integrated with Practicals of the same course. Credit forIPCC can be 04 and its Teaching –
Learning hours (L : T : P) can be considered as (3: 0 : 2) or (2 : 2 : 2). The theory part of the IPCC shall be evaluatedboth by CIE and SEE. The practical part shall be evaluated by only
CIE (no SEE). However, questions from practical part of IPCC shall be included in the SEE question paper.
Ability Enhancement Course – V (Offered by the Department)
N5CSA01 Java Script N5CCSA02 Advanced Data Structures
N5CCSA01 Advance Algorithms
Computer science & Engineering 2023-2024
SCHEME OF TEACHING AND EXAMINATION (160 Credits Scheme)

B.E. in Computer Science & Engineering Batch:2021-2022
VI Semester
Teaching hrs/week Examination
Teaching /
Sl. Course and Lecture Tutorial
Practical/ Self Study
Course Title Paper setting Drawing Component Duration Total Credits
No. Course Code Dept. CIE Marks SEE Marks
in hrs. Marks
L T P S
Artificial Intelligence and Machine Learning
1. IPCC N6CSI01 CS 3 0 2 3 50 50 100 4
Techniques (I)
2. HSMC NSH06 Management and Entrepreneurship ME, IM, MBA 3 0 0 3 50 50 100 3
3. PEC NCS6PE1x Professional Elective Course-I CS 3 0 0 3 50 50 100 3
4. OEC NOExx Open Elective Course-I 3 0 0 3 50 50 100 3
5. PCC N6CSL01 Mobile Application Development Laboratory CS 0 0 2 3 50 50 100 1
6. MP CSMP Mini Project CS 1 full day per week 100 -- 100 2
Internshi
7. p INT2 INTERNSHIP –II (4 weeks) 100 -- 100 3
8. AEC ARAS Aptitude Related Analytical Skills T&P 36 Hrs. for the entire semester 2 50 50 100 1
Total 500 300 800 20
AAP AICTE Activity Points 40 hours community service to be documented and produced for the examination
Professional Elective -I
NCS6PE11 Software Industry Skills for Excellence NCS6PE13 High Performance computing
NCS6PE12 Big Data NCS6PE14 Foundations of Data Science
Note: IPCC: Integrated Professional Core Course; PCC: Professional Core Course, HSMC: Humanity and Social Science & Management Courses,
PEC – Professional Elective Course; OEC- Open Elective Course; MP-Mini Project;AEC –Ability Enhancement Courses, NCMC– Non Credit Mandatory Course
L –Lecture, T – Tutorial, P- Practical/ Drawing, S – Self-Study Component, CIE: Continuous Internal Evaluation, SEE: Semester End Examination
Integrated Professional Core Course (IPCC): Refers to Professional Theory Core Course Integrated with Practicals of the same course. Credit forIPCC can be 04 and its Teaching
– Learning hours (L : T : P) can be considered as (3: 0 : 2) or (2 : 2 : 2). The theory part of the IPCC shall be evaluatedboth by CIE and SEE. The practical part shall be evaluated by
only CIE (no SEE). However, questions from practical part of IPCC shall be included in the SEE question paper.
Siddaganga Institute of Technology, Tumakuru-

Professional Elective Courses (PEC):

A Professional Elective Course (PEC) is intended to enhance the depth and breadth of educational experience in the Engineering and Technology curriculum. Multidisciplinary
courses are added to supplement the latest trend and advanced technology in the selected stream of engineering. Each group will provide an option to select one course out of four
courses. The minimum students’ strength for offering professional electives is 10.
Open Elective Courses:

Students belonging to a particular stream of Engineering and Technology are not entitled for the open electives offered by their parent Department.
However, they can opt an elective offered by other Departments, provided they satisfy the prerequisite condition if any. Registration to openelectives shall be documented under the
guidance of the Program Coordinator/ Advisor/Mentor.Selection of an open elective shall not be allowed if,
i) The candidate has studied the same course during the previous semesters of the program.
ii) The syllabus content of open electives is similar to that of the Departmental core courses or professional electives.
iii) A similar course, under any category, is prescribed in the higher semesters of the program.
The minimum students’ strength for offering open electives is 20.
Mini-project work:
Mini Project is a laboratory-oriented course which will provide a platform to students to enhance their practical knowledge andskills by the development of small
systems/applications.
Based on the ability/abilities of the student/s and recommendations of the mentor, a single discipline or a multidisciplinary Mini- project can beassigned to an individual student or to
a group having not more than 4 students. Departments shall allocate one full day for Mini-project in the Time Table.
CIE procedure for Mini-project:
(i) Single discipline: The CIE marks shall be awarded by a committee, DPEC - consisting of the Head of the concerned Department and two faculty members of the Department,
one of them being the Guide. The CIE marks awarded for the Mini-project work shall be based on the evaluation of Project Report,Project Presentation skill, Question &
Answer session and Guide Assessment in the ratio of 40:20:20:20. The marks awarded for the project report shall be the same for allthe batch mates.
(ii) Interdisciplinary: Continuous Internal Evaluation shall be group-wise at the college level with the participation of all the guides of the project.The CIE marks awarded for the
Mini-project be based on the evaluation of Project Report, Project Presentation Skill, Question & Answersession and Guide Assessment in the ratio 40:20:20:20. The marks
awarded for the project report shall be the same for all the batch mates.No SEE component for Mini-Project.
VII semester Classwork and Research Internship / Industry Internship (INT3)
Swapping Facility
Departments can swap VII and VIII Semester Scheme of Teaching and Examinations to accommodate research internship/ industry internship after theVI semester. Credits earned
for the courses of VII and VIII Semester Scheme of Teaching and Examinations shall be counted against the correspondingsemesters whether VII or VIII semester is completed
during the beginning of IV year or later part of IV year of the program.
Elucidation:
At the beginning of IV year of the programme i.e., after VI semester, VII semester classwork and VIII semester Research Internship /IndustrialInternship shall be permitted to be
operated simultaneously by the Department so that students have ample opportunity for internship. In other words,a good percentage of the students shall attend VII semester
classwork and similar percentage of others shall attend to Research Internship or IndustrialInternship.
Research/Industrial Internship shall be carried out at an Industry, NGO, MSME, Innovation centre, Incubation centre, Start-up, Centers of Excellence(CoE), Study Centre established

in the parent institute and /or at reputed research organizations / institutes. The internship can also be ruralinternship.
The mandatory Research internship /Industry internship is for 24 weeks. There will be both CIE and SEE for the internship (INT3).
Those, who do not take up/complete the internship shall be declared fail and shall have to complete during thesubsequent examination after satisfying the internship requirements.
INT3 Research Internship/ Industry Internship/Rural Internship

Research internship: A research internship is intended to offer the flavour of current research going on in the research field. It helps students get familiarized with the field and
imparts the skill required for carrying out research.
Industry internship: Is an extended period of work experience undertaken by students to supplement their degree for professional development. It also helps them to learn how to
overcome unexpected obstacles and successfully navigate organizations, perspectives, and cultures. Dealingwith contingencies helps students recognize, appreciate, and adapt to
organizational realities by tempering their knowledge with practicalconstraints.
Rural internship: A long-term goal, as proposed under the AICTE rural internship programme, shall be counted as rural internship activity.
The student can take up Interdisciplinary Research Internship or Industry Internship.
The faculty coordinator or mentor has to monitor the students’ internship progress and interact with them to guide for the successful completion of the internship.
The students are permitted to carry out the internship anywhere in India or abroad. Institute shall not bear any expenses incurred in respect ofinternship.


B.E. COMPUTER SCIENCE & ENGINEERING
Batch: 2021-22
V SEMESTER
Siddaganga Institute of Technology, Tumakuru-03 Page 4

B.E COMPUTER SCIENCE & ENGINEERING

Outcome Based Education (OBE) and Choice Based Credit System (CBCS)
SEMESTER – V
COMPUTER NETWORKS (I)
Course Code N5CSI01 CIE Marks 50
Teaching Hours/Week (L:T:P) (3:0:2) SEE Marks 50
Credits 04 Exam Hours 03
Course objectives:
1. Understand the basic networking concepts and layers of TCP/IP model.
2. InterpretLine coding, error detection and correction techniques and access protocols.
3. Understand routing algorithms, congestion control and resource allocation.
4. Introduces internetworking and describes the key elements of the IP.
5. Analyse the transport-layer concepts: Transport-Layer services Reliable vs. un-reliable data transfer -TCP
protocol -UDP protocol and QoS.
Module-1 (08L+ 4P hrs)
TCP/IP Protocol Suite, Layered Architecture, Layers in the TCP/IP Protocol Suite, Description of Each
Layer, Encapsulation and Decapsulation, Addressing, Multiplexing and De-multiplexing.
Data Rate Limits: Noiseless Channel: Nyquist Bit Rate, Noisy Channel: Shannon Capacity .Digital-To-Digital
Conversion: Line Coding, Line Coding SchemesAnalog-To-Digital Conversion: Pulse Code Modulation
(PCM)
Cyclic Codes: Cyclic Code Encoder Using binary and PolynomialsMedia Access Control (Mac):CSMA,
CSMA/CD, CSMA/CA.
Section: 2.2, 3.5, 4.1(4.1.1, 4.12), 4.2(4.2.1), 10.3 (10.3.1 to 10.3.3), 12.1 (12.1.2 to 12.1.4)
Network Layer: Network-Layer Services: Packetizing, Routing and Forwarding Network-Layer
Performance: Delay, Throughput, Packet Loss. Congestion Control.
IPV4 Addresses: Address Space, Classful Addressing, Classless Addressing, Dynamic Host Configuration
Protocol (DHCP), Network Address Resolution (NAT).
Internet Protocol (IP): Datagram Format, Fragmentation, Security of IPv4 Datagrams.
Section:18.1, 18.3, 18.4, 19.1
Unicast Routing: Introduction: General Idea, Least-Cost Routing.
Routing Algorithms: Distance-Vector Routing, Link-State Routing, Path-Vector Routing.
Next Generation IP: IPv6 Addressing: Representation, Address Space, Address Space Allocation, Auto
configuration.
The IPv6 Protocol: Packet Format, Extension Header, Transition from IPv4 To IPv6: Strategies.
Section:20.1, 20.2, 22.1, 22.2, 22.4
Transport Layer Protocols:Introduction: Services, Port Numbers.
User Datagram Protocol: User Datagram, UDP Services, UDP Applications.
TransmissionControl Protocol: TCP Services, TCP Features, Segment, A TCP Connection, State
Transition Diagram, Windows in TCP, Flow Control, Error Control (except Sender and Receiver FSMs), TCP
Congestion Control.
Section:24.1, 24.2, 24.3 (24.3.1 to 24.3.9)


World Wide Web and HTTP: World Wide Web. Hypertext Transfer Protocol (HTTP), SMTP protocol,
DNS: Name Space and Resolution, Telnet.
Quality Of Service: Data-Flow Characteristics: Definitions, Sensitivity of Applications, Flow Classes. Flow
Control To Improve QoS; Scheduling, Traffic Shaping or Policing, Resource Reservation, Admission Control.
Integrated Services (Intserv): Flow Specification, Admission, Service Classes. Resource Reservation Protocol
(RSVP), Problems with Integrated Services.
Differentiated Services(DFFSERV): DS Field, Per-Hop Behaviour, Traffic Conditioners.
Section:26.1, 26.3, 26.4, 26.6, 30.1, 30.2, 30.3,30.4
LAB COMPONENT
Week 1:Study of basic Linux networking commands:1)ifconfig , 2) ip, 3) tracepath, 4) ping, 5)
netstat, 6) ss, 7) dig, 8) nslookup, 9) route, 10 ) host, 11 ) arp, 12 ) hostname13 ) Wget, 14 ) Curl
Week 2: Basic experiments in CISCO packet tracer
1.Connecting Two PCs in Cisco Packet
2.Connecting Two Different Networks using Router,
3.Swtich configuration
4. DHCP Configuration
Week 3: Wireshark packet analysis for the following network protocols:
Hypertext Transfer Protocol, Domain Name Server, TCP, UDP, IP, ICMP and DHCP
Week 4: onwards in every lab the instructions of the following experiments to be taught during the
first 30 min of the lab. The remaining one and hour half is to be utilized in conducting the
experiments and verification of the results.
1. Write a program for error detecting code using 16 bits CRC-CCITT (Consultative Committee
for International Telephony and Telegraphy).
2. Write a program to divide the message into variable length frames and sort them and display the
message at the receiving side.
3. Simulate an Ethernet LAN using n nodes (6-10), change error rate and data rate and compare the
throughput.
4. Simulate the transmission of ping messages over a network topology consisting of 6 nodes and find
the number of packets dropped due to congestion.
5. For the given network graph, write a program to implement Link state routing algorithm to build a
routing table for the given node.
6. Using FIFOs as IPC channels, write a client – server program, the client sends the file name and
theserver sends back the requested text file if present.
7.Using TCP/IP sockets, write a client – server program, the client sends the file name and the server
sends back the requested text file if present.
8.Using UDP, write a client – server program, to exchange messages between client and the server
9.Simulate the different types of Internet traffic such as FTP and TELNET over a network and
analyze the throughput.
10.Simulate simple ad-hoc network with transmitting nodes and determine the performance with
respectto transmission of packets.
Course outcomes:
On successful completion of this course, students will be able to:
1. Apply the basics of computer networks technology and analyse the concepts of Digitaltransmission,
error control protocols and random access protocols.
2. Apply the knowledge of Packet switching concepts in computer networking, Identify
differentcategories of IP addresses and design subnets.
3. Analyse different Unicast routing mechanisms and protocols.

4. Analyse the transport-layer concepts and services -unreliable vs. reliable data transfer.
5. Examine various network protocols and Appraise existing QoS and application layer protocol/s.
Question paper pattern:

 The question paper will have ten full questions carrying equal marks.
 Each full question will be for 20 marks.
 There will be two full questions (with a maximum of four sub- questions) from each module.
 Each full question will have sub- question covering all the topics under a module.
 The students will have to answer five full questions, selecting one full question from each
module.
Sl. Name of the

Title of the Book Name of the Publisher Edition and Year
No. Author/s
Textbooks
Data Communications and Behrouz A.
1 McGraw-Hill 5thEdition, 2013
Networking Forouzan
Computer Networks: A Systems Larry L
2 Elsevier 5th Edition, 2011
Approach Peterson and
Reference Books Bruce S Davie
Data and Computer William
1 PearsonEducation 10th Edition, 2013
Communications Stallings
Kurose James
Computer Networking: A Top-
2 F, Ross Keith Pearson Education 6th Edition, 2017
Down Approach
W.
Andrew S.
3 Computer Networks Tanenbaum and PearsonEducatin 5th Edition,2011
David J.
Wetherall

B.E COMPUTER SCIENCE & ENGINERRING

SEMESTER –V
AUTOMATA THEORY AND COMPILER DESIGN
Course Code N5CS01 CIE Marks 50
Course objectives:
1. Illustrate the concepts of automata theory and formal languages
2. Identify different formal language classes like regular and context free and their relationships
3. Design grammars and recognizers for different formal languages.
4. Introduce the major concept areas of language translation and compiler design.
5. Extend the knowledge of parser by parsing LL parser and LR parser.
Module-1 (08 hrs)
Introduction to Finite Automata:Why study automata theory? The central concepts of Automata
theory; Deterministic finite automata; Nondeterministic finite automata, Finite automata with
Epsilon-transitions.
Regular expressions and Languages:Regular expressions, Finite Automata and Regular
Expressions, From DFA’s to Regular Expressions, converting regular expressions to automata;
[Text Book 1: 1.1.1, 1.5, 2.2, 2.3 2.5, 3.1, 3.2.1,3.2.2, 3.2.3)
Module-2 (07hrs)
Context-Free Grammars and Languages: Context-free grammars; Parse trees- Constructing Parse
Trees, The yield of a parse tree; Applications of Context Free Grammars, Ambiguity in grammars and
languages- Ambiguous grammars, Removing ambiguity from grammars, Leftmost derivation as a
way to express ambiguity, Inherent ambiguity
[Text Book 1:5.1, 5.2.1, 5.2.2,5.3, 5.4]
Module-3 (08 hrs)
Introduction: Language processors, The structure of a Compiler.
Lexical Analysis: The Role of Lexical Analyzer, Lexical Analysis Versus Parsing, Tokens, Patterns,
and Lexemes, Attributes for Tokens, Lexical Errors, Input Buffering, Buffer Pairs, Sentinels,
Specification of Tokens, Regular Definitions, Extensions of Regular Expressions.
Recognition of Tokens, Recognition of Reserved Words and Identifiers, Completion of the Running
Example, Architecture of a Transition-Diagram-Based Lexical Analyzer
[Text book 2 :1.1,1.2, 3.1 to 3.4]
Module-4 (08hrs)
Syntax Analysis : The role of parser, Representative Grammars, syntax error handling, error
recovery strategies, Writing a grammar, lexical versus syntactic analysis, Eliminating ambiguity,
Elimination of left-recursion, Left-factoring.
Top-Down Parsing: Introduction, Recursive-Descent Parsing, FIRST and FOLLOW, LL(1)
grammars, Constructing a predictive parsing table , Non recursive Predictive Parsing
[Text book 2 : 4.1, 4.3.1 to 4.3.4, 4.4.1to 4.4.4]
Module-5 (08hrs)
Top-Down Parsing: Error Recovery in Predictive Parsing: Panic mode Error Recovery and Phrase
level Error Recovery.
Bottom-Up Parsing:, Reductions, Handle Pruning, Shift-reduce parsing and conflicts during Shift-
reduce parsing, Introduction to LR Parsing: Simple LR, Why LR parsers?, Items and LR(0)

automaton, Closure of Item Sets, The Function GOTO, LR(0) automaton for the expression grammar,
The LR-Parsing Algorithm, Constructing SLR-parsing tables.
[Text book 2: 4.4.5, 4.5.1 to 4.5.4,4.6.1 to 4.6.4]
Course outcomes:
1. Acquire a fundamental understanding of the core concepts in automata theory and formal
languages.
2. Design automata, regular expressions and context-free grammars accepting or generating a
certain language;
3. Discuss and Apply the fundamentals of compiler design to construct various phases of
modern compiler
4. Discuss functions of lexical analyzer and design transition diagram based lexical analyzer
5. Design top down parsers, bottom up parsers to produce parse tree representation of the input.
module.
Sl.
Title of the Book Name of the Author/s Name of the Publisher Edition and Year
No.
Textbooks
Introduction to Automata John E. Hopcroft,

1 Theory, Languages and Rajeev Motwani, Pearson education 3rd Edition, 2007
Computation Jeffrey D.Ullman
Alfred V Aho,
Compilers- Principles, Pearson Education,
Monica S.Lam, Ravi
2 Techniques andTools 2nd Edition 2007
Sethi, Jeffrey D
Ullman
Reference Books
Introduction to
1 Languages and Automata John C Martin Tata McGraw-Hill 3rd Edition, 2007
Theory
Compiler Construction Cambridge University

2 Andrew W Appel 1st Edition, 2010
Principles & Practice Press

B.E COMPUTER SCIENCE & ENIGEERING

Outcome Based Education(OBE) and Choice Based Credit System(CBCS)
SEMESTER–V
SOFTWARE ENGINEERING AND PROJECT MANAGEMENT
CourseCode N5CCS01 CIEMarks 50
TeachingHours/Week(L:T:P) (3:0:0) SEEMarks 50
Credits 03 ExamHours 03
Course objectives:
1. To define software engineering and explain importance of project management.
2. To explain process of gathering software requirements and modeling complex software systems.
3. To explain process of designing complex software products, implementing the software design
and testing the developed product.
4. To explain the importance of project management
5. To learn about software engineering and project management in an industrial context.
UNIT-1 (8L+0THrs)
1.1 Software Engineering: Engineering, Creativity and Craft (R1-2); Professional
SoftwareDevelopment (T1-1.1); Software Engineering (R1-1, R2-1.1); Birth of Software
Engineering(R1-1); Foundations of Software Engineering Discipline (R1-3); Experts and
Learning (R1-3);ExpertsatManagingComplexity(R1-
3);SoftwareEngineeringBodyofKnowledge(R2-14.4);
1.2 Software Processes: Software Process Models (T1-2.1, R2-2.2); Process Activities (T1-
2.2);Copingwith Change(T1-2.3);
1.3 Agile Software Development: Agile Methods (T1-3.1); Agile Development Techniques (T1-
3.2);Agile Project Management (T1-3.3);
1.4 Project Management: The Project Management Body of Knowledge (W2);
ProjectManagementKnowledgeAreas(W3)
UNIT-2 (8L+0THrs)
2.1 Requirements Engineering: Requirements Engineering (T1-4); Functional and Non-
Functional Requirements (T1-4.1); Requirements Engineering Process (T1-4.2);
RequirementsElicitation (T1-4.3); Requirements Specification (T1-4.4); Requirements
Validation (T1-4.5,R2-4);Requirements Change (T1-4.6);
2.2 System Modelling:Context Models (T1-5.1); Interaction Models (T1-5.2); Structural
Models(T1-5.3);Behavioural Models (T1-5.4);Model Driven Engineering (T1-5.5);
2.3 Architectural Design: Architectural Design Decisions (T1-6.1); Architectural Views (T1-
6.2);ArchitecturalPatterns (T1-6.3);Application Architectures (T1-6.4,R2-5.48.1)
UNIT-3 (8L+0THrs)
3.1 Design and Implementation:Incrementalism in Software Development (R1-6);
ObjectOriented Design using UML (T1-7.1); Design Patterns (T1-7.2); Achieving Quality
Attributes(R2-5.5);Writing Programs (R2-7);
3.2 Software Testing: Development testing (T1-8.1, R2-8); Test driven development (T1-
8.2);Releasetesting (T1-8.3); User testing (T1-8.4);

3.3 Software Evolution: Software Evolution (T1-9.1); Legacy Systems (T1-9.2);

SoftwareMaintenance (T1-9.3)
UNIT-4 (8L+0THrs)
4.1 Project Management:Overview (W3); Risk Management (T1-22.1); Boehm's Top Ten
RiskItems (R2-3.4); Members of the Development Team (R2-1.7); Teamwork (T1-22.3);
ManagingPeople(T1-22.2);
4.2 Project Planning: Working Iteratively (R1-4); Plan Driven Development (T1-23.2);
TheProject Plan (R2-3.5); Agile Planning (T1-23.4); Estimation Techniques (T1-23.5, R2-
3.3);ProjectScheduling (T1-23.3); COCOMO CostModeling (T1-23.6);
4.3 Complexity Management: Software Complexity (R1-III); Methods of Managing
Complexity(R1-III,R2-6.2);
4.4 Quality Management: What is Good Software? (R2-1.3); Feedback in Software
Development(R1-5); Software Quality (T1-24.1); McCall's Quality Model (R2-1.3); Software
Standards (T1-24.2); Reviews and Inspections (T1-24.3); Quality Management in Agile
Development (T1-24.4);SoftwareMeasurements (T1-24.5);
4.5 Configuration Management: Version Management (T1-25.1); System Building (T1-
25.2);ChangeManagement (T1-25.3); ReleaseManagement (T1-25.4)
UNIT-5 (7L+0THrs)
Industrial Case Study: Defining, architecting, designing, developing, testing, releasing, and
maintaining a complex software product and managing the associated project.
Courseoutcomes:
1. Analyze fundamental processes of software engineering and project management.
2. Analyze the functional and non-functional requirements.
3. Practice the software estimation, architecture and design principles.
4. Implement software design and test the quality of software products.
5. Identify and practice specific techniques of project management.
Questionpaperpattern:
 The students will have to answer five full questions, selecting one full question from each module.
Sl. Edition
TitleoftheBook NameoftheAuthor/s NameofthePublisher
No. andYea
r
Textbooks

SoftwareEngineering Pearson 10th

T1 IanSommerville
ISBN:978-93-325-8269-9 EducationLimited Edition201
7
Reference Books
R1 Modern Software
Engineering:Doing What
Works to BuildBetterSoftware DavidFarley Addison-Wesley 2022
Faster
ISBN:978-0-13-731491-1
R2 Software Engineering:
Shari Lawrence 4th
TheoryandPractice Pearson
PfleegerJoanneM Atlee Edition20
ISBN:978-81-317-6062-8
13
WebResources
W1 Supportingmaterial forT1
https://software-engineering-book.com/
W2 PMBOK 7thEdition Summary

https://www.projecttimes.com/articles/the-pmbok-guide-seventh-edition-summary/
W3 PMBOKKnowledgeAreas
https://www.projectengineer.net/the-10-pmbok-knowledge-areas/


SEMESTER – V
CLOUD COMPUTING
Course Code N5CS02 CIE Marks 50
Course objectives:
1. Learning about cloud types, paradigm shift in cloud computing, attributes that make the cloud
computing unique, SLA and licencing.
2. Understanding architecture and infrastructure of fog computing cloud computing including SaaS,
PaaS and IaaS.
3. Understanding various types of virtualization and learning about the capacityplanning for the
cloud.
4. Understanding how cloud data can be secured.
Module-1 (7 hrs)
Defining Cloud Computing: Cloud Types, The NIST model, The Cloud Cube Model, Deployment
models, Service models, Examining the Characteristics of Cloud Computing, Paradigm shift, Benefits
of cloud computing, Disadvantages of cloud computing; Assessing the value proposition: Early
adopters and new applications, the laws of cloud economics, cloud computing obstacles, behavioural
factors relating to cloud adoption, measuring cloud computing costs, specifying SLAs.
Textbook1: Chapter1,2
Module-2 (9hrs)
Cloud Infrastructure: Cloud Computing at Amazon, Cloud Computing: The Google Perspective,
Microsoft Windows Azure and Online Services, Open-Source Software Platforms for Private Clouds,
Cloud Storage Diversity and Vendor Lock-in, Cloud Computing Interoperability: The Intercloud,
Energy Use and Ecological Impact of Large-Scale Data Centers, Service- and Compliance-Level
Agreements, Responsibility Sharing Between User and Cloud Service Provider, User Experience,
Software Licensing.
Textbook 2: Chapter3: (3.1 to 3.11)
Module-3 (8hrs)
Understanding Abstraction and Virtualization: Using Virtualization Technologies, Load balancing
and Virtualization, Understanding Hypervisors; Capacity Planning: Defining Baseline and Metrics,
Baseline measurements, System metrics, Load testing, Resource ceilings, Server and instance types,
Network Capacity, Scaling
Textbook1: Chapter5,6
Module-4 (8hrs)
Understanding Cloud Security: Securing the Cloud, The security boundary, Security service
boundary, Security mapping, Securing Data, Brokered cloud storage access, Storage location and
tenancy, Encryption, Auditing and compliance, Establishing Identity and Presence, Identity protocol
standards, Windows Azure identity standards.
Textbook1: Chapter12
Module-5 (7hrs)
Fog Computing and its Applications: Introduction: Essential characteristics in fog computing, Fog
nodes, Fog node deployment model. View of a Fog Computing Architecture: Node view, System
view, Software view. Fog Computing in IoT: Importance of Fog Computing, Time sensitiveness in

Fog Computing. Selected Applications of Fog Computing.

Textbook3: Chapter11
Course outcomes:
1. Articulate the key dimensions of Cloud Computing, characteristics, benefits and drawbacks of
Cloud computing
2. List Services provided by various cloud vendors & analyse the importance of each service..
3. Analyse the impact of vendor lock –in ,SLA, Large scale data centres.
4. Analyse the importance virtualization in cloud for resource pooling.
5. Analyse the cloud security issues.
6. List the features of fog computing & Analyse the relationship between fog computing & IoT.

module.
Sl. Name of the

Title of the Book Name of the Author/s Edition and Year
No. Publisher
Textbooks
Wiley
1 Cloud Computing Bible Barrie Sosinsky 2011
Publishing Inc.
Morgan
Cloud Computing Theory and
2 Dan C. Marinescu Kaufmann, 2013
Practice
Elsevier
SudipMisra, Cambridge
3 Introduction to IOT Anandarup 2020
University press
Mukherjee, Arijit Roy
Reference Books
RajkumarBuyya,
Cloud Computing James Wiley
1 2013
Principles and Paradigms Broberg,AndrzejGosci Publishing Inc.
nski
Cloud Computing and SOA
Addison-Wesley st
2 Convergence in Your David S. Linthicum 1 Edition
Professional
Enterprise:
Kai Hwang, Geoffrey Morgan

Distributed and Cloud
3 C. Fox, and Jack J. Kaufman 2012
Computing
Dongarra Publishers


SEMESTER – V
DATABASE MANAGEMENT SYSTEM
Course Code N5CCS02 CIE Marks 50
Course objectives:
1. To define a Database, characteristics and functions of Database Management System and
distinguish between a Traditional File System and a Database System.
2. To model the real world database systems using Entity Relationship Diagrams (ERD) from the
requirements specification and transform it to a relational model.
3. To designSQL and NoSQL queries to perform CRUD (Create, Retrieve, Update and delete) operations on
database.
4. To apply normalization techniques to normalize a Relational database
5. To illustrate how a DBMS handles transactions by enforcing recovery from failure and
concurrency control
Module-1 (6hrs)
DATABASES AND DATABASE USERS: Introduction; An example; characteristics of the database
approach; actors on the scene; workers behind the scene; advantages of using the
DBMSapproach;AbriefhistoryofdatabaseApplications;whenNottouseaDBMS. Chapter 1 : 1.1 – 1.8
DATABASE SYSTEM – CONCEPTS AND ARCHITECTURE: Data models, schemas, and
instances; three schema architecture and data independence; database languages and interfaces; the
database system environment; centralized and client/server/architectures for DBMSs. Classification of
database management system. Chapter 2 : 2.1 to 2.6
Module-2 (8hrs)
ENTITY-RELATIONSHIP MODEL: Using High-Level Conceptual Data Models for Database Design;
An Example Database Application; Entity Types, Entity Sets, Attributes and Keys; Relationship types,
Relationship Sets, Roles and Structural Constraints; Weak Entity Types; Refining the ER Design for the
COMPANY Database; ER Diagrams, Naming Conventions andDesignIssues. Chapter 7 : 7.1 to 7.7
RELATIONAL MODEL
Relational Model Concepts; Relational Model Constraints and Relational Database Schemas; Update
Operations and Dealing with Constraint Violations; Relational Database Design using ER- to-Relational
Mapping.: Chapter 3 : 3.1 to 3.3, Chapter 9 : 9.1
Module-3 (9hrs)
SQL-THE RELATIONAL DATABASE STANDARD: SQL Data Definition and Data Types,
Specifying Basic Constraints in SQL, Schema Change Statements in SQL; Basic Queries in SQL; More
Complex SQL Queries; Insert, Delete and Update Statements in SQL; Additional Features of SQL;
Specifying General Constraints as Assertion; Views (Virtual Tables) in SQL. Chapter 4 : 4.1 to
4.4,Chapter 5 : 5.1 to 5.3
MangoDB tutorial, MangoDB operators, DB commands, Database, collection, CRUD
URL: www.javatpoint.com/nosql-databases

Module-4 (8 hrs)
DATABASE DESIGN: Informal Design Guidelines for Relation Schemas; Functional
Dependencies; Normal Forms Based on Primary Keys; General Definitions of Second and Third
Normal Forms; Boyce-Codd Normal Form; Properties of Relational Decompositions. Chapter 15
: 15.1 to 15.5 , Chapter 16 : 16.2
Module-5 (9hrs)
TRANSACTION PROCESSING CONCEPT: Introduction to transaction processing; transaction and
system concepts; desirable properties of transactions, characterizing schedules based on recoverability and
serializability; transaction support inSQL Chapter 21 : 21.1 to 21.6
CONCURRENCY CONTROL & DATABASE RECOVERY TECHNIQUES: Two phase
locking techniques, Concurrency control based on Timestamp ordering; Recovery concepts; recovery
based on deferred update and Immediate Update, Shadow Paging, ARIES Recovery Algorithm Chapter
22 : 22.1 – 22.2, Chapter 23: 23.1 to 23.5
Course outcomes:
CO1: Describe the fundamentals of database technologies.

CO2: Design an ER diagram andtransform it to a relational model for a given database specification.
CO3: Design SQL and NoSQL queries to perform CRUD (Create, Retrieve, Update and delete)
operations on database.
CO4: Apply Informal Design guidelines and normalization techniques to improve database design
CO5: Analyse Concurrency control and Database recovery techniques in transaction processing.
 The students will have to answer five full questions, selecting one full question from each module.
Sl.
No.
Textbooks
1 Fundamentals of Database Systems ElmasriandNavathe Pearson Education 6th Edition,2011
Reference Books
Silberschatz, Korth
1 Data base System Concepts. McGraw-Hill 6th Edition, 2010
and Sudharshan.
Raghu Ramakrishnan
2 Database Management Systems. McGraw-Hill. 3th Edition, 2010
and Johannes Gehrke
URL: www.javatpoint.com/nosql-databases


SEMESTER – V
DATA BASE MANAGEMENT SYSTEMS LABORATORY WITH NO SQL
Course Code N5CSL01 CIE Marks 50
TeachingHours/Week (L:T:P) (0:0:2) SEE Marks 50
Credits 1 Exam Hours 3 hours
Course objectives: After the completion of the course, the student will be able to:
1. Apply the knowledge of database management system development process and
conduct the experiments using SQL and NoSQL queries to find the solution for a
givendatabase problem.
2. Analyze and design solutions for database system components to meet the
specified needs of online transaction processing and information systems like
Banking systems, Ticket Reservation systemsetc..
3. Develop code for stored programs, triggers assertions and to generatereports.
4. Contribute to the team as a member, lead theteam.
Sl. Experiments
no.
1 Suppose a movie_studio has several film crews. The crews might be designated by a given
studio as crew1, crew 2, and so on. However, other studios might use the same
designations for crews, so the attribute crew_number is not a key for crews. Movie_studio
holds the information like name, branch and several locations. Each crew holds
information like sector andstrength.
i) Establish the database by normalizing up to 3NF and considering all schema level
constraints
ii) Write SQL insertion query to insert few tuples to all therelations
iii) List all movie studios which are not used a singlecrews.
iv) Retrieve the movie studio which uses highest strengthcrew.
v) Write a before insert trigger to check maximum number of crews to any studio is
limited to 5.
vi) Write a procedure retrieve all crews used by specificstudio.
The production company is organized into different studios. We store each studio’s name
branch and location; every studio must own at least one movie. We store each movie’s
title, sensor number and year of production. Star may act in any number of movies and we
store each actors name and address.
2 constraints
iii) List all the studios of the movie“xyz”;
iv) List all the actors , acted in a movie ‘xyz’
v) Write a procedure to list all movies produced during the specificyear.
vi) Write a deletion trigger, does not allow to deleting current yearmovies.
3 The production company is organized into different studios. We store each studio’s name
branch and location; a studio own any number of Cartoon-serials. We store each Cartoon-

Serial’s title, sensor number and year of production. Star may do voices in any number of
Cartoon-Serials and we store each actors name andaddress.
constraints
iii) Find total no of actors, do voiced in a Cartoon-Serials‘xyz’
iv) Retrieve name of studio, location and Cartoon-Serials title in which star “abc” is
voiced.
v) vii. Write a procedure to list all Cartoon-Serials produced during the specific
year.
vi) v. Write a deletion trigger, does not allow to deleting current year Cartoon-
Serials.
4 Car marketing company wants keep track of marketed cars and their owner. Each car must
be associated with a single owner and owner may have any number of cars. We store car’s
registration number, model &color and owner’s name, address & SSN. We also store date
of purchase of eachcar.
constraints
iii) Find a person who owns highest number ofcars
iv) Retrieve persons and cars information purchased on the day 11-11-11
v) Write a insertion trigger to check date of purchase must be less than current date
(must use systemdate)
vi) Write a procedure to list all cars and owner information purchased during the
specific year.
5 Puppy pet shop wants to keep track of dogs and their owners. The person can buy
maximum three pet dogs. We store person’s name, SSN and address and dog’s name, date
of purchase and sex. The owner of the pet dogs will be identified by SSN since the dog’s
names are notdistinct.
constraints
iii) List all pets owned by a person‘Abhiman’.
iv) List all persons who are not owned a singlepet
v) Write a trigger to check the constraint that the person can buy maximum three pet
dogs
vi) Write a procedure to list all dogs and owner details purchased on the specificdate.

6 No SQL:
Lab 1. Installation and set up of MongoDB client and server
Lab 2. Create a database collection using MongoDB environment. For example a
documentcollection meant for analyzing Restaurant records can have fields like
restaurant_id, restaurant_name, customer_name, locality, date, cuisine, grade,
comments. etc.
Lab 3. Create database using INSERT, UPDATE, UPSERTS, DELETE and INDEX.
Lab 4. Practice writing simple MongoDB queries such as displaying all the records,
display selected records with conditions
Lab 5. Experiment with MongoDB comparison and logical query operators - $gt,
$gte, $lt, $lte, $in, #nin, $ne, $and, $or, $not
Lab 6. Practice exercise on element, array based and evaluation query operators -
$exists, $type, $mod, $regex
Course outcomes:
After the completion of the course, the student will be able to:
1. Apply the knowledge of database management system development process and
conduct the experiments using SQL and NoSQL queries to find the solution for
givendatabase problem.
2. Design ER Model & its mapping to relational for a given problem.
3. Develop code for stored programs& triggers.
Conduct of Practical Examination:

 All laboratory experiments are to be included for practical examination.
 Breakup of marks and the instructions printed on the cover page of answer script to be strictly adhered
bythe examiners.
 Students can pick one experiment from the questions lot prepared by the examiners.
 Change of experiment is allowed only once and 20% Marks is to be deducted.


SEMESTER – V
ENVIRONMENTAL SCIENCE
Course Code NHS05 CIE marks 50
L/ T/ P (1:0:0) SEE Marks 50
Credits 1 Duration SEE (Hrs) 2
Course Objectives:
This course introduces the students to-
1. The problems of depletion of natural resources due to deforestation, agricultural practices, and
adverse environmental effects, pesticides, soil erosion, mining.
2. Different types of energy- renewable, non-renewable and energy conservation, impact of
environmental pollution, solid waste management - disposal, treatment of different types of
solid waste including MSW and e-waste.
3. Societal impacts of environmental issues - ozone layer depletion, GHG effects, and water
conservation.
Module 1 (3hrs)
Introduction: • Components of Environment and their interactions

Natural Resources:
• Forest Resources - Deforestation, Causes of deforestation, Environmental effects of
deforestation and solutions
• Water resources, Types of water reserves
• Land resources, Land degradation. Soil erosion, Causes and prevention, Soil conservation
and its types.
Module 2 (3hrs)
Energy and resources:
• Types of Energy - Renewable, Non-renewable & sustainable energy & their advantages and
disadvantages
• Renewable energy sources - Solar energy, Wind energy, Biomass energy, Thermal power -
environmental impacts, Hydrogen energy
• Tips for conservation of energy
Module 3 (3Hrs)
Environmental pollution:
• Sources of pollution- Natural and anthropogenic sources
• Pollutants - Classification & their effects on environment
• Air Pollution -Composition of clean air, Sources of air pollution, Effect of air pollution on human
health and climate
• Water quality – Potable water, Wholesome water, Sources of water pollution
• Common impurities in water, Effects of impurities on human health
• Soil Pollution – Sources, effects and its control
(3
Module 4 Hrs)

Solid Waste Management:

• Definition of solid waste, refuse, garbage, rubbish, ash. Types of solid waste
• Municipal solid waste and the necessity of its safe disposal, Impacts on human health and
environment
• Quantity and composition of MSW
• Disposal of solid waste
• E-waste – Types and health effects
(3
Module 5 Hrs)
Sustainable development
• Global environmental issues: Population growth, Urbanization, Global warming, Acid rains,
Ozone layer depletion & controlling measures
• Issues on energy utilization, water conservation, concept of 3 Rs, Rainwater harvesting - methods
Course Outcomes:
After completion of the course, the student will be able to -
CO1 Describe the interactions between components of environment, importance of water and
land resources, effects of deforestation and land degradation
CO2 Describe the need for renewable sources to address the present world’s energy demand
CO3 Describe the effects of pollution of air, water, soil, and its control
CO4 Describe the composition of solid waste, its impact on environment and its safe disposal
Describe the current environmental issues, the need for sustainable development, and its
CO5
importance in the present world
The question paper pattern for CIE and SEE is as follows:

Test 1 25 Marks 45 Minutes  10 Marks (Multiple Choice Questions)
Test 2 25 Marks 45 Minutes  3 Descriptive Questions of 5 Marks each
SEE 50 Marks 90 Minutes  20 Marks (Multiple Choice Questions)
 30 Marks (Descriptive Questions of 6 Marks each)
Sl.No Title of the Book Author/s Publisher Year

Joseph, B. (2009). Environmental Studies. India: Tata McGraw-Hill. ISBN:
T1
9781283922524
Tripathi, A. K. (2016). Environmental Studies. India: Energy and Resources Institute.
T2
ISBN:9788179935828
Akitsu, T. (2018). Environmental Science: Society, Nature, and
R1
Technology. Singapore: Jenny Stanford Publishing. ISBN: 9780429468230
Course articulation matrix NHS05 Environmental Science
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3
CO1 M
CO2 M
CO3 M
CO4 M
CO5 M


SEMESTER – V
JAVA SCRIPT
Course Code N5CSA01 CIE Marks 50 Marks
Teaching Hours/Week (L:T:P) (0:0:2) SEE Marks 50 Marks
Course objectives:
1. Implement java script programs to understand core concepts and object-oriented programming.
2. Implement standalone programs using Functions, and rollovers.
3. Develop programs on Java script for building smarter forms.
4. Develop programs on Java script for handling events.
Sl. Experiments
No.
1 Design and develop Real-time applications in JavaScript using
 Control structures
 Error handling
Design and develop Real-time applications in JavaScript using

2  Functions
 Recursion
 Arrays
 Iterables
 Class and Objects
 Object Oriented Programming
 Constructors
 Strings
6 Design and develop Real-time applications for Handling Events.
 Event handling
 Event delegation
7 Design and develop Real-time applications for Handling Events.

 Forms
 Dynamic web page creation
Course outcomes:
1. Design and develop applications of Object-oriented programming concepts using Core Java script.
2. Design and develop applications using Java script rollovers and functions.
3. Design and develop applications for interacting with users.
4. Design and develop smarter forms through efficient event handling mechanism.
1. All laboratory experiments are to be included for practical examination.
2. Breakup of marks and the instructions printed on the cover page of answer script to be strictly adhered
by the examiners.
3. Students can pick one experiment from the questions lot prepared by the examiners.
4. Change of experiment is allowed only once and 20% Marks is to be deducted.


SEMESTER – V
ADVANCED DATA STRUCTURES AND ALGORITHMS
Course Code N5CCSA02 CIE Marks 50
Credits 2.0 Exam Hours 3
Course objectives:By the end of this course, the student will:
1. Understand the abstract data types such as List and Vector.
2. Understand the variety of ways that linearly ordered data can be stored, accessed, and manipulated
using Hash tables.
3. Understand various sorting algorithms and the run-time analysis required to determine their
efficiencies.
4. Understand concepts of Heaps and Binomial Queues and Tree data structures.
Module-1 (3Lhrs)
Implementation of Vector and List ADTs in STL.(Text Book-1:3.1-3.5)
Module-2 (2Lhrs)
Separate chaining and Open Addressing Hash tables along with Rehashing.(Text Book-1:5.3-5.5)
Module-3 (3Lhrs)
Binary Heap, BinomialQueues.(Text Book-1:6.3,6.8)
Module-4 (2Lhrs)
Shell sort and Quick sort with Median of Three.(Text Book-1:7.4,7.7)
Module-5 (3Lhrs)
B-Trees and Red Black Trees(Text Book-1:4.7,12.2.1)
Course outcomes:
1. Identify how C++ standard template library is used to implement ADT.
2. Understand and implement various data structures like hash tables and heaps.
3. Design Sorting algorithmsusing STL library.
4. Design self-balancing tree data structures such as B-Trees and Red Black Trees.
module.
Sl. Name of
Title of the Book Name of the Author/s the Edition and Year
No.
Publisher
Textbooks
Data Structures and Algorithm Pearson
1 Mark Allen Weiss 3rd Edition
Analysis in C++ Education
Reference Books
Thomas H. Cormen, Charles
Introduction to Algorithms E. Leiserson,
1 PHI 2nd Edition, 2006
Ronal L. Rivest, Clifford Stein.

Lab SET
Course objectives:By the end of this course, the student will:
1. Understand the abstract data types such as List and Vector.
2. Understand the variety of ways that linearly ordered data can be stored, accessed, and
manipulated using Hash tables.
3. Understand various sorting algorithms and the run-time analysis required to determine their
efficiencies.
4. Understand concepts of Heaps and Binomial Queues and Tree data structures.
Sl. Experiments
no.
1 Implement a stack of strings using vectors from STL.
2 Implement an ordinary queue/circular queues using Lists in STL. (Any one to be asked in Examination)
3 Write a program to store and evaluate two polynomials using lists in STL.
4 Write a program to merge two unordered vectors/Lists in STL into a ordered(sorted) vector without
using built in functions for sorting. (Any one to be asked in Examination)
5 Implement separate chaining hash table along with rehashing to store a set of integers for a table of prime
size.
6 Implement Linear Probing and Quadratic Probing along with rehashing to store a set of integers for a
table of prime size. (Any one to be asked in Examination)
7 Implement Double hashing hash table along with rehashing to store a set of integers for a table of prime
size. (Any one to be asked in Examination)
8 Implement a binary heap as a maximum priority queue to store a set of strings.
9 Implement a binomial queue as a minimum priority queue to store a set of integers.
10 Implement shell sort to sort a set of given strings in descending order.
11 Implement quick sort using median of three as a pivot to sort a set of integers in ascending order.
12 Implement a B-Tree of order M to perform the following operations:
a. InsertkeystoB-Trees.
b. DisplaytheB-Treekeys.
c. Searchakey.
13 Implement Red-Black trees over a set of integers to perform insert, display and search operations.
1. Identify how C++ standard template library is used to implement ADT.
2. Understand and implement various data structures like hash tables and heaps.
3. Design Sorting algorithmsusing STL library.
4. Design self-balancing tree data structures such as B-Trees and Red Black Trees.
 All laboratory experiments are to be included for practical examination.
 Breakup of marks and the instructions printed on the cover page of answer script to be strictly adhered by the
examiners.
 Students can pick one experiment from the questions lot prepared by the examiners.
 Change of experiment is allowed only once and 20% Marks is to be deducted .


B.E. COMPUTER SCIENCE & ENGINEERING
Batch: 2021-22
VI SEMESTER

B.E COMPUTER SCIENCE AND ENGINEERING

SEMESTER – VI
ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING TECHNIQUES
Course Code N6CSI01 CIE Marks 50
Credits 4.0 Exam Hours 03 Hours
Course objectives:
1. Explain the basics of Artificial Intelligence and Machine Learning algorithms
2. Identify the problems where Artificial Intelligence and Machine Learning techniques are
applicable.
3. Discuss knowledge representation issues and different kind of learning algorithms.
4. Compare learning strategy adopted by various kinds of machine learning algorithms.
Module-1 (08L+4Phrs)
What is artificial intelligence? What is AI? Acting humanly and thinking humanly, thinking
rationally and acting rationally, Intelligent Agents: Agents and Environments, Good Behavior: The
concept of Rationality: Rationality, Omniscience, Learning and autonomy, The nature of
Environments: specifying the task environment, properties of task environments, The structure of
Agents: Agent Programs, simple reflex agents, Model-based reflex agents, Goal-based agents, Utility-
based agents, Learning agents, How the components of agents programme work, Solving problems
by Searching: problem-solving agents, well-defined problems and solutions, Example problems.
Searching for Solutions: infrastructure for search algorithms, measuring problem-solving
performance.
Textbook-1: Chapter 1: 1.1 to 1.5, Chapter 2: 2.1 to 2.5
Module-2 (08L+8P hrs)
Search strategies: Uninformed Search strategies: BFS, uninform-cost search, DFS, depth-limited
search, iterative deepening depth-first search, bidirectional search, comparing uniformed search
strategies, Informed search strategies: Greedy best-first search, A* search, Memory-bounded heuristic
search, learning to search better, Constraint satisfaction problems: ; Example problem: Map coloring,
Example problem: Job-shop scheduling, Variations on the CSP formalism, constraint propagation:
Inference in csps: Node consistency, Arc consistency, Path consistency, K-consistency, Global
constraints, Backtracking search for CSPs; Variable and value ordering, Interleaving search and
inference, Intelligent backtracking: Looking backward
Concept Learning Introduction, Concept Learning:Well Posed Learning problem, Designing
Learning systems, Perspectives and Issues in machine learning, Concept Learning: Introduction, A
Concept Learning Task, Concepts Learning Search, Version Spaces and Candidate Elimination
Algorithm, Remarks on version space and Candidate Elimination.
Textbook-2: Chapter 2: 2.1 to 2.7
Bayesian Learning: Introduction, Bayes Theorem, Bayes Theorem and Concept Learning,
Maximum Likelihood and least squared error hypotheses, Minimum Description Length Principle,
Bayes Optimal Classifier, and Naive Bayes Classifier, An Example: Learning to Classify Text,
Bayesian Belief network, EM Algorithm- General Statements of EM Algorithm.
Textbook-2: Chapter 6: 6.1 to 6.12


Neural Networks: Introduction, Neural Network Representations, Appropriate problems for
Neural Networks, Perceptron’s, Multilayer Networks and Back Propagation Algorithms.
Reinforcement Learning: Introduction, The learning task, Q-Learning, Nondeterministic rewards
and actions, and Temporal difference learning.
Course outcomes:
1. Analyse and develop Artificial Intelligent agents for simple applications.
2. Apply searching algorithms to develop Artificial Intelligent agents.
3. Analyse and apply concept learning tasks to solve applications of ML.
4. Apply Bayesian learning for classification problems.
5. Apply neural networks and reinforcement learning concepts to demonstrate applications in ML
module.
Sl.
No.
Textbooks
Artificial Intelligence: A Stuart 3rd Edition, 2013/

1 Pearson Education
Modern Approach RusselPeterNorvig 4th edition 2020
McGraw Hill
2 Machine Learning Tom M Mitchell 1st Edition, 2017
Education,
Reference Books
Artificial Intelligence: A Stuart Russell,
1 Pearson Education 4th Edition, 2020
Modern Approach Peter Norving
Hands-On Machine Learning
with Scikit-Learn and Tensor
2 Flow: Concepts, Tools, and AurelienGeron Shroff/O'Reilly Media 3rd Edition, 2022.
Techniques to Build Intelligent
Systems
Introduction to Machine EthemAlpaydi

3 PHI Learning Pvt. Ltd 2nd Edition, 2014.
Learning n
StructuresandStrategiesforCom
4 GeorgeFLuger Pearson Education 5th Edition, 2011
plex ProblemSolving

Lab Syllabus:
Implementation of programs on the following Artificial Intelligence concepts:

1. Agent Programs (simple reflex agents, Goal-based agents)
2. Breadth First Search
3. Depth First Search
4. Best First Search
5. A* Search
6. Constraint Satisfaction Problems (CSPs)
7. Candidate Elimination Algorithm
8. Bayes Theorem
9. Bayesian Belief Network
10. EM Algorithm
11. Back Propagation Algorithm
12. Q-learning
13. Temporal Difference Learning
Course outcomes for lab:

1. Apply AI techniques to solve search problems.
2. Design and implement searching and CSP problem using C/Python/PROLOG.
3. Implement concept learning tasks to solve applications of ML.
4. Implement Bayesian learning for classification problems.
5. Implement neural networks and reinforcement learning concepts to demonstrate
applications in ML

B.E COMPUTER SCIENCE AND ENGINEERING

SEMESTER – V
MANAGEMENT AND ENTREPRENEURSHIP
Course Code NSH06 CIE Marks 50
Credits 3.0 Exam Hours 03
Course objectives:
1. Understand the principles and functions of management through planning.
2. Analyze the importance of organizing and staffing in an organization
3. Analyze the importance of leading and controlling in an organization
4. Inculcate entrepreneurial qualities and understand the need of rural entrepreneurship
5. Acquire knowledge about funding agencies, understand procedure in applying for
funds and analyze the cases of successful entrepreneurs
Module-1 (7hrs)
Introduction to Management: Definition of management, management skills,
productivity and effectiveness, efficiency, functions and principles of management.
Planning: Nature of planning, types of plans- purpose of vision, mission, goals,
objectives strategies, policies; steps in planning, MBO, Strategic planning.
Module-2 (9hrs)
Organizing: Formal and informal organization, span of management, the structure and Process
of organizing, Organizational structure: line and staff organization, Functional
organization, matrix organization.
Staffing: Definition, systems approach to HRM, factors affecting staffing, recruitment and selection,
job design, skill and characteristics of a manager, selection process and techniques
Module-3 (6hrs)
Leading: Human factors in managing, motivation, Theory X and Y, the hierarchy of needs
theory, leadership behavior and styles.
Controlling: Basic control process, critical control points and standards, Benchmarking requirements
for effective control
Module-4 (12hrs)
Entrepreneur & Entrepreneurship: Introduction, concept of Entrepreneur, characteristics of an
entrepreneur, and qualities of an entrepreneur, functions of an entrepreneur, characteristics of
entrepreneurship, factors affecting entrepreneurial growth. Entrepreneurship and economic
development-rural, woman and social entrepreneurship
Financing and Institutional Support for Entrepreneurship: Startups, business plans,
venture capitalists, angel investors, funding agencies -commercial banks, development banks,
NBFCS and incubation centres. Innovations and project trends.
Module-5 (5hrs)
Taxation benefits: Depreciation allowances, rehabilitation allowance, investment allowance and
other tax concession benefits to an entrepreneur.
Case studies
1. Happily Bootstrapping: Zoho CEO Sridhar Vembu (2007)
2. Thought Leaders in Cloud Computing: Sridhar Vembu, CEO of Zoho (2016)
3. Building India’s Amazon: Flipkart CEO Sachin Bansal
Rohith Bhat’s Exhilarating Journey with Robosoft from Udupi,

TEXT BOOKS
1 Harold Koontz, Heinz Essentials of Management, McGraw Hill Education,
Weihric 10th Edition, 2015
2 Lucy C. Morse Managing Engineering and Technology, Pearson
Education, 6th Edition, 2015.
3 S.S. Khanka Entrepreneurial Development, S. Chand Publishing,
4th Edition, Reprint, 2020, ISBN 978-81-219-1801-5
REFERENCE BOOKS
1 James A.F. Stoner, R. Edward Freeman, Management, Pearson Education,
Daniel R. Gilbert 6th Edition, 2018
Course Outcomes:
Upon completion of this course the student will be able to:
CO1 Explain various functions of management (L2).
CO2 Apply the knowledge of management principles and strategies in various functional
areas such as organizing and staffing. (L3).
CO3 Apply the knowledge of management principles and strategies in various functional
areas such as Leading and Controlling. (L3).
CO4 Describe entrepreneurship, its characteristics, and benefits and identify various
funding sources for starting a business venture (L3).
CO5 Explain various taxation benefits enjoyed by an entrepreneur and analyze the
characteristics and strategies adopted by successful entrepreneurs. (L2 & L3)
Course Articulation Matrix:
Mapping of Course Outcomes (COs) to Program Outcomes (POs) & Program Specific
Outcomes (PSOs)
POs PSOs
1 2 3 4 5 6 7 8 9 10 11 12 PSO1 PSO2 PSO3
CO1 3 1 3
CO2 3 3 3
COs
CO3 3 3 3
CO4 3 2 2 3 3
CO5 3 3 3 3


SEMESTER – VI
SOFTWARE INDUSTRY SKILLS FOR EXCELLENCE
Course Code NCS6PE11 CIE Marks 50
Course objectives:
1. Explain the nature and dynamics of a software industry, roles and responsibilities of people and
typical processes involved in designing, developing, and maintaining software work products.
2. Describe various software architectures and patterns.
3. Describe various technologies typically used in the software enterprise.
4. Describe various ways of learning new programming languages, frameworks, databases,
integration technologies, utilities, and different ways of quickly understanding pre-written code in
unfamiliar contexts.
5. Explain various best practices that can be applied to excel in any given context within the
software enterprise.
Module-1 (8 hrs)
Overview of the Software Industry
1.1 Introduction to the Course: Knowledge and Knowledge Industry; Organization of the Software
Industry; Functional, Projectized, Matrix Organization
1.2 Organizations, Roles and Activities: General Organization of a Software Company; Support
Functions; Popular Business Regions of the World; Role versus Designation; Technical
Organization; Tech Lead
1.3 Processes within the Software Industry: SDLC; Software Career Streams; Software
Development Process: Generic; Mother of all Processes: PDCA; Planning;Requirements
Analysis; Software Design; Coding Standards; Software Testing; Software Deployment;
Software Maintenance; Seven R Strategy
1.4 Defects and SQA:The Software Defect; Terminology; Defect Injection; Catch it As Early as
Possible; Defect Life Cycle; Types of Defects; What Causes Defects? Root Cause Analysis;
Root Causes for Software Defects; Top 20 Reasons for Software Defects; Defect Fixing
Lifecycle; Reviews; Software Quality Assurance; Software Audits
1.5 Software Process Maturity Models:Overview; Software Maturity; ISO 9001; ISO 9001: Seven
Key Principles; ISO 9001 and PDCA; Capability Maturity Model
1.6 Software Industry Myths: Types of myths; Popular Myths
Module-2 (10hrs)
Overview of Software Architectures

2.1 Software Architectures:Overview; Why is it needed? Architecture related Activities: How is
Architecture Documented? Definitions; Famous Architecture Patterns; Architecture Types;
Blackboard Architecture; Client Server Architecture; N – Tier Architecture; Domain Driven
Application Architecture; Combining Architectures; Onion Architecture; Aspect-Oriented

Architecture; Service Oriented Architecture; Microservices Architecture; Lambda Architecture;

Event-driven Architecture; Architecture Changes Over Time;
2.2 Web Application Architecture:Components; Web Application Characteristics; BOM and DOM;
ECMA Standards; JavaScript; JQuery; AJAX
2.3 SaaS Architecture:Overview; Advantages; Disadvantages; Security Concerns; SaaS
Architecture; Single vs Multi-Tenant Model; Database Architecture for SaaS; Multi-tenant
Databases; SaaS Technologies; Typical Architectures
2.4 Mobile App Architecture:Overview; Mobile Apps: Considerations; Typical 3 Layered
Architecture; Types of Mobile App Architectures; Android Mobile Application Architecture;
iOS Mobile Application Architecture; Hybrid Mobile Application Architecture; Cross Platform
Mobile Application Architecture; How to choose the architecture?
2.5 Embedded Systems Architecture:Overview; Embedded Systems Architecture; Applications;
Advantages and Disadvantages; Siemens and AutoSAR Architectures; Embedded Systems
versus IoT
2.6 AI and ML Systems Architecture:Overview; AI Framework, Model and Platform; AI
Workflow; AI Architecture Description; Data Flow in AI models; Data Pipeline; AI Model for
Defect Prediction;
Module-3 (10hrs)
Overview of Technologies
3.1 Technology stacks:Introduction; Technology Stack Components; Popular Choices; Examples;
Various Technology Stacks; Technology Stacks for Creative Agencies; Android Technology
Stack; Business Technology Stacks; Technology Stacks for Marketing, Sales, Services
3.2 Front-end technologies:Front End; DOM and BOM; Minium set of technologies; Full set of
Front-End Technologies; Frontend Technology wheel; Popular CSS Frameworks; Popular JS
Frameworks; Comparison of Frameworks; Communication between Front & Backend
3.3 Programming languages:Backend; Types of Programming Languages; Characteristics of
Programming Languages; Top 10 Languages; TIOBE Index; Characteristics of Javascript,
Python, Ruby, PHP, Java, C#, Perl, C++, Kotlin, Scala
3.4 Databases:Overview; Usage Types; Various Database Technologies; Types of Databases;
History of Databases; Brewer's Theorem; Relational Databases; NoSQL Databases; RDBMS
versus NoSQL; Types of NoSQL Databases; Cloud, Multi-Tenant Databases; Columnar
Databases; Wide Column Databases; Object Oriented Databases; Key-Value Databases;
Hierarchical Databases; Document Databases; Graph Databases; Time series Databases;
Sharing Architectures for Databases; Database Scalability; ACID and BASE Features;
3.5 DevOps:Overview; Why do we need DevOps? DevOps Principles; DevOps Architecture;
DevOps Components; Infinite DevOps Cycle; DevOpsTechnologiesDevOps versus Agile;
DevOps and DevSecOps; Overview of Continuous Development, Continuous Integration,
Continuous Testing and Continuous Deployment; Azure DevOps; GitHubDevOps; AWS
DevOps; DevOps Advantages; DevOps Disadvantages
3.6 Mobile applications:Mobile App Development Trends; Choices and comparison; Native App
Development; Hybrid App Development; Cross Platform App Development;
3.7 AI and ML libraries and tools:Three Dimensions of AI; AI Use Cases; AI Algorithms;

Classification Algorithms; Regression Algorithms; Clustering Algorithms; Python Libraries for

AI
3.8 Data analytics technologies:Overview; Data Analytics Trends; Five Key Focus Areas; Typical
Architecture; Infrastructure of Big Data; Technology Providers; What enables Data Analytics?
Top 10 Technologies for Data Analytics
3.9 Cloud: IaaS, cloud: PaaS and useful SaaS:Overview; Features of Cloud Computing;
Advantages of Cloud Computing; Cloud Architecture; Cloud Service Models; Cloud
Deployment Models; Cloud – Layer wise Provisioning; Cloud Technologies; Business Cloud
Technologies; Cloud Native; Cloud Native Landscape
Module-4 (4hrs)
Learning and Innovation

4.1 Introduction to the art of learning – Changing styles of learning – Techniques to learn about
new technologies or unknown software systems at a higher level
4.2 Various Learning Techniques: Techniques to quickly learn someone else’s code, Techniques to
uncover hidden code, Learning from data- Nontechnical ways of learning, Learning through
self-expression
4.3 Learning Platforms: Web platforms available for continuous learning– Art of learning from
peers
4.4 Introduction to innovation – Myths and realities
4.5 Types of Innovation: Innovation within software enterprises – Team Innovations – Individual
Innovation –Creating blue oceans – Examples from the industry
Module-5 (7hrs)
Hands On Learning
a. Mastering various front-end technologies:Angular, React, VueJS
b. Mastering new programming languages:Dart, Kotlin
c. Mastering unknown databases:GraphQL
d. Mastering tools and utilities:D3JS
e. Best Practices for Technical Excellence
f. Generative AI – ChatGPT:Overview, Handson practice
Course outcomes:
1. Illustrate the basic operational concepts of a software house and discuss itsperformance.
2. Explain various software architectures and apply the same to describe any given software.
3. Name and describe a set of currently active and futuristic technologies; Identify and classify a given
software technology and benchmark it with respect to the top-most technology of the class.
4. Master an unfamiliar front-end technology, new programming language, unfamiliar database, tool or a
utility with relative ease.
5. Explain how organization, teams and individuals innovate.


module.
Sl. Edition and

Title of the Book Name of the Author/s Name of the Publisher
No. Year
Textbooks
Super Techie: Ways to Excel in

T1 MaheshaPandit 2023
the Software Industry
Reference Books
R1 Seven Languages in Seven Bruce A Tate O′Reilly 1st Edition

Weeks: A Pragmatic Guide to
2010
Learning Programming
Languages
R2 Seven Databases in Seven Weeks: Luc Perkins, Eric O′Reilly 2nd Edition
A Guide to Modern Databases Redmond, Jim Wilson
2018
and the NoSQL Movement
R3 Code Complete: A Practical Steve McConnell Microsoft Press US 2nd Edition

Handbook of Software
2004
Construction
Web Resources
W1 Software Industry: https://en.wikipedia.org/wiki/Software_industry
W2 Software Architecture: https://en.wikipedia.org/wiki/Software_architecture
W3 Solution Stacks: https://en.wikipedia.org/wiki/Solution_stack
W4 TIOBE Index: https://www.tiobe.com/tiobe-index/
W5 Study Skills: https://en.wikipedia.org/wiki/Study_skills


SEMESTER – VII
HIGH PERFORMANCE COMPUTING
Course objectives:
1. To analyse typical parallel algorithm models and its application in scientific computing. (Analysis,
Application)
2. To develop programs using message-passing paradigm. (Synthesis)
3. To learn how GPUs works using the CUDA architecture and its applications (Comprehension,
Application)
4. To gain practical knowledge by giving hands on experience inGraphics Interoperability, CUDA C
on multiple GPUs and CUDA toolkit (Synthesis)
5. To analyze the latest parallel computing techniques and research - prepare a technical document
and make a presentation (Analysis, Syntheses and Evaluation)
To develop open ended solution for any of the identified high performance computing problems
Module 1 8 Hours
Principles of Parallel Algorithm Design: Preliminaries (Chapter section - 3.1) ,Decomposition
Techniques (3.2), Characteristics of Tasks and Interactions (3.3) ,Mapping Techniques for Load
Balancing (3.4),
Basic Communication Operations: One-to-All Broadcast and All-to-One Reduction(Section 4.1) , All-
to-All Broadcast and Reduction (Section 4.2)
Analytical Modeling of Parallel Programs: Sources of Overhead in Parallel Programs(5.1) , the Effect
of Granularity on Performance (5.3).Text Book 1: Chapter 3 – Section 3.1, 3.2, 3.3, 3.4, Chapter 4 –
Sections 4.1, 4.2,Chapter 5 – Sections 5.1, 5.3
Module 2 7 Hours
Programming Using the Message-Passing Paradigm:
Principles of Message-Passing Programming (Section 6.1) , The Building Blocks: Sendand Receive
Operations (6.2) , MPI: the Message Passing Interface (6.3)Text Book 1 : Chapter 6 – Section 6.1, 6.2, 6.3
Module 3 8 Hours
Programming Shared Address Space Platforms:
Thread Basics (Section 7.1) , Why Threads? (7.2) , The POSIX Thread API (7.3) ,Thread Creation and
Termination (7.4) , Synchronization Primitives in Pthreads (7.5) ,Controlling Thread and Synchronization
Attributes (7.6) , Thread Cancellation (7.7),Composite Synchronization Constructs (7.8) , OpenMP: a
Standard for Directive BasedParallel Programming (7.10)
Text Book 1: Chapter 7 – Section 7.1, 7.2, 7.3, 7.4, 7.5, 7.6, 7.7, 7.8, 7.10
Module 4 8 Hours
Why CUDA? Why Now?: The Age of Parallel Processing, Central Processing Units,The Rise of GPU
Computing, A brief history of GPUs, Early GPU computing, CUDA,What is CUDA architecture, using
the CUDA architecture, Applications of CUDA,Medical Imaging, Computational Fluid Dynamics,
Environmental Science, Introductionto CUDA C: A First Program, Hello world, A kernel call, Passing

parameters, Queryingdevices, using device properties, Parallel Programming in CUDA C:CUDA parallel
programming, Summing vectors, A fun example. (Text Book 2: Chapter 1 – Section1.2, 1.3, 1.4, 1.5,
Chapter 3 – Section 3.2, 3.3, 3.4, Chapter 4 – Section 4.2)
Module 5 8 Hours
Graphics Interoperability: Graphics Interoperation, GPU Ripple with Graphics Interoperability - the
GPUAnimBitmap structure; GPU Ripple Redux , Heat transfer with Graphics Interop, DirectX
Interoperability
CUDA C ON multiple GPUS : Zero-Copy Host Memory -Zero-Copy Dot Product; Zero-Copy
Performance, Using Multiple GPUs, Portable Pinned Memory
CUDA Tools: CUDA Toolkit- CUFFT, CUBLAS, NVIDIA GPU Computing SDK, Debugging CUDA C
Text Book 2: Chapter 8 – Section 8.2, 8.3, Chapter 11 – Section 11.2, 11.3, 11.4,Chapter 12
Topics for Open Ended Activity :
Self Learning component
Parallel Computing models, parallel virtual machines and usage, Data-Parallel Algorithms, Graphics
Interoperability, Parallel Computing Strategies, Linear Algebra Image/Video Processing computation,
Data Compression, Physically-Based Simulation, Parallel pragma/directive based frameworks, Usage
and Performance analysis and comparisons– FPGA, GPUs, GP-GPUS, CPU-GPUs, Analysis of HPC
Benchmark Suite/Tools/Solutions/Standard etc, and so on.
Course outcomes:
1. Apply and Analyze various parallel algorithm models
2. Develop programs using message-passing paradigm.
3. Apply and Analyze the Synchronization primitives and parallel pragma directives
4. Analyse the CUDA Architecture and develop parallel programs
5. Design and develop parallel programs using CUDA GPU interoperability and CUDA tools.
6. Do Literature Survey on parallel computing platform -prepare technical report and present before
audience convincingly. Also, Create open ended frameworksolution for various high performance
computing problems
Sl. Name of the

Title of the Book Name of the Author/s Edition and Year
No. Publisher
Textbooks
Introduction to parallel Ananth Grama,AnshulGu
Pearson
computing pta,Vipinkumar,GeorgeK
1 education second edition
(chapters 01,2.1-2.5,3,4.1.1- arypis
publishers
4.1.3, 5.1, 5.2, 5.3, 6,7)
CUDA by example
Jason Sanders NVIDIA
2 (Chapters 1 ,3, 2011
Edward Kandrot Corporation
4, 5, 8, 11, 12)
Reference Books
Parallel Programming for Thomas Rauber and International
1
Multicore and cluster systems GudulaRunger Springer
Edition,2009
Computer Architecture: A Hennessey and Patterson Morgan
2
quantitative Approach Kaufman
Parallel Programming in C
3 Michael J.Quin McGraw Hill
with MPI and Open MP


SEMESTER – VI
BIG DATA
Course objectives:
1. Describe the basic concepts , technology , evolution and applications of Big Data.
2. Explain the architecture , components and technology of Big Data Ecosystem that can manage , process and
analyze Big Data.
3. Study how the data is stored in databases and data warehouses.
4. Identify the importance of big data stack architecture in effective analysis of big data.
5. Describe the basic MapReduce Programming Model and Applyit to solve real world application problems.
6. Describe the requirement of Hive &Oozie tools for Big Data access and monitoring .
Module-1 (07hrs)
Getting an Overview of Big Data: What is Big Data? History of Data, Management – Evolution of Big
Data, Structuring Big Data, Types of Data, Elements of Big Data, Volume, Velocity, Variety, Veracity,
Big Data Analytics, Careers in Big data, Advantages of Big Data Analytics, Future of Big Data.[ Chapter-
1]
Exploring the Use of Big Data in Business Context: Use of Big Data in Social Networking, Business
Intelligence, Marketing, Product Design and Development, Use of Big Data in Preventing Fraudulent
Activities, Preventing Fraud Using Big Data Analytics, Use of Big Data in Retail Industry, Use of RFID
Data in Retail[ Chapter-2]
Introducing Technologies for Handling Big Data: Distributed and Parallel Computing for Big
Data,How data models and computing models are different, Introducing Hadoop, HDFS and MapReduce,
How does Hadoop Function? Cloud Computing and Big Data, Cloud Services for Big Data, In-Memory
Computing Technology for Big Data[Chapter-3]
Module-2 (08 hrs)
Understanding Hadoop Ecosystem:HadoopEcosystem,Hadoop Distributed File System, HDFS
Architecture, Concepts of Blocks in HDFS Architecture, NameNodes and DataNodes, The command
line interface, Using HDFS Files , Hadoop specific File System Files, HDFS
commands,Theorg.apache.hadoop.io.package,HDFS High Availability , Features of HDFS, MapReduce,
Hadoop Yarn, Introducing HBase, HBase Architecture, Regions, Storing Bigdata with HBase, Interacting
with the Hadoop Ecosystem, HBase in Operation –Programming with HBase, Combining HBase and
HDFS, REST and Thrift, Data Integrity in HDFS, Features of HBase ,hive, Pig and Pig Latin, Sqoop,
Zookeeper, Flume, Oozie[ Chapter-4]
Understanding Big Data Technology Foundations: Exploring the Big Data Stack, Data Sources Layer,
Ingestion Layer, Storage Layer, Physical Infrastructure Layer, Platform Management Layer, Security
Layer, Monitoring Layer, Analytics Engine, Visualization Layer, Big Data Applications, Virtualization
and Big Data,Virtualization Approaches, Server virtualization, Application Virtualization, Network
Virtualization, Processor and Memory Virtualization, Data and Storage Virtualization, Managing
Virtualization with Hypervisor. Implementing Virtualization to work with Big data.[ Chapter-6]
Module-3 (08 hrs)
Understanding MapReduce Fundamentals and HBase: The MapReduce Framework. Exploring the
Features of MapReduce. Working of MapReduce. Exploring Map and Reduce Functions. Techniques to
Optimize MapReduce Jobs. Hardware/Network Topology, Synchronization, File System. Uses of
MapReduce. Role of HBase in Big Data Processing. Characteristics of HBase .
Storing Data in Databases and Data Warehouses: RDBMS and Big Data, CAP Theorem, Issues with

the Relational Model, Non-Relational Database, Issues with the Non-Relational Model, Polyglot
Persistence, Integrating Big Data with Traditional Data Warehouses, Big Data Analysis and Data
Warehouse, Changing Deployment Models in Big Data Era[ Chapter-7]
Module-4 (08 hrs)
Processing Your Data with MapReduce: Recollecting the Concept of MapReduce Framework,
Developing Simple MapReduce Application, Building the Application, Executing the Application, Points
to Consider while Designing MapReduce.[ Chapter-8]
Customizing MapReduce Execution:
Controlling MapReduce Execution with InputFormat, InputSplit, RecordReader, FileInputFormat,
Implementing InputFormat for Compute-Intensive Applications, Implementing InputFormat to control the
Number of Maps, Implementing InputFormat for Multiple HBase Tables, Reading Data with Custom
RecordReader, Organizing Output Data with OutputFormats, Customizing Data with RecordWriter,
Optimizing MapReduce Execution with Combiner, Controlling Reducer Execution with Partitioners.
[ Chapter-9]
Module-5 (08 hrs)
Exploring Hive: Introducing Hive, Getting Started with Hive,Hive services, Hive Variables, Hive
Properties, Hive Queries, Data Types in Hive, Built-In Functions in Hive, Hive DDL, Creating Databases,
Viewing a Database, Dropping a Database, Altering Databases, Creating Tables, Creating a Table Using
the Existing Schema, Dropping Tables, Altering Tables, Using Hive DDL Statements, Data Manipulation
in Hive, Loading Files into Tables, Inserting Data into Tables, Update in Hive, Delete in Hive, Using Hive
DML Statements, Data Retrieval Queries, Using the SELECT Command, Using the WHERE Clause,
Using the GROUP BY Clause, Using the HAVING Clause, Using the LIMIT Clause, Executing HiveQL
Queries, Using JOINS in Hive, Inner Joins, Outer Joins, Cartesian Product Joins, Map-Side Joins, Joining
Tables.
[ Chapter-12]
Using Oozie: Introducing Oozie, Main Functional Components of Oozie, Benefit of Oozie, Installing and
Configuring Oozie, Understanding the Oozie Workflow, Execution of Asynchronous Actions in Oozie,
Implementing the Oozie Workflow, Oozie Recovery Capabilities, Oozie Workflow Life Cycle, Oozie
Coordinator, Types of Oozie Coordinator, Oozie Coordinator Lifecycle Operations, Oozie Bundle, Oozie
Parameterization with EL, Workflow Functions, Coordinator Functions, Bundle Functions, EL Functions,
Oozie Job Execution Model, Accessing Oozie, Oozie SLA, Event Status, SLA Status ,Oozie Activity, The
Oozie SLA Subsystem, SLA Language Schema . [ Chapter-13]
Course outcomes:
1. Apply the basic knowledge related to Bigdata , its elements , its analytics , its usage in
business context , computing in Bigdata etc. to the solutions of complex real world
engineering problems.
2. Select and apply appropriate modern tools of Hadoop ecosystem to the solution of various
problems in storage , processing , accessing , managing and analyzing the Bigdata.
3. Design and Develop MapReduce programs to the solution of various real world application
problems.
4. Identify the importance of the different layers of Bigdata Stack architecture in effective
analysis of Bigdata.
5. Analyze the merits of using modern data warehouses against the limitations of Traditional
Databases.
6. Identify the requirement of Hive and Oozie tools for Bigdata access and monitoring.


module.
Sl. Name of the

Title of the Book Name of the Publisher Edition and Year
No. Author/s
Textbooks
BIG DATA Black Book D T Editorial Dreamtech press 2016
1
Services
Reference Books
1 Big Data Glossary Pete Warden O’Reilly 2011

Hadoop: The Definitive Guide Tom White O’Reilly 4thEdition,2015
2
SeemaAcharya
Wiley India
3 Big Data and Analytics ,SubhashiniCh May 2015
Publications,
ellappan,


SEMESTER – VI
FOUNDATIONS OF DATA SCIENCE
Course objectives:
1. Describe the concept of data science, its scope in business and explain the available techniques.
(L1,L2)
2. Understand Predictivemodeling, explain supervised segmentation and given data set should be
able to select (through solving) the attribute for segmentation using the available techniques.
(L2,L3)
3. Explain the concept of Classification and classify (solve) a given data set. (L3)
4. Understand and describe the concept of similarity, neighbors and clustering and apply it for any
real world data(L3, L4)
5. Explain the concepts of mining text and other data science tasks and techniques. (L2, L4)
Module-1 (7 hrs)
Introduction: Data-Analytic Thinking: The Ubiquity of Data Opportunities, Example: Hurricane
Frances, Example: Predicting Customer Churn. Data Science, Engineering, and Data-Driven Decision
Making, Data Processing and “Big Data”, Data and Data Science Capability as a Strategic Asset,
Data-Analytic Thinking.
Business Problems and Data Science Solutions: From Business Problems to Data Mining Tasks,
Supervised Versus Unsupervised Methods, Data Mining and Its Results, The Data Mining Process,
Business Understanding, Data Understanding, Data Preparation, Modeling, Evaluation, Deployment,
Other Analytics Techniques and Technologies: Statistics, Database Querying, Data Warehousing,
Regression Analysis, Machine Learning and Data Mining.
Textbook 1: Chapter 1,2
Module-2 (8hrs)
Introduction to Predictive Modeling: From Correlation to Supervised Segmentation Models,
Induction, and Prediction, Supervised Segmentation, Selecting Informative Attributes Example:
Attribute Selection with Information Gain, Supervised Segmentation with Tree- Structured Models,
Visualizing Segmentations, Trees as Sets of Rules, Probability Estimation, Example: Addressing
the Churn Problem withTreeInduction.
Textbook 1: Chapter 3
Module-3 (8hrs)
Fitting a Model to Data: Classification via Mathematical Functions: Linear Discriminant Functions,
Optimizing an Objective Function, An Example of Mining a Linear Discriminant from Data, Linear
Discriminant Functions for Scoring and Ranking Instances, Support Vector Machines briefly,
Regression via Mathematical Functions, Class Probability Estimation and Logistic “Regression”.
Logistic Regression: Some Technical Details. Example: Logistic Regression versus Tree Induction,
Non Linear Functions, Support vector machines and Neural Networks
Over fitting and Its Avoidance: Fundamental Concepts, Exemplary Techniques, Regularization,
Genaralization,Over fitting, Over fittingExamined.
Textbook 1: Chapter 4,5
Module-4 (8 hrs)
Similarity, Neighbors, and Clusters: Similarity and Distance, Nearest-Neighbor Reasoning,
Example: Whiskey Analytics, Nearest Neighbors for Predictive Modeling, How Many Neighbors and
How Much Influence? Geometric Interpretation, Overfitting, and Complexity Control. Issues with

Nearest-Neighbor Methods. Some important Technical Details Relating to Similarities and neighbors.
Clustering, Example: Whiskey Analytics Revisited, Hierarchical Clustering, Nearest Neighbors
Revisited: Clustering Around Centroids. Understanding the Resultsof Clustering.
Textbook 1: Chapter 6
Module-5 (8hrs)
Decision Analytic Thinking I: What is a Good Model?: Evaluating Classifiers Plain Accuracy
and its Problems, The confusion matrix, Problems with unbalanced Classes, Problems with Unequal
Costs and Benefits.
Representing and Mining Text: Why Text Is Important? Why Text Is Difficult? Representation,
Bag of Words, Term Frequency, Measuring Sparseness: Inverse Document Frequency, Combining
Them: TFIDF, Example: Jazz Musicians
Other Data Science Tasks and Techniques: Co-occurrences and Associations: Finding
Items That Go Together, Measuring Surprise: Lift and Leverage, Example: Beer and Lottery
Tickets, Associations Among Facebook Likes, Profiling: Finding Typical Behavior, Link
Prediction andSocialRecommendation.
Textbook 1: Chapter 7,10,12
Course outcomes:
1. Apply the knowledge of mathematics to explain the concept of data science, the available
techniques in data science and its scope in business.
2. Develop a Decision tree based on supervised segmentation and predict the class for a given
data set by selecting (through solving) the attribute for segmentation using the available
techniques.
3. Analyze the given data set, and solve a problem by performing Classification using the basics
of mathematics and data science.
4. Develop solutions to group entities in data set and apply it for the given real world data using
the basic knowledge of similarity, neighbour’s and clustering
5. Analyze the importance of mining text (social data) and formulate the association rules based
on market basket analysis.
module.
Sl.
No.
Textbooks
Foster Provost and Tom
1 Data Science for Business O’Reilly Media, First Edition, 2013
Fawcett
Reference Books
Doing Data Science Rachel Schutt& Cathy
1 O’Reilly Media, First Edition, 2013
O’Neil,
Practical Data Analysis First Edition,
2 Hector Cuesta, Packt
2013


SEMESTER – VI
MOBILE APPLICATION DEVELOPMENT LABORATORY
Course Code N6ADL01 CIE Marks 50
TeachingHours/Week (L:T:P) (0:0:2) SEE Marks 50
Course objectives:
1. Learn to setup Android application development environment and AI technologies.
2. Develop native mobile apps to extend databases and use them with respect to AI
context.
3. Learn to develop user interfaces for interacting with apps and triggering actions.
4. Interpret tasks used in handling multiple activities.
5. Identify options to save persistent application data.
Sl. Experiments
no.
1 Develop an application to set an image as wallpaper. On click of a button, the wallpaper
image should start to change randomly every 30 seconds.
Write a program to create an activity with two buttons START and STOP. On pressing of the
START button, the activity must start the counter by displaying the numbers from One and
the counter must keep on counting until the STOP button is pressed. Display the counter
value in a Text View control.
3 Develop a simple application with one Edit Text so that the user can write some text in it. Create
a button called “Convert Text to Speech” that converts the user input text into voice.

4 Create a SIGN Up activity with Username and Password. Validation of password should
happen based on the following rules:
 Password should contain uppercase andlower case letters.
 Password should contain lettersand numbers.
 Password should containspecial characters.
 Minimum length of the password (the default valueis8).
On successful SIGN UP proceed to the next Login activity. Here the user should SIGN IN
using the Username and Password created during signup activity. If the Username and
Password are matched then navigate to the next activity which displays a message saying
“Successful Login” or else display a toast message saying “Login Failed”. The user is given
only two attempts and after that display a toast message saying “Failed Login Attempts” and
disable the SIGN IN button. Use Bundle to transfer information from one activity to another.
5 Develop an application to demonstrate the use of Asynchronous tasks in android. The

asynchronous task should implement the functionality of a simple background task
integrating Google Map. On pressing the Start Map button, the map should be loaded to the
view. On pressing the Current Locationbutton, the view should show the user current
location in Map.
6 Create two files of XML and JSON type with values for City Name, Latitude, Longitude,
Temperature and Humidity. Develop an application to create an activity with two buttons to
parse the XML and JSON files which when clicked should display the data in their
respective layouts side by side.

7 Create an activity like a phone dialer with CALL and SAVE buttons. On pressing the CALL
button, it must call the phone number and on pressing the SAVE button it must save the
number to thephone contacts.
8 Write a program to enter Medicine Name, Date and Time of the Day as input from the user
and store it in the SQLite database. Input for Time of the Day should be either Morning or
Afternoon or Evening or Night. Trigger an alarm based on the Date and Time of the Day
and display the MedicineName.

9 Create an application to demonstrate a basic media player that allows the user to Forward,
Backward, Play and Pause an audio. Also, make use of the indicator in the seek bar to move
the audio forward or backward as required.
10 Create an AIDL service that calculates Car Loan EMI. The formula to calculate EMI is
E = P * (r(1+r)n)/((1+r)n-1) ,where
E = The EMI payable on the car loan
amount P = The Car loan Principal
Amount
r = The interest rate value computed on a monthly
basis n = The loan tenure in the form of months
The down payment amount has to be deducted from the principal amount paid
towards buying the Car. Develop an application that makes use of this AIDL service
to calculate the EMI. This application should have four Edit Text to read the Principal
Amount, Down Payment, Interest Rate, Loan Term (in months) and a button named as
“Calculate Monthly EMI”. On click of this button, the result should be shown in a
Text View. Also, calculate the EMI by varying the Loan Term and Interest Rate
values.
Note: Develop the Android application for AI based problem statements as an open ended project.
Course outcomes:
1. Implement user interfaces for interacting with apps and triggering actions
2. Synthesize tasks used in handling multiple activities, Computations and Processing
3. Articulate options to save AI application data.
4. Develop Android applications related to mobile related server-less database like SQLITE.
5. Apply Google Map interface, MP3 audio interface, Text to Speech interface to develop
interactive AI context applications.
1. All laboratory experiments are to be included for practical examination.
2. Breakup of marks and the instructions printed on the cover page of answer script to be strictly adhered
bythe examiners.
3. Students can pick one experiment from the questions lot prepared by the examiners.
4. Change of experiment is allowed only once and 20% Marks is to be deducted.


CSE 160 Credits Syllabus V To VI NEP 1 Print

Uploaded by

Copyright:

Available Formats

CSE 160 Credits Syllabus V To VI NEP 1 Print

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

CSE 160 Credits Syllabus V To VI NEP 1 Print

Uploaded by

Copyright:

Available Formats

Scheme of Teaching, Examination and Syllabus

B.E. COMPUTER SCIENCE AND ENGINEERING

SreeSiddaganga Education Society®

SCHEME OF TEACHING AND EXAMINATION (160 Credits Scheme)

Siddaganga Institute of Technology, Tumakuru-

Professional Elective Courses (PEC):

Open Elective Courses:

Siddaganga Institute of Technology, Tumakuru-

INT3 Research Internship/ Industry Internship/Rural Internship

Siddaganga Institute of Technology, Tumakuru-

Scheme of Teaching, Examination and Syllabus

Siddaganga Institute of Technology, Tumakuru-03 Page 4

B.E COMPUTER SCIENCE & ENGINEERING

Siddaganga Institute of Technology, Tumakuru-03 Page 5

Module-5 (08L+ 6P hrs)

Siddaganga Institute of Technology, Tumakuru-03 Page 6

Question paper pattern:

Sl. Name of the

Siddaganga Institute of Technology, Tumakuru-03 Page 7

B.E COMPUTER SCIENCE & ENGINERRING

Siddaganga Institute of Technology, Tumakuru-03 Page 8

Introduction to Automata John E. Hopcroft,

Compiler Construction Cambridge University

Siddaganga Institute of Technology, Tumakuru-03 Page 9

B.E COMPUTER SCIENCE & ENIGEERING

Siddaganga Institute of Technology, Tumakuru-03 Page 10

3.3 Software Evolution: Software Evolution (T1-9.1); Legacy Systems (T1-9.2);

Siddaganga Institute of Technology, Tumakuru-03 Page 11

SoftwareEngineering Pearson 10th

W2 PMBOK 7thEdition Summary

Siddaganga Institute of Technology, Tumakuru-03 Page 12

B.E COMPUTER SCIENCE & ENGINERRING

Siddaganga Institute of Technology, Tumakuru-03 Page 13

Fog Computing. Selected Applications of Fog Computing.

Question paper pattern:

Sl. Name of the

Kai Hwang, Geoffrey Morgan

Siddaganga Institute of Technology, Tumakuru-03 Page 14

B.E COMPUTER SCIENCE & ENGINERRING

Siddaganga Institute of Technology, Tumakuru-03 Page 15

CO1: Describe the fundamentals of database technologies.

Siddaganga Institute of Technology, Tumakuru-03 Page 16

B.E COMPUTER SCIENCE & ENGINERRING

Siddaganga Institute of Technology, Tumakuru-03 Page 17

Siddaganga Institute of Technology, Tumakuru-03 Page 18

Conduct of Practical Examination:

Siddaganga Institute of Technology, Tumakuru-03 Page 19

B.E COMPUTER SCIENCE & ENGINERRING

Introduction: • Components of Environment and their interactions

Siddaganga Institute of Technology, Tumakuru-03 Page 20

Solid Waste Management:

Question paper pattern:

The question paper pattern for CIE and SEE is as follows:

Sl.No Title of the Book Author/s Publisher Year

B.E COMPUTER SCIENCE & ENGINERRING

Siddaganga Institute of Technology, Tumakuru-03 Page 21

Design and develop Real-time applications in JavaScript using

7 Design and develop Real-time applications for Handling Events.

Siddaganga Institute of Technology, Tumakuru-03 Page 22