BECSE DetailedSyllabus
BECSE DetailedSyllabus
BECSE DetailedSyllabus
F.S. BE I
PAGE # 1
CVL 1101 : FUNDAMENTALS OF CIVIL ENGINEERING-I
Theory : 4 Lectures Marks(Theory) : 100
Tutorial : 0 Marks(Pr/Tw/Viva) : 50
Practicals : 3 Hrs. Total : 150
A) Enginering materials :
1.(a) Stones: types and classification of stones - characteristivcs of good stones - choice and uses of stones. (b) Bricks:
classification of bricks - factors affecting quality of bricks - characteristics of good bricks - As per ISI specifications - Field
bests of bricks -special forms of bricks - Bricks for special purposes like refractory bricks. 2.(a) Lime : Classification of lime -
characteristics of good lime - slaking process of lime - I.S. specification of lime (b) Cement : Basic ingrediant of ordinary
cement - Physical properties of cement, Field examinations of cement - storing of cement - veriseties of cement and, its uses- I.S.
specification of ordinary cement. 3. Mortar and concrete : Specifications of ingrediants for mortar and concrete, classification of
mortar and concrete - selection of mortar and its uses. Production and quality control of concrete, Physical properties of
concrete. Functions of ingredients, Coarse aggregate and Fine aggregate Fly ash in cement and its effects. 4. Timber :
Characteristics of good timber - Importance of seasoning of timber, Requirements of good preservations. 5. Plastics, Steel &
Glass : Basic types of plastics - physical & mechanical, properties of plastics - uses of plastics in various engineering field - uses
of steel - properties of mild steel - market forms of steel - composition of glass, properties and uses of glass - special varieties of
glass.
B) Surveying :
6. Introduction : Principle , role of survey , classification , basic instruments in linear and angular measurements , chain, tape,
compass, uses , field work and notes , survey drawings, conventional symbols , scale. 7. Levelling : Temporary adjustments ,
field work , computation of levels , arithmetic checks ,
C) Building construction : 8. Basic components of building and their functions
D) Introductory environmental engineering : 9.Terminology: Air, water and land pollution , introduction to various type of
pollution and remedial for control , ecology, environmental protection and leqislation , water & waste water quality criteria ,
disposal of wastes.
Termwork : Termwork will consist of practicals, drawings and sketches based on the above topics of the subject.
References:1) Engineering Materials S.C. Rangwala 2) Engineering Materials R. K. Rajput 3) Concrete Technology M. S.
Shetty 4) Building Materials Surendra singh 5) Material of construction D. N. Ghose 6) Elementry Survey B. C. Punmia 7)
Surveying and leveling S. C. Rangwala 8) Introduction to environmental engineering and science Gilbert M. Masters
PAGE # 2
S.S. BE-I
AMT 1201 : APPLIED MATHEMATICS II
Theory : 4 Lectures Marks(Theory) : 100
Tutorial : 0 Total : 100
1. Practical Derivatives : Functions of two variables, limits. continuity and Derivatives. Euleys theorem, chain Rule. Implicit
functions, Differentials. Applications of pratical derives : Tanget plane and Normal Line. Approximataion, Maxima-Minima,
Lagranges Multipliers method. Envelopes. 2. First Order Partial diffrential equation. 3. Vector Calculus : Gradient of a scalar
function. Directional derivative. Divergence and curl of a vector field and its applications. 4. Analytic solid grp.ryty : Plane,
Sphere, Cone, Cylinder, Conicoids. 5. Tracing of conics : Cardioid; cycloid, Lemniscase, Spirals, Four leaved rose etc. 6.
Matrices : Revision, Rank of a Matrix, Solution of algebraic Liner equations : equations in N unknows. Eigne values and
Eigenvectors. Bilinear, quadratic, Heritian and skew Herhitian forms. Eigen values of Hermitian, Sknew-Hermitian, unitary
matrices. Bounds of Eigness Values.
PAGE # 3
tranformer. 5. A) Alternators : Construction,EMF equation,Regulation. O.C.and S.C.test. Synchronization of alternators. B)
Sync. Motors : Principle of working. Methods of starting V characteristics. Appln. of sys.motors.
Termwork : About 8 to 10 experments based on the above syllabus.
REFERENCES :1. Applied Electriucity-H.Cotton 2. Electrical Technology -B.L.Thareja 3. Advance Electrical Technology-
H.Cotton 4. Problems in Electrical Engg.- Parker Smith
PAGE # 4
FS BE II
AMT1301 : APPLIED MATHEMATICS III
Theory : 3 Lectures Marks(Theory) : 100
Tutorial : 0 Total : 100
1.Multiple Integrals : Reorientation of concept integrals, line integrals, double & triple integrals, evaluation techniques, change of
order of integration, integrals in polar & cylindrical co-ordinates, transformation of multiple integrals, application of double &
triple integrals for evaluation of area, volume, mass. 2 Vector Calculus : Surface integrals, Greens Theorm, Gauss Divergence
Theorm, Stokes Theorm, application of integrals theorm. 3 Introduction to Fourier Series & Walsh Series :Fourier expansion of
periodic functions with period 2#, fourier series of even & odd functions, half range series, fourier series of functions with
arbitrary periods, conditions of convergence of fourier series. Walsh Series, Walsh Functions & their applications. 4 Fourier
Transforms and discrete fourier transforms :Fourier transforms, fourier sine transforms, fourier cosine transforms, linearity
property, fourier transforms of derivatives, convolution theorm, applications. Discrete fourier transforms, inverse discrete fourier
transforms & their properties, fast fourier transform algorithm. 5 Special Functions : Properties of Bessels Functions & legendre
polynomials, examples of differential equation leading to Bessels Functions & legendre polynomials.6 Functions of Complex
Variables : Limit, continuity & derivative of functions of a complex variable. Analytic functions & applications; harmonic
conjucate harmonic & potential function. Complex integration, line integrals, Cauchy integrals theorm, Cauchy integrals formula.
REFERENCES: 1. Advanced Engg. Mathematics : Erwin Kreyszig, John Willey & Sons 2 .Introduction to Partial differntial:
Donald Greens Span 3. Advanced Engg. Mathematics : C.R. Wylie
PAGE # 5
reference 3) Object Oriented concepts in C++, Concept of encapsulation and abstraction, Implementing them through classes and
structures 4)Static Polymorphism, Function overloading, Operator overloading, Binary operators, Unary operators 5) Data
conversions, Basic and user-defined, Between two user-defined objects, 6)Inheritance, The need for inheritance, Base and
derived class specification, Access specifiers with respect to inheritance, Types of inheritance, Multiple , Mutli-level, Hybrid,
Overriding of functions, Composition, Composition vs Inheritance 7)Runtime Polymorphism, The need for runtime
polymorphism, Virutal Functions, Abstract base classes, Virtual base classes, Virtual destructors 8) Input and Output in C++,
Console Input and Output, File processing in C++, 9)Templates, The neeed for templates, Function templates, Class templates,
Templates and inheritance, 10)Exception handling, What is exception handling?, The syntactical elements : try, catch and throw,
Rethrowing, Exception Specification, Stack unwinding, Processing failures in memory allocation through new11)Advanced
features, Casting operator , static_cast, reinterpret_cast, const_cast, Namespaces, RTTI, type_id, dynamic_cast, explicit
constructors, mutable data members
REFERENCES :1.C++ - How to Program 2 -Dietel and Dietel 3Programming in C ++ : Robert Lafore 4 Let Us C++:
Yashvant Kanitkar 5 Object-Oriented Modeling & Design :James Rumbaugh & others
PAGE # 6
SS BE II
AMT 1403 : APPLIED MATHEMATICS IV
Theory : 3 Lectures Marks(Theory) : 100
Tutorial : 0 Total : 100
1.First order partial differential equation : Models of engineering problems leading to first order partial differential equation,
lagranges equations, special types of I order partial differential equation. 2 Second order partial differential equation :Second
order partial differential equation , models leading to second order partial differential equation . Boundry value problems
involving second order partial differential equation and their solution by methods of seperation of variables. Heat, wave and
laplace equation and their solution by methods of seperation of variables and using fouriers series. 3 Laplace Transforms
:Laplace Transform of Dirac Delta function , unit step function , convolution theorm , application of Laplace Transforms to the
solution of ordinary and partial diff. equation.4 Transformation and Conformal mappings :Linear transformation of complex
domain , some special transformation , by bilinera transformation , transfomation by some standard functions , conformal
mapping , application of transformation and conformal mapping. 5 Difference equations :Formation of Difference equations ,
Solution of linear first order and second order Difference equations . 6 Introduction to theory of algorithm :Problems and
instances , algorithm , characteristics of algorithm , concept of test data, efficiency of algorithm , theoritical empirical and hybrid
approaches to measure efficiency, time complexity , space complexity, asympotic notations , solving recurrences using
characteristic equations , example of simple algorithms and their analysis. 7 Algebraic structures :Binary relations and their
properties, partial ordering , partially and totally ordered sets , Hasse diagrams , Glb and lub of subset of a poset. Lattices,
properties of lattices , complete, uncomplemented and distributive lattices. Boolean algebra nad boolean functions, algebraic
system and their properties , semigroups , monoids,homomorphisms, subsemigroups and sub monoids. 8 Groups :Definitions and
examples , sub groups and homomorphism, left and right cosets, normal subgroups.
REFERENCES : 1. Advanced Engg. Mathematics: Erwin Kreyszig, John Willey & Sons 2. Introduction to Partial differntial:
Donald Greens Span 3. Advanced Engg. Mathematics : C.R. Wylie 4. Discrete mathematical structures : J P Tremblay and
Manohar 5. Discrete mathematical structures : B kolman and R C Busby for comp. sc.
PAGE # 7
Objectives: The students must have knowledge of basic organization and functioning of a computer. In this subject they learn the
basic designing of logic circuits in a computer. After completion of this course, students can design the basic combinational and
sequential circuits of a computer.
1 Number systems 2 Logic gates 3 Switching algebra 4 K-map 5 Tabulation procedure to simplify the switching expression 6
Flip-flops 7 Registers 8 Counters 9 Finite state machine 10 Synchronous & asynchronous sequential circuits 11 Design of
sequence detector
REFERENCES :1. Switching and Finite Automata Theory - Zvi Kohavi 2. Digital Computer Electronics - Malvino
PAGE # 8
FS OF BE III
ELE1514 : ANALOG AND DIGITAL COMMUNICATION
Theory : 4 Lectures Marks(Theory) : 100
Tutorial : 0 Marks(Pr/Tw/Viva) : 50
Practicals : 3 Hrs. Total : 150
1.Modulation :Need and advantages of modulation,amplitude,frequency and phase modulation amplitude modulation waveforms
and expressions for modulated signal. Index of modulation, power in modulated signal,spectrum of modulated signal, types of
amplitude modulation, amplitude modulators & detectors, IC balanced modulator and its uses. 2.Angle Modulation :Frequency
and phase modulation, expressions,modulation index and waveforms, bandthwidth and spectra of frequency modulation.
Frequency modulators and detectors. Phase locked loops and their applications. 3 Pulse Modulation :Sampling theorm and
sampled waveforms. Recovery of signals after sampling,effect of aliasing and interpolation distortion. Pulse position and pulse
width modulation,time division multiplexing. 4 Digital modulation :PCM and delta modulation.encoding of digital signals, clock
recovery,digital multiplexers. framing and synchronisation. bit stuffing and elastic store. base-band PCM transmitters and
receivers. 5 Analog transmission of digital signals :Communication media such as two-wire line, twisted pair, coax cable,fibre
optic cable. amplitude,frequency and phase shift keying, QPSK, QAM, MFSK, MPSK and other multi-level transmission
techniques. Transmitter and receiver block diagrams for each modems. 7 Propogation and noise : Space wave and sky wave
propogation, satelite channels, etc. and their properties. types of noise, interference, crosstalk , dispersion and other phenomenon
which affect accuracy of digital transmissions. Minimization of these effects.
PAGE # 9
Interprocess communication and synchronization. 5.Memory management : Contiguous & Non-Contiguous allocations. Virtual
Memory management. Instruction interruptability in Virtual Memory. Different schemes of memory management. 6.File
information management and file systems. File System funtions. Directory organizations. Space management of File System.
7.Students Assignment : Study of a single user and multiuser Operating System.
REFERENCES :1.Operating Systems :Madnick & Donovan 2.Operating Systems Principles:Hansen Per Brinch 3.Design of
UNIX Operating Systems: Bach M. 4.Operating Systems Principles:Milan Milenkovic 5.Operating Systems Design &
Implementation :Andrew S. Tanenbaum
PAGE # 10
SS OF BE - III
CSC1605 : MICROCONTROLLORS
Theory : 4 Lectures Marks(Theory) : 100
Tutorial : 0 Marks(Pr/Tw/Viva) : 50
Practicals : 2 Hrs. Total : 150
Prerequisites : 1. Combinational and Sequential Circuits 2. Computer Subsystems
Objectives :Preliminary knowledge of design of combinational and sequential circuits is essential to start this course. The
knowledge about functions and the interactions of the subsystems of a computer is also essential . This course aims to make
students understand the internals of microcomputer 8031 I.C. and connecting it to external memory and I/O devices. To study the
machine language programming of 8031icorcomputers and the use of machine language in solving different software programs.
To study different applications using I/O I.C., programmable timer, programmable keyboard, display IC along with machine
programming. To study the concepts of interrupt and Direct Memory Access (DMA).
PAGE # 11
1.Introduction to 8031 microcontroller I.C. hardware (timer, I/O and other pins), data bus, address bus, RAM, ROM,
internal block diagram, etc. 2.Instruction set, program and applications 3. Chip-select decoder circuit 4. Interrupts, DMA
and its controller-IC 8257 5.Peripheral Programmable Interface - IC 8255 6.Programmable Keyboard Display - IC 8279 7.
Serial Synchronous/Asynchronous Receiver/Transmitter - IC 8251
REFERENCES : 1.Microprocessors Theroy and :M.Rafiquzzaman Applications INTEL & Motorola 2.The 8051
Microcontroller: Architecture,:Ayala Programming and Applications 3.Intel Microcontroller Handbook 4. Intel Peripheral
Data Manual
PAGE # 12
F.S. BE - IV
CSC1703 : COMPUTER GRAPHICS
Theory : 4 Lectures Marks(Theory) : 100
Tutorial : 0 Marks(Pr/Tw/Viva) : 50
Practicals : 2 Hrs. Total : 150
Prerequisites : 1. Exposure to data structures and algorithms. 2. Knowledge of computer programming and
mathematics.
Objectives:Understanding the fundamental graphical operation and the implementation on a computer. Understanding the
mathematics behind computer graphics, including the use of spline curves. 1.Geometry & Line Generation : Lines, Vector
Generation, Bresenhams Algorithm, Character Generation etc. 2.Graphics Primitive :Display devices, primitive operations,
display-file interpreter, normalized device co-ordinates, display-file structure, display-file algorithms etc. 3.Polygons :Polygon
representation, algorithms, initialization, antialiasing etc. 4.Transformations :Matrices, Scaling transformations, rotation,
homogeneous co-ordinates and translation, other transformations, display procedures etc. 5.Segments :The segment table,
segment creation, closing/deleting/renaming a segment, some raster techniques etc. 6.Windowing & Clipping :The Viewing
transformation, clipping, the Cohen-Sutherland Outcode Algorithm, Clipping of polygons, generalized clipping, multiple
windowing etc. 7.Interaction :Hardware, Input device handling algorithms, event handling, sampled devices, the detectability
attribute, simulating a locator with a pick a vice-versa, echoing etc. 8.Three Dimensions: 3D Geometry, 3D Primitives, 3D
Transformations, Rotation about an arbitrary axis, parallel projection, perspective projection. 9.Hidden Surfaces & Lines :Back -
Face removal back-face algorithms, Z - buffers, Scanline algorithms, the painters algorithm, comparision techniques, hidden-line
methods, binary space partition etc. 10.Curves & Fractals: Curve Generation, interpolation, interpolating algorithms, polygons,
fractal lines, fractal surfaces etc.
REFERENCES :1. Principles of Interactive Computer Graphics: Newman W. Sproul R.F.2. Interactive Computer Graphics:
Giloi W. K. 3.Computer Graphics : Harrington S.
PAGE # 13
Prerequisites : 1. Principles of Programming Languages. 2. Data Structures
Objectives: This course assumes the knowledge of any programming language and the need for program compilation along with
the advantages and disadvantages of data structures. The course teaches the basic structure of a compiler and the construction
issues of a compiler. After the completion of this course the student will be able to design a compiler.
1.Two pass Assembler 2 LEX & YACC 3 Basic sturcture of compiler 4 Lexical Analyzer, Regular Expression, Input buffering,
Transition Diagram, Transition Table, Finite Automata, NFA, DFA, Regular Expression to DFA, Regular Expression to
Grammar, 5. The Syntactic Specification of Programming Languages., Context - free Grammars, Derivations and Parse trees,
Capabilities of Context - free grammars, 6. Syntax Analysis., Top Down Parsing, Bottom Up Parsing, Operator - precedence
parsing, LR parsers, 7. Syntax Directed Translation, Syntax - directed definitions, Construction of syntax trees, S- attributed
definitions and L- attributed definitions, Top - down translation, Recursive evaluators, 8. Type checking, Specification of simple
type checker, Equivalence of type expressions, Type conversions, Polymorphic functions, 9. Run - Time Environments, Source
language issues, Storage organization ,Storage - allocation strategies, Parameter passing, Symbol Table, Dynamic storage
allocation techniques, 10. Intermediate Code Generation, Intermediate languages, Declarations, Assignment statements, Boolean
expressions, Case statements, Backpatching, Procedure calls, 11. Code Generation, Basic blocks and flow graphs, Next - use
information, Register allocation and assignment, Peephole Optimization, 12. Code Optimization, Principle sources of
optimization, Optimization of basic blocks, Loops in flow graphs, Introduction to global data - flow analysis, Iterative solution of
data - flow equations, Code - improving transformations, Efficient data - flow algorithms, Estimation of types, Symbolic
debugging of optimized code
REFERENCES : 1. Principles of Complier Design: Alfred V. Aho, Jeffrey D. Ullaman 2. Compilers - Principles, Techniques,
and Tools : Alfred V. Aho, Ravi Sethi & Jeffrey D. Ullman
PAGE # 14
S.S. BE - IV
CSC1801 : ELECTIVE - I
CSC1811 : EMBEDDED SYSTEMS
Theory : 4 Lectures Marks(Theory) : 100
Tutorial : 0 Marks(Pr/Tw/Viva) : 50
Practicals : 2 Hrs. Total : 150
Prerequisites:Microprocessors and Microcontrollers, Operating Systems, Programming Languages
Objectives:At the end of this course, students will have knowledge of the following:- Applications of real time operating
systems,Applications of Microcontrollers
Introduction to Embedded Systems, characteristics of embedded systems, applications, common design metrics and design
challenges.2 Processors: Single purpose and General purpose processors, their basic architecture, operations. Superscalar and
VLIW architectures, application specific instruction set processors ( ASIPs ). Digital signal processors ( DSPs ), ARM
processors, SHARC processors, microcontrollers. 3 Data acquisition systems DAS design 4 RTOS properties, RTOS in
embedded systems, RTOS architecture, kernel, task enrolment and scheduling, task prioritization, context switching,
multitasking, preemptive and cooperative inter task communication, event management, locking mechanism, interrupt handling,
watchdog timer, exceptions, criteria for choosing RTOS Introduction to commercial RTOS like QNX, VxWorks from
WindRiver, ThreadX from Express Logic, eCos from RehHat, Hard Hat from Mont Vista, Embeddix from Lineo, Embedded
Linux, Nucleus from ATI, WinCE, Embedded NT from Microsoft 5 Device drivers, their architecture, types, implementations (
Presentation ) 6 Networks for embedded systems, network processors their basic architecture I2C Bus, CAN bus, SHARC link
ports, Myrinet, Traffic manager and its basic architecture. 7 Embedded system design process, system design techniques, design
methodologies, requirements analysis, specifications, system analysis and architecture design, Quality assurance, design example.
REFERENCES : 1 Embedded system design : A unified hardware/software introduction , Frank Vahid, Tony Givargis ( Wiley
publishers ) 2 Computers as components principals of embedded computing system design, Wayne Wolf ( Morgan Kaufmann
Pub ) 3 Embedded Microcomputer systems Real time interfacing , Jonnathan W Valvano ( Thomsan Learning ) 4 Embedded
Realtime Systems Programming ,Sriram V Iyar and Pankaj Gupta
CSC1812 : ARTIFICIAL INTELLIGENCE
Theory : 4 Lectures Marks(Theory) : 100
Tutorial : 0 Marks(Pr/Tw/Viva) : 50
Practicals : 2 Hrs. Total : 150
Prerequisites : Computer science and mathematics., Discrete structures., Predicate logic., Programming
languages.
Objectives : At the end of this course the students will have learned : Representation of world knowledge using
symbolic logic. Deductive strategies employed in symbolic logic. Programming in prolog. 1 Facts, Questions, Variables,
Conjuctions, Rules 2 Syntax, Characters, Operators, Equality and Matching Arithmetic 3 Structures and Trees, Lists, Recursive
Search, Mapping Recursive Comparision, Joining Stucture together, Accumulators, Difference Structure 4 Generating multiple
solutions, The Cut, Common uses of the Cut, Preventing backtracking, Negation and Failure, Problems with the Cut 5 Reading
and Writing Terms, Reading and Writing Files, Declaring Operators 7 Entering new clauses, Success and Failure, Classifying
Terms 8 Treating clauses as Terams, Constructing and accessing components of structures, Affecting backtracking, Constructing
Compound Golas, Equality, Input & Output, Handling Files, Evaluating Arithmatic Expressions, Comparing Numbers, Watching
PROLOG at work 9 Operations on Data Structures, Representing and Sorting lists, List Processing, Representing Sets by Binary
Trees, Insertion and Deletion in Binary Dictionary, Displaying Trees, Graphs, Tree Representation, Search Strategies Depth first
Breadth first Best first 10 Brief Introduction to Predicate Calculus Horn Clauses 11 Declarative and Procedural meaning of
PROLOG programs 12 Expert System 13 Natural Language Processing 14 Pattern Matching
REFERENCES : 1 Introduction of Artificial Intelligence :Charniak E. 2 Artificial Intelligence :Elaine Rich 3 Artificial
Intelligence :Hunt E. D. 4 Programming in PROLOG :Clockcin & Mellish 5 Introduction to Turbo PROLOG:Carl Townsend
CSC1813 : MANAGEMENT INFORMATION SYSTEM
Theory : 4 Lectures Marks(Theory) : 100
Practicals : 0 Hrs. Total : 100
Prerequisites : Organisational Structure
Objectives : To enable students to understand concepts of management and study in detail the information systems which help
the management in decision making.
1. Management Information Systems: MIS : Concept, MIS : Definition , Role of MIS, Impact of MIS, MIS and computer, MIS
and academics, MIS and user 2. Information: Information concepts, - Information : a quality product, Classification of
information, Methods of data and information , collection, Value of Information, General model of a human as an information
processor, Summary of information concepts and their implications , Organization and information, MIS and information
concepts, 3. Systems : System concepts, System control, Types of system, Handling system complexity, Post implementation
problem in a system, MIS and system concepts 4. Development Of MIS ,Development of long range plans of MIS,
Ascertaining the class of information, Determining the information requirement, Development and implementation of MIS,
Management of quality in MIS, Organization for development of MIS , MIS : factors of sucess & failure 5. Applications In
Manufacturing Sector 6. Applications In Service Sector 7. Decision Making , Decision concepts, Decision methods toos &
procedures, Behavioural concepts in decision making, Organizational decision making, MIS & decision making concepts 8.
Decision Support Systems, DSS concept and philosophy, DSS: Deterministic systems, AI systems , Knowledge Based Expert
System (KBES), MIS and role of DSS, 9. DBMS ,Concept of RDBMS 10. Enterprise Management System, EMS, ERP (Basic
features), Benefits of ERP, ERP selection, ERP implementation, EMS & MIS, 11. Business Process Re-Engineering,
Introduction, Business process, Process model of organization, Value stream model of organization, MIS & BPR
REFERENCES : 1. Management Information Systems -W.S. Jawadekar 2. Management Information Systems- Jerome
Kanter
CSC1814 : DISTRIBUTED SYSTEMS
Theory : 4 Lectures Marks(Theory) : 100
PAGE # 15
Tutorial : 0 Marks(Pr/Tw/Viva) : 50
Practicals : 2 Hrs. Total : 150
Prerequisites : Operating Systems
Objectives:The Distributed Operating Systems course is intended to teach students the basic issues involved in design of
different components of distributed operating system and familiarize them with a case study of such an operating system. 1.
General Introduction to Distributed Systems : Hardware and Software concepts, Issues in design of a Distributed Operating
Systems. 2. Synchronization in Distributed Systems : Considering clocks, Mutual Exclusion, Atomic transaction, Deadlocks in
distributed systems. 3. Communication in distributed systems : Covering layered protocols, ATM Networks, Client Server
Models and Remote Procedure Calls. 4. Processes and Processors in distributed ystems : Processor allocation, Threads,
Scheduling, fault tolerance and real time distributed systems. 5. Distributed File Systems : design and implementation. 6.
Distributed Shared Memory : Consistency Models, Page - based, object based shared memories. 7. Case Studies on a distributed
system.
REFERENCES : 1. Distributed Operating Systems: Andrew S. Tanenbaum 2. Distributed System Concepts & Design : Colouris
CSC1815 : UNIX/LINUX PROGRAMMING AND ADMINISTRATION
Theory : 4 Lectures Marks(Theory) : 100
Tutorial : 0 Marks(Pr/Tw/Viva) : 50
Practicals : 2 Hrs. Total : 150
Prerequisites : Computer Networks, C or Java Programming Language
Prerequisites : 1. Computer Organisation 2. Microprocessors 3. Systems Programming 4. Operating Systems
Objectives : The course assumes students to have reasonably good knowledge of working of Unix/Linux Operating
system, a Case Study & its Administration. Students should be able to appreciate various concepts of operating systems and
their implementations in Unix/Linux and evaluate critically their suitably in a given environment. They may also work on the
projects for development modules of an operating system. 1History, Evolution 2 Design Principles 3 Kernel Architecture,
Modules of the Kernel 4Resource Management a)Process Management : i) Single user/tasking/threaded ii)Multi
user/tasking/threaded a) Scheduling , Inteprocess Communication & Synchronization b) Physical & Virtual Memory
Management c) File Systems Management d) Input/Output Management 4) Network Structure 5) Security a) Access Privileges
b) Firewall Setup 6) User & Profile Management 7) Users/Programmers Interface a) X-Windows Setup/X-org b) Differences
between GNome & KDE 8) Unix/Linux Commands 9) vi/vim editor 10) Shell & Shell Scripting 11) Types of Servers & Server
Setup in Linux a) File/FTP Server b) Networ k Server c) Mail Server d) Web Server e) Samba Server e) Telnet Server 12)
Installation, Setup & Configuration Comparisions of various Distributions a) RHEL/ Fedora b) SUSE c)
Ubuntu/VMWare/Virtual Box
REFERENCES : 1.Operating Systems : Madnick & Donovan 2.Operating Systems Principles:Hansen Per Brinch 3.Design of
UNIX Operating Systems: Bach M. 4.Operating Systems Principles:Milan Milenkovic 5.Operating Systems Design &
Implementation : Andrew S. Tanenbaum 6. Operating System Concepts & Design : William Stallings, Unix : Sumitabha Das
CSC1816 : SOFTWARE ENGINEERING
Theory : 4 Lectures Marks(Theory) : 100
Tutorial : 0 Marks(Pr/Tw/Viva) : 50
Practicals : 2 Hrs. Total : 150
Prerequisites : Analysis and Design of Information Systems
Objectives : This course has a major objective of introducing students to the essential aspects of Software Engineering methods
to ensure good quality software products as a part of system development project. 1. Introduction to Software Engineering : the
software as product and a process, software process models 2. Software Requirements Definition : the software requirements
documentation, System context, Requirements Definition & Evolution. 3. Software Design : the design process, Design
strategies and Design quality. 4. Software Validation and Verification : the testing process, test planning, testing strategies,
implementation. 5. Software Management : the management activities Configuration management, Versioning, Software
management structures, programmer productivity. 6. Software Quality Assurance : Process quality assurance, software
standards, quality reviews, software metrics. 7. Case Tools
REFERENCES 1. Software Engineering- Ian Sommerville 2. Software Engineering - A practitioners approach - Roger
S.Pressman
CSC1802 : ELECTIVE - II
CSC1821 : COMPUTER FAULT DIAGNOSIS AND SERVICING
Theory : 4 Lectures Marks(Theory) : 100
Tutorial : 0 Marks(Pr/Tw/Viva) : 50
Practicals : 2 Hrs. Total : 150
Prerequisites : 1.Computer Architecture 2.Microprocessors 3.Advanced Microprocessors
Objectives:Students must have good knowledge of the logical and physical working of the computer system. Understand the
maintenance of the Pentium motherboard and the interfacing of cards and peripherals to the motherboard. To study the Network
and software maintenance of the Pentium processor. Students will gain an experience in diagnosis of different types of faults that
can occur in the system and the rectification of the same.
1.Introduction to Computers their configurations like speed, motherboard, CPU, etc. 2.Microprocessors in PC P I, P III,
Celeron, Duron, Athalon, P IV, differences in the socket styles, data & address buss size, speeds, cache size(L1/L2)
3.Microprocessor support chipsets on motherboard and their differences 4.Different types of memories like EDO, SDRam,
DDRam, RDRam etc., their frpmt sode Bus speeds (FSBS) 5.Interrupts, DMS & I/O mappings, Data transfer techniques used by
various peripherals like keyboard, FDD, HDD, printer,etc. 6.Various types of I/O slots like ISA, PCI, AGP, AMR and their
difference. Motherboard form factor AT & ATX server (dual processor) specifications, upgradability with future processors and
memories. 7.CMOS setup configuration Standard, Advanced, Power Management, peripheral CMOS setups 8.Various types of
I/O converters & cables in PC like serial, parallel , USB, modem, network, InfraRed devices. 9.Harddisk partitioning, EIDE/SCSI
for various OS installations like Windows, Unix/Linux 10.Installations of Addon cards like AGP, Network, Modem, Sound cards
PAGE # 16
and configurations under Windows 11.Introduction to trouble shooting techniques, different types of faults solid, intermittent
hardware & software faults 12.Systematic trouble shooting approach by systems observations symptoms analysis fault diagnosis
& rectification documentation for future references 13.Using diagnostic tools & test equipments like DMM, logic probe,
oscilloscope 14.Diagnostic Software like AMIDIAG, MSD 15.Power On Self Test sequences & emr beeps 16.Study of AT &
ATX SMPS and output voltages , peripherals like mouse, FDD, HDD, printer, keyboard interfacing and their faults and
servicing/precautions , Network related fualts. 17.Faults due to electrostatic, magnetic & environmental effects 18.Power
conditioners like spike suppressors, CVT , line conditioners, UPS and their capacities, which to use & where 19.Viruses and
Virus scanners, how they affect and can be avoided 20.Computer Room preparation and layout for multi-user system.
REFERENCES : 1. IBM PC & Clones (2nd Edition) : B. Govindrajalu (TMH) 2. Trouble shooting Maintaining and Repairing
PCs(5th Edition) : Bigelaws (Tata Mcgraw Hill) 3. Upgrading & Repairing PCs (BPB) (2003 Edition) : Mark Minasi 4.
Upgrading & Repairing PCs (13th Edition) : Scott Muelkar 5. Inside th ePC (8th Edition):Peter Norton6. PC Hardware for
Begineers Guide : ROM GILSTAR(TMG)
CSC1822 : OPERATION RESEARCH
Theory : 4 Lectures Marks(Theory) : 100
Tutorial : 0 Marks(Pr/Tw/Viva) : 50
Practicals : 2 Hrs. Total : 150
Prerequisites : Analysis and Design of Information Systems, Engg. Economics
Objectives:The students are required to have knowledge of how application systems are designed and developed. This course will
enable the students to learn the techniques to perform:- Cost - Benefit Analysis : Evaluation and Optimization Software
Optimization Project Scheduling
1.Models as abstraction of real world ,types and classification ; model building course vs. fine grain building of models.
2.Applications to computing ,economic,electronic,environmental, industrial, organizational ,service and telecommunication
areas. 3.Elements of algorithms and complexity performance criteria,heuristics. 4.Graphs & Flows : shortest path, spanning
trees, minimal cost flows, probabilistic networks, CPM/PERT, integrality of solutions.
REFERENCES : 1. Operations Research - Kanti Swaroop, Manmohan & Gupta
CSC1823 : ADVANCED TECHNOLOGIES IN DATABASES
Theory : 4 Lectures Marks(Theory) : 100
Tutorial : 0 Marks(Pr/Tw/Viva) : 50
Practicals : 2 Hrs. Total : 150
Prerequisities : Relational Database Management System
Objectives : This course will deal with the advanced topics / techniques of a database management system. The main aim is to
study the concepts of Data Warehousing and Data Mining. Comparisions between the working of different database products like
ORACLE, DB2, etc. will be covered. After studying this course students will be able to design a Data Warehouse as per the
given requirements. 1. The following topics shall be covered with respect to the currently popular databases like ORACLE,
DB2, SYBASE, etc. with a view to illustrate availability of various features and facilities with these RDBMSs in consideration to
following topics :Database Systems using DB2 UDB EE and ORACLE, Database Architecture, Security, Authorization, Access
granting and revoking, Transaction Processing, Concurrency and Locking, Backup and Recovery, 2. Data Warehousing, 3.
Characteristics , 4. Data Marts, Types, Loading, Meta Data, Data Model, Maintenance and Nature of Data, Software
Components, Tables, External Data, Reference Data, Performance Issues, Monitoring Requirements & Security, 5. Online
Analytical, Processing, OLTP and OLAP systems, Data Modelling, OLAP tools 6. Data Mining, Introduction, Algorithms,
Database Segmentation, Predictive Modelling, Link Analysis, 7. Tools for Data Mining, 8. Developing a Data Warehouse , 9.
Applications of Data Warehousing and Data Mining (Case Studies)
REFERENCES: 1.Books by Oracle Press 2.DB2 Books (Online) 3.Data Warehousing : C.S.R. Prabhu
CSC1824 : ADVANCED COMPUTER GRAPHICS AND MULTIMEDIA
Theory : 4 Lectures Marks(Theory) : 100
Tutorial : 0 Marks(Pr/Tw/Viva) : 50
Practicals : 2 Hrs. Total : 150
Prerequisites : Computer Graphics, Structured Programming Languages, Data Structures, Engineering
Mathematics
Objectives:This course will provide the students with the knowledge for Computer Animation and Computer Modelling.
1.Structures and Hierarchical Models, Structure concepts, Editing structures, Basic Modelling, Hierarchical Modelling
2.Interactive input methods, Input of graphical data, Input functions, Interactive picture construction, 3.Three dimensional
concepts, Three dimensional display methods, Three dimensional graphics, 4.Three dimensional object representations, Polygon
surfaces, Curved lines and curved surfaces, Quadric surfaces, Super quadrics, Spline representations, Cubic spline interpolations,
Bezier curves and surfaces, Bspline curves and surfaces, Beta splines, Rational splines, Conversion between spline
representations, Displaying spline curves and surfaces, Constructive solid geometry, Fractal geometry models, Particle systems,
Visualization of data sets 5.Three dimensional geometric and modelling transformations, Translation, otation, Scaling,
Reflections, Sheer, Composite transformations , 3D transformation functions, Modelling and coordinate transformations 6.3D
Viewing, Viewing pipeline, Viewing coordinates, Projections, View volumes and general projection transformations, Clipping 7.
Visible surface detection techniques 8.Illumination models and surface rendering methods, Light sources, Basic
illumination models, Displaying light intensities, Half tone patters and dithering techniques,Polygon rendering techniques,
Radiosity lighting model, Adding surface detail 9. ComputerAnimation, General computer animation functions, Raster
animation, Computer animation languages, Key frame systems, Motion specifications
REFERENCES: 1.Computer Graphics : Donald Hearn, M. Pauline Baker 2.The OpenGL Programming Bible
CSC1825 : MOBILE COMPUTING
Theory : 4 Lectures Marks(Theory) : 100
Tutorial : 0 Marks(Pr/Tw/Viva) : 50
Practicals : 2 Hrs. Total : 150
Prerequisites : Computer Networks
PAGE # 17
Objectives:The Mobile Computing course is intended to teach students the issues involved in wireless technology.
1.Broadband Wide Area Networking; SDH, Frame Relay and ATM 2 Cell Relay and ATM Internetworking 3 Distributed
Computing and The NFS 4 The Next Generation Protocols 5 Transition to Next Generation Protocols 6 Quality of Service and
Real-Time Application Issues 7 Multicast 8 Voice Over IP 9 TDMA and CDMA; Features Compared and Contrasted 10 Mobile
IP; Concepts and Issues 11 Wireless Application Protocol 12 Partial Mobility with Wireless Local Loops Practical and Term
work : The practical and Term work will be based on the topics covered in the syllabus. Minimum 5 experiments should be
carried out.
Reference: 1.Internetworking with ISDN, Frame Relay & ATM -By William Stallings 2.ATM - protocols, applications and
standards-By Hueber et al 3.Internetworking with TCP/IP : volume 1 & 3-By Douglas Comer 4.Computer Networks-By A.
Tanenbaum 5.Unix Network Programming - 1 & 2 -By Richard Stevens 6. WAP Specifications www.wapforum.org
Various RFCs, Technical Journals, Papers & Internet Drafts
CSC1826 : WEB TECHNOLOGY
Theory : 4 Lectures Marks(Theory) : 100
Tutorial : 0 Marks(Pr/Tw/Viva) : 50
Practicals : 2 Hrs. Total : 150
Prerequisites : Computer Networks
Objectives : Enables student to develop web based applications
1. Introduction to Networking. 2.Introduction to TCP/IP 3.Introduction to Electronic Commerce 4.Introduction to Web
Technology 5. Dynamic Web Pages 6. Active Web Pages 7. User Sessions in E-commerce Applications 8. Electronic Commerce
Transaction Management 9. Electronic Commerce Security Issues 10. Online Security and Payment Processing Mechanisms 11.
Middleware and Component - based E-commerce Architectures 12. Electronic Data Interchange (EDI) 13. Extensible Markup
Language (XML) 14.Wireless Application Protocol (WAP)15. Case Studies : Building Web commerce site, and Using Public
Key Infrastructure (PKI) to provide security to Web applications.
REFERENCES : 1. Web Technologies - Achyut S Godbole, Atul Kahate
CSC1827 : GEOGRAPHICAL INFORMATION SYSTEM
Theory : 4 Lectures Marks(Theory) : 100
Tutorial : 0 Marks(Pr/Tw/Viva) : 50
Practicals : 2 Hrs. Total : 150
Prerequisites : C programming, Data Structures, Database Management Systems, Computer Graphics
Objective : A Geographical Information System is a computer based system that allows to study natural and man-made
phenomena with an explicit bearing in space. After studying this subject the students will be able to enter data, manipulate the
data and produce interpretable output. 1) An Introduction to GIS 2) Geographic Information and Spatial Data Types 3) Data
Processing Systems 4) Data Entry and Preparation 5) Spatial Data Analysis 6) Data Visualization 7) Data Quality and Meta Data
REFERENCES: 1. Principals of Geographic Systems by Rolf A de
CSC1828 : SIMULATION & MODELLING
Theory : 4 Lectures Marks(Theory) : 100
Tutorial : 0 Marks(Pr/Tw/Viva) : 50
Practicals : 2 Hrs. Total : 150
Prerequisites : Programming Languages
Objectives: Students will have the knowledge to simulate various real life systems.
1.System models and concept of states 2 System studies3 System simulation 4 Continuous system simulation 5 Arrival patterns
& service times 6 Discrete system simulation 7 Some popular Simulaion Languages 8 Simulation implementation
PAGE # 18
and some practical experience in defending network systems. 1) Introduction to Computer Network & Security 2) Security
Concepts & Terminologies 3) Cryptography Symmetric Key Cryptography and Public Key Cryptography 4) Message Digests,
Digital Signatures, Authentication Systems 5) Network Security Applications, - Electronic Mail Security, -IP Security, -Web
Security, -Network Management Security, -E-Commerce Security 6) Hacking & System Security Intruders, Viruses, Malicious
Software, Firewalls, VPN, etc., 7) Intrusion Detection Systems
REFERENCES: 1. Network Security Essentials By William Stallings (PHI)
CSC1808 : PROJECT
(6T/P, 100P/TW/VIVA)
Prerequisites: The subjects that teach:- 1. Programming Methodologies 2. Programming languages 3. Front End Tools 4.
Back End Tools 5. Analysis & Design of Information Systems
Objectives:This final year projects aims to expose students to real life situations and thus equip them with practical knowledge.
On completion of this, students will have an understanding of project development cycle and thus will be in a position to take up
projects in an organization independently.
PAGE # 19