CSE 2nd Year

Handbook of B.Tech. Programmes offered by USICT at Affiliated Institutions of the University.
Third Semester
Paper
Group Paper L P Credits
Code
Theory Papers
ES ES-201 Computational Methods 4 4
HS/MS HS-203 Indian Knowledge System* 2 2
PC CIC-205 Discrete Mathematics 4 4
PC ECC-207 Digital Logic and Computer Design 4 4
PC CIC-209 Data Structures 4 4
PC CIC-211 Object-Oriented Programming using C++ 4 4
Practical / Viva Voce
ES ES-251 Computational Methods Lab 2 1
PC ECC-253 Digital Logic and Computer Design Lab 2 1
PC CIC-255 Data Structures Lab 2 1
PC CIC-257 Object-Oriented Programming using C++ Lab 2 1
Total 22 8 26
*NUES:All examinations to be conducted by the concerned teacher as specified in the detailed syllabus of the paper.
Fourth Semester
Paper
Group Paper L P Credits
Code
Theory Papers
BS BS-202 Probability, Statistics and Linear Programming 4 4
HS/MS HS-204 Technical Writing* 2 2
PC CIC-206 Theory of Computation 4 4
PC EEC-208 Circuits and Systems 4 4
PC CIC-210 Database Management Systems 4 4
PC CIC-212 Programming in Java 4 4
Practical / Viva Voce
BS BS-252 Probability, Statistics and Linear Programming Lab 2 1
PC EEC-254 Circuits and Systems Lab 2 1
PC CIC-256 Database Management Systems Lab 2 1
PC CIC-258 Programming in Java Lab 2 1
Total 22 8 26
*NUES:All examinations to be conducted by the concerned teacher as specified in the detailed syllabus of the paper.
Applicable from Batch Admitted in Academic Session 2021-22 Onwards Page 51 of 427
Paper Code(s): ES-201 L P C

Paper: Computational Methods 4 - 4
Marking Scheme:
1. Teachers Continuous Evaluation: 25 marks
2. Term end Theory Examinations: 75 marks
Instructions for paper setter:
1. There should be 9 questions in the term end examinations question paper.
st
2. The first (1 ) question should be compulsory and cover the entire syllabus. This question should be
objective, single line answers or short answer type question of total 15 marks.
3. Apart from question 1 which is compulsory, rest of the paper shall consist of 4 units as per the syllabus.
Every unit shall have two questions covering the corresponding unit of the syllabus. However, the student
shall be asked to attempt only one of the two questions in the unit. Individual questions may contain upto 5
sub-parts / sub-questions. Each Unit shall have a marks weightage of 15.
4. The questions are to be framed keeping in view the learning outcomes of the course / paper. The standard
/ level of the questions to be asked should be at the level of the prescribed textbook.
5. The requirement of (scientific) calculators / log-tables / data – tables may be specified if required.
Course Objectives :
1. To understand numerical methods to find roots of functions and first order unconstrained
minimization of functions.
2. To introduce concept of interpolation methods and numerical integration.
3. To understand numerical methods to solve systems of algebraic equations and curve fitting by splines.
4. To understand numerical methods for the solution of Ordinary and partial differential equations.
Course Outcomes (CO)
CO 1 Ability to develop mathematical models of low level engineering problems
CO 2 Ability to apply interpolation methods and numerical integration.
CO 3 Ability to solve simultaneous linear equations and curve fitting by splines
CO 4 Ability to numerically solve ordinary differential equations that are initial value or boundary value
problems
Course Outcomes (CO) to Programme Outcomes (PO) mapping (scale 1: low, 2: Medium, 3: High)
PO01 PO02 PO03 PO04 PO05 PO06 PO07 PO08 PO09 PO10 PO11 PO12
CO 1 3 2 2 2 2 - - - 2 2 2 3
CO 2 3 2 2 2 2 - - - 2 2 2 3
CO 3 3 3 3 3 2 - - - 2 2 2 3
CO 4 3 3 3 3 2 - - - 2 2 2 3
UNIT-I
Review of Taylor Series, Rolle ’s Theorem and Mean Value Theorem, Approximations and Errors in numerical
computations, Data representation and computer arithmetic, Loss of significance in computation
Location of roots of equation: Bisection method (convergence analysis and implementation), Newton Method
(convergence analysis and implementation), Secant Method (convergence analysis and implementation).
Unconstrained one variable function minimization by Fibonacci search, Golden Section Search and Newton’s
method. Multivariate function minimization by the method of steepest descent, Nelder- Mead Algorithm.
UNIT-II
Interpolation: Assumptions for interpolation, errors in polynomial interpolation, Finite differences, Gregory-
Newton’s Forward Interpolation, Gregory-Newton’s backward Interpolation, Lagrange’s Interpolation,
Newton’s divided difference interpolation
Numerical Integration: Definite Integral, Newton-Cote’s Quadrature formula, Trapezoidal Rule, Simpson’s one-
third rule, simpson’s three-eight rule, Errors in quadrature formulae, Romberg’s Algorithm, Gaussian
Quadrature formula.
UNIT-III
System of Linear Algebraic Equations: Existence of solution, Gauss elimination method and its computational
effort, concept of Pivoting, Gauss Jordan method and its computational effort, Triangular Matrix factorization
methods: Dolittle algorithm, Crout’s Algorithm, Cholesky method, Eigen value problem: Power method
Approximation by Spline Function: First-Degree and second degree Splines, Natural Cubic Splines, B Splines,
Interpolation and Approximation
UNIT - IV
Numerical solution of ordinary Differential Equations: Picard’s method, Taylor series method, Euler’s and
Runge-Kutta’s methods, Predictor-corrector methods: Euler’s method, Adams-Bashforth method, Milne’s
method.
Numerical Solution of Partial Differential equations: Parabolic, Hyperbolic, and elliptic equations
Implementation to be done in C/C++
Textbook(s):
1. E. Ward Cheney & David R. Kincaid , “Numerical Mathematics and Computing” Cengage; 7th ed (2013).
References:
th
1. R. L. Burden and J. D. Faires, “Numerical Analysis”, CENGAGE Learning Custom Publishing; 10 Edition
(2015).
2. S. D. Conte and C. de Boor, “Elementary Numerical Analysis: An Algorithmic Approach”, McGraw Hill, 3rd ed.
(2005).
3. H. M. Antia, “Numerical Methods for Scientists & Engineers”, Hindustan Book Agency, (2002).
4. E Balagurusamy “Numerical Methods” McGraw Hill Education (2017).
Paper Code(s): HS-203 L P C

Paper: Indian Knowledge System 2 - 2
Marking Scheme:
3. This is an NUES paper, hence all examinations to be conducted by the concerned teacher.
Instruction for paper setter:
st
Course Objectives :
1. To understand the Indian knowledge System.
2. To understand the foundational concepts for science and technology.
3. To understand the ancient Indian mathematics and astronomy.
4. To understand the ancient Indian engineering and technology.
CO 1 Ability to understand the Indian knowledge System.
CO 2 Ability to understand and apply foundational concepts for science and technology.
CO 3 Ability to understand and apply ancient Indian mathematics and astronomy
CO 4 Ability to understand ancient Indian engineering and technology.
CO 1 - - - - - 3 - - - - - 2
CO 2 - - - - - 3 - - - 2 - 2
CO 3 3 3 - - - - - - - - - 2
CO 4 3 3 - - - - - - - - - 2
UNIT-I
Indian Knowledge System (IKS) - An Introduction:

Overview of IKS - Importance of Ancient Knowledge; Defining IKS; The IKS Corpus – A Classification Framework;
Chaturdaśa-Vidyāsthāna; History of IKS, Some unique aspects of IKS;
The Vedic Corpus – Introduction to Vedas; The Four Vedas and their divisions; Vedāngas; Vedic Life;
Philosophical Systems – Indian Philosophical Systems; Vedic Schools of Philosophy; Non-Vedic Philosophical
Systems; Wisdom through the Ages – Purānas, Itihāsa as source of wisdom, Rāmāyana, Mahābhārata, Niti-
śāstras, Subhāssitas.
UNIT-II
Foundational Concepts for Science and Technology:

Linguistics - Components of Language; Pānini’s work on Sanskrit Grammar; Phonetics in Sanskrit; Patterns in
Sanskrit Vocabulary; Computational Concepts in Astādhyāyi, Logic for Sentence Construction; Importance of
Verbs; Role of Sanskrit in Natural Language Processing
Number System and Units of Measurement – Number System in India; Salient Features of the Indian Numeral
System; Unique approaches to represent numbers; Measurements for Time, Distance and Weight; Pingala and
the Binary System

Knowledge: Framework and Classification – The Knowledge Triangle; Prameya; Pramāna; Samśaya; Framework
for establishing Valid Knowledge
UNIT-III
Mathematic and Astronomy in IKS:

Mathematics – Unique aspects of Indian Mathematics; Great Mathematicians and their Contributions;
Arithmetic; Geometry; Trigonometry; Algebra; Binary Mathematics and Combinatorial Problems in Chandah-
śāstra of Pingala, Magic Squares in India
Astronomy - Unique aspects of Indian Astronomy; Historical Development of Astronomy in India; The Celestial
Coordinate System; Elements of the Indian Calendar; Āryabhatiya and the Siddhāntic Tradition; Pancānga;
Astronomical Instruments; Jantar Mantar of Rājā Jai Singh Sawai
UNIT - IV
Engineering and Technology in IKS:

Engineering and Technology: Metals and Metalworking – The Indian S & T Heritage; Mining and Ore Extraction;
Metals and Metalworking Technology; Iron and Steel in India; Lost wax casting of Idols and Artefacts;
Apparatuses used for Extraction of Metallic Components
Engineering and Technology: Other Applications – Literary sources for Science and Technology; Physical
Structures in India; Irrigation and Water Management; Dyes and Painting Technology; Surgical Techniques;
Shipbuilding; Sixty-four Art Forums; Status of Indigenous S & T
Textbook(s):
1. B. Mahadevan, Vinayaka Rajat Bhat & Nagendra Pavana R.N., “Introduction to Knowledge System: Concepts
and Applications” PHI (2022).
References:
1. C.M Neelakandhan & K.A. Ravindran, “Vedic Texts and The Knowledge Systems of India”, Sri Sankaracharya
University of Sanskrit, Kalady (2010).
2. P.P. Divakaran, “The Mathematics of India: Concepts, Methods, Connections”, Springer (2018)
3. C.A. Sharma, “Critical Survey of Indian Philosophy”, Motilal Banarasidass Publication (1964)
4. G. Huet, A. Kulkarni & P. Scharf, “Sanskrit Computational Linguistics”, Springer (2009).
5. A.K. Bag, “History of Technology in India”, Indian National Science Academy, Vol 1, (1997)
Paper Code(s): CIC-205 L P C

Paper: Discrete Mathematics 4 - 4
Marking Scheme:
st
Course Objectives :
1. To introduce the concept of Mathematical Logic, concepts of sets, relation and functions
2. To introduce the concept of Algorithm and number theory
3. To understand Group theory and related examples
4. To use Graph theory for solving problems
CO1: Ability for constructing mathematical logic to solve problems
CO2: Ability to Analyze/ quantify the efficiency of a developed solution (algorithm) of a computational
problem
CO3: Ability to Understand mathematical preliminaries to be used in the subsequent courses of the
curriculum. This includes Boolean algebra, number theory, group theory, and combinatorics.
CO4: Ability to Understand diverse relevant topics in discrete mathematics and computation theory with an
emphasis on their applicability as mathematical tools in computer science.
CO 1 3 3 3 2 2 - - - 2 2 3 3
CO 2 3 3 3 2 2 - - - 2 2 3 3
CO 3 3 3 3 3 2 - - - 2 2 3 3
CO 4 3 3 3 3 2 - - - 2 2 3 3
UNIT – I
Sets, Logic, and Relation: Sets, Subsets, powerset, operations on sets, Propositional Logic, Rules of inferences
in propositional logic, Quantifiers, Predicates and validity, Predicate Logic, normal forms. Proof Techniques-
Direct Proof, Proof by Contraposition, and proof by contradiction. Principle of inclusion and exclusion,
pigeonhole principle, permutation and combination. Principle of Well Ordering, principle of mathematical
induction, principle of complete induction. Relation, properties of binary relation, equivalence relation and
class, closures (symmetric, reflexive, and transitive).
UNIT – II
Functions, Order relations and Boolean Algebra: Functions, Growth of functions, Permutation functions,
Partially ordered sets, lattices, Boolean algebra, Minimization of Boolean Expressions. GCD, LCM, prime
numbers.
Recurrence relations, solution methods for linear, first-order recurrence relations with constant coefficients,
generating functions, Analysis of Algorithms involving recurrence relations, solution method for a divide-and-
conquer recurrence relation. Masters theorem (with proof).
UNIT – III
Group theory: Semi-group, Monoid, Groups, Group identity and uniqueness, inverse and its uniqueness,
isomorphism and homomorphism, subgroups, Cosets and Lagrange’s theorem, Permutation group and Cayley’s
theorem (without proof), Normal subgroup and quotient groups. Groups and Coding.
UNIT – IV
Graph theory: Graph Terminology, Planar graphs, Euler’s formula (proof), Euler and Hamiltonian path/circuit.
Chromatic number of a graph, five color theorem (proof), Shortest path and minimal spanning trees and
algorithms, Depth-first and breadth first search, trees associated with DFS & BFS, Connected components.
Complexity Analysis of the graph MST.
Textbook(s):
1. B. Kolman, R. C. Busby & S.C. Ross “Discrete Mathematical Structures”, 6th edition, PHI/Pearson, 2009.
2. R. L. Graham, D. E. Knuth & O. Patashnik, “Concrete Mathematics”, Pearson Education, 2000.
References:
1. Neal Koblitz, “A course in number theory and cryptography”, Springer – Verlag, 1994.
2. J.P. Tremblay & R. Manohar, “Discrete Mathematical Structure with Application to Computer Science,” TMH,
New Delhi (2000).
3. Norman L. Biggs, “Discrete Mathematics”, Second edition, Oxford University Press, New Delhi (2002).
4. T .H . Cormen, C . E . Leiserson, R .L . Rivest “Introduction to Algorithms”, 3rd edition, PHI/Pearson.
5. Anne Benoit, Yves Robert, Frédéric Vivien “A Guide to Algorithm Design: Paradigms, Methods, and
Complexity Analysis”, CRC Press, 2013.
Paper Code(s): ECC-207 L P C

Paper: Digital Logic and Computer Design 4 - 4
Marking Scheme:
st
Course Objectives :
1. To introduce basic concepts of Boolean Algebra and Combinational Logic
2. To introduce various sequential circuits, designing with examples
3. To relate combination circuit design and sequential circuit design with respect to the design of a
computer system
4. To introduce machine learning, computer arithmetic, modes of data transfer with respect to I/O and
Memory organization of a computer
Course Outcomes (CO) :
CO 1 Ability to understand Boolean Algebra and Design Combinational Circuits .
CO 2 Ability to understand and Design Sequential Circuits.
CO 3 Ability to understand Design of a basic computer.
CO 4 Ability to understand Input-Output and Memory Organization of a Computer.
CO 1 3 2 3 2 2 - - - 3 2 2 3
CO 2 3 2 3 2 2 - - - 3 2 2 3
CO 3 3 2 3 3 2 - - - 3 2 2 3
CO 4 3 3 3 3 3 - - - 3 2 2 3
UNIT – I
Boolean Algebra and Combinational Logic: Review of number systems , signed, unsigned, fixed point, floating
point numbers, Binary Codes, Boolean algebra – basic postulates, theorems , Simplification of Boolean
function using Karnaugh map and Quine-McCluskey method – Implementations of combinational logic
functions using gates, Adders, Subtractors, Magnitude comparator, encoder and decoders, multiplexers, code
converters , parity generator/checker, implementation of combinational circuits using multiplexers.
UNIT – II
Sequential Circuits: General model of sequential circuits, Flip-flops, latches , level triggering, edge triggering,
master slave configuration , concept of state diagram , state table, state reduction procedures , Design of
synchronous sequential circuits , up/down and modulus counters , shift registers, Ring counter , Johnson
counter , timing diagram , serial adder , sequence detector, Programmable Logic Array (PLA), Programmable
Array Logic (PAL), Memory Unit, Random Access Memory
UNIT – III
Basic Computer organization: Stored Program, Organization, Computer registers, bus system, instruction set
completeness, instruction cycle, Register Transfer Language, Arithmetic, Logic and Shift Micro-operations,
Instruction Codes, Design of a simple computer, Design of Arithmetic Logic unit, shifter, Design of a simple
hardwired control unit, Programming the basic computer, Machine language instructions, assembly language,
Microprogrammed control, Horizontal and Vertical Microprogramming, Central Processing Unit, instruction
sets and formats, addressing modes, data paths, RISC and CISC characteristics.
UNIT – IV
Computer Arithmetic, addition, subtraction, multiplication and division algorithms, Input-Output Organization,
Modes of data transfer, Interrupt cycle, direct memory access, Input-Output processor, Memory Organization,
Memory Hierarchy, Associative Memory, Cache Memory, Internal and external Memory, Virtual Memory.
Text Book(s)
1. M. Morris Mano, “Digital Logic and Computer Design”, Pearson Education, 2016
rd
2. M. Morris Mano, Rajib Mall “Computer System Architecture”, 3 Edition Pearson Education, 2017
References:
th
1. Leach, D. P., Albert P. Malvino, “Digital Principles and Applications”, McGraw Hill Education, 8 Edition ,
2014
th
2. Jain, R.P. ,”Modern Digital Electronics”, McGraw Hill Education, 4 Edition , 2010
th
3. Floyd, Thomas L. , “Digital Fundamentals” Pearson Education, 11 Edition, 2017
th
4. M. Rafiquzzaman, “Fundamentals of Digital Logic and Microcomputer Design”, Wiley, 5 Ed., 2005.

Paper: Data Structures 4 - 4
Marking Scheme:
st
Course Objectives :
1. To introduce basics of Data structures (Arrays, strings, linked list etc.)
2. To understand the concepts of Stacks, Queues and Trees, related operations and their implementation
3. To understand sets, heaps and graphs
4. To introduce various Sorting and searching Algorithms
CO 1 To be able to understand difference between structured data and data structure
CO 2 To be able to create common basic data structures and trees
CO 3 To have a knowledge of sets, heaps and graphs
CO 4 To have basic knowledge of sorting and searching algorithms
CO 1 3 2 2 2 3 - - - 2 2 2 3
CO 2 3 2 2 2 3 - - - 2 2 2 3
CO 3 3 2 2 2 3 - - - 2 2 2 3
CO 4 3 2 2 2 3 - - - 2 2 2 3
UNIT – I
Overview of data structure, Basics of Algorithm Analysis including Running Time Calculations, Abstract Data
Types, Arrays, Arrays and Pointers, Multidimensional Array, String processing, General Lists and List ADT, List
manipulations, Single, double and circular lists. Stacks and Stack ADT, Stack Manipulation, Prefix, infix and
postfix expressions, recursion. Queues and Queue ADT, Queue manipulation.
UNIT – II
Sparse Matrix Representation (Array and Link List representation) and arithmetic (addition, subtraction and
multiplication), polynomials and polynomial arithmetic.
Trees, Properties of Trees, Binary trees, Binary Tree traversal, Tree manipulation algorithms, Expression trees
and their usage, binary search trees, AVL Trees, Heaps and their implementation, Priority Queues, B-Trees, B*
Tree, B+ Tree
UNIT – III
Sorting concept, order, stability, Selection sorts (straight, heap), insertion sort (Straight Insertion, Shell sort),
Exchange Sort (Bubble, quicksort), Merge sort (External Sorting) (Natural merge, balanced merge and
polyphase merge). Searching – List search, sequential search, binary search, hashing methods, collision
resolution in hashing.
UNIT – IV
Disjoint sets representation, union find algorithm, Graphs, Graph representation, Graph Traversals and their
implementations (BFS and DFS). Minimum Spanning Tree algorithms, Shortest Path Algorithms
Textbook(s):
nd
1. Richard Gilberg , Behrouz A. Forouzan, “Data Structures: A Pseudocode Approach with C, 2 Edition,
Cengage Learning, Oct 2004
2. E. Horowitz, S. Sahni, S. Anderson-Freed, "Fundamentals of Data Structures in C", 2nd Edition, Silicon Press
(US), 2007.
References:
nd
1. Mark Allen Weiss, “Data Structures and Algorithm Analysis in C”, 2 Edition, Pearson, September, 1996
nd
2. Robert Kruse, “Data Structures and Program Design in C”, 2 Edition, Pearson, November, 1990
3. Seymour Lipschutz, “Data Structures with C (Schaum's Outline Series)”, McGrawhill, 2017
st
4. A. M. Tenenbaum, “Data structures using C”. Pearson Education, India, 1 Edition 2003.
5. Weiss M.A., “Data structures and algorithm analysis in C++”, Pearson Education, 2014.

Paper: Object-Oriented Programming Using C++ 4 - 4
Marking Scheme:
st
Course Objectives :
1. To introduce the basic Concepts of Object Oriented Programming (data types, operators and
functions) using C++
2. To introduce concepts of Classes and Objects with the examples of C++ programming
3. To understand object oriented features such as Inheritance and Polymorphism
4. To use various object oriented concepts (exceptional handling) to solve different problems
CO 1 Ability to have an in-depth knowledge of object oriented programming paradigm
CO 2 To be able to develop basic C++ programming skills
CO 3 To be able to apply various object oriented features using C++
CO 4 Ability to have an understanding of generic programming & standard templates
CO 1 3 2 2 2 3 - - - 3 2 2 3
CO 2 3 2 2 2 3 - - - 3 2 2 3
CO 3 3 2 2 2 3 - - - 3 2 2 3
CO 4 3 2 2 2 3 - - - 3 2 2 3
UNIT – I
Object Oriented Programming Paradigm, Basic Concepts of Object Oriented Programming, Benefits of Object
Oriented Programming, Object Oriented Languages, Applications of Object Oriented Programming, C++
Programming Language, Tokens, Keywords, Identifiers and Constants, Data Types, Type Compatibility,
Variables, Operators in C++, Implicit Type Conversions, Operator Precedence, The Main Function, Function
Prototyping, Call by Reference, Return by Reference, Inline Functions, Function Overloading, Friend Functions,
default parameter value.
UNIT – II
Specifying a class, Member Functions, Encapsulation, information hiding, abstract data types, objects & classes,
Static Member Functions, Arrays of Objects, Constructors & Destructors, Parameterized Constructors, Copy
Constructors, Dynamic Constructors, Destructors, identity and behaviour of an object, C++ garbage collection,
dynamic memory allocation, Explicit Type Conversions, Operator Overloading.
UNIT – III
Inheritance, inheritance methods, Class hierarchy, derivation – public, private & protected, aggregation,
Inheritance Constructors, composition vs. classification hierarchies, Containership, Initialization List,

Polymorphism, categorization of polymorphic techniques, polymorphism by parameter, parametric
polymorphism, generic function – template function, function overriding, run time polymorphism, virtual
functions.
UNIT – IV
Standard C++ classes, using multiple inheritance, persistant objects, streams and files, namespaces, exception
handling, generic classes, standard template library: Library organization and containers, standard containers,
algorithm and Function objects, iterators and allocators, strings, streams, manipulators, user defined
manipulators, vectors.
Textbook(s):
1. Stanley B. Lippman, Josée Lajoie, Barbara E. Moo, “C++ Primer”, Addison-Wesley Professional, 2012.
2. Ivor Horton, “Using the C++ Standard Template Libraries”, Apress, 2015.
3. R. Lafore, “Object Oriented Programming using C++”, Galgotia.
References:
1. A.R.Venugopal, Rajkumar, T. Ravishanker “Mastering C++”, TMH
2. Bjarne Stroustrup, “Programming: principles and practice using C++”, Addison-Wesley, 2015.
3. Bjarne Stroustrup, “A Tour of C++”, Addison-Wesley Professional, 2018.
4. Bjarne Stroustrup, “The C++ Programming Language”, 4th Edition, Addison-Wesley Professional, 2013.
5. Peter Van Weert and Marc Gregoire, “C++17 Standard Library Quick Reference: A Pocket Guide to Data
Structures, Algorithms, and Functions”, Apress (2019)
6. Rumbaugh et. al. “ Object Oriented Modelling & Design”, Prentice Hall
7. G . Booch “Object Oriented Design & Applications”, Benjamin,Cummings.
8. E.Balaguruswamy, “Objected Oriented Programming with C++”, TMH
9. Steven C. Lawlor, “The Art of Programming Computer Science with C++”, Vikas Publication.
10. Slobodan Dmitrović, Modern C++ for Absolute Beginners”:A Friendly Introduction to C++ Programming
Language and C++11 to C++20 Standards”, Apress, 2020.
Paper Code(s): EEC-213 / EEC-208 L P C

Paper: Circuits and Systems 4 - 4
Marking Scheme:
st
Course Objectives :
1. To impart the knowledge of various signal and system.
2. To understand modelling of circuit.
3. To impart knowledge of theorems in AC circuit.
4. To impart knowledge of two port network and transfer function.
CO 1 Ability to understand properties of signal and system.
CO 2 Ability to determine transient respond of circuit.
CO 3 Ability to solve AC circuit.
CO 4 Ability to determine two port parameter and transfer function.
CO 1 3 3 3 3 2 - - - 1 1 1 1
CO 2 3 3 3 3 2 - - - 1 1 1 1
CO 3 3 3 3 3 2 - - - 1 1 1 1
CO 4 3 3 3 3 2 - - - 1 1 1 1
UNIT – I
Signals, Classification of Signals, Systems, Classification of Systems, Linear Time Invariant (LTI) Systems; Laplace
Transform, z-Transform, Fourier Series and Transform (Continuous and Discrete) and their properties. Laplace
Transform and Continuous Time LTI systems, z-Transform and Discrete Time LTI systems, Fourier analysis of
signals and systems, State Space Analysis. [T1]
UNIT-II
System modeling in terms of differential equations and transient response of R, L, C, series and parallel circuits
for impulse, step, ramp, sinusoidal and exponential signals by classical method and using Laplace transform.
[T2]
UNIT – III
AC Circuits: Circuits containing Capacitors and Inductors, Transient Response, Alternating Current and Voltages,
Phasors, Impedances and Admittance, Mesh Analysis, Loop Analysis, Nodal Analysis, Thevenin’s and Norton’s
Theorem, Y - D and D- Y Transformation, Bridge Circuits. Resonant Circuits, Complex Frequency and Network
Function, Two port Networks. Passive Filters. [T2]
UNIT – IV
Graph theory: concept of tree, tie set matrix, cut set matrix and application to solve electric networks.
Two port networks – Introduction of two port parameters and their interconversion, interconnection of two 2-
port networks, open circuit and short circuit impedances and ABCD constants, relation between image
impedances and short circuit and open circuit impedances. Network functions, their properties and concept of
transform impedance, Hurwitz polynomial. [T2]
Textbook(s):
1. B. P. Lathi, “Signal Processing and Linear System”, Berkeley Cambridge Press, 1998.
2. A. H. Robbins and W. C. Miller, “Circuit Analysis: Theory and Practice”, Thomson Learning/Delmar Pub.,
2007.
Reference Books:
1. S. Haykin and B. V. Veen, “Signal and Systems”, John Wiley and Sons, 1999.
2. H. P. Hsu, “Schaum’s Outlines of The Theory and Problems of Signals and Systems”, McGraw-Hill, 1995.
3. S. Madhu, “Linear Circuit Analysis”, Prentice Hall, 1988.
4. S. Ghosh, “Signals and Systems”, Pearson Education, 2006.
5. S. Poornachandra, “Signal and Systems”, Thomson Learning, 2004.
6. M. Nahvi and J. A. Edminister, “Schaum’s Outline of Theory and Problems of Electric Circuits”, McGraw-Hill,
2003.
Paper Code(s): ES-251 L P C

Paper: Computational Methods Lab - 2 1
Marking Scheme:
Instructions:
1. The course objectives and course outcomes are identical to that of (Computational Methods) as this is the
practical component of the corresponding theory paper.
2. The practical list shall be notified by the teacher in the first week of the class commencement under
intimation to the office of the Head of Department / Institution in which the paper is being offered from
the list of practicals below. Atleast 10 experiments must be performed by the students, they may be asked
to do more. Atleast 5 experiments must be from the given list.
Implementation to be done in C/C++

1. Program for finding roots of f(x)=0 Newton Raphson method.
2. Program for finding roots of f(x)=0 by bisection method.
3. Program for finding roots of f(x)=0 by secant method.
4. To implement Langrange’s Interpolation formula.
5. To implement Newton’s Divided Difference formula.
6. Program for solving numerical integration by Trapezoidal rule
7. Program for solving numerical integration by Simpson’s 1/3 rule
8. To implement Numerical Integration Simpson 3/8 rule.
9. Inverse of a system of linear equations using Gauss-Jordan method.
10. Find the Eigen values using Power method.
11. Program for solving ordinary differential equation by Runge-Kutta Method.

Paper: Digital Logic and Computer Design Lab - 2 1
Marking Scheme:
Instructions:
1. The course objectives and course outcomes are identical to that of (Digital Logic and Computer Design) as
this is the practical component of the corresponding theory paper.
1. Design and implementation of adders and subtractors using logic gates.

2. Design and implementation of 4-bit binary adder/subtractor.
3. Design and implementation of multiplexer and demultiplexer.
4. Design and implementation of encoder and decoder.
5. Construction and verification of 4-bit ripple counter and Mod-10/Mod-12 ripple counter.
6. Design and implementation of 3-bit synchronous up/down counter.
7. Design and computer architecture: Design a processor with minimum number of instructions, so that it can
do the basic arithmetic and logic operations.
8. Write an assembly language code in GNUsim8085 to implement data transfer instruction.
9. Write an assembly language code in GNUsim8085 to store numbers in reverse order in memory location.
10. Write an assembly language code in GNUsim8085 to implement arithmetic instruction.
11. Write an assembly language code in GNUsim8085 to add two 8 bit numbers.
12. Write an assembly language code in GNUsim8085 to find the factorial of a number.
13. Write an assembly language code in GNUsim8085 to implement logical instructions.
14. Write an assembly language code in GNUsim8085 to implement stack and branch instructions.

Paper: Data Structures Lab - 2 1
Marking Scheme:
Instructions:
1. The course objectives and course outcomes are identical to that of (Data Structures) as this is the practical
component of the corresponding theory paper.
1. Implement sparse matrix using array. Description of program:

a. Read a 2D array from the user.
b. Store it in the sparse matrix form, use array of structures.
c. Print the final array.
2. Create a linked list with nodes having information about a student and perform
a. Insert a new node at specified position.
b. Delete of a node with the roll number of student specified.
c. Reversal of that linked list.
3. Create doubly linked list with nodes having information about an employee and perform Insertion at front
of doubly linked list and perform deletion at end of that doubly linked list.
4. Create circular linked list having information about a college and perform Insertion at front perform
Deletion at end.
5. Implement two stacks in a using single array.
6. Create a stack and perform Push, Pop, Peek and Traverse operations on the stack using Linked list.
7. Create a Linear Queue using Linked List and implement different operations such as Insert, Delete, and
Display the queue elements.
8. Implement Experiment-2 using liked list.
9. Create a Binary Tree and perform Tree traversals (Preorder, Postorder, Inorder) using the concept of
recursion.
10. Implement insertion, deletion and traversals (inorder, preorder and postorder) on binary search tree with
the information in the tree about the details of an automobile (type, company, year of make).
11. Implement Selection Sort, Bubble Sort, Insertion sort, Merge sort, Quick sort, and Heap Sort using array as
a data structure.
12. Perform Linear Search and Binary Search on an array. Description of programs:
a. Read an array of type integer.
b. Input element from user for searching.
c. Search the element by passing the array to a function and then returning the position of the element
from the function else return -1 if the element is not found.
d. Display the position where the element has been found.
13. Implement the searching using hashing method.
14. Create a graph and perform DFS and BFS traversals.
Paper Code(s): EEC-253 / EEC-254 L P C

Paper: Circuits and Systems Lab - 2 1
Marking Scheme:
Instructions:
1. The course objectives and course outcomes are identical to that of (Circuits and Systems) as this is the
1. Introduction to MATLAB and its basic commands.

2. Plot unit step, unit impulse, unit ramp, exponential, parabolic functions and sinusoidal signals
3. Plot the linear convolution of two sequences
4. Study the transient response of series RLC circuit for different types of waveforms on CRO and verify using
MATLAB
5. Study the time response of a simulated linear system and verify the unit step and square wave response of
first order and second order, type 0,1 system
6. To determine Z and Y parameters of the given two port network.
7. To determine ABCD parameters of the given two port network.
8. To verify various theorems in AC Circuits.
9. To determine Hybrid parameters of the given two port network.
10. To design Cascade Connection and determine ABCD parameters of the given two port network.
11. To design Series-Series Connection and determine Z parameters of the given two port network.
12. To design Parallel-Parallel Connection and determine Y parameters of the given two port network.
13. To design Series-Parallel Connection and determine h parameters of the given two port network.

Paper: Analog and Digital Electronics Lab - 2 1
Marking Scheme:
Instructions:
1. The course objectives and course outcomes are identical to that of (Analog and Digital Electronics) as this is
the practical component of the corresponding theory paper.
1. To plot V-I characteristics of a semiconductor diode & Calculate Static & Dynamic Resistance
2. To Study the Reverse characteristics of Zener diode
3. To Study the Rectifier circuit (With and Without Filter).
a. Half Wave Rectifier
b. Centre Tapped Rectifier.
c. Bridge Rectifier.
4. To Plot Input & Output characteristics CB/CE/CC transistor.
5. Realization of basic gates.
6. Implementation of Boolean functions (two or three variables).
7. Realize all gates using NAND & NOR gates
8. Realize Half Adder, Full Adder, Half subtracter, Full subtracter
9. Realize Master-Slave J K Flip-Flop, using NAND/NOR gates..
10. To study the opamp (IC 741) as inverting and non inverting amplifier and calculate its gain.
11. To study the opamp (IC 741) as adder, sub-tractor and voltage follower, calculate its output voltage.
Paper Code(s): BS-202 L P C

Paper: Probability, Statistics and Linear Programming 4 - 4
Marking Scheme:
st
Course Objectives:
1: To understand probability and probability distributions.
2: To understand methods of summarization of data.
3: To understand and use test for hypothesis.
4: To understand methods for solving linear programming problems.
Course Outcomes (CO):
CO1: Ability to solve probability problems and describe probability distributions.
CO2: Ability to describe and summarize data.
CO3: Ability to use test for hypothesis.
CO4: Ability to formulate and solve linear programming problems.
Course Outcomes (CO to Programme Outcomes (PO) Mapping (scale 1: low, 2: Medium, 3: High
CO/PO PO01 PO02 PO03 PO04 PO05 PO06 PO07 PO08 PO09 PO10 PO11 PO12
CO1 - 3 1 1 1 - - - - - 1 2
CO2 - 3 1 1 1 - - - - - 1 2
CO3 - 3 2 2 1 - - - - - 2 2
CO4 - 3 3 3 1 - - - - - 2 2
Unit I
Basics: Probability and Statistical models, Sample Spaces and Events, Counting Techniques, Interpretations and
Axioms of Probability, Unions of Events and Addition Rules, Conditional Probability, Intersections of Events and
Multiplication and Total Probability Rules, Independence, Bayes’ Theorem, Random Variables.
Discrete and Continuous Random Variables and Distributions: Probability Distributions and Probability Mass /
density Functions, Cumulative Distribution Functions, Mean and Variance of a Random Variable, Discrete and
continuous Uniform Distribution, Binomial Distribution, Geometric and Negative Binomial Distributions,
Hypergeometric Distribution, Poisson Distribution. Normal Distribution, Normal Approximation to the Binomial,
and Poisson Distributions; Exponential Distribution, Erlang and Gamma Distributions, Weibull Distribution,
Lognormal Distribution, Beta Distribution.
Unit II
Joint Probability Distributions for Two Random Variables, Conditional Probability Distributions and
Independence, Joint Probability Distributions for Two Random Variables, Covariance and Correlation, Common
Joint Distributions, Linear Functions of RandomVariables, General Functions of Random Variables, Moment-
Generating Functions.
Numerical Summaries of Data, Stem-and-Leaf Diagrams, Frequency Distributions and Histograms, Box Plots,
Time Sequence Plots, Scatter Diagrams, Probability Plots. Point Estimation, Sampling Distributions and the
Central Limit Theorem without proof, General Concepts of Point Estimation, Methods of Point Estimation,
Statistical Intervals for a Single Sample.
Unit III
Hypotheses Testing for a SingleSample: Tests on the Mean of a Normal Distribution with Variance Known /
Unknown, Tests on the Variance and Standard Deviationof a Normal Distribution, Tests on a Population
Proportion, Testing for Goodness of Fit, Nonparametric tests (Signed, Wilcoxon), Similarly Statistical Inference
forTwo Samples.
Regression and Correlation: Linear Regression, Least Squares Estimators, Hypotheses testing for simple linear
regression, Confidence Intervals, Adequacy of model, Correlation, Transformed Variables, Logistic Regression.
Similarly, for multiple linear regression including aspects of MLR.
Unit IV
Linear Programming: Introduction, formulation of problem, Graphical method, Canonical and Standard form of
LPP, Simplex method, Duality concept, Dual simplex method, Transportation and Assignment problem.
Textbooks:
1. Applied Statistics and Probability for Engineers by Douglas G. Montgomery and Runger, Wiley, 2018
2. Linear Programming by G. Hadley, Narosa, 2002
References:
th
1. Miller and Freund’s Probability and Statistics for Engineers by Richard A. Johnson, Pearson, 10 Ed., 2018.
2. Probability & Statistics for Engineers & Scientists by Ronald E. Walpole, Raymond H. Myers, Sharon L. Myers
and Keying Ye, Pearson, 2016.
3. Statistics and probability with applications for engineers and scientists using Minitab, R and JMP, C. Gupta,
Irwin Guttman, and Kalanka P. Jayalath, Wiley, 2020.
4. Probability and Statistics for Engineering and the Sciences, Jay Devore, Cengage Learning, 2014.
5. Probability and Statistics in Emgineering, William W. Hines, Douglas C. Montgomery, David M. Goldman,
and Connie M. Borror, Wiley, 2003.
6. Operations Research: An Introduction by Hamdy A. Taha, Pearson, 10th Edition, 2016
Paper Code(s): HS-204 L P C

Paper: Technical Writing 2 - 2
Marking Scheme:
3. This is an NUES paper, hence all examinations to be conducted by the concerned teacher.
Instruction for paper setter:
st
Course Objectives:
1: To improve grammar and sentence structure and build vocabulary.
2: To understand how to write different types of writings.
3: To understand how to compose different types of business documents.
4: To understand business ethics and develop soft skills.
Course Outcomes (CO):
CO1: Ability to improve grammar and sentence structure and build vocabulary.
CO2: Ability to write different types of writings with clarity.
CO3: Ability to write different types of business documents.
CO4: Ability to apply business ethics and enhance personality.
Course Outcomes (CO to Programme Outcomes (PO) Mapping (scale 1: low, 2: Medium, 3: High
CO/PO PO01 PO02 PO03 PO04 PO05 PO06 PO07 PO08 PO09 PO10 PO11 PO12
CO1 - - - - - 1 - - - 3 - -
CO2 - - - - - 1 - - - 3 - -
CO3 - - - - - 1 - - - 3 - -
CO4 - - - - - 1 - 3 - 3 - -
Unit I
Grammar and Vocabulary--- Types of sentences (simple, complex and compound) and use of connectives in
sentences, Subject-verb agreement, Comprehension, Synonyms and Antonyms, Homophones and Homonyms,
Word Formation: Prefixes and Suffixes, Indianism, Misappropriation and Redundant Words, Question Tags and
Short Responses.
Unit II
Writing Styles -- Expository, Explanatory, Descriptive, Argumentative and Narrative.

Precis writing, Visual Aids in Technical Writing, Plagiarism and Language Sensitivity in Technical Writing,
Dialogue Writing, Proposals: Purpose and Types.
Unit III
Letters at the Workplace—letter writing: Request, Sales, Enquiry, Order and Complaint.
Job Application---Resume and Cover letter, Difference between Resume and CV, Preparation for Interview.
Meeting Documentation--- Notice, Memorandum, Circular, Agenda, Office Order and Minutes of meeting,
Writing Instructions.
Unit IV
Ethics and Personality Development-----The Role of Ethics in Business Communication—Ethical Principles, Time
Management, Self-Analysis through SWOT and JOHARI Window, Emotional Intelligence and Leadership Skills,
Team Building, Career Planning, Self Esteem.
Textbook:
1. Meenakshi Raman and Sangeeta Sharma, Technical Communication: Principles and Practice, Oxford
University Press, New Delhi (2015).
References:
1. Sanjay Kumar and Pushp Lata, Communication Skills, Oxford University Press, New Delhi (2015).
2. Herta A Murphy, Herbert W Hildebrandt, Jane P Thomas, Effective Business Communication, Tata McGraw-
Hill, Hill Publishing Company Limited, Seventh Edition.

Paper: Theory of Computation 4 - 4
Marking Scheme:
st
Course Objectives :
1. To understand Automata (Deterministic and Non-Deterministic) and Language Theory
2. To understand Context Free Grammar (CFG), Parse Trees and Push Down Automata
3. To introduce the concepts of Turing Machines and Computability Theory
4. To understand Complexity Theory (NP-completess NP-hardness) and Space complexity
CO 1 Ability to understand the design aspects of “abstract models” of computers like finite automata,
pushdown automata, and Turing machines.
CO 2 Ability to comprehend the recognizability (decidability) of grammar (language) with specific
characteristics through these abstract models.
CO 3 Ability to decide what makes some problems computationally hard and others easy?
CO 4 A ability to deliberate the problems that can be solved by computers and the ones that cannot?
CO 1 3 2 2 2 2 - - - 2 1 1 3
CO 2 3 2 2 2 2 - - - 2 1 1 3
CO 3 3 2 2 2 2 - - - 2 1 1 3
CO 4 3 2 2 2 2 - - - 2 1 1 3
UNIT – I
Automata and Language Theory: Chomsky Classification, Finite Automata, Deterministic Finite Automata (DFA),
Non-Deterministic Finite Automata (NFA), Regular Expressions, Equivalence of DFAs, NFAs and Regular
Expressions, Closure properties of Regular grammar, Non-Regular Languages, Pumping Lemma.
UNIT – II
Context Free Languages: Context Free Grammar (CFG), Parse Trees, Push Down Automata (deterministic and
non-deterministic) (PDA), Equivalence of CFGs and PDAs, Closure properties of CFLs, Pumping Lemma, Parsing,
LL(K) grammar.
UNIT – III
Turing Machines and Computability Theory: Definition, design and extensions of Turing Machine, Equivalence
of various Turing Machine Formalisms, Church – Turing Thesis, Decidability, Halting Problem, Reducibility and
its use in proving undecidability. Rices theorem. Undecidability of Posts correspondence problem., Recursion
Theorem.
UNIT – IV
Complexity Theory: The class P as consensus class of tractable sets. Classes NP, co-NP. Polynomial time
reductions. NP-completess, NP-hardness. Cook- Levin theorem (With proof). Space complexity, PSPACE and
NPSPACE complexity classes, Savitch theorem (With proof). Probabilistic computation, BPP class. Interactive
proof systems and IP class. relativized computation and oracles.
Textbook(s):
1. Sipser, Michael. Introduction to the Theory of Computation, Cengage Learning, 2012.
2. J. Hopcroft, R. Motwani, and J. Ullman, Introduction to Automata Theory, Language and Computation,
Pearson, 2nd Ed, 2006.
References:
1. Peter Linz, An Introduction to Formal Languages and Automata, 6th edition, Viva Books, 2017
1. Maxim Mozgovoy, Algorithms, Languages, Automata, and Compilers, Jones and Bartlett, 2010.
2. D. Cohen, Introduction to Computer Theory, Wiley, N. York, 2nd Ed, 1996.
3. J. C. Martin, Introduction to Languages and the Theory of Computation, TMH, 2nd Ed. 2003.
4. K. L. Mishra and N. Chandrasekharan, Theory of Computer Science: Automata, Languages and Computation,
PHI, 2006.
5. Anne Benoit, Yves Robert, Frédéric Vivien, A Guide to Algorithm Design: Paradigms, Methods, and
Complexity Analysis, CRC Press, 2013.

Paper: Database Management System 4 - 4
Marking Scheme:
st
Course Objectives :
1. To introduce basic concepts, architecture and characteristics of database systems
2. To introduce relational model concepts and PL/SQL programming
3. To introduce relational database design and Normal forms based on functional dependencies
4. To introduce concepts of object oriented & distributed databases
Course Outcomes (CO) :
CO 1 Ability to understand advantages of database systems
CO 2 Ability to use SQL as DDL, DCL and DML
CO 3 Ability to design database and manage transaction processing
CO 4 Understand object oriented & distributed databases systems and use them
CO 1 3 3 2 2 2 - - - 3 2 2 3
CO 2 3 3 2 2 2 - - - 3 2 2 3
CO 3 3 3 2 3 3 - - - 3 2 2 3
CO 4 3 3 2 3 3 - - - 3 2 2 3
UNIT – I
Basic concepts: database & database users, characteristics of the database systems, concepts and architecture,
date models, schemas & instances, DBMS architecture & data independence, database languages & interfaces,
data modelling using the entity-relationship approach. Enhanced ER concepts - Specialization/Generalization,
Aggregation, Mapping of ER model to Relational Model.
SQL – DDL, DCL & DML views and indexes in SQL. Basics of SQL, DDL, DML,DCL, structure – creation, alteration,
defining constraints – Primary key, foreign key, unique, not null, check, IN operator.
UNIT - II:
Relational model concepts, relational model constraints, relational algebra, relational calculus.
SQL – Functions - aggregate functions, Built-in functions – numeric, date, string functions, set operations, sub-
queries, correlated sub-queries, Use of group by, having, order by, join and its types, Exist, Any, All , view and
its types. Transaction control commands – Commit, Rollback, Save point.
UNIT - III
Relational data base design: functional dependencies & normalization for relational databases, normal forms
based on functional dependencies, (1NF, 2NF, 3NF & BCNF), lossless join and dependency preserving
decomposition, normal forms based on multivalued & join dependencies (4NF & 5NF) & domain key normal
form
Properties of Transaction, Transaction states, Transaction Schedule, Serializability, Concurrency control
techniques, locking techniques, time stamp ordering, Recoverable schedules, granularity of data items,
Deadlock detection and Recovery, recovery techniques: recovery concepts, database backup and recovery from
catastrophic failures.
Database Programming – control structures, exception handling, stored procedures, Triggers.
UNIT - IV
File Structures and Indexing: Secondary Storage Devices, Operations on Files, Heap Files, Sorted Files, Hashing,
Single level indexes, Multi-level indexes, B and B+ tree indexes.
Concepts of Object Oriented Database Management systems & Distributed Database Management Systems
Textbooks:
1. R. Elmsari and S. B. Navathe, “Fundamentals of database systems”, Pearson Education, 7th Edition, 2018
2. V. M. Grippa and S. Kumichev, “Learning MySQL”, O’Reilly, 2021.
3. SQL/ PL/SQL, The programming language of Oracle, Ivan Bayross, 4th Edition BPB Publications
References:
1. A. Silberschatz, H. F. Korth and S. Sudershan, “Database System Concept”, McGraw Hill, 6th Edition,2013.
2. Date, C. J., “An introduction to database systems”, 8th Edition, Pearson Education, 2008.
3. P. Rob & C. Coronel, “Database Systems: Design Implementation & Management”, Thomson Learning, 6th
Edition, 2004
4. Desai, B., “An introduction to database concepts”, Galgotia publications, 2010
5. H. Garcia-Molina, J. D. Ullman, J. Widom, “Database System: The Complete Book”, PH.
6. Joel Murach, Murach's Mysql””, 3rd Edition-Mike Murach and Associates, Incorporated, 2019.
7. Oracle and MySQL manuals.

Paper: Programming in Java 4 - 4
Marking Scheme:
st
Course Objectives :
1. To understand and gain knowledge of characteristics of Java, JVM, instruction set, control flow,
programming and the sandbox model.
2. To learn the Java programming, use of exceptional handling and inheritance.
3. To understand threads, thread synchronization, AWT components and event handling mechanism.
4. To understand the concepts of I/O streams, JDBC, object serialization, sockets, RMI, JNI, Collection API
interfaces, Vector, Stack, Hash table classes, list etc.
CO 1 Ability to understand the compilation process of Java, role of JVM as an emulator and various types of
instructions.
CO 2 Ability to learn and apply concepts of Java programming, exceptional handling and inheritance.
CO 3 Ability to understand the use of multi-threading, AWT components and event handling mechanism in
Java.
CO 4 Ability to understand the concepts of I/O streams, IDBC, object serialization, sockets, RMI, JNI,
Collection API interfaces, Vector, Stack, Hash table classes, list etc.
CO 1 3 2 2 2 3 - - - 3 2 2 3
CO 2 3 2 2 2 3 - - - 3 2 2 3
CO 3 3 2 2 2 3 - - - 3 2 2 3
CO 4 3 2 2 2 3 - - - 3 2 2 3
UNIT - I
Overview and characteristics of Java, Java program Compilation and Execution Process Organization of the Java
Virtual Machine, JVM as an interpreter and emulator, Instruction Set, class File Format, Verification, Class Area,
Java Stack, Heap, Garbage Collection. Security Promises of the JVM, Security Architecture and Security Policy.
Class loaders and security aspects, sandbox model
UNIT - II
Java Fundamentals, Data Types & Literals Variables, Wrapper Classes, Arrays, Arithmetic Operators, Logical
Operators, Control of Flow, Classes and Instances, Class Member Modifiers Anonymous Inner Class Interfaces
and Abstract Classes, inheritance, throw and throws clauses, user defined Exceptions, The String Buffer Class,
tokenizer, applets, Life cycle of applet and Security concerns.
UNIT - III
Threads: Creating Threads, Thread Priority, Blocked States, Extending Thread Class, Runnable Interface, Starting
Threads, Thread Synchronization, Synchronize Threads, Sync Code Block, Overriding Synced Methods, Thread
Communication, wait, notify and notify all.
AWT Components, Component Class, Container Class, Layout Manager Interface Default Layouts, Insets and
Dimensions, Border Layout, Flow Layout, Grid Layout, Card Layout Grid Bag Layout AWT Events, Event Models,
Listeners, Class Listener, Adapters, Action Event Methods Focus Event Key Event, Mouse Events, Window Event
UNIT - IV
Input/Output Stream, Stream Filters, Buffered Streams, Data input and Output Stream, Print Stream Random
Access File, JDBC (Database connectivity with MS-Access, Oracle, MS-SQL Server), Object serialization, Sockets,
development of client Server applications, design of multithreaded server. Remote Method invocation, Java
Native interfaces, Development of a JNI based application.
Collection API Interfaces, Vector, stack, Hashtable classes, enumerations, set, List, Map, Iterators.
Textbook(s):
1. Patrick Naughton and Herbertz Schidt, “Java-2 the Complete Reference”,TMH
References:
1. E. Balaguruswamy, “Programming with Java”, TMH
2. Horstmann, “Computing Concepts with Java 2 Essentials”, John Wiley.
3. Decker & Hirshfield, “Programming Java”, Vikas Publication.
Paper Code(s): BS-252 L P C

Paper: Probability, Statistics and Linear Programming Lab - 2 1
Marking Scheme:
Instructions:
1. The course objectives and course outcomes are identical to that of (Probability, Statistics and Linear
Programming) as this is the practical component of the corresponding theory paper.
Implementation to be done in MATLAB or in equivalent software.
1. Installation of Scilab and demonstration of simple programming concepts like marix multiplication (scalar
and vector), loop, conditional statements and plotting.
2. Program for demonstration of theoretical probability limits.
3. Program to plot normal distributions and exponential distributions for various parametric values.
4. Fitting of binomial distributions for given n and p.
5. Fitting of binomial distributions after computing mean and variance.
6. Fitting of Poisson distributions for given value of lambda.
7. Fitting of Poisson distributions after computing mean.
8. Fitting of normal distribution when parameters are given.
9. Fitting of linear regression line through given data set and testing of goodness of fit using mean error.
10. Fitting of Multiple Linear Regression (MLR) curve through given data set and testing of goodness of fit
using mean error.
11. Solve a LPP of three variable using Simplex Method.
12. Solve a Transportation problem of three variables.
13. Solve an Assignment problem of three variables.

Paper: Database Management System Lab - 2 1
Marking Scheme:
Instructions:
1. The course objectives and course outcomes are identical to that of (Database Management System) as this
is the practical component of the corresponding theory paper.
1. Experiments based on DDL commands – CREATE, ALTER, DROP and TRUNCATE.

2. Apply the integrity constraints like Primary Key, Foreign key, Check, NOT NULL, etc. to the tables.
3. Experiments based on basic DML commands – SELECT, INSERT, UPDATE and DELETE.
4. Write the queries for implementing Built-in functions, GROUP BY, HAVING and ORDER BY.
5. Write the queries to implement the joins.
6. Write the queries to implement the subqueries.
7. Write the queries to implement the set operations.
8. Write the queries to create the views and queries based on views.
9. Demonstrate the concept of Control Structures.
10. Demonstrate the concept of Exception Handling.
11. Demonstrate the concept of Functions and Procedures.
12. Demonstrate the concept of Triggers.

Paper: Programming in Java Lab - 2 1
Marking Scheme:
Instructions:
1. The course objectives and course outcomes are identical to that of (Programming in Java) as this is the
1. Write a java program to implement stack and queue concept.

2. Write a java program to produce the tokens from given long string.
3. Write a java package to show dynamic polymorphism and interfaces.
4. Write a java program to show multithreaded producer and consumer application.
5. Create a customized exception and also make use of all the 5 exception keywords.
6. Convert the content of a given file into the uppercase content of the same file.
7. Write a program in java to sort the content of a given text file.
8. Develop an analog clock using applet.
9. Develop a scientific calculator using swings.
10. Create an editor like MS-word using swings.
11. Create a servlet that uses Cookies to store the number of times a user has visited your servlet.
12. Create a simple java bean having bound and constrained properties.

CSE 2nd Year

Uploaded by

Copyright:

Available Formats

CSE 2nd Year

Uploaded by

Document Information

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

CSE 2nd Year

Uploaded by

Copyright:

Available Formats

Handbook of B.Tech. Programmes offered by USICT at Affiliated Institutions of the University.

Paper Code(s): ES-201 L P C

Paper Code(s): HS-203 L P C

Indian Knowledge System (IKS) - An Introduction:

Foundational Concepts for Science and Technology:

the Binary System

Mathematic and Astronomy in IKS:

Engineering and Technology in IKS:

Paper Code(s): CIC-205 L P C

conquer recurrence relation. Masters theorem (with proof).

Paper Code(s): ECC-207 L P C

Paper Code(s): CIC-209 L P C

Paper Code(s): CIC-211 L P C

Inheritance Constructors, composition vs. classification hierarchies, Containership, Initialization List,

Paper Code(s): EEC-213 / EEC-208 L P C

Paper Code(s): ES-251 L P C

Implementation to be done in C/C++

Paper Code(s): ECC-253 L P C

1. Design and implementation of adders and subtractors using logic gates.

Paper Code(s): CIC-255 L P C

1. Implement sparse matrix using array. Description of program:

Paper Code(s): EEC-253 / EEC-254 L P C

1. Introduction to MATLAB and its basic commands.

Paper Code(s): ECC-263 L P C

Paper Code(s): BS-202 L P C

Paper Code(s): HS-204 L P C

Writing Styles -- Expository, Explanatory, Descriptive, Argumentative and Narrative.

Paper Code(s): CIC-206 L P C

Paper Code(s): CIC-210 L P C

Paper Code(s): CIC-212 L P C

Paper Code(s): BS-252 L P C

Implementation to be done in MATLAB or in equivalent software.

Paper Code(s): CIC-256 L P C

1. Experiments based on DDL commands – CREATE, ALTER, DROP and TRUNCATE.

Paper Code(s): CIC-258 L P C

1. Write a java program to implement stack and queue concept.

You might also like