You are on page 1of 51

Chhattisgarh Swami Vivekanand Technical University, Bhilai

Diploma in Information Technology

Semester - III
Scheme of Studies:
Scheme of Studies
S. Board of Course Course (Hours/Week)
No Study Code Titles Credit
L P T
L+T+(P/2)
1 CSE 2000351(022) Operating System with Linux 3 0 0 3

2 IT 2000352(033) Static Web Programming 2 0 0 2

3 CSE 2000353(022) Data Structure 3 0 0 3

4 IT 2000354(033) System Analysis & Design 3 0 0 3


Electronics and
5 2000355(028) Digital Electronics 2 0 1 3
Telecommunication
Operating System with Linux
6 CSE 2000361(022) 0 4 0 2
(Lab)
Static Web Programming
7 IT 2000362(033) 0 2 0 1
(Lab)
8 CSE 2000363(022) Data Structure (Lab) 0 4 0 2
Electronics and
9 2000364(028) Digital Electronics (Lab) 0 2 0 1
Telecommunication
NSS / SPORTS / YOGA /
AS PER CSVTU MINUTES 09HOURS
TECHNICAL
10 ARE ALLOCATED TO MENTIONED
PRESENTATION/
ACITIVITES
LIBRARYACTIVITIES
Total 13 12 1 20

L - Lecture, T - Tutorial, P - Practical


Legend:- Lecture (L) --> CI : Classroom Instruction (Includes different instructional strategies i.e. Lecture and others).
Practical (P) --> LI : Laboratory Instruction (Includes Practical performances in laboratory workshop, field or
other locations using different instructional strategies.
Tutorial (T) --> SL : Self Learning.
Chhattisgarh Swami Vivekanand Technical University, Bhilai
Diploma in Information Technology

Semester - III
Scheme of Examination:
Scheme of Examination
S. Board of Course Course
No Study Code Titles Theory Practical Total
ESE CT TA ESE TA Marks
Operating System with
1 CSE 2000351(022) 70 30 30 0 0 130
Linux
2 IT 2000352(033) Static Web Programming 70 30 30 0 0 130

3 CSE 2000353(022) Data Structure 70 30 30 0 0 130

4 IT 2000354(033) System Analysis & Design 70 30 30 0 0 130


Electronics and
5 2000355(028) Digital Electronics 70 30 30 0 0 130
Telecommunication
Operating System with
6 CSE 2000361(022) 0 0 0 30 50 80
Linux (Lab)
Static Web Programming
7 IT 2000362(033) 0 0 0 30 50 80
(Lab)
8 CSE 2000363(022) Data Structure (Lab) 0 0 0 30 50 80
Electronics and
9 2000364(028) Digital Electronics (Lab) 0 0 0 30 50 80
Telecommunication

10 Technical Presentation 0 0 0 0 30 30

350 150 150 120 230 1000


Total
ESE : End of Semester Exam, CT: Class Test, TA: Teachers Assessment
Legend :- PRA :Process Assessment, PDA : Product Assessment.
Diploma in Information Technology Semester-III

I. Course Curriculum Detailing (Semester- III)

CSVTU, Bhilai- NITTTR, Bhopal Page 1


Diploma in Information Technology Semester-III

A) Course Code : 2000351(022)


B) Course Title : Operating System with Linux
C) Pre- requisite Course Code and Title : Computer Fundamentals and its Applications
D) Rationale:
This course will enable the students to use various services of an operating system. The students will
comprehend the functions of structures, Processes and CPU scheduling, memory management, file
system, mass storage structure etc. of an operating system. The students will also install Linux
Operating System and various services, setup file system, and use shell programming for performing
different tasks.

E) Course Outcomes

CO-1 Identify different types of operating System for various business and industrial applications.
CO-2 Analyze various process and CPU management concepts of an OS.
CO-3 Compare memory management concepts including logical memory, virtual memory and
physical memory.
CO-4 Use files management and directory structure concepts to organize a disk.
CO-5 Install and use Linux operating System.
F) Scheme of Studies:

Scheme of Studies (Hours/Week)


Board of Course Course L P T Total Study Total
Study Co d e Title Hours (L+T+P) Credits(C)
(L+T+P/2)
Computer Operating
2000351
Science and
(022)
System with 3 4 0 7 5
Engineering L in u x
Legend: Lecture (L) and Tutorial (T) and Practical (P)
G) Scheme of Assessment:
Board of Course Course Scheme of examination
Study Co d e Title Total Marks
Theory Practical Total Marks
ESE CT TA ESE TA
Computer 2000351 Operating System 70 30 30 30 50 210
Science and (022) with Linux
Engineering

H) Course-Curriculum Detailing:
This course curriculum detailing depicts learning outcomes at course level and
session level and their attainment by the students through Classroom Instruction (CI), Laboratory Instruction
(LI), Sessional Work (SW) and Self Learning (SL). Students are expected to demonstrate the attainment of
Session Outcomes (SOs) and finally Course Outcomes (COs) upon the completion of course. Convert unit of the
given physical quantity from one unit system to other.

CSVTU, Bhilai - NITTTR, Bhopal Page 2


Diploma in Information Technology Semester-III

CO-1 : Identify different types of operating systems for various business and industrial applications.

Session Outcomes (SOs) Laboratory Instruction Class room Instruction (CI) Self Learning (SL)
(LI)
SO1.1 Identifyneed of LE1.1 Identify various Unit – I :Operating System Concepts 1.1 Case study
Operating System. versions of Linux 1.1 Need of Operating System 1.1.1. Linux Operating
SO1.2 Compare different O p e r a t in g S ys t em 1 . 2 S t r u ct u r e o f O p e r a t in g Sys t em System features
structure of through web 1.2.1 System Components 1.1.2.Windows Operating
Operating System. search. 1.2.2 System Calls System features
1 . 2 . 3 Sy s t em St r u c t u r e
SO1.3 List different types LE1.2 Compare basic
of Operating w o r k in g o f L inux 1.3 Operating System types
Operating 1.3.1 Batch
System 1.3.2 Multiprogramming
Systemand
SO1.4 List different Windows 1.3.3 Multitasking
services provided Operating 1.3.4 Multiuser
by Operating System. 1.3.5 Time Sharing
System 1.3.6 Real Time
1.4 Operating System Services
SW-1 Suggested Sessional Work (SW):
a. Assignments:
1.What are the three main purposes of an operating system?
2. Describe need and structure of Operating System.
3. Compare different types of Operating System.
b. Mini Project:
1. Prepare a report on features of different operating system i.e. Linux and Windows
c. Other Activities (Specify):
1. Seminar on Different types of Linux Operating System and its purpose.

CO-2 Analyze various process and CPU management concepts of an OS.


Session Outcomes (SOs) Laboratory Instruction (LI) Class room Instruction (CI) Self Learning (SL)

SO2.1 Identify process Unit – II 2.1 Different operations


states of Operating Process & CPU Management on processes
System. 2.1 Process Concept 2.2 Real time situations
SO2.2 Compare C PU 2.1.1Programmers view of of deadlock
scheduling Process
algorithms. 2.1.2 Process State
2.1.3Process Control Block
SO2.3 Classify deadlock 2.1.4 Process Scheduling
handling 2.2 CPU Scheduling
techniques in 2.2.1Schedulers
Operating System. 2.2.2Scheduling Criteria
SO2.4 Apply Deadlock 2.2.3Scheduling Algorithms
Detection, 2.3 Deadlock
Prevention and 2.3.1Basic Concepts
Avoidance 2.3.2Deadlock Detection
Algorithm in given 2.3.3 Deadlock Prevention
example. 2.3.4 Deadlock Avoidance

SW-2 Suggested Sessional Work (SW):


a. Assignments:
1.Compare different processor scheduling algorithm.
2.Describe deadlock avoidance and recovery algorithms.
b. Mini Project: -

CSVTU, Bhilai - NITTTR, Bhopal Page 3


Diploma in Information Technology Semester-III

c. Other Activities (Specify):


1.Seminar on different processor scheduling algorithms in an O.S.
2.Seminar on different deadlock related algorithms in an O.S.

CO- 3 Compare memory management concepts including logical memory, virtual memory and physical
memory.
Session Outcomes Laboratory Class room Instruction (CI) Self Learning
(SOs) Instruction (LI) (SL)
SO3.1 Classify Unit – III 3.1Storage
variousmemoryma Memory Management Structure
nagement 3.1 Need of Memory Management 3.2Storage
techniques in 3.2 Contiguous Allocation Hierarchy
Operating System. 3.2.1 Partitioned Memory
SO3.2 Allocation
Differentiateconti 3.2.2 Fixed & Variable Partitioning
guous and non- 3.2.3 Swapping
contiguous 3.2.4Relocation
memory 3.2.5Protection and Sharing
allocation. 3.3 Noncontiguous Allocation
3.3.1 Paging
SO3.3 Differentiate 3.3.2 Segmentation
physical and 3.4 Virtual Memory
virtual memory. 3.4.1 Demand Paging
SO3.4 Apply different 3.4.2 Page Replacement
Memory Algorithms
Replacement 3.4.3 Thrashing
Algorithms in
given example.
SW-3 Suggested Sessional Work (SW):
a. Assignments:
1. Describe different memory management strategies in an O.S.
2. Differentiate physical and virtual, primary memory of an OS.
b. Mini Project: -
c. Other Activities (Specify):
1. Seminar on different memory management strategies

CO- 4Use file management and directory structure concepts to organize a disk.

Session Outcomes (SOs) Laboratory Class room Instruction (CI) Self Learning
Instruction (LI) (SL)
SO4.1Classifyfile Unit – IV 4.1 LINUX File
management File Management System
concepts in 4.1 File Management 4.2 File-
Operating System 4.1.1 File Concept and Access System
SO4.2Illustrate directory Methods Mounting
structure of 4.1.2 User view of File System
Operating System 4.1.3 Attributes and Operations
4.1.4 File System Design
SO4.3Classifydisk 4.1.5 Disk Space
organization 4.2 Directory Structure
mechanism of 4.3 Disk Organization
Operating System. 4.3.1 Physical Structure
SO4.4 Apply file system 4.3.2 Logical Structure
security 4.3.3 Addressing
mechanism in 4.3.4 Disk Scheduling

CSVTU, Bhilai - NITTTR, Bhopal Page 4


Diploma in Information Technology Semester-III

Operating System. 4.4 Security and Protection Mechanism

SW-4 Suggested Sessional Work (SW) :


a. Assignments:
1. Describe Directory Structure of Operating System.
2. Describe Disk Organization of Operating System.
3. Describe Implement file system security
b. Mini Project: -
c. Other Activities (Specify):
1. Seminar on Directory structure and Disk organization mechanism of Operating System.

CO- 5Install and use Linux operating System.


Session Outcomes (SOs) Laboratory Instruction (LI) Class room Instruction (CI) Self Learning (SL)

SO5.1Perform LE5.1 Install and Configure Unit – V: Linux Basics 5.1 Features of Linux
Installationand L in u x Operating 5.1 Overview of Linux 5.2 Various LINUX
administration of LINUX System. 5.2 Installation and Upgrade Shells
OS LE5.2 Execute Linux 5.3 System Administration
SO5.2Perform different commands: w h o, 5.4 Introduction to Shell
LINUX commands. who am i, tty, pwd, and Commands:
cd, mkdir, rmdir, ls, who, who am i, tty, pwd, cd,
SO5.3 Apply different mkdir, rmdir, ls, cat, cp,
features of vi editor for cat, cp, rm, mv, wc,
split, cmp, comm, rm, mv, wc, split, cmp,
creating document. comm, diff, head, tail,
diff, head, tail, grep,
SO5.4 Construct shell s o rt , ln, grep, sort, ln,
scripts for a given chmod,chown, chmod,chown, chgrp,
purpose. chgrp, pr, lp, expr, pr, lp, expr, man,help,
man,help, pipes and pipes and I/O
I/O redirectors, tee, redirectors, tee, ps.
ps. 5.5 Edit files with “vi” editor
5.6 Linux
LE5.3 Prepare a documents 5.6.1 Shell Concept
using ‘vi’editor. 5.6.2 Basic Shell Scripts
LE5.4 Develop shell scripts
for a given purpose.
Legend: CI: Classroom Instruction (Includes different instructional strategies i.e. Lecture (L) and Tutorial (T)
and others) , LI : Laboratory Instruction (Includes Practical performances in Laboratory, Workshop,
field or other locations using different instructional strategies) SL: Self Learning
SW-5 Suggested Sessional Work (SW):
a. Assignments:
1. Describe different basic Linux commands.
2. Describe different shell commands in a script.
b. Mini Project: -
c. Other Activities (Specify):
1. Seminar based presentation on basic Linux commands and shell commands in a script.

Note: Performance under LaboratoryandSessional work may appear in more than one COs/SOs.

CSVTU, Bhilai - NITTTR, Bhopal Page 5


Diploma in Information Technology Semester-III

I) Suggested Specification Table (For ESA of Classroom Instruction CI+SW+SL):


Unit Total
Unit Title
Number Marks
I Operating System Concepts 14
II Process&CPU Management 14
III Memory Management 14
IV File Management 14

V Linux Basics 14
Total 70
J) Suggested Specification Table (For ESA of Laboratory Instruction*):
Note: The student at the end of semester examination of 30Marks; has to undertake any ONE of the listed
practical’s.

Laboratory
Instruction Short Laboratory Experiment Title
Number

a) Install & test different types of Operating System & compare its features.
1 b) Execute who, who am i, tty, pwd, cd commands
c)Modes of vi editor

a)Execute mkdir, rmdir, ls, cat, cp, rm, mv, wc commands


b) Creating and saving files using vi editor
2
c) Create a shell script to print ”Hello”.
d) Create a Shell script to read and display content of a file.
a) Execute split, cmp, comm, diff, head, tail, grep, sort commands
3 b)perform Cursor movement commands in vi editor
c) Create a Shell script to read from command line.
a)Execute chmod ,man ,help commands
4 b) Create a Shell script to append content of one file to another
c) Cut and paste commands in vi editor. 30 Marks are
a)Execute Commands using pipes and I/O redirectors allocated for
b) Find and replace commands in vi editor performance
5 under ESA
c) Create a Shell script to accept a string in lower case letters from a user, &
convert to upper case letters.
a)Execute ps command with all options
6 b) Create a Shell script to find numbers of characters, words & lines of a
given input file.
a)execute apt-get install, apt-get remove commands
7 b) Create a Script to reverse a string and display it.
c) Create a Script to reverse a string and display it.
a) Create a Script to check a string is palindrome.
b) Create a Shell script to add, subtract, multiply and division of two
8 numbers.
c) Create a shell script to reverse the digits of a given 5-digit number. (foreg. ,
if the no. is 57429 then answer is 92475).
* Assessment rubric, process and product check list with rating scale need to be prepared by the course wise
teachers for each experimentfor conduction and assessment of laboratory experiments /practical’s
Legend: PRA: Process Assessment,PDA: Product Assessment

CSVTU, Bhilai - NITTTR, Bhopal Page 6


Diploma in Information Technology Semester-III

K) Suggested Instructional/Implementation Strategies:


1. Improved Lecture
2. Tutorial
3. Case Method
4. Group Discussion
5. Industrial visits
6. Industrial Training
7. Field Trips
8. Portfolio Based Learning
9. Role Play
10. Demonstration
11. ICT Based Teaching Learning (Video Demonstration, CBT, Blog, Face book, Mobile)
12. Brainstorming
13. Others

L) Suggested Learning Resources:


(a) Books :
S. No. Title Author Publisher Edition & Year
James Peterson Wesley JOHN WILEY &
1 Operating System Concepts 2017 or latest
Abraham Silberschatz SONS. INC
2 Unix Concepts And Application Sumitabha Das MGH 2017 or latest
3 Operating systems Dhamdhere MGH 2017 or latest
4 Modern Operating System Andrew Tanenbaum PH I 2017 or latest
Pearson 2017 or latest
5 Operating Systems SibsankarHaldar
Education
6 Operating System Milan Milenkovic MGH 2017 or latest
Operating Systems concept 2017 or latest
7 Dhananjay M. MGH
based approach (3rd Edition)
Linux –Application and 2017 or latest
8 Ashok Kumar Harnal TMH
administration,

(b)Open source software and websiteaddress:.


1. Operating System concepts: http://nptel.iitm.ac.in/courses/Webcourse-contents/IISc-
ANG/Operating%20Systems/New_index1.html .
2. Linux basics: www.freeos.com/guides/lsst .
3. Linux basics: www.linuxcommand.org/writing_asell_scripts.php .
4. Linux basics: www.distro.ibiblio.org/damnsmall/current/dsl-4.4.10-embedded.zip

(c)Others:
1. Learning Packages.
2. Lab Manuals.
3. Manufacturers’ Manual
4. Users’ Guide

M) List of Major Laboratory Equipment and Tools:


S. No. Name of Equipment Broad Relevant Experiment
Specifications Number
Linux based Host Free & Open Source LE1.1-LE1-2
1 machines Software or Open source LE5.1-LE5-4
Computers latest hardware LE1.1-LE1-2
2
configuration LE5.1-LE5-4

CSVTU, Bhilai - NITTTR, Bhopal Page 7


Diploma in Information Technology Semester-III

N) Mapping of POs & PSOs with COs:

Programme Outcomes Programme


Course (POs) Specific Outcomes
Outcomes (PSOs)
(COs)
Titles Basi Disci Experi Engin The Envir Ethic Indivi Co m m Life PSO-1 PSO-2
c pline m en ts eerin Engin onm e s dual unicati Long M o d er n Manage
kn o kn o & g eer & nt & PO-7 & on learni Informa Informa
wle wled Practic Tools Societ Sustai Team PO-9 ng tion tion
dge ge e PO-4 y nabili wo r k PO-10 Technol Technol
PO- PO-2 PO-3 PO-5 ty PO-8 ogy ogy
1 PO-6 Usage Process
CO-1: Identify different types of operating
System for various business and industrial 3 3 1 1 2 1 1 2 1 1 2 1
applications.
CO-2: Analyze various process and CPU
3 3 1 1 2 1 1 2 1 1 2 2
management concepts of an OS.
CO-3: Compare memory management
concepts including logical memory, virtual 3 3 1 1 2 1 1 2 1 1 2 2
memory and physical memory.
CO-4: Use files management and directory
3 3 1 1 2 1 1 2 1 1 2 2
structure concepts to organize a disk.
CO-5: Install and use Linux operating System.
3 3 3 3 3 1 1 3 2 2 3 3

Legend: 0- No correlation, 1- Low, 2- Medium, 3- High

CSVTU, Bhilai - NITTTR, Bhopal Page 8


Diploma in Information Technology Semester-III

O) Course Curriculum Map:


POs & PSOs COs No.& Title SOs No. Laboratory Classroom Instruction (CI) Self Learning
No. Instruction (SL)
(LI)

PO1-PO5, CO-1Identify different types of SO1.1 LE1.1 Unit 1.0 Operating System
PO8-PO10 Operating Systems for various - - Co n c e p t s SL1.1
PSO1-PSO2 business and industrial applications. SO1.4 LE1.2
PO1-PO2, CO-2Analyze various process SO.2.1 Unit 2.0 Process & CPU
PO5,PO8- management concepts including - Management
PO10 scheduling, deadlocks used for - SL2.1, SL2.2
SO2.4
PSO1-PSO2 effective management of system.
PO1-PO2, CO-3Demonstrate m em o r y SO.3.1 Unit 3.0Memory
PO5,PO8- management concept including - Management
PO10 logical memory, virtual memory and - SL3.1,SL3.2
SO3.4
PSO1-PSO2 physical memory
PO1-PO2, CO-4Apply file management and Unit 4.0File Management
SO4.1
PO5,PO8- Directory structure concept to
- - SL4.1, SL4.2
PO10 organize disk
SO4.4
PSO1-PSO2
PO1-PO5, CO-5Execute Linux commands and SO5.1 LE5.1 Unit 5.0 Linux Basics
PO8-PO10 shell script effectively. - - SL5.1,SL5.2
PSO1-PSO2 SO5.4 LE5.4
Legend:CI: Classroom Instruction (Includes different instructional strategies i.e. Lecture (L) and Tutorial (T) and others) , LI : Laboratory Instruction
(Includes Practical performances in Laboratory, Workshop, field or other locations using different instructional strategies) SL: Self Learning

CSVTU, Bhilai - NITTTR, Bhopal Page 9


Diploma in Information Technology Semester-III

Course Curriculum Detailing (Semester- III)

CSVTU, Bhilai- NITTTR, Bhopal Page 10


Diploma in Information Technology Semester-III

A) Course Code : 2000352(033)


B) Course Title : Static Web Programming
C) Pre- requisite Course Code and Title : CFA
D) Rationale :

In Today’s era various technologies are available for developing web-based applications. These
technologies can be used for developing personal, organizational, educational websites and business
applications in various fields Therefore it is important for diploma Studentsto develop competency in
using Hyper Text Markup Language(HTML) technologies for developing professional static websites.
This course is the basis for developing dynamic web applications which will be taught in latter
semesters.

E) Course Outcomes:

CO-1 Define the principle and basics of Web page design


CO-2 Visualize the basic concept of HTML
CO-3 Recognize the elements of HTML.
CO-4 Introduce basics concept of CSS.
CO-5 Develop the concept of web publishing

F) Scheme of Studies:

Scheme of Studies
Board of Course Course (Hours/Week)
Study Co d e Title L P T Total Study Total
Hours (L+P+T) Credits(C)
(L+P)
Information 2000352(033) Static Web 2 2 0 4 3
Technology Programming

G) Scheme of Assessment:
Scheme of examination
Board of Course Course Total Marks
Study Co d e Title Theory Practical Total
Marks
ESE CT TA ESE TA

Information 2000352(033) Static Web 70 30 30 30 50 210


Technology Programming

H) Course-Curriculum Detailing:
This course curriculum detailing depicts learning outcomes at course level and session level and their
attainment by the students through Classroom Instruction (CI), Laboratory Instruction (LI), Sessional Work
(SW) and Self Learning (SL). Students are expected to demonstrate the attainment of Session Outcomes
(SOs) and finally Course Outcomes (COs) upon the completion of course.
Convert unit of the given physical quantity from one unit system to other.

CSVTU, Bhilai- NITTTR, Bhopal Page 11


Diploma in Information Technology Semester-III

CO-1 : Define the principle and basics of Web page design


Session Outcomes Laboratory Instruction (LI) Class room Instruction (CI) Self Learning
(SOs) (SL)

SO1.1 Explain LE1.1 Search a particular Unit 1.Web Design 1.1 Search
website basics. Website.Open a website.Go Principles and Basics various web
on home page and then developmen
1.1 Web Design Principles
t tools
SO1.2 Explain overall ccess various links on the
a 1.1.1 Basic principles involved
website home page.Traverse various in developing a web site
development p ages and could navigate 1.1.2 Planning process
usability and om one page to another.
fr 1.1.3 Five Golden rules of web
accessibility designing
features. 1.1.4 Designing navigation bar
1.1.5 Page design
1.1.6 Home Page Layout
1.1.7 Design Concept.
1.1 Basics in Web Design
1.2.1 Brief History of Internet
1.2.2 What is World Wide Web
1.2.3 Why create a web site
1.2.4 Web Standards
1.2.5 Audience
requirement.

SW-1 Suggested Sessional Work (SW):

a. Assignments:
1. Presentation on the definition of-
1.1 What is website?
1.2 What is web page?
1.3 What is static web page?
1.4 Various navigation techniques
b. Mini Project:

c. Other Activities (Specify):


1. Find out different attributes used in your college web site.

CO-2 Visualize the basic concept of HTML

Session Outcomes Laboratory Instruction (LI) Class room Instruction (CI) Self Learning (SL)
(SOs)

SO 2.1 Design structure LE2.1 Design a static Unit 2 Introduction to


of HTML document webpage which HTML 2.1 Explore
contain description of Preserve
SO 2.2 Design basic
your college. 2.1 What is HTML formatting.
html document using 2 . 2 Explore
basic tags. 2.2 HTML Documents
Subscript text
2.3 Basic structure of an
,Superscript
HTML document text, Strikeout

CSVTU, Bhilai- NITTTR, Bhopal Page 12


Diploma in Information Technology Semester-III

Session Outcomes Laboratory Instruction (LI) Class room Instruction (CI) Self Learning (SL)
(SOs) 2.4 Creating an HTML
document
2.5 Mark up Tags
2.6 Heading-Paragraphs
2.7 Line Breaks
2.8 HTML Tags.

SW-2 Suggested Sessional Work (SW) :

a. Assignments:
1. Design a web page using h1-h6 tag.

b. Mini Project:
1. Construct a web page using basic HTML tags.

CO-3 Recognize the elements of HTML.


Session Outcomes Laboratory Instruction (LI) Class room Instruction (CI) Self Learning
(SOs) (SL)

SO3.1 Design a static LE 3.1 Insert an image of Unit 3.0Elements of HTML 3.1 Set image
Webpage using width 200px, height 400px at 3.1 Introduction to border and
HTML image, link, list, the centre of the webpage. elements of HTML alignment.
table. LE 3.2 Define a Table with 5 3.2 Working with Text 3.2 Develop
rows and 4 column having 3.3 Working with Lists, Nested list.
SO3.2 Design a static
border of 2px Tables and Frames 3.3 Create
web page which
contains frames. 3.4 Working with Image as a
Hyperlinks, ILm
E-a3g.1es and link.
SO3.3 Design form for Multimedia 3.4 Design a
particular application . 3.5 Working with Forms Table
and controls. having cell
Padding
3.5 Design a
Nested
Table

SW-3 Suggested Sessional Work (SW) :

a. Assignments:
1. Find out and write different inline, external and internal CSS style used in your college website.

b. Mini Project:
1. Add a faculty page in your above assignment and the page contain name, designation,
department, qualification, phone number and passport size photo in a tabular form.

CSVTU, Bhilai- NITTTR, Bhopal Page 13


Diploma in Information Technology Semester-III

c. Other Activities (Specify):


1. Comparative study of four different college website.

CO-4 Introduce basics concept of CSS.

Session Outcomes Laboratory Instruction (LI) Class room Instruction (CI) Self Learning
(SOs) (SL)

LE4.1Set background Unit 4.Introduction to 4.1 Compare


SO4.1 .Design home image on the page Cascading Style Sheets Grouping
page using CSS designed in the assignment 4.1 Concept of CSS Selectors
of previous chapter using 4.2 Creating Style Sheet with ID
SO4.2Design external, internal and 4.3 CSS Properties selector
different style using
inline CSS. 4.4 CSS Styling(Background, Text and class
ID selector, Element
LE4.2 design a web page Format, Controlling Fonts) selector
selector and class containing table which is 4.5 Working with block elements 4.2 Define
selector responsive having control and objects body using
SO4.3 Design space between content 4.6 Working with Lists and CSS height,
external style sheets. and border ,having its rows Tables width.
SO4.4 Design zebra stripped ,and the 4.7 CSS Id and Class 4.3 Apply
different properties content of the table should 4.8 Box Model(Introduction, Margin in
of table such as be horizontally or vertically Border properties, Padding row,colum
Boarder, Text aligned. Properties, Margin properties) n ,table.
alignment, margin 4.9 CSS Advanced(Grouping,
and Padding using Dimension, Display,
CSS Positioning, Floating,
Align,Pseudo class, Navigation
SO4.5 Design a
Bar,Image Sprites, Attribute
responsive table
sector)
using CSS property
4.10 CSS Color
4.11 Creating page Layout and
Site Designs.

SW-4 Suggested Sessional Work (SW) :

a. Assignments:
1.Design a web page with a table in it and the content of the table is floating between the table
border with td and th specifically designed.

b. Mini Project:
1. Change all the internal CSS style to external CSS and vice versa in the assignment of this unit.
2. Faculty Web page that you have designed in your mini project ,add Zebra strips to rows ,margin
,border, padding using CSS in the table.

c. Other Activities (Specify):


1. Give a presentation on all the advantage and disadvantage of internal and external CSS.
2. Give presentation on advantage of using table in CSS.

CSVTU, Bhilai- NITTTR, Bhopal Page 14


Diploma in Information Technology Semester-III

CO- 5 Develop the concept of web publishing


Session Outcomes Laboratory Instruction (LI) Class room Instruction (CI) Self Learning (SL)
(SOs)

SO5.1Able to publish LE5.1host web site Unit 5. Introduction to 5.1 Designs websites
web page in server Web Publishing or Hosting / web content and
SO5.2Able to upload 5.1 Creating the Web Site then deploys it to a
files in server 5.2 Saving the site hosting server.
5.3 Working on the web 5.2 Compare web
site publishing with web
5.4 Creating web site hosting
structure
5.5 Creating Titles for web
pages
5.6 Themes-Publishing web
sites.

SW-5 Suggested Sessional Work (SW) :

a. Assignments:
1. Write process of web publishing.

b. Mini Project:
1. Design a static web site for college like student management system , hostel management
system etc.

CSVTU, Bhilai- NITTTR, Bhopal Page 15


Diploma in Information Technology Semester-III

I) Suggested Specification Table (For ESA of Classroom Instruction CI+SW+SL):

Unit
Total
Numb Unit Titles
Marks
er
I Web Design Principles and Basics 14
II Introduction to HTML 14
III Elements of HTML 14
IV Introduction to Cascading Style Sheets 14
V Introduction to Web Publishing or Hosting 14
Total 70

J) Suggested Specification Table (For ESA of Laboratory Instruction*):

Laboratory
Instruction Short Laboratory Experiment Title
Number
1 Search a particular Website. Open a website. Go on home page
and then access various links on the home page .Traverse various
pages and could navigate from one page to another.

2 Design a static webpage which contain description of your


college.
3 Insert an image of width 200px, height 400px at the centre of the
webpage.
4 Define a Table with 5 rows and 4 column having border of 2px
5 Design a web form for calculator for multiplication, division,
subtraction and addition 30 Marks are
6 Set background image on the page designed in the assignment of allocated for
previous chapter using external, internal and inline CSS. performance
7 Set background image on the page designed in the assignment of under ESA
previous chapter using internal CSS.
Set background image on the page designed in the assignment of
previous chapter using inline CSS.

8 design a web page containing table which is responsive having


control space between content and border
9 design a web page containing table which is responsive having its
rows zebra stripped
10 design a web page containing table which is responsive having
horizontally or vertically aligned
11 Design horizontal and vertical menu using list and link using CSS.
12 Design a webpage using image as a link and different hyper link
property

CSVTU, Bhilai - NITTTR, Bhopal Page 16


Diploma in Information Technology Semester-III

K) Suggested Instructional/Implementation Strategies:

1. Improved Lecture
2. Tutorial
3. Case Method
4. Group Discussion
5. Industrial visits
6. Industrial Training
7. Field Trips
8. Portfolio Based Learning
9. Role Play
10. Demonstration
11. ICT Based Teaching Learning (Video Demonstration, CBT, Blog, Face book, Mobile)
12. Brainstorming
13. Others

L) Suggested Learning Resources:


(a) Books :
S. Title Author Publisher Edition & Year
No.
1 HTML & CSS Design and Jon Duckett John Wiley & 2011
build Websites Sons, 2011
2 Complete Reference Thomas A pawell TM H 2010
3 Learning HTML Ramesh Bangia Learning series 2010

(b)Open source software and websiteaddress :


1.https://www.w3schools.com
2.https://www.tutorialspoint.com/html/

(c)Others:
1.http://wtf.tw/ref/duckett.pdf

M) List of Major Laboratory Equipment and Tools:

S. Name of Equipment Broad Relevant Experiment


No. Specifications Number
LE1.1
LE2.1
1 Computer System Latest configuration LE3.1-LE3.2
LE4.1-LE4.2
LE5.1
LE1.1
LE2.1
2 Browser latest LE3.1-LE3.2
LE4.1-LE4.2
LE5.1

CSVTU, Bhilai - NITTTR, Bhopal Page 17


Diploma in Information Technology Semester-III

N) Mapping of POs & PSOs with COs:

Course Programme Outcomes Programme


Outcomes (POs) Specific
(COs) Outcomes
(PSOs)
PO-1 PO-2 PO-3 PO-4 PO-5 PO-6 PO-7 PO-8 PO-9 PO-10 PSO-1 PSO-2
Basic Discipline Experiments Engineering The Environment Ethics Individual Communic Life-long
knowledge knowledge and practice Tools engineer an d and team ation learning
and society sustainability work
CO-1 To Define the principle
and basics of Web 3 3 2 2 2 1 2 1 1 2 2 3
page design.
CO-2 Visualize the basic
2 2 3 2 3 1 1 2 2 2 3 2
concept of HTML.
CO-3 Recognize the elements
of HTML. 2 2 3 2 2 1 2 2 2 2 3 2

CO-4 Introduce basics concept


of CSS. 2 2 3 2 2 1 1 2 2 2 2 3

CO-5 Develop the concept of


web publishing. 2 2 2 2 2 1 2 2 2 2 3 2

CSVTU, Bhilai - NITTTR, Bhopal Page 18


Diploma in Information Technology Semester-III

O) Course Curriculum Map:

Laboratory Instruction Classroom Instruction Self Learning


POs & PSOs No. COs No. & Titles SOs No.
(LI) (CI) (SL)
PO - 1, 2, 3, 4, 5, SO1.1 LE1.1
CO-1 To Define the principle and Unit-1.0 Web Design Principles and
7, 8, 9, 10 - -
Basics SL1.1 – 1.2
basics of Web page design. SO1.5
PSO – 1, 2
PO - 1, 2, 3, 4, 5, SO2.1 LE2.1
7, 8, 9, 10 CO-2 Visualize the basic concept of - - Unit-2.0Introduction to HTML
SL2.1 – 2.3
HTML. SO2.5
PSO – 1, 2
PO - 1, 2, 3, 4, 5, SO3.1 LE3.1
7, 8, 9, 10 CO-3 Recognize the elements of - - Unit-3.0 Elements of HTML
SL3.1 – 3.8
HTML. SO3.6 LE3.2
PSO – 1, 2
PO - 1, 2, 3, 4, 5, SO4.1 LE4.1
CO-4 Introduce basics concept of Unit-4.0 Introduction to Cascading
7, 8, 9, 10 - -
Style Sheets SL4.1 – 4.2
CSS. SO4.4 LE4.2
PSO – 1, 2
PO - 1, 2, 3, 4, 5, SO5.1 LE5.1
CO-5 Develop the concept of web Unit-5.0Introduction to Web
7, 8, 9, 10 - -
publishing. SO5.4
Publishing or Hosting SL5.1
PSO – 1, 2

CSVTU, Bhilai - NITTTR, Bhopal Page 19


Diploma in Information Technology Semester - III

Course Curriculum Detailing (Semester- III)

CSVTU, Bhilai - NITTTR, Bhopal Page 20


Diploma in Information Technology Semester - III

A) Course Code : 2000353(022)


B) Course Title : Data Structure
C) Pre- requisite Course Code and Title : Basic of C programming
D) Rationale :
This course will enable diploma engineers to learn logical and mathematical model of
storing and organizing data in a particular way in a computer. Methods and techniques of data
structures are widely used in efficient problem solving and application programming. The study
of data structure helps the students in developing logical and structured programs.

E) Course Outcomes:
CO-1 To manipulate Linear Data Structure using C Programming.
CO-2 Apply Linear Data Structure Stack and Queue in different application.
CO-3 Develop programs in ‘C’ using Pointers, structure and Union for accessing memory.
CO-4 Perform basic operation of insertion, deletion and searching on Linked list.
CO-5 Perform basic operation of insertion, deletion and searching on graph and tree.
F) Scheme of Studies:

Scheme of Studies (Hours/Week)


Course L P T Total Study Total
Board of Study Course Title
Co d e Hours (L+T+P) Credits(C)
(L+T+P/2)
Computer
2000353 Data
Science &
(022) Structure
3 4 0 7 5
Engineering

Legend: Lecture (L) and Tutorial (T) and Practical (P)

G) Scheme of Assessment:
Board of Course Course Scheme of examination
Study Co d e Title Total Marks
Theory Practical Total Marks
ESE CT TA ESE TA
Computer 2000353 Data Structure 70 30 30 30 50 210
Science & (022)
Engineering

H) Course-Curriculum Detailing:
This course curriculum detailing depicts learning outcomes at course level and session
level and their attainment by the students through Classroom Instruction (CI),
Laboratory Instruction (LI), Sessional Work (SW) and Self Learning (SL). Students are
expected to demonstrate the attainment of Session Outcomes (SOs) and finally Course
Outcomes (COs) upon the completion of course.
Convert unit of the given physical quantity from one unit system to other.

CSVTU, Bhilai - NITTTR, Bhopal Page 21


Diploma in Information Technology Semester - III

CO-1 To manipulate linear Data Structure using ‘C’ programming.


Session Outcomes Laboratory Instruction Class room Instruction Self Learning
(SOs) (LI) (CI) (SL)
SO1.1 Describe declaring LE1.1 Develop a program in Unit-1.0 Introduction to 1.1 Advantages
and initializing of ‘C’ to display list of data structure and Array of array
One-Dimensional values in reverse order in ‘C’ 1.2 Multiplicati
Array with LE1.2 Develop a program in 1.1 Introduction to data on
example. ‘C’ to perform addition structure operations
SO1.2 Describe declaring of all elements of a one 1.2 Type of data Structure on array
and initializing of dimensional array. 1.2.1 Primitive and Non
Multi-Dimensional LE1.3 Develop a program in Primitive data
Array with ‘C’ to perform Addition Structure
example. of two square matrix. 1.2.2 Linear And Non
SO1.3 Apply various LE1.4 Develop a program in Linear Data
matrix operations in ‘C’ to perform Structure
‘C’ transposition of square 1.3Declaring and
SO1.4 Describe declaring matrix. initializing One-
and initializing of LE1.5 Develop program in ‘C’ Dimensional Array
String in ‘C’ with an to reverse a given string. and array Operations-
example. LE1.6 Develop a program in Insertion, Searching
SO1.5 Compare ‘C’ to count number of 1.4 Multi-Dimensional
Stringand character characters in a given Array and its
array in ‘C’ with an string. Operations- Matrix
example LE1.7 Develop a program in operations
‘C’ to count number of 1.5 Drawbacks of Linear
words in a string of Arrays
sentence. 1.6 Introduction character
array and string.
SW-1 Suggested Sessional Work (SW):
a. Assignments:
i. Describe one dimensional array and two dimensional arrays in ‘C’ with examples.
ii. Develop a program in ‘C’to search a given number in one dimensional array.
iii. Develop a program in ‘C’ to print even & odd numbers in square matrix.
iv. Develop a program in ‘C’ to concatenation two given strings.
b. Mini Project:
i. Develop a program in ‘C’ that performs inverse of square matrix.
ii. Develop a program in ‘C’ on to check whether a string is palindrome or not.
c. Other Activities (Specify):
i. A seminar on different dimension(s) of array in ‘C’.
ii. A seminar on ‘use of String handling functions’.

CSVTU, Bhilai - NITTTR, Bhopal Page 22


Diploma in Information Technology Semester - III

CO-2ApplyLinear Data Structure Stack and Queue in different application.


Session Laboratory Instruction Self Learning
Class room Interaction(CI)
Outcomes(SOs) (LI) (SL)
SO2.1Identify LE2.1Evaluate Unit 3.0 : Stack and Queue
Infix 2.1Expression
expression expression using
2.1 Introduction to stack evaluation
evaluation of stack. 2.2 Implementation of stack 2.2Recursion
stack LE2.2Convert Infix
2.3 Operations on Stack 2.3Compare
SO2.2Performed expression to 2.3.1 Push single-
Various postfix expression.2.3.2 Pop ended,
operation on LE2.3Convert Infix
2.4 Application of Stack double-
Stack Data expression to prefix 2.4.1 Expression ended
Structure expression. Evaluation queue
SO2.3List various LE2.4Implement single 2.4.2 Infix to Postfix
applications of ended queue using 2.4.3 Infix to Prefix
stack array. 2.4.4 Recursion
SO2.4 Implement LE2.5Implement double 2.5 Introduction to Queue
Different type of ended queue using 2.6 T ypes of queue
Queue Data array. 2.6.1 Single Ended Queue
structure. 2.6.2 Circular Queue
SO2.5 Describe various LE2.6Implement circular 2.6.3 Double Ended Queue.
applications of queue using array. 2.7 Implementation of Queue
queue 2.8 Application of Queue
SW-2 Suggested Sessional Work (SW):
a. Assignments:
1. Convert an expression (a + b * c) into postfix
2. Write advantage of double-ended queue and circular queue over single ended queue.
b. Mini Project:
I. Implement tower of Hanoi problem.
c. Other Activities (Specify):
I. Seminar on "recursion"

CO-3 Develop program in ‘C’ using Pointers, structure and Union for accessing memory.

Session Outcomes Laboratory Instruction Class room Instruction SelfLearning


(SOs) (LI) (CI) (SL)
SO3.1 Describe LE3.1 Develop a program Unit 3.0 Pointers, Structure 3.1 Advantages
declaring and in ‘C’ to perform and Union in ‘C’ of pointers
initializing arithmetic 3.1Introduction and in ‘C’
pointers with operations on Features of Pointers program
example. pointers 3.2Declaration of Pointer 3.2 Use of features
SO3.2 Apply various LE3.2 Develop a program 3.3 Operations on Pointers of pointers in
operations on in ‘C’ to print 3.4 Array of Pointers ‘C’ program
pointers with address of 3.5 Pointers to Pointers 3.3 – 3.6 Uses of
example. variables 3.6 Passing array to different
SO3.3 Compare LE3.3 Develop a program function operations on
pointers and in ‘C’topass array 3.7 Introduction and pointers in ‘C’
array with inside a function. Features of Structure & program
example. LE3.4 Develop programs Union 3.7 Advantages of
SO3.4 Describe in ‘C’ to read/write 3.8Declaration of Structure Structure &
declaring and structure & Union Union

CSVTU, Bhilai - NITTTR, Bhopal Page 23


Diploma in Information Technology Semester - III

Session Outcomes Laboratory Instruction Class room Instruction SelfLearning


init(iSaOlizsi)ng LE3.5 Deve(loLIp), debug 3.9Operation(CsIo) n Structure 3.8 – 3.1(S0L)features
Structure & and execute & Union of Structure &
Union in ‘C’. programs in ‘C’ 3.10Array of Structure & Union
SO3.5 Classify different tocreate array of Union
types of Structure. 3.11 Pointers to Structure
Structure in ‘C’ LE3.6 Use pointer, & Union
SO3.6 Compare Structure & union
structure and in ‘C’.
union in ‘C’

SW-3 Suggested Sessional Work (SW):


a. Assignments:
i. Develop a program in ‘C’ to show the concept of pointer to pointer.
ii. Describe the use of pointersfor arithmetic operation in ‘C’.
iii. Develop a program in ‘C’ to read & write students record.
iv. Develop a program to search a number in specified location
b. Mini Project:
i. Develop a program in ‘C’ ‘to shows the relations between array and pointers’.
ii. Develop a program in ‘C’ on structure to display information of 10 students
c. Other Activities (Specify):
I. A seminar on pointers in ‘C’
II. A seminar on ‘use of Structure & Union in ‘C’’

CO-4 : Perform basic operation of insertion, deletion and searching on Linked list.
Session Outcomes Laboratory Instruction Class room Interaction(CI) Self Learning
(SOs) (LI) (SL)
SO4.1Define linked LE4.1 Perform searching, Unit 4.0: Linked List 4.1 Nodes,
list and its insertion and 4.1 Introduction of Linked List pointer,
terminology deletion operation 4.1.1 node, NULL
SO4.2Identify on singly linked list. 4.1.2 next address pointer
different type LE4.2 Perform searching, 4.1.3 pointer, 4.2 Calloc(),
of linked list. insertion and 4.1.4 null pointer malloc(),fr
SO4.3Describe deletion operation 4.2 Types of Linked List e e ()
various on doubly linked 4.2.1 Singly Linked List
operations on list. 4.2.2 Doubly Linked List
linked list. LE4.3 Perform searching, 4.2.3 Circular Linked List
SO4.4Explain various insertion and 4.3 Operations on Linked List
applications of deletion operation 4.3.1 Searching
linked list on Circular linked 4.3.2 insertion
list. 4.3.3 Deletion
4.4 Applications of Linked List
SW-4 Suggested Sessional Work (SW):
a. Assignments:
I. Explain various memory management functions in C.
II. Write applications of linked list.
b. Mini Project:
I. Implement various link lists& their operations.

CSVTU, Bhilai - NITTTR, Bhopal Page 24


Diploma in Information Technology Semester - III

c. Other Activities (Specify):


I. Seminar on doubly linked list and its applications.

CO-5 Perform basicoperation of insertion, deletion and searching on graph and tree.

Session Outcomes (SOs) Laboratory Instruction (LI) Class room Interaction(CI) Self Learning
(SL)
SO5.1Perform Various LE5.1Implement binary Unit 5: Graph and Tree 5.1Node
operations on search tree. 5.1 Definition of graph insertion
Graph. LE5.2Perform insertion in 5.2 Representation of graph and
SO5.2 Explain types of Binary search Tree. 5.2.1 Adjacency Matrix deletion in
tree. LE5.3 Perform deletion in 5.2.2 Incidence Matrix BST
SO5.3Perform various Binary search Tree. 5.2.3 Adjacency List
operations on LE5.4Perform Searching 5.3 Introduction to Tree
Tree Data in Binary search 5.4 Type of tree
Structure. Tree. 5.4.1 Binary Tree
SO5.4 Explain various 5.4.2 Binary Search Tree (BST)
operations on 5.5 Operation on BST
BST and its 5.5.1 Insertion
implementation 5.5.2 Deletion
5.5.3 Traversing
SW-5 Suggested Sessional Work (SW):
a. Assignments:
I. Write the procedure to delete node on BST.
II. Explain skew tree.
III. Differentiate between tree and graph.
b. Mini Project:
i. Implement BST on list of any 10 values
c. Other Activities (Specify):
i. Seminar on "tree and graph"

Note: Performance under Laboratory and Sessional work may appear in more than one
COs/SOs.
Legend: CI: Classroom Instruction (Includes different instructional strategies i.e. Lecture (L) and
Tutorial (T) and others), LI: Laboratory Instruction (Includes Practical performances in
Laboratory, Workshop, field or other locations using different instructional strategies)
SL: Self Learning

I) Suggested Specification Table (For ESA of Classroom Instruction CI+SW+SL):

Unit
Total
Num Unit Titles
Marks
ber
I Introduction to data structure and Array in ‘C’ 14
II Stack and Queue 14
III Pointers, Structure and Union in ‘C’ 14
IV Linked List 14
V Graph and Tree 14
Total 70

CSVTU, Bhilai - NITTTR, Bhopal Page 25


Diploma in Information Technology Semester - III

J) Suggested Specification Table (For ESA of Laboratory Instruction*):


Note: The student at the end of semester examination of 30Marks; has to undertake any ONE
of the listed practical’s.

S.No. List of Practical’s

Develop a ‘C’ program to print forward diagonal, backward diagonal


1
and sum of diagonals of 3*3 square matrix.
Develop a ‘C’ Program Swap Numbers in Cyclic Order Using Pointer
2
by passing parameters 30
Develop a ‘C’ Program to Find the Number of Vowels, Consonants, Marks
3 are
Digits and White space in a String
allocate
Develop a ‘C’ Program to Add Two Complex Numbers by Passing
4 d for
Structure to a Function
perform
Develop a ‘C’ Program to Read Roll number, name and marks of ance
5 students and store it in file. If file already exists, add information to under
it. ES A
Develop a ‘C’ Program to perform searching operation on different
6
type tree data structure.
Perform searching, insertion and deletion operation on different
7
type of linked list.

K) Suggested Instructional/Implementation Strategies:


1. Improved Lecture
2. Tutorial
3. Case Method
4. Group Discussion
5. Industrial visits
6. Industrial Training
7. Field Trips
8. Portfolio Based Learning
9. Role Play
10. Demonstration
11. ICT Based Teaching Learning (Video Demonstration, CBT, Blog, Face book, Mobile)
12. Brainstorming
13. Others

CSVTU, Bhilai - NITTTR, Bhopal Page 26


Diploma in Information Technology Semester - III

L) Suggested Learning Resources:


(a) Books :
S. Titles Author Publisher Edition &
No. Year
1 Let us 'C' YashavantKanetkar BPB publications 2017 or latest
2 Programming in ANSI ’C’ E. Balaguruswami TM H 2017 or latest
3 Programming in ‘C’ A.N. Kamthane Pearson 2017 or latest
4 Programming with ‘C’ Schoums Schoums series 2017 or latest

(b) Open source software and websiteaddress:


1. Learning ‘C’ Programming- https://www.programiz.com/c-programming#learn-c-tutorial
2. ‘C’ Programming- http://www.programmingsimplified.com/c-program-examples
3. ‘C’ Programming- http://www.c4learn.com/c-programs/
4. Learning ‘C’ Examples & Tutorials-
https://www.tutorialspoint.com/learn_c_by_examples/index.htm
5. ‘C’ Programming Examples- http://www.techcrashcourse.com/2014/10/c-program-
examples.html

(c) Others:
1. Learning Packages.
1. Lab Manuals.
2. Users’ Guide
3.
M) List of Major Laboratory Equipment and Tools:
S. Name of Equipment Broad Relevant Experiment
No. Specifications Number
LE1.1-LE1.7
LE2.1-LE2.6
1 Computer System Latest configuration LE3.1-LE3.6
LE4.1-LE4.3
LE5.1-LE5.4
LE1.1-LE1.7
LE2.1-LE2.6
2 ‘C’ compiler Code: Version 16.01 Version (or latest) LE3.1-LE3.6
LE4.1-LE4.3
LE5.1-LE5.4

CSVTU, Bhilai - NITTTR, Bhopal Page 27


Diploma in Information Technology Semester - III

N) Mapping of POs & PSOs with COs:

Course Programme Outcomes Programme


Outcomes (POs) Specific
(COs) Outcomes
(PSOs)
PO-1 P O- 2 P O- 3 P O- 4 PO-5 P O- 6 PO-7 PO-8 P O- 9 PO-10 PSO-1 PSO-2
Basic Discipline Experiments Engineering The Environment Ethics Individual Communic Life-long
knowledge knowledge and practice Tools engineer and and team ation learning
and society sustainability w o rk
CO-1 To manipulate Linear
Data Structure using C 3 3 2 2 2 1 2 1 1 2 2 3
Programming.

CO-2 Apply Linear Data


StructureStack and
2 2 3 2 3 1 1 2 2 2 3 2
Queue in different
application.
CO-3 Develop programs in ‘C’
using Pointers, structure
and Union for accessing 2 2 3 2 2 1 2 2 2 2 3 2
memory.
CO-4 Perform basic operation of
insertion, deletion and 2 2 3 2 2 1 1 2 2 2 2 3
searching on Linked list.
CO-5 Perform basic operation
of insertion, deletion and
searching on graph and 2 2 2 2 2 1 2 2 2 2 3 2
tree.

Legend: 1 – Low, 2 – Medium, 3 – High

CSVTU, Bhilai - NITTTR, Bhopal Page 28


Diploma in Information Technology Semester - III

O) Course Curriculum Map:

Laboratory Instruction Classroom Instruction Self Learning


POs & PSOs No. COs No. & Titles SOs No.
(LI) (CI) (SL)
PO - 1 , 2 , 3 , 4 , 5 , SO1.1 LE1.1
CO-1 To manipulate Linear Data Unit-1.0 Introduction to data structure
7, 8, 9, 10 - -
and Array in ‘C’ SL1.1 – 1.2
Structure using C Programming. SO1.5 LE1.7
PSO – 1, 2
PO - 1 , 2 , 3 , 4 , 5 , CO-2 Apply Linear Data StructureStack SO2.1 LE2.1
7, 8, 9, 10 - -
and Queue in different Unit-2.0 Stack and Queue SL2.1 – 2.3
SO2.5 LE2.6
application.
PSO – 1, 2
PO - 1 , 2 , 3 , 4 , 5 , CO-3 Develop programs in ‘C’ using SO3.1 LE3.1
7, 8, 9, 10 - - Unit-3.0 : Pointers, Structure and Union in
Pointers, structure and Union for SL3.1 – 3.8
SO3.6 LE3.6 ‘C’
accessing memory.
PSO – 1, 2
PO - 1 , 2 , 3 , 4 , 5 , CO-4 Perform basic operation of SO4.1 LE4.1
7, 8, 9, 10 - - Unit-4.0: Linked List
insertion, deletion and searching SL4.1 – 4.2
SO4.4 LE4.3
on Linked list.
PSO – 1, 2
PO - 1 , 2 , 3 , 4 , 5 , CO-5 Perform basic operation of SO5.1 LE5.1
7, 8, 9, 10 - - Unit-5.0Graph and Tree
insertion, deletion and searching SL5.1
SO5.4 LE5.4
on graph and tree.
PSO – 1, 2
Legend: CI: Classroom Instruction (Includes different instructional strategies i.e. Lecture (L) and Tutorial (T) and others),LI: Laboratory Instruction (Includes Practical
performances in Laboratory, Workshop, field or other locations using different instructional strategies) SL: Self Learning

CSVTU, Bhilai - NITTTR, Bhopal Page 29


Diploma in Information Technology Semester-III

I .Course Curriculum Detailing (Semester- III)

CSVTU, Bhilai- NITTTR, Bhopal Page 30


Diploma in Information Technology Semester-III

A) Course Code : 2000354(033)


B) Course Title : System Analysis and Design
C) Pre- requisite Course Code and Title :
D) Rationale :
Systems analysis and design are core, interlocking, elements of system development in
the field of Information Technology. Systems analysis is the process of turning a set of
user requirements into a logical system specification. Systems design takes the logical
specification and converts it into a set of designs that can be implemented to create a
working application. The course provides the students with the skills to identify
problems which may be solved by technology based solutions, determine requirements
for information system solutions and develop designs which form the basis for
implementing systems.

E) Course Outcomes :

CO-1 Explain fundamentals and life cycle of system engineering.


CO-2 Describe system development models with their features.
CO-3 Analyze system requirement and prepare software requirement specification.
CO-4 Design various modules of a system with the help of representation techniques.
CO-5 Test, Document and Implement a software system.

F) Scheme of Studies:
Scheme of Studies (Hours/Week)
Course L P T Total Study Total
Board of Study Course Title
Co d e Hours (L+T+P) Credits(C)
(L+T+P/2)
Information 2000354 System Analysis
3 0 0 0 3
Technology (033) and Design

G) Scheme of Assessment:
Board of Course Course title Scheme of examination
Study Co d e Total Marks
Theory Practical Total Marks
ESE CT TA ESE TA
Information 2000354 System Analysis
Technology (033) and Design 70 30 30 0 0 130

CSVTU, Bhilai - NITTTR, Bhopal Page 31


Diploma in Information Technology Semester-III

H) Course-Curriculum Detailing:
This course curriculum detailing depicts learning outcomes at course level and session level and
their attainment by the students through Classroom Instruction (CI), Laboratory Instruction (LI),
Sessional Work (SW) and Self Learning (SL). Students are expected to demonstrate the
attainment of Session Outcomes (SOs) and finally Course Outcomes (COs) upon the completion
of course.

CO-1 Explain fundamentals and life cycle of system engineering.


Session Outcomes Laboratory Class room Instruction (CI) Self Learning(SL)
(SOs) Instruction (LI)
SO1.1 Define system . Unit 1:System and its Development SL1.1 Apply
an d its 1.1Introduction to System the concept of
elements. 1.1.1System concept and definition system
SO1.2 Explain types 1.1.2Elements of a system engineering in
an d 1.1.3Types of system product
characteristic 1.1.4 Characteristics of a development.
of a system. system
SO1.3 Define System 1.2 System Engineering
engineering 1.2.1 Definition and need
and its need. 1.2.2 A layered approach
SO1.4 Describe 1.2.3 System Development
various phases Life Cycle.
involved in 1.2.3.1 Definition andneed
SDLC. 1.2.3.2 Phases
SW-1 Suggested Sessional Work (SW):
a. Assignments:
1. List out the challenges involved in each phase of SDLC.

CO-2: Describe system development models with their features.

Session Outcomes
Laboratory Instruction (LI) Class room Instruction (CI) Self Learning (SL)
(SOs)
SO2.1Explain different Unit 2 System Development SL2.1 Identify the
types of system Models model to be used
development models. 2.1 Waterfall model for system
SO2.2 Compare 2.1 Iterative model development.
different types of 2.3 Prototype model
system development 2. 4 Spiral model
models. 2. 5 RAD model

SW-2 Suggested Sessional Work (SW) :


a. Assignments:
1. List out the pros and cons of System development models.
b. Mini Project:
1. Case study of system development models.
c. Other Activities (Specify):
1. A seminar on “System Development Life Cycle” of software.
2. Make a power point presentation on SDLC.

CSVTU, Bhilai - NITTTR, Bhopal Page 32


Diploma in Information Technology Semester-III

CO- 3 Analyze system requirement and prepare software requirement specification.

Session Outcomes Laboratory Class room Instruction (CI) Self Learning


(SOs) Instruction (LI) (SL)
SO3.1Listpotential Unit 3:Planning and Requirement SL3.1 Prepare
positive and negative Analysis SRS document
outcomes of a system. 3.1 Planning for a project
SO3.2Describe 3.1.1 Definition and need assigned.
essential components 3.2 Feasibility study SL3.2 Analyze
and features of an SRS 3.2.1 Definition and need economical,
document. 3.2.2 Steps and types technical and
SO3.3Classify system 3.3.3 Cost-Benefit analysis legal factors in
requirements based 3.3 Requirement gathering and requirement
on analysis. analysis phase.
3.3.1 Definition and need
3.3.2 Tools and techniques
3.4Software requirement
specification (SRS) document
3.4.1 Definition and need
3.4.2 Characteristics of a good SRS
document
3.4.3 Functional and non-functional
requirements
SW-3 Suggested Sessional Work (SW) :
a. Assignments:
1. Identify the challenges involved in requirement gathering.
2.Explain the importance of SRS documentation in analysis phase.
3. Compare initial investigation and feasibility study.
b. Mini Project:
1. Prepare a mini SRS document for a given project.
c. Other Activities (Specify):
1. A seminar on a “How to prepare SRS document”.

CO- 4 Design various modules of a system with the help of representation techniques.
Session Outcomes Laboratory Class room Instruction (CI) Self Learning
(SOs) Instruction (LI) (SL)
SO4.1 Explain system Unit 4:System Design SL4.1 Design a
design with its 4.1 Definition and need module for a
importance. 4.2 Logical and Physical design project.
SO4.2Compare 4.3 Design methods SL4.2 Draw DFD
designing methods 4.3.1 Procedural and modular for a project.
with their benefits and 4.3.2 Top-down and bottom-up approaches
4.4Input and output design SL4.3Illustrate
limitations. DFD concept for
SO4.3 Describe 4.5 User interface design system
different parts of 4.6 Data storage design implementation.
system design. 4.5 Cohesion and coupling and their types
4.6 Design representation
SO4.3Draw DFD 4.6.1 Data Flow Diagram (DFD) :
andERDfor given data components and levels
set. 4.6.2 Entity-Relationship Diagram (ERD) :
representation of components
4.6.3 Concept of use case diagram
4.7 Objects oriented design

CSVTU, Bhilai - NITTTR, Bhopal Page 33


Diploma in Information Technology Semester-III

4.7.1 Definition and concept


4.7.2 Static and dynamic modeling using
UML diagrams.

SW-4 Suggested Sessional Work (SW) :


a. Assignments:
1. Compare cohesion and coupling.
b. Mini Project:
1.Prepare DFD and ERD for an organization.
2. Prepare a UML diagram of a given scenario.

CO- 5: Test, Document and Implement a software system.


Session Outcomes (SOs) Laboratory Instruction Class room Instruction (CI) Self Learning (SL)
(LI)
SO5.1 Explain testing . Unit 5: Post Design Phases SL5.1 Perform
and its types. 5.1 System testing different testing
SO5.2Classify 5.1.1 Definition, characteristics of a good techniques on a
documentation. testing system module.
SO5.3 Describe 5.1.2Concept of Unit, black box, white SL5.2 Prepare
implementation with box, alpha and beta testing user and system
its process and types. 5.2.3 Validation and Verification document for a
SO5.4 Describe the 5.2 Documentation designed
different activities and 5.2.1 Definition and need project.
issues associated with 5.2.2 Types : Internal and external
maintenance phase. 5.3 Implementation and maintenance
SO5.5 Perform 5.3.1 Definition and importance
different ty p e of 5.3.2Structured and Functional
Testing scheme on a implementation
develop software. 5.3.3 Implementation guidelines
5.3.4 Maintenance activities and issues
Legend: CI: Classroom Instruction (Includes different instructional strategies i.e. Lecture (L) and Tutorial
(T) and others), LI: Laboratory Instruction (Includes Practical performances in Laboratory,
Workshop, field or other locations using different instructional strategies) SL: Self Learning
SW-5 Suggested Sessional Work (SW) :
a. Assignments:
1.Compare white box and black box, alpha and beta testing.
2.Compare data validation and verification.

Note: Performance underLaboratory andSessional work may appear in more than one
COs/SOs.

CSVTU, Bhilai - NITTTR, Bhopal Page 34


Diploma in Information Technology Semester-III

I) Suggested Specification Table (For ESA of Classroom Instruction CI+SW+SL):

Unit Unit Total


Number Title Marks
I System and its Development 10
II System Development Models 14
III Planning and Requirement Analysis 16
IV System Design 16
V Post Design Phases 14
Total 70

K) Suggested Instructional/Implementation Strategies:


1. Improved Lecture
2. Tutorial
3. Case Method
4. Group Discussion
5. Industrial visits
6. Industrial Training
7. Portfolio Based Learning
8. ICT Based Teaching Learning (Video Demonstration, CBT, Blog, Face book, Mobile)

L) Suggested Learning Resources:


(a) Books :
S. No. Title Author Publisher Edition & Year
th
1. Structured System Analysis and Madhulika Jain BPB 2010 editionor
Design (available in hindi also) Satish Jain Publication Latest
th
2. Software Engineering: A Roger S. Tata McGraw 6 Edition 2012or
Practitioner's Approach Pressman Hill Latest
3. Fundamentals of software Rajib Mall PHI Publication 4thedition 2014or
engineering Latest

(b)Open source software and websiteaddress :


1. Download link (E-book :SystemAnalysis and Design)
https://www.tutorialspoint.com/system_analysis_and_design/system_analysis_and_de
sign_tutorial.pdf(recommended)
2.www.nptel.ac.in/downloads/106108103 (chapter-wise)

M) List of Major Laboratory Equipment and Tools:


S. No. Name of Equipment BroadSpecifications Relevant Experiment
Number
1 Computer i7 Processor, 4 GB RAM, 1TB HDD 1-7
2 Projector 1-7

CSVTU, Bhilai - NITTTR, Bhopal Page 35


Diploma in Information Technology Semester -III

N) Mapping of POs & PSOs with COs:

Programme
Course Programme Outcomes Specific
Outcomes (POs) Outcomes
(COs) (PSOs)
Titles
Basic Disciplin Experiment Engineeri The Environmen Ethics Individu Commun Life PSO-1 PSO-2
knowledge e s& ng Tools Engineer & t& PO-7 al & ication Long
PO-1 knowled Practice PO-4 Society Sustainabilit Team PO-9 learni
ge PO-3 PO-5 y work ng
PO-2 PO-6 PO-8 PO-10
CO-1 Explain
fundamentals and life
3 3 1 2 1 1 1 2 3 2 2 3
cycle of system
engineering.
CO-2 Describe system
development models 3 3 1 1 1 1 1 2 2 2 2 3
with their features.
CO-3 Analyze system
requirement and
prepare software 3 3 2 1 1 1 2 3 2 3 2 3
requirement
specification
CO-4 Design various
modules of a system
with the help of 3 3 1 1 1 1 2 2 2 3 2 3
representation
techniques
CO-5 Test, Document
and Implement a 3 3 1 1 1 1 2 3 2 3 3 3
software system

Legend: 0 -No Co-relation, 1 – Low, 2 Medium, 3 - High

CSVTU, Bhilai - NITTTR, Bhopal Page 36


Diploma in Information Technology Semester-III

O) Course Curriculum Map:

POs & COs No.& Title SOs No. Laboratory Classroom Instruction Self Learning
PSOs No. Instruction (CI) (SL)
(LI)
PO1-PO10 CO-1: Explain fundamentals and SO1.1 – SO1.4 LE1.1 Unit 1.0 System and its SL1.1
PSO1-PSO2 life cycle of system engineering Development

PO1-PO10 CO-2: Describe system SO2.1 - SO2.2 LE. 2.1 Unit 2.0 System SL2.1
PSO1-PSO2 development models with their Development Models
features

PO1-PO10 CO-3: Analyze system SO.3.1 - SO3.3 LE3.1 Unit 3.0 Planning and SL3.1-SL3.2
PSO1-PSO2 requirement and prepare Requirement Analysis
software requirement
specification
PO1-PO10 CO-4: Design various SO4.1 - SO4.3 LE4.1 Unit 4.0 System Design SL4.1-SL4.3
PSO1-PSO2 modules of a system with the LE4.2
help of representation
techniques
PO1-PO10 CO-5:Test, Document and SO5.1 - SO5.5 LE5.1 Unit 5.0 Post Design SL5.1-SL5.2
PSO1-PSO2 Implement a software system LE5.2 Phases

Legend: CI: Classroom Instruction (Includes different instructional strategies i.e. Lecture (L) and Tutorial (T) and others) , LI : Laboratory Instruction
(Includes Practical performances in Laboratory, Workshop, field or other locations using different instructional strategies) SL: Self Learning

CSVTU, Bhilai - NITTTR, Bhopal Page 37


Diploma in Computer Science and Engineering Semester-III

VII.Course Curriculum Detailing (Semester- III)

CSVTU, Bhilai- NITTTR, Bhopal Page 38


Diploma in Computer Science and Engineering Semester-III

A) Course Code : 2000355(028)


B) Course Title : Digital Electronics
C) Pre- requisite Course Code and Title : Basic Electronics Engineering
D) Rationale :
Digitization of automation industries and communication systems has changed
the complete Industrial scenario and human lifestyle across the globe. The advancements in
microelectronics integrated circuits, manufacturing of VLSI and ULSI chips, computer technology
and information systems have caused the rapid increase in the use of digital circuits. Hence this
subject is intended to learn facts, concepts, principles and procedures of digital techniques and
their application used in digital circuits and systems. Concepts of this course will help the
students to develop skills to analysis and built applications based on digital Integrated circuits.

E) Course Outcomes :
CO-1 Use number systems and codes for various applications.
CO-2 Test the functionality of various logic gates.
CO-3 Build and test various combinational circuits.
CO-4 Build and test various sequential circuits.
CO-5 Maintain various types of A/D converters, D/A converters.
F) Scheme of Studies:

Scheme of Studies (Hours/Week)


Course L P T Total Study Total
Board of Study Course Title
Co d e Hours (L+T+P) Credits(C)
(L+T+P/2)
Electronics and
Digital
Telecommunica 2000355
tion (028)
Electronics 2 2 1 5 4

Legend: Lecture (L) and Tutorial (T) and Practical(P)

G) Scheme of Assessment:
Board of Course code Course title Scheme of examination
Study Total Marks
Theory Practical Total Marks
ESE CT TA ESE TA
Electronics and 2000355 Digital Electronics 70 30 30 30 50 210
Telecommunica (028)
tion

H) Course-Curriculum Detailing:
This course curriculum detailing depicts learning outcomes at course level and session level and
their attainment by the students through Classroom Instruction (CI), Laboratory Instruction (LI),

CSVTU, Bhilai - NITTTR, Bhopal Page 39


Diploma in Computer Science and Engineering Semester-III

Sessional Work (SW) and Self Learning (SL). Students are expected to demonstrate the
attainment of Session Outcomes (SOs) and finally Course Outcomes (COs) upon the completion
of course.
Convert unit of the given physical quantity from one unit system to other.

CO-1 Use number systems and codes for various applications.


Session Outcomes Laboratory Instruction Class room Instruction (CI) Self Learning (SL)
(SOs) (LI)
SO1.1 Convert a LE1.1 Implement and Unit-1 NUMBER SYSTEM SE1.1 List
given test 4bitbinary to and CODES application of
number into gray code. 1.1 Use number systems various codes.
the given LE1.2 Implement and and codes for various
type of test 4bitgray applicationsNumber
number code to binary systems
system. code. 1.2 Conversion between
SO1.2 Identify the different number
varioustypes systems
of binary 1.3 r’s and (r-1)’s
codes. complement of number
1.4 Binary Arithmetic
SO1.3 Apply the operations : Addition,
arithmetic Subtraction,
operation on Multiplication and
the given Division
binary 1.5 Binary Codes
numbers. Weighted and Un-
weighted codes,
Excess- 3 code, Gray
code, Error Detection
and Correction Code,
Hamming code, BCD
Code, ASCI code
SW-1 Suggested Sessional Work (SW):
a. Assignments:
1. Generate a hamming code for the data word 11000100.
2. Perform the conversion and arithmetic operation between the different types of
number system.
3. Perform r’ and (r-1)’ complement for different types of number system.
b. Mini Project:
1. Prepare a report on the applications of binary codes.
c. Other Activities (Specify):

CSVTU, Bhilai - NITTTR, Bhopal Page 40


Diploma in Computer Science and Engineering Semester-III

CO-2 Test the functionality of various logic gates.


Session Outcomes Laboratory Instruction Class room Instruction (CI) Self Learning
(SOs) (LI) (SL)
SO2.1 Explain functions LE2.1 Test the Unit -2Logic gates and SL2.1 Simplify
of the given type functionality of Boolean algebra the
of logic gate following Logic 2.1 Logic Gates: basic Boolean
with the help of Gates: AND, OR, gates, AND, OR, NOT, function
truth table. NOT, NAND and EX-OR, EX-NOR, up to 5
SO2.2 Apply Boolean NOR Gates (For Universal Gates: variables
algebra to TTL logic gates NAND, NOR, truth using K-
minimize the and CMOS logic table ,symbol, map
given logic gates). implement Basic Gate method.
expression. LE2.2 Implement and using Universal gate SL2.2 Obtain
SO2.3 Design simple test the basic 2.2 Boolean Algebra: standard
logic circuits gates Using Boolean theorems, De SOP and
using logic gates. NAND gates. Morgan’s Theorems, POS form
SO2.4 Apply the De- LE2.3 Neither duality for given
Morgan’s implements and 2.3 Max - term, Min - expressio
theorem to test the Basic term, Sum of product n
simplify the given Gates Using (SOP) and Product of
logic expression. NOR gates. Sum(POS)
SO2.5 Minimize given LE2.4 Simplify and expressions, Simplify
logic expression implement the the Boolean
using K-map given Boolean functions,, Simplify
method. functions using the Boolean functions
NAND gates. using K- map
method(up to 4
variables).
SW-2 Suggested Sessional Work (SW) :
a. Assignments:
i. Show that both NAND and NOR gate are universal gate.
ii. Draw the logic symbols, construct the truth table, and with the help of circuit
diagram explain the working of following gate
i) AND ii) OR iii) NOT iv) NAND v) NOR
iii. Explain the procedure to expand an SOP and POS expression into standard SOP
form and standard POS form with suitable example.
Activities (Specify):
i. Seminar on applications of different types of Gates.
ii.
CO- 3 Build and test various combinational circuits.
Session Outcomes Laboratory Class room Instruction (CI) Self Learning
(SOs) Instruction (LI) (SL)
SO3.1 Write step LE3.1 Build and test Unit-3Combinational Circuits SE3.1 Explain
by step half-adder 3.1 Half Adder, Full Adder, p riority
procedure and full- Half subtract or, Full e n coder
torealize any adder. Subtractor, parallel adder, circuit with its
combination LE3.2 Build and test 4 bit binary adder, 4 bit application.

CSVTU, Bhilai - NITTTR, Bhopal Page 41


Diploma in Computer Science and Engineering Semester-III

Session Outcomes Laboratory Class room Instruction (CI) Self Learning


a(Sl.Os) Insthraulcf taionnd (fLuIl)l binary Subtractor, BCD (SL)
SO3.2 Design a full subtractor. adder SE3.2 Realize
adder using LE3.3 Implement 3.2 Magnitude comparator(2 Adder circuit
half adder. and test 2X1 ,3 and 4 bit) using Mux
multiplexer and Demux.
SO3.3 List 3.3 Encoder and Decoder: 4
applications using AND I/P and 2 O/P encoder,8
of encoder and OR gates. I/P and 3 O/P encoder,
and LE3.4 Build 4X1 Octal to Binary and
decoders. multiplexer Decimal to BCD
SO3.4 Design 4X1 using 2X1 EncoderDecoders: 3-Line
multiplexer multiplexers. to 8-Line Decoder, 8-4-2-1
using 2X1 LE3.5 Build and test BCD to Decimal Decoder,
multiplexer. BCD to seven BCD to Seven Segment
segment Decoder
SO3.5 Design a 3
bit decoder. Multiplexer(Mux) and
magnitude Demultiplexer(Demux):
comparator. 2X1,4X1 and 8X1
multiplixer,1X2,1X4 and
1X8 demultiplexer,
applications of
Multiplexers and
demultiplexers
SW-3 Suggested Sessional Work (SW) :
a. Assignments:
1. Realize a full adder using
i) Only NAND gate ii) Only NOR gate
2. Discuss applications (any two) of multiplexer.
3. Show an arrangement to obtain a 16 input mux from two 8 input mux.
b. Mini Project:
1. Design BCD to 7 segment decoder using IC7447.
2. Design 4 bit binary adder/subtractor using IC7483
c. Other Activities (Specify):
1. Prepare a PPT on all the combinational circuits.
2. Prepare a chart to show the applications of Combinational circuits.

CO- 4 Build and test various sequential circuits.


Session Outcomes Laboratory Class room Instruction (CI) Self Learning
(SOs) Instruction (LI) (SL)
SO4.1 Explain LE4.1 Test the Unit-4SEQUENTIAL CIRCUITS 4.1
working of functionality of 4.1 Flip Flop - basic flip flop
given FF with SR, D, JK and T and latch, Clock, Set and
the help of Flip-flops. Reset inputs to F/F, clock
excitation LE4.2 Build and test triggering - Positive &
table. binary Mod-4 Negative clock Edge
SO4.2 Describe synchronous triggering, level

CSVTU, Bhilai - NITTTR, Bhopal Page 42


Diploma in Computer Science and Engineering Semester-III

designed and triggeringRS F/F, JK F/F, D


procedure of asynchronous F/F, T F/F, truth table,
Mod -10 up counter. characteristic table or
and down LE4.3 Build and test excitation table
counter, Mod-8 up / 4.2 Race around condition,
SO4.3 Compare down counter. Master Slave F/F
characteristic LE4.4 Test the output 4.3 Counters: - Modules of a
of of the shift counter, Synchronous &
synchronous register (SISO, Asynchronous counter,
and SIPO). Ripple Counter, Up –
asynchronou LE4.5 Build and test down binary counter,
s counter. Mod-10 Decade counter, BCD
SO4.4 Sketch the counter using D counter, Designing of
timing or T FF. counters.
diagram at 4.4 Register –Shift register,
the output of Serial in parallel out,
each FF of 4- Serial in Serial out,
bit serial in Parallel in Serial out,
serial out Parallel in Parallel out
shift register register, designing of
for the given register.
input.
SW-4 Suggested Sessional Work (SW) :
a. Assignments:
1. Distinguish between combinational and sequential logic circuit.
2. Explain the procedure to convert one flip flop to another flip flop(ex. JK flip flop to SR
flip flop.)
b. Mini Project:
1. Design 4 bit synchronous counter using IC7476.
2. Design decade counter using IC7492/93.
c. Other Activities (Specify):
1. Prepare a PPT on all the applications of sequential circuit in the digital systems.
2. Prepare a chart to show the difference between sequential and combinational circuits.

CO- 5 Maintain various types of A/D converters, D/A converters.


Session Outcomes Laboratory Class room Instruction (CI) Self Learning
(SOs) Instruction (LI) (SL)
SO5.1 With the help of LE5.1 Test the input Unit-5 CONVERTERS AND SE 5.1
circuit diagram and output LOGIC FAMILIES Compar
describe the voltages of IC 5.1 Digital to Analog e
working of ADC0808. converter(DAC): R-2R various
following LE5.2 Test the input DAC, Weighted logic
i) R-2R DAC and output resister DAC families
ii) Weighted voltages of 5.2 Analog to Digital .
resistor DAC. ICDAC0808. converter(ADC)Counte
SO5.2 With the help of
r type, ramp,
circuit diagram

CSVTU, Bhilai - NITTTR, Bhopal Page 43


Diploma in Computer Science and Engineering Semester-III

Session Outcomes Laboratory Class room Instruction (CI) Self Learning


des(SOs)
cribe the Instruction (LI) Successive (SL)
working of approximation, Flash
following:i)Coun type
ter type ADC 5.3 Logic Families – Digital
ii) Flash ADC iii) IC specifications
Successive (threshold voltage ,
Approximation propagation delay,
ADC power dissipation,
Compare Fanin, Fanout,
technical transition width, logic
specifications of levels, Noise margin ,
different logic speed power product,
families. figure of merit), TTL,
RTL, DTL ,ECL, I2Land
CMOS
Legend: CI: Classroom Instruction (Includes different instructional strategies i.e. Lecture (L) and Tutorial
(T) and others) , LI : Laboratory Instruction (Includes Practical performances in Laboratory,
Workshop, field or other locations using different instructional strategies) SL: Self Learning
SW-5 Suggested Sessional Work (SW) :
a. Assignments:
1. With the help of neat diagram explain the working of following DAC and ADC
i) R-2R ii) weighted resistor type DAC iii) Counter type ADC iv) Flash type ADC v)
Successive Approximation type ADC
b. Mini Project:
1. On the basis of Internet search prepare a report to summarize technical specifications
of ADC and DAC ICs .
c. Other Activities (Specify):
1. Prepare a PPT on logic family
2. Prepare PPT on DAC and ADC
Note: Performance under Laboratory and Sessional work may appear in more than one
COs/SOs.

I) Suggested Specification Table (For ESA of Classroom Instruction CI+SW+SL):

Unit Unit Total


Number Title Marks
I Number System and Codes 10
II Logic Gates and Boolean Algebra 15
III Combinational Circuits 15
IV Sequential Circuits 15
V Converters And Logic Families 15
Total 70

CSVTU, Bhilai - NITTTR, Bhopal Page 44


Diploma in Computer Science and Engineering Semester-III

J) Suggested Specification Table (For ESA of Laboratory Instruction*):

Laboratory
Instruction Short Laboratory Experiment Title
Number

1
Implement and test 4bit binary to gray code.
2
Implement and test 4bit gray code to binary code.
3
Test the functionality of following Logic Gates: AND, OR, NOT, NAND and
NOR Gates (For TTL logic gates and CMOS logic gates).

4 Implement and test the basic gates Using NAND gates.


5 Implement and test the Basic Gates Using NOR gates.
6 Simplify and implement the given Boolean functions using NAND gates.
7 Build and test half-adderand full-adder.
8 Build and test half and full subtractor.
9 Implement and test 2X1 multiplexer using AND and OR gates.

10 Build 4X1 multiplexer using 2X1 multiplexers.


11 Build and test BCD to seven segment decoder
12 Test the functionality of SR, D, JK and T Flip-flops.
13 Build and test binary Mod-4 synchronous and asynchronous counter.
14 Build and test Mod-8 up / down counter.
15 Test the output of the shift register (SISO,SIPO).
16 Build and test Mod-10 counter using D or T FF.
17 Test the input and output voltages of IC ADC0808.
18 Test the input and output voltagesof ICDAC0808.
* Assessment rubric, process and product check list with rating scale need to be prepared by the course
wise teachers for each experiment for conduction and assessment of laboratory experiments
/practicals
Legend : PRA: Process Assessment, PDA : Product Assessment

Note : Only one experiment has to performed at the end semester examination of 30 Marksas per
assessment scheme

K) Suggested Instructional/Implementation Strategies:


1. Improved Lecture
2. Tutorial
3. Case Method
4. Group Discussion
5. Industrial visits
6. Industrial Training
7. Field Trips

CSVTU, Bhilai - NITTTR, Bhopal Page 45


Diploma in Computer Science and Engineering Semester-III

8. Portfolio Based Learning


9. Role Play
10. Demonstration
11. ICT Based Teaching Learning (Video Demonstration, CBT, Blog, Face book, Mobile)
12. Brainstorming
13. Others

L) Suggested Learning Resources:


(a) Books :
S. No. Title Author Publisher Edition & Year
1. Digital Logic and Computer Morris Mano Pearson 2016
Design Education India ISBN:9789332542525
sevicepvt limited
2. Digital Electronics: Anil K. Maini John Wiley &Sons 2007
Principle Devices an d Lt d ISBN:9788126514663
Applications
th
3. Digital Principles an d Malvino& Leach Tata McGraw-Hill 8 edition, 2014
Applications ISBN: 9789339203405
4. Digital Electronic Mamta Agrawal Deepak 2016,ISBN-
Prakashan 13: 9788177762242
th
5. Fundamental Digital KUMAR, A. ANAND Prentice Hall of 4 edition
Circuits India ISBN: 9788120352681
th
6. Modern Digital Electronics R.P. Jain Tata McGraw-Hill 4 edition ,2009
ISBN: 9780070669116
7. Digital Circuits and Design A. Arivazhgan Vikash Publishing 2003
House ISBN: 9788125914358
8. Digital Electronics (Digital Sanjay Sharma Kataria& Sons 2010
Logic Design) ISBN: 9789350140468
th
9. Digital Fundamentals Floyd Pearson 10 edition 2011
ISBN: 9788131734483
th
10. Digital Systems: Principles Tocci Pearson 10 edition 2009
and Applications ISBN: 9788131923289

(b) Open source software and website address :


1. http://logos.cs.uic.edu/366/notes/ErrorCorrectionAndDetectionSupplement.pdf
2.https://www.youtube.com/watch?v=N8Yy0-4YMS4
3. Full Subtractor:-http://www.flintgroups.com/2012/10/half-subtractor-and-full-
subtractor.html.
4. Encoder and Decoder:-http://www.edgefxkits.com/blog/encoders-and-decoders-truth-
tables/

CSVTU, Bhilai - NITTTR, Bhopal Page 46


Diploma in Computer Science and Engineering Semester-III

M) List of Major Laboratory Equipment and Tools:

S. Name of Broad Relevant Experiment


No. Equipment Specifications Number
1 CRO 50 MHz,DualTrace,Dulbeam,in built +-5v LE 17,18
supply,componenttester,function generator
2 Digital multimeter Digital multimeter 3 and ½ digit with LE 15,17,18
component tester
3 Function 0-2 MHz with sine ,square and triangular wave LE 12,13,14,15,16
generator output with variable frequency and amplitude
4 Power supply 0-24v , 1A LE 1 to LE 18
5 Logic Analyzer 24 channel LE 1 to LE 16

CSVTU, Bhilai - NITTTR, Bhopal Page 47


Diploma in Computer Science and Engineering Semester-III

N) Mapping of POs & PSOs with COs:

Programme Outcomes Programme


Course (POs) Specific
Outcomes Outcomes
(COs) (PSOs)
Titles
Basic Discipline Experiments & Engineering The Engineer Environment & Ethics Individual & Communication Life Long PSO-1 PSO-2
knowledge knowledge Practice Tools & Society Sustainability PO-7 Team work PO-9 learning
PO-1 PO-2 PO-3 PO-4 PO-5 PO-6 PO-8 PO-10
CO-1 Use number systems
and codes for various 3 2 1 1 1 1 1 1 1 1 2 1
applications.
CO-2 Test the functionality of
various logic gates. 2 1 2 2 1 1 1 2 2 1 2 2

CO-3 Build and test various


combinational circuits. 2 2 3 3 1 1 1 3 3 2 3 3

CO-4 Build and test various


sequential circuits. 1 2 3 3 1 1 1 1 1 1 1 1

CO-5 Maintain various types


of A/D converters, D/A 2 2 3 3 1 1 1 2 2 1 2 3
converters.

CSVTU, Bhilai - NITTTR, Bhopal Page 48


Diploma in Computer Science and Engineering Semester-III

O) Course Curriculum Map:

Laboratory
Classroom Instruction Self Learning
POs & PSOs No. COs No.& Title SOs No. Instruction
(CI) (SL)
(LI)
SO1.1 LE1.1
PO-1 to PO-10 CO-1 Use number systems and Unit-1 NUMBER
- - SE 1.1
PSO-01 to PSO-02 codes for various applications. SYSTEM and CODES
SO1.3 LE 1.2

SO 2.1 LE2.1 SL 2.1


PO-1 to PO-10 CO-2 Test the functionality of Unit-2 Logic gates and
- - -
PSO-01 to PSO-02 various logic gates. Boolean algebra
SO 2.5 LE 2.4 SL 2.2
SO 3.1 LE3.1 SL 3.1
PO-1 to PO-10 CO-3 Build and test various Unit-3 Combinational
- - -
PSO-01 to PSO-02 combinational circuits. Circuits
SO3.5 LE 3.5 SL 3.2
SO4.1 LE4.1
PO-1 to PO-10 CO-4Build and test various Unit-4 SEQUENTIAL -
- -
PSO-01 to PSO-02 sequential circuits. CIRCUITS
SO 4.4 LE4.5
SO5.1 LE5.1
PO-1 to PO-10 CO-5 Maintain various types of Unit-5 CONVERTERS
- - SL 5.1
PSO-01 to PSO-02 A/D converters, D/A converters. AND LOGIC FAMILIES
SO 5.2 LE5.2
Legend: CI: Classroom Instruction (Includes different instructional strategies i.e. Lecture (L) and Tutorial (T) and others) , LI : Laboratory Instruction
(Includes Practical performances in Laboratory, Workshop, field or other locations using different instructional strategies) SL: Self Learning

CSVTU, Bhilai - NITTTR, Bhopal Page 49

You might also like