SEMESTER –I

Mathematics Foundation to Computer Science - I

SBCACT1101 Mathematics Foundation to Computer 3L:0T:0P 3 Credits

Science - I
Course Objectives
CO1: Provide a basic understanding of fundamental mathematical concepts such as sets, functions, matrix
algebra, and discrete mathematics.

CO2: This course enables the students to use mathematical models and techniques to analyze and
understand problems in computer science.

CO3: This course demonstrates how the mathematical principles give succinct abstraction of computer
science problems and help them to efficiently analyze.

Course Content:

UNIT I: Set Theory

Set, Set Operations, Properties of Set operations, Subset, Venn Diagrams, Cartesian Products.
Power sets, Partitions of set, Principle of inclusion and exclusion.

UNIT II: Relation and Function

Relations on a Set, Types of Relations, Properties of Relations, Equivalence Relation, Functions,
types of functions, composition of functions, inverse of functions. Some useful functions for
Computer Science: Exponential and Logarithmic functions, Polynomial functions, Ceiling and Floor
functions.

UNIT III: Matrix and Determinant

Matrix, Types of matrices, algebra of matrices–addition, subtraction, and multiplication of matrices,
determinant of a matrix, symmetric and skew-symmetric matrices, orthogonal matrix, rank of a matrix,
inverse of a matrix, applications of matrices to solve system of linear equations in two variables.

UNIT IV: Graph Theory

Graphs, Basic terminologies of graphs, types of graphs, connected and disconnected graphs, subgraph,
Walks, paths and circuits, , digraphs, weighted graphs, Euler and Hamiltonian graphs,
Trees, properties of trees, spanning tree. Definitions and basic results on the topics mentioned.
 19

Text Books
1. Garg, Reena, Engineering Mathematics, Khanna Book Pub Co, 2024.
(AICTE Recommended Textbook)
2. Garg, Reena, Advanced Engineering Mathematics, Khanna Book Pub Co, 2023,
3. Kolman B., Busby R. and Ross S., Discrete Mathematical Structures, 6th Edition,
Pearson Education, 2015.
4. Deo Narsingh, Graph Theory with Application to Engineering and Computer Science,
Prentice Hall, India, 1979.
5. Vasishtha A. R. and Vasishtha A. K., Matrices, Krishna Prakashan, 2022.

Reference Books
1. Grimaldi Ralph P. and Ramana B. V., Discrete and Combinatorial Mathematics: An
Applied Introduction, Fifth Edition, Pearson Education, 2007.
2. Rosen Kenneth H. and Krithivasan Kamala, Discrete Mathematics and its Applications,
McGraw Hill, India, 2019.
3. West Douglas B., Introduction to Graph Theory, Second Edition, Pearson Education,2015
Web Resources

1. https://nptel.ac.in/courses/106103205
2. https://nptel.ac.in/courses/111101115
 Computer Architecture

SBCACT1102 Computer Architecture 3L:0T:0P 3 Credits

Course Objectives
CO1: To Understand the basics of Digital Electronics and Binary Number System CO2: To
Learn the implementation of Combinational Circuit.

CO3: To Learn the implementation of Sequential Circuit.

CO4: To Understand the Organization of basic computers.

CO5: To Understand the concept of Parallel Processing.

CO6: To understand the concept of memory organization.

Course Content:
UNIT-I
Digital Principles: Definition for Digital signals, Digital logic, Digital computers, Von Neumann
Architecture, Logic Gates, Boolean Laws and Theorems, K-Map: Truth Tables to K-Map, 2, 3 and
4 variable K Map, K-Map Simplifications, Don’t Care Conditions, SOP and POS.
Number Systems: Decimal, Binary, Octal, Hexadecimal, Number System Conversions, Binary
Arithmetic, Error detecting and correcting codes.

UNIT-II
Combinational Circuits: Half Adder and Full Adder, Subtractor, Decoders, Encoder,
Multiplexer, Demultiplexer
Sequential Circuits: Flip-Flops- SR Flip- Flop, D Flip-Flop, J-K Flip-Flop, T Flip-Flop.
Register: 4 bit register with parallel load, Shift Registers- Bidirectional shift register with
parallel load
Binary Counters-4 bit synchronous and Asynchronous binary counter.

UNIT-III
Basic Computer Organization and Design: Instruction Codes, Computer Registers, Computer
Instructions, Timing and Control, Instruction Cycle, Memory-Reference Instructions, Input-
Output Interrupt, Complete Computer Description, Design of Basic Computer, Design of
Accumulator logic. Central Processing Unit: Introduction, General Register Organization, Stack
Organization, Instruction Formats, Addressing Modes, Data Transfer and Manipulation, Program
Control,
 21

UNIT-IV
Parallel Processing. Input-Output Organization: Peripheral Devices, Input-Output Interface,
Asynchronous data transfer, Modes of Transfer, Priority Interrupt, Direct memory Access, Input-
Output Processor(IOP).

Text Books:

1. Donald P Leach, Albert Paul Malvino, Goutam Saha- “Digital Principles & Applications” , Tata
McGraw Hill Education Private Limited,2011Edition.

2. M. Morris Mano- “Computer System Architecture”, Pearson/Phi, Third Edition.

3. Dr.S.B.Kishor Digital Electronics , Dasganu Prakashan Nagpur.

Reference Books:

1 William Stallings- “Computer Organization and Architecture”, Pearson/PHI, Sixth Edition,

2 Andrew S. Tanenbaum- “Structured Computer Organization”, PHI /Pearson 4th Edition,
3 M.V .Subramanyam, “Switching Theory and Logic Design”, Laxmi Publications (P) Ltd.
SBCACP1101 Lab-1: Computer Architecture 0L:0T:4P 2 Credits

Note: Practicals are suggestive and as per CO-PO Mappings. Concerned teacher has freedom
to modify, select all or a subset of these depending upon coverage of syllabus points. However
the modified list must match with CO-PO mapping

Suggestive Laboratory Experiments:

1. Verify logic behavior of AND, OR, NAND, NOR, EX-OR, EX-NOR, Invert and Buffer
gates.

2. To study and verify NAND as a Universal Gate

3. To verify De- Morgan’s theorem for 2 variables

4. Design and test of an S-R flip-flop using NAND/NOR gate.

5. Convert BCD to Excess-3 code using NAND gate

6. To Convert Binary to Grey Code

7. Verification of Truth Tables of J-K Flip-Flop using NAND/NOR gate

8. Realize Decoder and Encoder circuit using Basic Gates.

9. Design and implement the 4:1 MUX using gates.

10. Implementation of 4-Bit Parallel Adder Using 7483 IC.

11. Design and verify operation of half adder and full adder.

12. Design and verify operation of half subtractor.

13. Design and Implement a 4 bit shift register using Flip flops.

14. Implement Boolean function using logic gates in both SOP and POS

15. Design and Implement a 4 bit synchronous counter.

16. Design and verify 4 bit asynchronous counter.

 23

Hardware

1. Familiarize the computer system layout: marking positions of SMPS, motherboard, FDD,
HDD, CD, DVD and add on cards.

2. Identify the Computer Name and Hardware Specification (RAM capacity, Processor type,
HDD, 32 bit/ 64 bit)

3. Identify and Troubleshoot the problems of RAM, SMPS and motherboard

4. Configure BIOS settings- disable and enable USB and LAN 5. Adding additional RAM to
the system.(expanding RAM size).

6. To Study mother board layout of a system.

7. Demonstrate the assembly of a PC

8. Demonstration of various ports: CPU, VGA port, PS/2 (keyboard, mouse) ,USB, LAN,
Speaker, Audio.

9. Install and configure windows OS

10. To study the installation of Printer and trouble shooting.

 Problem Solving Techniques

SBCAST1101 Problem Solving Techniques 3L:0T:0P 3 Credits

Course Objectives
CO1: Understand basic terminology of computers, problem solving, programming Languages and
their evolution (Understand)
CO2: Create specification from problem requirements by asking questions to disambiguate the
requirement statement. (Create)
CO3: Design the solution from specification of a problem and write pseudo code of the algorithm
using basic building blocks or structured programming constructs (Sequence, Selection and
Repetition statement). (Create)
CO4: Translate an algorithm into a C computer program (Create)
CO5: Testing and analysing programs using debugging tools. (Analyze)
Prerequisite: This is an introductory programming course and hence no prerequisites

Course Content:
UNIT I: (CO-1, CO-2)
Problems And Problem Instances, Generalization and Special Cases, Types of
Computational Problems, Classification of Problems, Analysis of Problems, Solution
Approaches, Algorithm Development, Analysis of Algorithm, Efficiency, Correctness,
Role of Data Structures in Problem Solving, Problem-Solving Steps (Understand the
Problem, Plan, Execute, And Review)
UNIT II: (CO-2, CO-3, CO-4)
C Language: Introduction To Programming Languages, Different Generations of
Programming Languages. History of C Language, An Empty C Program. C Language
Counterparts For Input (scanf()), Output (printf()) Statements.
Structured Programming Concepts: Sequence (Input/Output/Assignment), Selection (If,
If-Else) And Repetition (For, While, Do-While) Statements, Control Structure Stacking
and Nesting.
Different Kinds of Repetitions: Entry Controlled, Exit Controlled, Counter Controlled,
Pseudocode and Flowcharts. Definition And Characteristics of Algorithms, Standard
Algorithm Format. Problems Involving Iteration and Nesting: Displaying Different
Patterns and Shapes Using Symbols and Numbers, Fibonacci and Other Sequences,
ASCII, UNICODE.
 25

UNIT III: (CO-2, CO-3, CO-4)

Assignment, Arithmetic, Relational and Logical Operators. If, If-Else Statements, For,
While, Do-While Statements. Data Types. Translating Pseudocode/Algorithm to C
Program. Incremental Compilation and Testing of The C Program. Simple Problems
Involving Input, Output, Assignment Statement, Selection and Repetition. Good Coding
Practices
Problems on Numbers: Extracting Digits of a Number (Left to Right and Right to Left),
Palindrome, Prime Number, Prime Factors, Perfect Number, Armstrong Number,
Factorial.
C Language: else-if Ladder, switch Case, Increment/Decrement Operators, break and
continue Statements.

UNIT IV: (CO-2, CO-3, CO-4, CO-5)

Modular Programming, Top-Down and Bottom-Up Approaches to Problem Solving.
Recursion. Problems on Arrays: One Dimensional and Two-Dimensional Arrays
,Reading and Writing of Array Elements, Maximum, Minimum, Sum, Average, Median
and Mode.
C Language: Function Definition and Declaration (Prototype), Role of Return
Statement. String Functions. Other Operators, Operator Precedence and Associativity.
Debugging.
Introduction to Pointers
Text Books
1. Venkatesh, Nagaraju Y, Practical C Programming for Problem Solving, Khanna Book Publishing
Company, 2024.
2. AICTE’s Programming for Problem Solving (with Lab Manual), Khanna Book Publishing
Company, 2024.

3. Harvey Deitel and Paul Deitel, C How to Program, 9th edition, Pearson India, 2015.

4. R G Dromey, How to Solve It by Computer.

5. Dr.S.B.Kishor, Programming Using C,Dasganu Prakashan,Nagpur.

Reference Books
1. Brian W. Kernighan and Dennis Ritchie, The C Programming Language, 2nd edition, Pearson, 2015.

2. Jeri Hanly and Elliot Koffman, Problem Solving and Program Design in C, 8th edition, Pearson,
2015.