II_Syllabus-SVIIT-CSE-BTech(CSE)-2021-22-(Credit-24)-{WoS} (1)
II_Syllabus-SVIIT-CSE-BTech(CSE)-2021-22-(Credit-24)-{WoS} (1)
CREDITS
PRACTICAL
COURSE
CATEGORY COURSE NAME L T P
Assessment
Assessment
END SEM
END SEM
University
University
Two Term
CODE
Teachers
Teachers
Exam
Exam
Exam
*
BTMACS 60 20 20 0 0 3 1 0 4
BS Mathematics-II
201
Legends: L - Lecture; T - Tutorial/Teacher Guided Student Activity; P – Practical; C - Credit;
*Teacher Assessment shall be based following components: Quiz/Assignment/ Project/Participation in
Class, given that no component shall exceed more than 10 marks.
Syllabus:
UNIT I 10HRS
Calculus of Matrices
Systems of linear equations and their solutions.Matrices, determinants, rank and
inverse.Linear transformations. Range space and rank, null space and nullity. Eigenvalues
and eigenvectors.Similarity transformations.Diagonalization of Hermitian matrices.
UNIT II 9HRS
Differential Equation
Ordinary Differential Equations: First order linear and nonlinear ordinary differential
equations, exactness and integrating factors. Ordinary linear differential equations of n-th
order, solutions of homogeneous and non-homogeneous equations.Operator method.Method
of undetermined coefficients and variation of parameters.
CREDITS
PRACTICAL
COURSE
CATEGORY COURSE NAME L T P
Assessment
Assessment
END SEM
END SEM
University
University
Two Term
CODE
Teachers
Teachers
Exam
Exam
Exam
*
BTMACS 60 20 20 0 0 3 1 0 4
BS Mathematics-II
201
Legends: L - Lecture; T - Tutorial/Teacher Guided Student Activity; P – Practical; C - Credit;
*Teacher Assessment shall be based following components: Quiz/Assignment/ Project/Participation in
Class, given that no component shall exceed more than 10 marks.
UNIT IV 7HRS
Numerical Solution of ODE: Euler's Method for Numerical Solution of ODE; Modified
Euler's Method; Runge‐Kutta Method (RK2, RK4); Multistep Method: Predictor‐Corrector
method.
UNIT V 8HRS
Probability Theory and Random Process
Axiomatic construction of the theory of probability, independence, conditional probability,
and basic formulae, random variables, binomial, Poisson and normal random variable,
probability distributions, functions of random variables; mathematical expectations,
Definition and classification of random processes, discrete-time Markov chains.
Text Books:
1. G. Strang, Linear Algebra And Its Applications, 4th Edition, Brooks/Cole, 2006
2. S. L. Ross, Differential Equations, 3rd Edition, Wiley, 1984.
3. E. A. Coddington, An Introduction to Ordinary Differential Equations, Prentice Hall,
1995.
4. W.E. Boyce and R.C. DiPrima, Elementary Differential Equations and Boundary Value
Problems, 7th Edition, Wiley, 2001.
5. E, K. E. Atkinson, Numerical Analysis, John Wiley, Low Price Edition (2004).
6. S. D. Conte and C. de Boor, Elementary Numerical Analysis ‐ An Algorithmic Approach,
McGraw‐Hill, 2005.
7. B. S. Grewal, Higher Engineering Mathematics, Khanna Publishers, Delhi.
CREDITS
PRACTICAL
COURSE
CATEGORY COURSE NAME L T P
Assessment
Assessment
END SEM
END SEM
University
University
Two Term
CODE
Teachers
Teachers
Exam
Exam
Exam
*
BTMACS 60 20 20 0 0 3 1 0 4
BS Mathematics-II
201
Legends: L - Lecture; T - Tutorial/Teacher Guided Student Activity; P – Practical; C - Credit;
*Teacher Assessment shall be based following components: Quiz/Assignment/ Project/Participation in
Class, given that no component shall exceed more than 10 marks.
References:
1. E. Kreyszig, Advanced Engineering Mathematics, 9th Edition, Wiley, 2005.
2. R. G. Bartle and D. R. Sherbert, Introduction to Real Analysis, 5th Ed, Wiley,1999.
3. J. Stewart, Calculus: Early Transcendentals, 5th Ed, Thomas Learning (Brooks/
Cole), Indian Reprint, 2003.
4. J. Stoer and R. Bulirsch, Introduction to Numerical Analysis, 2nd Edition, Texts in
Applied Mathematics, Vol. 12, Springer Verlag, 2002.
5. J. D. Hoffman, Numerical Methods for Engineers and Scientists, McGraw Hill, 2001.
6. M.K Jain, S.R.K Iyengar and R.K Jain, Numerical methods for scientific and
engineering computation (Fourth Edition), New Age International (P) Limited, New
Delhi,2004.
7. S. C. Chapra, Applied Numerical Methods with MATLAB for Engineers and
Scientists, McGraw Hill2008.
CREDITS
THEORY PRACTICAL
Assessment
Assessment
COURSE
END SEM
END SEM
University
University
Two Term
Teachers
Teachers
CATEGORY COURSE NAME L T P
Exam
Exam
Exam
CODE
*
HUCS101 SEC Communication 60 20 20 30 20 1 0 2 2
Skills
Legends: L - Lecture; T - Tutorial/Teacher Guided Student Activity; P – Practical; C - Credit;
*Teacher Assessment shall be based following components: Quiz/Assignment/ Project/Participation in
Class, given that no component shall exceed more than 10 marks.
Syllabus:
UNIT I 10HRS
Communication: Nature, Meaning, Definition,Verbal and Non Verbal Communication Barriers
to Communication.
UNIT II 9HRS
Basic Language Skills: Grammar and usage- Parts of Speech, Tenses, S-V Agreement,
Preposition, Article.
CREDITS
THEORY PRACTICAL
Assessment
Assessment
COURSE
END SEM
END SEM
University
University
Two Term
Teachers
Teachers
CATEGORY COURSE NAME L T P
Exam
Exam
Exam
CODE
*
HUCS101 SEC Communication 60 20 20 30 20 1 0 2 2
Skills
Legends: L - Lecture; T - Tutorial/Teacher Guided Student Activity; P – Practical; C - Credit;
*Teacher Assessment shall be based following components: Quiz/Assignment/ Project/Participation in
Class, given that no component shall exceed more than 10 marks.
UNIT IV 7HRS
Business Correspondence: Business Letter, Parts & Layouts of Business Resume and
Job application, E-mail writing.
UNIT V 8HRS
Report Writing: Importance of Report, Types of Report, Structure of a Report.
List of Practical’s:
1. SelfIntroduction
2. Reading Skills and ListeningSkills
3. OralPresentation
4. Linguistics andPhonetics
5. JAM (Just aMinute)
6. GroupDiscussion
Suggested Readings:
1. Ashraf Rizvi.(2005).EffectiveTechnical Communication. NewDelhi:TataMcGrawHill
2. Adair, John (2003). Effective Communication. London: Pan Macmillan Ltd.
3. A.J.ThomsonandA.V.Martinet(1991).APracticalEnglishGrammar(4thed).Newyork:Ox-
fordIBH Pub.
4. Kratz, Abby Robinson (1995). Effective Listening Skills. Toronto: ON: Irwin
Professional Publishing.
5. Prasad, H. M.(2001) How to Prepare for Group Discussion and Interview. New
Delhi: Tata McGraw-Hill.
6. Pease, Allan. (1998).Body Language. Delhi: SudhaPublications.
CREDITS
THEORY PRACTICAL
Assessment
Assessment
END SEM
END SEM
University
University
Two Term
Teachers
Teachers
COURSE CODE CATEGORY COURSE NAME L T P
Exam
Exam
Exam
*
Data Structure
BTCS201N DCC 60 20 20 30 20
and Algorithms 3 1 2 5
Legends: L - Lecture; T - Tutorial/Teacher Guided Student Activity; P – Practical; C - Credit;
*Teacher Assessment shall be based following components: Quiz/Assignment/ Project/Participation in
Class, given that no component shall exceed more than 10 marks.
Syllabus:
UNIT I 10HRS
Introduction: Overview of Data structures, Types of data structures, Primitive and Non
Primitive data structures and Operations, Introduction to Algorithms & complexity
notations. Characteristic of Array, One Dimensional Array, Operation with Array, Two
Dimensional Arrays, Three or Multi-Dimensional Arrays, Sparse matrix, Drawbacks of
linear arrays. Strings, Array of Structures, Pointer and one dimensional Arrays, Pointers and
Two Dimensional Arrays, Pointers and Strings, Pointer and Structure.
CREDITS
THEORY PRACTICAL
Assessment
Assessment
END SEM
END SEM
University
University
Two Term
Teachers
Teachers
COURSE CODE CATEGORY COURSE NAME L T P
Exam
Exam
Exam
*
Data Structure
BTCS201N DCC 60 20 20 30 20
and Algorithms 3 1 2 5
Legends: L - Lecture; T - Tutorial/Teacher Guided Student Activity; P – Practical; C - Credit;
*Teacher Assessment shall be based following components: Quiz/Assignment/ Project/Participation in
Class, given that no component shall exceed more than 10 marks.
UNIT II 9HRS
Linked List: Linked List as an ADT, Linked List Vs. Arrays, Dynamic Memory Allocation &
De-allocation for a Linked List, Types of Linked List: Circular & Doubly Linked List. Linked
List operations: All possible insertions and deletion operations on all types of Linked list
Reverse a Single Linked List; Divide a singly linked list into two equal halves, Application of
Linked List.
UNIT IV 7HRS
Tree: Definitions and Concepts of Binary trees, Types of Binary Tree, Representation of
Binary tree: Array & Linked List. General tree, forest, Expression Tree. Forest and general
tree to binary tree conversion. Binary Search Tree Creation, Operations on Binary Search
Trees: insertion, deletion & Search an element, Traversals on Binary SEARCH TREE and
algorithms. Height balanced Tree: AVL, B-Tree, 2-3 Tree, B+Tree: Creation, Insertion &
Deletion.
Graph: Definitions and Concepts Graph Representations: Adjacency MATRIX, Incidence
matrix, Graph TRAVERSAL (DFS & BFS), Spanning Tree and Minimum Cost Spanning
Tree: Prim‟s & Kruskal‟s Algorithm.
UNIT V 8HRS
Sortings: Sorting Concept and types of Sorting, Stable & Unstable sorting. Concept of
Insertion Sort, Selection sort, Bubble sort, Quick Sort, Merge Sort, Heap & Heap Sort, Shell
Sort & Radix sort. Algorithms and performance of Insertion, selection, bubble, Quick sort
& Merge sort.
CREDITS
THEORY PRACTICAL
Assessment
Assessment
END SEM
END SEM
University
University
Two Term
Teachers
Teachers
COURSE CODE CATEGORY COURSE NAME L T P
Exam
Exam
Exam
*
Data Structure
BTCS201N DCC 60 20 20 30 20
and Algorithms 3 1 2 5
Legends: L - Lecture; T - Tutorial/Teacher Guided Student Activity; P – Practical; C - Credit;
*Teacher Assessment shall be based following components: Quiz/Assignment/ Project/Participation in
Class, given that no component shall exceed more than 10 marks.
Text Books:
1. Ashok N. Kamthane, “Introduction to Data structures”, 2nd Edition, Pearson Education
India, 2011.
2. Tremblay & Sorenson, “Introduction to Data- Structure with applications”, 8th Edition, Tata
McGrawHill, 2011.
3. Bhagat Singh & Thomas Naps, “Introduction to Data structure”, 2nd Edition, Tata Mc-
GrawHill 2009.
4. Robert Kruse, “Data Structures and Program Design”, 2nd Edition, PHI, 1997.
5. Lipschutz Seymour,”Data structures with C” ,1st Edition ,Mc- GrawHill,2017.
References:
1. Rajesh K. Shukla, Data Structures Using C & C++, Wiley-India 2016.
2. ISRD Group, Data Structures Using C, TataMcGraw-Hill 2015.
3. E. Balagurusamy,”Data Structure Using C”, Tata McGraw-Hill 2017.
4. Prof. P.S. Deshpande, Prof. O.G. Kakde, C & Data Structures, Charles River Media 2015.
5. Gav Pai, Data Structures, Tata McGraw-Hill, 2015.
List of Practical:
1. To develop a program to find an average of an array using AVG function.
2. To implement a program that can insert, delete and edit an element in array.
3. To implement an algorithm for insert and delete operations of circular queue and
implement the same using array.
4. Write a menu driven program to implement the push, pop and display option of the stack
with the help of static memory allocation.
5. Write a menu driven program to implement the push, pop and display option of the stack
with the help of dynamic memory allocation.
6. Write a menu driven program to implementing the various operations on a linear queue
with the help of static memory allocation.
7. Write a menu driven program to implementing the various operations on a linear queue
with the help of dynamic memory allocation.
8. Write a menu driven program to implement various operations on a linear linked list.
9. Write a menu driven program to implement various operations on a circular linked list
10. Write a program for implementation of Bubble sort
11. Write a program for Insertion sort
CREDITS
THEORY PRACTICAL
Assessment
Assessment
END SEM
END SEM
University
University
Two Term
Teachers
Teachers
COURSE CODE CATEGORY COURSE NAME L T P
Exam
Exam
Exam
*
Data Structure
BTCS201N DCC 60 20 20 30 20
and Algorithms 3 1 2 5
Legends: L - Lecture; T - Tutorial/Teacher Guided Student Activity; P – Practical; C - Credit;
*Teacher Assessment shall be based following components: Quiz/Assignment/ Project/Participation in
Class, given that no component shall exceed more than 10 marks.
CREDITS
THEORY PRACTICAL
Assessment
Assessment
END SEM
END SEM
University
University
Two Term
Teachers
Teachers
COURSE CODE CATEGORY COURSE NAME L T P
Exam
Exam
Exam
*
Object Oriented
BTCS202N DCC 60 20 20 30 20 3
Programming 2 0 2
Legends: L - Lecture; T - Tutorial/Teacher Guided Student Activity; P – Practical; C - Credit;
*Teacher Assessment shall be based following components: Quiz/Assignment/ Project/Participation in
Class, given that no component shall exceed more than 10 marks.
Syllabus
Unit-I 10HRS
Concepts of OOP: Introduction OOP, Procedural vs. Object Oriented Programming, Principles
of OOP, Benefits and applications of OOP. C++ Basic Overview, Program structure, namespace,
identifiers, variables, constants, enum, operators, typecasting, control structures.
Unit-II 9HRS
C++ Functions: The Main Function, Function prototyping, Simple functions, Call and Return
by reference, Inline functions, Macro Vs. Inline functions, Overloading of functions, default
arguments.
CREDITS
THEORY PRACTICAL
Assessment
Assessment
END SEM
END SEM
University
University
Two Term
Teachers
Teachers
COURSE CODE CATEGORY COURSE NAME L T P
Exam
Exam
Exam
*
Object Oriented
BTCS202N DCC 60 20 20 30 20 3
Programming 2 0 2
Legends: L - Lecture; T - Tutorial/Teacher Guided Student Activity; P – Practical; C - Credit;
*Teacher Assessment shall be based following components: Quiz/Assignment/ Project/Participation in
Class, given that no component shall exceed more than 10 marks.
Unit-III 8HRS
Objects and Classes: Basics of object and class in C++, Private and public members, static data
and function members, constructors and their types, destructors, operator overloading, friend
function.
Unit-IV 7HRS
Polymorphism: Polymorphism and its types, Pointers in C++, Pointes and Objects, this pointer,
virtual and pure virtual functions, Implementing polymorphism, Abstract Methods and Classes.
Exception Handling, Templates function and class in C++
Unit-V 8HRS
I/O and File management: Concept of Streams, Cin and Cout Objects, C++ Stream Classes,
Unformatted and Formatted I/O, Manipulators, File Stream, C++ File Stream Classes, File
Management Functions, File Modes, Binary and Random Files.
Text Books:
1. David Parsons; Object oriented programming with C++; Second edition; BPB publication;
1997.
2. Robert Lafore; Object oriented programming in C++ ; Fourth edition ; Pearson
publication;2002 .
3. E Balagurusamy; Object oriented programming with C++; Seven edition; TMH; 2017.
4. Herbert Schildt ; Java Complete Reference;Seven edition; McGrawHill; 2006 .
CREDITS
THEORY PRACTICAL
Assessment
Assessment
END SEM
END SEM
University
University
Two Term
Teachers
Teachers
COURSE CODE CATEGORY COURSE NAME
Exam
Exam
Exam
*
Object Oriented
BTCS202N DCC 60 20 20 30 20 2 0 2 3
Programming
Legends: L - Lecture; T - Tutorial/Teacher Guided Student Activity; P – Practical; C - Credit;
*Teacher Assessment shall be based following components: Quiz/Assignment/ Project/Participation in
Class, given that no component shall exceed more than 10 marks.
References:
List of Experiments:
1. Write a program to display the following output using a single cout statement.
Maths=90, Physics=74, Chemistry=76
2. Write a program to read 2 numbers from the keyboard and display the larger value on the
screen.
3. Write a function using reference variables as arguments to swap the values of a pair of
integers.
4. Write a macro that obtains the largest of 3 numbers.
5. Define a class to represent a bank account. Include the following members:
Data members
1.Name of the depositor
2.Account number
3.Type of account
4.Balance amount in the account
Member functions
1.To assign initial values
2.To deposit an amount
3.To withdraw an amount after checking the balance
4.To display name and balance
Write a main program to test the program.
6. Create two classes DM and DB which store the value of distances. DM stores distances
in meters and centimeters and DB in feet and inches. Write a program that can read
values for the class objects and odd one object of DM with another object of DB.
CREDITS
THEORY PRACTICAL
Assessment
Assessment
END SEM
END SEM
University
University
Two Term
Teachers
Teachers
COURSE CODE CATEGORY COURSE NAME L T P
Exam
Exam
Exam
*
Object Oriented
BTCS202N DCC 60 20 20 30 20 2 0 2 3
Programming
Legends: L - Lecture; T - Tutorial/Teacher Guided Student Activity; P – Practical; C - Credit;
*Teacher Assessment shall be based following components: Quiz/Assignment/ Project/Participation in
Class, given that no component shall exceed more than 10 marks.
Use a friend function to carry out the addition operation. The object that stores the results
may be a DM object or DB object, depending on the units in which the result are required.
The display should be in the format of feet and inches or meters and centimeters depending
on the object on display.
7. Design a constructor for bank account class.
8. A book shop maintains the inventory of books that are being sold at the shop. The list
includes details such as author, title, price, publisher and stock position. Whenever a
customer wants a book, the sales person inputs the title and author and the system
searches the list and displays whether it is available or not. If it is not, an appropriate
message is displayed. If it is, then the system displays the book details and requests for
the number of copies required. If the requested copies book details and requests for the
number of copies required. If the requested copies are available, the total cost of the
requested copies is displayed; otherwise the message “Required copies not in stock” is
displayed.
Design a system using a class called books with suitable member functions and
Constructors. Use new operator in constructors to allocate memory space required.
9. Improve the system design in exercise 8 to incorporate the following features:
(a) The price of the books should be updated as and when required. Use a private
member function to implement this.
(b) The stock value of each book should be automatically updated as soon as a
transaction is completed.
(c) The number of successful transactions should be recorded for the purpose of
statistical analysis. Use static data members to keep count of transaction.
10. Design a C++ Class „Complex‟ with data member‟s for real and imaginary part. Provide
default and parameterized constructors. Write a program to perform arithmetic
operations of two complex numbers using operator overloading (using either member
functions or friend functions).
11. Assume that a bank maintains two kinds of accounts for customers, one called as savings
account and the other as current account. The savings account provides compound
interest and withdrawal facilities but no cheque book facility. The current account
provides cheque book facility but no interest. Current account holders should also
maintain a minimum balance and if the balance falls below this level, a service charge is
imposed. Create a class account that stores customer name, account number and type of
account. From this derive the classes curacct and savacct to make them more specific to
CREDITS
THEORY PRACTICAL
Assessment
Assessment
END SEM
END SEM
University
University
Two Term
Teachers
Teachers
COURSE CODE CATEGORY COURSE NAME L T P
Exam
Exam
Exam
*
Object Oriented
BTCS202N DCC 60 20 20 30 20 2 0 2 3
Programming
Legends: L - Lecture; T - Tutorial/Teacher Guided Student Activity; P – Practical; C - Credit;
*Teacher Assessment shall be based following components: Quiz/Assignment/ Project/Participation in
Class, given that no component shall exceed more than 10 marks.
their requirements. Include necessary member functions in order to achieve the following
tasks:
12. Create a base class shape. Use this class to store two double type values that could be
used to compute area of figures. Derive two specific classes called triangle and rectangle
from the base shape. Add to the base a member function getdata() to initialize base class data
member and another member function display_area() to compute and display the area of
figures. Make display area () as a virtual function and redefine it the derived class to suit
their requirements.
CREDITS
PRACTICAL
Assessment
Assessment
END SEM
END SEM
University
University
Two Term
Teachers
Teachers
Exam
Exam
Exam
*
Operating
BTCS203N DCC Systems 60 20 20 30 20 2 0 2 3
Syllabus:
UNIT I 10HRS
Introduction to Operating System: Introduction and Need of operating system, Layered
Architecture/Logical Structure of Operating system, Type of OS(Multiprogramming , Time
Sharing, Real Time ,Networked, Distributed, Clustered, Hand Held), Operating system as
Resource Manager and Virtual Machine, System Calls/Monitor Calls, Firmware- BIOS,
Boot Strap Loader. Threads- processes versus threads, threading, concepts, models, kernel &
user level threads, thread usage, benefits.
CREDITS
PRACTICAL
Assessment
Assessment
END SEM
END SEM
University
University
Two Term
Teachers
Teachers
Exam
Exam
Exam
*
Operating
BTCS203N DCC Systems 60 20 20 30 20 2 0 2 3
UNIT II 9HRS
Process Management: Process Model, Creation, Termination, States & Transitions,
Context Switching, Process Control Block, CPU and I/O bound, CPU scheduler- short,
medium, long-term, dispatcher, scheduling:- preemptive and non-preemptive, Static and
Dynamic Priority
Criteria/Goals/Performance Metrics, scheduling algorithms- FCFS, SJFS, shortest remaining
time, Round robin, Priority scheduling, multilevel queue scheduling, multilevel feedback
queue scheduling
UNIT IV 7HRS
Memory Management: concepts, functions, logical and physical address space, address
binding, degree of multiprogramming, swapping, static & dynamic loading- creating a load
module, loading, static & dynamic linking, memory allocation schemes- first fit, next fit,
best fit, worst fit and quick fit.
Virtual Memory- concept, virtual address space, paging scheme, pure segmentation and
segmentation with paging scheme hardware support and implementation details, memory
fragmentation, demand paging ,working set model, page fault frequency, thrashing, page
replacement algorithms- optimal, FIFO,LRU; Bleady‟s anomaly; TLB ( translation look
aside buffer).
UNIT V 8HRS
File Management: Concepts, Naming, Attributes, Operations, Types, Structure, File
Organization & Access (Sequential, Direct ,Index Sequential) Methods, Memory Mapped
Files, Directory Structures One Level, Two Level, Hierarchical/Tree, Acyclic Graph,
General Graph, File System Mounting, File Sharing, Path Name, Directory Operations,
Overview Of File System in Linux & Windows.
CREDITS
PRACTICAL
Assessment
Assessment
END SEM
END SEM
University
University
Two Term
Teachers
Teachers
Exam
Exam
Exam
*
Operating
BTCS203N DCC Systems 60 20 20 30 20 2 0 2 3
Text books:
1. Abraham Silberschatz,”Operating system concepts”, 10th Edition,John Willey &
Sons. INC, 2018
2. Andrew S.Tannanbaum, “Modern operating system”, 4th Edition,Pearson Education,
2014
3. Dhananjay M. Dhamdhere, ”Operating Systems:A concept Based Approach”, 3rd
Edition TMH, 2017,
4. SibsankarHaldar, Alex AlagarsamyAravind,”Operating System”, 8th Edition, Pearson
Education India,, 2010
Reference Books:
1. Achyut S Godbole,”Operating System”,3rd TMH,2017.
2. William Stalling, “operating system” 8th, Pearson Education, ,2014.
3. Vijay Shukla, "Operating System", 3rd, Kataria&Sons ,2013.
4. Singhal&Shivratri,”Advanced Concept in Operating Systems”, 1st ,TataMc-Graw
Hill Education, edition 2017.
List of Practical:
1. Implement and update the BIOS settings of your PC.
2. If there are 5 printers are connected in a system each process to print will take different
time to complete, and CPU will give a fixed time to each process after that deadline next
process will enter in CPU. If a problem not completed in a given slot then that process
will be re enter as per the FCFS, on rotation basis? Apply the scheduling on this?
3. Implement Non Preemptive Priority CPU Scheduling.
4. Implement Non Preemptive Shortest Job first CPU Scheduling.
5. If there are 5 different resources like 3 printer,2 scanner are connected to a system each
taking different time to complete the task. Which scheduling is best and gives best
performance of CPU?
6. Implement the scheduling for that where CPU give chance to complete those process first
CREDITS
PRACTICAL
Assessment
Assessment
END SEM
END SEM
University
University
Two Term
Teachers
Teachers
Exam
Exam
Exam
*
Operating
BTCS203N DCC Systems 60 20 20 30 20 2 0 2 3
CREDITS
PRACTICAL
Assessment
Assessment
END SEM
END SEM
University
University
Two Term
Teachers
Teachers
Exam
Exam
Exam
*
Data
BTIT201N DCC Communication 60 20 20 0 0 3 1 0 4
Syllabus
UNIT–I 10HRS
Introduction: Data Communication Components, Types of Connections, Transmission Modes,
Network Devices, Topologies, Protocols and Standards, OSI Model, Transmission Media,
Bandwidth, Bit Rate, Bit Length, Baseband and Broadband Transmission, Attenuation,
Distortion, Noise, Throughout, Delay and Jitter.
UNIT–II 9HRS
Data Encoding:Unipolar, Polar, Bipolar, Line and Block Codes. Multiplexing: Introduction and
History, FDM, TDM, WDM, Synchronous and Statistical TDM.Synchronous and Asynchronous
transmission, Serial and Parallel Transmission.
CREDITS
PRACTICAL
Assessment
Assessment
END SEM
END SEM
University
University
Two Term
Teachers
Teachers
Exam
Exam
Exam
*
Data
BTIT201N DCC Communication 60 20 20 0 0 3 1 0 4
UNIT–III 8HRS
Error Detection & Correction: Correction, Introduction–Block Coding–Hamming Distance,
CRC, Flow Control and Error Control, Stop and Wait, Error Detection and Error Go Back– N
ARQ, Selective Repeat ARQ, Sliding Window, Piggybacking, Random Access, CSMA/CD,
CDMA/CA
UNIT–IV 7HRS
Network Switching Techniques: Circuit, Message, Packet and Hybrid Switching
Techniques.X.25, ISDN.Logical Addressing, Ipv4, Ipv6, Address Mapping, ARP, RARP,
BOOTP and DHCP, User Datagram Protocol, Transmission Control Protocol, SCTP.
UNIT–V 8HRS
Application Layer Protocols: Domain Name Service Protocol, File Transfer Protocol,
TELNET, WWW and Hyper Text Transfer Protocol, Simple Network Management Protocol,
Simple Mail Transfer Protocol, Post Office Protocol v3.
TEXT BOOKS:
1. Behrouz A. Forouzan, “Data communication and Networking”, FourthEdition,Tata McGraw
Hill, 2011.
REFERENCES:
1. Larry L.Peterson, Peter S. Davie, “Computer Networks”, Fifth Edition,Elsevier, 2012.
2. William Stallings, “Data and Computer Communication”, Eighth Edition, Pearson
Education,2007.
3. James F. Kurose, Keith W. Ross, “Computer Networking: A Top–Down Approach
Featuring theInternet”, Pearson Education, 2005
CREDITS
PRACTICAL
Assessment
Assessment
END SEM
END SEM
University
University
Two Term
Teachers
Teachers
Exam
Exam
Exam
*
Principle of
BTCS204N DCC Programming 60 20 20 0 0 3 0 0 3
Language
Legends: L - Lecture; T - Tutorial/Teacher Guided Student Activity; P – Practical; C - Credit;
*Teacher Assessment shall be based following components: Quiz/Assignment/ Project/Participation in
Class, given that no component shall exceed more than 10 marks.
CREDITS
PRACTICAL
Assessment
Assessment
END SEM
END SEM
University
University
Two Term
Teachers
Teachers
Exam
Exam
Exam
*
Principle of
BTCS204N DCC Programming 60 20 20 0 0 3 0 0 3
Language
Legends: L - Lecture; T - Tutorial/Teacher Guided Student Activity; P – Practical; C - Credit;
*Teacher Assessment shall be based following components: Quiz/Assignment/ Project/Participation in
Class, given that no component shall exceed more than 10 marks.
Syllabus
UNIT II Data Types: Introduction, Primitive, Character, User Defined, Record, 8HRS
Union, Pointer and Reference Types, Design and Implementation Uses
Related to these Types. Names, Variable, Concept of Binding
UNIT III Expressions and Statements: Arithmetic Relational and Boolean 8HRS
Expressions, Short Circuit Evaluation Mixed Mode Assignment,
Assignment Statements, Control Structures.
CREDITS
PRACTICAL
CATEG
COURSE CODE COURSE NAME L T P
Assessment
Assessment
END SEM
END SEM
University
University
Two Term
ORY
Teachers
Teachers
Exam
Exam
Exam
*
Principle of
BTCS204N DCC Programming Language 60 20 20 0 0 3 0 0 3
Text Books:
1. Robert .W. Sebesta “Concepts of Programming Languages”, 10th Edition, Pearson
Education, 2008.
2. D. A. Watt, “Programming Language Design Concepts, Wiley dreamtech, rp-2007.
3. Louden and Lambart,“Programming Languages: Principles and Practices”, 3rd Edition,
Cengage Learning, 2011.
References:
1. Gabbrielli and Martini “Programming Languages: Principles and Paradigms., Springer,
2010.
2. Peter Sestoft,“Programming Language Concepts”, Springer, 2017.
3. A.B. Tucker, R.E. Noonan, “Programming Languages”, 2nd Edition, Tata McGraw Hill.
4. Terrance W Pratt, "Programming Languages: Design and Implementation" Pearson
Education.