Bhuhujk

Course Structure for SE Computer Engineering 2012 Course (w.e.f. June 2013)
Subject Code Subject Teaching Scheme Hrs/Week Examination Scheme Pr OR Online Mark
Total

Lect. Tutorials Pract Paper Tw
SEM – I 210241 Discrete Structures 210242 Data Structures and Problem Solving 210243 Digital Electronics and Logic Design 210244 Operating System and Administration 210245 Microprocessor Architecture 210246 Soft Skills Total of Semester – I 4 4 3 3 3 1 18 — — — — — — — — 4 2 2 2 2 12 50 50 50 50 50 — 250 — — 25 25 25 25 100

— 50 — 50 — — 100

— — — — 50 — 50

50 50 50 50 50 — 250

100 150 125 175 175 025 750

SEM – II

Subject Code

Subject

Teaching Scheme Hrs/Week

Examination Scheme Pr
— 50 50 — — — 100 Or Online — — — — — 50 50 50 50 50 50 50 — 250

Mark
Total 125 175 150 100 100 100 750

Lect. Tutorials Pract Paper Tw
207003 Engineering Maths - III Object Oriented and multicore Programming Microprocessors and 210248 Interfacing Techniques Computer Graphics and 210249 Gaming 210247 210250 Computer Organization 210251 Programming Laboratory 4 4 3 3 3 — 17 1 — — — — — 1 — 4 4 — — 4 12 50 50 50 50 50 — 250 25 25 — — — 50 100

Total of Semester – II

210241 DISCRETE STRUCTURES Teaching Scheme Lectures: 4 Hrs/week Examination Scheme Theory: 50 Marks Online: 50 Marks

Discrete mathematics- The mathematics of integers and of collections of object underlies the operation of digital computer, and is used widely in all fields of computer science for reasoning about data structures algorithms and complexity. The primary objective of subject is to prepare students mathematically for the study of computer engineering. Topics covered in the course include proof techniques, logic and sets, functions, relations, counting techniques, probability and recurrences. Prerequisite: Basic Mathematics Program Educational Objectives: … the student will be able to • Use appropriate set, function, or relation models to analyze practical examples, interpret