Shri Shankaracharya Technical Campus

(An Autonomous Institute affiliated to Chhattisgarh Swami VivekanandaTechnical

University Bhilai)
SCHEME OF EXAMINATION AND SYLLABUS
B. Tech Second Year (3rd semester)
Computer Science and Engg. / Computer Science and Engg. (Artificial Intelligence) / Computer Science and Engg. (Artificial
Intelligence and Machine Learning) / Computer Science and Engg. (Data Science) / Computer Science and Engg. (Big Data
Analytics) / Computer Science and Engg.(Internet of Things) / Computer Science and Engg. (Gaming Technology) / Computer
Science and Engg. (Internet of Things and Cyber Security with Blockchain Technology)

Periods
Board of
per

Total Marks
Scheme of Exam
Studies week
S.N.

Course

Credit
(BOS) Courses(Subject Code Theory/Practical
L T P
ESE CT TA
Applied Engineering
1 AM100302 2 1 - 100 20 30 150 3
Mathematics Mathematics
Object Oriented
Comp. Sc. and
2 Programming with CS102301 3 0 - 100 20 30 150 3
Engineering
C++
Comp. Sc. and
3 Data Structure CS102302 2 1 - 100 20 30 150 3
Engineering
Comp. Sc. and
4 Operating System CS102303 3 0 - 100 20 30 150 3
Engineering
Comp. Sc. and Digital Electronics
5 CS102304 3 0 - 100 20 30 150 3
Engineering and Logic Design
Object Oriented
Comp. Sc. and
6 Programming with CS102391 - - 2 25 - 25 50 1
Engineering
C++ Lab
Comp. Sc. and Data Structure
7 CS102392 - -- 2 25 - 25 50 1
Engineering Lab
Comp. Sc. and Operating System
8 CS102393 - - 2 25 - 25 50 1
Engineering (Unix Lab)
Comp. Sc. and
9 Mini Project-I CS102394 - - 2 25 - 25 50 1
Engineering
Comp. Sc. and Health Hygiene &
10 CS100395 - - 2 - - 25 25 1
Engineering Yoga
Information Cyber Laws and
11 IT100396 - - - - - 25 25 -
Technology Ethics
Total 13 2 10 600 100 300 1000 20
 Engineering Mathematics
Subject Code L=2 T=1 P=0 Credits = 3
AM100302

ESE
Evaluation ESE CT TA Total
Duration
Scheme
100 20 30 150 3 hrs

Course Objective Course Outcomes

The objective of this course is to

familiarize the prospective engineers
with techniques in calculus of
multivariable and infinite series On successful completion of the
expansion of continuous function as course, thestudent will be able to:
well as some statistical treatment of
CO 1. To have a thorough knowledge of PDE which
discrete functions. More precisely, the
arise in mathematical descriptions of situations in
objectives are:
Engineering?
1. To instigate a thorough knowledge
of partial differential equations CO 2. To make the students understand that Fourier
which arise in mathematical series analysis is powerful methods where the
descriptions of situations in formulas are integrals and to have knowledge of
engineering? expanding periodic functions that explore variety of
2. To develop the tool of Fourier applications of Fourier series.
series for learning advanced CO3. To provide knowledge of Laplace transform
Engineering Mathematics. of elementary functions including its properties and
3. To provide knowledge of Laplace applications to solve ordinary differentials
transform of elementary functions equations.
including its properties and CO4. To study about a quantity that may take any of
applications to solve ordinary a given range of values that can’t be predicted as it
differential equations. is but can be described in terms of their probability
4. To originate a thorough study CO5. To study the technique of estimating the values
about random quantities and their of a function for any intermediate value of the
description in terms of their independent variable.
probability.
5. To provide a thorough
understanding interpolation.

UNIT – I [ 8 hrs]
Partial differential equation: Formation, Solution by direct integration method, Linear equation of
first order, Homogeneous linear equation with constant coefficients, Non- homogeneous linear
equations, Method of separation of variables; Equation of vibrating string (wave equation).

UNIT – II [ 7 hrs]
Fourier Series- Euler’s formula; Functions having point of discontinuity; Change of interval; Even
and Odd function; Half range series; Harmonic Analysis.
UNIT – III Laplace transform: Definition; Transform of elementary functions; Properties of Laplace
transform; Inverse Laplace Transform (Method of partial fraction, Using properties and Convolution
theorem); Transform of Unit step function and Periodic functions; Application to the solution of
ordinary differential equations.
 UNIT – IV [ 7 hrs]

Probability distributions: Random variable; Discrete and continuous probability distributions;

Mathematical expectation; Mean, Variance and Moments; Moment generating functions; Probability
distribution (Binomial, Poisson and Normal distributions).

UNIT – V [ 7 hrs]
Interpolation with equal and unequal intervals: Finite difference, Newton’s Forward and Backward
Difference Formulae, Central Difference Formula, Sterling’s Formula, Bessel’s Formula, Lagrange’s
Formula and Newton’s Divided Difference Formula.
Text Books:

S.No. Title Authors publisher

1) Higher Engineering Dr.B.S. Grewal Khanna Publishers

Mathematics
2) Numerical Methods in Dr.B.S. Grewal Khanna Publishers
Engineering and Science
Advanced Engineering John Wiley & Sons
3) Mathematics Erwin Kreyszig
Madan MohanSingh BS Publications
4) Applied Engineering
Mathematics

Reference Books:

S.No. Title Authors publisher

G. B. Thomas
Calculus and Analyticgeometry
1) and R. L. Finney Pearson, Reprint

Engineering Mathematicsfor first Tata McGraw- Hill,

2) T. Veerarajan
year New Delhi
Tata McGraw Hill
3) Higher EngineeringMathematics B. V. Ramana
New Delhi
A text book of Engineering N.P. Bali and Laxmi
4) Mathematics Manish Goyal Publications
 Object Oriented
Subject Code Programming with C++ L=3 T=0 P=0 Credits = 3
CS102301

Evaluation ESE CT TA Total ESE Duration

Scheme 100 20 30 150 3 hrs

Course Objective Course Outcomes

1. Understanding about object oriented At the end of the course, a student will be able
programming. to:
2. Gain knowledge about the capability to 1) Students will understand the concepts of
store information together in an object. flow of control, abstraction, pointer and
3. Understand the capability of a class to rely recursion.
upon another class. 2) Analyse a simple programming problem
4. Learn how to store one object inside specification.
another object and use of one method can be 3) Design a high-level solution to the problem
used in variety of different ways. using functional abstraction and general
5. Create and process data in files using file imperative programming language constructs.
I/O functions. 4) Write, compile, execute and debug a C++
6. Understand about constructors which are program which maps the high-level design
special type of functions. onto concrete C++ programming constructs.
7. Learn how to write code in a way that it is
independent of any particular type.

UNIT- I [ 8 hrs]
Object-Oriented Programming Concepts: Introduction, comparison between procedural
programming paradigm and object-oriented programming paradigm, basic concepts of object-oriented
programming: concepts of an object and a class, abstraction, encapsulation, data hiding, inheritance,
overloading, polymorphism, messaging. Structure of C++ program with simple C++ program, Control
structures, Function overloading, Function in C++ , the main function, Function prototyping, inline
function.

UNIT-II [ 7 hrs]
Classes and Objects: Specifying a class, creating class objects, accessing class members, access
specifies, and static members, use of const keyword, friends function, empty classes, nested classes,
local classes, abstract classes, container classes, bit fields and classes. String: Concept of string, string,
The standard C++ String class, Operations on Strings: length, capacity, resize, capacity, get line, begin,
end, copy, swap etc.

UNIT- III [ 7 hrs]

Pointers: Declaring and initializing pointers, accessing data through pointers, pointer arithmetic, pointer
to an object, this pointer, pointer related problems - dangling/wild pointers, null pointer assignment. ,
Dynamic Memory Management: dynamic memory management using new and delete operators.
Constructors and Destructors: Need for constructors and destructors, copy constructor, dynamic
constructors, explicit constructors, destructors, constructors and destructors with static members.
UNIT-IV [ 7 hrs]
Operator Overloading: Overloading operators, rules for overloading operators, overloading of various
operators, Type Conversion: type conversion - basic type to class type, class type to basic type, class
type to another class type. Inheritance: Introduction, defining derived classes, forms of inheritance,
ambiguity in multiple and multipath inheritance, virtual base class, object slicing, overriding member
functions, order of execution of constructors and destructors.

UNIT-V [ 7 hrs]
Virtual functions & Polymorphism: Concept of binding - early binding and late binding, virtual
functions, pure virtual functions, abstract class. Exception Handling: basics of exception handling,
exception handling mechanism, throwing mechanism, catching mechanism, rethrowing an exception,
specifying exceptions. Templates Programming: Template concepts, Function templates, class
templates. Files: File streams, hierarchy of file stream classes, error handling during file operations,
reading and writing of files, accessing records randomly, updating files.

Text Books:
S.No. Title Authors Publisher
Object Oriented
1 Lafore R Waite Group
Programming in C++
Object Oriented E.
2 Tata McGraw Hill
Programming with C++ Balagurusamy

ReferenceBooks:
S. No. Title Authors Publisher
Salaria Publishing
Mastering Object-Oriented
1 R. S. Salaria House.
Programming with C++
The C++ Programming Bjarne
2 Addison Wesley
Language Stroustrup
The Complete Reference to Herbert McGraw Hill-
3
C++ Language Schildt Osborne.
 Data Structure
Subject Code L=2 T=1 P=0 Credits = 3
CS102302

Evaluation ESE CT TA Total ESE Duration

Scheme 100 20 30 150 3 hrs

Course Objective Course Outcomes

CO1 Understand the concept of ADT

To make students aware of CO2 Identify data structures suitable to solve problems
efficient storage and systematic CO3 Develop and analyze algorithms for stacks, queues
operations on data using data
CO4 Develop algorithms for binary trees and graphs
structure
CO5 Implement sorting and searching algorithms
CO6 Implement symbol table using hashing techniques

UNIT-I [8 hrs]
Introduction: Basic Terminology, Elementary Data Organization, Algorithm, Efficiency of an
Algorithm, Time and Space Complexity, Asymptotic notations: Big-Oh, Small-Oh ,Omega , little
Omega and theta. Time-Space trade-off. Abstract Data Types (ADT) Arrays: Definition, Single and
Multidimensional Arrays, Representation of Arrays: Row Major Order, and Column Major Order,
Application of arrays, Sparse Matrices and their representations. Linked lists: Array Implementation
and Dynamic Implementation of Singly Linked Lists, Doubly Linked List, Circularly Linked List,
Operations on a Linked List. Insertion, Deletion, Traversal, Polynomial Representation and
Addition, Generalized Linked List.

UNIT-II [7 hrs]
Stacks: Abstract Data Type, Primitive Stack operations: Push & Pop, Array and Linked
Implementation of Stack in C, Application of stack: Prefix and Post fix Expressions, Evaluation of
post fix expression, Recursion, Tower of Hanoi Problem, Simulating Recursion, Principles of
recursion, Tail recursion, Removal of recursion Queues, Operations on Queue: Create, Add, Delete,
Full and Empty, Circular queues, Array and linked implementation of queues in C, Dequeue and
Priority Queue.

UNIT-III [7 hrs]
Trees: Basic terminology, Binary Trees, Binary Tree Representation: Array Representation and
Dynamic Representation, Complete Binary Tree, Algebraic Expressions, Extended Binary Trees, Array
and Linked Representation of Binary trees, Traversal algorithms: Inorder, Preorder and Postorder,
Threaded Binary trees.
UNIT-IV [7 hrs]
Graphs: Terminology, Sequential and linked Representations of Graphs: Adjacency Matrices,
Adjacency List, Adjacency Multi list, Graph Traversal : Depth First Search and Breadth First Search,
Connected Component, Spanning Trees, Minimum Cost Spanning Trees: Prims and Kruskal
algorithm. Transistive Closure and Shortest Path algorithm: Marshal Algorithm and Dijikstra
Algorithm.
 UNIT-V [7 hrs]
Searching: Sequential search, Binary Search, Complexity of Search Algorithm,Comparison and
Analysis Internal Sorting:I nsertion Sort, Selection, Bubble Sort, Quick Sort,Two Way Merge
Sort,Heap Sort, Radix Sort, Search Trees: Binary Search Trees(BST), Insertion and Deletion in BST,
AVL trees, Introduction to m-way Search Trees, B Trees & B+ Trees,
Hashing: Hash Function, Collision Resolution Strategies ,Storage Management: Garbage Collection
and Compaction.

Text Books:
S.No. Title Authors Publisher
Aaron M.
Tenenbaum,
Data Structures Using C
1 Yedidyah PHI
and C/C++”,
Langsamand Moshe
J. Augenstein
Fundamentals of Data GalgotiaPublication
2 Horowitz and Sahani
Structures

Reference Books:
S. No. Title Authors Publisher
Jean Paul
An Introduction to Data Trembleyand
1 McGrawHill
Structures with applications Paul
G.Sorenson
Data Structures and Program
2 R. Kruse etal Pearson Education
Design in C
Schaum’s Outline
3 Data Structures Lipschutz
Series,TMH
Data Structures and TMH
4 G A V Pai
Algorithms
 Operating System
Subject Code L=3 T=0 P=0 Credits = 3
CS102303
CT TA Total
Evaluation ESE ESE Duration
Scheme 100 20 30 150 3 hrs

Course Objective Course Outcomes

1. To learn what is operating system and how it makes

computers work.
1. Students will learn how 2. To know how operating system manages complexity
Operating System is Important through appropriate abstraction of CPU, memory, files,
for Computer System. semaphores etc.
2. To make aware of different 3. To get knowledge about different components of
types of Operating System and
operating system like Process Management,
their services. Concurrency mechanisms.
3. To learn different process
4. To get knowledge about Deadlock handling, Memory
scheduling algorithms and Management techniques
synchronization techniques to
5. To get knowledge about Virtual Memory, File System
achieve better performance of 6. To learn what is Secondary Storage Management,
a computer system. Security & protection etc.
4. To know virtual memory 7. Students will be able to Work confidently in Unix/Linux
concepts. environment.
5. To learn secondary memory 8. Students will understand different kernel algorithms and
management. its usage.

UNIT- I [8 hrs]
INTRODUCTION: Operation System objective and function, The Evolution of operating Systems,
Batch, interactive, time sharing and real time systems, Protection. Operating System Structure, System
Components, operating system service, System structure. Distributed Computing, The Key
Architecture Trend; Parallel Computation, Input-Output Trends.

UNIT-II [7 hrs]
CONCURRENT PROCESSES: Process concept: Introduction, Definitions of “Process”, Process
States, Process State Transitions, The process Control Block, Operations on Processes, Suspend and
Resume, Interrupt Processing. Mutual Exclusion, the Producer / Consumer problem, the critical section
problem, Semaphores, Classical problems in concurrency, inter process communication. Asynchronous
Concurrent Process: introduction, parallel Processing, A Control Structure for indicating parallelism.
CPU scheduling: concepts, performance criteria, and scheduling Algorithms. Algorithm evaluation,
Multiprocessor scheduling.

UNIT- III [7 hrs]

DEAD LOCKS: System model, Deadlock characterization. Prevention, Avoidance and Detection,
Recovery from deadlock, combined approach. MEMORY MANAGEMENT: Base machine, resident
Monitor, multiprogramming with fixed partition, Multiprogramming with variable partitions, Paging,
Segmentation, paged - segmentation, virtual Memory concepts, Demand paging, performance, page
Replacement algorithms, Allocation of frames, Thrashing, cache memory organization impact on
performance.

UNIT-IV [7 hrs]
I/O MANAGEMENT &DISK SCHEDULING: I/O device and the organization of the I/O function,
I/O Buffering, Disk I/O, Operating system Design issues. File system: File Concepts – File organization
and Access mechanism, File Directories, File sharing, Implementation issues.

UNIT-V [7 hrs]
FILE MANAGEMENT of UNIX OS: File Structures, System Calls for File Management system,
INODES, Structure of Regular File, Directories,Conversions of a Path, name to an INODE, Super
Block, INODE Assignment to a New File create, open, close, read, write, lseek, link, symlink unlink,
stat, fstat, lstat, chmod, chown, Directory API – opendir, readdir, closedir, mkdir, rmdir, umask.

Text Books:
S.No. Title Authors Publisher
Silberscatz A
1 Operating System concepts J.L, PE- LPE
and Peterson
Operating System Design &
2 Tanenbaum A.S., PHI.
Implementation
Operating system concepts John Weiley &
3 Silberscatz
Galvin Sons
4 Operating systems H.M.Deital Pearson Education

Reference Books:
S. No. Title Authors Publisher
Operating System in Depth Thomas Wiley India
1
Design and Programming Doeppner
Operating System Concept &
2 Milenkovic M McGraw Hill
Design
Stalling
3 Operation System William, MCMillan
Maxwell
Graham
Unix for programmers and
4 Glass, King Pearson education
users
Ables
 Digital Electronics and
Subject Code L=3 T=0 P=0 Credits = 3
Logic Design CS102304

Evaluation ESE CT TA Total ESE Duration

Scheme 100 20 30 150

Course Objective Course Outcomes

1. To present the Digital fundamentals,

Boolean algebra and its applications in At the end of the course:
digital systems. 1. Use digital electronics in the present
contemporary world.
2. To familiarize with the design of various 2. Design various combinational digital
combinational digital circuits using logic circuits using logic gates.
gates. 3. Do the analysis and design procedures for
3. To introduce the analysis and design synchronous and asynchronous sequential
procedures for synchronous and circuits.
asynchronous sequential circuits. 4. Use the semiconductor memories and
4. To explain the various semiconductor related technology.
memories and related technology. 5. Use electronic circuits involved in the
5. To introduce the electronic circuits design of logic gates.
involved in the making of logic gates.

UNIT I [8 hrs]
DIGITAL FUNDAMENTALS:Number Systems – Decimal, Binary, Octal, Hexadecimal, Weighted &
Non Weighted codes, Sequential Codes, 1‘s and 2‘s complements, Codes – Binary, BCD, Excess 3, Gray,
8-4-2-1BCD, Error Detecting/Correcting codes, Code conversions, Boolean theorems, Logic gates,
Universal gates, Sum of products and Product of sums, Minterms and Maxterms, Karnaugh’s Map
Minimization(up 4 terms) and Quine-McCluskey minimization(up 5 terms).Realization of functions using
gates, Simulate the DMorgan’s Theoram and universal gates using Logisim Software.

UNIT II [7 hrs]

COMBINATIONAL CIRCUIT DESIGN: Design of Half and Full Adders, Half and Full Subtractors,
Binary ParallelAdder – Carry look ahead Adder,Serial Adder, BCD Adder, Code Converter, Parity bit
Generator/Checker. Decoders and Encoders, Multiplexer and Demultiplexer (up to 8 input/output),
Multiplexer as universal logic function generator. Magnitude Comparator, Decoder, Encoder, Priority
Encoder, Simulate all combinational circuits like adder, subtractor, multiplexer using Logisim software.

UNIT III [7 hrs]

SYNCHRONOUS SEQUENTIAL CIRCUITS:Flip flops – SR, JK, T, D, Master/Slave FF – operation

and excitation tables, Triggering of FF, circuit implementation – Design of Counters- Ripple Counters,
Ring Counters, Shift registers, Universal Shift Register.Analysis anddesign of clocked sequential circuits
– Design – Moore/Mealy models,state minimization, state assignment, Simulate the counter and shift
register using Logisim software.

UNIT IV [7 hrs]

ASYNCHRONOUS SEQUENTIAL CIRCUITS:Stable and Unstable states, output specifications,

cycles and races, state reduction, race free assignments, Hazards, Essential Hazards, Pulse mode
sequential circuits, Design of Hazard free circuits.

UNIT V [7 hrs]

MEMORY DEVICES AND DIGITAL INTEGRATED CIRCUITS:Basic memory structure – ROM

-PROM – EPROM – EEPROM –EAPROM, RAM – Static and dynamic RAM – Programmable Logic
Devices – Programmable Logic Array (PLA) – Programmable Array Logic (PAL) – Field Programmable
Gate Arrays (FPGA) – Implementation of combinational logic circuits using PLA, PAL.Digital
integrated circuits: Logic levels, propagation delay, power dissipation, fan-out and fan-in, noisemargin,
logic families and their characteristics-RTL, TTL, ECL, CMOS.

Case Study: Recent Memory Devices and their specifications

Text Books:
S.No. Title Authors Publisher
Tata McGraw Hill
1 Modern digital Electronics R.P. Jain
Digital Electronics- An PHI
W.H.
2 introduction to theory and
Gothmann
practice
Tata McGraw Hill,
3 Digital Circuits and Systems D.V. Hall 1989

Pearson Education
4 Digital Fundamentals Floyd & Jain

Tata McGraw Hill

5 Digital Electronics A. P. Malvino

Reference Books:
S. No. Title Authors Publisher
Tata McGraw Hill
1 Modern digital Electronics R.P. Jain
Digital Electronics- An PHI
W.H.
2 introduction to theory and
Gothmann
practice
Tata McGraw Hill,
3 Digital Circuits and Systems D.V. Hall
1989
4 Digital Fundamentals Floyd & Jain Pearson Education
5 Digital Electronics A. P. Malvino Tata McGraw Hill
 Object Oriented
Subject Code Programming with C++ L=0 T =0 P=2 Credits = 1
Lab CS102391

Evaluation ESE CT TA - ESE Duration

Scheme 25 - 25 -

Course Objective Course Outcomes

Upon successful completion of this Lab the

student will be able to:
1. You will be able to know about Object
oriented programming.
The objective of course is to develop 2. Use Abstract Data Types in the programs.
programming skills of students, using object 3. Application of Non recursive functions.
oriented programming concepts, learn the 4. OOP principles like Encapsulation
concept of class and object using C++ and Inheritance Polymorphism were frequently
develop classes for simple applications. used.
5. Different sorting techniques (Quick sort,
Merge sort, Heap sort)were used.
6. Polymorphism and exception handling in
the programs.

List of Experiments: [12 hrs]

(At least Ten experiments are to be performed by each student)

1. Write a Program to check whether number is prime or not.

2. Write a Program to read number and to display the largest value between: (a) Two number, (b)Three
Numbers, (c) Four
3. numbers by using switch-case statements.
4. Write a Program to find sum of first natural numbers: sum= 1+2+3+4+……. 100 by using(a) for loop,
(b)while loop, (c) dowhile
5. loop
6. Write a Program to find sum of the following series using function declaration:
Sum= x-(x)3/3!+(x)5/5!-………..(x)n/n!
7. Write a Program to read the element of the given two matrixes & to perform the matrix multiplication.
8. Write a Program to exchange the contents of two variables by using (a)Call by value, (b)Call by
reference.
9. Write a Program to perform the following arithmetic operations of a complex number using astructure:
(a) Addition of two complex numbers, (b) Subtraction of two complex numbers, (c) Multiplication of
two complex numbers, (d) Division of two complex numbers.
10. Write an object oriented program (OOP) using C++ to exchange the private data members of two
different functions using friend Functions.
11. Write an OOP using C++ to count how many times a particular member function of a class is called
by: (a) A particular object, (b) Any objects
12. Write an OOP using C++ to define a constructor for a “Date” class that initializes the Date objects
with initial values. In case initial values are not provided, it should initialize the objects with default
values.
 Data Structure Lab
Subject Code L=0 T=0 P=2 Credits = 1
CS102392
 Evaluation ESE CT TA - ESE Duration
Scheme 25 - 25 - -

Course Objective Course Outcomes

The goals of the course are to CO1 Develop ADT for stack and queue applications
develop the basic programming CO2 Implement tree and graph algorithms
skills in students, and to improve CO3 Implement and analyze internal and external sorting
their proficiency in applying the algorithms
basic knowledge of programming CO4 Design and implement symbol table using hashing
to solve problems related to their technique
field of engineering.

List of Experiments : [12 hrs]

( At least ten experiments are to be performed by each student)
1. Write a program to perform following operations in one dimensional array, Insertion,
Deletion
and Searching (Linear & Binary).
2. Write a program to implement stack and perform push and pop operations.
3. Write a program to convert infix to postfix expressions using stack.
4. Write a program to perform following operations on a linear queue-addition, deletion,
traversing.
5. Write a program to perform following operations on a circular queue-addition, deletion,
traversing.
6. Write a program to perform following operations on a double ended queue-
addition, deletion, traversing.
7. Write a program to perform following operations on a single link list-creation, inversion,
deletion.
8. Write a program to perform following operations on a double link list–creation, insertion,
deletion.
9. Write a program to perform implement polynomial in link list and perform.
a) Polynomial arithmetic b)Evaluation o f polynomial
10. Write a program to perform implement a linked stack and linked queue.
11. Write a program to perform Insertion, selection and bubble sort.
12. Write a program to perform quick sort.
13. Write a program to perform merge sort.
14. Write a program to perform heap sort.
15. Write aprogramtocreateaBinarysearchtreeandperform–insertion,deletion&traversal.
16. Write a program to traversal of graph(B.F.S,D.F.S)

Operating System
Subject Code L=0 T=0 P=2 Credits = 1
(Unix Lab) CS102393
 Evaluation ESE CT TA - ESE Duration
Scheme 25 - 25 - -

Course Objective Course Outcomes

The objectives of this lab is : CO1 Students will be able to Work confidently in
Unix/Linux environment
1. To familiarize students with the CO2 Students will able to Write shell scripts to automate
architecture of Unix OS. various tasks
2. To provide necessary skills for CO3 Students will understand different commands on Unix
developing and debugging and its usage
programs in UNIX CO4 Students will be able to describe and use the
environment. fundamental UNIX system tools and utilities
CO5 Students will understand different kernel algorithms
and its usage
CO6 Students will understand different flavors’ of UNIX and
their importance

Note: Use Bash for Shell scripts.

List of Experiment to be performed [12 hrs]

1. Unix Commands – PATH, man, echo, printf, script, passwd, uname, who, date, stty, pwd, cd, mkdir,
rmdir, ls, cp, mv, rm, cat, more, wc, lp, od, tar, gzip
2. Unix Commands- FILTERS: Filters and Pipes, Concatenating files, Display Beginning and End of
files, Cut and Paste, Sorting, Translating Characters, Files with Duplicate Lines, Count Characters
, Words or Lines, Comparing Files.
3. Unix Commands – grep, egrep, sed, awk
4. a. Write a shell script to accept three numbers and display the largest.
b. Write a shell script to find the number of files in a directory.
5. a. Write a shell script to display first ten positive numbers using until loop
b. Write a shell script to check whether a file is existing or not.
6. a. Write a shell script to find the mode of a file in a directory.
b. Write a shell script which will accept different numbers and find their sum.
7. a. Write a menu driven program to display a menu of options and depending upon the user’s choice
execute the associated command.
b. Write a shell script to print the first 10 odd numbers using the while loop.
8. a. Write a shell script to check if a particular user has logged in or not. If not, continue the loop till
he/she logins. Once the required user logins, display a message.
b. Write a shell script to reverse the digits of a given number.
9. a. Write a shell script to list all of the directory files in a directory.
b. Write a shell script to find factorial of a given integer.
10. a. Write a shell script that displays a list of all the files in the current directory to which the user
has read, write and execute permissions.
11. Write a shell script that receives any number of file names as arguments checks if every argument
supplied is a file or a directory and reports accordingly. Whenever the argument is a file, the number
of lines on it is also reported.
12. Write a shell script that accepts a file name, starting and ending line numbers as arguments
and displays all the lines between the given line numbers.
13. Write a shell script that deletes all lines containing a specified word in one or more files
supplied as arguments to it.
14. a. Write a shell script to accept the name, grade, and basic salary from the user. Write the details into
a file called employee, separating the fields with a colon (,) continue the process till the user wants.
b. Write a shell script to calculate the total salary payable to all the employees from the employee
file. The salary should be taken from the 8th field of the employee file.
15. a. Write an awk script to count the number of lines in a file that do not contain vowels.
b. Write an awk script to find the number of characters, words and lines in a file
16. a. Write a script to print fibonacci series.
b. Write a script to print the input number is prime or not.

Subject Code Mini Project-I CS102394 L=0 T=0 P=2 Credits = 1

 Evaluation ESE CT TA - ESE Duration
Scheme 25 - 25 -

Course Objective Course Outcomes

The objectives of this lab is :

The objective of this course is to On successful completion of the course, the student
improve student’s ability to will be able to:
analyze, design and solve
complex engineering problems CO1: Identify, discuss and justify the technical aspects
through pedagogies (Project of the chosen project with a comprehensive and
Based Learning) that support systematic approach.
them in developing these skills. CO2: Reproduce, improve and refine technical aspects of
Thegoal here is not to passively engineering projects applying appropriate techniques,
absorb and reiterate information; resources, and modern engineering and IT tools.
but rather to actively engage with
the content, work through it with CO3: Work as an individual and as a member or leader
others, relate to it through an in teams in development of technical projects.
analysis, use modern tools and CO4: Follow management principle and value
effectively solve problems with health, safety and ethical practices during project.
the corresponding knowledge
gained. CO5: Communicate and report effectively project
related activities and findings.

The Process Followed to Maintain the Quality of Student Projects are: [12 Hrs]
(a) Allotments of Projects
(b) Project Identification
(c) Continuous Monitoring
(d) Evaluation
(a) Allotment of Projects:
(i) Students form their team (max four students) and submit their areas in which they would
like to pursue their projects.
(ii) Through meeting and deliberations students are allotted guide depending on their
preference and maximum number of groups under a faculty is limited to three.
(b) Identification of projects:
Students are asked to formulate problem statement and state objectives of their project in
consultation with the project guide.
(c) Continuous Monitoring
(i) Progress is continuously monitored by guide and instructions are given how to proceedfurther
during their project periods as per time table.
(ii) Students submit weekly progress report to the project in-charge after consultation withtheir
project guide.
(d) Evaluation

(i) In order to evaluate projects two project seminars (assessment) are taken in whichstudent’s
team present their project through presentations and demonstrate their work.
(ii) Students are assessed on the basis of their technical skill implementation, use of modern tools,
communication skill, team work, health, safety and ethical practices and relevance of the
project.
(iii) At the end of the semesters a report is submitted by the students and student’s projectsare
finally evaluated by external examiner in end semester practical examination based
 Health Hygiene & Yoga
Subject Code L=0 T=0 P=2 Credits = 1
CS100395

Evaluation ESE CT TA - ESE Duration

Scheme 25 - 25 -

Cyber Laws and Ethics

Subject Code L=0 T=0 P=0 Credits = 0
IT100396

Evaluation ESE CT TA - ESE Duration

Scheme - - 25 - -