Faculty of Engineering &
Technology
Board of
Studies in Computer Science & Engineering
Proposed
Curriculum structure of S.E.(CSE) and S.E. (IT)
Semester –I W.E.F.
2007-08
|
Sr. No. |
Subject Code |
Subjects |
Teaching Scheme (Hours/Week) |
Examination Scheme (Marks) |
||||
|
Lecture |
Practical |
Theory |
TW |
Practical |
Total |
|||
|
01 |
|
Engineering Mathematics – III |
4 |
-- |
80 |
-- |
-- |
80 |
|
02 |
CSE/IT- 2602 |
Discrete Mathematics |
4 |
-- |
80 |
-- |
-- |
80 |
|
03 |
CSE/IT-2603 |
Data Structures (Using C) |
4 |
2 |
80 |
25 |
50 |
155 |
|
04 |
CSE/IT-2604 |
Data Communication |
4 |
2 |
80 |
25 |
50 |
155 |
|
05 |
CSE/IT-2605 |
Digital Electronics |
4 |
2 |
80 |
75 |
-- |
155 |
|
06 |
CSE/IT- 2606 |
Advanced C Programming Lab |
2 |
2 |
-- |
25 |
50 |
75 |
|
07 |
|
Communication Skills |
2 |
-- |
-- |
50 |
-- |
50 |
|
Total
of I |
24 |
8 |
400 |
200 |
150 |
750 |
||
Semester – II
|
Sr. No. |
Subject Code |
Subjects |
Teaching
Scheme (Hours/Week) |
Examination
Scheme (Marks) |
||||
|
Lecture |
Practical |
Theory |
TW |
Practical |
Total |
|||
|
08 |
|
Engineering Mathematics – IV |
4 |
-- |
80 |
-- |
-- |
80 |
|
09 |
CSE/IT-
2612 |
Open Source Software Technology |
4 |
2 |
80 |
75 |
-- |
155 |
|
10 |
CSE/IT-2613 |
Computer Graphics |
4 |
2 |
80 |
25 |
50 |
155 |
|
11 |
CSE/IT-2614 |
Microprocessors and Computer
Organization |
4 |
2 |
80 |
75 |
-- |
155 |
|
12 |
CSE/IT-2615 |
Object Oriented Programming (
Using C++ ) |
4 |
2 |
80 |
25 |
50 |
155 |
|
13 |
CSE/IT
-2616 |
Mini
Project |
-- |
2 |
-- |
-- |
50 |
50 |
|
|
|
Total of II |
20 |
10 |
400 |
200 |
150 |
750 |
|
Total of I and II |
|
|
800 |
400 |
300 |
1500 |
||
Course
code:
Teaching Scheme : Examination
Scheme:
Theory : 4 Hrs. / week Theory:
80 marks (One paper, 3 hrs)
Unit 1 : Sets and Probabilities (8 )
Contribution of sets, finite and infinite sets, unaccountably infinite sets. The rules of sum and product, discrete probability, conditional probability.
Unit 2: Relations and Functions (8 )
Properties of Binary Relations, Equivalence relation and partitions, Partial ordering Relations and Lattices. Chain and Anti-chains, A Job-Scheduling problem, Functions and Pigeonhole principles.
Unit 3 : Graphs & Trees (8 )
Basic terminology, Multigraphs and Weighted graphs, Paths and Circuits, Shortest paths in weighted graphs, Eulerian paths and circuits, The traveling salesman problem, factors of a graph, Planner graphs, Trees, Rooted Trees, Path lengths in rooted trees, Prefix codes, Binary search trees, spanning trees and cutsets, Minimum spanning trees. Transport networks.
Unit 4 : Discrete Numerical Functions and
Recurrence Relations (8 )
Manipulation and Numerical Functions, Asymptotic behavior, Generating functions and Combinatorial Problems, Recurrence relations, Linear recurrence relations with constant coefficients, Homogeneous solutions, Particular Solutions, Total Solutions, Solutions by the method of generating functions.
Unit 5 : Groups, Rings and Boolean Algebra (8 )
Generators and Evaluation of powers, Cosets and Lagranges Theorem, Rings, integra, domains and fields, Lattices and Algebraic systems, Principal of duality, Basic properties of Algebraic systems defined by lattices, Boolean lattices and Boolean algebras, Boolean functions and Boolean expressions, Propositional Calculus, Design and implementation of digital networks, switching circuits.
Text Books:
1. C.L.Liu , “Elements of Discrete Mathematics”, Tata McGraw-Hill Publication
2. Kollman, Busby and Ross, “Discrete Mathematical Structures”, PHI
Reference
Books:
1. Swapankumar Sarkar, “A Text book of Discrete Mathematics”, S Chand Publication
2. Satindar Pal Gupta , “Discrete mathematics and structures”, Laxmi publications
3. G Shankarrao , “Mathematical foundation of Computer Science” , I.K. International
4. Trembley , Manohar, “Discrete mathematical Structures with Application to Computer Science”, McGraw Hill Pub.
Course Code:
Teaching Scheme :