ANNEXURE II– B

Department of Information Technology

Central University of Kashmir

B.Tech. CSE

Semester IV
Course
S. No. Code Course Title Credits
1 BT 401 Mathematics IV (Probability and Statistics) 4
2 BTCS 408 Design and Analysis of Algorithms 4
3 BTCS 403 Discrete Structures 4
4 BTCS 404 Digital Electronics & Logic Design 4
5 BTCS 406 L Digital Electronics & Logic Design Lab 2
6 BT 407 Economics for Engineers 2
Total 20

52
 Central University of Kashmir
Course Title Mathematics (Probability and Course Code BT 401
Statistics)
Degree Bachelor of Technology Branch Computer Science & Engg.
Course Type Theory Department Information Technology
Credits 04 L T P
Semester 4th 4 0 0
Course Outline / Content
Unit Topics Week
1. Probability and Statistics: Measures of Central Tendency: Mean,
Median, Mode, Dispersion: Range, Standard Deviation; Probability:
Definition, Motivation, Probability Models, Probability Rules, Sample 4
Space having equally likely outcomes, Conditional Probability; Baye’s
Theorem; Independent Events.
2. Random Variable; Discrete Random Variable, Distribution Function,
Probability Mass Function, Poisson and Binomial Distributions,
4
Continues Random Variables, Probability Density Function , Uniform
and Normal Distributions.
3. Correlation, coefficient of correlation, Linear Regression, regression
coefficient, Method of Least Squares, Introduction to Sampling and
Sampling Distribution, Standard Error, sampling distribution of the 4
Mean (known) Sampling Distribution of the mean (unknown) – The
sampling distribution of the variance.
4. Hypothesis: Tests of Hypotheses, Null Hypotheses and Alternate
Hypothesis, Critical Region, Type I and Type II Errors,, Significance 3
tests ,Level of Significance, Z-test and , χ2—Test of Goodness of Fit .
References
1. Miller and Fread, “Probability and statistics for engineers – Richard A Johnson”
Pearson Education Asia / PHI.
2. Ross, S.M, “Probabilty and Statics for Engineers and Scientists”, 4th Edition,
Elsevier.
3. S.C.Gupta & V.K.Kapoor, “Fundamentals of Mathematical Statistics” Sultan &
Sons, Eastern Economy Edition.
4. Kishor S. Trivedi , “Probability And Statistics With Reliability, Queuing With
Reliability, Queuing And Computer Science Application”, PHI.

53
 Central University of Kashmir
Course Title Design and Analysis of Course Code BTCS 408
Algorithms
Degree Bachelor of Technology Branch Computer Science & Engg.
Course Type Theory Department Information Technology
Credits 4 L T P
Semester 4th 4 0 0
Course Objectives
1. To analyse the asymptotic performance of algorithms.
2. To write rigorous correctness proofs for algorithms.
3. To demonstrate a familiarity with major algorithms and data structures.
4. To apply important algorithmic design paradigms and methods of analysis.
5. To synthesize efficient algorithms in common engineering design situations.
Learning Outcomes
1. For a given algorithms analyse worst-case running times of algorithms based on
asymptotic analysis and justify the correctness of algorithms using Divide and Conquer.
2. Apply the greedy paradigm and explain when an algorithmic design situation calls for
it. For a given problem develop the greedy algorithms.
3. Apply the divide-and-conquer paradigm and explain when an algorithmic design
situation calls for it. Synthesize divide-and-conquer algorithms. Derive and solve recurrence
relation.
4. Apply the dynamic-programming paradigm and explain when an algorithmic design
situation calls for it. For a given problems of dynamic-programming and develop the dynamic
programming algorithms, and analyse it to determine its computational complexity.
5. For a given model engineering problem model it using graph and write the
corresponding algorithm to solve the problems.
6. Compute the approximation factor of an approximation algorithm.
Course Synopsis

1. Introduction to algorithms: the basic concepts of algorithms, including what they are,
how they are designed, and how they are analysed.
2. Asymptotic analysis measure the running time of algorithms using asymptotic
analysis, including big-O, big-omega, and big-theta notation.
3. Sorting algorithms: different sorting algorithms, such as bubble sort, insertion sort,
selection sort, quicksort, merge sort, and heap sort. They will understand the
principles behind each algorithm and their time complexity.
4. Divide and conquer algorithms: divide and conquer algorithms, which involve
dividing a problem into smaller sub-problems, solving each sub-problem.
5. Greedy algorithms: Students will learn about greedy algorithms, which make locally
optimal choices at each step to achieve a global optimum.
6. Dynamic programming: dynamic programming, which involves breaking a problem
into smaller sub-problems and storing the results of each sub-problem to avoid
redundant computations

Course Outline / Content

Unit Topics Week
1. Introduction: Algorithm Design paradigms- motivation, concept of
algorithmic efficiency, run time analysis of algorithms, Asymptomatic 4
Notations. Divide & Conquer: Structure of divide and conquer algorithms:

54
 examples, Binary search, Quick sort, analysis of divide and conquer run
time recurrence relations.
2. Greedy method: Overview of the greedy paradigm, examples of exact
optimization solution (minimum cost spanning tree), approximate solution
(Knapsack problem), single source shortest paths .Dynamic Programming:
3
Overview, difference between dynamic programming and divide and
conquer, applications: shortest path in graph, matrix multiplication,
travelling salesman problem, longest common sequence.
3. Graph searching and traversal: Overview, traversal methods, depth first and
breadth first search. Back Tracking: Overview, 8-queen problem and 4
Knapsack problem.
4. Branch & Bound: LC searching, bounding, FIFO branch and bound,
Applications: 0/1 Knapsack problem, Travelling salesman problem.
4
Computational complexity: Complexity measures, Polynomial vs Non-
Polynomial time complexity; NP hard and NP complete classes, examples.
Text Books
1. Ellis Horowitz and Sartaz Sahani, “Computer Algorithms”, Galgotia Publications.
2. Narasimha Karumanchi, “Data Structures and Algorithms Made Easy: Data Structures and
Algorithmic Puzzles” Careermonk Publications; 5th ed. Edition
References
1. T. H. Cormen, C. E. Leiserson, R. L. Rivest, Clifford Stein, “Introduction to Algorithms”,
2nd Ed., PHI.
2. V. Aho, J. E. Hopcroft, J. D. Ullman, “The Design and Analysis of Computer Algorithms”,
Addition Wesley.
3. D. E. Knuth, “The Art of Computer Programming”, 2nd Ed., Addison Wesley.
4. Algorithm Design, 1ST Edition, Jon Kleinberg and ÉvaTardos, Pearson.

55
 Central University of Kashmir
Course Title Discrete Structures Course Code BTCS 403
Degree Bachelor of Technology Branch Computer Science & Engg.
Course Type Theory Department Information Technology
Credits 4 L T P
Semester 4th 4 0 0
Course Objectives

1. To understand the Principles of Predicate and Boolean Logic, Graph theory, Lattices,
Group theory and Set theory for analysis of various computer science applications.
2. To understand the applicability of basic discrete structures in various fileds of
Computer science.

Learning Outcomes
1. Apply concept of Predicate Calculus in computer science like design of computing
machines, Artificial intelligence, definition of Data structures for programming
languages etc.
2. Apply the knowledge of Boolean algebra in computer science for its wide
applicability in switching theory, building basic electronic circuits and design of
digital computers.
3. Apply Graph algorithms to real-world problems: to identify and model real-world
problems as graph problems.
4. Apply Graph theory to data analysis and visualization: to apply graph theory to
analyze complex data structures, including social networks, biological networks, and
transportation networks.
5. Apply set theory and relations to solve problems in computer science, such as
database management, data structures, and network analysis. This includes the ability
to identify and represent data structures and relationships using sets and relations.
6. Apply abstract concepts of Group theory in modelling and solving non-trivial
problems in different field of cryptography and coding theory.

Course Synopsis

1. Construct mathematical arguments using logical connectives and quantifiers.

2. Verify the correctness of an argument using laws of propositional and predicate
logic and truth tables.
3. Standard forms of representation of Boolean function.
4. Minimization of Boolean expressions for construction of efficient circuits.
5. Use graphs and trees as tools to visualize and simplify situations.
6. The course in Discrete Mathematics will provide students with a strong
foundation in mathematical concepts that are essential in computer science and
information technology fields.
7. The students will develop their analytical and problem-solving skills, which are
important for designing and analysing algorithms, cryptography, and artificial
intelligence..

Course Outline / Content

Unit Topics Week

56
1. Unit 1: Propositional Calculus Statements, Basic operations, Truth value
of compound statements, Algebra of Propositions, Tautologies and
contradiction, Conditional and Bi-conditional statements, logical
implications, logical equivalence, predicates, Universal and existential 4
quantifiers. Logic gates, Boolean Algebra, Postulates of Boolean
Algebra; Theorems of Boolean Algebra, Sum of products and product of
sums Simplification, NAND and NOR implementation
2. Graph Theory Fundamental concepts (basic definitions, operations,
properties); Trees (properties, distances and centroids, spanning trees,
enumeration); Matchings (bipartite graphs, general graphs, weighted
matching); Connectivity (vertex and edge connectivity, cuts, blocks, k-
4
connected graphs, network flows); Traversibility (Eulerian tours,
Hamiltonian cycles); Coloring (vertex and edge coloring, chromatic
number); Planarity (duality, Euler's formula, characterization, 4-color
theorem).
3. Sets: Introduction, Set notations and description, sub-sets, Basis set
operations, Venn diagrams, Combination of sets, Finite and infinite sets
, Uncountable infinite sets, Mathematical induction, Principle of
3
inclusion and exclusion. Relations: Definition, Properties of binary
relations, Equivalence relations and partitions, Partial ordering relations.
Hasse Diagrams.
4. Group Theory Groups, semi group, infinite group, Finite group, order of
a group, Abelian group, subgroup, Necessary and sufficient condition 4
for a subset to be a subgroup of a group
Text Books
1. Kenneth H. Rosen : Discrete Mathematics and its applications,5th Ed. Tata McGraw Hill
(2003
2. J L Mott, A Kandel, T P Baker, Discrete Mathematics for Computer Scientists &
Mathematicians, Prentice-Hall of India.
References
1. C. L. Liu, Elements of Discrete Mathematics, McGraw Hill International Editions. 5.
K. D. Joshi, Foundations of Discrete Mathematics, Wiley Eastern Ltd.
2. K.R Parthasarty : basic Graph Theory, Tata Mc-Graw Hill
3. B. Kolman and R.C. Busby: Discrete mathematical structures for computer science
Prantice Hall, New-Delhi

57
 Central University of Kashmir
Course Title Digital Electronics and Logic Course Code BTCS 404
Design
Degree Bachelor of Technology Branch Computer Science & Engg.
Course Type Theory Department Information Technology
Credits 04 L T P
Semester 4th 04 0 0
Course Objectives

1. To understand the basics of Digital Electronics and different number systems and
conversion between them.
2. To Design and construction of the basic and universal logic gates.
3. To Stud the Boolean algebra and simplification of Boolean expression using different
methods.
4. To Study and construction of sequential logic circuits, understanding various design
of flip flops.
5. To Study the programmable logic devices, shift registers, counters and various
memory devices.
Learning Outcomes
1. Apply Optimization for logical equations using reduction techniques
2. Design different types of code convertors
3. Construct Combinational and Sequential circuits
4. Validate the internal structure of combinational circuits
5. Develop applications of sequential circuits
Course Synopsis

1. The Course includes the Binary Systems, Boolean algebra & Logic Gates,
Simplification of Boolean Functions, Combinational Logic, Sequential Logic,
Registers, Counters, Data Converters.
2. The course will provide students with a strong foundation in designing and analyzing
digital circuits and systems, which is essential in computer science and information
technology fields.
3. The students will also develop their analytical and problem-solving skills, which are
important for designing and optimizing digital circuits and systems.
Course Outline / Content
Unit Topics Week
1. Review of number systems, BCD, Excess-3, Gray and Alphanumeric
codes. Review of Boolean algebra, De-Morgan's Theorems, Standard
04
Forms of Boolean Expressions, Don’t care conditions, Minimization-
Techniques: K-MAPS, Q-M (Tabulation) method.
2. Combinational Logic Circuits: Problem formulation and design of Basic
Combinational Logic Circuits, Combinational Logic Using Universal
Gates. Basic Adders, ALU, Parity-Checkers and Generators,
04
Comparators, Decoders, Encoders, Code Converters, Multiplexer (Data
Selector), Demultiplexers.

3. Sequential Circuits: Latches, Flip-flops (SR, JK, T, D, Master/Slave FF,

) Edge-Triggered Flip-Flops, Flip-Flop Operating Characteristics, Basic
04
Flip-Flop Applications, Asynchronous Counter Operation, Synchronous
Counter Operation, Up/Down Synchronous Counters.

58
4. Shift registers & Memories, Shift Register Functions, Serial In - Serial
Out Shift Registers, Serial In -Parallel Out Shift Registers, Parallel In -
Serial Out Shift Registers, Parallel In - Parallel Out Shift Registers, 04
Bidirectional Shift Registers. Basics of Semiconductor Memories,
Random-Access Memories (RAM),Read Only Memories(ROMs).
Text Books
1. Morris Mano, Digital Logic Design, TMH
2. Kumar Anand, Digital Logic Design, PHI.
References
1. Thomas L. F., Digital Fundamentals, Prentice Hall, Inc, 4th Edition 1997
2. Tocci R. J. &Widner, Digital Systems: Principles and Applications, PHI.
3. Gothman, Fundamentals of Digital Electronics, PHI.

59
 Central University of Kashmir
Course Title Digital Electronics &Logic Course Code BTCS 406 L
Design Lab
Degree Bachelor of Technology Branch Computer Science & Engg.
Course Type Laboratory Department Information Technology
Credits 2 L T P
Semester 4th 0 0 2
Course Objectives

1. To understand the basic of Digital Electronic concepts required in analysis and design
of digital electronic circuits and systems.
2. To understand the implementation of Boolean expression via different components.
3. To understand Construction and operation of various digital circuits such as Adder,
Subtractor, Multiplexer, Demultiplexer, Decoder, Encoder, Flip-flops, Counters,
Registers and memory devices.
4. To evolve the capability in student so that he/she will be able to simplify, Analyse and
design the Various Digital Electronic Circuits.
Learning Outcomes

1. Apply knowledge of Boolean algebra and other minimization techniques for digital
circuit design.
2. Identify, formulate and solve a problem based on combinational and sequential
circuits.
3. Select the appropriate hardware and software tools for combinational and sequential
circuit design.
4. Design and analyze combinational and sequential circuits for various practical
problems using basic gates and flip flops.
Course Synopsis

1. The Digital Logic Design Lab will provide students with practical experience in
designing, implementing, and testing digital circuits and systems.
2. The lab exercises will help students to develop their problem-solving and critical
thinking skills, which are important for designing and optimizing digital circuits and
systems.

Course Outline / Content

Lab Weeks

60
  Implementation of the logic of
a. OR gate
b. AND gate In acordance
c. Not with theory
d. NAND gate of BTCS
e. NOR gate 404
f. Ex-OR
g. Ex-Nor
 Realization of NAND and NOR as universal Gates.
 To simplify the given expression and to realize it using Basic
gates and Universal gates.
 To realize
a. Half Adder and Full Adder
b. Half Subtractor and Full Subtractor.
 To design and set up a Multiplexer (MUX) , Demultiplexer
(DE-MUX).
 To realize the logic of gates and the given Boolean expression
via Mux.
 Truth Table verification of 1) RS Flip Flop 2) T type Flip Flop.
3) D type Flip Flop. 4) JK Flip Flop.
 Implementation of Synchronous, asynchronous counters and
Modulo-Counters.

Text Books
1. Morris Mano, Digital Logic Design, TMH.
2. Kumar Anand, Digital Logic Design, PHI.
References
1. Thomas L. F., Digital Fundamentals, Prentice Hall, Inc, 4th Edition 1997. Gothman,
2. Tocci R. J. &Widner, Digital Systems: Principles and Applications, PHI.
3. Fundamentals of Digital Electronics, PHI.
Simulation Tools
1 PSpices and NGSpice
2 Xcircuit

61
 Central University of Kashmir
Course Title Economics for Engineers Course Code BT 407
Degree Bachelor of Technology Branch Computer Science & Engg.
Course Type Theory Department Information Technology
Credits 02 L T P
Semester 4th 02 0 0
Course Objectives
1. To understand major principles of economic analysis for decision making among
alternative courses of action in engineering.
2. To understand the cost estimation and alternative analysis techniques for engineering
applications.
3. To demonstrate knowledge of cost estimation techniques and probabilistic risk
analysis.

Learning Outcomes

1. Apply the basic concepts and terminology used in engineering economics.

2. Apply the concepts of cash flows, time value of money in evaluation of investments
and projects in real life.
3. Compare and evaluate alternatives based on present, annual, rate of return, and benefit
over cost analyses.
4. Identify and analyse the impact of depreciation, taxation and other economic factors
on feasibility of real life projects.
5. Recognize the economic impact of engineering solutions and Conduct sensitivity
analysis on key compounding parameters, so as make financially prudent decisions in
everyday life.
Course Synopsis
1. This course will introduce various concepts and methods of economic analysis in
engineering, including the time value of money and its effect on economic decisions.
2. Course also discusses economic equivalence, economic measures of worth, cash flow
analysis, equipment depreciation, effects of inflation, decision making under
uncertainty, capital budgeting, replacement decisions, and benefit-cost analysis.

Course Outline / Content

Unit Topics Week
1. Utility analysis –Concept of demand and law of demand; Cardinal
Utility, Law of diminishing marginal utility; Ordinal utility—
assumptions, Indifference curves and their properties, Marginal rate of 04
substitution, Budget line, Consumer’s equilibrium using Indifference
curves; Elasticity of Demand— Price, income and cross elasticity.
2. National income-concept and related aggregates, measurement of
national income- income, expenditure and value added method; Circular
03
flow of income and expenditure-two, three and four sector model;
Consumption function and its determinants.
3. Meaning and scope of public finance; Concept of budget and its types,
measures of budget deficit- fiscal deficit, revenue deficit, and primary
03
deficit. Taxation- types of taxes, Impact and incidence of taxation.
Meaning and objectives of fiscal policy, Fiscal responsibility and budget

62
 management Act; Deficit Financing– meaning, objectives and causes,
Effects of deficit financing.
References
1. A. Koutsoyiannis, Modern Microeconomics, Second Edition, Macmillan Press,
London.
2. D.N Dwivedi, Microeconomics – Theory and Applications, Pearson Publications.
3. P.A Samuelson and W. Nordhaus, Economics, 19th Edition, Tata McGraw Hill
Publication.
4. Richard T Froyen, Macroeconomics, 10th Edition, Pearson Education. Delhi.
5. N. Gregory Mankiw, Macroeconomics, 5th Edition, Macmillan.
6. D.N Dwivedi, Macroeconomics – Theory and Policies, Pearson Publications.
7. H. L Bhatia, Public Finance, 29th Edition, Vikas Publication.
8. R.R Barthwal, Industrial Economics- An Introductory Textbook, New Age
Publication.

63