B.Sc Computer Science

Course Structure
Semester I
Paper I : Introduction to problem solving and programming in C
Paper I Lab : C Programming
Paper II Mathematical Foundation of Computer Science
I. Syllabus
1.Matrices: types, matrix arithmetic, transpose and powers, determinants
2.Binary number system
3.Sequences: sequences, summations
4.Logarithms: exponents, logarithms
5.Boolean algebra: Boolean functions, truth table, DeMorgan's theorem, logic gates
6.Number theory: divisibility, primality
7.Sets, relations, and functions: Venn diagram, set operations, relations and properties, closures, equivalence relations, partial ordering, functions, function types, inverse of functions, composition of functions, recursive functions, recurrence relations, growth of functions
8.Logic: prepositional logic, first order logic, mathematical induction, deduction, proof by contradiction, program correctness
9.Grammars, Languages and Automation: Grammars and Languages, Finite Automaton or Finite State Acceptors, Finite Automaton and Regular Languages Regular Expressions

Paper II Lab: IT Tools Lab

Semester II
Paper III: DATA STRUCURES using C
Practical – Data structures
Paper IV: Computer Organization