Discrete Mathematics

Course code PCC-CSE-202

Category Professional Core Coun;e

Course title Discrete Mathematics

Scheme nnd Credits L IT IP I Credits I Semester - 4
3 11 I 14 I
Cla.~s work 25 Mark.~
Exam 75 Marks
Total 100 Mark.~
Duration of Exam 03 Hours

Note: Examiner will set nine questions in total. Question ooe will be compulsory. Question one will have 6 pans of 2.5 marks each
from alJ units and remaining eight questions of 15 marks each to be set by talcing two questions from each uniL The students have to
auempt five questions in total. first being compuJsory and selecting ooe from each uniL

Objectives of the course:

• To impart the basic concepts of SelS, Relation. Function and Propositional Logic
• To understand B11.•ic Counting Tcc.hniqucs and Rccuncncc Relation
• To Understand Definitions and examples of Algebraic Suuccurcs wilh one Binary Operation.
• To implement Graphs and their properties. Degree, Connectivity.

Unit-I
Sets, Relation, Function and PropoaiUonal Logic: Operations and Laws of ScL~. Canesian ProducL~. Reprcsenllltion of relations.
Binary Relation, Equivalence Relation. Partial Ordering Relation. POSET. Has.'ie Diagram. Lunices and its types. Function. Bijective
functions, Inverse and Composite Function. Finite and infinite Set.~. Countabl.e and Uncountable SeL~. Cant.or's diagonal argument and

The Power Set theorem. Schroeder-Bernstein theorem, Propositions, Logical operations. Conditional Statements, Tautologies,
Contradictions. Logical Equivalence, The use of Quantifiers

Unit-D
Basic Counting Tttbnlques and lltturrence Rdatlon: Pigeon-hole principle, Permutation and Combination, the Divis ion algorithm:
Prime Numbers. The GCD: Euclidean Algorithm. The Fundamental Theorem of Ari thmetic., Linear recurrence relation with constant
coefficients, Homogenous Solutions. Particular SolutiorL~. Total Solutions. Solving recurrence relation using generating functions

Unit-m
Algebraic StructurtS: Definitions and examples of Algebraic S1n1cture.~ with one Binary Operation: Semi Groups. Monoids, Groups:
Congruence Relation and Quot.ient Structures. Permutation Groups. Cyclic groups. Normal Subgroups. Definitions and examples of
Algebraic Structure.~ with two Binary Operation: Rings, Integral Domain. Fields: Boolean Algebra and Boolean Ring, ldent.ities of
Boolean Algebra. Duality. Representation of Boolean Function. Disjunctive and Conjunctive Normal Form
Unit-IV
Graphs and Trees: Graphs and the.i r properties. Degree, Connectivity, Path. Cycle, Sub Graph. Bi- connected component and
ArticuJation Points. Isomorphism, MuJtigraph and Weighted graph, Shortest path in Weighted graphs. EuJerian paths and circuits,
Hamiltonian path and circuits, PlanarGraphs, Euler's formulae, Graph Colouring, Trees. Binary trees and its traversals, Trees Sorting,
Spanning tree, Minimal Spanning tree
 Computer Organization & Architecture

Course code PCC-CSE-204

Category Professional Core Course

Course title Computer Organization & Architecll.lre
L IT IP I Credits I
Scheme and Credits
3 lo I oI 3 I Semes1er-rv
Branches (B. Tech.) Computer Science and Engineering
Class work 25 Marks
Exam 75 Marks
Total IOOMarks
Duration of Ex.am 03 Hours

Note: Examiner will set nine questions in total. Question one will be compulsory. Q uestion one will have 6 parts of 2.5 marks each
from all units and remaining eight questions of I 5 marks each to be set by taking two questions from each unit. The swdenLS have to
attempt five questions in total. first being compulsory and selecting one from each uniL

Objedives of the course:

To expose the students to the following:
• How Computer Systems work & the basic principles
• Instruction Level Architecture and Instruction Execution
• The current state of an in memory system design
• How 1/0 devices are accessed and its principles.
• To provide the knowledge on Instruction Level Parallelism
• To impart the knowledge on micro programming
• Concepts of advanced pipelining techniques.
Unit 1
Functional blocks cl. a computer: CPU, memory. input-owput subsystems, control uniL Instruction set architecture of a CPU-
registers, instruction execution cycle, RTL interpretation of instructions. addressing modes. instruction seL Case study - instruction sets

of some common CPUs.

Data representation; signed number representation. fixed and floating point representations, character representation. Computer
arithmetic - integer addition and subtraction. ripple carry adder, carry look-ahead adder. etc. multiplication - shift-and add, Booth
multiplier, carry save multiplier, etc. Division restoring and non-restoring techniques. floating point arithmetic.

Unit 2
Introduction to x86 architecrure.
CPU control unit design: hardwired and mi~programmed design approaches, Case study - design of a simple hypothetical CPU.
Memory system design: semiconductor memory rechnologies. memory organization.
Peripheral devices and their characteristics: fnpu1-0u1pu1 subsystems, 1/0 device interface, 1/0 transfers-program controlled,
interrupt driven and OMA. privileged and non-privileged instructions. sofrware interrupts and exceptions. Programs and processes-role
of interrupts in process state transitions, 1/0 device interfaces - sen. USB
Unit 3
Pipelining: Basic concepts of pipelining. throughput and speedup. pipeline hazards.
Parallel Processors: Introduction to parallel processocs. Concurrent access to memory and cache coherency.
Unit 4
Memory organization; Memory interleaving. concept of hierarchical memory organization, cache memory. cache size vs. block size,
mapping functions, replacement algorithms, write policies.
 Operating System

Course code PCC-CSE-206

Category Professional Core Course

Course Litle Principles ofOperllling System
L IT IP I CrediLs I
Scheme and Credits
3 I 0 I 0 I3 I Semester-4
Br11nches (8 . Tech.) Computer Science and Engineering

C l11ss work 2S Marks

Exam 7S Marks
T01al 100 Marie.~
Dur11tion of Exum 03 Hours
Note: Examiner will set nine questions in to tal. Question one will be compulsory. Question one will have 6 parts of 2.S marks each
from ult units and remaining eight quc.~tions of IS marks euch to be set by taking two questions from each unit . The students h11ve 10
attempt five questions In total. first being compulsory and selecting one from each unit.

Objectives or the course:

T o expose the studenLs to the following:
• How Computer Opcnuing Systems. Gcnenuioos of Opcru1ing sys1cnL~ works .
• Bcnc11Ls of thn:ods, Types of threads, Mullilhreading.
• The current state of Muiunl Exclusion, The Produccr\Consumer Problem.
• How Ba.sic concept. Logical nnd Physical oodrcss mnp works.

UNIT l :
Introduction: Concept of Operating Systems. Generations of Opemting systems. Types of Operating Systems. OS Services. System
Culls. Structure of an OS-Layered. Monolithic. Microkemel Opemting Systems. Concept of Vinuul Mat·hine.
Processes: Definitio n. Process Relationship. Different states of a Process. Process State transitio ns. Process Control Block (PCB).
Context switching. Th~ad: Definitio n. Vuric,us state.,. Benefits of threads. Types of threads. Multithre1iding.
Proce!ill Scheduling: Fo undatio n and Scheduling objective.,. T ypes of Scht.-dulers, Scheduling criteria: CPU utilizmion, Throughput,

Turnaround Time. Wniting Time. Response Time: Scheduling algorithms: Pre-empt ive und Non-pre-empti ve, FCFS. SJF, SRTF. RR
Scheduling.

UNIT l:
Inter-process Communication: Cri tical s~-ction, Ruce Conditio ns, Mutual Exclusion. The Pmduccr\Consumer Problem, Semuphores,
Event Counters, Monitors. Mcssugc Pussing. C lassical IPC Problems: Reader's & Writer Problem, Dinning Phi losopher Problem etc.
Deadlock.1: Definitio n. Neccssury und sufficient conditions for Deudlock. Deadlock Preventio n. und Deadlock Avoiduncc:
811nkcr's 11lgorithm, Deadlock detectio n and Recovery.

UNIT 3:
Memory Management: Basic concept. Logical and Physical address map. Memory allocation: Contiguous Memory allocation
- Fixed and variable panilion-lntcmal and External fragmentat.ion and Compaction: Paging: Principle of operation - Page allocation
- Hardwarcsupport for paging. Protection and sharing. Disad vantnges of paging.
Virtual Memory: Basics of Vinual Memory - Hurdwarc and control structures - Locality of reference. Page fau.lt.
Working Set. Diny page/ Diny bit - Demand paging. Page Replucernent algorithms : Optima l. First in First o ut (FIFO). Optimal Puge
Rcpluccment and Least Recentl y used (LRU).
UNIT4:
1/0 Hardware: 1/0 devices. Device controllers, Direct memory access Prindplc.~ of 1/0 Software: Goals of lnt.crrupt hand lers, Device
drivers, Device independent 1/0 software, Secondury-Storage Structure: Disk structure, Dis k scheduling algorithms
FUe Manaicemenl: Concept of File. Access mcthocl~. File types. File operation. Directory structure. File System structure, Allocution
methods (contiguous. linked. indexed). efficiency and perforn1ance.
Disk Management: Di sk structure. Disk schedul ing - FCFS. SSTF. SCAN. C-SCAN . Disk reliability. Disk fomtaning. Boot-block.
Bad blocks. Cusc study on UNIX and WINDOWS Operating System.
 Object Oriented Programming

Course code PCC-CSE-208

Category Professional Core Course

Course title Object Oriented Programming
L IT IP I Credits I
Scheme and Credits
3 I O I O I 3 I Semester-4
Branches (8 . Tech.) Computer Science and Engineering

Cla<;s work 25 Marks

Exam 75 Marks
Total 100 Marks
Duration of Exam 03 Hours

Note: Examiner will set nine que.<;tions in total. Question one will be compulsory. Question one will have 6 parts of 2.5 marks each
from oil units and remaining eight que.'>tions of 15 marlcs each 10 be set by taking two questions from each unit. The students have to
anempt five questions in t.otal. first being compuL..ory and selecting one from each unit.
Objectives or tht course:
To expose the students 10 the fol.lowing:
• How Object-Oriented Prognunming Conccpcs work.~.
• Crcnting cla.~s object~. occcs.~ing clnss member...
• Concept or binding • early binding and late binding.

UnJt -1
Object-Oriented Programming Concepu: Introduction. comparison between procedural programming paradigm and object-oriented
programming paradigm. basic concepts of object- oriented programming - concepts of an object and a class. interface and
implemenuuion of a cta...s. operation... on object... relat.ionship among object... abstraction. encapsulation. data hiding. inheritwice.
overloading. polymorphism. messaging.
Ouses and Objects: Specifying a class. creating das... objects. accessing cla...s members. access specifiers. static members. use of
const keyword. friends of o cla..s. empty classes. nested classes. locnl classes. abstract classes. container classes. bit fields and cla.~ses.

Uait- D
Inheritance: Introduction, defining derived classes. forms of inheritance. ambiguity in multiple and multipath inheritance. virtual base
cla..s, object slicing , overriding member functions. object composition and delegation. order of execution of constructors and
destructors.
Polnten and Dynamic: Memory Management: Declaring and initializing pointers. accessing data through pointers. pointer arithmetic.
memory allocation (static and dynamic). dynamic memory management using new and delete operators. pointer to on object, this
pointer, pointer related problems • dangling/wild pointers. null pointer assignment. memory leak and allocation fail ures.

UnJt-m
Constructon and Destruc:ton: Need for constructors and destructors. copy constructor, dynamic constructors, explicit constructors,
destructors. constructors and destructors with static members. initializer lists.
Operator Overloading and Type Convenion: Overloading operators. rules for overloading operators, overloading of various
operators, type conversion - basic type to class type. class type to~ic type. class type to another class type.
Virtual (unctions & Polymorphism: Coocept of binding - early binding and late binding. virtual functioos. pure virtual functions,
abstract classes, virtual destructors.
Unit· IV
Exception Band.ling: Review of traditional error handling. basics of exception handling. exception handling mechanism. throwing
mechanism. catching mechanism. rethrowing an exceptioo. specifying exceptions.
Templates and Generic Programming: Template concepts. Function templates. class templates. illustrative examples.
 ORGANIZATIONAL BERA VIOUR
Course code HSMC-02

Category

Course title ORGANJZATIONAL BEHA VJOUR

Scheme and Credits L IT IP I Credits I
3 10 ~ 13 I
Branches (B. Tech.)

C la.~s work 25
Exam 75
rroial 100 Marks
Duration of Exam 03 Hours

The objective of this course is to expose the students to basic concepts of management and provide insights necessary to understand
behavioral processes at individual. team and organizational level.
Note: Examiner will set nine questions in total . Question one will be compulsory. Question one will have 6 parts of 2.5 marks each
from all unit~ and remaining eight questions of 15 marks each 10 be set by taking two questions from each unit. The students have to
auempt five questions in total. first being compulsory and selecting one from each unit.
Objective.~ of the course:
To expose 1he s1udcms 10 the following:
• Defining s~ of management &: lmponnncc of managcmcnL
• Concept of Meaning and process of Organization.
• Concept of Intcrpersolllll Processes- Teams and Groups.

UNIT-I
Introduction or Management- Meaning. definitions, nature of management: Managerial levels, skiJls and roles in an organization:
Functions of Management: Planning. Organizing. staffing. Directing & Controlling. Interrelationship of managerial functions. scope
of management & lmponance of management. Difference between management and administr.ition.

UNIT-2
Introduction or orpnlzatlon:-Meaning and process of Organization. Management vis Organization: Fundamentals or
O rganizational Behavior: Concept~. evolution. importance and relationship with other Fields: Contemporary challenges and
opponunities of OB. lodlvidual Protnser and Behavior-Personality- Concept. determinants andapplicat.ions: Pe.r ceptlon- Concept.
process and applications. Leaming- Concept (Brief Introduction) : Motivation- Concept. techniques and importance

UNIT-3
Interpersonal Processes- Teams and Groups- Definition of Group, Stages of group development. Types of groups. meaning of
team, merits and demerits of team; difference between team and group, Conflict- Concept. sources, types, management of
conflict: Leadership: Concept, function, styles & qualities of leadership.

Communicatloo - Meaning. process. channels of communication. imponance and barriers of communication.

UNIT4
Organizational Processes: Organlzatlonal strvdure - Meaning and types oforganizational structure and their effect on human
behavior; Organizational culture • Elements. types and factors affecting organizational culture. Organizational change:
Concept. types & factors affecting organizational change, Resistance to Otange.
 Web Technologies

Course code LC-CSE-2 10

Category Professional Core Co urse

Course tille Web Technologies
L IT I P I Credits !
Scheme and Credits
2 Io Io I I I
Branches (B. Tech.) Computer Scien'--e and Engineering

C lass wo rk 25 Marks
Ex.am 75 Marks
Total 100 Marks
Duration of Exam 03 Ho urs

Note: Examiner will set nine questions in total. Question one will be compulsory. Question one will have 6 pans of 2.5 marks each
from 1111 units and remaining e ight questions of I 5 marks each 10 be set by taking two questions from each unit. The students have
10 allempt five questions in lotul. first being compulsory and selec1ing o ne from each uni1.
Objectives of the rounM!:
• To impart 1hc hiL~ic concepts of Web Technologies
• T o understand various client side 1cchnologics
• To creme web pages
• To create dynamic upplicu1ions on web through server side technologies

Detailed contents:

Unit I :
Introduction: Concepl of lntcmel - History of lnternel. Procoool~ of lntcmel. World Wide Web, URL. Web Server, Web Browser.
HTML. HTTP. SMTP. POP3. MlME. IMAP.
W eb site des ign principles, planning the site and navigation,

Unit 2:
HT ML and CSS: History of ITTML. Structure of HTML Document: Texl Ba~ics, Document: Images and Muhimedia, Links und
webs , Documenl Layout, Cascading S tyle Sheet 4 Need for CSS, introduction 10 CSS, basic syntax and structure, using CSS,
background images. colors and propenies. manipulating 1ex1s. using fonts, borders and boxes. marg.i ns. padding list~. posiLioning
using CSS,

Unit 3:
XML: Introduction of XML- Some '-'1.lrTCnl upplic.atiorL~ o f XML Features of XML Anatomy of XML document. The XML
Declar111ion, Eleme nt Tags- Nesting and structure. XML text and text formatting clcmcn1. Table elcmcnl, Murk-up Elcmenl und
Allributes . Document Type Definition (DTD). types. XML Objects . Checking Validity. Understanding XLinks. XPoin1er. Evcnl -
dri vcn Programming. XML Scripting.

Unit 4:
PHP: PHP lnLroducLio n. Stru'-'ture of PHP. PHP Functions, AJAX with P HP. PHP Code and lhe Complete AJAX Example. AJAX
Database. W orking of AJAX with PHP. Ajax P HP Database Fonn. AJAX PHP MySQL Select Query.