B. Tech.

in Information Technology
Detailed Syllabus for Second Year (Semester III& IV)
Academic Year 2020-21
Department of Information Technology

RamraoAdik Institute of Technology

 RamraoAdik Institute of Technology,Nerul, Navi Mumbai.
Department of Information Technology

Bachelor of Technology in Information Technology

Semester-III

Course Teaching Scheme

Course Name Credits Assigned
Code (Contact Hours)
Theory Practical Tutorial Theory Practical Tutorial Total
Engineering Mathematics –III
ITC301 03 - 01 03 - 01 04
(EM-III)
ITC302 Database Management System 03 - 03 - 03
Data Structures and Information
ITC303 03 - 03 - 03
Representation
Electronic Devices and Logic
ITC304 03 - 03 - 03
Design
Computer Organization &
ITC305 03 - 03 - 03
Architecture
ITL301 Database Management System Lab 02 01 01
Data Structures and Information
ITL302 02 01 01
Representation Lab
Electronic Devices and Logic
ITL303 02 01 01
Design Lab
Computer Organization &
ITL304 02 01 01
Architecture Lab

2
 RamraoAdik Institute of Technology,Nerul, Navi Mumbai.
Department of Information Technology

Skill Based Lab 1 : Java (OOPM)

ITSL301 - 04 - - 02 - 02
Programming Lab
ITMP301 Mini Project I 02 01 01
AUC301 Constitution of India 01 - - - - - -
Sustainable Business Strategy
*HBSO301 - - - 01 - - 01*
Program(online)
Total 16 14 01 16 06 01 23

Evaluation Scheme
Semester-III
Course Exam Or
Course Name IA1 IA2 AVG MSE ESE TW Pr Total
Code Hrs
Engineering Mathematics –
ITC301 20 20 20 20 60 02 -- -- 100
III (EM-III)
Database Management
ITC302 20 20 20 20 60 02 - - 100
System
Data Structures and
ITC303 20 20 20 20 60 02 - - 100
Information Representation
Electronic Devices and
ITC304 20 20 20 20 60 02 - - 100
Logic Design
Computer Organization &
ITC305 20 20 20 20 60 02 - - 100
Architecture

3
 RamraoAdik Institute of Technology,Nerul, Navi Mumbai.
Department of Information Technology

Database Management
ITL301 - - - - - - 25 25 50
System Lab
Data Structures and
ITL302 Information Representation - - - - - - 25 25 50
Lab
Electronic Devices and
ITL303 - - - - - - 25 25 50
Logic Design Lab
Computer Organization &
ITL304 - - - - - - 25 -- 25 50
Architecture Lab
Skill Based Lab 1 : Java
ITSL301 - - - - - - 25 25 50
(OOPM) Programming Lab
ITMP301 Mini Project I - - - - - - 25 -- 25 50
AUC301 Constitution of India
Sustainable Business
*HBSO301
Strategy Program(online)
Total 800

4
 RamraoAdik Institute of Technology,Nerul, Navi Mumbai.
Department of Information Technology

Subject Theory Practical Tutorial Theory Practical/Oral Tutorial Total

Subject Name
Code Hrs Hrs Hrs Credit Credit Credits Credits
Engineering
ITC301 Mathematics –III 03 -- 01 03 -- 01 04
(EM-III)

Examination Scheme
Term
Theory Marks Practical Oral Total
Subject Work
Subject Name
Code In-Sem Evaluations
End
Avg. Mid Sem
IA1 IA2 of 2 Sem Exam
IAs Exam
Engineering
ITC301 Mathematics –III 20 20 20 20 60 -- -- -- 100
(EM-III)

5
 RamraoAdik Institute of Technology,Nerul, Navi Mumbai.
Department of Information Technology

Course Description:

The objectives of this course is to introduce students to the mostly used analytical and numerical methods in the different engineering
fields by making them to learn Fourier series, Fourier transforms and Z-transforms, statistical methods, numerical methods to solve
algebraic and transcendental equations, vector integration and calculus of variations.

Course Objectives:

1. To provide the requisite and relevant background necessary to understand other important engineering mathematics courses offered
for Engineers.
2. To introduce three important topics of applied mathematics, viz., Laplace transforms, Z- Transform and Fourier series.
3. To identify the direction and strength of a linear correlation between two factors and each source of variation in an analysis of
regression for data analysis.

Course Outcomes:

At the end of the course learner will able to:

1. Demonstrate ability to manipulate matrices and compute Eigen values and Eigen vectors.
2. Understand the concept of Laplace transform and inverse Laplace transform of various functions and apply the concept of Z-
transform to analyze the discrete-time signals and systems.
3. Understand complex variable theory, application of harmonic conjugate to get orthogonal trajectories and analytic function.
4. Expand the periodic function by using Fourier series in terms of sine and cosine functions.
5. Apply the concept of probability distribution to the engineering problems.
6. Apply the concept of Correlation and Regression to the engineering problems.

6
 RamraoAdik Institute of Technology,Nerul, Navi Mumbai.
Department of Information Technology

Sr.
Module Detailed Syllabus Hours CO
No
Eigen Values and Eigen vectors and their properties, Cayley-Hamilton
5
1 Linear Algebra theorem, Similarity of matrices and its properties, Diagonalization of
CO1
matrices,
Laplace Transform: Definition and condition of Existence of Laplace
transform, Laplace transform of standard functions (No Proof of
formulas), properties (without proofs) Introduction to inverse Laplace
Transforms
2. transform. 8 CO2
Z-Transform: Introduction, the Z-transform, properties, Region of
convergence, Inversion of the Z-Transform by partial fraction method
only,
Analytic function, Cauchy Riemann equation in Cartesian and polar
Complex form (without Proof), Milne Thomson Method (only) Harmonic
3 7 CO3
Differentiation function, orthogonal trajectories, Conformal mapping, bilinear
transformations, cross ratio, fixed points
Definition, Dirichlet’s conditions, Euler‘s formulae, Fourier series in
4 Fourier Series (c,c +2L), Fourier series in (0, 2L), Fourier series in (-L, L), Fourier 6 CO4
series of even and odd function, Half range series.
Discrete & continuous random variables, expectation, Variance,
Random Probability mass function and Density Function, Probability
5 7 CO5
Variables distribution: Introduction to Binomial distribution, Poisson & normal
distribution.
Statistical Correlation and Regression: Karl Pearson’s coefficient of correlation,
6 6 CO6
Techniques covariance, Spearman’s Rank correlation., Lines of Regression

7
 RamraoAdik Institute of Technology,Nerul, Navi Mumbai.
Department of Information Technology

Text books:
1. H.K. Das, Advanced Engineering Mathematics , S. Chand, 2008.
2. Gupta and Kapoor, Fundamentals of Mathematical Statistics, , 1st Edition, S. Chand and Sons.
3. B.S. Grewal, “Higher Engineering Mathematics”, Khanna Publication.

Reference Books:
1. B. S. Tyagi, “Functions of a Complex Variable,” Kedarnath Ram Nath Publication
2. B. V. Ramana, “Higher Engineering Mathematics”, Tata Mc-Graw Hill Publication
3. Wylie and Barret, “Advanced Engineering Mathematics”, Tata Mc-Graw Hill 6th Edition
4. Erwin Kreysizg, “Advanced Engineering Mathematics”, John Wiley & Sons, Inc
5. Howard Anton and Christ Rorres. Elementary Linear Algebra Application Version. 6th edition. John Wiley & Sons, INC

Evaluation Scheme:
1. In-Semester Assessment:
a. Assessment consists of two Internal Assessments (IA1, IA2) out of which; one should be compulsory class test (on
minimum 02 Modules) and the other is a class test / assignment on case studies / course project.
b. Mid Semester Examination (MSE) will be based on 40-50% of the syllabus.

2. End-Semester Examination:
 Question paper will comprise of full syllabus.
 In the question paper, weightage of marks will be proportional to the total number of lecture hours as mentioned in the
syllabus.

8
 RamraoAdik Institute of Technology,Nerul, Navi Mumbai.
Department of Information Technology

Subject Subject Name Theory Practical Tutorial Theory Practical/Oral Tutorial Total
Code Hrs Hrs Hrs Credit Credit Credits Credits
ITC302 Database Management 03 - - 03 - - 03
Systems

Examination Scheme
Term
Theory Marks Practical Oral Total
Work
Subject
Subject Name In-Sem Evaluations
Code
Mid End Sem
Avg. of Exam
IA1 IA2 Sem
2 IAs
Exam
ITC302 Database Management
20 20 20 20 60 -- -- 100
Systems

Prerequisites:
 Fundamentals of programming
 Set theory

Course Descriptions:

9
 RamraoAdik Institute of Technology,Nerul, Navi Mumbai.
Department of Information Technology

This course offers lectures and interactions to provide a foundation in data management concepts and database systems. It includes
representing data and information with the conceptual model as well as relational database model. Database creation and database
manipulation is included in this course with interactive query languages like (SQL) and database programming. Database access control,
security mechanism, transaction management, recovery system and query processing concepts are the integral part of this course. The
course is useful for the students having interest in database handling and data science.

Course Objectives:

1. Explain the concept of databases, database management systems, database structures and how they work.
2. Make use of entity-relationship model for creating simple databases from the real world scenarios.
3. Write Structured Query Language (SQL) statements.
4. Normalize a database using normalization rules.
5. Describetransaction processing and recovery mechanism concepts.
6. Demonstrate query processing,

Course Outcomes: At the end of the course learner will able to

1. Apply the concept of databases, database management systems, ER modeling for designing conceptual model.
2. Design database queries using relational algebra.
3. Query the database using Structured Query Language (SQL).
4. Design and develop databases from the real world by applying the concepts of normalization and design algorithms.
5. Understand transactionprocessing and recovery mechanism.
6. Evaluate query cost.

10
 RamraoAdik Institute of Technology,Nerul, Navi Mumbai.
Department of Information Technology

Sr. No. of CO
Module Detailed Syllabus
No. Hours Mapping

Basic concepts, Purpose of database systems, view of data, data models, database
languages, transaction management, storage management, database administrator,
database users, Components of DBMS and overall system structure. Advantages of
DBMS over file-processing systems, Data abstraction, data independence using
Introduction and
1 High-Level Conceptual Data Models for Database Design; An Example Database 6 CO1
ER model
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
and Design Issues.

Relational Model Concepts; Relational Model Constraints and Relational Database

Schemas; ER to Relational Model, Update Operations and Dealing with Constraint
Relational Model
Violations; Unary Relational Operations: SELECT and PROJECT; Relational
2 And Relational 7 CO2
Algebra Operations from Set Theory; Binary Relational Operations : JOIN and
Algebra
DIVISION ;Additional Relational Operations; Examples of Queries in Relational
Algebra; Relational Calculus

SQL-The SQL Data Definition and Data Types, Specifying Basic Constraints in SQL, Schema
Relational Change Statements in SQL; Basic Queries in SQL; Complex SQL Queries; Insert, 7 CO3
3
Database Delete and Update Statements in SQL, group by, order by, having, like, set
Standard operations, joins; Additional Features of SQL; Views (Virtual Tables) in SQL;

11
 RamraoAdik Institute of Technology,Nerul, Navi Mumbai.
Department of Information Technology

PL/SQL, triggers, JDBC Connectivity, Database Programming: Issues and

Techniques; Embedded SQL,

Informal Design Guidelines for Relation Schemas; introduction closures and covers,
Functional Dependencies; Normal Forms Based on Primary Keys; General
4 Database Design Definitions of Second and Third Normal Forms; Boyce-Codd Normal Form, 7 CO4
interconversion; lossy and lossless decomposition, dependency preserving
decomposition, Relational Database Schema Design;

The ACID Properties; Transactions and Schedules; Concurrent Execution of

Transactions; lock based protocols, 2PL, Serializability ,Transaction Support in SQL
Transaction ; Introduction to Lock Management; Lock Conversions; Dealing with Deadlocks;
Management& Specialized Locking Techniques; 8 CO5
5
Recovery
Mechanism Introduction to recovery: Recovery Concepts, Recovery Techniques Based on
Deferred Update, Recovery Techniques Based on Immediate Update, Shadow
Paging, The Aries Recovery Algorithm.

Overview, measures of query cost, selection, sorting, join, evaluation of expressions.

6 Query Processing 4 CO6
Query Optimization: transformation of relational algebra expressions, estimating
statistics of expressions, choice of evaluation plans.

12
 RamraoAdik Institute of Technology,Nerul, Navi Mumbai.
Department of Information Technology

Text Books:
1. Silberschatz, Korth and Sudharshan: Database System Concepts, Seventh Edition, Pearson, 2016

Reference Books:
1. Elmasri and Navathe: Fundamentals of Database Systems (6th Edition), McGraw Hill Publication, 2013
2. Raghu Ramakrishnan and Johannes Gehrke : Database Management Systems
3. S.K.Singh, Database Systems, Concepts, Design and Applications, Pearson Education.
4. Raghu Ramakrishnan, Johannes Gehrke, Database Management Systems, McGraw Hill Publication.

Evaluation Scheme:
1. In-Semester Assessment:
a. Assessment consists of two Internal Assessments (IA1, IA2) out of which; one should be compulsory class test (on
minimum 02 Modules) and the other is a class test / assignment on case studies / course project.
b. Mid Semester Examination (MSE) will be based on 40-50% of the syllabus.

2. End-Semester Examination:
 Question paper will comprise of full syllabus.
 In the question paper, weightage of marks will be proportional to the total number of lecture hours as mentioned in the
syllabus.

13
 RamraoAdik Institute of Technology,Nerul, Navi Mumbai.
Department of Information Technology

Theory Practical Tutorial Theory Practical/Or Tutorial Total

Subject Code Subject Name Hrs Hrs Hrs Credit al Credits Credits
Credit
Data Structures
ITC303 and Information 03 -- -- 03 -- -- 03
Representation

Examination Scheme
Term
Theory Marks Practical Oral Total
Work
Subject Code Subject Name
In-Sem Evaluations
End
Avg. Mid Sem
IA1 IA2 of 2 Sem Exam
IAs Exam
Data Structures
ITC303 and Information 20 20 20 20 60 -- -- -- 100
Representation

Course Description:
These courses cover analysis and design of fundamental data structures and engage learners to use data structures as tools to
algorithmically design efficient computer programs that will cope with the complexity of actual applications. This course focuses on
array-based lists, linked lists, Stack, queues, hash tables, recursion, binary trees, heaps, sorting algorithms, graphs, and binary trees.

14
 RamraoAdik Institute of Technology,Nerul, Navi Mumbai.
Department of Information Technology

Topics include elementary data structures, (including arrays, stacks, queues, and lists), advanced data structures (including trees and
graphs), the algorithms used to manipulate these structures, and their application to solving practical engineering problems.

Course Objectives:
1. To Understand and identify algorithms and their method for evaluating them.
2. To implement the data structure concept through ADT including List, Stack, Queues.
3. To calculate the complexity of various algorithms.
4. Data abstraction and information hiding.
5. To study linear and Non-linear data structures and their applications in problem solving and programming.

Course Outcomes:
At the end of the learner will able to:

1. Understand the basic concepts of Data and its representations.

2. Apply Algorithms for solving problems like sorting and searching.
3. Understand the operations using linked list.
4. Apply the stack and queue concepts for problem solving.
5. Implement concepts of tree data structures.
6. Develop applications using Graph Data Structures.
Prerequisites:

 Prerequisite C Programming

15
 RamraoAdik Institute of Technology,Nerul, Navi Mumbai.
Department of Information Technology

Sr. No. Module Detailed Syllabus Hours CO Mapping

Concepts of data and representations, Data Structures: types and

Operations.
Data
Arrays: Single and Multidimensional Arrays, Representation of
1 Structures 4 CO1
Arrays: Row Major Order, and Column Major Order, Application of
Basics
arrays, Sparse Matrices and their representations.

Structure, Nested Structures, Self-referential Structure.

Searching : Linear search, Binary Search, Implementation and

Analysis

Internal Sorting: Insertion Sort, Selection, Bubble Sort, Quick Sort,

Searching and Merge Sort, Heap Sort, Radix Sort and Count Sort.
2 7 CO2
Sorting
Search Trees: Binary Search Trees(BST), Insertion and Deletion in
BST, Complexity of Search

Hashing: Hash Function, Collision Resolution Strategies

Linked List and its types, Array and Dynamic Implementation of

Linked List, Operations on singly linked lists, circularly linked lists
3 Linked List 8 CO3
and doubly-linked lists, applications of lists –Polynomial
Manipulation and generalized linked list.

16
 RamraoAdik Institute of Technology,Nerul, Navi Mumbai.
Department of Information Technology

Stacks: Definition, operations on Stack: Push &Pop, Array and

Linked Implementation of Stack, Application of stack: Prefix and
Stack and Postfix Expressions, Evaluation of postfix expression, Recursion.
4 6 CO4
Queue Queues, Circular Queue, Double ended queue. Operations on these
Queues: Create, enqueue, dequeue, and traverse, Array and linked
implementation of queues in C, Priority Queue.

Basic terminologies (Node, height, levels, depth etc.), Binary Trees,

Binary Tree Representation: Array Representation and Dynamic
Representation, Complete Binary Tree, Expression trees, AVL Trees
5 Trees 8 CO5
and its operations, Tree Traversal algorithms: In order, Preorder and
Post order, Threaded Binary trees, Traversing Threaded Binary trees,
Huffman algorithm.

Definition, terminologies and properties, Graph definition and

concepts, graph representation, Matrix representation of graph, List
structures and other Representation of graph, Breadth first search
6 Graphs 7 CO6
and depth first search, Minimum Spanning Trees and applications
of graph , Shortest Path algorithm: Warshal Algorithm and Dijikstra
Algorithm.

17
 RamraoAdik Institute of Technology,Nerul, Navi Mumbai.
Department of Information Technology

Text Books:
1. Data structures using C by Tenenbaum, Langsam, Augenstein,and Pearson.
2. Data Structures using C, ReemaThareja, Oxford.
3. C and Data structures, Prof. P.S.Deshpande, Prof. O.G.Kakde, Dreamtech Press.
4. Introduction to Data Structure and its Applications Jean-Paul Tremblay, P. G.

Reference Books:
1. Data Structures Using C & C++, Rajesh K. Shukla, Wiley- India.
2. Data Structures and Algorithm Analysis in C ,MarkA.Weiss ,Pearson
3. ALGORITHMS Design and Analysis, Bhasin, OXFORD.
4. Computer Algorithms by Ellis Horowitz and SartajSahni, Universities Press.

Evaluation Scheme:
1. In-Semester Assessment:
a. Assessment consists of two Internal Assessments (IA1, IA2) out of which; one should be compulsory class test (on minimum
02 Modules) and the other is a class test / assignment on case studies / course project.
b. Mid Semester Examination (MSE) will be based on 40-50% of the syllabus.

2. End-Semester Examination:
 Question paper will comprise of full syllabus.
 In the question paper, weightage of marks will be proportional to the total number of lecture hours as mentioned in the
syllabus.

18
 RamraoAdik Institute of Technology,Nerul, Navi Mumbai.
Department of Information Technology

Theory Practical Tutori Theory Practical/ Tutorial Total

Subject Code Subject Name Hrs Hrs al Credit Oral Credits Credits
Hrs Credit
ITC304 Electronic 03 -- - 03 -- - 03
Devices and
Logic Design

Examination Scheme
Term
Theory Marks Practical Oral Total
Work
Subject Code Subject Name In-Sem Evaluations
End
Avg. Mid
Sem
IA1 IA2 of 2 Sem
Exam Exam
IAs
ITC304 Electronic
Devices and 20 20 20 20 60 -- -- -- 100
Logic Design

Course Description:

This course explores the fundamentals of electronic devices and digital circuits. The course provides the knowledge of diode,
transistors, BJT and its operations. The main emphasis is given on the fundamentals of digital arithmetic, Boolean algebra, designing
of combinational and sequential circuit. The combinational logic deals with logic gates, minimization techniques, arithmetic circuits,
multiplexer, demultiplexer, encoders and decoders. The sequential circuit deals with flip-flops, synthesis of sequential circuits,

19
 RamraoAdik Institute of Technology,Nerul, Navi Mumbai.
Department of Information Technology

counters, registers. By the end of the course, student will understand the basic parts of a VHDL model and used in both the synthesis
and simulation environments.

Course Objectives:
1. To understand basic principles of analog and digital electronics.
2. To evaluate number systems representation and application of binary number applications.
3. To learn about logic gates and Boolean algebra.
4. To design and implement combinational circuits.
5. To design and implementation of sequential circuits.
6. To understand advanced tools for digital circuit design.

Course Outcomes: At the end of the course learner will able to

1. Understand the concept of basic electronics.
2. Understand number representation and perform arithmetic operations.
3. Apply minimization techniques on Boolean expression using Boolean algebra and design it using logic gates.
4. Design and construct combinational circuits.
5. Design and construct sequential circuits.
6. Translate real world problems into digital logic formulations using VHDL.

CO
Sr. No. Module Detailed Content Hours
Mapping
Difference between Analog and Digital Circuit, Introduction to
Basic Electronics and Logic Diode and Transistor, its types, BJT: DC operating point, BJT
1 4 CO1
families characteristics & parameters, Types of logic families (TTL and
CMOS)

20
 RamraoAdik Institute of Technology,Nerul, Navi Mumbai.
Department of Information Technology

Introduction to Number systems, types of number systems,

Binary Number systems- Signed Binary Numbers, Binary, Octal,
2 Number Systems Decimal and Hexadecimal number Systems and their 6 CO2
conversions, Binary arithmetic using 1’s and 2’s complements,
Gray Code, BCD Code, Excess-3 code, ASCII Code.
Basic gates, Derived gates, Universal gates, Boolean Algebra
Theorems and Properties , Standard SOP and POS form,
Logic Gates and Boolean
3 Reduction of Boolean functions using Algebraic method, K -map 8 CO3
Algebra
method (upto 4 Variable),Variable entered Maps, Quine Mc
Cluskey.
Introduction, Half and Full Adder, Half and Full Subtractor, Four
Bit Binary Adder, 4-bit BCD Adder, Binary Comparator (2, 3, 4
4 Combinational Circuits 8 CO4
variable), Encoder and Decoder, Multiplexers and
Demultiplexers, Binary to BCD code converter, ALU IC74181.
Flip Flops: SR, JK, D, T, master slave flip flop, its conversions,
Register: Shift register, SISO, SIPO, PISO, PIPO, Bi-directional
5 Sequential Circuits and universal shift register. Counters: Design of synchronous and 8 CO5
asynchronous ,Modulo Counter, Up Down counter IC 74193,
Ring and Johnson Counter
VHDL description of Variables, Signals and constants, Arrays,
VHDL operators, VHDL functions, VHDL procedures, Packages
6 VHDL and libraries, Compilation and simulation of VHDL code, 5 CO6
Modelling a basic gates and combinational circuits. VHDL
models for a multiplexer,

21
 RamraoAdik Institute of Technology,Nerul, Navi Mumbai.
Department of Information Technology

Text Books:
1. R. P. Jain, “Modern Digital Electronics”, Tata McGraw Hill.
2. J. Bhasker. “VHDL Primer”, Pearson Education.

Reference Books:
1. M. Morris Mano, “Digital Logic and computer Design”, PHI
2. G. K. Kharate, “Digital Electronics”, Oxford Higher Education

Evaluation Scheme:
1. In-Semester Assessment:
a. Assessment consists of two Internal Assessments (IA1, IA2) out of which; one should be compulsory class test (on minimum
02 Modules) and the other is a class test / assignment on case studies / course project.
b. Mid Semester Examination (MSE) will be based on 40-50% of the syllabus.

2. End-Semester Examination:
 Question paper will comprise of full syllabus.
 In the question paper, weightage of marks will be proportional to the total number of lecture hours as mentioned in the
syllabus.

22
 RamraoAdik Institute of Technology,Nerul, Navi Mumbai.
Department of Information Technology

Theory Practical Tutorial Theory Practical/Oral Tutorial Total

Subject Code Subject Name
Hrs Hrs Hrs Credit Credit Credits Credits
Computer
Organization
ITC305
and 03 -- - 03 -- - 03
Architecture

Examination Scheme
Term
Theory Marks Practical Oral Total
Work
Subject Code Subject Name In-Sem Evaluations
Mid End
Avg.
Sem Sem
IA1 IA2 of 2
Exa Exam
IAs m
Computer
ITC305 Organization
20 20 20 20 60 -- -- -- 100
and
Architecture

23
 RamraoAdik Institute of Technology,Nerul, Navi Mumbai.
Department of Information Technology

Course Description:

Modern computer technology requires professionals of every computing specialty to understand both hardware and software. The
interaction between hardware and software at a variety of levels also offers a framework for understanding the fundamentals of
computing. Computer architecture is the science and art of selecting and interconnecting hardware components to create a computer
that meets functional, performance, and cost goals. Computer organization defines the constituent parts of the system, how they are
interconnected, and how they interoperate in order to implement the architectural specification. In this course, you will learn the
basics of hardware components such as memory and I/O devices, instruction set architectures and assembly language, and designs
to improve performance.

Course Objectives:
1. Conceptualize the structure, function and characteristics of computer systems.
2. Analyze various algorithms used for arithmetic operations.
3. Study processor organization.
4. Study the function of each element of the memory hierarchy in digital computers.
5. Study microprocessor architecture and assembly language programming.
6. Identify and compare different methods for computer I/O.

Course Outcomes: At the end of the course learner will able to

1. Understand the different computer architectures such as RISC, CISC, Von Neumann Architecture, Harvard architecture, 8086
microprocessor and 8051 microcontroller.
2. Performcomputer arithmetic operations on integers and real numbers.
3. Demonstrate control unit approaches like hardwired control unit, micro programmed control unit.
4. Implement assembly language programs with 8086 microprocessor instruction set.
5. Analyze and compare mapping techniques of cache memory.
24
 RamraoAdik Institute of Technology,Nerul, Navi Mumbai.
Department of Information Technology

6. Analyze different methods ofdata transfer techniques such as programmed I/O, Interrupt I/O, DMA

Prerequisites:

 Fundamentals of Computer

 Digital Logic Design

CO
Sr. No. Module Detailed Content Hours
Mapping

History and Generation of Computer, Functional Units of

Fundamentals of Computer, Basic Operational Concepts of Computer, Top
Computer level Structure and Function, Performance of Computer,
1 05 CO1
Organization and Von Neumann Architecture-Expanded structure of IAS
Architecture Computer, Harvard Architecture, RISC, CISC
Architectures

Multiplication: Add and shift, Booth Algorithm, Fast

Computer Multiplication, Division: restoring and Non-restoring
2 06 CO2
Arithmetic Techniques. Floating Point Arithmetic: Floating point
representation IEEE 754 (Single & double precision)

25
 RamraoAdik Institute of Technology,Nerul, Navi Mumbai.
Department of Information Technology

Central Processing Unit: Processor Organization, Internal

Structure of CPU, General register organization,
Instruction Format, Instruction Cycle, Addressing Modes,
Control Unit: Soft wired (Micro-programmed) and
Processor hardwired control unit, design methods. Micro operations:
3 09 CO3
Organization Register transfer language, Arithmetic Micro-operations,
Logic Micro-operations, Shift Micro-operations.
Introduction to parallel processing concepts, Flynn’s
classifications, Six stage Instruction Pipelining, Pipelining
Hazards

Main memory , RAM, ROM and secondary memory,

Memory Parameters, Memory hierarchy, Allocation
Memory
4 Policies, Cache Memory- Concept, architecture (L1, L2, 07 CO4
Organization
L3), Locality of reference, Mapping Techniques, Cache
Coherency, Associative and Interleaved Memory

Architecture of 8086 family, 8086 Hardware Design,

Microprocessor80
Minimum mode & Maximum mode of Operation. Study of
86 and
bus controller 8288 & its use in Maximum mode.
5 Architecture 0f 08 CO5
Addressing modes, Instruction Set, Assembly Language
8051
Programming, Architecture of 8051,and Pin Configuration
microcontroller
of 8051.

26
 RamraoAdik Institute of Technology,Nerul, Navi Mumbai.
Department of Information Technology

Input/output systems, I/O module-need & functions and

Input-Output
6 Types of data transfer techniques: Programmed I/O, 04 CO6
Organization
Interrupt driven I/O and DMA

Text Books:
1. Computer Organization, Carl Hamacher, ZvonksVranesic, SafeaZaky, 5th Edition, McGraw Hill.
2. Microprocessor and Interfacing: By Douglas Hall (TMH Publication).
3. Computer Organization and Architecture – William Stallings Sixth Edition, Pearson/PHI

Reference Books:
1 M. A. Mazidi, J. G. Mazidi, R. D., McKinlay ,”The 8051 microcontroller &
Embedded systems using Assembly and C”, Pearson, 3rd edition
2 John P. Hayes, Computer Architecture and Organization, Third Edition., McGraw-Hill
3 K Bhurchandi, Advanced Microprocessors & Peripherals, Tata McGraw-Hill Education

Evaluation Scheme:
1. In-Semester Assessment:
a. Assessment consists of two Internal Assessments (IA1, IA2) out of which; one should be compulsory class test (on minimum
02 Modules) and the other is a class test / assignment on case studies / course project.
b. Mid Semester Examination (MSE) will be based on 40-50% of the syllabus.

2. End-Semester Examination:
 Question paper will comprise of full syllabus.
 In the question paper, weightage of marks will be proportional to the total number of lecture hours as mentioned in the
syllabus.

27
 RamraoAdik Institute of Technology,Nerul, Navi Mumbai.
Department of Information Technology

Subject Code Subject Name Theory Practical Tutorial Theory Practical/Oral Tutorial Total
Hrs Hrs Hrs Credit Credit Credits Credits
ITL301 Database Management - 2 - - 1 - 01
Systems Lab

Examination Scheme

Term Practical Oral

Theory Marks Total
Subject Work
Subject Name
Code In-Sem Evaluations
End
Mid Sem
Avg. of 2
IA1 IA2 Sem Exam
IAs
Exam
Database Management --
ITL301 -- -- -- -- -- 25 25 50
Systems Lab

Prerequisites:
 Programming Concepts

Course Descriptions:
The main objective of the Database Laboratory is to give students hands on practice with the databases like SQL, Postgres and Mongodb.
The Course covers fundamental operations with databases, the steps to create, and manage the databases and different functionalities
like user authentication and authorization. In details, the course covers Data Definition, Data Manipulation and Data Control Language

28
 RamraoAdik Institute of Technology,Nerul, Navi Mumbai.
Department of Information Technology

commands. This course also includes the facilities for transaction management with databases, triggers and store procedures. Since this
course is a foundation for data science, it will be helpful to the students having interest in data science.

Lab Objectives:

1. To understand SQL databases representation and environment.

2. To construct conceptual data model for real life applications and to map it to relational model.
3. To Build Relational Model from ER/EER and demonstrate usage of relational algebra.
4. To Apply SQL to store and retrieve data efficiently.
5. To implement database connectivity using JDBC.
6. To understand the concepts of unstructured databases and data partitioning.

Lab Outcomes: At the end of the course learner will able to

1. Understand SQL database.

2. Design and implement database schema for given problem domain.
3. Formulate and write SQL queries using DDL and DML.
4. Implement view, triggers and procedures to demonstrate specific event handling.
5. Implement database connectivity using JDBC.
6. Work with unstructured databases and to understand data partitioning.

Software requirement: SQL, open source databases, java.

29
 RamraoAdik Institute of Technology,Nerul, Navi Mumbai.
Department of Information Technology

Experiment
Detailed Contents Hours LO Mapping
No.

1 Getting familiar with SQL Database 2 LO1

2 Draw the conceptual model for real life application and its mapping with relational model 2 LO2

3 Execution of DDL commands with integrity constraints 2 LO3

4 Execution of Data Manipulation commands and populating the database 2 LO3

5 Execution of grant and revoke with different access rights 2 LO3

6 Execution of complex queries with clauses : ordering, grouping, pattern matching 1 LO3

7 Execution of join operations 1 LO3

8 Execution of Views and Triggers 4 LO4

9 Execution of PL/SQL blocks and stored procedures 4 LO4

10 Demonstrate database connectivity using JDBC 2 LO5

11 Understand the concept of data partitioning 2 LO6

12 Getting familiar and working with unstructured databases (MongoDB) 2 LO6

30
 RamraoAdik Institute of Technology,Nerul, Navi Mumbai.
Department of Information Technology

Text Books:
1. Elmasri and Navathe: Fundamentals of Database Systems (6th Edition), McGraw Hill Publication, 2013
2. Raghu Ramakrishnan and Johannes Gehrke : Database Management Systems
3. Silberschatz, Korth and Sudharshan: Database System Concepts, Seventh Edition, Pearson, 2016
Reference Books:
1. “MongoDB-Definitive Guide, Kristina Chodorow, Oreilly, 2nd edition.
2. “Database Systems, Concepts, Design and Applications” by S.K.Singh, Pearson Education.
3. “Database Management Systems” by Raghu Ramakrishnan, Johannes Gehrke, McGraw Hill Publication.
4. “Fundamentals of Database Systems” by Elmsari, Navathe, 5th Edition, Pearson Education (2008).

Evaluation Scheme:

Term work Evaluation:

Term Work shall consist of write ups of experiments performed in the laboratory based on the above list, but not limited to it. Also,
Term work may include a mini project report if a mini project is assigned as part of the lab.

Practical and Oral Evaluation:

Practical exams will be conducted based on the experiments performed in the laboratory.

31
 RamraoAdik Institute of Technology,Nerul, Navi Mumbai.
Department of Information Technology

Subject Theory Practical Tutorial Theory Practical/Oral Tutorial Total

Subject Name
Code Hrs Hrs Hrs Credit Credit Credits Credits
Data Structures
and Information
ITL302 -- 02 -- -- 01 -- 01
Representation
Lab

Examination Scheme
Practical
Term
Theory Marks & Oral Total
Subject Work
Subject Name Oral
Code
In-Sem Evaluations
End
Avg. Mid Sem
IA1 IA2 of 2 Sem Exam
IAs Exam
Data Structures
and Information
ITL302 -- -- -- -- -- 25 25 50
Representation
Lab

Lab Description:
This is a course to enable students to use various data structures in programming. The objective of the course is to teach programming
(with an emphasis on problem solving) and introduce elementary data structures.
32
 RamraoAdik Institute of Technology,Nerul, Navi Mumbai.
Department of Information Technology

Lab Objectives:
1. Understand the basic concepts of Data and its representations.
2. Apply Algorithms for solving problems like sorting and searching
3. Understand the operations using linked list.
4. Apply the stack and queue concepts for problem solving.
5. Implement concepts of tree data structures.
6. Develop applications using Graph Data Structures.

Lab Outcomes: At the end of the course learner will able to

1. Implement various data representations in C.
2. Implement various searching and sorting operations.
3. Implement various operations using linked list.
4. Implement various operations on Stack and Queue.
5. Implement basic operations on binary tree.
6. Implement basic operations using graphs.
Prerequisites:

 C Programming Language

Hardware & Software Requirements:

Hardware Requirement: Software requirement:

PC i3 processor and above Turbo/Borland C complier

33
 RamraoAdik Institute of Technology,Nerul, Navi Mumbai.
Department of Information Technology

Sr. No. Detailed Contents Hours LO Mapping

 Implementation of nested structure in C.

1  Implementation of self-referential structure in C. 04 LO1
 C Program to Check if a Matrix is a Sparse Matrix
 Implementation of following sorting algorithms: Insertion Sort, Selection, Bubble
Sort, Quick Sort, Merge Sort, Heap Sort.
2  Implementation of Binary Search Trees(BST) and perform Insertion and Deletion in 06 LO2
BST
Implementing our Own Hash Table with Separate Chaining in C
Linked List
 Implementation of following operations on Singly Linked List, Doubly Linked List
and Circular Linked List
3 o Create 04 LO3
o Insert at beginning, at end and at given position.
o Delete a node from beginning, from end and from a given position.
o Display
 Create new linked list from two given linked list with greater element at each node
Stack and Queue
4  Linked List and Array implementation of stack considering following operations: 04 LO4
o Push
o Pop

34
 RamraoAdik Institute of Technology,Nerul, Navi Mumbai.
Department of Information Technology

o Peek
o Reverse
 Linked List and Array implementation of queue, double ended queue and circular
queue considering following operations:
o Enqueue
o Dequeue
 Implementation of tree Traversal techniques as given below:
o Preorder
o Post order
5 o Inorder 04 LO5
 Implement AVL tree perform following operations:
o Insert an element
o Delete an element
 Implementation of graph using :
6 o Adjacency Matrix 04 LO6
o List
 Implementation of Graph Traversal using BFS and DFS.

Text Books:
1. S. K Srivastava, DeepaliSrivastava; Data Structures through C in Depth; BPB Publications; 2011.
2. Yedidya Langsam, Moshej Augenstein, Aaron M. Tenenbaum; Data Structure Using C & C++; Prentice Hall of India; 1996.
3. ReemaThareja; Data Structures using C; Oxford.

35
 RamraoAdik Institute of Technology,Nerul, Navi Mumbai.
Department of Information Technology

Reference Books:
1. Ellis Horowitz, Sartaj Sahni; Fundamentals of Data Structures; Galgotia Publications; 2010.
2. Jean Paul Tremblay, Paul G. Sorenson; An introduction to data structures with applications; Tata McGraw Hill;
1984.
3. Rajesh K. Shukla; Data Structures using C and C++; Wiley India; 2009.

Term work Evaluation: Term Work shall consist of write ups of experiments performed in the laboratory based on the above list, but
not limited to it. Also, Term work may include a mini project report if a mini project is assigned as part of the lab.

Practical and Oral Evaluation: Oral & Practical exams will be conducted based on the experiments performed in the laboratory.

36
 RamraoAdik Institute of Technology,Nerul, Navi Mumbai.
Department of Information Technology

Practical/
Subject Theory Practical Tutorial Theory Tutorial Total
Subject Name Oral
Code Hrs Hrs Hrs Credit Credits Credits
Credit
Electronic
Devices and
ITL303 -- 2 -- 1 -- 1
Logic Design
Lab

Examination Scheme

Term Practical Oral

Theory Marks Total
Subject Work
Subject Name
Code In-Sem Evaluations
End
Mid
Avg. of Sem
IA1 IA2 Sem
2 IAs Exam
Exam
Electronic
Devices and
ITL303 -- -- -- -- -- 25 25 -- 50
Logic Design
Lab

Prerequisites:
• Concepts of Logic Design

37
 RamraoAdik Institute of Technology,Nerul, Navi Mumbai.
Department of Information Technology

Lab Description
The main objective of the Digital Design Lab is to give familiarity to design various logic circuits on the breadboard using ICs and
simulation using Hardware Description Language (VHDL). In this Lab, students will implement Digital Logic Circuits using ICs of
basic logic gates to build Combinational and Sequential Digital Logic circuits. This Lab is designed to familiarize students with HDL
based Digital Design Flow and different levels of coding available in VHDL.

Lab Objectives:
1. Learn to minimize and design combinational logic.
2. Understand the relationships between combinational logic and Boolean algebra, sequential logic and finite state Machines.
3. Appreciate trade-offs in complexity and speed of combinatorial designs.
4. Understand how state can be stored in a digital logic circuit.
5. Study how to design a simple finite state machine from a specification and be able to implement this in gates and flip-flops.
6. Learn to translate real world problems into digital logic formulations.

Lab Outcomes (LO): At the end of the course learner will able to
1. Minimize the Boolean algebra and design it using logic gates.
2. Analyze and design combinational circuit.
3. Realize given function using combinational circuit.
4. Design and develop sequential circuits
5. Implement digital systems using programmable logic devices
6. Translate real world problems into digital logic formulations using VHDL.

Hardware requirement:

 Digital Trainer kit, ICs for various logic gates and functions, connecting wires

38
 RamraoAdik Institute of Technology,Nerul, Navi Mumbai.
Department of Information Technology

Software requirement:
 VHDL tool

LO
Sr. No. Module Detailed Syllabus Hours
Mapping

Boolean Algebra and Logic a. Verify the truth table of logic gates (basic
1 gates and universal gates) 4 LO1

b. Realization of Boolean algebra using gates

Design and a. Design of Full Adder and Full

2 Analysis of Subtractor. 4 LO2
Combinational Circuits b. verify the operation of 4- bit magnitude
comparator

Implementation of a. Implementation of MUX and DeMUX.

3 Combinational Circuits 4 LO3
b. Implementation of Encoder and Decoder

Sequential Logic Design a. To verify and observe the operation of

flip-flop(any two)
4 6 LO4
b. To design any two shift registers.
c. To design Modulo and ring Counter

39
 RamraoAdik Institute of Technology,Nerul, Navi Mumbai.
Department of Information Technology

Programmable logic a. Evaluate and observe Boolean expression

5 Devices using PALs and PLAs. 2 LO5

VHDL a. Implementation of Logic Gates using VHD

b. Evaluate and observe
6 combinational circuits on VHDL. 6 LO6

c. Evaluate and observe sequential

circuits on VHDL.

Text Books:

1. R. P. Jain, “Modern Digital Electronics”, Tata McGraw Hill.

2. Balbaniam, Carison,”Digital Logic Design Principles”, Wiley Publication

References:

1. M. Morris Mano, “Digital Logic and computer Design”, PHI

2. J. Bhasker. “VHDL Primer”, Pearson Education.

Term Work:

Term Work shall consist of at least 10 to 12 practical’s based on the above list. Also Term work Journal must include at least 2
assignments.

40
 RamraoAdik Institute of Technology,Nerul, Navi Mumbai.
Department of Information Technology

Term Work Marks: 25 Marks (Total marks) = 15 Marks (Experiment) + 5 Marks (Assignments) + 5 Marks (Attendance)
Oral & Practical Exam: An Oral & Practical exam will be held based on the above syllabus.

41
 RamraoAdik Institute of Technology,Nerul, Navi Mumbai.
Department of Information Technology

Subject Theory Practical Tutorial Theory Practical/Oral Tutorial Total

Subject Code
Name Hrs Hrs Hrs Credit Credit Credits Credits
Computer
Organization
ITL304 and -- 2 -- 1 -- 1
Architecture
Lab

Examination Scheme

Term
Theory Marks Practical Oral Total
Subject Work
Subject Name
Code In-Sem Evaluations
Mid End Sem
Avg. of 2 Exam
IA1 IA2 Sem
IAs
Exam
Computer
ITL304 Organization and -- -- -- -- -- 25 -- 25 50
Architecture Lab

42
 RamraoAdik Institute of Technology,Nerul, Navi Mumbai.
Department of Information Technology

Lab Description:
The goal of this lab is to implement various computation or simulation based experiments and arithmetic algorithms. This lab helps
students to learn assembly language programs and mixed language programming. It introduces software’s like TASM, MASM, to
implement the assembly language programs.

Lab Objectives:
1. Conceptualize the basics of organizational and architectural issues of a digital computer.
2. Get hands on Computer Arithmetic operations on integers
3. Demonstrate simulations related with functional units of computer.
4. Study assembly Language Programming with 8086 instruction set.
5. Study Mixed Language Programming.
6. Study string and procedure instruction set of 8086 microprocessor.

Lab Outcomes (LO): At the end of the course learner will able to
1. Demonstrate various components and peripherals of computer system.
2. Implement algorithms to handle integer data.
3. Simulate functional units of computer.
4. Develop assembly language programming using 8086 instruction set.
5. Develop mixed language programming using Turbo C.
6. Develop assembly language programs based on string and procedure for 8086 microprocessor.

Software requirements:Microsoft Macro Assembler (TASM) / Turbo Assembler (MASM), Turbo C, VHDL

Hardware Requirements: Motherboard, RAM, Processor, Connectors, Cables, SMPS, HDD, Monitor, Graphics card (optional), and
Cabinet.

43
 RamraoAdik Institute of Technology,Nerul, Navi Mumbai.
Department of Information Technology

Sr.
Detailed Syllabus Hours LO Mapping
No.

1 1. Study of PC MotherboardTechnology (South Bridge andNorth Bridge). 6 LO1

2. Disassembling the System Unit& Identifying InternalComponents and Connections.
3. Study of various connections andports used in computercommunication.
2 1.Implementation of Booth’s algorithm 4 LO2
2. Implementation of Restoring Algorithm of division.
3 1.To create a control store for micro-programmed control unit (using VHDL) 4 LO3
2. Using a cache simulator , calculate the cache miss-rate for various mapping schemes

4 1. Write a program to move set of numbers from one memory block to another. 4 LO4
2. Write a Program to count number of 1’s and 0’s in a given 8 bit number

1. 1. Write a mixed Language ( C and TASM) program to find the LCM of two numbers
5 2. 2. Write a program in C to demonstrate use of interrupts. 4 LO5

1. Check whether a given string is a palindrome or not.

6 2. Compute the factorial of a positive integer ‘n’ using procedure. 4 LO6

44
 RamraoAdik Institute of Technology,Nerul, Navi Mumbai.
Department of Information Technology

Text Books:
1. John Uffenbeck, 8086/8088 family: Design Programming and Interfacing, (Pearson Education
2. Scott Mueller, “Upgrading and repairing PCs”, Pearson,

Reference Books:
1. K Bhurchandi, Advanced Microprocessors & Peripherals, Tata McGraw-Hill Education
2. Microprocessor and Interfacing: By Douglas Hall (TMH Publication).

Evaluation Scheme:

Term work Evaluation:

Term Work shall consist of write ups of experiments performed in the laboratory based on the above list.

Oral Evaluation:
Only Oral exams will be conducted based on the experiments performed in the laboratory.

45
 RamraoAdik Institute of Technology,Nerul, Navi Mumbai.
Department of Information Technology

Theory Practical Tutorial Theory Practical/Oral Tutorial Total

Subject Code Subject Name
Hrs Hrs Hrs Credit Credit Credits Credits
Skill Based Lab1
: Java(OOPM)
ITSL301 -- 4 -- 2 -- 2
Programming
Lab

Examination Scheme

Term Practical Oral

Theory Marks Total
Work
Subject Code Subject Name
In-Sem Evaluations
Mid End Sem
Avg. of 2 Exam
IA1 IA2 Sem
IAs
Exam
Skill Based Lab1
ITSL301 :Java Programming -- -- -- -- -- 25 25 --- 50
Lab

46
 RamraoAdik Institute of Technology,Nerul, Navi Mumbai.
Department of Information Technology

Prerequisites:

 C
 C++

Lab Description:

The goal of this course is to provide students with the ability to write programs in Java and make use of the concepts of Object-
Oriented Programming to develop various real time applications.

Lab Objectives:

1. To understand the concepts of object-oriented paradigm in the Java programming language.

2. To understand the concepts of classes, objects, members of a class and the relationships among them needed for a finding the
solution to a specific problem.
3. To introduce Object Oriented Programming to students with emphasis on Classes, Objects
4. To learn the principles of packages, inheritance and interfaces.
5. To learn Exception handling with creation of user defined exception and perform multi-threading using threads in JAVA
6. To learn designing, implementing, testing, and debugging graphical user interfaces in Java using AWT, Swing and JavaFX.

Lab Outcomes (LO):

At the end of the course learner will able to:

1. Understand the fundamental concepts of Java Programming.
2. Implement the solution for a specific problem based on the concepts of classes, objects, members of a class and the
relationships.
3. Develop Java applications using fundamentals of classes and object.
47
 RamraoAdik Institute of Technology,Nerul, Navi Mumbai.
Department of Information Technology

4. Implement various programs based on abstract classes, inheritance, interfaces and packages.
5. Implement inbuilt exception handling functions with user defined exception handling, implement multithreading operations.
6. Design and develop Graphical User Interface using Abstract Window Toolkit, Swing and JavaFX along with event handling.

Software requirement:Windows or Linux Desktop OS, JDK 1.8 or higher, Notepad ++, JAVA IDEs like Net beans or Eclipse

LO
Sr. No. Detailed Contents Hours
Mapping

Concepts of OOP, Fundamentals of Java

1 Write a menu driven java program to perform factorial, Palindrome, Prime number, 4 LO1
Fibonacci series.
Operators, Control Statement

 Write a menu driven java program food orderingand billing in hotel.

 Implement a java program to calculate gross salary & net salary taking the
following data.
Input: empno, empname, basic
2 Process: 6 LO2

DA=70% of basic
HRA=30% of basic
CCA=Rs240/-
PF=10% of basic

48
 RamraoAdik Institute of Technology,Nerul, Navi Mumbai.
Department of Information Technology

PT= Rs100/-

Classes, Objects, Strings,

 Write a program to print the area of a rectangle by creating a class named 'Area'
having two methods. First method named as 'setDim' takes length and breadth of
rectangle as parameters and the second method named as 'getArea' returns the area
of the rectangle. Length and breadth of rectangle are entered through keyboard.
 WAP to demonstrate string functions (Take input using Buffered Reader).
 Java program to add two distance using class. In this java program, we will read
two distances in feet and inches and find their sum, here program is implementing
3 using class and objects concept. 12 LO3
 Create a Teacher class and derive Professor/Associate Professor/Assistant
Professor class from Teacher class. Define appropriate constructor for all the
classes. Also define a method to display information of Teacher. Make necessary
assumptions as required.
 Write a program to calculate addition of two complex numbers using constructor
overloading. (Take input using Scanner).

Inheritance, Interface,Package
 Write a JAVA program to calculate area and volume of rectangle using multilevel
4 inheritance demonstrating method overriding. 12 LO4
 Calculate Simple Interest and Compound Interest using single inheritance.
 To Write a Java program to create an abstract class named Shape that contains an
empty method named numberOfSides ( ).Provide three classes named Trapezoid,
49
 RamraoAdik Institute of Technology,Nerul, Navi Mumbai.
Department of Information Technology

Triangle and Hexagon such that each one of the classes extends the class Shape.
Each one of the classes contains only the method numberOfSides ( ) that shows the
number of sides in the given geometrical figures.
 Create an interface vehicle and classes like bicycle, car, bike etc., having common
functionalities and put all the common functionalities in the interface. Classes like
Bicycle, Bike, car etc. implement all these functionalities in their own class in their
own way.
 WAP to generate a year using random class and check whether it is leap or not
using user defined package.
Exception, Multithreading

 Write a program for exception handling where a user gets captcha mismatch
exception if he enters a wrong captcha string and provides an option to reenter the
captcha.
 Write a program to implement user defined exceptions along with use of finally
keyword.
5 10 LO5
 Write a program to demonstrate try with multiple catch.
 Write a java program to create two threads where one prints capital alphabets from
A-Z and other prints small case alphabets a-z.
 Write a program to print series 1/1! +2/2! N/n! Sum at each step and reverse series
10-1 using multi-threading.

AWT, JavaFX
8 LO6
6  Write a java program to demonstrate the use of AWT components namely buttons,
labels, text boxes, lists/combos, menus with event handling.
50
 RamraoAdik Institute of Technology,Nerul, Navi Mumbai.
Department of Information Technology

 Write a java program to design a calculator using Java Swing components.

 Write a Java program to design a Login Form using JavaFX Controls
 Write a Java program to draw various shapes on Canvas using JavaFX.

Text Books:
1. Herbert Schildt, “Java-The Complete Reference”, Tenth Edition, Oracle Press, Tata McGraw Hill Education.
2. E. Balguruswamy, “Programming with Java A primer”, Fifth edition, Tata McGraw Hill Publication
3. Anita Seth, B.L.Juneja, “Java One Step Ahead”, oxford university press.
Reference Books:
1. D.T. Editorial Services, “Java 8 Programming Black Book”, Dreamtech Press.
2. Learn to Master Java by Star EDU Solutions
3.YashvantKanetkar, “Let Us Java”, 4thEdition, BPB Publications.

Evaluation Scheme:

Term work Evaluation:

Term Work shall consist of write ups of experiments performed in the laboratory based on the above list, but not limited to it. Also,
Term work may include a mini project report if a mini project is assigned as part of the lab.

PracticalEvaluation:
Practical exams will be conducted based on the experiments performed in the laboratory.

51
 RamraoAdik Institute of Technology,Nerul, Navi Mumbai.
Department of Information Technology

Subject Theory Practical Tutorial Theory Practical/Oral Tutorial Total

Subject Name
Code Hrs Hrs Hrs Credit Credit Credits Credits
ITMP301 Mini Project I -- 2 -- -- 1 -- 1

Examination Scheme

Term Practical Oral

Theory Marks Total
Subject Work
Subject Name
Code In-Sem Evaluations
Mid End Sem
Avg. of 2 Exam
IA1 IA2 Sem
IAs
Exam
ITMP301 Mini Project I -- -- -- -- -- 25 -- 25 100

Course Description:

The aim of the mini-project is to enable students to apply knowledge that is gained in the current semester and address a real-world
situation or a problem using Java Language. The students are required to work in a group and demonstrate the solution generated
during the end semester exam to gain the credits.

52
 RamraoAdik Institute of Technology,Nerul, Navi Mumbai.
Department of Information Technology

TeachingScheme
CreditsAssigned
CourseCode (ContactHours)
CourseName
Theory Pract. Tut. Theory Pract. Tut. Total

AUC301 Constitution of India -- 2 -- -- -- -- -- -

EvaluationScheme
Theory Exam
Term
CourseName Internal Assessment Mid End Sem Duration Work Pract. Oral Total
CourseCode
Test1 Test 2 Avg. Sem. Exam (in Hrs.)
Exam
AUC301 Constitution of India -- -- -- -- -- -- -- -- -- --

Course Description:

This course introduces students to the Constitution of India. It begins by providing an overview of the history of the making of
Indian Constitution. It then discusses the preamble and the basic structures of the Constitution. The fundamental rights, duties
and the directive principles of state policy will be discussed thoroughly, followed by a discussion of the legislature, the executive
and the judiciary. Some of the important sections of the Constitution that have influenced the history of India since independence
will also be taken up for study. These include emergency powers and special provisions. There will also be a study of the
important amendments to the Constitution like the 42nd and 44th amendments and other amendments like those related to the
right to education, panchayati raj and so on.
53
 RamraoAdik Institute of Technology,Nerul, Navi Mumbai.
Department of Information Technology

Sr.no Contents Hours

Introduction: Constitution’ meaning of the term, Indian Constitution: Sources and constitutional
1. history, Features: Citizenship, Preamble, Fundamental Rights and Duties, Directive Principles of 02
State Policy

Union Government and its Administration Structure of the Indian Union: Federalism, Centre-
2. State relationship, President: Role, power and position, PM and Council of ministers, Cabinet and 04
Central Secretariat, Lok Sabha, Rajya Sabha

State Government and its Administration Governor: Role and Position, CM and Council of
3. 04
ministers, State Secretariat: Organisation, Structure and Functions

Local Administration District’s Administration head: Role and Importance, Municipalities:

Introduction, Mayor and role of Elected Representative, CEO of Municipal Corporation,
4. Pachayati raj: Introduction, PRI: Zila Pachayat, Elected officials and their roles, CEO Zila 04
Pachayat: Position and role, Block level: Organizational Hierarchy (Different departments),
Village level: Role of Elected and Appointed officials, Importance of grass root democracy

54
 RamraoAdik Institute of Technology,Nerul, Navi Mumbai.
Department of Information Technology

Election Commission Election Commission: Role and Functioning, Chief Election Commissioner
5. and Election Commissioners, State Election Commission: Role and Functioning, Institute and 04
Bodies for the welfare of SC/ST/OBC and women

Reference Books:
1. Laxmikanth, “Indian Polity”, 2017.
2. Subhash Kashyap, “Indian Administration”, 2001.
3. D.D. Basu, “Indian Constitution”, 2008.
4. Avasthi and Maheshwari, “Indian Administration”, 2001

55
 RamraoAdik Institute of Technology,Nerul, Navi Mumbai.
Department of Information Technology

TeachingScheme
CreditsAssigned
CourseCode (ContactHours)
CourseName
Theory Pract. Tut. Theory Pract. Tut. Total
Sustainable Business Strategy
HBSO301 Program (online) -- 2 -- -- -- -- -- -

EvaluationScheme
Theory Exam
Term
CourseName Internal Mid End Sem Duration Work Pract. Oral Total
CourseCode
Assessment
Test1 Test 2 Avg. Sem. Exam (in Hrs.)
Sustainable Business Strategy Exam
HBSO301 Program (online) -- -- -- -- -- -- -- -- -- --

Course Description:
Sustainable Business Strategy provides participants with the knowledge and tools to become a purpose-driven business leader.
This course explores the different business models that companies can use to drive change and explains why purpose-driven
businesses are particularly well positioned to tackle the world’s biggest problems. The student will learn how to influence
management and other key stakeholders on the competitive advantages of being a purpose-driven firm, and how to integrate the
values into the work so that it can help transform firms into catalysts for system level change.

56
 RamraoAdik Institute of Technology,Nerul, Navi Mumbai.
Department of Information Technology

Bachelor of Technology in Information Technology

Semester-IV

Teaching Scheme
Course Code Course Name Credits Assigned
(Contact Hours)
Theory Practical Tutorial Theory Practical Tutorial Total
ITC401 Engineering Mathematics-IV 03 - 01 03 - 01 04
ITC402 Software Engineering 03 - 03 - 03

ITC403 Operating System 03 - 03 - 03

ITC404 Design and Analysis of Algorithms 03 - 03 - 03

Principles of Communication
ITC405 03 - 03 - 03
Systems
ITL401 Software Engineering Lab 02 01 01
ITL402 Operating System Lab 02 01 01
Design and Analysis of Algorithms
ITL403 02 01 01
Lab
Principles of Communication
ITL404 02 01 01
Systems Lab
Skill Based Lab II : Python
ITSL402 - 04 - - 02 - 02
Programming Lab

57
 RamraoAdik Institute of Technology,Nerul, Navi Mumbai.
Department of Information Technology

ITMP402 Mini Project II 04 02 02

AUC401 Sports and Yoga 01 - - - - - -
Entrepreneurship Essential
*HBSO401 program - - - 01 - - 01*
(online)
Total 16 16 01 16 06 01 24

Evaluation Scheme
Semester-IV
Course Exam
Course Name IA1 IA2 AVG MSE ESE TW Pr Or Total
Code Hrs
ITC401 Engineering Mathematics-IV 20 20 20 20 60 02 -- -- 100

ITC402 Software Engineering 20 20 20 20 60 02 -- -- 100

ITC403 Operating System 20 20 20 20 60 02 -- -- 100

Design and Analysis of 20 20 20 20 60 02 -- -- 100
ITC404
Algorithms
Principles of Communication 20 20 20 20 60 02 -- -- 100
ITC405
Systems
ITL401 Software Engineering Lab -- -- -- -- -- -- 25 -- 25 50

ITL402 Operating System Lab -- -- -- -- -- -- 25 25 50

58
 RamraoAdik Institute of Technology,Nerul, Navi Mumbai.
Department of Information Technology

Design and Analysis of

ITL403 -- -- -- -- -- -- 25 25 50
Algorithms Lab
Principles of Communication
ITL404 -- -- -- -- -- -- 25 -- 25 50
Systems Lab
Skill Based Lab II : Python
ITSL402 -- -- -- -- -- -- 25 25 50
Programming Lab
ITMP402 Mini Project II -- -- -- -- -- -- 25 -- 25 50
AUC401 Sports and Yoga
Entrepreneurship Essential
*HBSO401 program
(online)
Total 800

59
 RamraoAdik Institute of Technology,Nerul, Navi Mumbai.
Department of Information Technology

Subject Theory Practical Tutorial Theory Practical/Oral Tutorial Total

Subject Name
Code Hrs Hrs Hrs Credit Credit Credits Credits
Engineering
ITC401
Mathematics- IV 03 -- 01 03 -- 01 04

Examination Scheme
Term
Theory Marks Practical Oral Total
Subject Work
Subject Name In-Sem Evaluations
Code End
Avg. MSE
Test Sem
Test I of 2
II Exam
Tests
Engineering
ITC401
Mathematics- IV 20 20 20 20 60 -- -- -- 100

Prerequisites:

 Concepts of Boolean algebra and set theory.

Course Description:

60
 RamraoAdik Institute of Technology,Nerul, Navi Mumbai.
Department of Information Technology

The course discuss the concepts associated with set theory, propositions, predicate calculus, relations and functions, permutations,
combinations, discrete probability, conditional probability and their applications. It elaborates the concepts and terminologies associated
with graph theory. It describes recurrence relations and the methods to find out their solutions. This course presents the concepts of
groups & rings.

Course Objectives:

1. To discuss the concepts associated with set theory, propositions, predicate calculus, relations and functions, permutations,
combinations, discrete probability, conditional probability and their applications.
2. To discuss the concepts and terminologies associated with graph theory.
3. To describe recurrence relations and the methods to find out their solutions.
4. To present the concepts of groups & rings.

Course Outcomes: At the end of the course learner will able to:

1. Understand propositions and predicate calculus.

2. Perform induction and recursion.
3. Perform permutations and combinations.
4. Apply relations in Problem solving.
5. Use basics of graph theory for design related problems.
6. Solve problems with groups, rings and fields.

61
 RamraoAdik Institute of Technology,Nerul, Navi Mumbai.
Department of Information Technology

Sr.
Module Detailed Syllabus Hours CO Mapping
No.

Propositional logic, equivalences, Predicates and quantifiers,

Logic and
1 Nested quantifiers, Rules of inference, Introduction to proofs, Proof 6 CO1
Proofs
methods.

Algorithms and Integers – Growth of functions, Complexity of

Algorithms,
2 integers and divisions, Primes and GCD, Induction, Recursion, 6 CO2
and Integers
Mathematical Induction, well ordering principle.

Basics, Pigeonhole principle, Extended Pigeonhole Principle,

3 Counting Permutation and Combinations, Binomial Coefficients, inclusion- 6 CO3
exclusion.

Recurrence relations, Divide and Conquer algorithms, Generating

functions
4 Relations 7 CO4
Relations- Relations and their properties, n-array relations,
representations, closure, equivalence relations, partial orders.

Graph theory- Graph representation, terminology, isomorphism,

5 Graph theory Connectivity, Euler and Hamiltonian paths, Shortest paths, Planar 7 CO5
Graphs. Trees.

62
 RamraoAdik Institute of Technology,Nerul, Navi Mumbai.
Department of Information Technology

Algebraic Introduction, structure of algebras, Semigroups, monoids, Groups,

6 7 CO6
structures Rings, Fields, Integral domains

Text Books:

1. Kenneth H. Rosen, Discrete Mathematics and its Applications, McGraw Hill Education (India) Pvt. Ltd. , 2011
2. B. Kolman and R. C. Busby, Discrete Mathematical Structures for Computer Science, Prentice Hall of India , 1999

Reference Books:

1. C. L. Liu, and D. P. Mohapatra, Elements of Discrete Mathematics: A computer-Oriented Approach, McGraw Hill Education
(India) Pvt. Ltd. , 2013
2. N. Deo, Graph Theory with applications to Engineering & Computer Science, Prentice Hall of India , 2006

Evaluation Scheme:
1. In-Semester Assessment:
a. Assessment consists of two Internal Assessments (IA1, IA2) out of which; one should be compulsory class test (on minimum 02
Modules) and the other is a class test / assignment on case studies / course project.
b. Mid Semester Examination (MSE) will be based on 40-50% of the syllabus.

2. End-Semester Examination:
 Question paper will comprise of full syllabus.
 In the question paper, weightage of marks will be proportional to the total number of lecture hours as mentioned in the syllabus.

63
 RamraoAdik Institute of Technology,Nerul, Navi Mumbai.
Department of Information Technology

Subject Subject Name Theory Practical Tutorial Theory Practical/Oral Tutorial Total
Code Hrs Hrs Hrs Credit Credit Credits Credits
ITC402 Software Engineering 03 - - 03 - - 03

Examination Scheme
Term Practical
Theory Marks Total
Subject Work & Oral
Subject Name
Code In-Sem Evaluations
Mid End Sem
Avg. of 2 Exam
IA1 IA2 Sem
IAs
Exam
ITC402 Software Engineering
20 20 20 20 60 -- -- 100

Prerequisites:
 Object Oriented Programming

Course Descriptions:
The purpose of this course is to present software engineering as a body of knowledge with Agile Software Engineering and the underlying
values, principles, and practices. The course will begin with an introduction to software engineering, giving you a definition of this body
of knowledge, as well as a discussion of the main methodologies of software engineering. Students will then learn about the Software

64
 RamraoAdik Institute of Technology,Nerul, Navi Mumbai.
Department of Information Technology

Development Life Cycle (SDLC), basis of Agile Software Development followed by software modeling using Unified Modeling
Language (UML), a standardized general-purpose modeling language used to create visual models of object-oriented software. Students
will go on to learn about five major phases of the SDLC with Agile SDLC model which is combination of iterative and incremental
process models with focus on process adaptability and customer satisfaction by rapid delivery of working software product. They will
also learn about SoftwareQuality & Configuration Management for the purpose of delivering high-quality software that satisfies customer
needs and is within budget.
By the time the course is complete, students will have knowledge of software engineering concepts, principles, and essential processes
of the SDLC and agile software development; students will demonstrate this knowledge by creating UML artifacts for requirements
gathering, analysis as well as design phases using an object-oriented methodology.

Course Objectives:

1. To understand the nature of software development and software life cycle process models, agile software development, SCRUM and
other agile practices.
2. To explain methods of capturing, specifying, visualizing and analyzing software requirements.
3. To develop Awareness of the estimating software attributes that can directly or indirectly characterize software product
4. To describe design objective at each design level
5. To describe software quality assurance and provide checklist and guidelines for software quality.
6. To describe software development risk analysis and management and how to quantify and prioritizes risks and to describe types of
tests and its significance as whole.

Course Outcomes: At the end of the course learner will able to

1. Define various software application domains and remember different process model used in software development.
2. Explain needs for software specifications also they can classify different types of software requirements and their gathering
techniques.

65
 RamraoAdik Institute of Technology,Nerul, Navi Mumbai.
Department of Information Technology

3. Design and analyze the requirements model into the design model and demonstrate use of software and user-interface design
principles.
4. Identify design objective at each design level
5. Distinguish among SCM and SQA and can classify different testing strategies and tactics and compare them.
6. To organize different activities of project as per Risk impact factor and analysis different test needed for project

Module
Detailed Syllabus Hours CO Mapping
No.

Overview of System and Software Development Life Cycle: Nature of Software, Software
Engineering, Software Process, Program vs. Software product, Causes of and solutions for
software crisis, Capability Maturity Model (CMM), Umbrella Activities, Generic view of
1 Process, Need of SDLC, Phases of SDLC, Prescriptive Models: Waterfall Model, 8 CO1
Incremental-RAD Model, Evolutionary Process Model-Prototyping, Spiral and Concurrent
Development Model, Specialized Models: Component based, Aspect Oriented Development
model, Bing Bag model, Agile Methodology, Agility Principal, Scrum and Extreme
Programming, Kanban
Software Specification and Requirement Analysis : Software requirement specification
2 [SRS, URS], Understanding Requirements, Requirement modeling-class based and 4 CO2
Scenario based, Requirements Modeling: Behavior, Patterns, and Web/Mobile Apps

Cost Estimation: Software Project Estimation, DecompositionTechniques, Empirical

3 Estimation Models, Estimation for Object-Oriented Projects, Specialized Estimation 6 CO3
Techniques-Agile Development and Estimation for WebApp Projects.

66
 RamraoAdik Institute of Technology,Nerul, Navi Mumbai.
Department of Information Technology

Software design and User interface Design: Design concepts, The Design Model-
4 Designing Class-Based Components, Component-Level Design for WebApps/Mobile Apps, 8 CO4
User Interface Analysis and Design, Interface Design Steps and analysis.

Software Quality& Configuration Management: Garvin’s Quality Dimensions McCall’s

Quality Factor, 9126 Quality Factors, Targeted Quality Factors, QualityControl, Quality
5 Assurance,SQA Processes and Product Characteristics, Statistical Software Quality 7 CO5
Assurance, Elements of a Configuration Management System, The SCM Process,
Configuration Management for Web and MobileApps.

Risk Management,Testing,Maintenance and Reengineering: Reactive versus Proactive

Risk Strategies, Risk Identification, Risk Projection, Risk Refinement, Risk Mitigation,
Monitoring, and Management, The RMMM Plan, Basic concept of testing, types of testing,
6 test and integration plan, Software Maintenance, Business Process Reengineering- A BPR 6 CO6
Model, A Software Reengineering Process Model, Reverse Engineering-concepts, Forward
Engineering- Client-Server Architectures & Object-Oriented Architectures.

Text Books:
1. Roger S Pressman “Software Engineering : A Practitioner’s Approach” 8th Edition Mcgraw-Hill
2. Ali Behforooz,Frederick J.Hudson,“Software Engineering Fundamentals” Oxford University Press.
Reference Books:
1. Jack T. Marchewka, “Information Technology Project Management” 4th Edition,Wiley India
2. “Software Engineering: A Precise Approach” Pankaj Jalote, Wiley India
3. Ian Sommerville “Software Engineering” 9th edition Pearson Education SBN-13: 978-0- 13- 703515-1, ISBN-10: 0-13-703515-2

67
 RamraoAdik Institute of Technology,Nerul, Navi Mumbai.
Department of Information Technology

Evaluation Scheme:
1. In-Semester Assessment:
a. Assessment consists of two Internal Assessments (IA1, IA2) out of which; one should be compulsory class test (on
minimum 02 Modules) and the other is a class test / assignment on case studies / course project.
b. Mid Semester Examination (MSE) will be based on 40-50% of the syllabus.

2. End-Semester Examination:
 Question paper will comprise of full syllabus.
 In the question paper, weightage of marks will be proportional to the total number of lecture hours as mentioned in the
syllabus.

68
 RamraoAdik Institute of Technology,Nerul, Navi Mumbai.
Department of Information Technology

Subject Subject Name Theory Practical Tutorial Theory Practical/Oral Tutorial Total
Code
Hrs Hrs Hrs Credit Credit Credits Credits

ITC403 Operating 03 -- -- 03 -- - 01
System

Examination Scheme

Term
Theory Marks Practical Oral Total
Work
Subject In-Sem Evaluations
Subject Name
Code
Mid End Sem
Avg. of Exam
IA1 IA2 Sem
2 IAs
Exam

Operating
ITC403 20 20 20 20 60 -- -- -- 100
System

69
 RamraoAdik Institute of Technology,Nerul, Navi Mumbai.
Department of Information Technology

Prerequisites:
• Data structures and Information Representation
• Computer Architecture and Organization

Course description:

The significant interface between the user and the computer system is the operating system. This course introduces the core concepts of
operating systems, such as processes and threads, scheduling, synchronization, memory management, file systems and storage
management. This course gives insights into the components of the operating system and their coordination and synchronization among
each other. The major aim of operating systems is to provide optimum and effective utilization of the hardware and software resources.

Course Objectives:
1. To provide insights of operating system components.
2. To gain knowledge of process coordination and inter process synchronization.
3. To understand the CPU scheduling schemes and essential deadlock characteristics, prevention, detection, avoidance and recovery.
4. To understand the memory management requirements of main and virtual memory.
5. To gain knowledge of secondary storage structure layout and file systems.
6. To study case studies of popularly used operating systems such as Linux and windows.

Course Outcomes:

At the end of the course students will able to:

1. Understand OS operations, services, structure and various system calls.

70
 RamraoAdik Institute of Technology,Nerul, Navi Mumbai.
Department of Information Technology

2. Evaluate the process scheduling and inter process communication with the help of classical synchronization problems.
3. Evaluate CPU scheduling algorithms and the deadlock handling by operating system.
4. Analyze the main memory and virtual memory allocation and management techniques.
5. Analyze the functionality of file management services and secondary storage management by operating system.
6. Compare the operating system design and implementation in Unix/Linux, windows and mobile operating system.

Sr.
Module Detailed Syllabus Hours CO Mapping
No

1 Operating System Introduction: Operating System operations and services, User and 4 CO1
Overview OS interface, System calls and it types, System Programs,
Operating system design and implementation, Operating system
Structure.

71
 RamraoAdik Institute of Technology,Nerul, Navi Mumbai.
Department of Information Technology

2 Process Process Management: Process concept and states, Process 9 CO2

Management and Scheduling, Operations on Process, Interprocess Communication,
Process and Threads: Overview and Multithreaded models; Process
Synchronization synchronization- The Critical-Section Problem, Peterson’s
Solution, Synchronization Hardware, Mutex Locks, Semaphores.
Classic Synchronization Problems-The Readers –Writers Problem,
The Dining-Philosophers Problem, Monitors.

3 CPU Scheduling CPU Scheduling: Scheduling Criteria, Types of Scheduling 6 CO3

and Deadlock algorithms- Preemptive and non-preemptive, Thread Scheduling;
Deadlocks: Deadlock Characterization, Methods for handling
deadlocks, Deadlock Prevention, Deadlock Detection and
Avoidance, Recovery from deadlocks.

72
 RamraoAdik Institute of Technology,Nerul, Navi Mumbai.
Department of Information Technology

4 Memory Main Memory: Memory management requirements, swapping and 8 CO4

Management partitioning, Contiguous memory allocation, paging and
segmentation, Structure of page table; Virtual memory: Hardware
and control structures, Demand paging, Copy-on-write, page
placement and replacement policies; allocation of frames,
thrashing; memory mapped files.

5 File Management Storage management: Disk Structure, attachment and scheduling, 8 CO5
Disk management, swap space management, RAID, iSCSI and
volumes, Stable Storage implementation; File systems: File
organization and access, Fundamental concepts, Directory and disk
structure, File system structure, mounting sharing and
implementation. Directory implementation and free space
management.

6 Case Study Architecture and File system: Unix/ Linux, Windows XP, Mobile 04 CO6
OS: Android and iOS

73
 RamraoAdik Institute of Technology,Nerul, Navi Mumbai.
Department of Information Technology

Text Books:
1. Silberschatz, P.B. Galvin & G. Gagne, Operating system concepts, John Wiley, 10th Edition, 2019
2. W. Stallings, Operating systems, Pearson Education, 4th edition, 2018

Reference Books:

1. Andrew S Tanenbaum, Modern Operating systems, Pearson Education, 4th edition, 2016

2. Sumitabha Das, UNIX Concepts and Applications, Fourth edition, Tata McGraw Hill, 2017

3. Maurice J Bach, The Design of Unix Operating System, Pearson, 2015,

4. Jonathan Levin, Android Internals::Power User's View, Technologeeks, 2015.

5. Jonathan Levin, Mac OS X and IOS Internals, Wiley, 2012.

Evaluation Scheme:
1. In-Semester Assessment:
c. Assessment consists of two Internal Assessments (IA1, IA2) out of which; one should be compulsory class test (on
minimum 02 Modules) and the other is a class test / assignment on case studies / course project.
d. Mid Semester Examination (MSE) will be based on 40-50% of the syllabus.

2. End-Semester Examination:
 Question paper will comprise of full syllabus.
 In the question paper, weightage of marks will be proportional to the total number of lecture hours as mentioned in the
syllabus.

74
 RamraoAdik Institute of Technology,Nerul, Navi Mumbai.
Department of Information Technology

Subject Theory Practical Tutorial Theory Practical/Oral Tutorial Total

Subject Name
Code Hrs Hrs Hrs Credit Credit Credits Credits
Design and
ITC404 Analysis of 03 -- -- 03 -- -- 03
Algorithms

Examination Scheme

Term
Subject Theory Marks Practical Oral Total
Subject Name Work
Code
In-Sem Evaluations End
Avg. of 2 Mid Sem
IA1 IA2 Sem
IAs Exam
Exam

Design and
ITC404 Analysis of 20 20 20 20 60 -- -- -- 100
Algorithms

Prerequisites:

 Data Structures and Information Representation

75
 RamraoAdik Institute of Technology,Nerul, Navi Mumbai.
Department of Information Technology

Course Description:
Algorithms are the soul of computing time. This course introduces basic methods for the design and analysis of efficient algorithms
emphasizing methods useful in practice. Different algorithms for a given computational task are given and their relative merits evaluated
based on performance measures. The following important computational problems will be discussed: sorting, searching, elements of
dynamic programming and greedy algorithms, graph algorithms (shortest path, spanning trees, and tree traversals), solution space search
based algorithms. The algorithm analysis includes computational models, best/average/worst case analysis, and computational
complexity (including lower bounds and NP-completeness).

Course Objectives:
1. To understand and apply the algorithm analysis techniques.
2. To critically analyze the efficiency of alternative algorithmic solutions for the same problem
3. To understand different algorithm design techniques.
4. To understand the limitations of Algorithmic power.
5. To analyze performance of algorithms.
6. To understand typical methods to solve problems that are not solvable using traditional techniques.

Course Outcomes:
At the end of the course students will be able to:

1. Analyze the time and space complexity of algorithms.

2. Apply the divide-and-conquer technique to solve the problems.
3. Apply the greedy programming technique to solve the problems.
4. Apply the dynamic programming technique to solve the problems
5. Apply the Solution-space search based methods to solve the problems
6. Analyze problems and apply techniques to solve problems that are not covered by classical algorithm techniques studied earlier.

76
 RamraoAdik Institute of Technology,Nerul, Navi Mumbai.
Department of Information Technology

Sr. No. Module Detailed Syllabus Hours CO Mapping

Notion of an Algorithm – Fundamentals of Algorithmic- Performance

Analysis-Space and Time Complexity-Asymptotic notations and their
properties :Big-Oh notation (O)-Omega notation (Ω)- Theta notation
1 Introduction 6 CO1
(Θ). Recurrences- The substitution Method- Recursive tree Method-
Masters method. Randomized Algorithms- Mathematical analysis for
Recursive and Non-recursive algorithms – Visualization

Brute Force And Fundamentals of Divide and Conquer approach using Binary search,
Divide-and- sequential search , Quick sort, and Merge sort, Strassen’s matrix
2 Conquer multiplication; and Closest pair Decrease and Conquer: Insertion Sort, 8 CO2
Depth First Search, Breadth First Search, Brute-Force String
Matching,

Greedy Greedy Technique – Prim‘s algorithm and Kruskal’s Algorithm,

3 Technique fractional Knapsack problem, Job sequencing with deadlines, Optimal 5 CO3
Merge pattern, Huffman Trees.

Dynamic Introduction to Dynamic programming – Principle of optimality – Coin

4 6 CO4
Programming changing problem, Computing a Binomial Coefficient - Floyd‘s

77
 RamraoAdik Institute of Technology,Nerul, Navi Mumbai.
Department of Information Technology

Warshal algorithm – Multistage graph - Matrix chain multiplication –

Optimal Binary Search Trees – 0/1 Knapsack Problem.

Solution-space Max flow problem. Backtracking – n-Queen problem, – Hamiltonian

search based Circuit Problem, Subset Sum Problem. Branch and Bound – LIFO
5 algorithm 8 CO5
Search and FIFO search – Travelling Salesman Problem, Knapsack
Problem.

Church-turing hypothesis. Lower–Bound Arguments. Machine

Advanced models. P, NP, NP- Complete and NP Hard Problems. Non-
6 Techniques. deterministic algorithms - Approximation Algorithms for NP-Hard 6 CO6
Problems -- travelling salesman problem. Introduction to parallel
algorithms.

Text Books:
1. Anany Levitin, ―Introduction to the Design and Analysis of Algorithms‖, Third Edition, Pearson Education.
2. Ellis Horowitz, Sartaj Sahni and Sanguthevar Rajasekaran, Computer Algorithms/ C++, Second Edition, Universities Press,

Reference Books:
1. Thomas H.Cormen, Charles E.Leiserson, Ronald L. Rivest and Clifford Stein, “Introduction to Algorithms”, Third Edition, PHI
Learning Private Limited.
2. Alfred V. Aho, John E. Hopcroft and Jeffrey D. Ullman, “Data Structures and Algorithms”, Pearson Education

78
 RamraoAdik Institute of Technology,Nerul, Navi Mumbai.
Department of Information Technology

3. Donald E. Knuth, “The Art of Computer Programming”, Volumes 1& 3 Pearson Education, 2009. Steven S. Skiena, “The
Algorithm Design Manual”, Second Edition.
4. Harsh Bhasin, ―Algorithms Design and Analysis‖, Oxford University press.
5. S. Sridhar, ―Design and Analysis of Algorithms‖, Oxford university press.

Evaluation Scheme:

1. In-Semester Assessment:
a. Assessment consists of two Internal Assessments (IA1, IA2) out of which; one should be compulsory class test (on minimum
02 Modules) and the other is a class test / assignment on case studies / course project.
b. Mid Semester Examination (MSE) will be based on 40-50% of the syllabus.

2. End-Semester Examination:
 Question paper will comprise of full syllabus.
 In the question paper, weightage of marks will be proportional to the total number of lecture hours as mentioned in the syllabus.

79
 RamraoAdik Institute of Technology,Nerul, Navi Mumbai.
Department of Information Technology

Subject Theory Practical Tutorial Theory Practical/Oral Tutorial Total

Subject Name
Code Hrs Hrs Hrs Credit Credit Credits Credits
ITC405 Principles of 03 -- -- 03 -- -- 03
Communication
Systems

Examination Scheme
Term
Theory Marks Practical Oral Total
Work
Subject
Subject Name In-Sem Evaluations
Code
Mid End
Avg.
Sem Sem
IA1 IA2 of 2
Exa Exam
IAs m
ITC405 Principles of
Communication Systems 20 20 20 20 60 -- -- -- 100

Prerequisites:

80
 RamraoAdik Institute of Technology,Nerul, Navi Mumbai.
Department of Information Technology

 ITE304 Basic Electronics and Logic Design

Course Description:
Principles of Communication Systems introduces the student to the underlying concepts relevant for physical communication of bits
across devices. In this course, a more holistic approach of the various communication methods are described. The course not only
talks about how data, either analog or digital, can be communicated; but also shows how information can be communicated while
avoiding or accommodating for losses. The fundamental theoretical models for data are reiterated in this course.
This syllabus gives brief concepts about different signal modulation and demodulation techniques and also provides an idea about
communication system impairments with an example for each one. The syllabus also provides an introduction to data communication
with simple ideas of data processing and basic ideas of information theory and coding.

Course Objectives:
1. To understand the concept of noise and Fourier transform for designing and analyzing communication systems.
2. To acquire the knowledge of different modulation techniques such as AM, FM and study the block diagram of transmitter and
receiver.
3. To study the basic principles and techniques used digital communications.
4. To study the Sampling theorem and Pulse Analog and Digital Modulation techniques.
5. To learn the concepts of Digital modulation techniques such as PCM, DM, ADM and multiplexing techniques.
6. To understand the concept of Information theory and coding.

Course Outcomes: At the end of the course learner will able to

1. Understand the concept of noise and Fourier transform for designing and analyzing communication systems.
2. Understand modulation techniques used in analog systems.
3. Understand the basic principles and techniques used in digital communications.
4. Apply the concepts of Pulse Analog and Digital Modulation techniques.
5. Apply the concepts of Digital modulation techniques.

81
 RamraoAdik Institute of Technology,Nerul, Navi Mumbai.
Department of Information Technology

6. Understand the concept of Information theory and coding.

CO
Sr. No. Module Detailed Content Hours
Mapping
Frequency spectrum of electromagnetic waves, Their
properties,
1 Basics Properties of Fourier transform, Convolution in time and 7 CO1
frequency domain,
Sampling theorem, Noise: types, Sources.
Mechanism of amplitude modulation and detection, SSB,
2 Analog Systems DSB, Various techniques of generation and detection of FM. 6 CO2
Pulse Modulation
Digital communication systems, Line coding, polar signaling,
Digital Data
3 pulse shaping, scrambling, digital receivers and regenerative 6 CO3
Transmission
repeaters.
Sampling Theorem, PAM, PWM, PCM and PPM systems,
4 Pulse Modulation 6 CO4
quantization and noise, Delta modulation.
Digital Carrier
ASK, FSK, PSK and DPSK systems, M-ary communication
5 Modulation and 6 CO5
system.
Transmission
Information Information theory: Discrete message and information
6 8 CO6
theory and coding content, Source coding, channel capacity, Error control

82
 RamraoAdik Institute of Technology,Nerul, Navi Mumbai.
Department of Information Technology

and Error-Control coding: Hamming distance, block codes, Cyclic Codes, burst
Codes error correction, Convolution Codes.

Text Books:
1. Principle of Communication System by H. Taub, DL Schilling & G Saha, 4th edn McGrawHill India
2. Modern Digital and Analog Communication System by B. P. Lathi &Zhi Ding, Oxford University Press, Oxford. 2010

Reference Books:
1. Communication Systems by A. Bruce Carlson, Paul Crilly, Janet Rutledge; McGrawHill Science, 2001.
2. Communication System by B. P. Lathi.
3. Digital Communication by John G. Proakis & Dimitris K. Manolakis, Pearson Education 2014
4. Communication Electronics by Kennedy.
5. R.P. Singh, S.D. Sapre: “Communication Systems: Analog and Digital”, McGraw Hill Publications

Evaluation Scheme:
1. In-Semester Assessment:
a. Assessment consists of two Internal Assessments (IA1, IA2) out of which; one should be compulsory class test (on minimum
02 Modules) and the other is a class test / assignment on case studies / course project.
b. Mid Semester Examination (MSE) will be based on 40-50% of the syllabus.

2. End-Semester Examination:
 Question paper will comprise of full syllabus.

83
 RamraoAdik Institute of Technology,Nerul, Navi Mumbai.
Department of Information Technology

 In the question paper, weightage of marks will be proportional to the total number of lecture hours as mentioned in the
syllabus.

84
 RamraoAdik Institute of Technology,Nerul, Navi Mumbai.
Department of Information Technology

Subject Subject Name Theory Practical Tutorial Theory Practical/Oral Tutorial Total
Code Hrs Hrs Hrs Credit Credit Credits Credits
ITL401 Software Engineering - 2 - - 1 - 01
Lab

Examination Scheme

Term Practical Oral

Theory Marks Total
Subject Work
Subject Name
Code In-Sem Evaluations
End
Mid Sem
Avg. of
IA1 IA2 Sem Exam
2 IAs
Exam
Software Engineering
ITL401 -- -- -- -- -- 25 -- 25 50
Lab

Prerequisites:
 Object Oriented Concept, Java programming language

Course Descriptions:
The main objective of the Software Engineering Laboratory is to make students understand and use different tools needed in Process of
software development. The Course covers fundamental of UML design, the steps to create all types of diagram. In details, the course
covers Project risk analysis plan. This course also includes the study of cost estimation and its configuration management. The course is

85
 RamraoAdik Institute of Technology,Nerul, Navi Mumbai.
Department of Information Technology

helpful to the students to also understand significance of agile software development with testing of software and its importance in real
life Projects.

Lab Objectives:

1. Learn basic concepts of UML.

2. Master the vocabulary, rules, and idioms of the UML and learn how to model it effectively.
3. Understand how to apply the UML to solve a number of common modeling problems.
4. Model the systems, from concept to executable artifact, using object-oriented techniques.
5. Apply the knowledge of Software engineering and project management.
6. Understand the software testing and its implementation at each level.

Lab Outcomes: At the end of the course learner will able to

1. Create all Models with UML.

2. Creating Structural Model.
3. Creating Behavioral Model.
4. Creating Architectural Modeling.
5. Analyzing and estimating about schedule and cost for project development.
6. Designing project testing methods.

Software requirement:IBM Rational Rose Modeler, Dia, StarUML Orange Scrum, Xampp, GitHub

86
 RamraoAdik Institute of Technology,Nerul, Navi Mumbai.
Department of Information Technology

Experiment
Detailed Contents Hours LO Mapping
No.

Case study as a mini project work which is to be conducted by a group of three students.
Each group will be associated with a subject Incharge/ mini project mentor. The group
1 2 LO1
should meet with the concerned faculty during Laboratory hours and the progress of work
discussed must be documented.

Identify Object oriented Technologies, Basic expression of Classes, Attributes and

2 2 LO2
operations.

Develop a Classes, Relationships, Class Diagrams, Advanced Classes and Relationship,

3 4 LO3
Object Diagrams for above case study.

Define Use case Diagrams, Activity Diagrams, Interaction Diagrams, and State Chart
4 4 LO3
Diagrams for above case study.

Define Components, Deployment, Collaborations, Component Diagrams, Deployment

5 4 LO4
Diagrams for above case study

6 Define SRS, WBS, Network Diagram, Gantt Chart, Cost Estimation Techniques 4 LO5

7 Demonstration it using Scrum Tool 2 LO5

8 Apply different testing methods studied in syllabus for your project. 4 LO6

87
 RamraoAdik Institute of Technology,Nerul, Navi Mumbai.
Department of Information Technology

Text Books:
1. “The Unified Modeling Language User Guide” by Grady Booch, James Rumbaugh, Ivar Jacobson, Pearson Publication, ISBN 978-
81-7758-372-4

Reference Books:
1. “An Introduction to Object-Oriented Analysis: Objects and UML in plain English” by Davis William Brown, Wiley, Second
Edition.
2. “Fundamentals of Object-Oriented Design in UML”, Meilir Page-Jones, Pearson Education.
3. UML Basics— an Introduction to the Unified Modeling Language – IBM “www.ibm.com › Learn › Rational” “Database
Systems, Concepts, Design and Applications” by S.K.Singh, Pearson Education.

Evaluation Scheme:

Term work Evaluation:

Term Work shall consist of write ups of experiments performed in the laboratory based on the above list, but not limited to it. Also, Term
work will include a mini project report is assigned as part of the lab.

Practical and Oral Evaluation:

Oral & Practical exams will be conducted based on the experiments performed in the laboratory.

88
 RamraoAdik Institute of Technology,Nerul, Navi Mumbai.
Department of Information Technology

Subject Subject Name Theory Practical Tutorial Theory Practical/Oral Tutorial Total
Code Hrs Hrs Hrs Credit Credit Credits Credits

ITL402 Operating -- 2 -- 1 -- 1
System Lab

Examination Scheme

Oral
Term Practical
Theory Marks Total
Work
Subject Subject
Code Name In-Sem Evaluations
End
Mid Sem
Avg. of 2 Exam
IA1 IA2 Sem
IAs
Exam

Operating
ITL402 System -- -- -- -- -- 25 25 -- 50
Lab

89
 RamraoAdik Institute of Technology,Nerul, Navi Mumbai.
Department of Information Technology

Prerequisites:

•C Programming language
•Data Structure

Lab Description

The objective of the operating system lab is to introduce in-depth understanding of operating system components, file system, functions
and Kernel configuration. To make the students learn basic and advanced commands, shell scripting and shell programming. To enable
the students to get insights into handling operational complexities of operating system resource management using algorithms and
techniques.The UNIX kernel internal working and the environment training of these tools will be useful to develop rigorous applications
in the engineering domain.

Lab Objectives: Student will learn

1. To understand basic commands for handling file systems under Unix/Linux.
2. To investigate the concept of boot process of Unix/Linux and install operating system.
3. To examine the process management and synchronization algorithms.
4. To understand and examine deadlocks and thread management.
5. The understand various disk, CPU scheduling Algorithms and memory management techniques
6. To demonstrate the use of System calls and Pattern matching utilities to develop shell scripts programs.

Lab Outcomes (LO): At the end of the course learner will able

1. To implement basic file System commands under Unix/Linux.

90
 RamraoAdik Institute of Technology,Nerul, Navi Mumbai.
Department of Information Technology

2. To install an Operating system and examine, debug errors while loading the operating system.

3. To implement the classic process management and synchronization algorithms

4. To implement deadlock and thread management techniques.

5. To implement different disk scheduling, CPU scheduling algorithms and memory management techniques.

6. To implement the shell scripts using System calls and pattern Matching Utilities.

Software requirement: Linux/Windows OS, C/C++/JAVA

Sr. Detailed Syllabus Hours LO Mapping

No.

1 Exploring basic commands for handling File systems under Unix/Linux. By using shell 2 LO1
scripts.

( creating groups , chown , chmod , directory uname,tty,diff, umask )

91
 RamraoAdik Institute of Technology,Nerul, Navi Mumbai.
Department of Information Technology

2 Exploring the boot process of Unix/Linux and implementing practical on it (for ex MBR, 4 LO2
passing different parameters to kernel, do different activity while booting and power-off).

Installation of an operating system (Windows/Linux)

3 Write a program to prevent destructive update of files by locking as follows: Suppose the inode 2 LO3
contains a new permission setting such that it allows only one process at a time to open the
file for writing, but many processes can open the file for reading.

Implement process synchronization with the help of classic process synchronization

4 problems 2 LO3
a) Reader- Writer Problem
b) Dining Philosopher Problem

5 Write a multithreaded program for preventing race conditions and deadlock avoidance for the 2 LO4
banker’s algorithm as follows. Several customers’ request and release resources from the bank.
The banker will grant a request only if it leaves the system in a safe state. A request that leaves
the system in an unsafe state will be denied.

6 Creation and termination of task and kernel threads 2 LO4

92
 RamraoAdik Institute of Technology,Nerul, Navi Mumbai.
Department of Information Technology

7 Implement CPU scheduling algorithms ( FCFS , SJF , SRTN, RR , Multilevel Queue 2 LO5
scheduling )

8 Write a program to simulate disk scheduling algorithms a) FCFS b) SCAN c) C-SCAN 2 LO5

9 Assume that a system has a 32-bit virtual address with a 4-KB page size. Write a C program 2 LO5
that is passed a virtual address (in decimal) on the command line and have it output the page
number and offset for the given address. As an example, your program would run as follows:

./a.out 19986

Your program would output:

The address 19986 contains: page number = 4

offset = 3602

Writing this program will require using the appropriate data type to store 32 bits. We
encourage you to use unsigned data types as well.

93
 RamraoAdik Institute of Technology,Nerul, Navi Mumbai.
Department of Information Technology

10 Implementation of System calls like printing a file, display file using linux internals. 2 LO6

11 To demonstrate the basic shell scripting techniques using programs such as pattern matching 2 LO6
utilities.

12 Develop a Mini project for any system utility or application using scripting technology 2 LO6

Reference Book:

1)Silberschatz, P.B. Galvin & G. Gagne, Operating system concepts, John Wiley, 10th Edition, 2019.

2) Maurice J. Bach, “The Design of Unix Operating System”, Pearson, 2015

3) Rachel Klee, Douglas A. Host, Richard R. Rosinski, Kenneth H. Rosen. “UNIX: The Complete Reference”, Second Edition,
McGraw-Hill Education.

94
 RamraoAdik Institute of Technology,Nerul, Navi Mumbai.
Department of Information Technology

Evaluation Scheme:

Term work Evaluation:

Term Work shall consist of write ups of experiments performed in the laboratory based on the above list, but not limited to it. Also, Term
work may include a mini project report if a mini project is assigned as part of the lab.

Practical and Oral Evaluation:

Oral & Practical exams will be conducted based on the experiments performed in the laboratory.

95
 RamraoAdik Institute of Technology,Nerul, Navi Mumbai.
Department of Information Technology

Theory Practical Tutorial Theory Practical/Oral Tutorial Total

Subject Code Subject Name
Hrs Hrs Hrs Credit Credit Credits Credits
ITL403 Design and
Analysis of -- 02 - -- 01 -- 01
Algorithms

Examination Scheme
Term
Theory Marks Practical Oral Total
Work
Subject
Subject Name In-Sem Evaluations
Code End
Mid
Avg. of Sem
IA1 IA2 Sem
2 IAs Exam
Exam
ITL403 Design and
Analysis of -- -- -- -- -- 25 25 -- 50
AlgorithmsLab

Lab Description:
This laboratory should enable the students to learn how to analyze a problem and design the solution for the problem. The objective of
this lab is to design and implement efficient algorithms for a specified application and strengthen the ability to identify and apply the
suitable algorithm for the given real world problem.

96
 RamraoAdik Institute of Technology,Nerul, Navi Mumbai.
Department of Information Technology

Lab Objectives:
1. To understand and apply the algorithm analysis techniques.
2. To critically analyze the efficiency of alternative algorithmic solutions for the same problem
3. To understand different algorithm design techniques.
4. To understand the limitations of Algorithmic power.
5. To analyze performance of algorithms.

Lab Outcomes:
At the end of the lab sessions, students will able to:
1. Analyze the time and space complexity of algorithms.
2. Implement the divide-and-conquer technique to solve the problems.
3. Implement the greedy programming technique to solve the problems
4. Implement the dynamic programming technique to solve the problems.
5. Apply the Iterative improvement method to solve the problems
6. Analyze problems and apply techniques to solve problems that are not covered by classical algorithm techniques studied earlier.

Hardware & Software Requirements:

Hardware Requirement: Software requirement:

PC i3 processor and above Turbo/Borland C complier

97
 RamraoAdik Institute of Technology,Nerul, Navi Mumbai.
Department of Information Technology

Sr. No. Module Detailed Content Hours LO Mapping

1. Write a program to Implement Recursive Linear

Search and determine the time taken to search an
1 Introduction element 02 LO1
2. Write a program to Implement Binary search and
determine the time taken to search an element
1. Write a program to implement quick and merge sort
Brute Force And along with analysis.
2 Divide-and-Conquer 2. Write a program for the closest pair of points. 06 LO2
3. Write a program to implement Strassen’s matrix
multiplication

1. Write a program to implement prim’s and Kruskal’s

algorithm.
2. Write a program to implement job sequencing with
3 Greedy Technique 06 LO3
a deadline.
3. Write a program to implement Huffman trees using
greedy techniques.

Dynamic Programming 1. Write a program to implement Floyd’s Warshal

algorithm
4 04 LO4
2. Write a program to implement a 0/1 knapsack
problem using dynamic approach.

98
 RamraoAdik Institute of Technology,Nerul, Navi Mumbai.
Department of Information Technology

1. Write a program to Implement Ford-Fulkerson

Iterative algorithm for maximum Flow Problem.
5 Improvement 2. Write a program to implement N Queen problem 06 LO5
using backtracking approach.
3. Write a program to implement Travelling salesman
problem using backtracking approach.
Coping With The
Limitations Of
6 Algorithm Power 1. Solve tic-tac-toe with back-tracking and branch and 02 LO6
bound.

Text Books:
1. Anany Levitin, ―Introduction to the Design and Analysis of Algorithms‖, Third Edition, Pearson Education.
2. Ellis Horowitz, Sartaj Sahni and Sanguthevar Rajasekaran, Computer Algorithms/ C++, Second Edition, Universities Press.

Reference Books:
1. Thomas H.Cormen, Charles E.Leiserson, Ronald L. Rivest and Clifford Stein, “Introduction to Algorithms”, Third Edition, PHI
Learning Private Limited.
2. Alfred V. Aho, John E. Hopcroft and Jeffrey D. Ullman, “Data Structures and Algorithms”, Pearson Education.
3. Donald E. Knuth, “The Art of Computer Programming”, Volumes 1& 3 Pearson Education, 2009. Steven S. Skiena, “The
Algorithm Design Manual”, Second Edition, Springer.
4. Harsh Bhasin, ―Algorithms Design and Analysis‖, Oxford University press.
5. S. Sridhar, ―Design and Analysis of Algorithms‖, Oxford university press.

99
 RamraoAdik Institute of Technology,Nerul, Navi Mumbai.
Department of Information Technology

Evaluation Scheme:

Term work Evaluation:

Term Work shall consist of write ups of experiments performed in the laboratory based on the above list, but not limited to it. Also, Term
work may include a mini project report if a mini project is assigned as part of the lab.

Practical and Oral Evaluation:

Oral & Practical exams will be conducted based on the experiments performed in the laboratory.

100
 RamraoAdik Institute of Technology,Nerul, Navi Mumbai.
Department of Information Technology

Subject Code Subject Theory Practical Tutorial Theory Practical/Oral Tutorial Total
Name
Hrs Hrs Hrs Credit Credit Credits Credits

ITL404 Principles -- 2 -- 1 -- 1
of
Communica
tion
Systems
Lab
Examination Scheme

Term Practical Oral

Theory Marks Total
Subject Work
Subject Code
Name In-Sem Evaluations
Mid End Sem
Avg. of 2 Exam
IA1 IA2 Sem
IAs
Exam
Principles
of --
Communic
ITL404 -- -- -- -- 25 -- 25 50
ation
Systems
Lab

101
 RamraoAdik Institute of Technology,Nerul, Navi Mumbai.
Department of Information Technology

Prerequisites:

• Concepts of Logic Design

Lab Description:

The main objective of the proposed Principles of Communication Systems Lab is to gain familiarity with the concepts they come across
in the course ITC404 Information Communication Systems. The Experiments in the Lab are focused on providing a hands-on experience
for the various topics related to communication. This lab introduces students to the basics of programming using SCILAB. Labs have
been designed to familiarize students with Analog and Digital Communication through the implementation of various modulation
techniques and information theory using SCILAB.

Lab Objectives:

1. To understand the concept of noise and Fourier transform for designing and analyzing communication systems.
2. To acquire the knowledge of different modulation techniques such as AM, FM and study the block diagram of transmitter and
receiver.
3. To study the basic principles and techniques used digital communications.
4. To study the Sampling theorem and Pulse Analog and Digital Modulation techniques.
5. To learn the concepts of Digital modulation techniques such as PCM, DM, ADM and multiplexing techniques.
6. To understand the concept of Information theory and coding.

102
 RamraoAdik Institute of Technology,Nerul, Navi Mumbai.
Department of Information Technology

Lab Outcomes (LO):

At the end of the course students will able to:

1. Understand the concept of noise and Fourier transform for designing and analyzing communication systems.
2. Understand modulation techniques used in analog systems.
3. Understand the basic principles and techniques used in digital communications.
4. Implement basic Pulse Analog and Digital Modulation techniques.
5. Implement basic Digital modulation techniques.
6. Implement simple error control coding.

Hardware requirement: none.

Software requirement: SCILAB tool

Sr. No. Module Detailed Contents Hours LO

Mapping

1 Basics a. Introduction to SCILAB 6 LO1

b. To generate and visualize signals using SCILAB
c. To find convolution of signals

103
 RamraoAdik Institute of Technology,Nerul, Navi Mumbai.
Department of Information Technology

2 Analog Systems a. To implement Amplitude Modulation using SSB 4 LO2

b. To implement Amplitude Modulation using DSB

3 a. To simulate Line coding 2 LO3

Digital Data Transmission

4 a. To implement sampling theorem 6 LO4

Pulse Modulation b. To implement Pulse Code Modulation
c. To implement Pulse modulation techniques

5 Digital Carrier Modulation a. To implement digital carrier modulation 6 LO5

and Transmission techniques

104
 RamraoAdik Institute of Technology,Nerul, Navi Mumbai.
Department of Information Technology

6 Information theory and 2 LO6

coding and Error-Control a. To implement Huffman coding
Codes

Text Books:
1. Principle of Communication System by H. Taub, DL Schilling & G Saha, 4th edn McGrawHill India
2. Modern Digital and Analog Communication System by B. P. Lathi & Zhi Ding, Oxford University Press, Oxford. 2010

Reference Books:
1. Communication Systems by A. Bruce Carlson, Paul Crilly, Janet Rutledge; McGrawHill Science, 2001.
2. Communication System by B. P. Lathi.
3. Digital Communication by John G. Proakis & Dimitris K. Manolakis, Pearson Education 2014
4. Communication Electronics by Kennedy.
5. R.P. Singh, S.D. Sapre: “Communication Systems: Analog and Digital”, McGraw Hill Publications

105
 RamraoAdik Institute of Technology,Nerul, Navi Mumbai.
Department of Information Technology

Term Work:

Term Work shall consist of at least 10 to 12 practical’s based on the above list. Also Term work Journal must include at
least 2 assignments.

Term Work Marks: 25 Marks (Total marks) = 15 Marks (Experiment) + 5 Marks (Assignments) + 5 Marks Attendance)

Oral & Practical Exam: An Oral & Practical exam will be held based on the above syllabus.

106
 RamraoAdik Institute of Technology,Nerul, Navi Mumbai.
Department of Information Technology

Theory Practical Tutorial Theory Practical/Oral Tutorial Total

Subject Code Subject Name
Hrs Hrs Hrs Credit Credit Credits Credits
ITSL402 Skill Based Lab II -- 04 - -- 02 - 02
: Python
Programming
Lab

Examination Scheme

Term Practical Oral

Theory Marks Total
Subject Work
Subject Name
Code In-Sem Evaluations
End
Avg. Mid Sem
IA1 IA2 of 2 Sem Exam
IAs Exam
ITSL402 Skill Based Lab II : -- -- -- -- -- 25 25 -- 50
Python
Programming Lab

Prerequisites:

 ITE 205 Structured Programming Language

107
 RamraoAdik Institute of Technology,Nerul, Navi Mumbai.
Department of Information Technology

Lab Description
This course is an introduction to both fundamental programming concepts and the Python programming language. It is a widely used
general-purpose, high level programming language. It was designed with an emphasis on code readability, and its syntax allows
programmers to express their concepts in fewer lines of code. It lets you work quickly and integrate systems more efficiently. This course
covers Basics of Python programming, Decision Making and Functions, Object Oriented Programming, Modules, Packages, Exception
Handling, Files Handling, GUI Programming, Databases operations and Client/Server Programming.

Lab Objectives:
The course will help the students to get familiar with:

1. Basics of Python programming

2. Data Structures and Functions in Python
3. Object Oriented Programming using Python
4. Files Handling in Python
5. GUI Programming and Databases operations in Python
6. Network Programming in Python

Lab Outcomes (LO):

Upon Completion of the course the learner should be able to:

1. Describe the Data Types, Numbers, Math functions, Strings and Strings Operation with different Decision Making and Looping
Statements in Python
2. Express different Decision Making statements and Functions
3. Interpret Object oriented programming in Python
4. Understand and summarize different File handling operations
5. Explain how to design GUI Applications in Python and evaluate different database operations
6. Design and develop Client Server network applications using Python
108
 RamraoAdik Institute of Technology,Nerul, Navi Mumbai.
Department of Information Technology

Hardware & Software Requirements:

Hardware Requirement: Software requirement:

PC With following Configuration 1. Windows or Linux Desktop OS
1. Intel Dual core Processor or higher 2. Python 3.6 or higher
2. Minimum 2 GB RAM 3. Notepad ++
3. Minimum 40 GB Hard disk 4.Python IDEs like IDLE, Pycharm, Pydev, Netbeans or
4. Network interface card Eclipse
5. Mysql

Sr. No. Detailed Contents Hours LO Mapping

Python Datatypes and flow controls

 Write python programs to understand basic data types, operators, Expressions, and
1 Input/Output statements. 08 LO1
 Write python program to implement control flow statements
 Write a python program to understand various built-in string methods.
Python Data structure and Functions
 Write python programs to understand List, Tuple and its manipulation
2  Write python programs to understand Set, Dictionary and its manipulation 10 LO2
 Write python programs to understand array operations on one-dimensional and
multi-dimensional arrays.
 Write a python program to implement user defined functions.

109
 RamraoAdik Institute of Technology,Nerul, Navi Mumbai.
Department of Information Technology

Object oriented Programming, Modules And Packages, Exception Handling

 Write python programs to understand Classes, Objects, Constructors, Inner class and
Static method
 Write python programs to understand different types of Inheritance
3  Write python programs to understand polymorphism using Operator overloading, 12 LO2
Method overloading, Method overriding in Python.
 Write a python program using Abstract class, abstract methods and Interfaces in
Python.
 Write python programs to understand different modules and external packages
 Write a python program to understand built-in and user defined exceptions
4 File handling in Python 05 LO3
 Write python programs to understand different File handling operations
GUI Programming and Databases
 Write a program to create a GUI for student registration form with Python using built-
5 in tools (Tkinter, PyQt) in Python. 09 LO3
 Write a program to store the data of student registration form in the database and
perform various operations like add, update and delete (CRUD) using any one of the
databases (MySQL, Oracle, SQLite, etc).
Client Server Programming
6  Write a python program to create client/server application (chat application). 08 LO4
 Write a program to create and deploy application using Flask.
 Write a program to create and deploy application using web2py.

110
 RamraoAdik Institute of Technology,Nerul, Navi Mumbai.
Department of Information Technology

Text Books:
1. James Payne, ”Beginning Python: Using Python 2.6 and Python 3.1”,Wrox Publication
2. Dr. R. Nageswara Rao,” Core Python Programming” , Dreamtech Press, Wiley Publication
3. Magnus Lie Hetland,”Beginning Python From Novice to Professional”, Second Edition”, Apress Publication

Reference Books:
1. Wesley J Chun,” Core Python Applications Programming” Third Edition, Pearson Publication.
2. E. Balguruswamy,” Introduction to Computing and Problem Solving using Python”, McGraw Hill Publication
3. Learn to Master Python, from Star EDU solutions , by Script Demics

Term Work:
Term Work shall consist of write ups of experiments performed in the laboratory based on the above list, but not limited to it. Mini
project needs to be developed using python and any framework (Django, Flask, and Web2Py)

Practical and Oral Evaluation: Oral & Practical exams will be conducted based on the experiments performed in the laboratory.

111
 RamraoAdik Institute of Technology,Nerul, Navi Mumbai.
Department of Information Technology

Subject Theory Practical Tutorial Theory Practical/Oral Tutorial Total

Subject Name
Code Hrs Hrs Hrs Credit Credit Credits Credits
ITMP402 Mini Project II -- 4 -- 2 -- 2

Examination Scheme

Term Practical Oral

Theory Marks Total
Subject Work
Subject Name
Code In-Sem Evaluations
Mid End Sem
Avg. of 2 Exam
IA1 IA2 Sem
IAs
Exam
ITMP402 Mini Project II -- -- -- -- -- 25 -- 25 50

Course Description:

The Mini project II is developed to help students develop practical knowledge and ability about tools and techniques in order to solve
real-life problems related to industry and computer science research areas. Students should select a problem statement based on the
subjects learnt in SEM III and Sem IV. The students should develop proper documentation, working prototype and conduct proper
testing and analysis of the models developed during the mini-project.

112
 RamraoAdik Institute of Technology,Nerul, Navi Mumbai.
Department of Information Technology

Teaching Scheme (Contact Hours) Credits Assigned

Course Code
Course Name Pract./
Theory Pract. Tut. Theory Tut. Total
Oral.
AUC401 Sports & Yoga 01 -- -- -- -- -- --
Examination Scheme
Theory

Course Code Course Name Internal Assessment

End Exam.
Mid Pr/
Sem Duration TW
Test1 Test2 Avg. Sem Oral. Total
Exam (in Hrs)
Exam

AUC401 Sports & Yoga -- -- -- -- -- -- -- -- --

Course Description:
This course aims to teach students importance of Yoga and Sports technical students. It emphasizes on the understanding of how to
integrate yoga techniques into modern-day approaches to lead a healthy and stress free life.

113
 RamraoAdik Institute of Technology,Nerul, Navi Mumbai.
Department of Information Technology

Course Objectives:

1. To understand the importance of Physical Education and Physical fitness.

2. To learn importance of yoga and sports in daily life.
3. Enhance understanding of anatomy, biomechanics, and efficiency of movement.
4. Understanding the application of various Law’s of Motion in Sports.
5. Understanding relation between Yoga, it’s asanas and Stress-free life.

Course Outcomes:

1. Students will learn Physical education and its importance.

2. Students will learn anatomy, physiology, and the effects of exercise on various body parts.

3. Students will learn law’s of motion, various postures and its bad effects on body parts.

4. Students will be able to learn importance of various Asanas and how to use it as a preventive measure.

114
 RamraoAdik Institute of Technology,Nerul, Navi Mumbai.
Department of Information Technology

Course Contents:

Module Contents Hours

Introduction to Physical Education: Meaning & definition of Physical Education , Aims & Objectives
of Physical Education, Changing trends in Physical Education , Olympic Movement
1. Ancient & Modern Olympics (Summer & Winter), Olympic Symbols, Ideals, Objectives & Values 02
Awards and Honours in the field of Sports in India (Dronacharya Award, Arjuna Award,
Dhayanchand Award, Rajiv Gandhi Khel Ratna Award etc.)
Physical Fitness, Wellness & Lifestyle , Meaning & Importance of Physical Fitness & Wellness
2. Components of Physical fitness, Components of Health related fitness, Components of wellness 02
Preventing Health Threats through Lifestyle Change , Concept of Positive Lifestyle
Fundamentals of Anatomy & Physiology in Physical Education, Sports and Yoga
Define Anatomy, Physiology & Its Importance
Effect of Exercise on the functioning of various body Systems. (Circulatory System, Respiratory
3. 03
System, Neuro-Muscular System etc.)
Kinesiology, Biomechanics & Sports , Meaning & Importance of Kinesiology & Biomechanics in
Physical Edu. & Sports
Newton’s Law of Motion & its application in sports, Friction and its effects in Sports.
Postures , Meaning and Concept of Postures, Causes of Bad Posture. Common Postural Deformities
4. 03
– Knock Knee, Flat Foot, Round Shoulders, Lordosis, Kyphosis, Bow Legs and Scoliosis.
Corrective Measures for Postural Deformities, Advantages & disadvantages of weight training.
5. Yoga & Lifestyle 03

115
 RamraoAdik Institute of Technology,Nerul, Navi Mumbai.
Department of Information Technology

Asanas as preventive measures.

Hypertension: Tadasana, Vajrasana, Pavan Muktasana, Ardha Chakrasana, Bhujangasana, Sharasana.
Obesity: Procedure, Benefits & contraindications for Vajrasana, Hastasana, Trikonasana, Ardh
Matsyendrasana.
Back Pain: Tadasana, Ardh Matsyendrasana, Vakrasana, Shalabhasana, Bhujangasana.
Diabetes: Procedure, Benefits & contraindications for Bhujangasana, Paschimottasana, Pavan
Muktasana, Ardh Matsyendrasana.
Asthema: Procedure, Benefits & contraindications for Sukhasana, Chakrasana, Gomukhasana,
Parvatasana, Bhujangasana, Paschimottasana, Matsyasana.

Reference Books:

1. Modern Trends and Physical Education by Prof. Ajmer Singh.

2. Light on Yoga by B.K.S. Iyengar.

116
 RamraoAdik Institute of Technology,Nerul, Navi Mumbai.
Department of Information Technology

TeachingScheme
CreditsAssigned
CourseCo (ContactHours)
de CourseName
Theory Pract. Tut. Theory Pract. Tut. Total
Entrepreneurship Essential
*HBSO401 program
- 2 - - - - 0
(online)

EvaluationScheme
Theory Exam Term Practic
CourseCo CourseName Internal Assessment Mid End Sem Duration Work Oral Total
al
de Test1 Test 2 Avg. Sem. Exam (in Hrs.)
Entrepreneurship Essential Exam
*HBSO401 program
- - - - - - - - - -
(online)

Course Description:

Entrepreneurship Essentials introduces you to the entrepreneurial journey from finding an idea, to gaining traction in the marketplace, to
raising capital for your venture. This course explains how entrepreneurs run structured experiments to validate ideas and refine business

117
 RamraoAdik Institute of Technology,Nerul, Navi Mumbai.
Department of Information Technology

strategy. You will dive deep into the numbers behind how entrepreneurs and their investors make financial decisions to create value and
grow their operations.

118