1
KARNATAK LAW SOCIETY‟S
GOGTE INSTITUTE OF TECHNOLOGY UDYAMBAG, BELAGAVI-590008
(An Autonomous Institution under Visvesvaraya Technological University, Belagavi)
(APPROVED BY AICTE, NEW DELHI)
(Accredited by NAAC with A+ Grade)
Department of Information Science & Engineering
Scheme and Syllabus (2015 Scheme)
IV Semester
Information Science & Engineering
2
INSTITUTION VISION
Gogte Institute of Technology shall stand out as an institution of excellence in technical
education and in training individuals for outstanding caliber, character coupled with creativity
and entrepreneurial skills.
MISSION
To train the students to become Quality Engineers with High Standards of Professionalism and
Ethics who have Positive Attitude, a Perfect blend of Techno-Managerial Skills and Problem
solving ability with an analytical and innovative mindset.
QUALITY POLICY
Imparting value added technical education with state-of-the-art technology in a congenial,
disciplined and a research oriented environment.
Fostering cultural, ethical, moral and social values in the human resources of the institution.
Reinforcing our bonds with the Parents, Industry, Alumni, and to seek their suggestions for
innovating and excelling in every sphere of quality education.
DEPARTMENT VISION
To be recognized as center of Excellence for Education, research and entrepreneurial skills in
the field of Computer Science and Engineering with an aim of building creative IT
professionals to meet global challenges.
MISSION
To train the students, to cultivate inquisitive mindset for identifying and analyzing real life
problems and develop optimal computer solutions for the benefit of the society.
PROGRAM EDUCATIONAL OBJECTIVES (PEOs)
1. The graduates will acquire core competence in basic science and engineering
fundamentals necessary to formulate, analyze and solve engineering problems and to
pursue advanced study.
2. The graduates will acquire necessary techno-managerial and life-long learning skills to
succeed as computer engineering professionals with an aptitude for higher education
and entrepreneurship.
3. The graduates will maintain high professionalism and ethical standards and also develop
the ability to work in teams on IT as well as multidisciplinary domains.
3
PROGRAM OUTCOMES (POs)
1. Graduates will demonstrate the knowledge of mathematics, basic sciences, logical
reasoning and engineering.
2. Graduates will demonstrate the ability to identify, formulate and solve computer systems
engineering problems.
3. Graduates will demonstrate the ability to design and experiment both in hardware and
software, analyze and interpret data.
4. Graduates will demonstrate an ability to analyze the given problems and design
solutions, as per the needs and specifications.
5. Graduates will demonstrate an ability to visualize and provide solutions to
multidisciplinary engineering tasks.
6. Graduate will demonstrate skills to use modern engineering tools, software‟s and
equipment to analyze and provide solutions to problems.
7. Graduates will demonstrate knowledge of professional and ethical responsibilities.
8. Graduates will be able to communicate effectively in both verbal and written form.
9. Graduates will show the understanding of impact of engineering solutions on the society
and also will be aware of contemporary issues.
10. Graduates will develop confidence for self education and ability for lifelong learning.
11. Graduate will be capable of participating and succeeding in competitive examinations.
12. Graduates will demonstrate software development skill to solve real life problems.
PROGRAM SPECIFIC OUTCOMES (PSOs)
1. Problem solving skills: Ability to identify and analyze problems and propose solutions
by applying fundamental concepts and algorithms.
2. Project development skills: Ability to apply and demonstrate best practices of software
development processes to solve real life problems.
3. Professional skills and Entrepreneurship: Ability to demonstrate professional and
leadership qualities required to pursue innovative career in Information Technology,
self-employment and higher studies.
4
Scheme of Teaching
Semester IV
Fourth Semester
Sl.No. Code Course
Credits Total
credits
Contact
Hours/week
Marks
L – T - P CIE SEE Total
1. MATCI41 Engineering
Mathematics -IV BS 3 – 1 – 0 4 5 50 50 100
2. IS42 Operating System PC1 3 – 0 – 0 3 3 50 50 100
3. IS43 Web Programming PC2 3 – 1 – 0 4 5 50 50 100
4. IS44 Design and Analysis
of Algorithms PC3 3 – 0 – 0 3 3 50 50 100
5. IS45 Microprocessors and
Microcontrollers PC4 3 – 0 – 0 3 3 50 50 100
6. IS46 Database Management
System PC5 4 – 0 – 0 4 4 50 50 100
7. ISL47 DAA Lab .with C /
Java ( Practical) L1 0 – 0 – 1.5 1.5 3 25 25 50
8. ISL48
Microprocessors and
Microcontroller
Applications Lab.
(Practical )
L2 0 – 0 – 1.5 1.5 3 25 25 50
9. PED49 Principles of
Engineering Design 0 – 0 – 2 2 2 50 50
10. BCMAT41 Bridge Course
Maths –2 (Diploma) MNC
Mandatory
Non Credit
Course
Total 26 31 400 350 750
5
Engineering Mathematics – IV
(Computer Science / Information Science)
Course Code MAT41 CS/IS Credits 4
Course type BS CIE Marks 50 marks
Hours/week: L-T-P 3 – 1 – 0 SEE Marks 50 marks
Total Hours: 50 SEE Duration 3 Hours for
100 marks
Course learning objectives
1. Use the concept of Interpolation to solve practical problems.
2. Understand and apply the Logic of mathematics in the field of Computer science
3. Understand the concept of Functions and Relations.
4. Get acquainted with basic concepts of Graph Theory and their applications.
5. Get acquainted with different Algebraic Structures, Prime number and their properties for
applications in Cryptography.
Pre-requisites :
Set Theory.
Unit - I 10 Hours
Finite Differences and Interpolation:, Forward and Backward differences, Newton‟s Forward and
Backward Interpolation Formulae, Divided Difference, Newton‟s Divided Difference Formula,
Lagrange‟s Interpolation Formula- Illustrative examples. Numerical Integration: Newton-
CotesQuadrature formula, Trapezoidal rule, Simpsons 1/3rd
rule, Simpsons 3/8th rule, Weddle‟s rule.
Practical Examples. (All Formulae without proof)
Unit - II 10 Hours
Fundamentals of Logic: Basic connectives and Truth tables, Logical equivalence- Laws of Logic.
Logical Implication-Rules of Inference. Quantifiers- Universal and Existential Quantifiers.
Unit - III 10 Hours
Relations and Functions: Cartesian Products, Relations. Properties of Relations. Computer
recognition: Zero-One Matrices and Directed Graphs, Partial Orders: Hasse Diagrams, Equivalence
Relations and Partitions. Functions – One-to-One, Onto functions, Special functions.
Unit - IV 10 Hours
Introduction to Graph Theory: Definitions and Examples, Subgraphs, Complements and Graph
Isomorphism, Vertex, Degree. Euler Trails and Circuits, Planar Graphs, Hamiltonian Paths and Cycles.
Unit - V 10 Hours
Finite Fields and Elementary Number Theory: Groups, Rings, Fields, Modular Arithmetic, Euclids
Algorithm, Finite fields of the form GF(p).Polynomial Arithmetic. Finite fields of the form GF(2m)
Prime Numbers, Fermat‟s and Euler‟s theorem. Testing of Primality, Chinese Remainder Theorem.
Elliptic Curve Arithmetic.
6
Text Books::
1.
2.
3.
B.S. Grewal – Higher Engineering Mathematics, Khanna Publishers, 42nd
Edition and above.
Kolman, Busby, Ross “Discrete Mathematical Structures”, Prentice Hall of India, 6th Edition
and above.
William Stallings –Cryptography and Network Security, Pearson Prentice Hall 6th Edition and
above.
Reference Books::
1.
2.
3.
4.
Erwin Kreyszig –Advanced Engineering Mathematics, John Wiley & Sons Inc., 9th Edition and
onwards.
Peter V. O‟ Neil – Advanced Engineering Mathematics, Thomson Brooks/Cole, 7th Edition and
onwards
Glyn James – Advanced Modern Engineering Mathematics, Pearson Education, 4th Edition and
onwards
Ralph P Grimaldi, “Discrete and Combinatorial Mathematics”, Pearson,Education, 5th Edition
and onwards
Course Outcome (COs)
At the end of the course, the student will be able to Bloom’s
Level
1. Use Finite differences in Interpolation L3
2. Understand and Apply the Logic of mathematics in the field of Computer
science.
L2,L3
3. Explain and Analyze different Relations and Functions. L2, L3
4. Discuss basic concepts of Graph Theory and its Use in Computer Science. L2, L3
5. Explain the concept of Finite Fields. L2
6. Apply Finite Fields in Cryptography L3
Program Outcome of this course (POs) PO No.
1. An ability to apply knowledge of Mathematics, Science and Engineering. PO1
2.
An ability to identify, formulate and solve engineering problems.
PO5
3. An ability to use the techniques, skills and modern engineering tools necessary for
engineering practice.
PO11
7
Course delivery methods
Assessment methods
1. Black board teaching 1. Internal Assessment Tests
2. PPT 2. Assignments
3. Quiz
Scheme of Continuous Internal Evaluation (CIE):
Components Average of best two
IA tests out of three
Average of
assignments (Two)
/ activity
Quiz
Class
participation
Total
Marks
Maximum Marks: 50 25 10 5 10 50
Writing two IA test is compulsory.
Minimum marks required to qualify for SEE : 20
Self Study topics shall be evaluated during CIE (Assignments and IA tests) and 10% weightage
shall be given in SEE question paper.
Scheme of Semester End Examination (SEE):
1. It will be conducted for 100 marks of 3 hours duration. It will be reduced to 50 marks for the
calculation of SGPA and CGPA.
2. Minimum marks required in SEE to pass: 40 (out of 100 )
3. Question paper contains 08 questions each carrying 20 marks. Students have to answer FIVE full
questions. SEE question paper will have two compulsory questions (any 2 units) and choice will
be given in the remaining three units.
8
Operating System
Course Code IS42 Credits 3
Course type PC CIE Marks 50 marks
Hours/week: L-T-P 3 – 0 – 0 SEE Marks 50 marks
Total Hours: 38 SEE Duration 3 Hours for
100 marks
Course learning objectives
1. To introduce the functions of operating system, design, structure and associated system calls.
2. To study and analyze various scheduling algorithms and process synchronization techniques.
3. To develop an understanding about deadlocks and deadlock recovery techniques.
4. To discuss and realize the importance of memory management techniques.
5. To gain the knowledge of file systems and secondary storage structures.
Pre-requisites:
Basic Electronics,
Basic knowledge of computer concepts & programming.
Unit – I 7 Hours
Introduction to Operating System: System structures: What operating systems do; Computer System
organization; Computer System architecture; Operating System operations; Process management;
Memory management; Storage management; Protection and security; Distributed system; Operating
System Services; User - Operating System interface; System calls; Types of system calls; Operating
System design and implementation; Operating System structure; Virtual machines; System boot.
Self learning topics: Operating System structure; Virtual machines; System boot. (2 Hours)
Unit – II 8 Hours
Process Management: Process concept; Process scheduling; Operations on processes; Multi-Threaded
Programming: Overview; Multithreading models; Process Scheduling: Basic concepts; Scheduling
criteria; Scheduling algorithms.
Process Synchronization: Synchronization: The Critical section problem; Peterson‟s solution;
Synchronization hardware; Semaphores; Classical problems of synchronization.
Unit – III 7 Hours
Deadlocks: Deadlocks: System model; Deadlock characterization; Methods for handling deadlocks;
Deadlock prevention; Deadlock avoidance; Deadlock detection and recovery from deadlock.
Unit – IV 8 Hours
Memory Management: Memory Management Strategies: Background; Swapping; Contiguous
memory allocation; Paging; Structure of page table; Segmentation. Virtual Memory Management:
Background; Demand paging; Copy-on-write; Page replacement; Allocation of frames; Thrashing.
Self learning topics: Case Study: Creating Shared memory, calculating page/segment size of a user
process in Linux/Windows. (2 Hours)
9
Unit – V 8 Hours
File System: Implementation of File System: File System: File concept; Access methods; Directory
structure; File system mounting; File sharing; Protection. Implementing File System: File system
structure.
Self learning topics: File system implementation; Directory implementation; Allocation
methods. (2 Hours)
Text Books::
1. Abraham Silberschatz, Peter Baer Galvin, Greg Gagne, “Operating System Principles”, Wiley
India, 6th edition and above.
2. D.M Dhamdhere, “Operating System”, “A concept based Approach”, Tata McGraw- Hill, 2nd
edition and above.
Reference Books::
1. Gary Nutt, “Operating System”, Pearson Education, 2nd
edition and above.
2. Harvey M Deital, “Operating system”, Addison Wesley, 2nd
edition and above.
Course Outcome (COs)
At the end of the course, the student will be able to Bloom’s
Level
1. Identify the System calls, Protection mode and Interrupts of any general operating
system.
L3
2. Develop applications keeping concurrency and synchronization, semaphores/monitor shared
memory mutual exclusion, process scheduling services of general operating system
in the mind.
L3
3. Explain memory management, file management and secondary memory management
techniques.
L2
Program Outcome of this course (POs)
PO No.
1. Graduates will demonstrate the ability to identify, formulate and solve computer systems
engineering problems.
PO2
2. Graduates will demonstrate an ability to analyze the given problems and design solutions,
as per the needs and specifications.
PO4
3. Graduates will develop confidence for self education and ability for lifelong learning. PO10
4. Graduate will be capable of participating and succeeding in competitive examinations. PO11
Course delivery methods Assessment methods
1. Lecture & Board 1. Assignments
2. Power-point Presentation 2. Quizzes
3. Online Videos / Learning 3. Internal Assessment Tests
4. NPTEL / Edusat 4. Course Seminar
5. Class Room Exercises 5. Course Project (Mini project)
6. Case Studies
10
Scheme of Continuous Internal Evaluation (CIE):
Components Average of best two
IA tests out of three
Average of
assignments (Two)
/ activity
Quiz
Class
participation
Total
Marks
Maximum Marks: 50 25 10 5 10 50
Writing two IA test is compulsory.
Minimum marks required to qualify for SEE : 20
Self Study topics shall be evaluated during CIE (Assignments and IA tests) and 10% weightage
shall be given in SEE question paper.
Scheme of Semester End Examination (SEE):
1. It will be conducted for 100 marks of 3 hours duration. It will be reduced to 50 marks for the
calculation of SGPA and CGPA.
2. Minimum marks required in SEE to pass: 40 (out of 100 )
3. Question paper contains 08 questions each carrying 20 marks. Students have to answer FIVE full
questions. SEE question paper will have two compulsory questions (any 2 units) and choice will
be given in the remaining three units.
11
Web Programming
Course Code IS43 Credits 4
Course type PC CIE Marks 50 marks
Hours/week: L-T-P 3 – 1 – 0 SEE Marks 50 marks
Total Hours: 38 SEE Duration 3 Hours for
100 marks
Course learning objectives
1. Introduce the fundamentals of internet and World Wide Web. Describe web browsers web
servers, URLs, MIME types and HTTP.
2. Discuss Extensible Markup Language and explain the XHTML document structure and the
different tags used to display text, images, links, tables, frames, forms and lists.
3. Present the capabilities of JavaScript and demonstrate the use of expressions, screen output and
keyboard input, arrays, functions and pattern matching.
4. Associate the use of JavaScript with XHTML documents and implement XHTML program to
handle events from body elements using DOM and DOM2. Create a XML document and
describe its structure, namespace and schema.
5. Apply PHP to accept and process form details and store it in a database. Also design a website
using MVC model.
Pre-requisites :
C programming and basic Computer Concepts.
Unit – I 8 Hours
Fundamentals of Web, XHTML and CSS:
Fundamentals of Web: Internet, WWW, Web Browsers, and Web Servers; URLs; MIME; HTTP; The
Web Programmers Toolbox.
XHTML: Basic syntax; Standard structure; Basic text markup; Images; Hypertext Links; Lists, tables,
Forms, Frames, Bootstrap.
Self learning topics: CSS: Introduction; Levels of style sheets; Selector forms; Property value forms;
Font properties; List properties; Color; Alignment of text; The box model; Background images; The
<span> and<div> tags, Conflict resolution. (3 hrs)
Unit – II 6 Hours
Javascript and XHTML Documents
Overview of Javascript: Syntactic characteristics; Primitives, operations, and expressions; Screen
output and keyboard input; Control statements; Object creation and modification; Arrays; Functions;
Constructor; Pattern matching using regular expressions; Errors in scripts; Examples. The Javascript
execution environment.
Unit – III 6 Hours
Javascript with DOM and XML
The Document Object Model: Element access in Javascript; Events and event handling; Handling
events from the Body elements, Button elements, Text box and Password elements; The DOM 2 event
12
model; The navigator object.
XML: Introduction to XML – Syntax , XML document structure, Document Type definition , Name
spaces , XML Schemas , Displaying Raw XML documents, Displaying XML documents with CSS ,
XSLT style sheets, XML processors.
Self learning topics: The DOM 2 event model; The navigator object. (2 hrs)
Unit – IV 10 Hours
PHP Introduction , Database Access through the Web
PHP: Origins and uses of PHP; Overview of PHP; General syntactic characteristics; Functions; Pattern
matching; Form handling; Files; Cookies; Session tracking.
Database Access Through the Web: Relational Databases, Multi-valued Attributes, Structured Query
Language, Client/Server Database Architecture, PHP and Database Access, The MySQL Database
System, MySQL Commands, The DBI Module.
Self learning topics: PHP Primitives, operations and expressions; Output; Control statements; Arrays
DB Access with PHP and MySQL, Connecting to MySQL, Metadata. (2 hrs)
Unit – V 8 Hours
MVC-Framework for Php
Introduction to MVC: What Is MVC?, Popular MVC Frameworks Foundation: Autoloading,
Exceptions, Type Methods, Metadata Base Class : Getters and Setters, Magic Methods, Adding
Introspection, Transparent Getters/Setters; Configuration: Associative Arrays, INI Files
Caching: Performance Bottlenecks, The Code; Registry: Singleton, Registry.
Text Books::
1. Robert W. Sebesta: Programming the World Wide Web, Pearson education, 3rd
edition and
above.
2. Chris Pitt: ProPHP MVC, Distributed to Book world trade worldwide by Springer science and
Business Media.
Reference Books::
1. M. Deitel, P.J. Deitel, A. B. Goldberg: Internet & World Wide Web How to program, Pearson
education, 2nd
edition and above.
2. Chris Bates: Web Programming Building Internet Applications, Wiley India, 2nd
edition and
above.
3. Xue Bai et al: The Web Warrior Guide to Web Programming, Thomson.
4. Robin Nixon , Learning PHP, MySQL & JavaScript: O Reily.
Course Outcome (COs)
At the end of the course, the student will be able to Bloom’s
Level
1. Explain the Internet related concepts that are vital in understanding web development. L1
2. Paraphrase the insights of Internet programming and implement complete
application over the web.
L2
3. Demonstrate the important HTML tags for designing static pages and separate design
from content using Cascading Style sheet.
L3
4. Demonstrate the concepts of JavaScript and XML in developing web application
development programming and scripting languages.
L3
5. Demonstrate the application of MVC framework in a web application using PHP. L3
13
6. Demonstrate the concepts of database connection in developing web application
using PHP.
L3
Course delivery methods
Assessment methods
1. Lecture & Board 1. Assignments
2. Power-point Presentation 2. Quizzes
3. Online Videos / Learning 3. Internal Assessment Tests
4. NPTEL / Edusat 4. Course Seminar
5. Class Room Exercises 5. Course Project (Mini project)
6. Case Studies
Scheme of Continuous Internal Evaluation (CIE):
Components Average of best two
IA tests out of three
Average of
assignments (Two)
/ activity
Quiz
Class
participation
Total
Marks
Maximum Marks: 50 25 10 5 10 50
Writing two IA test is compulsory.
Minimum marks required to qualify for SEE : 20
Self Study topics shall be evaluated during CIE (Assignments and IA tests) and 10% weightage
shall be given in SEE question paper.
Scheme of Semester End Examination (SEE):
1. It will be conducted for 100 marks of 3 hours duration. It will be reduced to 50 marks for the
calculation of SGPA and CGPA.
2. Minimum marks required in SEE to pass: 40 (out of 100 )
3. Question paper contains 08 questions each carrying 20 marks. Students have to answer FIVE full
questions. SEE question paper will have two compulsory questions (any 2 units) and choice will
be given in the remaining three units.
Program Outcome of this course (POs)
PO No.
1. Graduates will demonstrate the ability to identify, formulate and solve
computer systems engineering problems.
PO2
2. Graduates will demonstrate an ability to analyze the given problems and design
solutions, as per the needs and specifications.
PO4
3. Graduate will demonstrate skills to use modern engineering tools, software‟s
and equipment to analyze and provide solutions to problems.
PO6
4. Graduates will develop confidence for self education and ability for lifelong
learning.
PO10
5. Graduates will demonstrate software development skill to solve real life
problems.
PO12
14
Design and Analysis of Algorithm
Course Code IS44 Credits 3
Course type PC CIE Marks 50 marks
Hours/week: L-T-P 3 – 0 – 0 SEE Marks 50 marks
Total Hours: 39 SEE Duration 3 Hours for
100 marks
Course learning objectives
1. To bring out the importance of the study of algorithms.
2. To study and analyze time complexity of various algorithms.
3. To discuss various algorithm design techniques.
4. To develop a technique of analyzing and computing the performance of algorithms.
5. To discuss various string matching algorithms.
Pre-requisites:
Basic data structures such as lists, dictionaries, and hash tables.
Basic computer science concepts such as procedures, decision statements, and loops.
Basics of Graph theory.
Unit – I 8 Hours
Introduction: Fundamentals of Algorithmic Problem Solving, Analysis Framework, Asymptotic
Notations and basic efficiency classes, Mathematical Analysis of Non-Recursive and Recursive
Algorithms, Brute Force Approaches: Introduction, Selection Sort, linear search.
Self learning topics: Short Tutorial on Recurrence Relations, Bubble Sort( 1Hr)
Unit – II 8 Hours
Divide and Conquer: Divide and Conquer technique, Binary Search, Merge Sort, Quick Sort and their
performance comparison.
Decrease-and-Conquer: Decrease and Conquer techniques, Insertion Sort, Depth First Search and
Breadth First Search
Transform and Conquer: Transform and Conquer Strategy, Heaps and Heap Sort, Horner‟s Rule and
Binary Exponentiation.
Self learning topics: Multiplication of Large Integers and Strassen‟s Matrix Multiplication. (2 Hrs)
Unit – III 8 Hours
The Greedy Method: The General Method, Knapsack Problem, Minimum-Cost Spanning Trees:
Prim‟s Algorithm, Single Source Shortest Paths: Dijkstra‟s Algorithm, Bellman-Ford Algorithm,
Huffman Trees.
Self learning topics: Kruskal‟s Algorithm.( 1 Hr)
15
Unit – IV
8 Hours
Dynamic Programming: The General Method, Warshall‟s Algorithm, Floyd‟s Algorithm for the All-
Pairs Shortest Paths Problem, Knapsack using General Weights and 0/1 Knapsack. The Traveling
Salesperson problem.
Self learning topics: Computing nCr, the dynamic approach (1 Hr)
Unit – V 7 Hours
String Matching: Input Enhancement in String Matching, Horsepool‟s method, Rabin-Karp
Algorithm.
Backtracking: N - Queens‟s problem, Hamiltonian Circuit Problem, Sum of Subset – Problem.
Branch-and-Bound: Assignment Problem, Knapsack Problem, Traveling Salesperson Problem.
Self learning topics: Naïve String Matching Algorithm. (1Hr)
Text Books:
1. Anany Levitin, Introduction to The Design & Analysis of Algorithms, Pearson Education 1st
edition and above.
2. Ellis Horowitz, Sartaj Sahni, Sanguthevar Rajasekaran, Fundamentals of Computer Algorithms
Universities Press, 1st edition and above.
Reference Books::
1. Kenneth Berman, Jerome Paul, Algorithms, Cengage Learning.
2. Thomas H. Cormen, Charles E. Leiserson, Ronal L. Rivest, Clifford Stein, introduction to
Algorithms PHI, 2nd
edition and above.
3. R.C.T. Lee, S.S. Tseng, R.C. Chang & Y.T.Tsai: Introduction to the Design and analysis of
Algorithms A Strategic Approach, TataMcGraw Hill.
4. Narasimha Karumanchi, Data structures and Algorithms Made Easy, Career Monk Publications,
1st edition and above.
Course Outcome (COs)
At the end of the course, the student will be able to Bloom’s
Level
1. Identify an appropriate algorithm design technique for a given problem. L1
2. Formulate and Solve recurrence equation and compute time complexity of
recursive and iterative. L3
3. Construct iterative and recursive techniques for some select algorithms. L3
4. Construct graph search algorithms, string matching algorithms, sorting algorithms. L3
Program Outcome of this course (POs) PO No.
1.
Graduates will demonstrate the knowledge of mathematics, basic sciences, logical
reasoning and engineering.
PO1
2. Graduates will demonstrate the ability to identify, formulate and solve computer
systems engineering problems. PO2
3. Graduates will demonstrate an ability to analyze the given problems and design
solutions, as per the needs and specifications. PO4
4. Graduates will develop confidence for self education and ability for lifelong learning. PO10
5. Graduate will be capable of participating and succeeding in competitive examinations. PO11
16
Course delivery methods
Assessment methods
1. Lecture & Board 1. Assignments
2. Power-point Presentation 2. Quizzes
3. Online Videos / Learning 3. Internal Assessment Tests
4. NPTEL / Edusat 4. Course Seminar
5. Class Room Exercises 5. Course Project (Mini project)
6. Case Studies
Scheme of Continuous Internal Evaluation (CIE):
Components Average of best two
IA tests out of three
Average of
assignments (Two)
/ activity
Quiz
Class
participation
Total
Marks
Maximum Marks: 50 25 10 5 10 50
Writing two IA test is compulsory.
Minimum marks required to qualify for SEE : 20
Self Study topics shall be evaluated during CIE (Assignments and IA tests) and 10% weightage
shall be given in SEE question paper.
Scheme of Semester End Examination (SEE):
1. It will be conducted for 100 marks of 3 hours duration. It will be reduced to 50 marks for the
calculation of SGPA and CGPA.
2. Minimum marks required in SEE to pass: 40 (out of 100 )
3. Question paper contains 08 questions each carrying 20 marks. Students have to answer FIVE full
questions. SEE question paper will have two compulsory questions (any 2 units) and choice will
be given in the remaining three units.
17
Microprocessor and Microcontroller
Course Code IS45 Credits 3
Course type PC CIE Marks 50 marks
Hours/week: L-T-P 3 – 0 – 0 SEE Marks 50 marks
Total Hours: 38 SEE Duration 3 Hours for
100 marks
Course learning objectives
1. To study the internal architecture of Intel‟s 8086 microprocessor and 8051 Microcontroller.
2. To develop the skill of designing and writing assembly language programs for 8086
Microprocessor.
3. To program the 8051 microcontroller for Timers, Serial Ports and Interrupts in C.
4. To present the techniques of interfacing the LCD, Keyboard, ADC, DAC and Sensors with 8051
Microcontroller.
Pre-requisites :
Basic Electronics.
Computer Organization & Architecture.
Logic Design & Applications.
Unit – I 7 Hours
8086 Microprocessor Architecture:
Overview of microcomputer structure and operation, , 8086 internal architecture, introduction to
programming the 8086 microprocessor, data and memory addressing modes of 8086 microprocessor.
Self learning topics: Microprocessor evolution and types, the 8086 microprocessor family
overview (1 Hr)
Unit – II 8 Hours
Instruction Set and Programming of 8086 microprocessor:
Instruction set of 8086 microprocessor, Instruction template with example of MOV instruction, writing
simple assembly language program, delay calculation and programming, interfacing RAM to 8086
microprocessor.
Self learning topics: Assembler Directives. (1 Hr)
Unit – III 7 Hours
Introduction to 8051 Microcontroller:
Internal architecture of 8051 microcontroller, 8051 programming model, Data types and time delay in
8051 C, I/O Programming in 8051 C, Logic operations in 8051 C, Data conversion programs in 8051 C.
Self learning topics: Accessing code ROM space in 8051 C, Data serialization using 8051 C. (2 Hrs)
Unit – IV 8 Hours
Timer, Serial Port and Interrupt Programming in 8051 C:
Programming 8051 timers, counter programming, programming timers 0 and 1 in 8051 C, basics of
serial communication, 8051 connection to RS232, serial port programming in C. 8051 interrupts,
18
programming timer interrupts, programming external hardware interrupts, programming serial
communication interrupt.
Self learning topics: Interrupt priority in 8051 C, interrupt programming in C. (2 Hrs)
Unit – V 8 Hours
LCD and Keyboard Interfacing:
LCD interfacing, Keyboard interfacing. ADC, DAC and Sensor Interfacing: Parallel ADC 0804
interfacing with 8051, DAC 0808 interfacing with 8051.
Self learning topics: Signal conditioning and interfacing the temperature sensor LM35 to the
8051. (1 Hr)
Text Books::
1. Douglas V Hall: Microprocessors and Interfacing, The McGraw-Hill Companies, 1st edition and
above.
2. Muhammad Ali Mazidi, Janice Gillispie Mazidi, Rolin D. McKinlay: The 8051 Microcontroller
and Embedded Systems Using Assembly and C, Pearson Prentice Hall, 1st edition and above.
Reference Books::
1. Barry B Brey: The Intel Microprocessors, Pearson Education, 5th edition and above.
2. Kenneth Ayala: The 8051Microcontroller, Cengage Learning, 2nd
edition and above.
Course Outcome (COs)
At the end of the course, the student will be able to Bloom’s
Level
1. Design and write the assembly language programs for simple computing tasks
using 8086 Microprocessor.
L3
2. Design and write „C‟ programs for Timers, Serial ports and Interrupts using 8051
Microcontroller.
L3
3. Demonstrate the ability to write and develop „C‟ programs to interface LCD,
Keyboard, ADC/ DAC and Sensors using 8051 Microcontroller.
L3
Program Outcome of this course (POs)
PO No.
1. Graduates will demonstrate the knowledge of mathematics, basic sciences, logical
reasoning and engineering
PO1
2. Graduates will demonstrate the ability to design and experiment both in hardware
and software, analyze and interpret data
PO3
3. Graduates will demonstrate an ability to visualize and provide solutions to
multidisciplinary engineering tasks.
PO5
4. Graduates will develop confidence for self education and ability for lifelong learning PO10
5. Graduates will demonstrate software development skill to solve real life
problems.
PO12
Course delivery methods Assessment methods
1. Lecture & Board 1. Assignments
2. Power-point Presentation 2. Quizzes
3. Online Videos / Learning 3. Internal Assessment Tests
4. NPTEL / Edusat 4. Course Seminar
5. Class Room Exercises 5. Course Project (Mini project)
19
6. Case Studies
Scheme of Continuous Internal Evaluation (CIE):
Components Average of best two
IA tests out of three
Average of
assignments (Two)
/ activity
Quiz
Class
participation
Total
Marks
Maximum Marks: 50 25 10 5 10 50
Writing two IA test is compulsory.
Minimum marks required to qualify for SEE : 20
Self Study topics shall be evaluated during CIE (Assignments and IA tests) and 10% weightage
shall be given in SEE question paper.
Scheme of Semester End Examination (SEE):
1. It will be conducted for 100 marks of 3 hours duration. It will be reduced to 50 marks for the
calculation of SGPA and CGPA.
2. Minimum marks required in SEE to pass: 40 (out of 100 )
3. Question paper contains 08 questions each carrying 20 marks. Students have to answer FIVE full
questions. SEE question paper will have two compulsory questions (any 2 units) and choice will
be given in the remaining three units.
20
DATABASE MANAGEMENT SYSTEMS
Course Code IS46 Credits 4
Course type PC CIE Marks 50 marks
Hours/week: L-T-P 4 – 0 – 0 SEE Marks 50 marks
Total Hours: 50 SEE Duration 3 Hours for
100 marks
Course learning objectives
1. To discuss and realize the importance of Database Architecture Design notations, ER Modeling,
Mapping and Schema design.
2. To gain the knowledge Relational algebra and learn the use of SQL and PL/SQL.
3. To introduce formal database design approach through normalization and discuss various
normal forms.
4. To understand the importance of Concurrent Transactions and discuss issues and transaction
control algorithms.
Pre-requisites :
Basic programming concepts and Data Structures.
Unit – I 10 Hours
Introduction: Introduction to database, Characteristics of Database approach, Advantages of using
DBMS approach, When not to use a DBMS; Actors on the scene, Workers behind the scene; Three-
schema architecture and data independence.
Entity-Relationship Model: Using High-Level Conceptual Data Models for Database Design; An
Example Database Application; Entity Types, Entity Sets, Attributes and Keys; Relationships,
Relationship types, Roles and Structural Constraints; Weak Entity Types, Naming Conventions and
Design Issues.
Self learning topics: The database system environment, Centralized and client-server architectures,
Classification of Database Management systems.(2 Hours)
Unit – II 10 Hours
Relational Model and Relational Algebra: Relational Model Concepts; Relational Model Constraints
and Relational Database Schemas; Update Operations, Dealing with constraint violations; Unary
Relational Operations: SELECT and PROJECT; Relational Algebra Operations from Set Theory;
Binary Relational Operations: JOIN and DIVISION; Additional Relational Operations; Examples of
Queries in Relational Algebra; Relational Database Design Using ER- to-Relational Mapping.
Unit – III 10 Hours
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.
Transaction Processing Concepts: Introduction to Transaction processing, Transaction and System
concepts, Desirable properties of Transactions; Locking Techniques for concurrency control;
Transaction support in SQL;
Self learning topics: Multivalued dependencies and Fourth normal form. (2 Hours)
21
Unit – IV
10 Hours
SQL : 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; Creating Views, Triggers and Stored procedures.
Self learning topics: Specifying constraints as Assertion. (2 Hours)
Unit – V 10 Hours
PL/SQL : PL/SQL Block Structure, PL/SQL Variables, PL/SQL Function , PL/SQL Procedure ,
PL/SQL Nested Block , PL/SQL IF Statement , PL/SQL LOOP Statement , PL/SQL WHILE Loop
Statement, PL/SQL FOR Loop Statement.
Self learning topics: PL/SQL Exception Handling, PL/SQL Cursor. (2 Hours)
Text Books::
1. Elmasri and Navathe: Fundamentals of Database Systems, Addison-Wesley, 3rd
edition and
above.
2. Raghu Ramakrishnan and Johannes Gehrke: Database Management Systems, McGraw-Hill, 2nd
edition and above.
Reference Books::
1. Silberschatz, Korth and Sudharshan: Data base System Concepts, Mc-GrawHill, 3rd
edition and
above.
2. C.J. Date, A. Kannan, S. Swamynatham: A Introduction to Database Systems, Pearson
education, 5th edition and above.
3. PL/SQL study material.
Course Outcome (Cos)
At the end of the course, the student will be able to Bloom’s
Level
1. Apply the database concepts and design database for given information system. L3
2. Create database and develop database programming skills in SQL and PL/SQL. L5
3. Apply the concepts of Normalization and design database which possess no
anomalies.
L3
4. Explain the issue of concurrency control in transaction processing. L2
Program Outcome of this course (POs)
PO No.
1. Graduates will demonstrate the ability to identify, formulate and solve computer
systems engineering problems.
PO2
2. Graduates will demonstrate the ability to design and experiment both in hardware
and software, analyze and interpret data.
PO3
3. Graduates will demonstrate an ability to analyze the given problems and design
solutions, as per the needs and specifications.
PO4
4. Graduate will be capable of participating and succeeding in competitive
examinations.
PO11
5. Graduates will demonstrate software development skill to solve real life
problems.
PO12
22
Course delivery methods
Assessment methods
1. Lecture & Board 1. Assignments
2. Power-point Presentation 2. Quizzes
3. Online Videos / Learning 3. Internal Assessment Tests
4. NPTEL / Edusat 4. Course Seminar
5. Class Room Exercises 5. Course Project (Mini project)
6. Case Studies
Scheme of Continuous Internal Evaluation (CIE):
Components Average of best two
IA tests out of three
Average of
assignments (Two)
/ activity
Quiz
Class
participation
Total
Marks
Maximum Marks: 50 25 10 5 10 50
Writing two IA test is compulsory.
Minimum marks required to qualify for SEE : 20
Self Study topics shall be evaluated during CIE (Assignments and IA tests) and 10% weightage
shall be given in SEE question paper.
Scheme of Semester End Examination (SEE):
1. It will be conducted for 100 marks of 3 hours duration. It will be reduced to 50 marks for the
calculation of SGPA and CGPA.
2. Minimum marks required in SEE to pass: 40 (out of 100 )
3. Question paper contains 08 questions each carrying 20 marks. Students have to answer FIVE full
questions. SEE question paper will have two compulsory questions (any 2 units) and choice will
be given in the remaining three units.
23
Bridge Course Mathematics – II
Common to all Branches
Course Code BCMAT41 Credits 0
Course type BS CIE Marks 50 marks
Hours/week: L-T-P 2 – 0 – 0 SEE Marks 50 marks
Total Hours: 32 SEE Duration 3 Hours for
100 marks
Course learning objectives
1. Interpret the type of solutions of system of equations using the concept of rank of matrix.
2. Understand the geometry of Vectors and also the geometrical and physical interpretation
of their derivatives.
3. Be proficient in Laplace Transforms and solve problems related to them.
4. Get acquainted with Inverse Laplace Transform s and solution of differential equations.
Pre-requisites :
Trigonometry
Basic Differentiation
Basic Integration
Unit – I 12 Hours
Linear Algebra: Rank of a matrix by elementary transformation, Solution of system of linear
equations-Gauss Jordan method and Gauss-Seidal method. Eigen values and Eigen vectors, Largest
Eigen value by Rayleigh‟s Power method.
Unit – II 10 Hours
Vectors: Vector Algebra: Vector addition, Scalar product, Vector product and Triple product.
Vector Calculus:Vector differentiation- Velocity, Acceleration of a Vector point function, Gradient,
Divergence and Curl , Solenoidal and Irrotational fields, simple and direct problems
Unit – III 10 Hours
Laplace Transforms: Definition, Laplace transforms of elementary functions, derivatives and integrals
Inverse Laplace Transforms: Inverse transforms, applications of Laplace transform to differential
equations.
Text Books::
1. B.S. Grewal – Higher Engineering Mathematics, Khanna Publishers, 42nd
edition and above.
2. H K Dass, Er. Rajnish Verma - Higher Engineering Mathematics, S.Chand Publisher, 3rd
revised
edition and above.
24
Course Outcome (COs)
At the end of the course, the student will be able to Bloom’s
Level
1. Interpret the type of solutions of system of equations using the concept of rank of
matrix. L3
2. Solve System of equations by direct and iterative methods. L3
3. Interpret the geometry of Vectors. L3
4. Solve practical problems by vector approach. L3
5. Evaluate Laplace Transforms and their properties and solve related problems. L3
6. Use Laplace Transforms and Inverse Laplace Transforms in solving Differential
Equations.
L3
Program Outcome of this course (POs) PO No.
1.
An ability to apply knowledge of Mathematics, Science and Engineering.
PO1
2.
An ability to identify, formulate and solve engineering problems.
PO5
3.
An ability to use the techniques, skills and modern engineering tools necessary for
engineering practice.
PO11
Course delivery methods Assessment methods
1. Black board teaching 1. Internal Assessment Tests
2. PPT
Scheme of Continuous Internal Evaluation (CIE):
Components Sum of two tests
(addition of two tests)
Maximum marks 50
*Students have to score minimum 20 marks in CIE to appear for SEE
Scheme of Semester End Examination (SEE):
* Question paper contains 08 questions each carrying 20 marks.
* Students have to answer any FIVE full questions.
* SEE will be conducted for 100 marks of three hours duration. It will be reduced to 50 marks.
* Minimum marks required in SEE to pass: 40 (out of 100)
Note : Diploma Students have to pass Bridge course Mathematics – II (15BCMAT41) before
advancing to 7th
semester .
25
Design and Analysis of Algorithms Laboratory
Course Code ISL47 Credits 1.5
Course type PC CIE Marks 25 marks
Hours/week: L-T-P 0 – 0 – 3 SEE Marks 25 marks
Total Hours: 40 SEE Duration 3 Hours for 50 marks
Course learning objectives
1. Illustrate the importance of algorithms in a variety of applications.
2. Illustrate the use of recursive/iterative sorting algorithms in different scenarios.
3. Demonstrate time complexity of various algorithms using various design techniques.
4. Demonstrate efficient algorithms by drawing comparisons.
5. Illustrate the use of algorithms for graph search problems.
Pre-requisites :
Basic computer science concepts such as procedures, decision statements, and loops.
Basic data structures such as lists, dictionaries, and hash tables.
List of experiments(Programming language C / Java)
1. Implement Merge Sort algorithm to sort a given set of elements and determine the time required
to sort the elements. Repeat the experiment for different values of n, the number of elements in
the list to be sorted and plot a graph of the time taken versus n.
2. Implement Quick Sort algorithm and determine the time required to sort the elements. Repeat
the experiment for different values of n, the number of elements in the list to be sorted and plot a
graph of the time taken versus n.
3. Implement Insertion Sort algorithm and determine the time required to sort the elements. Repeat
the experiment for different values of n, the number of elements in the list to be sorted and plot a
graph of the time taken versus n.
4. Implement Heap Sort algorithm and determine the time required to sort the elements. Repeat the
experiment for different values of n, the number of elements in the list to be sorted and plot a
graph of the time taken versus n.
5. From a given vertex in a weighted connected graph, find shortest paths to other vertices using
Dijkstra's algorithm.
6. Find the Minimum Cost Spanning Tree of a given undirected graph using Prim‟s algorithm.
7. Implement All-Pairs Shortest Paths Problem using Floyd's algorithm.
8. Implement 0/1 Knapsack problem using Dynamic Programming.
9. Find a subset of a given set S = {sl, s2,.....,sn} of n positive integers whose sum is equal to a
given positive integer d. For example, if S={1, 2, 5, 6, 8} and d = 9 there are two
solutions{1,2,6}and{1,8}. A suitable message is to be displayed if the given problem instance
doesn't have a solution.
10. Implement N Queen's problem using Back Tracking.
Text Books::
1. Anany Levitin, Introduction to The Design & Analysis of Algorithms, Pearson Education, 1st
edition and above.
2. Java, The Complete Reference, Herbert Schildt.
26
Reference Books::
1. Kenneth Berman, Jerome Paul, Algorithms, Cengage Learning.
2. Thomas H. Cormen, Charles E. Leiserson, Ronal L. Rivest, Clifford Stein, introduction to
Algorithms PHI, 2nd
edition and above.
Course Outcome (COs)
At the end of the course, the student will be able to Bloom’s
Level
1. Identify and implement an appropriate algorithm design technique for a given
problem.
L1
2. Implement and Compute time required for recursive and iterative algorithms. L3
3. Design algorithms for specific applications using appropriate techniques. L6
4. Design graph search and sorting algorithms. L6
Program Outcome of this course (POs) PO No.
1. Graduates will demonstrate the knowledge of mathematics, basic sciences, logical
reasoning and engineering.
PO1
2. Graduates will demonstrate the ability to identify, formulate and solve computer
systems engineering problems.
PO2
3. Graduates will demonstrate the ability to design and experiment both in
hardware and software, analyze and interpret data.
PO3
4. Graduates will demonstrate an ability to analyze the given problems and design
solutions, as per the needs and specifications.
PO4
Assessment methods
1. Regular Journal Evaluation & Attendance Monitoring.
2. Lab Internal Assessment.
Scheme of Continuous Internal Evaluation (CIE):
Components Conduct of the lab Journal submission Lab test Total
Marks
Maximum Marks: 25 10 10 5 25
Submission and certification of lab journal is compulsory to qualify for SEE.
Minimum marks required to qualify for SEE : 13
Scheme of Semester End Examination (SEE):
1. It will be conducted for 50 marks of 3 hours duration. It will be reduced to 25 marks for the
calculation of SGPA and CGPA.
2. Minimum marks required in SEE to pass: 40 %
Initial write up 20 marks
50 marks Conduct of experiments 20 marks
Viva- voce 10 marks
27
Microprocessor and Microcontroller Laboratory
Course Code ISL48 Credits 1.5
Course type PC CIE Marks 25 marks
Hours/week: L-T-P 0 – 0 – 3 SEE Marks 25 marks
Total Hours: 40 SEE Duration 3 Hours for 50 marks
Course learning objectives
1. To develop the skill of designing and writing assembly language programs for 8086
Microprocessor.
2. To present the techniques of interfacing the LCD, ADC, DAC and stepper motor with 8051
Microcontroller in C.
Pre-requisites :
Basic Electronics.
Computer Organization & Architecture.
Logic Design & Applications.
List of experiments
PART A
1. a) Write an ALP to add „N‟ unsigned binary numbers and store result in the memory location
SUM.
b) Write an ALP to perform block data transfer from LOC1 to LOC2.
2. Write an ALP to find largest and smallest number in an array and store in memory location.
3. Write an ALP to calculate the function y= 4 +10, where „x‟ is unsigned 8 bit binary
number.
4. Write an ALP to sort unsigned 16-bit binary numbers in ascending/descending order using
bubble sort.
5. Write an ALP to find factorial of a single digit unsigned integer using recursive procedure.
6. Write an ALP to illustrate the significance of Procedures and Macros.
PART B
1. Write 8051 „C‟ program to interface stepper motor to rotate the motor in specified direction
(clock-=wise or counter-clockwise) by N steps. Introduce suitable delay between successive
steps.
2. Write 8051 „C‟ program to generate the following waveforms using DAC interface:
i) Square/ Rectangular
ii) Triangular
iii) Staircase
iv) Sine
3. Write 8051 „C‟ program to interface Elevator.
4. Write 8051 „C‟ program to interface Traffic Controller.
5. Write 8051 „C‟ program to interface LCD display to display the string “GITCSE”.
6. Write 8051 „C‟ program to interface ADC to convert analog input to digital.
28
Text Books::
1. Douglas V Hall: Microprocessors and Interfacing, The McGraw-Hill Companies, 1st edition and
above.
2. Muhammad Ali Mazidi, Janice Gillispie Mazidi, Rolin D. McKinlay: The 8051 Microcontroller
and Embedded Systems Using Assembly and C, Pearson Prentice Hall, 1st edition and above.
Reference Books::
1. Barry B Brey: The Intel Microprocessors, Pearson Education, 5th edition and above.
2. Kenneth Ayala: The 8051Microcontroller, Cengage Learning, 2nd
edition and above.
Course Outcome (COs)
At the end of the course, the student will be able to Bloom’s
Level
1. Design and write the assembly language programs for simple computing tasks
using 8086 Microprocessor.
L3
2. Demonstrate the ability to write and develop „C‟ programs to interface LCD,
ADC/ DAC and Stepper motor using 8051 Microcontroller.
L3
Program Outcome of this course (POs)
PO No.
1. Graduates will demonstrate the knowledge of mathematics, basic sciences, logical
reasoning and engineering.
PO1
2. Graduates will demonstrate the ability to design and experiment both in hardware and
software, analyze and interpret data.
PO3
3. Graduates will develop confidence for self education and ability for lifelong learning. PO10
Assessment methods
1. Regular Journal Evaluation & Attendance Monitoring.
2. Lab Internal Assessment.
Scheme of Continuous Internal Evaluation (CIE):
Components Conduct of the lab Journal submission Lab test Total
Marks
Maximum Marks: 25 10 10 5 25
Submission and certification of lab journal is compulsory to qualify for SEE.
Minimum marks required to qualify for SEE : 13
Scheme of Semester End Examination (SEE):
1. It will be conducted for 50 marks of 3 hours duration. It will be reduced to 25 marks for the
calculation of SGPA and CGPA.
2. Minimum marks required in SEE to pass: 40 %
Initial write up 2*10 = 20 marks
50 marks Conduct of experiments 2*10 = 20 marks
Viva- voce 10 marks
NOTE: Students has to pick one experiment from PART A and one experiment from
PART B.
29
Bloom’s Taxonomy of Learning Objectives
Bloom‟s Taxonomy in its various forms represents the process of learning. It was developed in 1956 by
Benjamin Bloom and modified during the 1990‟s by a new group of cognitive psychologists, led by Lorin
Anderson (a former student of Bloom‟s) to make it relevant to the 21st century. The revised taxonomy given
below emphasizes what a learner “Can Do”.
Lower order thinking skills (LOTS)
L1 Remembering Retrieve relevant knowledge from memory.
L2 Understanding Construct meaning from instructional material, including oral, written, and
graphic communication.
L3 Applying Carry out or use a procedure in a given situation – using learned knowledge.
Higher order thinking skills (HOTS)
L4 Analyzing
Break down knowledge into its components and determine the relationships
of the components to one another and then how they relate to an overall
structure or task.
L5 Evaluating Make judgments based on criteria and standards, using previously learned
knowledge.
L6 Creating Combining or reorganizing elements to form a coherent or functional whole
or into a new pattern, structure or idea.