SYLLABUS FOR B.SC. COMPUTER SCIENCE HONOURS (1ST YEAR) Sc.pdf · SYLLABUS FOR B.SC. COMPUTER...

MIDNAPORE COLLEGE (AUTONOMOUS) DEPT. OF COMPUTER SCIENCE AND APPLICATION

1

SYLLABUS FOR B.SC. COMPUTER SCIENCE HONOURS (1ST YEAR)

SEMESTER-I (100 MARKS- 50 Theory +50 Practical) ,

Course Code Paper Marks

Distribution CIA F.M

PAPER-I M1: Computer Fundamentals 25

10 50 M2: C programming

M3: Basic Electronics 15

PAPER-II L1: Programming Lab using C 20 5 50

L2: BASIC electronics lab 20 5

SEMESTER-II (150 MARKS- 100Theory +50 Practical)



PAPER-III

M1: Digital Electronics 25

10 50 M2: Discrete Mathematical

structure 15

PAPER-IV M1:Analysis of Algorithm

M2:Data Structure

15

25 10 50

PAPER-V L1: Data Structure lab using C

L2: Digital Electronics Lab 20 5

50 20 5

SYLLABUS FOR B.SC. COMPUTER SCIENCE HONOURS (2ND YEAR)

SEMESTER-III (150 MARKS-100 Theory +50 Practical)



PAPER-VI M1: Operating System 20

10 50 M2: Computer Organization and

Architecture

20

PAPER-VII M1:OOP using C++ 25 10 50

M2: Numerical Methods 15

PAPER-VIII L1: Programming Lab using C++ 15 5

50 L2: Shell Programming using Unix

& Numerical Analysis using C

10

15

5


2

SEMESTER-IV (150 MARKS-100 Theory +50 Practical)



PAPER-IX M1: Data communication and

Networking

25

10

50

M2: Introduction to computer

Graphics

15

PAPER-X MI: Microprocessor

M2: Microcontroller

10

30 10

50

PAPER-XI L1: Microprocessor &

Microcontroller Lab

20 5

50

L2: Graphics Lab 20 5

SYLLABUS FOR B.SC. COMPUTER SCIENCE HONOURS (3RD YEAR)

SEMESTER-V (150 MARKS- 100 Theory +50 Practical)



PAPER-XII M1: Database Management

System

25

10

50

M2: Software Engineering 15

PAPER-XIII M1: Compiler Design

M2: Automata Theory

25

15 10

50

PAPER-XIV L1: DBMS Lab 15

10

50

L2:Compiler Design Using LEX 15

L3: Seminar 10

SEMESTER-VI (100 MARKS- 50 Theory +50 Practical)



PAPER-XV M1: Elective 25 5 50

M2: Webpage Design Technology 15 5

PAPER-XVI L1: Webpage Design Lab 15 5 50

L2: Project 25 5

TOTAL: THEORY=500 MARKS

PRACTICAL=300 MARKS


3

COURSE DETAILS

SEMESTER-I

PAPER- I/COSH-101

M1: COMPUTER FUNDAMENTAL (5 MARKS)::

UNIT-I

Hardware: CPU, Primary and Secondary storage, I/O devices, Bus structure, Computer Peripherals, VDU, Keyboard, Mouse, Printer.

Evolution of Computers and Computer Generations, Computer Classification Software: System and Application. Different types of

System Software. Programming Languages: Machine Language, Assembly Language, High Level Language, Object Oriented

Language.

UNIT-II

Problem solving: Computers and problem solving, Algorithms, Types of Algorithms, Flow Chart,

Problem solving and programming using principles of top down modular design, Abstraction mechanisms, Step wise refinement,

UNIT-III

Number systems and Codes: Number representation: Weighted codes, Non-weighted codes, Positional, Binary,

Octal, Hexadecimal, Binary Coded Decimal (BCD), Conversion of bases .Complement notations, Binary Arithmetic: addition,

subtraction, multiplication & division. Alphanumeric, ASCII, EBCDIC, Single Error Detecting and Correcting Codes, Hamming

Codes.

PAPER- I/ COSH-101

M2: PROGRAMMING LANGUAGE USING C (20 MARKS)::

UNIT- I

Overview of C: History of C, Importance of C, Basic structure of C Programming style, Constant, Variables and Data types,

declaration of variables, storage class, defining symbolic constants, declaring a variable as constant, volatile, overflow and underflow

of data. Operator and expressions: arithmetic, relational, logical, assignment operators ,increment and decrement operators,

conditional operators, bitwise operators, special operators, arithmetic expression, evaluation of expressions, precedence of

arithmetic operators , type conversions in expression ,operator precedence and associativity ,mathematical functions , managing

I/O Operations: reading and writing a character ,formatted input, output.

UNIT- II

Decision making and branching: if statement, if… else statement ,nesting of if….else statement, Else if ladder, Switch

statement, the?: Operator, Goto statement. The While statement, Do and Do-While statement, For statement, jumps in loops.

UNIT -III

Arrays: One dimensional array, declaration, initialization, two dimensional array, multi- dimensional array, initialization. Strings:

declaration, initialization of string variables ,reading and writing string, arithmetic operations on strings ,putting strings together ,

comparison , sting handling function ,table of string ,features of string.

UNIT -IV

User defined functions: need, multi-function program , elements of user defined functions ,definition, return values and their types,

function calls, declaration, category of all types of arguments and return values ,nesting of functions , recursion , passing arrays

, strings to functions , scope visibility and life time of variables , multi file programs. Structure and unions: defining a

structure , declaring structure variables ,accessing structure members , initialization , copying and comparing , operations on

individual members , arrays of structures , arrays within structures , structure within structures, structures and functions, Unions,

size of structures, bit fields.

UNIT- V

Pointers: accessing the address of variable ,declaring, initialization of pointer variable ,accessing a variable through its pointer,

chain of pointers, pointer expressions, pointer increment and scale factors, pointer and arrays, pointers and character strings, array of

pointers , pointers as function arguments , function returning pointers ,pointers to functions, pointers and structures.

UNIT-VI

Files: defining opening, closing a file. I/O Operation on files , error handling during I/O Operations , random access to file ,

command line arguments.

Suggested Readings:

.

1. B.W. Kernighan and D.M.Ritchie, the C Programming Language, PHI.

2. B.S. Gottfried, Schaum's Outline of Theory and Problems of Programming with C, McGraw,Hill.

3. H. Schildt, C Made Easy, Osborne McGraw,Hill.

4. Y. Kanetkar, Let Us C, BPB Publications.

5. Balagurusami, ANSII C, McGraw,Hill.


4

PAPER- I/ COSH-101

M3: BASIC ELECTRONICS (15 MARKS)::

UNIT-I

Physics of Semiconductor Devices: Conductivity, mobility, carrier lifetime, Fermi level, effective mass, classification of

semiconductors, effects of temperature.

UNIT-II

PN junction: Structure, operations and V-I characteristics built-in potential, forward and reverse biasing, junction capacitance,

drift and diffusion currents, different types of breakdown, Avalanche breakdown and Zener breakdown .Application of diode as

rectifier ( half wave, full wave & bridge rectifier ), Application of Zener Diode as voltage regulator .Simple problems.

UNIT-III

Bipolar Junction Transistors (BJTs): Structures, mode of operation, characteristics of Transistor in different modes, Biasing of a

transistor: Q point, load line, Self-bias, fixed-bias & collector to base bias. Simple problems.

Transistor as an Amplifiers: Classifications, Concepts of Class A & B, concept of Push-Pull amplifier.

UNIT-IV

Field Effect Transistors (FETs): Structures of JFET and MOSFET, V-I characteristics, equivalent circuits.

UNIT-V

Operational Amplifiers (Op-Amp): Diff-Amp, Basic building block, Characteristics of Op-amp, Equivalent circuit, modes of

operation as Inverting and non-Inverting amplifier, Applications of Op-amp. Simple problems.

UNIT-VI

Multivibrator circuits: Mono stable, Bi-stable and Astable and their applications.

Power Supply : Basic building block of a power supply, Regulated fixed and variable voltage supply.

Suggested Readings:

1. Boylstad & Neshishkey, “Electronic devices & circuits” , PHI

2. Milliman, J. Halkias, “integrated elctronics”, TMH

3. Streetman, B.G. & Banerjee, Sanjay / “Solid State Electronic Devices” / Prentice Hall (India) / 5th Ed

Pearson Education.

4. Bell, David A. / “Electronic Devices & Circuits”/ Prentice-Hall (India), 4th Ed.

5. Salivahanan, S. & Kumar, Suresh N. & Vallavraj / “Electronic Devices & Circuits” / Tata McGraw-

6. Hill.

7. Schaum’s Outlines / “Electronic Devices & Circuits”/ Tata McGraw Hill, 2nd Ed.


5

PAPER-II / COSH-102

L1: PROGRAMMING LAB USING C (20 MARKS)::

This practical paper will consist of programming exercises based on paper I-M2:Programming Language Using C

PAPER- I/ COSH-101

M2: PROGRAMMING LANGUAGE USING C (20 MARKS)::

UNIT- I

Overview of C: History of C, Importance of C, Basic structure of C Programming style, Constant, Variables and Data types,

declaration of variables, storage class, defining symbolic constants, declaring a variable as constant, volatile, overflow and underflow

of data. Operator and expressions: arithmetic, relational, logical, assignment operators ,increment and decrement operators,

conditional operators, bitwise operators, special operators, arithmetic expression, evaluation of expressions, precedence of

arithmetic operators , type conversions in expression ,operator precedence and associativity ,mathematical functions , managing

I/O Operations: reading and writing a character ,formatted input, output.

UNIT- II

Decision making and branching: if statement, if… else statement ,nesting of if….else statement, Else if ladder, Switch

statement, the?: Operator, Goto statement. The While statement, Do and Do-While statement, For statement, jumps in loops.

UNIT -III

Arrays: One dimensional array, declaration, initialization, two dimensional array, multi- dimensional array, initialization. Strings:

declaration, initialization of string variables ,reading and writing string, arithmetic operations on strings ,putting strings together ,

comparison , sting handling function ,table of string ,features of string.

UNIT -IV

User defined functions: need, multi-function program , elements of user defined functions ,definition, return values and their types,

function calls, declaration, category of all types of arguments and return values ,nesting of functions , recursion , passing arrays

, strings to functions , scope visibility and life time of variables , multi file programs. Structure and unions: defining a

structure , declaring structure variables ,accessing structure members , initialization , copying and comparing , operations on

individual members , arrays of structures , arrays within structures , structure within structures, structures and functions, Unions,

size of structures, bit fields.

UNIT- V

Pointers: accessing the address of variable ,declaring, initialization of pointer variable ,accessing a variable through its pointer,

chain of pointers, pointer expressions, pointer increment and scale factors, pointer and arrays, pointers and character strings, array of

pointers , pointers as function arguments , function returning pointers ,pointers to functions, pointers and structures.

UNIT-VI

Files: defining opening, closing a file. I/O Operation on files , error handling during I/O Operations , random access to file ,

command line arguments.

PAPER-II / COSH-102

L2: BASIC ELECTRONIC LAB (20 MARKS)::

This practical paper will consist of following experiments :

1. V-I characteristics of P-N jn. Diode

2. Reverse bias characteristics of Zener diode.

3. Voltage regulation using Zener diode, line and load regulation.

4. Rectifier circuits, finding of ripple factor, efficiency. Observation of curve using CRO.

5. Regulated power supply design, finding % Regulation.

6. Input & Output Ch. Of Transistor in CB, CE, mode.

7. Astable Multivibrator using IC-555. Finding Duty Cycle, Frequency. Observation using CRO.

8. Op-amp: inverting and non-inverting amplifier, adder, subtractor, integrator, differentiator, comparator.


6

SEMESTER-II: PAPER: III

MI: DIGITAL ELECTRONICS (25 MARKS)::

UNIT-I

Boolean algebra: , Laws and Theorems. AND, OR, NOT Laws, Commutative law, associative law, distributive law, Duality theorem.

Demorgan’s theorems, Statements, proof using truth tables; Simplification of Boolean expressions using Boolean laws. Definition of

product term, sum term, minterm , maxterm, SOP, standard SOP, POS and Standard POS. Conversion of Boolean expression to

Standard SOP and Standard POS forms. Karnaugh maps, Definition of Karnaugh map, Conversion of truth tables into K-map,

grouping of cells, redundant groups and don’t care conditions. Karnaugh map technique to solve 3 variable and 4 variable expressions.

Simplification of 3 and 4 variable Boolean expression using K-maps (SOP & POS ).

UNIT-II

Combinational logic circuits: Half Adder: Symbol, Logic circuits using XOR and basic gates, Truth table. Full Adder: Symbol, Logic

circuits using XOR and basic gates, Truth table. Half Subtractor: Symbol, Logic circuits using XOR and basic gates, Truth table. Full

Subtractor : Symbol, Logic circuits using XOR and basic gates, Truth Table. Parallel Adder: 4-bit, parallel binary adder, Comparators,

Decoders, Encoder, Code Converters, Data selectors/multiplexer, De-multiplexer, Seven segment display unit.

UNIT-III

Sequential circuits: Flip-Flop, difference between latch and Flip-Flop, level and edge triggering. RS latch, symbol and truth table. RS

Flip-Flop using NAND gate. D Flip-Flop , RS Flip-Flop as a D Flip-Flop. JK Flip-Flop, Realization of JK Flip-Flop using NAND

gates. Race around condition, preset and clear inputs. T Flip-Flop, JK flip flop as a T Flip-Flop. JK Master slave flip flop: Logic

circuit, block diagram, advantage of M/S Flip-Flop. Conversion of Flip-Flops.

Registers: Definition, types of registers , Serial in serial out, Serial in parallel out, Parallel in serial out, Parallel in parallel out shift

register (Block diagram representation for each), truth table,

Counters: Definition, types of counters: synchronous and asynchronous, ring counter, modulo counters, truth table, timing diagram.

UNIT-IV

D/A and A/D converters: R-2R ladder, Successive approximation, Counter method.

Suggested Readings:

1. . M. M. Mano, Digital Logic and Computer Design, PHI.

2. . M.M.Mano, Computer System Architecture, PHI..

3. . Malvino, Leach, Digital Principles and Applications, McGraw,Hill.

4. . V. Rajaraman, T. Radhakrishnan, An Introduction to Digital Computer Design, PHI,2006.

5. . Thomas C. Bartee, Digital Computer Fundamentals, McGraw,Hill.

6. . B. Streetman, Integrated Digital Circuits, PHI

7. S. Shalibahanan S.Arivazhagan, Digital circuit and design, Vikas

M2: DISCRETE MATHEMATICAL STRUCTURE(15 MARKS)::

UNIT-I

Logic : Fundamentals of Logic, Logical Interfaces, Methods of proof of an implication, First Logic and other methods of proofs,

Rules of Interfaces for quantified propositions.

UNIT-II

Relations and Digraphs : Sets, Operation on Sets, Relations and Diagraphs, Special properties of Binary relations, Equivalence

relations, Ordering relations, Operations on relations, Paths and closures, Directed graphs and adjacency matrices.

UNIT-III

Elementary Combinatory: Basics of counting, The principles of inclusion and exclusion. Recurrence relations, Generating functions.

UNIT-IV

Graphs : Basic concepts, Isomorphism and sub graphs, Trees and their properties, Spanning Trees, Directed Trees, Binary Trees,

Planar Graphs, Euler’s Formula, Multi graphs and Euler graphs, Hamiltonian graphs.

Suggested Readings:

1. J.P. Trembley and R.P.Manohar, Discrete Mathematical Structures with Applications to Computer Science, McGraw Hill. .

2. N. Deo, Graph Theory with Applications to Engineering and Computer Science, PHI.

3. R. Johnsonbaugh, Discrete Mathematics, Pearson Education, 2001.

4. C.L. Liu, Elements of Discrete Mathematics, McGraw,Hill.

5. Lipschutz, Lipson, Discrete Mathematics, SCHAUM’S Outline Series.


7

PAPER-IV

M1: ALGORITHM ANALYSIS (15 MARKS)

UNIT I:

Algorithms, Importance Of Developing Efficient Algorithms, Asymptotic Notation, Analysis, Order, Divide And Conquer: Binomial

Coefficients, Floyds Algorithm For Shortest Paths, Dynamic Programming And Optimization Problems, Chained Matrix

Multiplication, Optimal Binary Search Tree.

UNIT II:

Greedy Approach: Minimum Spanning Trees, Dijkstra’s Algorithm for Single Source Shortest Path, Scheduling, Huffman Code.

UNIT III:

Graphs - Introduction To Graphs, Basic Terminology, Directed, Undirected & Weighted Graph, Representation Of Graphs, Shortest

Path, Graph Traversals-Depth First & Breadth First Search. Spanning Trees, Minimum Spanning Tree, The Basic Greedy Strategy For

Computing Algorithm Of Kruskal, And Prims, Applications Of Graphs : Shortest Path And Longest Path Problems., Complexity With

Big’o’ Notation.

M2: DATA STRUCTURE (25 MARKS)

UNIT-I

Introduction To Data Structures, Abstract Data Types Stacks - Introduction To Stack & Primitive Operation On Stack, Stack As An

Abstract Data Type, Stack’s Applications - Infix, Post Fix & Prefix Expressions, Recursion, Multiple Stacks ,Queues -Introduction To

Queues, Primitive Operations On The Queues ,Queue As An Abstract Data Type, Circular Queue, Dequeue, Priority Queue.

UNIT-II

Linked List - Introduction To The Linked List, Memory Representation Of Linked List, Operation On Linked List, Linked List

Representation Of Stack And Queue, Header Nodes. Types of Linked Lists: Doubly Linked List, Circular Linked List, Application

Of Linked List.

UNIT-III

Trees- Basic Terminology of Trees ,Binary Trees ,Binary Tree Representations as Array & Linked List. Traversal Of Binary Trees -

In Order, Pre-Order & Post Order, B-Tree, AVL Tree.

UNIT-IV

Searching - Sequential Searching, Binary Search

UNIT-V

Sorting - External & Internal Sorting, Insertion Sort, Selection Sort, Quick Sort, Bubble Sort, Heap Sort, Merge Sort, Comparison Of

Sorting Methods Algorithms Of Sorting And Searching In Linked List And Arrays. Hashing Technique with Application.

Suggested Readings:

1. M. Tennenbaum, Y. Langsam and M. J. Augenstein, Data Structures using C, PHI..

2. S. Lipschutz, Data Structure, Schaum’s Oiutline Series.

3. D. E. Knuth, Fundamental Algorithms, Narosa Publication. .

4. Sahni S, data Structures, Algorithms and Applications in C, Mc Graw, Hill.

5. Sahni, design and analysis of Algorithm, TMH

6. Classic Data Structure, D. Samanta,PHI

PAPER- V

L1: DIGITAL ELECTRONICS LAB (20 MARKS)::

Assignments:

1. Verification of truth table of different GATES

2. Construction of BASIC gates using UNIVERSAL gates

3. Combinational logic design :

a. Half adder/subtractor, Full adder /subtractor, Parallel adder(using IC-7483)

b. BCD adder

c. Code converter: Binary to Grey and Grey to Binary

d. Design of 8:3En-coder and 3:8 Decoder . Verification of IC 74138, 74139.

e. Design of 3:8 Decoder using 2:4 decoder using IC 74138

f. Design of full adder/subtractor using IC 74138, IC 74139

g. Design of 8:1 MUX. Verification of IC 74151, and 74153.

h. Design of full adder/ subtractor using IC 74151, 74153

i. Design of BCD to 7-segment Decoder using IC 7447

4. Sequential logic design:

a. Design of RS, D, JK M/S,T FF using NAND gate

b. Design of 4 bit ripple Counter.

c. Design of Asynchronous MOD Counters.

d. Design of shift registers(SISO,PISO,PIPO,SIPO)

L2: DATA STRUCTURE LAB USING C (20 MARKS)::

This practical paper will consist of programming exercises based on course M2: Data Structure


8

SEMESTER-III:

PAPER-VI /COSH-301

MI:OPERATING SYSTEM (20 MARKS)::

UNIT-I

Introduction: Evolution of Operating System ,Types of operating system, Basic concept of Multiprogramming , Operating System

Structures, Components & Services.

UNIT-II

Process Management: Process Concept, PCB, Threads, Inter process communication, CPU Scheduling Criteria, Scheduling

algorithms, Types of Schedulers.

UNIT-III

Process Synchronization and deadlocks: Needs for Synchronization, The Critical Section Problem, Mutual Exclusion, Semaphores,

Dead locks, Dead lock prevention, Avoidance and Detection, Recovery from Dead lock.

UNIT-IV

Memory Management: Contiguous Allocation:- Partitioned Memory Allocation: Static & Dynamic, Swapping, Relocation,

Compaction, Segmentation. Non-contiguous Allocation: - Paging, Virtual memory, Demand paging and it’s performance, Page

replacement algorithms, Allocation of frames, Segmentation with paging, Thrashing.

UNIT-V

File management: File Concepts, Access methods, Directory Structure, Disk Space Management: contiguous & Non-contiguous

allocation, Allocation methods, Free space management, Directory Implementation.

Suggested Readings:

1. Abraham Silberschatz and peter Baer Galvin, Operating System Concepts, Fifth Edition,

2. Nutt: Operating Systems, 3/e Pearson Education 2004

3. Milan Milonkovic, Operating System Concepts and design, II nd Edition, McGraw Hill 1992.

4. William Stalling, Operating Systems: Internals and Design Principles 5/ed, PHI

5. John J. Donovan , System Programming, TATA McGraw,Hil.

COSH-301

M2: COMPUTER ORGANIZATION AND ARCHITECTURE (20 MARKS)::

UNIT-I:

Introduction to Computers: Basic of Computer, Von Neumann Architecture, Classification of Computers, I/O system organization

and interfacing, Bus Arbitration , Bus contention.

UNIT-II

Register Transfer and Micro operations: Computer Registers, Register Transfer, Bus and Memory Transfers, Multiple register

transfer in a common Bus, Tri-State Buffers, Micro Operations: Register Transfer Micro-Operations, Arithmetic Micro-Operations,

Logic Micro-Operations, Shift Micro-Operations.

UNIT-III

Computer Arithmetic: Addition and Subtraction with Signed-Magnitude, Booth Multiplication and Division Algorithm.

UNIT-IV

Central Progressing Unit (CPU): General Register organisation, Stack Organization, Instruction Formats, Three- Address Instructions,

Two – Address Instructions, One- Address Instructions, Zero-Address Instructions, Instruction Cycle , Addressing Modes, CISC

Characteristics vs. RISC Characteristics.

ALU :- Design of Accumulator Logic, Design of one stage Logic Unit, Combinational ALU, sequential ALU, 1 bit Arithmetic Logic

and Shift unit, Floating Point ALU.

UNIT-V

Control Unit: Control Structure and Behaviour, Hardwired Control vs. Micro Programmed Control Unit, Basic Organisation Of Micro

Programmed Controller, Micro Instruction Format, Horizontal And Vertical Microinstruction.

UNIT-VI

Input-Output Organization: Modes of Transfer, Priority Interrupt, DMA, Input-Output Processor (IOP), Polling.

UNIT-VII

Memory Organization: Memory Hierarchy, Different Storage Technology, Cache Memory, Cache Coherence Properties, Cache

Writing Policy, Cache Mapping, Virtual Memory. Address Space and Memory Space, Associative Memory.

Suggested Readings:

1. Computer System Architecture, John. P. Hayes.

2. Mano, M.M., “Computer System Architecture, PHI.

3. Chaudhuri P. Pal, “Computer Organisation & Design, PHI,.

4. Burd , System Architecture ,Vikas


9

PAPER-VII/ COSH-302

M1: OBJECT ORIENTED PROGRAMMING USING C++ (25 MARKS)::

UNIT- I

Basic concepts of Object oriented programming , Structure of C++ program Basic data type ,Derived data type, User defined

data type, operators in C++, Control statements, inline function, function overloading .

UNIT-II

Class Introduction: Specifying a Class, Defining Member Function, Nesting of Member Function, Array of Object, Friend

Function

UNIT-III

Constructor& Destructor: parameterized constructor, copy constructor, destructor.

UNIT- IV Polymorphism & Operator Overloading: Pointer To Object, This Pointer, Virtual Function, Pointers To Derived Class. Defining

Operator Overloading, Function Overloading, Overloading Unary Operator, Overloading Binary Operator.

UNIT -IV

Inheritance: Single Inheritance, Multilevel Inheritance, Multiple Inheritance, Hierarchical Inheritance, Hybrid Inheritance, Virtual

Base class.

UNIT-V

I/O Operation: Introduction, C++ Streams, Stream Classes, Unformatted I/O Operations, Formatted Console I/O Operation,

Managing Output With Manipulators.

UNIT- VI

Files: Introduction, Class For File Stream Operations, Opening And Closing Files, Detecting End Of File, More About Open (), File

Modes, File Pointer And Their Manipulation ,Sequential Input And Output Operations, Updating A File: Random Access, Error

Handling During File Operation, Command Line Argument.

Suggested Readings:

1. B. Stroustrup, The C++ Programming Language, Addison,Wesley.

2. E. Balagurusamy, Object oriented Programming with C++, 2/ed, TMH.

3. Let Us C++, J.Kanetkar, BPB publication.

4. C++ : The Complete Referance, Herbert Schildt , Mcgraw Hill Education

5. Dietel , H. M. and P. J. Dietel. C++ How to Program, 2ed. Prentice Hall, 1998.

6. Bhushan Trivedi, Programming with ANSI C++, Oxford University Press, 2007.

COSH-302

M2: NUMERICAL ANALYSIS (15 MARKS)::

UNIT-I

Computer Arithmetic: Representation of number, Integer & Floating point arithmatic, Operations Normalization and their

consequences. Approximation and Error in computing: types of errors, error estimation, minimizing the total error.

UNIT-II

Roots of non-linear equation: Iterative Methods , Roots of a Single transcendental equations and roots of Polynomials using

Bisection Method , False position Method , Newton Raphson Method, Secant method, Fixed point method.

UNIT-II System of Linear Equation :Gauss Elimination Method, Gauss, Jordan Method, Jacobi’s Iteration Method, Gauss Seidal Iteration

Method. Matrix Inversion & Eigen Value, Factorization Method and Eigen Vectors.

UNIT-III Curve Fitting: Interpolations: Newton Interpolation Polynomial, Lagrange’s Interpolation Polynomial , Divided Difference Tables,

Interpolation with Equidistant point. Curve Fitting: Regression: Least Square Approximations, Linear regression only.

UNIT-IV Differentiation and Integration, Formula for Numerical Differentiation and Numerical integration by Trapezoidal Rule and Simpson’s

1/3 rule, Simpson’s 3/8 rule, Weddli’s rule.

UNIT-V

Numerical Solution of Differential Equations: Euler’s Method& Euler’s modified method, Taylor series Method, Runge- Kutta(2nd

and 4th

order) Method

Suggested Readings:

1. V. Rajaraman, Computer Oriented Numerical Methods, PHI.

2. S A Mollah, Numerical Analysis And Computational Procedures,

3. S.D.Conte and C.D.Boor, Elementary Numerical Analysis, McGraw Hill.

4. SS Shastri, “Introductory Methods of Numerical Analysis”, PHI.


10

PAPER-VIII /COSH-303

L1: OOP USING C++ LAB (15 MARKS)::

This practical paper will consist of programming exercises based on paper-VII-M1 course.

PAPER-VII/ COSH-302

M1: OBJECT ORIENTED PROGRAMMING USING C++ (25 MARKS)::

UNIT- I

Basic concepts of Object oriented programming , Structure of C++ program Basic data type ,Derived data type, User defined

data type, operators in C++, Control statements, inline function, function overloading .

UNIT-II

Class Introduction: Specifying a Class, Defining Member Function, Nesting of Member Function, Array of Object, Friend

Function

UNIT-III

Constructor& Destructor: parameterized constructor, copy constructor, destructor.

UNIT- IV Polymorphism & Operator Overloading: Pointer To Object, This Pointer, Virtual Function, Pointers To Derived Class. Defining

Operator Overloading, Function Overloading, Overloading Unary Operator, Overloading Binary Operator.

UNIT -IV

Inheritance: Single Inheritance, Multilevel Inheritance, Multiple Inheritance, Hierarchical Inheritance, Hybrid Inheritance, Virtual

Base class.

UNIT-V

I/O Operation: Introduction, C++ Streams, Stream Classes, Unformatted I/O Operations, Formatted Console I/O Operation,

Managing Output With Manipulators.

UNIT- VI

Files: Introduction, Class For File Stream Operations, Opening And Closing Files, Detecting End Of File, More About Open (), File

Modes, File Pointer And Their Manipulation ,Sequential Input And Output Operations, Updating A File: Random Access, Error

Handling During File Operation, Command Line Argument.

COSH-303

L2: UNIX AND NUMERICAL LAB (25 MARKS)::

Unix Shell programming Lab(10 marks:

Shell Programming Using Basic Arithmetic Operators, Control Structures, Loop Control Structures, Arrays And String Manipulation.

Numerical Lab (15 marks) :

Programs Based On: Interpolation- Newton Forward & Backward Formula, Lagrange’s Interpolation Formula; Numerical Integration-

Trapezoidal Rule, Simpson’s 1/3 Rule & Simpson’s 3/8 Rule; Algebraic And Transcendental Equations- Bisection Method, Regula

Falsi Method, Newton-Raphson Method, Iterative Method; Linear Differential Equation- R.K. Method(2nd

And 4th

Order) & Euler’s

Modified Method; System Of Linear Equations -Gauss Elimination Method, Gauss Siedal Iteration Method, Jacobi’s Iteration

Method; Regression Line.


11

SEMESTER-IV:

PAPER-IX

DATA COMMUNICATION AND COMPUTER NETWORK (25 MARKS)::

UNIT-I

Network Hierarchy: LAN, MAN, WAN; Topology; Reference Model: ISO-OSI and TCP/IP; Functionalities of each layer,

Comparison between two models. Data and Signals (Analog and Digital): Periodic & Non-periodic signals, FDM, TDM, Bandwidth,

Bit Rate, Baud Rate, Bit Length, and Composite Signal.

UNIT-II

Physical Layer and Transmission Media: Guided (Twisted Pair, Coaxial, Optical Fiber) and Unguided (Radio Wave, Microwave,

Infrared). Modes of transmission: Simplex, Half duplex, Full duplex. Transmission Impairments: Noise, Distortion and Attenuation;

Data Rate Limitation: Nyquist Theorem and Shannon Capacity.

UNIT-III

Digital Transmission: Line Coding (NRZ, Manchester, Differential Manchester); Block Coding (Basic Idea); Code Modulation

(PCM, DM ). Analog Transmission: Shift Keying (ASK, FSK, PSK,); Multiplexing: FDM, TDM, WDM. Switching: Circuit

Switching and Packet Switching. LAN: IEEE Standards (802.1, 802.3, 802.11), Ethernet Cabling.

UNIT-IV

Data Link Layer: Error Codes- Detection, Correction, Parity, Hamming Code, CRC, Checksum, Basic Concepts of Framing ,Medium

Access Control , MAC addressing, Error Control and Flow Control.

UNIT-V

Network Layer: Logical Addressing, IPv4 (Classless and Classful), NAT, IPv6 (Basic Idea), Basic idea of Routing. Types of Routing

(concepts of Unicast Routing, Multicast Routing and Broadcast Routing).

.UNIT-VI

Transport Layer: Process to process delivery, TCP and UDP (Basic Idea), Basic idea of TCP Connection, port addressing.

UNIT-VII

Application Layer: DNS, Remote Logging, FTP.

Suggested Readings:

1. Data Communication & Networking , Forouzan– IV Edition

2. Computer Networks and Internets , Douglas Comer

3. Computer Networks , Andrew Tanenbaum

4. Data Communication and Computer Network, Ajit Pal, PHI

M2: INTRODUCTION TO COMPUTER GRAPHICS (15 MARKS)::

UNIT-I

Overview of Graphics Systems: Display Devices, Raster Scan Systems, Random Scan Systems, Input Devices, Hard Copy Devices.

UNIT-II

Output Primitives: Points and Lines , Line Drawing Algorithms , Circle Generating Algorithms, Ellipse Generating Algorithms ,,

Filled Area primitives, Antialiasing

UNIT-III

Two -Dimensional Geometric Transformations: Basic Transformations, Composite Transformations, Homogeneous Coordinate

Systems

UNIT-IV

Two Dimensional Viewing : World coordinate system, Window to Viewport Coordinate Transformation, Clipping- Point

Clipping, Line Clipping, Polygon Clipping, Area Filling- Seed filling & Boundary filling.

Suggested Readings:


12

1. Hearn, Baker,“ Computer Graphics ( C version 2nd

Ed.)”,Pearson education

2. Z. Xiang, R. Plastock,“ Schaum’s outlines Computer Graphics (2nd

Ed.)”,TMH

3. D. F. Rogers, J. A. Adams,“ Mathematical Elements for Computer Graphics (2nd

Ed.)”,TMH

4. Chattopadhyay & Mukhopadhyay, Introduction to Computer graphics & Multimedia, PHI

5. Rajib Chopra, Computer Graphics, S.Chand

PAPER-X

M1: MICROPROCESSOR (10 Marks)::

UNIT I: Evolution of Microprocessor: Architecture of 8.bit and 16 - bit microprocessor, An over view of 8085, Architecture of 8085

Microprocessor, Functions of General purpose registers. Flag register. Addressing Modes, Instruction formats, Instruction sets.

Instruction cycle. Clock cycles, Timing diagrams.

UNIT-II

Interrupts: Types of Interrupt, Interrupt Handling, Methods of Interrupts Priority and Management.

UNIT-III

Programming the Microprocessor: Decision Making, Looping, Stack & Subroutines, Developing Counters And Time Delay Routines,

Code Conversion, BCD Arithmetic And 16-Bit Data Operations.

M2: MICROCONTROLLER (30 MARKS)

UNIT-I

Microprocessor Vs. Microcontroller, Basic Features Of Microcontroller, Applications, Architecture Of 8051, Memory Organisation,

Register Organisation, Interrupt Structure.

UNIT-II

Instruction Set: Data And Its Representation, Instruction Format, Addressing Modes, Organisation Of Instruction Sets

UNIT-III:

Programming the 8051: Basic Programs, Multi Sequence Programs, Concept of Looping, Subroutine Linkage

UNIT-IV

Memory Structure: Program Memory, Data Memory, Memory Organisation, Interfacing Of External Memory.

UNIT-V

Data Transfer Technique, Modes of Data Transfer, I/O Ports. Memory interfacing, I/O Interfacing ,Keyboard Interfacing.

UNIT VI

Interfacing with 8051: Interfacing of DIP Switches, Display Interface (7-segment LED display) .

Interfacing of Data Converters (D-To-A And A-To-D), serial communication using 8051 serial ports.

Suggested Readings:

1. Microprocessor Architecture, Programming, and Applications with the 8085 , Ramesh S. Gaonkar , Penram International

2. Microprocessors: The 8080,8085 and Z-80 Programming John E. Uffenbec

3. Microprocessor and Microcontroller fundamentals. The 8085 and 8051 Hardware and Software William Kleit

4. Microcontroller: principles and applications , Ajit Pal, PHI

PAPER-XI

L1: MICROPROCESSOR AND MICROCONTROLLER LAB (20MARKS)::

PROGRAMMING USING 8085/8051

1. Addition, Subtraction, Multiplication, And Division Of 8 Bits And 16 Bits Data.

2. 1’s And 2’s Compliments Of 8 Bits And 16 Bits Data.

3. N-Numbers Addition.

4. Multibyte Addition

5. Square Of A Given Number

6. Generation Of Fibonacci Series.

7. Searching The Largest/ Smallest Data From A Data Array.

8. Separating Odd and Even numbers

9. Separating Positive and Negative numbers


13

10. Movement of A Data Array From One Location To Another.

11. Swapping Of Two Arrays.

12. Sorting Of Data Array In Ascending/Descending Order.

13. Programming Using Look-Up Table.

14. Pack And Unpack Of A Given Data.

15. Code Conversions.

i. Hex to Decimal

ii. Decimal to Hex

iii. BCD to Hex

iv. Hex to BCD

16. BCD Addition and Subtraction

INTERFACING USING 8051

i. Interfacing of DIP switches.

ii. Interfacing of keyboard.

iii. Interfacing of 7-segment LED display

1. Blinking Of A Data On LED Using A Given Time Delay

2. Displaying The Character On LED Display

3. Displaying The Number On 7-Segment Display

4. Scrolling A Character On 7-Segment Display.

iv. Interfacing of D/A converter and generation of waveforms.

1. Square Wave, Triangular Wave and Ramp Wave.

v. Implementation of A/D converter using successive approximation algorithm.

L2: GRAPHICS LAB (20MARKS)::

Programs Based On- DDA & Bresenham’s Line Drawing Algorithm; Bresenham’s & Mid-Point Circle Drawing Algorithm;

Bresenham’s Ellipse Drawing Algorithm; 2D Transformations- Translation, Scaling, Rotation, Reflection, Shearing; Filing

Algorithms- Boundary Fill & Floodfill; Cohen Sutherland Line Clipping Algorithm; Sutherland-Hodgman Polygon Clipping; Biezer

Curve.


14

SEMESTER-V:

PAPER-XII/ COSH-501

M1: DATABASE MANAGEMENT SYSTEM (25 MARKS)::

UNIT-I

Basic concept of Database Systems, View of Data Models ,Database Schema, , concept of metadata, Database Languages, DBMS

Architecture, Database Users and Data Independence, Traditional file-based system vs. DBMS.

UNIT-II

E-R Modelling, relation types, role and Structural Constraints, Extended E-R Modelling Features, Design of an ER Database Schema,

Reduction of E-R Schema to Tables.

UNIT-III

Relational Model: Relational Model Concepts, Relational Algebra, Relational Calculus. Introduction to SQL: SQL data types and

literals, Types of SQL commands, SQL operators, Tables, views and indexes, Queries and sub queries, Aggregate functions.

UNIT-IV

Relational Database Design: Functional and multivalued Dependencies, Desirable Properties of Decomposition, Normal forms : 1NF,

2NF, 3NF and BCNF.

UNIT-V

Concept of Object Oriented Database, Distributed database, Transaction Management, Elementary Concepts of Security, Integrity.

Suggested Readings:

1. C.J.Date, An Introduction to Database Systems, Vol I & II, Addison Wesley.

2. Korth Silberschatz, Data Base System Concepts, 4th ed., McGraw Hill. .

3. J.D.Ullman, Principles of Database Systems, Golgotha, New Delhi.

4. R. Elmasri, and S.B. Navathe, Fundamentals of Database Systems, Pearson Education Asia.

5. Raghu Ramakrishnan, Database Management Systems, McGraw,Hill Education.

COSH-501

M2: SOFTWARE ENGINEERING (15 MARKS)::

UNIT-I

The Evolving role of software, Software Crisis, System Development Life Cycle, Waterfall, Prototype, RAID and Spiral models,

Cost -Benefit Analysis.

UNIT-II

Project Management: Software Metrics-Role of Software Metrics, Size-Oriented Metrics, Function-Oriented Metrics, Metrics For

Software Quality. COCOMO Model. Introduction to Risk Management .

UNIT-III

Software Requirements and Specification: Need for SRS, Characteristics of SRS, Components of SRS, DFD, Data Dictionary, ER

diagram.

UNIT-IV

System Design: Problem Partitioning, Top-Down And Bottom-Up design ; Decision tree, decision table ; Module level concepts,

Coupling vs. Cohesion, Structured design, methodology, Structure charts, Design reviews, Functional vs. Object Oriented approach.

UNIT-V

Testing: Test Case Specification, Types Of Testing: Unit Testing, Integration Testing, System Testing; Levels Of Testing; Black Box

& White Box Testing; Validation & Verification.

Suggested Readings:

1. R. G. Pressman, Software Engineering, TMH

2. Ghezzi, Software Engineering, PHI

3. Pankaj Jalote,An Integrated Approach to Software Engineering, NAROSA.

4. Fundamentals of Software Engineering, Rajib Mall, PHI


15

PAPER-XIII /COSH-502

COMPILER DESIGN AND AUTOMATA THEORY

MI: AUTOMATA THEORY::(15 marks)

UNIT-I

Introduction and Review of Finite State Machines: Deterministic, Non-deterministic, Minimization of FSM, Inverse FSM.

UNIT-II

Finite Automata (FA) & Regular Expression: Definition, Deterministic & Non-deterministic FA, Mealy machine, Moore machine,

conversion of Mealy and Moore machine, Regular Expression, Two way FA Regular Set: Definition , Minimization of FA,

UNIT-III

Grammar: Introduction, Definition, Different types, Derivation Tree, Different Normal Forms, Ambiguous Grammar and its

implications, CNF, Context Sensitive Languages, Different Classes of Languages, Deterministic Context Free Language and its

Properties

UNIT-IV

Pushdown Automata: Definition, PDA and CFL, Acceptance of Strings, Alternative Forms of PDA

COSH-502

M2: COMPILER DESIGN(25 marks)

UNIT-I

Introduction to Compiling: Compilers, Analysis of The Source Program, The Phases Of The Compiler, Symbol Table Management,

Error Handling.

UNIT-II

Lexical Analysis: The Role Of The Lexical Analyser, Tokens, Patterns, Lexemes, Input Buffering, Specifications Of A Token,

Recognition Of A Tokens, Conversion From A Regular Expression To a FA, Basic Idea About LEX.

UNIT-II

Syntax Analysis: The Role Of A Parser, Context Free Grammars, Writing A Grammar, Top Down Parsing, Non, Recursive Predictive

Parsing (LL), Bottom Up Parsing, Handles, Viable Prefixes, Operator Precedence Parsing, LR Parsers (SLR, LALR)

UNIT-III

Syntax Directed Translation: Syntax Directed Definitions, Construction Of Syntax Trees.

UNIT-IV

Code Optimization: Introduction, Basic Blocks & Flow Graphs, Transformation of Basic Blocks, Dag Representation of Basic Blocks.

Code Generations: Issues in the Design of Code Generator, A Simple Code Generator, Register Allocation & Assignment.

Suggested Readings:

1. Hopcroft JE. And Ullman JD, Introduction to Automata Theory, Languages & Computation”, Narosa.

2. K.L.P Mishra & N. Chandrasekharan , Theory of Computer Science, PHI

3. Lewis H. R. and Papadimitrou C. H., Elements of the theory of Computation, P.H.I.

4. Kain, “Theory of Automata & Formal Language”, McGraw Hill.

5. Kohavi ZVI, “Switching & Finite Automata”, 2nd

Edn., Tata McGraw Hill.

6. Linz Peter, “An Introduction to Formal Languages and Automata”, Narosa

7. Aho, Sethi, Ullman , “Compiler Principles, Techniques and Tools” , Pearson Education.

8. O.G. Kakde, “Compiler Design”

9. Santanu. Chattopadhyay, Compiler Design, , PHI publication


16

PAPER-XIV/ COSH-503

L1: DBMS LAB (15 Marks):: This practical paper will consist of programming exercises based on paper-XII-M1 course.

PAPER-XII/ COSH-501

M1: DATABASE MANAGEMENT SYSTEM (25 MARKS)::

UNIT-I

Basic concept of Database Systems, View of Data Models ,Database Schema, , concept of metadata, Database Languages, DBMS

Architecture, Database Users and Data Independence, Traditional file-based system vs. DBMS.

UNIT-II

E-R Modelling, relation types, role and Structural Constraints, Extended E-R Modelling Features, Design of an ER Database Schema,

Reduction of E-R Schema to Tables.

UNIT-III

Relational Model: Relational Model Concepts, Relational Algebra, Relational Calculus. Introduction to SQL: SQL data types and

literals, Types of SQL commands, SQL operators, Tables, views and indexes, Queries and sub queries, Aggregate functions.

UNIT-IV

Relational Database Design: Functional and multivalued Dependencies, Desirable Properties of Decomposition, Normal forms : 1NF,

2NF, 3NF and BCNF.

UNIT-V

Concept of Object Oriented Database, Distributed database, Transaction Management, Elementary Concepts of Security, Integrity.

COSH-503

L2: COMPILER DESIGN USING LEX (15 Marks)

This practical paper will consist of programming exercises based on paper-XIII-M2 course.

COSH-502

M2: COMPILER DESIGN(25 marks)

UNIT-I

Introduction to Compiling: Compilers, Analysis of The Source Program, The Phases Of The Compiler, Symbol Table Management,

Error Handling.

UNIT-II

Lexical Analysis: The Role Of The Lexical Analyser, Tokens, Patterns, Lexemes, Input Buffering, Specifications Of A Token,

Recognition Of A Tokens, Conversion From A Regular Expression To a FA, Basic Idea About LEX.

UNIT-II

Syntax Analysis: The Role Of A Parser, Context Free Grammars, Writing A Grammar, Top Down Parsing, Non, Recursive Predictive

Parsing (LL), Bottom Up Parsing, Handles, Viable Prefixes, Operator Precedence Parsing, LR Parsers (SLR, LALR)

UNIT-III

Syntax Directed Translation: Syntax Directed Definitions, Construction Of Syntax Trees.

UNIT-IV

Code Optimization: Introduction, Basic Blocks & Flow Graphs, Transformation of Basic Blocks, Dag Representation of Basic Blocks.

Code Generations: Issues in the Design of Code Generator, A Simple Code Generator, Register Allocation & Assignment.

: SEMINAR (10 MARKS):: This paper will be based on various topics given by the department.


17

SEMESTER-VI:

PAPER-XV

M1: ELECTIVE (25 MARKS)::

This paper consist of the following topics:

1. Distributed DBMS

2. Operation research

3. Advanced Computer Architecture

4. Dot Net Technology

1. DISTRIBUTED DBMS

UNIT-I

Distributed DBMS: Features And Needs. Reference Architecture. Levels of Distribution Transparency Replication. Distributed

Database Design.

UNIT-II

Storage Mechanisms: Translation Of Global Queries. Global Query Optimisation, Query Execution and Access Plan. Concurrency

Control: 2 Phases Locks. Distributed Deadlocks. Time Stamp Based And Quorum Based Protocols Comparison, Reliability -Non-

Blocking Commitment Protocols.

UNIT-III

Partitioned Networks . Checkpoints And Cold Starts. Management Of Distributed Transactions, 2 -Phase Unit Protocols. Architectural

Aspects. Node and Link Failure Recoveries.

UNIT-IV

Distributed Data Dictionary Management. Distributed Database Administration. Heterogeneous Databases-Federated Database

Reference Architecture Loosely And Tightly Coupled.

UNIT-V

Alternative Architecture . Development Tasks Operation - Global Task Management. Client Server Databases -SQL Server Open

Database Connectivity. Constructing an Application.

SuggestedReadings:

1. Database System Concepts- Silberschatz Korth Sudarshan, TMH

2. Distributed Database- Tannenbaum, Pearson

3. Principles of Distributed Database Systems- M.Tamerozsu, Patrick Valduriez, Pearson

4. Database Management Systems- Ramakrishnan, TMH

5. Database Management Systems- Leon, VIKAS

2.OPERATION RESEARCH

UNIT- I

Introduction To Operations Research: Basics Definition, Scope, Objectives, Phases, Models And Limitations Of Operations Research.

Linear Programming Problem – Formulation of LPP, Graphical Solution of LPP . Simplex Method, Artificial Variables Objective

Function, Maximization and Minimization Problem

UNIT-II

Transportation Problem. Formulation, Solution, Unbalanced Transportation Problem. Finding Basic Feasible Solutions – Northwest

Corner Rule, Least Cost Method And Vogel’s Approximation Method. Optimality Test:

UNIT-III

Assignment Model. Formulation. Hungarian Method for Optimal Solution. Solving Unbalanced Problem. Traveling Salesman

Problem and Assignment Problem

UNIT-IV

Sequencing Models. Solution of Sequencing Problem – Processing N Jobs Through 2 Machines – Processing N Jobs Through 3

Machines – Processing 2 Jobs Through M Machines – Processing N Jobs Through M Machines.

UNIT-VI

Game Theory: Definition, Payoff, Types Of Games, The Maxmin-Minimax Principle, Games Without Saddle Point(Mixed

Strategies), 2x2 Games Without Saddle Point, Graphical Method For 2xn Or Mx2 Games.

Suggested Readings:

1. Operations Research : Harvey M. Warner, PHI.

2. Operations Research : Kanti Swarup, P. K. Gupta, Man Mohan, Sultan Chand and Sons

3. Operations Research: An Introduction (9th Edition) September 8, 2010


18

4. Operations Research , Sharma

3. ADVANCED COMPUTER ARCHITECTURE

UNIT-I

Theory of Parallelism: Flynn’s Classification, Parallel Computer Model: Multiprocessors and Multicomputer, PRAM And VSLI

Models, Conditions of Parallelism, Bernstein’s Condition

UNIT-II

Principles of Pipelining: Classification of Pipeline Processors, Instruction and Arithmetic Pipelines, Speedup and throughput,

Principles of Designing Pipelined Processors, Pipelining Hazards.

UNIT-III

SIMD Computers: SIMD Array Processors, SIMD Interconnection Networks (Static Vs. Dynamic Networks), Different Structures –

Linear Array, Ring, Tree and Star, Mesh, Cube, Barrel Shifter, Shuffle Exchange, Bus System, Crossbar Network.

UNIT-IV

Processor Hierarchy, CISC Scalar Processor, RISC Scalar Processor, Super Scalar Processor, VLIW Architecture.

Multiprocessor Architecture: Functional Structure -Loosely Coupled and Tightly Coupled, Interconnection networks (Time Shared/

Common Buses, Crossbar Switch And Multiport Memories, Multistage Networks), Message Passing And Routing,

UNIT-V

Memory Organisation: Hierarchical Memory Structure, Cache Memory Organisation-Cache Mapping And Performance Issues,

Shared Memory Organisation-Interleaved Memory Organisation, Cache Coherence Problem, Virtual Memory Technology, TLB,

Paging And Segmentation..

Suggested Readings:

1. Computer Architecture and Parallel Processing: Kai Hwang, Faye A. Briggs; Tata McGraw Hills

2. Advanced Computer Architecture: Kai Hwang; Tata McGraw Hills

3. Computer Architecture, A quantitative Approach: Hennessy Patterson; Elsevier.

4. Digital Design and Computer Architecture, Paperback – David Harris, Sarah Harris, Morgan Kaufmann;

4. DOT NET TECHNOLOGIES

UNIT-I

An Overview Of The Object-Oriented Paradigm, The .NET Environment ,Structures And Abstract Data Types,Using Classes, Class

Member Scoping And Access Modifiers, Using Interfaces , Designing And Implementing Exception Classes, Introduction To .NET :

.NET Framework, MSIL, CLR, CLS, Name Spaces, Assemblies, The Common Language Implementation , Assemblies , Metadata

And Intermediate Language , Garbage Collection .

UNIT-II

Design Patterns And Refactoring In ASP.NET, Building A Windows Application, Building A Web Application, , Language Features

Creating .NET Projects , UNIT-III

Building An ASP.NET Application, Introduction To ASP.NET, Difference Between ASP And ASP .Net, Working With Controls ,

Programming Configuration Files , Encrypting Configuration Sections, Accessing Data Using ADO .Net, Connecting To Data ,

Executing Commands , Working With Data.

UNIT-IV

Building An ADO.NET Application, Introduction To ADO.NET, Benefits Of ADO.NET, ADO.NET Compared To Classic ADO,

ADO .NET Objects Working With Data Sets, Managed Providers , Data Binding, Data Sets And XML , Typed Data Sets, Working

With Data Reader .

Suggested Readings:

1. Professional VB. NET ,- Wrox publication

2. ASP .NET complete reference,- TMH

3. ASP.NET 2.0, Black Book,dreamtech

4. ASP.NET Developer’s Guide GregBuczek, - McGrawHill

M2: WEB TECHNOLOGY (15 Marks)::

UNIT I :

Introduction: History of the Internet, Services and Accessibility, Uses, Protocols, Internet Standards

UNIT II :

HTML , Introduction , HTML Document , Head Section , Body Section , HTML Forms, Java Script, Introduction, Language

Elements, Objects of Java Script, Other Objects, Arrays.

UNIT III :

Cascading Style Sheets , Advantages of CSS , Properties of Tags ,Property Values ,Embedded Style Sheets , External Style Sheets ,

Grouping , Inheritance , Class as Selector, Pseudo Classes and Pseudo Elements, Positioning, Backgrounds ,Element


19

Dimensions .

UNIT IV :

Servlets, Introduction, Advantages of Servlets , Servlet Life Cycle , The Servlet API, A Simple Servlet , Handling HTTP GET

Requests, Handling HTTP POST Requests, Cookies, Session Tracking .

PAPER-XVI

L1: WEB TECHNOLOGY LAB (15 MARKS)::

This practical paper will consist of programming exercises based on paper XV- M2 course.

L2: PROJECT WORK (25 MARKS)::

Distribution of marks:

1. Intenal Assesment-5 Marks

2. Term End Examination-25 Marks

Documentation: 5 marks

Project Work: 20 marks

SYLLABUS FOR B.SC. COMPUTER SCIENCE HONOURS (1ST YEAR) Sc.pdf · SYLLABUS FOR B.SC. COMPUTER...

Documents

Transcript of SYLLABUS FOR B.SC. COMPUTER SCIENCE HONOURS (1ST YEAR) Sc.pdf · SYLLABUS FOR B.SC. COMPUTER...