John Wilson Education Society’s

Wilson College (Autonomous)

Affiliated to the
UNIVERSITY OF MUMBAI

Syllabus for F.Y

Program: BSc.I.T

(Major:Information Technology & Minor: Electronics)

Programme Code: WSITC

Choice Based Credit System (CBCS) with effect from

Academic year 2023–2024
 PROGRAM OUTLINE 2023-2024

YEAR SEM COURSE CODE COURSE TITLE CREDITS

FY I
Major WSITCMJ111 Programming Principles with C 2
(Theory)
WSITCMJ112 Operating System (Theory) 2
WSITCMJ113 Programming Principles with C 2
(Practicals)
Minor WSITCMN111 Digital Electronics 2
WSITCMN112 Computer Networks(Theory) 2
WSITCMN113 Computer Networks(Practicals) 2

OE/GE WSITCOE111 Fundamentals of Computers

(Elective-I) 2

OE/GE WSITCOE112 Awareness Of Cyber Security

2
(Elective-II)
SEC WSITCSE111 Operating System Practical
2
II
Major WSITCMJ121 OOPs with C++(Theory) 2
WSITCMJ122 Web Designing & 2
development(Theory)
WSITCMJ123 OOPs with C++(Practical) 2
Minor WSITCMN121 Microprocessor and 2
Architecture(Theory)
WSITCMN122 Embedded Systems (Theory) 2
WSITCMN123 Embedded Systems(Practical) 2
OE/GE WSICTOE121 Website Design (Elective-I) 2

SEC WSITCSE121 Digital Electronics Practicals 2

 PROGRAMME SPECIFIC OUTCOME (PSOs)
After completing three years course of in Information Technology, the learner will be able to:
1. Equip with the professional & technical skills essential for making a career in the
Front-end Developer, Back-end Developer, Software Tester, Programmer,
Network Administrator, Security Expert etc.
2. Students would demonstrate the ability to apply research principles in a variety of
creative, organizational, professional venues.
3. Apply the knowledge of engineering and management principles to manage
projects effectively in diverse environments as a member or a leader in the team
4. Learners will understand technology as a system of interrelated forces, including
automation, Robotics, Big data analytics, Advance Programming, Networking,
Security, Cyber law, Regulatory constraints, and ethical concerns.
5. Learners will be able to create and design technological products, including
website, software, robots, RFID, Hardware Automation, Also, will be able to
become Software Engineer, Tester and Pen testers

PREAMBLE
With the introduction of Choice Based Credit System (CBCS) by the esteemed
University of Mumbai from academic year 2016-17, the existing syllabus of FYBSCIT
is restructured according to the CBCS pattern.
In the last two decades, technology has made a paradigm shift in the way society
functions. Media, being the important segment of the society plays a pivotal role in the
political, sociological, psychological, and economical aspects in society. In addition to
the knowledge of the technical skills of mass media, the current syllabus orients to the
theoretical framework relating to media-audience relationship.
The first year of BSCIT course introduces the students to various fields available under
the umbrella of mass Programming, Mathematics, Communication Skills, Software’s,
Database, Website Design.
The fundamentals of Information Technology prepare the students for advanced
theoretical and practical related to field introduced. In the second year of BSCIT,
followed by the elaboration on Information Technology research concepts and
methodologies. Inclusion of field-based learning begins in the third year of BSCIT, with
specialization in Information Technology.
 WILSON COLLEGE (AUTONOMOUS) NEP SYLLABUS FOR BSC.I.T.

PROGRAM(s): FYBScIT SEMESTER: I

Course:-
Major Course Code: WSITCMJ111
Programming
Principles with C
(Theory)

Teaching Scheme Evaluation Scheme

Continuous
Tutor
Lectures (Hours Practi Credit Internal Semester End
ial
per week) cal Assessment Examination (Marks-
(Hour
(Hour (CIA) 60)
s per
s per (Marks- 40)
week)
week)
2 - - 2 40 60
Learning Objectives:
1) Enhancing student logical reasoning through C programming language.
2) Clarifying fundamental concepts through relevant examples.
3) Adopting alternative strategies for problem-solving.
4) Mastering error handling techniques and identifying effective solutions.
5) Troubleshooting and debugging code for seamless execution.
Course Outcomes:
1) Master the foundational principles of programming.
2) Logic Development through Algorithms and Flowcharts.
3) Exploring and Mastering Different Data Types.
4) Mastering Input and Output Functions for Effective Programming.
5) Strengthening Advanced Concepts through Practical Programming Examples.

DETAILED SYLLABUS

Unit Sub Course/ Unit Title Lectures

unit (hours)

1 Introduction:

I 1.1 History of C,Applications of C, Features of C 5

Language,Meaning of AlgorithmTypes of
Programming Languages,Structure of C
 Program. pseudo code statements and flowchart
symbols, Compilation and Execution of a
Program, Character Set, identifiers and
keywords, data types and sizes, constants and its
types, variables, Rules for Variables, Algorithms
1.2 Operators and Expressions: 4
Arithmetic operators, unary operators, relational
and logical operators, assignment operators,
assignment operators, the conditional operator,
library functions
II 2.1 Block Structure, Initialization, C Preprocessor 4
Control Flow: Statements and Blocks, If-Else,
Else-If, Switch, Loops- While and For
LoopsDo-while, Break and Continue, Goto and
Labels
2.2 Functions and Program Structure: Basics of 6
functions. User defined and Library functions,
Function parameters, Return values, Recursion
External variables, Scope Rules, Standard
Input and Output, Formatted Output-printf()
and Formatted Input- scanf(), Line Input and
Output, Error Handling- StdErr and Exit,
Header Files
III 3.1 Pointer and Arrays Pointer and Addresses, 6
Pointer and Function Arguments, Pointer and
Arrays, Address Arithmetic, Character Pointers
and Functions, Pointer Arrays: Pointers and
Functions, Multidimensional Array,
Command-line Arguments, Pointers to
Functions, Dynamic memory allocation
IV 4.1 Structures:Basics of `aa`structures, Structures 5
and Functions, Arrays of Structures, Pointers
to Structures, Unions, Bit-fields, File
management in C: Defining and Opening file,
Closing a file, Input / Output operations on
file, Error handling in C, Random access to
files, Command line arguments.
 https://www.guru99.com/software-engineer-book.html

Author
Book Title Latest Edition Publisher
Name

Clean Code Robert C. 1st edition PHI

Martin

Design Patterns Erich Gamma 1st edition Addison Wesley

Patterns of Enterprise Martin 1st edition Addison-Wesley

Application Architecture Fowler
Gregor Pearson Addison-
Enterprise Integration Patterns Hohpe 1st edition Wesley Professional
Steve
Code Complete Mcconnell 2nd edition Microsoft Press US
 WILSON COLLEGE (AUTONOMOUS) NEP SYLLABUS FOR BSC.I.T.

PROGRAM: FYBSCIT SEMESTER: I

Course:- Major
Course Code:-WSITCMJ112
Operating
Systems(Theory)

Teaching Scheme Evaluation Scheme

Continuous
Tutorial
Lectures (Hours Practi Credit Internal Semester End
(Hours
per week) cal Assessment Examination (Marks-
per
(Hour (CIA) (Marks- 60)
week)
s per 40)
week)
2 - - 2 40 60

Learning Objectives:
1) To understand the basic concepts and functions of operating systems.
2) To understand Processes, Threads and Deadlocks
3) To analyze Scheduling algorithms
4) To analyze memory management schemes.
5) To understand I/O management and File systems.
6) To be familiar with the basics of Linux system and Mobile OS like iOS and Android.

Course Outcomes:
At the end of the course, the students should be able to:
1) Analyze various scheduling algorithms.
2) Understand deadlock, prevention and avoidance algorithms.
3) Compare and contrast various memory management schemes.
4) Understand the functionality of file systems.
5) Perform administrative tasks on Linux Servers.
6) Compare iOS and Android Operating Systems
 DETAILED SYLLABUS

Course Code/ Subunit Course/ Unit Title Credits/ Lecture’s

Unit
I Introduction
1.1 Introduction of Operating-Systems 3L
Structures: Definition of Operating
system, Operating System’s role,
Operating-System Operations,
Functions of Operating System.
1.2 Operating-System Structures: 3L
Operating- System Services, User and
Operating-System Interface, System Calls,
Types of System Calls, Operating-System
Structure

II
2.1 Processes: Process Concept, 6L
Process Scheduling, Operations on
Processes, Interprocess
Communication
Threads: Overview, Multicore
Programming, Multithreading Models
Process Synchronization: General
structure of a typical process, race
condition, The Critical-Section Problem,
Peterson’s Solution, Synchronization
Hardware, Mutex Locks, Semaphores,
Classic Problems of Synchronization,
Monitors
2.2 CPU Scheduling: Basic Concepts, 5L
Scheduling Criteria, Scheduling
Algorithms (FCFS, SJF, SRTF, Priority,
RR, Multilevel Queue Scheduling,
Multilevel Feedback Queue Scheduling),
Thread Scheduling Deadlocks: System
Model, Deadlock Characterization,
Methods for Handling Deadlocks,
Deadlock Prevention, Deadlock
Avoidance, Deadlock Detection,
Recovery from Deadlock
III
 3.1 Main Memory: Background, Logical 04
address space, Physical address space,
MMU, Swapping, Contiguous Memory
Allocation, Segmentation, Paging, Structure
of the Page Table
Virtual Memory: Background,
Demand Paging, Copy-on-Write, Page
Replacement, Allocation of Frames,
Thrashing
3.2 Mass-Storage Structure: Overview, 5
Disk Structure, Disk Scheduling, Disk
Management
File-System Interface: File Concept,
Access Methods, Directory and Disk
Structure, File- System Mounting, File
Sharing
File-System Implementation: File-
System Structure, File-System
Implementation, Directory
Implementation, Allocation Methods,
Free-Space Management
IV Server and Mobile Operation System
4.1 Win 19 R Server operating System: 2
Architecture, Components,
Services, Configuration
4.2 Android OS: Architecture, 2
Components, Services, Configuration
Books and References:

Sr. No. Title Author/s Publisher Edition Year

1 Modern Operating Andrew S. Pearson 4th 2014
Systems Tanenbaum, Herbert
Bos
2 Operating Systems – Willaim Stallings Pearson 8th 2009
Internals and Design
Principles
3 Operating System Abraham Silberschatz, Wiley 8th
Concepts Peter B. Galvineg
Gagne
4 Operating Systems Godbole and Kahate McGraw 3rd
Hill
 WILSON COLLEGE (AUTONOMOUS) NEP SYLLABUS FOR BSC.I.T.

PROGRAM(s): FYBSCIT SEMESTER: I

Course:- Major
Course Code: WSITCMJ113
Programming
Principles with
C (Practical)

Teaching Scheme Evaluation Scheme

Continuous
Tutoria
Lectures Practical Credit Internal Semester End
l
(Hours per (Hours Assessment Examination (Marks-
(Hours
week) per (Marks- 40) 60)
per
week)
week)
- 4 - 2 40 60
Learning Objectives:
1) To develop the logical ability of the student.
2) Basic concepts to be cleared using suitable examples.
3) Different approach towards the problem.
4) To handle the errors and find suitable solutions.
5) Debugging the code.
Course Outcomes:
1) Learn the basic principles of programming.
2) Develop logic using algorithms and flowchart.
3) Acquire the information about data types.
4) Understanding of input and output functions.
5) Enhance advanced concepts using programs.

Course Sub Course/ Unit Title Credits

Code/Unit unit 2
1 a.Write an algorithm and draw flowchart to print the
given no. is even or odd.
b.Write an algorithm and draw flowchart for sum of 1
to 5 numbers.
2 a. Write a program using a while loop to reverse the
digits of a number.
b. Write a program to calculate the factorial of a
given number..
Write a program to print the Fibonacci series.
3 a. Write a program in C to check entered character
vowel or consonant
b. Write a program to C program to print day name of
week using switch-case.
c.Write a program to read three values from keyboard
and print out the
largest of them without using if statement.
4 a. Write a program to print the pattern of asterisks as
shown below :
*
**
***
****
b. Write a program to print the pattern of asterisks as
shown below :
*****
****
***
**
*
5 a. Write a program to print area of square using
function.
b. Write a program using recursive function.
c. Write a program to square root, abs() value using
function.
6 a. Write a program to print roll no and names of 10
students using an array.
b. Write a program to sort the elements of an array in
ascending or descending order.
7 b. Write a program to find if the given string is
palindrome or not.
8 a. Write a program to display the values using
different data types and its address using a pointer.
b. Write a program to perform addition and
subtraction using a pointer.
9 Write a program to print the structure using
Title
Author
 Subject
Book ID
Print the details of two students.
10 Create a mini project on “Bank management
system” . The program should be menu driven.
 WILSON COLLEGE (AUTONOMOUS) NEP SYLLABUS FOR BSC.I.T.

PROGRAM: FYBSCIT SEMESTER: I

Course:Digital Course Code: WSITCMN111

Electronics(Theory)

Teaching Scheme Evaluation Scheme

Continuous
Tutorial
Lectures Practical Credit Internal Semester End
(Hours
(Hours (Hours per Assessment Examination (Marks- 60)
per
per week) week) (CIA) (Marks-
week)
40)
2 - _ 2 40 60
Learning Objectives:
1) Introduce the concept of digital and binary systems.
2) Be able to design and analyze combinational logic circuits.
3) Be able to design and analyze sequential logic circuits.
4) Understand the basic software tools for the design and implementation of digital circuits and
systems.
5) Reinforce theory and techniques taught in the classroom through experiments and projects
in the laboratory
Course Outcomes:
After the end of the course, the learner will be able to:
1) Examine the structure of number systems and perform the conversion among different
number systems
2) Illustrate reduction of logical expressions using boolean algebra, k-map and tabulation
method and implement the functions using logic gates
3) Realize combinational circuits for given application
4) Design and analyzes synchronous and asynchronous sequential circuits using flip-flops
5) Implement combinational logic circuits using programmable logic devices
 DETAILED SYLLABUS

Course Sub unit Course/ Unit Title Lectures

Code/ Unit
I Introduction to Number system

1.1 Number System: numbering systEm, 3

binary number system, octal number
system, hexadecimal number system,
1.2 Binary Arithmetic: Binary addition, Binary 4
subtraction,Negative number representation,
Subtraction using 1’s complement and 2’s
complement, Binary multiplication and
division,BCD multiplication and division
II Boolean Algebra and Logic Gates:

2.1 Boolean Algebra and Logic Gates: 4

Introduction, Logic
(AND OR NOT), Boolean theorems,
Boolean Laws, De Morgan’s Theorem,
Perfect Induction, Reduction of
Logic expression using Boolean Algebra,
Deriving
2.2 Boolean expression from given circuit, 4
exclusive OR
and Exclusive NOR gates, Universal
Logic gates,Implementation of other gates
using universal gates.

III Code Conversion and Arithmetic

Circuits
3.1 Conversion from one number system to 4
another,floating point numbers, weighted
codes binary coded decimal, non-
weighted codes Excess – 3 code, Gray
code, Code conversion. Error detection
and correction.

3.2 Arithmetic Circuits: Introduction, Adder, 4

BCD
Adder, Binary Subtractors, BCD Subtractor,
 Comparator.

IV Combinational Logic Circuits

4.1 Combinational Logic Circuits: Introduction, Multi- 4

input, multi-output Combinational circuits, Code
converters design and implementations.
4.2 Multiplexer, Demultiplexer, Encoder and 3
Decoder

References:

1. Digital Principles and Applications Malvino and Leach Tata McGraw Hill
2.2. Make Electronics Charles Platt O’Reilly 1 st 2010
3. Modern Digital Electronics R. P. Jain Tata McGraw Hill 3 rd
4. Digital Electronics: Principles, Devices and Applications, Anil K. Maini Wiley 2007
5.Digital Electronics and Logic Design N. G. Palan Technova
 WILSON COLLEGE (AUTONOMOUS) NEP SYLLABUS FOR BSC.I.T.

PROGRAM: FYBScIT SEMESTER: II

Course: Computer Networks Course Code: WSITCMN112

Evaluation
Teaching Scheme Scheme
Continuous
Tutorial
Lectures Practical Credit Internal Semester End
(Hours
(Hours per (Hours per Assessment Examination
per
week) week) (CIA) (Marks- (Marks- 60)
week)
40)
2 - _ 2 40 60
Learning Objectives:
1) To introduce students to the tools, techniques, components used for communication.
2) To understand how digital communication works.
3) Introduce building the network topology
Course Outcomes:
After the end of the course, the learner will be able to:
1) Gain knowledge, understanding of communication history, and evolution.
2) Development of Mass Communication with networking.
3) Develop the I.T Infrastructure

DETAILED SYLLABUS

Course Code/
Subunit Course/ Unit Title Credits/ Lecture’s
Unit
I Introduction to Computer Network

1.1 Computer Network, Evolution of 6L

Computer Networks
Different types of Computer Network,
Difference between LAN, MAN and
WAN, Hardware Devices used for
Networking: Network Interface Card
(NIC), Modem, Hub, Switch L1 and L2
switches, Comparison between switch
and hub, Bridge, Router, Gateway.
 1.2 Standards and administration. 5L
Network Models: Protocol layering,
TCP/IP protocol suite, The OSI
model.
II Network Layer

2.1 IPv4 Addresses, IPv4 3L

Protocol, ARP,ICMP, IPv6
2.2 RIP, OSPF, BGP 3L
III Transport Layer
3.1 UDP, TCP 2L
3.2 Wireless LANs: Introduction, IEEE 3L
802.11 project, Bluetooth, WiMAX,
Cellular telephony, Satellite networks.
IV Application Layer & Introduction to
Network Security
4.1 WWW, HTTP, SMTP, POP3, MIME, 2L
IMAP
4.2 DHCP, TELNET, SSH, FTP, 2L
4.3 Attacks on Computer Network 2L
4.4 Cryptography and Network Security, 2L
Internet Security

References:

1. TCP/IP Protocol Suite Behrouz A. Forouzan Tata McGraw Hill Fourth Edition 2010
2. Data Communication and Networking Behrouz A. Forouzan Tata McGraw Hill Fifth
Edition 2013
3. Computer Networks Andrew Tanenbaum Pearson Fifth 2013
 WILSON COLLEGE (AUTONOMOUS) NEP SYLLABUS FOR BSC.I.T.

PROGRAM: FYBScIT SEMESTER: II

Course:-Computer Networks Course Code: WSITCMN113
Practicals
Evaluation
Teaching Scheme Scheme
Continuous
Tutorial
Lectures Practical Credit Internal Semester End
(Hours
(Hours per (Hours per Assessment Examination
per
week) week) (CIA) (Marks- (Marks- 60)
week)
40)
- 4 _ 2 40 60
Learning Objectives:
1) To introduce students to the tools, techniques, components used for communication.
2) To understand how digital communication works.
3) Introduce building the network topology
Course Outcomes:
After the end of the course, the learner will be able to:
1) Gain knowledge, understanding of communication history, and evolution.
2) Development of Mass Communication with networking.
3) Develop the I.T Infrastructure

DETAILED SYLLABUS
Unit Subunit Course/ Unit Title Credits(2)
1 Understanding IPv4 and IPv6
2 Configure RIP

3 Configure OSPF
4 Configure Static routing
5 Configure DHCP
6 Configure DNS
7 Ping, Traceroute, arp command
8 Use wireshark for HTTP & ICMP Trace
9 Configure Authentication & authorization
10 Security Checkup
 WILSON COLLEGE (AUTONOMOUS) NEP SYLLABUS FOR BSC.I.T.

PROGRAM: FYBScIT SEMESTER: I

Course: Fundamentals of Course Code: WSITCOE111
Computers (Elective-I)
Evaluation
Teaching Scheme Scheme
Continuous
Tutorial
Lectures Practical Credit Internal Semester End
(Hours per
(Hours per (Hours Assessment Examination
week)
week) per (CIA) (Marks- (Marks- 60)
week) 40)
4 - _ 2 40 60
Learning Objectives:
1) To understand the structure, function and characteristics of computer systems.
2) To understand the design of the various functional units and components of computers.
3) To identify the elements of modern instruction sets and their impact on processor design.
4) To explain the function of each element of a memory hierarchy.
5) To identify and compare different methods for computer I/O.
Course Outcomes:
1) Understand basic concepts and terminology of information technology.
2) Have a basic understanding of personal computers and their operations.
3) Understand various software and hardware, and various security issues.
4) Familiarize students with complete fundamentals and the packages commonly used in
computing software.
5) Gain writing skills and various presentation aspects using word processing software.

DETAILED SYLLABUS

Unit Subunit Course/ Unit Title Lectures

I Fundamentals of Computer:
1. Introduction to Computer: Definition, 5
Characteristics of Computers, Basic
Applications of Computer, Generations of
 computers
Components of Computer System: Central
Processing Unit (CPU), input devices & output
devices, Advantages of computer system
2. Computer Memory: primary and secondary 3
memory
Data processing: concepts of data processing,
Definition of Information and data,
II 1. Operating System: Definition & functions, 2
Characteristics of Operating system .
2. Basics of Windows. Multiprogramming, Multi 2
Tasking, Multiprocessing, Time
Sharing.
III 1. Computer Networking:Introduction of 4
computer network, Classifications of computer
network, uses of computer network, advantages
& dis-advantages of computer network.

2. Components of Computer Network: 4

Classification of Computer Network Based on
Topology.

IV 1. Data Representation: Binary Number system, 5

Octal, Hexadecimal, Decimal and their
conversion, Complements.
2. Introduction to MS Office: 5
MS Word,MS PowerPoint,MS Excel
(Introduction,Features and Applications).
 WILSON COLLEGE (AUTONOMOUS) NEP SYLLABUS FOR BSC.I.T.

PROGRAM: FYBScIT SEMESTER: I

Course: Awareness of cyber Course Code: WSITCOE112

Security(Elective-II)

Evaluation
Teaching Scheme Scheme
Continuous
Tutorial
Lectures (Hours Practical Credit Internal Semester End
(Hours
per week) (Hours per Assessment Examination
per
week) (CIA) (Marks- (Marks- 60)
week)
40)
2 - _ 2 40 60
Learning Objectives:
1. Student will be able to understand network
2. Will be able to differentiate between the different types of networks and the ip ranges
3. Student will be able to understand the types of attack related to cyber world
4. Student will be able to understand the legal action against the infringement of cyber law

Course Outcomes:
After the end of the course, the learner will be able to:
1. Will be able to create their own network infrastructure
2. Will be able to recognize the attacks
3. Will be able to examine the cyber security cases

DETAILED SYLLABUS

Unit Subunit Course/ Unit Title Lectures

I Introduction to computer network 3

IPv4 & IPv6 addressing, Subnetting, Subnet mask

II Standard & Protocol used for networking 5

transmission Control Protocol (TCP), Internet Protocol (IP),
User Datagram Protocol (UDP) and network standards such as
TCP/IP, HTTP, FTP,
II Different Types of attacks 10
I Phishing, Malware (Malicious Software)Ransomware,
Spyware, Trojans, Viruses, Distributed Denial of Service
(DDoS)

I Cyber Laws and Security

V
Introduction to cyber security, cyber security Ethics,web 12
Technology and Security,Introduction to cryptography.
 WILSON COLLEGE (AUTONOMOUS) NEP SYLLABUS FOR BSC.I.T.

PROGRAM: FYBScIT SEMESTER: I

Course:Operating system Course Code: WSITCSE111

Practicals
Evaluation
Teaching Scheme Scheme
Continuous
Tutorial
Lectures Practical Credit Internal Semester End
(Hours
(Hours per (Hours per Assessment Examination
per
week) week) (CIA) (Marks- (Marks- 60)
week)
40)
- 4 _ 2 40 60
Learning Objectives:

Course Outcomes:
After the end of the course, the learner will be able to:

DETAILED SYLLABUS

Course code Operating system Practicals Credit

WUSITC2P s
2

1
Installation of virtual machine software 2

2 Installation of Linux operating system (RedHat / Ubuntu)

on virtual machine.

3 Installation of Windows operating system on virtial

machine.

4 Linux commands: Working with Directories: a. pwd, cd,

absolute and relative paths, ls, mkdir, rmdir, b. file, touch, rm,
cp. mv, rename, head, tail, cat, tac, more, less, strings, chmod
5 Linux commands: Working with files: a. ps, top, kill, pkill,
bg, fg, b. grep, locate, find, locate. c. date, cal, uptime, w,
whoami, finger, uname, man, df, du, free, whereis, which. d.
Compression: tar, gzip

6 Windows (DOS) Commands – 1 a. Date, time, prompt, md,

cd, rd, path. b. Chkdsk, copy, xcopy, format, fidsk, cls, defrag,
del, move.

7 Windows (DOS) Commands – 2 a. Diskcomp, diskcopy,

diskpart, doskey, echo b. Edit, fc, find, rename, set, type, ver

8 Working with Windows Desktop and utilities a. Notepad b.

Wordpad c. Paint d. Taskbar e. Adjusting display resolution f.
Using the browsers g. Configuring simple networking h.
Creating users and shares

9 9. Working with Linux Desktop and utilities a. The vi

editor. b. Graphics c. Terminal d.Adjusting display resolution
e. Using the browsers f. Configuring simple networking g.
Creating users and shares

10 Installing utility software on Linux and Windows

SEMESTER- II
 WILSON COLLEGE (AUTONOMOUS) NEP SYLLABUS FOR BSC.I.T.

PROGRAM: FYBSCIT SEMESTER: II

Course:OOPs with C++ Course Code: WSITCMJ121

Teaching Scheme Evaluation Scheme

Lectures Practical Continuous Semester End

Tutori
(Hours per (Hours per Internal Examination (Marks-
al Credit
week) week) Assessment 60)
(Hour
(CA)(Marks-
s per
week) 40)

2 - _ 2 40 60

Learning Objectives:
1) To make students familiar with object-oriented programming language.
2) To introduce the concept and process of writing and editing in oops.
3) To introduce students to different ways of delivering the information with data
structure, inheritance, polymorphism concept

Course Outcomes:
After the end of the course, the learner will be able to:
1) Understand and incorporate the different writing styles in OOPS.
2) Employ the concepts OOPS.
3) Convert the textual data into machine readable data.

DETAILED SYLLABUS

Unit Subunit Course/ Unit Title Lecture s

I 1.1 Object Oriented Methodology: Introduction, 3L

Advantages and Disadvantages of Procedure
Oriented Language, what is Object Oriented?
What Is Object Oriented Development? Object
Oriented Themes, Benefits and Application of
OOPS
 1.2 Principles of OOPS: OOPS Paradigm, Objects, 2L
Classes, Data Abstraction and Data
Encapsulation, Inheritance, Polymorphism,
Dynamic Binding.

1.3 Classes and Objects: Simple classes (Class 3L

specification, class members accessing),
Defining member functions, passing object as
an argument, Returning object from functions,
friend classes
II Constructor, Destructor, Polymorphism,
Virtual Function

2.1 Constructors and Destructors: Introduction, 3L

Default Constructor, Parameterized Constructor
and examples, Destructors
2.2 Polymorphism: Concept of function 3L
overloading, overloaded operators, overloading
unary and binary operators, overloading
comparison operator,overloading arithmetic
assignment operator, Data Conversion between
objects and basic types

Virtual Functions: Introduction and need, Pure 4L

Virtual Functions, Static Functions, this
Pointer,abstract classes, virtual destructors
III Inheritance & Exception Handling

Inheritance: Introduction, understanding 4L

inheritance, Advantages provided by
inheritance, choosing the access specifier,
derived class constructors, class hierarchies,
multiple inheritance, multilevel inheritance.
Exception Handling: Introduction, Exception 2L
Handling Mechanism, Concept of throw &
catch
IV Files
Working with Files: Introduction, File 2L
Operations, Various File Modes.
 Conditional Statements: Order of Operations. 2L
if,if- else, nested if –else
Looping: for, while, nested loops.

Templates and Conditional Statement:- 2L

Templates: Introduction, Function Template and
examples, Class Template and examples

References:-

1. Object Oriented Analysis and Design Timothy Budd TMH 3rd 2012
2. Mastering C++ K R Venugopal, Rajkumar Buyya, T Ravishankar Tata McGraw
Hill 2nd Edition 2011 3. C++ for beginners B. M. Hirwani SPD 2013
3. Effective Modern C++ Scott Meyers SPD
4. Object Oriented Programming with C++ E. Balagurusamy Tata McGraw Hill 4th
5. Learning Python Mark Lutz O’ Reilly 5th 2013
6. Mastering Object Oriented Python Steven F. Lott Pact Publishing 2014
 WILSON COLLEGE (AUTONOMOUS) NEP SYLLABUS FOR BSC.I.T
PROGRAM: FYBSCIT SEMESTER: II

Course:Web Designing & Course Code: WSITCMJ122

development

Teaching Scheme Evaluation Scheme

Lectures Practical Continuous Semester End

Tutor
(Hours per (Hours per Internal Examination (Marks-
ial Credit
week) week) Assessment 60)
(Hour
(CA) (Marks-
s per
40)
week)

2 _ 2 40 60

Learning Objectives:
1) To make students familiar with object-oriented programming language.
2) To introduce the concept and process of writing and editing in oops.
3) To introduce students to different ways of delivering the information with data
structure, inheritance, polymorphism concept

Course Outcomes:
After the end of the course, the learner will be able to:
1) Understand and incorporate the different writing styles in OOPS.
2) Employ the concepts OOPS.
3) Convert the textual data into machine readable data.

DETAILED SYLLABUS

Unit Details Lectures

 Introduction, Basic Principles of Web Development
I
Planning: Contemplate and appraise client requirements, 7L
identifying technologies used for website development,
Estimating all the milestones and the costs for the project Golden
Rules of Web Designing

Designing Navigation Bar: Steps to create simple top navigation

bar, Creating a responsive Top Navigation

HTML5 8L
II
Why HTML5? Introduction, Formatting text by using tags, using
lists and backgrounds, Creating hyperlinks and anchors. Style
sheets, CSS formatting text using style sheets, formatting
paragraphs using style sheets.

HTML5 Tables, Forms and Media: Creating tables: creating

simple table, specifying the size of the table, specifying the width
of the column, merging table cells, using tables for page layout,
formatting tables: applying table borders, applying background
and foreground fills, changing cell padding, spacing and
alignment, creating user forms: creating basic form, using check
boxes and option buttons, creating lists, additional input types in
HTML5

III Introduction Creating Style Sheet CSS

Syntax CSS – Inclusion CSS Rules Overriding Handling old 7L

browsers CSS Comments CSS Properties Text Properties List
Properties Border Properties Font Properties CSS Styling
Background Text Format, Controlling Fonts

Working with block elements and objects, Working with Block

elements (BOX Model), Setting the Margins, setting padding,
Working with borders

Styling the content using as a block, Working with Objects,

Working with Lists and Tables
 IV Java Script

Java Script Introduction: Introduction, Client-Side JavaScript, 8L

Server-Side JavaScript, JavaScript Objects, JavaScript Security

Operators: Assignment Operators, Comparison Operators,

Arithmetic Operators, % (Modulus), ++(Increment), --
(Decrement), -(Unary Negation), Logical Operators, Short-Circuit
Evaluation, String Operators, Special Operators, ?: (Conditional
operator), (Comma operator), delete, new, this, void Statements:
Break, comment, continue, delete, do…while, export, for, for...in,
function, if...else, import, labeled, return, switch, var, while, with
JavaScript (Properties and Methods of Each) : Array, Boolean,
Date, Function, Math, Number, Object, String, regExp Document
and its associated objects: document, Link, Area, Anchor, Image,
Applet, Layer Eve

References:

1. https://www.geeksforgeeks.org/html5-introduction/
 WILSON COLLEGE (AUTONOMOUS) NEP SYLLABUS FOR BSC.I.T.
PROGRAM: FYBSCIT SEMESTER: II

Course:OOPs with C++ Course Code: WSITCMJ123

Practicals

Teaching Scheme Evaluation Scheme

Lectures Practical Continuous Semester End

Tutorial
(Hours per (Hours per Internal Examination
(Hours Credit
week) week) Assessment(CA) (Marks- 60)
per
(Marks- 40)
week)

4 _ 2 40 60

Learning Objectives:
1) To make students familiar with object-oriented programming language.
2) To introduce the concept and process of writing and editing in oops.
3) To introduce students to different ways of delivering the information with data
structure, inheritance, polymorphism concept

Course Outcomes:
After the end of the course, the learner will be able to:
1) Understand and incorporate the different writing styles in OOPS.
2) Employ the concepts OOPS.
3) Convert the textual data into machine readable data.

DETAILED SYLLABUS
Course code OOPS WITH C++ Practical’s Credits(2)
WUSITC2P1

1 Programs based on Classes and methods.

2 Programs based on friend functions.

3 Programs based on Constructors and method overloading.

4 Programs based on Operator Overloading.

5 Programs based on Inheritance.

6 Programs based on Virtual functions and abstract classes.

7 Programs based on String handling.

8 Programs based on Exception handling.

9 Programs based on File handling.

10 Programs based on Templates.

 WILSON COLLEGE (AUTONOMOUS) NEP SYLLABUS FOR BSC.I.T.

PROGRAM: FYBSCIT SEMESTER: II

Course:- Microprocessor and
Architecture Course Code: WSITCMN121

Evaluation
Teaching Scheme
Scheme
Continuous
Tutorial
Lectures (Hours Practical Credit Internal Semester End
(Hours
per week) (Hours per Assessment Examination
per
week) (CIA) (Marks- (Marks- 60)
week)
40)
2 - _ 4 40 60
Learning Objectives:
1) Understand the fundamentals of Microprocessors.
2) Understand the internal design of 8085 microprocessor
3) Design different interfacing applications using microcontrollers and peripherals.
4) Build systems using microprocessor for real time applications

Course Outcomes:
After the end of the course, the learner will be able to:
1) Describe the architecture & organization of 8085 Microprocessor.
2) Understand and classify the instruction set o f 8085/8086 microprocessor and distinguish
the use of different instructions and apply it in assembly language programming.
3) Relate the addressing modes used in the instructions.
4) Familiarize the architecture and operation of Programmable Interface Devices and realize
the programming & interfacing of it with 8085 microprocessor.

DETAILED SYLLABUS

Unit Details Lectures

I
Microprocessor, microcomputers, and Assembly Language:

Microprocessor, Microprocessor Instruction Set and Computer

Languages, From Large Computers to Single-Chip
Microcontrollers, Applications.
7L
Microprocessor Architecture and Microcomputer System:
Microprocessor Architecture and its operations, Memory, I/O
Devices, Microcomputer System, Logic Devices and Interfacing,

Microprocessor-Based System Application.

8085 Microprocessor Architecture and Memory Interface:

Introduction, 8085 Microprocessor unit, 8085-Based
Microcomputer, Memory Interfacing, Interfacing the 8155
Memory Segment, Illustrative Example: Designing Memory for
the MCTS Project, Testing and Troubleshooting Memory
Interfacing Circuit, 8085-Based Single-Board microcomputer.

Interfacing of I/O Devices

II
Basic Interfacing concepts, Interfacing Output Displays,
Interfacing Input Devices, Memory Mapped I/O, Testing and
8L
Troubleshooting I/O Interfacing Circuits.

Introduction to 8085 Assembly Language Programming:

The 8085 Programming Model, Instruction Classification,

Instruction, Data and Storage, Writing assembling and Execution
of a simple program, Overview of 8085 Instruction Set, Writing
and Assembling Program.

Introduction to 8085 Instructions:

Data Transfer Operations, Arithmetic Operations, Logic

Operation, Branch Operation, Writing Assembly Languages
Programs, Debugging a Program.
 III Programming Techniques With Additional Instructions:

Programming Techniques: Looping, Counting and Indexing,

Additional Data Transfer and 16-Bit Arithmetic Instructions, 7L

Arithmetic Instruction Related to Memory, Logic Operations:
Rotate, Logics Operations: Compare, Dynamic Debugging.

Counters and Time Delays: Counters and Time Delays,

Illustrative Program: Hexadecimal Counter, Illustrative Program:
zero-to-nine (Modulo Ten) Counter, Generating Pulse
Waveforms, Debugging Counter and Time-Delay Programs.

Stacks and Subroutines: Stack, Subroutine, Restart, Conditional

Call, Return Instructions, Advanced Subroutine concepts.

IV Code Conversion, BCD Arithmetic, and 16-Bit Data

Operations: BCD-to-Binary Conversion, Binary-to-BCD
8L
Conversion, BCD-to- Seven-Segment-LED Code Conversion,
Binary-to-ASCII and ASCII- to-Binary Code Conversion, BCD
Addition, BCD Subtraction, Introduction To Advanced
Instructions and Applications, Multiplication, Subtraction With
Carry.

Software Development System and Assemblers:

Microprocessors-Based Software Development system, Operating

System and Programming Tools, Assemblers and Cross-
Assemblers, Writing Program Using Cross Assemblers.

Books and References:

Sr. No. Title Author/s Publisher Edition Year
1. Microprocessor Architecture, Programming and Applications with the 8085 Ramesh Gaonkar
PENRAM Fifth 2012
2. Computer System Architecture M. Morris Mano PHI 1998
3. Structured Computer Organization Andrew C. Tanenbaum PHI
 WILSON COLLEGE (AUTONOMOUS) NEP SYLLABUS FOR BSC.I.T.

PROGRAM: FYBSCIT SEMESTER: II

Course:- Embedded System Course Code: WSITCMN122
Evaluation
Teaching Scheme
Scheme
Continuous
Tutorial
Lectures Practical Credit Internal Semester End
(Hours per
(Hours per (Hours Assessment Examination
week)
week) per week) (CIA) (Marks- (Marks- 60)
40)
2 - _ 2 40 60
Learning Objectives:
1) To become aware of the core characteristics and quality attributes of embedded systems
2) To learn application specific and domain specific embedded systems, the embedded
hardware and peripherals.
3) To design and program embedded system with 8051 microcontroller
4) To design and develop using the real time operating system

Course Outcomes:
After the end of the course, the learner will be able to:
1) gain knowledge about the history, classifications, applications and purpose of embedded
systems.
2) become aware of application specific embedded systems
3) microcontroller and designing it, compile, link and debug an embedded program
4) real-time characteristics of operating systems, embedded system environment

DETAILED SYLLABUS

Unit Details Lectures

I
Introduction: Embedded Systems and general purpose
computer systems, history, classifications, applications and
purpose of embedded systems

Core of embedded systems: microprocessors and

microcontrollers, RISC and CISC controllers, Big endian and 7L
Little endian processors, Application specific ICs,
Programmable logic devices, COTS, sensors and actuators,
communication interface, embedded firmware, other system
 components.

Characteristics and quality attributes of embedded systems:

Characteristics, operational and non-operational quality

attributes.

II
Introduction to Embedded Systems –

Microprocessor & Microcontroller, Architecture of

Microprocessor & Microcontroller
8L
Application and Domain Specific: Application specific –
washing machine, domain specific - automotive.

Embedded Hardware: Memory map, i/o map, interrupt map,

processor family, external peripherals, memory – RAM , ROM,
types of RAM and ROM, memory testing, CRC ,Flash memory.

Peripherals: Control and Status Registers, Device Driver,

Timer Driver - Watchdog Timers.

III The 8051 Microcontrollers: Microcontrollers and Embedded

processors, Overview of 8051 family. 8051 Microcontroller
hardware, Input/output pins, Ports, and Circuits, External
Memory. 7L
8051 Programming in C:

Data Types and time delay in 8051 C, I/O Programming, Logic

operations, Data conversion Programs.

IV Designing Embedded System with 8051 Microcontroller:

Factors to be considered in selecting a controller, why 8051
Microcontroller, Designing with 8051. 8L

Programming embedded systems: structure of embedded

program, infinite loop, compiling, linking and debugging.

References:
 1. https://realtoughcandy.com/best-embedded-systems-books/
WILSON COLLEGE (AUTONOMOUS) NEP SYLLABUS FOR BSC.I.T.

PROGRAM: FYBSCIT SEMESTER: I

Course:Embedded Systems
Practicals Course Code: WSITCMN123

Teaching Scheme Evaluation Scheme

Continuous
Tutorial
Lectures Practical Credit Internal Semester End
(Hours
(Hours (Hours per Assessment Examination (Marks-
per week)
per week) week) (CIA) (Marks- 60)
40)
- 4 _ 2 40 60
Learning Objectives:
1. To configure the embedded system 8051
2. To demonstrate the use of embedded system
3. To understand the different port and connection with circuit

Course Outcomes:
After the end of the course, the learner will be able to:
1. Student will be able to understand the circuit
2. Student will be able to configure the circuit

Unit Subunit Course/ Unit Title Credits

(2)
1
Design and develop a reprogrammable embedded
computer using 8051 microcontrollers and to show
the following aspects.

a. Programming

b. Execution

c. Debugging

2
Configure timer control registers of 8051 and
 develop a program to generate

given time delay.

3
Port I / O: Use one of the four ports of 8051 for
O/P interfaced to eight LED’s.

Simulate binary counter (8 bit) on LED’s

Interface 8051 with D/A converter and generate

4 triangular wave of given

frequency on an oscilloscope.

5
To demonstrate timer working in timer mode and
blink LED without using any

loop delay routine.

6
To interface 8 LEDs at Input-output port and create
different patterns.

7
Serial I / O: Configure 8051 serial port for
asynchronous serial communication with serial
port of PC exchange text messages to PC and
display on PC screen. Signify end of message by
carriage return.

8
To demonstrate interfacing of seven-segment LED
display and generate counting from 0 to 99 with
fixed time delay.

9
To demonstrate use of general purpose port i.e.
Input/ output port of two controllers for data
transfer between them.

10
Interface stepper motor with 8051 and write a
program to move the motor through a given angle
 in clockwise or counter-clockwise direction.

WILSON COLLEGE (AUTONOMOUS) NEP SYLLABUS FOR BSC.I.T.

PROGRAM: FYBSCIT SEMESTER: II

Course:Website
Design(Elective-I) Course Code: WSITCOE121

Teaching Scheme Evaluation Scheme

Continuous
Tutorial
Lectures Practical Credit Internal Semester End
(Hours
(Hours (Hours per Assessment Examination (Marks-
per week)
per week) week) (CIA) (Marks- 60)
40)
2 _ _ 2 40 60
Learning Objectives:
Understand basic concepts of Internet and World Wide Web. Comprehend different HTML
elements that can be used to develop static web pages. Become familiar with concept of
stylesheets and various CSS effects. Peruse JavaScript as a tool to add dynamism to static
HTML pages. Explore how server-side script works on the web.

Course Outcomes:
After the end of the course, the learner will be able to:
Analyze working of Internet. Gain an insight into designing web pages. Use different ways
of styling web pages using CSS. Implement the basics of JavaScript in a web page.

Unit Sub-unit Course/ Unit Title Lecture s

I 1.1 What is Internet? Applications of Internet, E- 3L

mail, Telnet, FTP, E-commerce and Ebusiness.
Internet Service Providers, Domain Name
Server, Internet Address,
1.2 World Wide Web (WWW): World Wide Web 05
and its Evolution, Uniform Resource Locator
12 (URL), Browsers, Common Features of
Browsers, Search Engine, Web Server, HTTP
 Protocol.

HTML:

II 2.1 Introduction, Formatting Text by using Tags, 7

Using Lists, Creating Hyperlinks and
Bookmarks, Redirecting to another URL
CSS:

III 3.1 Implementing Styles using CSS – Stylesheets, 4

Formatting Text and Links using CSS, CSS
Selectors, Changing Background, Adding
Border, Margin and Padding, Setting
Dimensions, Using Inline Container to mark up
a part of a text.
3.2 Arithmetic Operators,Conditional Statements – 4
HTML Page Layout

IV 4.1 Using Layout Elements, Semantic Elements, 4

Creating, Positioning and Formatting Divisions,
Floating Divisions next to each other,
Responsive Web Design, Inline Frames.
4.2 Introduction, Difference between Client-side 3
and Server-side Scripting, JavaScript Variables
and Constants, Data Types.
WILSON COLLEGE (AUTONOMOUS) NEP SYLLABUS FOR BSC.I.T.
PROGRAM: FYBSCIT SEMESTER: II

Course:Digital Course Code: WSITCSE121

Electronics Practicals

Teaching Scheme Evaluation Scheme

 Lectures Practical Continuous Semester End
Tutorial
(Hours per (Hours per Internal Examination
(Hours Credit
week) week) Assessment(CA) (Marks- 60)
per
(Marks- 40)
week)

4 _ 2 40 60

DETAILED SYLLABUS
UNIT Digital Electronics Practical’s Credits
2

Study of Logic gates using IC ( AND, OR, NOT, XOR,

1.
NAND and NOR)
NAND gate as universal gate (Implement AND, OR, NOT,
2
XOR using NAND gates)
NOR gate as universal gate (Implement AND, OR, NOT,
3
XOR, XNOR using NOR gates.)
Verifying De Morgan’s laws.
4

5 Design and implement Half adder and

Full adder.
Implement Adder and Subtractor Arithmetic circuits.
6

7 Design and implement Binary – to – Gray code converter

& Gray – to – Binary code converter.

8 Design and implement Binary – to – BCD code converter

9 Design and implement Binary – to – XS-3 code converter

10 Design and implement 8:3 encoder.

11 Design and implement 3:8 decoder. Implement the given

expression using IC 74138 3:8 decoder.
12 Design and implement 4:1 multiplexer. Study of IC 74153,
74157. Implement the given expression using IC 74151 8:1
multiplexer.

13 Design and implement 1:4 demultiplexer. Study of IC

74139
 Modality of Assessment
Theory Examination Pattern: (for Discipline Specific Core papers)
A. Internal Assessment- 40%- 40 Marks per paper

Sr. Evaluation Type Marks

No.

1 Assignment/ Case study/ 40

field visit report/
presentation/ project
Total 40

A.External Examination- 60%- 60 Marks per paper (for Discipline Specific Core

papers) Semester End Theory Examination:

1. Duration - These examinations shall be of two hours duration.

2. Theory question paper pattern:

a) There shall be 3 questions each of 20 marks with different levels of difficulty.
b) All questions shall be compulsory with at least 50% internal choice within the questions. (For
example, 4 out of 6 sub-questions or 3 out of 6 sub-questions to be solved).

c) All units will be given equal weightage.

Evaluation for Discipline Specific Core Practical Course:

A. Internal Examination: 40%- 40 Marks

Particulars Marks
Regular assessment, performance 40
and journal keeping
Total 40

B. External Examination: 60%- 60 Marks

Particulars Marks
Practical exam 50
 Viva 10
Total 60

PRACTICAL BOOK/JOURNAL

The students are required to perform a minimum number of practicals mentioned in the
syllabus for certification of journal.
The students are required to present a duly certified journal for appearing at the practical
examination, failing which they will not be allowed to appear for the examination.

Examination Pattern: (for Open Elective/Generic Elective) It will be assessment for total
of 60 marks

Sr. Evaluation Type Marks

No.

1 Assignment/ Case study/ field 30

visit report/ presentation/
project
2 Assignment/ Case study/ field 30
visit report/ presentation/
project
Total 60

Examination Pattern: (SEC) Skill Enhancement Course is a practical course.

There will be one single External Examination of 60

Marks

Particulars Marks

Practical exam 50
Viva 10
Total 60