UVCE CSE ISE Syllabus

1

BANGALORE UNIVERSITY

SYLLABUS : 2K6SYLLABUS : 2K6SYLLABUS : 2K6SYLLABUS : 2K6 (Third to Eight Semester)

SCHEME OF STUDY AND EXAMINATIONSSCHEME OF STUDY AND EXAMINATIONSSCHEME OF STUDY AND EXAMINATIONSSCHEME OF STUDY AND EXAMINATIONS

FOR BE DEGREE COURSE IN FOR BE DEGREE COURSE IN FOR BE DEGREE COURSE IN FOR BE DEGREE COURSE IN

COMPUTER SCIENCE AND ENGINEERINGCOMPUTER SCIENCE AND ENGINEERINGCOMPUTER SCIENCE AND ENGINEERINGCOMPUTER SCIENCE AND ENGINEERING

UNIVERSITY VISVESVARAYA COLLEGE OF

ENGINEERING

2

K.R. CIRCLE, BANGALORE - 560 001

COMPUTER SCIENCE AND ENGINEERING

THIRD SEMESTER

No. of Hr./ week

Duration of Exams

Sl. No

Code Subject

Theory

Practical

Theory

Practical

Sessional

Marks

Exam Marks

Total Marks

1. 2K6M 31 Mathematics III 04 -- 03 -- 25 100 125

2. 2K6CI 32 Data Structures With C 04 -- 03 -- 25 100 125

3. 2K6CI 33 Digital Systems Design 04 -- 03 -- 25 100 125

4. 2K6CI 34 Discrete Structures 04 -- 03 -- 25 100 125

5. 2K6CI 35 Electronic Circuits 04 -- 03 -- 25 100 125

6. 2K6CIL 36 Data Structures Lab -- 03 -- 03 25 100 125

7. 2K6CIL 37 Digital Systems Lab -- 03 -- 03 25 100 125

8. 2K6CIL 38 Electronics Circuits lab -- 03 -- 03 25 100 125

Total 20 09 15 09 200 800 1000

FOURTH SEMESTER

No. of Hr. / week

Duration of Exams

Sl. No

Code Subject

Theory

Practical

Theory

Practical

Sessional

Marks

Exam Marks

Total Marks

1. 2K6M 41 Mathematics IV 04 -- 03 -- 25 100 125

2. 2K6CI 42 Microprocessors 04 -- 03 -- 25 100 125

3. 2K6CI 43 Computer Organization & Architecture

04 -- 03 -- 25 100 125

4. 2K6CI 44 Object Oriented Programming

04 -- 03 -- 25 100 125

5. 2K6CI 45 Finite Automata & Formal Languages

04 -- 03 -- 25 100 125

6. 2K6CI 46 Computer Graphics 04 -- 03 -- 25 100 125

7. 2K6CIL 47 Microprocessor Lab -- 03 -- 03 25 100 125

8. 2K6CIL 48 Object Oriented Programming Lab

-- 03 -- 03 25 100 125

Total 20 09 15 09 200 800 1000

3

FIFTH SEMESTER

No. of Hr. / week

Duration of Exams

Sl. No

Code Subject

Theory

Practical

Theory

Practical

Sessional

Marks

Exam Marks

Total Marks

1. 2K6CI 51 Design and Analysis of Algorithms

04 -- 03 -- 25 100 125

2. 2K6CI 52 Operating Systems 04 -- 03 -- 25 100 125

3. 2K6CI 53 Computer Networks I 04 -- 03 -- 25 100 125

4. 2K6CI 54 Software Engineering 04 -- 03 -- 25 100 125

5. 2K6CI 55 Performance Modeling 04 -- 03 -- 25 100 125

6. 2K6CIL 56 Computer Graphics Lab -- 03 -- 03 25 100 125

7. 2K6CSL57 PC Programming Lab -- 03 -- 03 25 100 125

8. 2K6CIL 58 Algorithms Lab -- 03 -- 03 25 100 125

Total 20 09 15 09 200 800 1000

SIXTH SEMESTER

No. of Hr. / week

Duration of Exams

Sl. No

Code No. Subject

Theory

Practical

Theory

Practical

Sessional

Marks

Exam Marks

Total Marks

1. 2K6CI 61 Computer Networks II 04 -- 03 -- 25 100 125

2. 2K6CI 62 Database Management Systems

04 -- 03 -- 25 100 125

3. 2K6CI 63 Systems Software 04 -- 03 -- 25 100 125

4. 2K6CS 64 Artificial Intelligence and Machine Learning

04 -- 03 -- 25 100 125

5. 2K6CI 65 Unix/Linux System Programming

04 -- 03 -- 25 100 125

6. 2K6CI 66 Software Practice and Testing 04 -- 03 -- 25 100 125

7. 2K6CIL 67 Unix/Linux Programming Lab -- 03 -- 03 25 100 125

8. 2K6CIL 68 Systems Software Lab -- 03 -- 03 25 100 125

Total 20 09 15 09 200 800 1000

4

SEVENTH SEMESTER

No. of Hr. / week

Duration of Exams

Sl. No

Code No. Subject

Theory

Practical

Theory

Practical

Sessional

Marks

Exam Marks

Total Marks

1. 2K6CS 71 Advanced Computer Architecture

04 -- 03 -- 25 100 125

2. 2K6CI 72 Data Mining and Algorithms 04 -- 03 -- 25 100 125

3. 2K6CI 73 Internet Programming 04 -- 03 -- 25 100 125

4. 2K6CI 74 Elective I 04 -- 03 -- 25 100 125

5. 2K6CIL 75 Network Lab -- 03 -- 03 25 100 125

6. 2K6CIL 76 D B M S Lab -- 03 -- 03 25 100 125

7. 2K6CIL 77 Project Work (Preliminary) -- 03 -- -- 50 -- 50

Total 16 09 12 06 200 600 800

EIGHTH SEMESTER

No. of Hr. / week

Duration of Exams

Sl. No

Code No. Subject

Theory

Practical

Theory

Practical

Sessional

Marks

Exam Marks

Total Marks

1. 2K6CI 81 Advanced Operating Systems 04 -- 03 -- 25 100 125

2. 2K6CS 82 Compiler design 04 -- 03 -- 25 100 125

3. 2K6CS 83 Wireless Networks 04 -- 03 -- 25 100 125

4. 2K6CI 84 Elective II 04 -- 03 -- 25 100 125

5. 2K6CIL 85 Internet Lab -- 03 -- 03 50 100 150

6. 2K6CIL 86 Project Work -- 03 -- 03 50 100 150

Total 16 06 12 06 200 600 800

5

VII SEMESTER Electives (Elective I)

No. of Hr. / week

Duration of Exams

Sl. No

Code Subject

Theory

Practical

Theory

Practical

Sessional

Marks

Exam Marks

Total Marks

1. 2K6CI 74.1 Simulation & Modeling 04 -- 03 -- 25 100 125

2. 2K6CS 74.2 Virtual reality and Multimedia computing

04 -- 03 -- 25 100 125

3. 2K6CS 74.3 Optical Communication Networks

04 -- 03 -- 25 100 125

4. 2K6CI 74.4 Bioinformatics 04 -- 03 -- 25 100 125

VIII SEMESTER Electives (Elective II)

No. of Hr. / week

Duration of Exams

Sl. No

Code Subject

Theory

Practical

Theory

Practical

Sessional

Marks

Exam Marks

Total Marks

1. 2K6CS 84.1 Pattern recognition & Digital Image Processing

04 -- 03 -- 25 100 125

2. 2K6CI 84.2 Soft Computing 04 -- 03 -- 25 100 125

3. 2K6CI 84.3 Cryptography and Network Security

04 -- 03 -- 25 100 125

4. 2K6CI 84.4 Embedded Systems 04 -- 03 -- 25 100 125

6

B E III SEMESTER COMPUTER SCIENCE AND ENGINEERING

2K6M 31: MATHMETICS III

7

2K6CI 32: DATA STRUCTURES WITH C

4 Hrs/week

Class Marks: 25

Exam. Marks: 100

PART A

1 : SPECIAL FEATURES OF C 6 Hrs

Register variables, Bitwise operators, Bit fields, Enumerations, Command line parameters, Macros,

Preprocessor statements, Arrays in C, Structures in C.

2: LINKED LIST 6 Hrs

Linked lists, Lists in C, Simulation using linked lists, Problems on Circular, Doubly-linked, multilist

concepts using arrays and linked lists.

3 : STACK AND QUEUE 8 Hrs

Stack : Concepts, Array and Linked list implementation of Stack, Conversion from Infix to postfix and

infix to prefix. Evaluation of postfix expressions. Queue : Concepts, Array and Linked List

implementation of Queue, Dequeues

4 : RECURSION 4 Hrs

Recursive definition and processes, Recursion in C, Writing recursive programs, Simulating recursion,

GCD, Fibonacci, Binomial coefficients, Tower of Hanoi, Binary Search.

PART B

5 : TREES 14 Hrs

Binary trees, Binary tree representations, Traversals and problems, Threaded binary trees, AVL trees,

Applications using game and expression trees. Minimum spanning tree, symbol table, Huffman tree,

Tries, Splay tree, Red Black tree, 2-3-4 trees, B trees.

6 : SORTING AND SEARCHING 10 Hrs

Bubble sort, Selection sort, Insertion sort, Quick sort, Heap sort, Topological sort, Linear and Binary

search, Tree searching, Binary search tree, Hashing.

REFERENCES :

1. Mark Allen Weiss: Data Structures and Algorithm analysis, Benjamin/Cummings Publishing

Company Inc., Redwood City, CA.

2. Aaron M Tenenbaum, Moshe J Augenstein: Data Structures using C, Prentice-Hall

3. K. R. Venugopal and Sudeep R. P, Mastering C, TMH

4. Sartaj Sahni : Data Structures, Algorithm and applications in Java, McGraw-Hill.

5. Michael waite & Robert Lafore: Data Structures and Algorithms in C, Techmedia, NewDelhi

8

6. Cormen, Leizerson and Reviest : Introduction to Algorithms, Prentice Hall

2K6CI 33: DIGITAL SYSTEMS DESIGN

4 Hrs/week

Class Marks: 25

Exam. Marks: 100

PART A 1 : IC DIGITAL LOGIC FAMILIES 6 Hrs Characteristics of digital ICs, Transistor Transistor Logic family, Standard TTL characteristics, Other TTL series, Open collector TTL, Wired OR/AND connection, Tristate TTL, Emitter-Coupled Logic family, ECL NOR/OR gate and its characteristics, Metal-oxide semi-conductor (MOS) family, NMOS and CMOS gates and their characteristics, CMOS transmission gate circuits .

2 : SIMPLIFICATION OF BOOLEAN FUNCTIONS 6 Hrs Using Karnaugh map and Quine-Mccluskey methods, SOP, POS simplification, NAND and NOR implementations, other two-level implementation (AND-OR-INVERT).

3 : COMBINATIONAL LOGIC DESIGN 6 Hrs Design procedure, Adder : Half adder, Full adder, Serial adder, Parallel adder & Carry look-ahead adder, Subtractors : Half subtractor & Full subtractor, BCD to Excess-3 code convertor, BCD to 7-segment decoder, Parity generator and checker .

4 : COMBINATIONAL LOGIC DESIGN USING MSI CIRCUITS 6 Hrs Application of typical ICs like 4-bit parallel adder (ex : 7483), Encoders (ex : 74148), Multiplexers (ex: 74151, 74153, 74157) and their use in realising boolean functions, Multiplexer trees, Demultiplexer / Decoders (ex : 74138, 74154) and their use in realising a boolean function and demultiplexer trees, 4-bit magnitude comparator (ex:7485).

PART B 5 : SYNCHRONOUS SEQUENTIAL LOGIC 6 Hrs Analysis of clocked sequential logic, State reduction and assignment, Flip-flop excitation tables, Design procedure, Design of sequential ciruits ex : 3-bit up/down counter (mod < 8), 3-bit up/down gray code counter, Serial adder.

6 : COUNTERS 8 Hrs Dependancy notation, Symbols for Decoder, Multiplexer, Flipflops, Registers, Counters, RAM. Flipflops, Asynchronous counters (mod 8 and less than 8), IC asynchronous counters (7493, 7490) and cascading, synchronous counters, binary and binary up-down counters, IC synchronous counters (74192, 74190) and cascading.

7 : REGISTERS 6 Hrs Registers and their different modes of operation SISO, SIPO, PISO, PIPO, Shift registers (7495 / 74195), bidirectional universal shift register (74194), Applications of shift registers, Time delay, Ring counter, Johnson counter, Sequence generator.

8 : PROGRAMMABLE LOGIC DEVICES 4 Hrs PLD, PLA, PAL, FPGA structures and applications.

REFERENCES : 1. M Morris Mano, Digital Design, Second Edition, PHI 2. R P Jain, Modern Digital Electronics, Second Edition, TMH 3. Bignell & Donovan : Digital Electronics, 4

th Edition, Thomson Learning.

9

4. Tocci : Digital Systems PHI 5. Uyemura : Digital Systems Design, Thomson Learning 6. Anand Kumar : Digital Integrated Electronics

10

2K6CI 34 : DISCRETE STRUCTURES 4 Hrs/week

Class Marks: 25 Exam. Marks: 100

PART A 1 : FUNDAMENTALS 6 Hrs Sets and subsets, Operations on sets, Counting Permutations, Combinations, Pigeonhole principle, Inclusion-Exclusion principle, Recurrence relations. 2 : LOGIC 8 Hrs Propositions and logical operations, Conditional statements, Methods of proof, Mathematical Induction. 3 : RELATIONS AND DIGRAPHS 10 Hrs Product sets and partitions, Relations and Digraphs, Paths in relations and digraphs, Properties of relations, Equivalance relations, Computer representation, Manipulation of relations, Transitive closure and Warshalls algorithm. Functions Functions for computer science, Permutation functions, Growth of functions.

PART B 4 : TOPICS IN GRAPH THEORY 12 Hrs Graphs, Euler paths and circuits, Hamiltonian paths and circuits, coloring graphs. Trees Labeled trees, Tree searching, Undirected trees, Minimal spanning trees. 5 : ORDER RELATIONS AND STRUCTURES 6 Hrs Partially ordered sets, External elements, Lattices, Finite Boolean Algebras, Functions on Boolean

algebras. 6 : GROUPS AND CODING 6 Hrs Coding of binary information and error detection, Decoding and error correction. REFERENCES :

1. Bernard Kolman, Robert C Busby, Sharon Ross, Discrete Mathmatical Structures, Third Edition, PHI.

2. R Johnsonbaugh, Discrete Mathematics, Revised edition, Macmillan International. 3. Trembly & Manohar, Discrete Mathematics with applications to Computer Science,

McGraw Hill. 4. C L Liu, Elements of Discrete Mathematics, McGraw Hill. 5. Kennedy H Rosen : Discrete Mathematics TMH.

11

2K6CI 35 : ELECTRONIC CIRCUITS 4 Hrs/week Class Marks: 25 Exam. Marks: 100

PART A

1 : DIODE AND TRANSISTOR 6 Hrs Diode applications, The diode as a circuit element, Load line analysis, Diode approximations, AND/OR gates, Clippers and clampers, Characteristics of Photodiode, LEDs, LCDs. Transistor biasing, Design and Analysis using h-parameter for Common Emitter and Emitter follower (common collector) configurations. 2 : FIELD EFFECT TRANSISTORS (FETs) 6 Hrs FET biasing, FET small signal model, Small signal analysis of FET common source and common drain configurations. Characteristics and uses of SCRs, UJT, Programmable UJT, Phototransistor and opto-isolators. 3 : AMPLIFIERS 6 Hrs Design and Analysis of RC coupled Amplifier, Transformer Coupled Amplifier, Emitter Follower with Boot strap, Darlington Pair using h-parameters. 4 : POWER AMPLIFIERS 6 Hrs Class A, Class B, (complementary symmetry and push-pull using transformers) Class C & Class AB power amplifiers.

PART B 5 : FEEDBACK AMPLIFIERS 6 Hrs Feedback concepts and characteristics, types of Feed back circuits, Voltage shunt, voltage series, current shunt and current series feedback, derivation of feedback amplifier characteristic for voltage series and current series feedback amplifiers 6 : OSCILLATORS 6 Hrs Concepts, derivation of frequency and conditions for sustaining oscillations in Colpitts, Hartley, RC Phase Shift and Weins Bridge Oscillator. 7 : D/A AND A/D CONVERTORS 6 Hrs D/A conversion, Weighted resistor and R-2R ladder type DAC, using Op-amps, DAC specifications, A/D conversion, Principle of A/D conversion, Simultaneous ADC, Successive approximation ADC, ADC specifications. 8 : MULTIVIBRATORS AND TIMING CIRCUITS 6 Hrs Astable, Monostable and Bistable (flipflop) using NAND gates, using Op-amp and IC timer 555. Schmitt trigger using op-amp and its applications REFERENCES :

1. Robert Boylestead and Louis Nashelsky, Electronic Devices and Ciruit Theory Sixth Edition, PHI

2. Milman & Halkias : Integrated Electronics 3. Boylestead & Neshelskey : Electronics Devices & Circuits. 4. Bogart : Electronics Devices & Circuits.

12

2K6CIL 36 : DATA STRUCTURES LABORATORY (Regular Laboratory)

3 Hrs/week Class Marks: 25 Exam. Marks: 100 Problems : 1. Singly linked lists

2. Doubly linked list

3. Circular linked lists

4. Implementation of Stack using array and linked list

5. Conversion from infix to postfix using stacks

6. Conversion from infix to prefix using stacks

7. Using recursion to implement Tower of Hanoi

8. Implementation of Queue using array and linked list

9. Creation of binary tree and operation of insertions and deletions

10. Evaluations of expressions stored as tree

11. Implementation of threaded binary trees

12. Tree Traversals : Inorder, preorder, postorder

13. Implementation of Binary search tree

14. Insertion sort

13

2K6CIL 37 : DIGITAL SYSTEMS LABORATORY (Regular Laboratory)

3 Hrs/week Class Marks: 25

Exam. Marks: 100 1. Design and implementation of Half and full adders, BCD to Excess-3 code converter, 4 to 1

multiplexer and 2 to 4 decoder using NAND gates. 2. Design using MSI chips and gates : BCD to Excess-3 and Excess-3 to BCD code converters using

4 bit adder (7483 / 74283) and gates, Full adder / Subractor using multiplexer (74153), Full adder / Subractor using decoders (7442, 74138), Multiplexer trees, 7-segment display using 7447 IC.

3. Design and implementation of asynchronous counters using J-K master / slave Flip flop Ics (mod 8

and < 8) using Ics 7493, 7490 and their cascading (2 stage). 4. Design and implementation of mod 8 and < 8 synchronous counter using J-K master/slave Flip

flop ICs. 5. Synchronous counter ICs 74192, 74190. 6. SISO, SIPO, PIPO, PISO modes of shift register IC 7495/74195. 7. Ring Counter, Johnson counter and sequence generator using shift register IC 7495/74195.

14

2K6CIL 38 : ELECTRONIC CIRCUITS LABORATORY (Regular Laboratory)

3 Hrs/week

Class Marks: 25 Exam. Marks: 100 Experiments including :

1 FET characteristics in common source configuration.

2 BJT characteristics in common emitter configuration and measurement of hybrid parameters.

3 Voltage shunt regulator using zener diode.

4 R-C coupled amplifier, determination of Zin, Zout, frequency response and bandwidth.

5 Emitter follower, determination of Zin, Zout, frequency response and bandwidth.

6 Transformer Coupled Amplifiers.

7 Class-B push-pull complimentary symmetry amplifier and to find the effeciency as a function of load.

8 Voltage series Feedback amplifier.

Experiments using OPAMPS:

9 Inverter, Non-Inverter, Adder, Subtractor, Voltage Follower

10 RF Oscillators (i) Colpitts (ii) Hartley

11 AF Oscillators (i) RC Coupled Phaseshift Oscillators (ii) Wein Bridge Oscillators

12 Schmitt Trigger

13 Multivibrators (i) Monostable (ii) Astable (iii) Bistable, using OPAMPS and 555 timer.

14 Analog to Digital Converter

15 Digital to Analog Converter

15

B E IV SEMESTER COMPUTER SCIENCE AND ENGINEERING

2K6M 41: MATHMETICS IV

16

2K6CI 42 : MICROPROCESSORS 4 Hrs/week


PART A

1. INTRODUCTION TO 8 BIT MICROPROCESSOR 3 Hrs 8085 Architecture Addressing mode instruction set. 2. INTRODUCTION TO 16 BIT MICROPROCESSOR 6 Hrs Introduction to Microprocessors, Microprocessor-based Computer Systems, Architecture of 8086/8088, Programmers model of 8086/8088, Segmentation and memory addressing in 8086 / 8088. 3. ASSEMBLY LANGUAGE PROGRAMMING I 6 Hrs Assembly language, Assemblers for the PC, Addressing modes of 8086 Assembler directives. Data movement instructions, Instruction encoding, Assembling, Linking and Executing Programs; Arithmetic and Logical Instructions, Branch Instruction, Processor Control Instructions. 4. ASSEMBLY LANGUAGE PROGRAMMING II 5 Hrs String Instructions, Debugging programs, Programming Examples; Program flow control Instructions.

5. ASSEMBLY LANGUAGE PROGRAMMING III 4 Hrs Machine control and miscellaneous instructions, Programming Examples, Modular Program Development: Use of Linker, Library, Macros and Conditional Assembly.

PART B 6. HARDWARE FEATURES OF 8086/8088 6 Hrs Pin-outs and pin functions, Clock generator, Bus buffering, latching and Timing Diagrams, Ready and wait state, Min/Max modes of operation. 7. MEMORY INTERFACING 6 Hrs Memory Devices, Address Decoding, 8/16 bit memory Interfacing, DRAM memory system. 8. INTERRUPT SYSTEM AND PIC (8259A), I/O INTERFACING 12 Hrs Introduction to interrupts, Interrupt-related instructions, Interrupt processing, 8259A PIC. Introduction to I/O Interfacing; Memory mapped I/O and I/O mapped I/O; Simple input/output interfaces (reading switches using 74LS244, driving LEDs using 74LS374), Address decoding. Interfacing of 8255 and 8254 devices, ADC/DAC devices : 8255: Basic description, Interfacing to 8086/8088, Mode 0 Mode 1 operations, Application Examples (Seven-Segment Display interface, Stepper motor interface, Keypad interface). 8254: Basic description, Modes of operation, Application Examples (DC motor speed and Direction control using PWM). ADC/DAC Devices: Interfacing DAC 0830 and ADC 0804 devices.

REFERENCES :

1. Doughlas V Hall, Microprocessors and Interfacing: Programming and Hardware, Second edition, McGraw Hill.

2. K. R. Venugopal and Rajkumar, Microprocessors X86 Programming, BPB 3. Gaonker : Microprocessor Architecture and programming. 4. K. Udaya Kumar and B.S. Umashankar, Advanced Microprocessors and IBM PC

Assembly Language Programming, Tata McGraw Hill. 5. Ray and Burchandi : Microprocessors 6. Barry B. Brey, The Intel Microprocessors, Fourth Edition, Prentice- Hall India. 7. Michael Throne, Computer Organization and Assembly language Programming, Addision

Wesley.

17

2K6CI 43 : COMPUTER ORGANIZATION AND ARCHITECTURE

4 Hrs/week Class Marks: 25 Exam. Marks: 100

PART A 1 : THE GENERAL PURPOSE MACHINE 12 Hrs The general purpose machine, The users view, The machine/assembly language programmers view. The Computer architects view, The computer system logic designers view, Historical perspective, Classification of computers and their instructions, Computer instruction sets, Informal description of the simple RISC computer, SRC, Formal description of SRC using register transfer notation, RTN, Description of addressing modes with RTN, Register transfer and logic circuits : from behavior to hardware. 2 : REAL MACHINES 6 Hrs Machine characteristics and performance, RISC versus CISC, A CISC microprocessor The motorola MC68000, A RISC architecture : The SPARC. 3 : PROCESSOR DESIGN & MICROPROGRAMMING 6 Hrs The design process, A 1-bus micro architecture for the SRC, Data path implementation, Logic design for the 1-bus SRC, The control unit, The 2-and-3 bus processor designs, The machine reset, Machine exceptions, Microprogramming.

PART B

4 : COMPUTER ARITHMETIC UNIT 6 Hrs Number systems and radix conversion, Fixed-point arithmetic, Seminumeric aspects of ALU design, Floating-point arithmetic. 5 : MEMORY SYSTEM DESIGN 6 Hrs Introduction : The components of the memory system, RAM structure : The logic designers perspective, Memory boards and modules, Two-level memory hierarchy, The cache, Virtual memory. 6 : INPUT AND OUTPUT 12 Hrs The I/O subsystem, Programmed I/O, I/O interrupts, Direct memory access (DMA), I/O data format change and error control, Magnetic disk drives, Display devices, Printers, Input devices, Interfacing to the analog world. REFERENCES :

1. Vincent P Heuring & Harry F Jordan, Computer Systems Design and Architecture, Addison-Wesley

2. William Stallings, Computer Organization and Architecture, Fourth Edition, PHI 3. Computer Organization : V. C. Hamacher, Z.G. Vranesic & S.G. Zaly 4. Computer Architecture : M. Mano, Prentici Hall 5. Hayes : Computer Architecture & Organisation, Third Edition, TMH. 6. Patter son : Computer Architecture, PHI

18

2K6CI 44 : OBJECT ORIENTED PROGRAMMING

4 Hrs/week Class Marks: 25 Exam. Marks: 100

PART A 1 : INTRODUCTION 6 Hrs Datatypes, Operators, Class types, Definition of an expression, Assignment operators, Increment and Decrement operators, Recursion, Inline functions, scope, store allocation. 2 : FUNCTIONS AND TEMPLATES 6 Hrs Overloaded function names, Template class, Template functions, Pointers to functions. 3 : VIRTUAL FUNCTIONS 6 Hrs Public, Protected and Private base classes, Inheriting operator functions.Virtual functions, Virtual base classes, Template classes under inheritance, Identify the classes, Defining the interface, Living in a Multi-paradigm universe. 4 : THE C++ I/O LIBRARY AND EXCEPTION HANDLING 6 Hrs Input, Output, Additional I/O operators, Overloading operator Insertion, Extraction, File input and output, Condition states, Incore formatting, Formal state, Exception handlers, The try, The catch and the throw.

PART B

5 : JAVA 6 Hrs Introduction to Java and Internet, Overview of Objects and classes. Data type and control structure in Java. Defining classes in java, access mechanisms, static variables and static methods. Inheritance in Java. Objects and references. The class hierachy, Exceptions- Defining and throwing exceptions, creating exceptions, a data structure for a web crawler. 6 : LIBRARIES AND INPUT AND OUTPUT 12 Hrs Documentation of Packages, the java.util package. The vector class and hash table class. The Object class and object wrappers. Mixing objects, Abstraction mechanisms Abstract methods, interfaces packages. Threads- creating threads, suspend and resume methods, buffer. The class print stream, data streams, string tokenizer class. Stream tokenizer. Human computer interface (HCI) and Java- overview of AWT, HCI elements, containers and layouts, control elements, the event system, graphics. 7: APPLETS 6 Hrs Applet methods, Drawing and handling events, Threads in applets. Interface to the applet. Double buffering. Network Programming- the URL, Socket and serversocket classes. The common protocol writing a server. Writing an applet. REFERENCES :

1. Stanley B Lipman, C++ Primer, Second Edition, Addison Wesley 2. Bjranne Strousup, C++ Programming Language, Addison Wesley 3. K. R. Venugopal, Ravishankar and Rajkumar, Mastering C++, TMH 4. John Hubband, Programming with C++, 2nd Edition, Schaums outline series, McGraw Hill 5. E Balaguruswamy , Object Oriented Programming with C++, TMH 6. Herbert Schildt : C++ the Complete Reference , Second Edition, TMH.

19

2K6CI 45 : FINITE AUTOMATA AND FORMAL LANGUAGES 4 Hrs/week


PART A

1 : REGULAR LANGUAGES AND FINITE AUTOMATA 6 Hrs Regular expression and Finite Automata, Regular Languages and Regular Expressions, The Memory Required to Recognize a Language, Finite Automata, Distinguishing One String from Another, Unions, Intersections and Complements.

2 : NONDETERMINISTIC FINITE AUTOMATA 6 Hrs

Nondeterministic Finite Automata, Nondeterministic Finite Automata with -Transitions, Kleenes Theorem.

3 : REGULAR AND NONREGULAR LANGUAGES 6 Hrs Criterion for Regularity, Minimal Finite Automata, The Pumping Lemma, Decision Problems, Regular Languages and Computers.

4 : CONTEXT-FREE GRAMMAR 6 Hrs Definition of a Context-free Grammar, More Examples, Including Some Familiar Languages, Unions, Concatenations and *s of CFLs, Derivations Trees and Ambiguity, Unambiguous CFG for Algebraic Expressions, Simplified Forms and Normal Forms (Proof not needed).

PART B 5 : PUSHDOWN AUTOMATA 6 Hrs Introduction by Way of an Example, Definition of a Pushdown Automata, Deterministic Pushdown Automata, PDA Corresponding to a Given Context-Free Grammar, A Context-Free Grammar Corresponding to a Given PDA, Parsing (Brief discussion of Top-down, Bottom-up parsing, (Proof not needed for Theorem No 7.2, 7.3, 7.4).

6 : CONTEXT-FREE AND NONCONTEXT-FREE LANGUAGES 6 Hrs Pumping Lemma for Context-Free Languages, intersections and Complements of Context-Free Languages, Decision Problems Involving Context-Free Languages (Proof not needed).

7 : TURING MACHINES 6 Hrs Models of Computation and the Church-Turing Thesis, Definition of a Turing machine and TMs as Language Acceptors, Combining Turing Machines, Computing a partial function with a Turing Machine, Variations of Turing Machines : Multitape TMs, Nondeterministic Turning Machines, Universal Turning Machines (Proof not needed ).

8: RECURSIVELY ENUMERABLE, RECURSIVE LANGUAGES AND OTHER GRAMMARS 6 Hrs Recursively Enumerable and Recursive, Enumerating a language, Not All Language are Recursively Enumerable, a Language that is not recursively Enumerable, Unrestricted Grammars, Unrestricted Grammars and Turing Machines, Regular Grammars, Context-Sensitive Grammars and Linear-Bounded Automata, The Chomsky Hierarchy. REFERENCES :

1. John C Martin, Introduction to Languages and the Theory of Automata, Second Edition, McGraw Hill.

2. J P Hopcroft, J D Ullman, Introduction to Automata, Languages and Computation, Narosa Pulications.

3. Daniel A Cohen : Introduction to Computer Theory : Joh Wiley and Sons 4. Peter Lenz: An Introduction to Formal Languages & Automato, Narosa, Publishing House

20

2K6 CI 46 : COMPUTER GRAPHICS 4 Hrs/week


PART A 1 : INTRODUCTION 6 Hrs Image Processing as picture analysis, Advantages of interactive graphics, Representative users of computer graphics, Classification of applications, Development of hardware and software for computer graphics, Conceptual framework for interactive graphics, Drawing with SRGP, Basic interaction handling, Raster graphics features, Limitations of SRGP, Hardcopy technologies, Display technologies, Raster-scan display systems, The video controller, Random-scan display processor, Input devices for operator interaction, Image scanners.

2 : RASTER GRAPHICS ALGORITHMS 6 Hrs Overview, Scan converting lines, Scan converting circle, Filling rectangle, Filling polygons, Filling Ellipse arcs, Pattern filling, Thick primitives, Line style and pen style, Clipping in a raster world, Clipping lines, Clipping circles and ellipse, Clipping polygons, Generating characters, SRGP copy pixel, Antialiasing.

3 : GEOMETRICAL TRANSFORMATIONS 6 Hrs 2D transformations, Homogeneous coordinates and matrix representation of 2D transformations, Composition of 2D transformations, The window-to-view port transformation, Efficiency, Matrix representation of 3D transformations, Composition of 3D transformations, Transformations as a change in coordinate system.

4 : VIEWING IN 3D 6 Hrs Projections, Specifying an arbitrary 3D view, Examples of 3D viewing, The mathematics of planar geometric projections, Implementing planar geometric projections, Coordinate systems.

PART B 5 : INTERACTION TECHNIQUES, DIALOG DESIGN AND USER INTERFACE SOFTWARE 6 Hrs Interaction hardware, Basic interaction tasks, Composite interaction tasks, The form and content of user-computer dialogues, User-interface styles, Important design considerations, Modes and syntax, Visual design, The design methodologies.

6 : REPRESENTING CURVES AND SURFACES 6 Hrs Polygon meshes, Parametric cubic curves, Parametric bicubic surfaces, Quadric surfaces.

7 : SOLID MODELING 6 Hrs Representing solids, Regularized Boolean set operations, primitive instancing, Sweep representations, Boundary representations, Spatial-partitioning representations, Constructive solid geometry, Comparison of representations, user interfaces for solid modeling.

8 : VISIBLE-SURFACE DETERMINATION 6 Hrs Functions of two variables, Techniques for efficient visible-surface algorithms, Algorithms for visible-line determination, The z-buffer algorithms, List-priority algorithms, Scan-line algorithms, Area-subdivision algorithms, Algorithms for octrees, Algorithms for curved surfaces, Visible-surface ray tracing. REFERENCES :

1. James D Foley, Andries van Dam, Steven K Feiner, John F Huges, Computer Graphics, Addison-Wesley.

2. Hearn and Baker, Computer Graphics, Second Edition, PHI. 3. N. Krishnamurthy : Computer Graphics, TMH.

21

2 K 6 CI 47 : MICROPROCESSORS LABORATORY

(Regular Laboratory) 3 Hrs/week

Class Marks: 25 Exam. Marks: 100 I Use of 8085 Kit : Basic Problems :-

1. Use 8085 kit to add two Multi byte binary /BCD numbers.

2. Use 8085 kit to Multiply and divide two binary numbers.

3. Use 8085 kit to subtract and multiply two BCD numbers.

II 8086 Assembly language programs are to be created and executed

4. Write a Assembly language program to Bubble sort a set of n numbers.

5. Write a Assembly language program to Selection sort a set of n numbers.

6. Write a Assembly language program to perform Linear Search on a set of n numbers.

7. Write a Assembly language program to perform Binary Search on a set of n numbers.

8. Write a Assembly language Recursive Program to find Factorial of a number.

9. Write a Assembly language program to generate the Fibonacci series.

10. Write a Assembly language program to find GCD of two numbers.

11. Write a Assembly language program to convert the Decimal number to Hexadecimal code.

12. Write a Assembly language program to convert the Decimal number to Octal Code.

13. Write a Assembly language program to add/subtract two 32 bit number

14. Write a Assembly language program to generate prime numbers

15. Write a Assembly language program to check if the string is a palindrome

16. Write a Assembly language program to find the length of the string and reverse the string

17. Write a Assembly language program to find the largest / smallest element in an array

18. Write a Assembly language program to simulate two digit calculator.

19. Write a Assembly language program to compute nCr

20. Write a Assembly language program using 8255 add on card on 8086 for the Seven Segment Display

21. Write a Assembly language program using 8255 add on card on 8086 for the Keypad Interface

22. Write a Assembly language program using 8255 add on card on 8086 for the DAC Interface

23. Write a Assembly language program using 8255 add on card on 8086 for the ADC Interface

24. Write a Assembly language program using 8255 add on card on 8086 for the Stepper Motor Interface

22

2K6CI 48 OBJECT ORIENTED PROGRAMMING LABORATORY

(Regular Laboratory) 3 Hrs/week

Class Marks: 25 Exam. Marks: 100 In this laboratory the students have to write and execute programs both in C++ and Java for the under mentioned programs 1. Validating a date

2. Finding the values of unknowns in the polynomial of degree n.

3. String operations using function overloading.

4. Quick sort using pointer to a function

5. Creation and manipulation of a circular doubly linked lists using arrays and pointers.

6. Manipulation of sparse matrix using multi linked structure.

7. Manipulation of complex numbers using the concept of class & operator overloading.

8. Manipulation of stacks and queues using the concept of class & operator overloading.

9. Real world problem implementation using inheritance.

10. Implementation of BFS & DFS using objects.

11. Creation & manipulation of heterogeneous array with respect to objects by taking a suitable Example using virtual functions.

12. Program to demonstrate the use of exception handler using try, throw and catch, etc.

23

BE VI SEMESTER COMPUTER SCIENCE AND ENGINEERING

2K6CI 51 : DESIGN AND ANALYSIS OF ALGORITHMS

Note: FOUR questions from Part A and FOUR questions from part B to be set. Students should answer FIVE questions selecting at least TWO from each part. For every SIX hours of syllabus ONE question may be set.

Hours per week : 4 Examination Marks : 100 Sessional Marks : 25

Part A

Chapter 1 : Introduction 2 HOURS The Notion of Algorithm, Fundamentals of algorithmic Problem Solving, Important Problem Types, A Review of Fundamental Data Structures. Chapter 2: Fundamentals of Analysis of Algorithms Efficiency 4 HOURS The Analysis of Framework. Asymptotic Notations and Standard Efficiency Classes. Mathematical analysis of Non-Recursive Algorithms. Mathematical Analysis of recursive algorithms. An Example: the Fibonacci Numbers. Empirical Analysis of Algorithms. Algorithm Visualization. Chapter 3: Brute-Force 4 HOURS Selection Sort and Bubble Sort. Sequential Search and Brute-Force String Matching. Closest-Pair and Convex-Hull Problems By Brute Force. Exhaustive Search. Chapter 4: Divide-and-Conquer 6 HOURS Mergesort. Quicksort. Binary Search. Binary Tree Traversals and Related Properties. Multiplication of Large Integers and Strassen's Matrix Multiplication. Divide-and-Conquer algorithms for the Closest-Pair and Convex-Hull Problems. Chapter 5: Decrease-and-Conquer 6 HOURS Insertion Sort. Depth-First Search and Breath-First Search. Topological sorting. Algorithms for Generating Combinatorial Objects. Decrease-by-a Constant-factor Algorithm. Variable-Size-Decrease Algorithms.

Part B Chapter 6: Transform-and-Conquer 5 HOURS Presorting and its Applications. Gaussian Elimination. Balanced Search Trees. Heaps and Heapsort. Horner's Rule and Binary Exponentiation. Problem Reduction. Chapter 7: Space and Time Tradeoff in Algorithms 5 HOURS Sorting by Distribution Counting. Horspool's and Boyer-Moore Algorithms for String Matching. Hashing. B -Trees. Chapter 8: Dynamic Programming 5 HOURS Binomial Coefficients. Warshall's and Floyd's Algorithms. Optimal Binary Search Trees. The Knapsack Problem and Memory Functions. Chapter 9: Greedy Approach 5 HOURS Prim's Algorithm. Kruskal's Algorithm. Dijkstra's Algorithm. Huffman Trees.

24

Chapter 10: Limitations of Algorithm Power 4 HOURS Lower-Bound Arguments. Decision Trees. P, NP and NP-complete Problems. Challenges of Numerical Algorithms. Chapter 11: Coping with the Limitations of Algorithm Power 2 HOURS Backtracking. Branch-and-Bound. Approximation Algorithms for NP-Hard Problems. Algorithms for Solving Nonlinear Equations. References:

1. Introduction to Design and Analysis of Algorithms, Anny Levitin, Person Education Press. 2. Gilles Brassard & Paul Bratley, Fundamental Algorithms, Prentice-Hall. 3. Cormen, Leizerson & Rivest, Introduction to algorithms, Prentice-Hall. 4. Aho, HopCroft, Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley. 5. Horowitz & Sahni, Fundamentals of Computer Algorithms, Galgotia Publication.

2K6CI 52 : OPERATING SYSTEMS

Note : FOUR questions from Part A and FOUR questions from part B to be set. Students should answer FIVE questions selecting at least TWO from each part. For every SIX hours of syllabus ONE question may be set.


Part A Chapter 1 : Introduction 6 Hours Batch Systems, Concepts of multi programming and time-sharing, parallel, distributed and real - time systems. Operating system structures - operating system components and services. System calls and system programs. Virtual machines. Chapter 2 : Process Management 6 Hours Process concept, process scheduling, cooperating processes, threads and interprocess communication. CPU scheduling - scheduling criteria, scheduling algorithms, multiple- processor scheduling and real-time scheduling. Algorithm evaluation. Chapter 3 : Process Synchronization and Dead Locks 12 Hours The critical section problem, synchronization hardware, semaphores, classical problems of synchronization, critical regions and monitors. Dead locks - system model, characterization, Deadlock prevention, avoidance and detection. Recovery from dead lock. Combined approach.

Part B Chapter 4 : Storage Management 12 Hours Memory management - logical and physical address space, swapping, contiguous allocation, paging and segmentation. Segmentation with paging in MULTICS and Intel 386. Virtual Memory - Demanding paging and its performance. Page replacement algorithms. Allocation of frames. Thrashing. Page size and other considerations. Demand segmentation. File systems, Secondary Storage Structure, Protection and Security-File concept, access methods, directory structure, protection and consistency semantics. File system structure, allocation methods. Free space management. Directory implementation. Efficiency and performance. Recovery. Disk structure, disk scheduling methods. Disk management. Swap-space management. Disk reliability.

25

Chapter 5 : Protection and Security 6 Hours Protection - Goals of protection, domain of protection. Access matrix and its implementation. Revocation of access. Security - Authentication, passwords. Threats and threat monitoring. Encryption. Computer security classifications. Chapter 6 : Case Study 6 Hours Windows NT, LINUX, Design principles, system components, environmental subsystems. File system, networking and programmer interface. References:

1. Silberschatz and Galvin, Operating System Concepts, Fifth Edition, Addision-Wesly. 2. Milan Milancovic, Operating Systems, Concepts and Design. Second Edition, McGrawHill. 3. Harvey M Deital, Operating Systems, Second Edition, Addition-Wesely.

2K6CI 53 : COMPUTER NETWORKS I Note : FOUR questions from Part A and FOUR questions from part B to be set.

Students should answer FIVE questions selecting at least TWO from each part. For every SIX hours of syllabus ONE question may be set.

Hours per Week : 4 Examination Marks 100 Sessional Marks : 25

Part A Chapter 1 : Introduction 6 Hours Data communication, Networking, Protocols and Protocol architecture, standards. Data transmission concepts. Analog and digital transmission. Transmission impairments. Chapter 2 : Transmission Media 12 Hours Guided transmission media and wireless transmission, Data encoding - Digital and analog data and signals, spread spectrum. Data communication interface - asynchronous and synchronous transmission, line configuration and interfacing. Data link control - Flow control. Error detection and error control. HDLC and other data link protocols. Multiplexing - Frequency-division, synchronous time-division and statistical time-division multiplexing. Chapter 3 : MAC Sublayer 6 Hours The Channel Allocation Problem, Multiple Access Protocols, Ethernet, Wireless LANs, Broadband Wireless, Bluetooth, Data Link Layer Switching

Part B Chapter 4 : Switching 12 Hours Switched networks. Circuit-switched networks. Switching concepts. Routing in circuit-switched networks. Control signalling. Packet switching principles. Routing and congestion control, x.25 protocol standard. Chapter 5 : Local Area Networks 12 Hours LAN Technology - LAN architecture. Bus/tree, ring, star and wireless LANs. LAN Systems - Ethernet and Fast ethernet (CSMA/CD) Token ring and FDDI, 100 VG-Any LAN, ATM LANs, Fibre channel, wireless LANs. Bridges - Bridge operation and routing with bridges. References :

1. W. Stallings, Data and Computer Communications, Fifth Edition, PHI. 2. A.S. Tanenbaum, Computer Networks, Fourth Edition, PHI. 3. S. Keshav, An Engineering Approach to Computer Networking, Addison Wesely.

26

2K6CI54 : SOFTWARE ENGINEERING Note :

FOUR questions from Part A and FOUR questions from part B to be set. Students should answer FIVE questions selecting at least TWO from each part. For every SIX hours of syllabus ONE question may be set.


Part A Chapter 1: Introduction & System Engineering 6 Hours FAQs about software engineering, Professional and ethical responsibility, Emergent system properties, Systems and their environment, System modelling, The system engineering process, System procurement Chapter 2: Software Process 6 Hours Software process models, Process iteration, Software specification, Software design and implementation, Software validation, Software evolution, Automated process support Chapter 3: Software Project Management 8 Hours Management activities, Project planning, Project scheduling, Risk management, Limits to thinking, Group working Choosing and keeping people, Software Cost Estimation, Productivity, Estimation techniques, Algorithmic cost modelling, Project duration and staffing, Quality assurance and standards, Quality planning, Quality control, Software measurement and metrics Chapter 4: Software Requirement Engineering 4 Hours Software Requirements, Functional and non-functional requirements, User requirements, System requirements, The software requirements document, Requirements Engineering Processes, Feasibility studies, Requirements elicitation and analysis, Requirements validation, Requirements management,

Part B Chapter 5: System Models 4 Hours Context models, Behavioural models, Data models, Object models, CASE workbenches, Software Prototyping, Prototyping in the software process, Rapid prototyping techniques, User interface prototyping. Chapter 6: Software Design 8 Hours Architectural Design, System structuring, Control models, Modular decomposition, Domain-specific architectures, Object-oriented Design, Objects and object classes, An object-oriented design process, Design evolution, User Interface Design, User interface design principles, User interaction, Information presentation, User support, Interface evaluation Chapter 7: Software Testing 6 Hours Verification & Validation, Verification & validation planning, Software inspections, Cleanroom software development, Defect testing, Integration testing, Object-oriented testing, Testing workbenches. Chapter 8: Software Process Improvement 6 Hours Process and product quality, Process analysis & modelling, Process measurement, The SEI process capability maturity model, Process classification, SEI-PCMM models, SEI-CMMI process models References:

1. Ian Sommerville, Software Engineering, Pearson Education 2. Pressman R.S, Software Engineering, McGraw Hill. 3. Jalote P., An integrated approach to Software Engineering, Narosa.

27

2K6CI 55 : PERFORMANCE MODELING Note :



Part A

Chapter 1 : Introduction 6 Hours Probability Models, Sample Space, Events, Algebra of Events, Graphical Methods of Representing Events, Probability Axioms, Combinatorial Problems, Conditional Probability, Independence of Events, Bayes Rule, Bernoulli Trials Chapter 2 : Random Variables 6 Hours Random Variables and their event spaces, PMF, Distribution functions, Probability generating function, exponential distribution, reliability, failure density and hazard function. Chapter 3 : Expectation 6 Hours Moments, Expectation of Functions, Transform Methods, Moments and Transforms of Some Important distributions, computation of mean time to failure. Chapter 4 : Conditional Distribution and Expectation 6 Hours Mixture distributions, conditional expectations, Imperfect fault coverage and reliability, random sums.

Part B Chapter 5 : Stochastic Processes 6 Hours Classification of Stochastic Processes, The Poisson Process, Renewal Process, Availability Analysis, Random Incidence, Renewal Model of Program Behavior Chapter 6 : Markov Chains 12 Hours Discrete Parameter Markov Chains, Computation of n-step probabilities, state classification and limiting distributions, distribution of times between state changes, Irreducible finite chains with aperiodic states, M/G/1 queueing system, discrete parameter birth death processes, Continuous parameter markov chains birth and death process, non-birth-death process, markov chains with absorbing states. Chapter 7 : Network of Queues 6 Hours Open queuing Networks, Closed Queuing Networks, Nonexponential service time distributions and multiple job types, non product form networks. References :

1. K S Trivedi, Probability & Statistics with Reliability, Queuing, and Computer Science Applications, PHI.

2. Sheldon M Ross, Introduction to Probability Models, Elsevier Press. 3. Paul J Fortier and Howard E Michel, Computer Systems Performance Evaluation and

Prediction, Elsevier Press. 4. A Papoulis and S Unnikrishna Pillai, Probability, Random Variables and Stochastic

Processes, McGrawHill, 4th Edition.

5. Richard A Johnson, Probability and Statistics for Engineers, Pearson Education.

28

2K6CIL 56 : COMPUTER GRAPHICS LAB

(Regular Laboratory with Mini Project)

Hours per week : 3 Examination Marks : 100 Sessional Marks : 25 In this laboratory the students has to write and execute programs in C/C++ like

1. Program to draw a line using Bresenhams algorithm for all quadrants.

2. Program to draw a circle.

3. Program to draw an ellipse.

4. Program to draw a spiral using Bresenhams circle drawing algorithm.

5. Procedure to move a line around the circle.

6. Procedure to rotate a wheel.

7. Procedure to perform transformation on a rectangle (translate, scale and rotate).

8. Program to show 2D clipping and windowing.

9. Segmentation.

10. Program to Implement 3D Rotation with respect to x, y and z axes.

11. Program to fill a polygon using scan line area filling algorithm

12. Program to Implement Hermite and Bezier curves for a given set of control points

As a part of the Mini Project the student has to integrate all the programs and develop a 2D graphics package.

Note : The evaluation of the student is based on the program execution and viva on the 2D package.

2K6CSL 57 : PC PROGRAMMING LABORATORY

(Regular Laboratory)

Hours per Week : 3 Examination Marks : 100 Sessional Marks : 25

Programs in Assembly language/C illustrating the access to various PC subsystems are to be developed and executed on the PC. Typical programs would include

Command line processing

PSP access and processing

File/Directory operations

Use of mouse driver

Reading keyboard

Displaying data

Printing data

Use of BIOS video calls

Use of arithmetic coprocessor to compute area of a circle, solve a quadratic equation

Read/Display floating point numbers

TSR and Hot key demonstration

Use of memory related and DPMI services of BIOS/DOS.

29

2K6CIL 58 : ALGORITHMS LABORATORY

(Regular Laboratory)

Hours per week : 3 Examination Marks : 100 Sessional Marks : 25 Problems on :

Greedy Technique

Kruskals algorithm

Prims algorithm

Shortest path, Scheduling

Sorting and Searching

Time and space complexity of Binary Search, Linear Search

Quick Sort, Merge Sort, Selection Sort, Heap Sort

Trees AVL Trees, BST

Dynamic Programming :

Knapsack problem

Floyds algorithm. Warshalls Algorithm

DFS & BFS Searches

N Queens problem

Assignment problem :

Travelling Sales Person Problem.

30

BE VI SEMESTER COMPUTER SCIENCE & ENGINEERING

2K6CI 61 : COMPUTER NETWORKS II Note :



Part A

Chapter 1 : Introduction 12 Hours Overview of Computer Networks, Network hardware and software, Reference model-OSI and TCP/IP and their comparison. Network layer design issues, Various routing algorithms congestion control algorithm. Internetworking The networking layer in the internet. Chapter 2 : Transport Layer and Application Layer 12 Hours The transport services, Elements of transport protocols, A simple transport protocol. The internet transport protocols (TCP and UDP). Domain name system The DNS name space, Resource space, Resource records and Name servers.

Part B

Chapter 3 : Network Management Protocol 8 Hours Simple network management protocol The SNMP model, Abstract syntax notation, Structure of management information, Management information base, The SNMP protocol. The Electronic mail Architecture and services, the user agent, message formats and message transfer, Email privacy. Usenet News User view of usenet and usenet implementation. Chapter 4 : Web and Multimedia 8 Hours The world wide web client and server side of www, HTML and webpages, JAVA langauge, Locating on the web. Multimedia Audio & Video, Data compression, Vedio on demand, Multicast backbone. Chapter 5 : Security 8 Hours Introduction, Cryptography and Cryptanalysis, Public Key Cryptography Algorithms, RSA Algorithm, DES, Authentication and Authorization. References :

1. A S Tanenbaum, Computer Networks, Fourth Edition, PHI. 2. W Stallings, Data and Computer Communications, Fifth Edition, PHI. 3. S Keshav, An Engineering Approach to Computer Networking, Addison-Wesely. 4. Stevens, UNIX Network Programming, PHI.

31

2K6CI 62 : DATABASE MANAGEMENT SYSTEMS Note :



Part A Chapter 1: Introduction to DBMS 6 Hours Introduction to DBMS with Examples, File System Vs DBMS, People who deal with databases, Intended uses of a DBMS, Implications of the Database Approach. Data models, Schemas and instances, DBMS Architecture and data independence, Database languages and Interfaces, The database system environment, Classification of Database Management Systems.

Chapter 2: Conceptual Design and the ER Models 6 Hours Overview of Database design, ER model concepts, Notation for ER diagrams, Proper naming of schema constructs, Examples. Chapter 3: Relational Model and Relational Algebra 6 Hours Relational model concepts, Constraints, Update operations on Relations and dealing with constraints violations; Relational Algebra, Relational algebra operations and Queries in the Relational Algebra; Mapping ER model to Relations.

Chapter 4: SQL 6 Hours SQL Standards; SQL92; Data definition, Queries, Update statements, Views and Assertions in SQL.

Part B Chapter 5: Database Design-I 6 Hours Informal design guidelines for Relational Schemas, Functional dependencies, Normal Forms based on primary keys, Generalized definitions of 2NF and 3NF; BCNF.

Chapter 6: Database Design-II 6 Hours Algorithms for Relational Database Schema design, Multi-valued Dependencies and 4NF. Join dependencies and 5NF. Inclusion dependencies, Template dependencies, DKNF. Chapter 7: Examples of Commercial Database Systems 6 Hours ORACLE: Architecture, Languages and interfaces, Embedded SQL. MS ACCESS: Architecture, Overview of the features. Chapter 8: Emerging Technologies 6 Hours Data Warehousing, Data mining, WWW databases, Text and Digital library data bases, Multimedia databases, Parallel databases, Mobile databases. References :

1. Elmasri and Navathe, Fundamentals of Database Systems, Foruth Edition, Addison - Wesley 2. Raghu Ramakrishnan, Database Management Systems, McGraw Hill.

32

2K6CI 63: SYSTEM SOFTWARE Note :

FOUR questions from Part A and FOUR questions from part B to be set. Students should answer FIVE question selecting at least TWO from each part. For every SIX hours of syllabus ONE question may be set.


Part A Chapter 1 : Editors 6 Hours Overview of editing process, Definition, Line editors, Screen editors, Graphics editors, Data structures, Implementation, Word Processors, Desktop publishing software, User Interface. Chapter 2 : Machine Architecture and Assemblers 12 Hours Introduction, System software and machine architecture, Simplified Instructional Computers (SIC), SIC Machine Architecture, SIC/XE Machine Architecture, SIC Programming Examples, Traditional (CISC) Machines, VAX Architecture, Pentium Pro Architecture, RISC Machines, Ultra SPARC Architecture, Power PC Architecture, Cray T3E Architecture, Assembler : Definition, A Simple SIC Assembler, Assembler Algorithm & Data Structures, Machine-Dependent Assembler Features, Instruction Formats and Addressing modes, Program Relocation, Machine-Independent Assembler Features, Literals, Symbol-Definition Statements, Expression, Program blocks, Control Sections and Programming Linking, Assembler Design Options, One-pass Assembler, Two-Pass Assembler, Implementation Examples, MASM Assembler, SPARC Assembler, AIX Assembler. Chapter 3 : Compilers 6 Hours Compilers, Analysis of the source program, The phases of a compiler, Cousins of the compiler, The grouping of phases, Compiler-construction tools. The role of the lexical analyzer, Input buffering, Specification of tokens, Recognition of tokens, A language for specifying lexical analyzers, Design of a lexical analyzer generator.

Part B Chapter 4 : Loaders and Linkers 12 Hours Basic Loader Functions, Design of an Absolute Loader, A Simple Bootstrap Loader, Machine-Dependent Loader Features, Relocation, Programming Linking, Algorithm and Data Structures for a Linking Loader, Machine-independent, Loader Features, Automatic Library Search, Loader Options, Linkage Editor, Dynamic Linkage, Bootstrap Loaders, Implementation Examples, MS_DOS Linker, SunOS Linker, Cray MPP Linker. Chapter 5 : Macro Processor and Simulator 12 Hours Basic Macro Processor Functions, Macro Definition and Expansion, Macro Processor Algorithm & Data Structures, Machine-Independent Macro Processor Features, Concentration of Macro Parameters, Generation of Unique Labels, Conditional Macro Expansion, Keyword Macro Parameter, Macro Processor Design Options, Recursive Macro Expansion, General-purpose Macro Processors, Macro Processing within Language Translators, Implementation Examples, MASM Macro Language, ANSI C Macro Language, The ELENA Macro Processor. Introduction, Definition of Emulator, Definition of Simulator, Working, Data Structures, Implementation. References :

1. Leland L Beck, System Software, Third Edition, Addison-Wesley. 2. Glenn H MacEwen, Introduction to Computer System using PDP-11 and Pascal, McGrawHill. 3. G Michael Schrider, Principles of Computer Organization, PHI.

33

2K6CS 64 : ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING



Part A

Chapter 1 : Introduction 12 Hours Artificial Intelligence: Its scope, history and applications, AI as representation and search. The predicate calculus- inference rules. A logic based financial advisor. Structures and strategies for state space search- graph theory, strategies for space search, using state space to represent reasoning with the predicate calculus. Chapter2 : Heuristic Search 6 Hours Heuristic search - An algorithm for heuristic search. Admissibility, monotonicity and informedness. Heuristics in games. Complexity issues. Control and implementation of state space search - Recursion based search, pattern directed sesarch, production systems, predicate calculus and planning, the black board architecture for problem solving. Chapter3 : Knowledge Based Systems 6 Hours Knowledge - intensive problem solving - Overview of expert system technology. Rule based expert systems. Model - based reasoning, Case - based reasoning. The knowledge representation problem. Reasoning with uncertain or incomplete information - The statistical approach to uncertainity. Non - monotonic systems. Reasoning with fuzzy sets.

Part B

Chapter 4 : Knowledge Representation and LISP 12 Hours Knowledge representation - languages. Issues in knowledge representation. A survey of network representation. Conceptual graphs. A network representation language. Structured representations. Further issues in knowledge representation. Introduction to LISP - Search in LISP: A functional approach to the farmer, wolf, goat and cabbage problem. Higher - order functions and procedural abstraction. Search strategies in LISP. A recursive Unification function. Interpreters and embedded languages. Logic programming in LISP. Streams and delayed evaluation. An expert system shell in LISP. Chapter 5 : Automated Reasoning 12 Hours Automated reasoning - Weak methods in theorem proving. The general problem solver and difference tables. Resolution theorem proving. Further issues in automated reasoning. Machine learning: Connectionist - Foundations for connectionist networks, preception learning, backpropagation learning. Competitive learning. Hebbian coincidence learning. Attractor networks or memories. Machine learning: social and emergent - models; the genetic algorithm. classifier systems and genetic programming. Artifical life and society based learning. References :

1. G. F. Luger and W. A. Stubblefield, Artificial Intelligence - Structures and Strategies for Complex Problem Solving, Third Edition, Addison-Wesely.

2. P. H. Winston, Artificial Intelligence, Third Edition, Addision-Wesely. 3. E. Rich and Knight, Artificial Intelligence, Second Edition, TMH.

34

2K6CI 65 : UNIX/LINUX SYSTEM PROGRAMMING Note :


Hours per Week : 4 Examination Marks: 100 Sessional Marks 25

Part A Chapter 1 : Introduction 06 Hours Unix and ANSI Standards: The ANSI C Standard, The ANSI/ISO C++ Standards, Difference between ANSI C and C++, The POSIX Standards, The POSIX.1 FIPS Standard, The X/Open Standard. UNIX and POSIX APIs: The POSIX APIs. The UNIX and POSIX Development Environment, API Common Characteristics. Chapter 2 : UNIX Files 12 Hours File Types, The UNIX and POSIX File System. The UNIX and POSIX File Attributes, Inodes in UNIX System V, Application Program Interface to Files, UNIX Kernel Support for Files, Relationship of C Stream Pointers and File Descriptors, Directory Files, Hard and Symbolic Links. UNIX File APIs: General File APIs, File and Record Locking, Directory File APIs, Device File APIs, FIFO File APIs, Symbolic Link File APIs, General File Class, regfile Class for Regular Files, dirfile Class for Directory Files, FIFO File Class, Device File Class, Symbolic Link File Class, File Listing Program. Chapter 3 :UNIX Processes 06 Hours The Environment of a UNIX Process: Introduction, main function, Process termination, Command-line arguments, Environment List, Memory layout of a C Program, Shared Libraries, Memory Allocation, Environment Variables, setjmp and longjmp Functions, getrlimit, setrlimit Functions, UNIX Kernel Support for Processes.

Part B Chapter 4: Process Control 06 Hours Introduction, Process Identifiers, fork, vfork, exit, wait, waitpid, wait3, wait4 Functions, Race Conditions, exec Functions, Changing User IDs and Group IDs, Interpreter Files, System Function, Process Accounting, User Identification, Process Times, I/O Redirection.

Chapter 5 : Process Relationships 06 Hours Introduction, Terminal Logins, Network Logins, Process Groups, Sessions, Controlling Terminal, tcgetpgrp and tcsetpgrp Functions, Job Control, Shell Execution of Programs, Orphaned Process Groups. Chapter 6 : Signals, Daemons and IPC 12 Hours Signals: The Unix Kernel Support for Signals, Signal, Signal Mask, Sigaction, The SIGCHLD Signal and the waitpid Function, The sigsetjmp and siglongjmp Functions, Kill, Alarm, Interval Timers, POSIX.1b, Timers. Daemon Processes: Introduction, Daemon Characteristics, Coding Rules, Error Logging, Client Server Model. Interprocess Communication: Overview of IPC Methods, Pipes, popen, pclose Functions, Coprocesses, FIFOs, System V IPC, Message Queues, Semaphores, Shared Memory, Client Server Properties, Stream Pipes, Passing File Descriptors, An Open Server Version 1, Client Server Connection Functions. References :

1. Terrence Chan: Unix System Programming Using C++, PHI. 2. W Richard Stevens: Advanced Programming in the Unix Environment, Addison-Wesley/PHI 3. Maurice J Bach: The Design of the Unix Operating System, PHI. 4. Uresh Vahalia: Unix Internals, Pearson Education.

35

2K6CI 66 : SOFTWARE PRACTICE AND TESTING Note : FOUR questions from Part A and FOUR questions from part B to be set.

Students should answer FIVE questions selecting at least TWO from each part. For every SIX hours of syllabus ONE question may be set.

Hours per Week : 4 Examination Marks : 100 Sessional Mark: 25 Part A

Chapter 1 : Introduction 12 Hours Software Practice: Style Names, Expressions and Statements, Consistency and Idioms, Function Macros, Comments. Interfaces: Comma Seperated Values, A Prototype Library, Interface Principles, Resource Management, User Interfaces. Algorithms and Data Structures : Searching, Sorting, Libraries, Growing Arrays, Lists, Trees, Hash Tables, Design and Implementation : The Markov Chain Algorithms, Data Structure Alternatives, Building the Data Structure in C, Generating Output, Performance, Lessons. Performance : A Bottleneck, Timing and Profiling, Strategies for Speed, Tuning the Code, Space Efficiency, Estimation.

Chapter 2 : Software Practice - II 12 Hours Portability : Language, Headers and Libraries, Program Organization, Isolation, Data Exchange, Byte Order, Portability and Upgrade, Internationalization, Notation : Formatting Data, Regular Expressions, Programmable Tools, Interpreters, Compilers and Virtual Machines, Programs that write Programs, Using Macros to generate Code. Debugging Debuggers, Good Clues, Easy Bugs, No Clues, Hard Bugs, Last Resorts, Non Reproducible Bugs, Debugging Tools, Other Peoples Bugs.

Part B Chapter 3 :Software Testing 06 Hours The Six Essentials of Software Testing : The State of the art and state of the practice. The clean sheet approach to getting started, Establishing a practical perspective, critical choices : What, When and how to test Risk and Risk Management, Start testing early, Basic forms of the testing process, Testing the development cycle and the real world of contracts, Effective and cost effective testing. Critical Disciplines : Frameworks for Testing Planning, Software Engineering Maturity and the SEI, Configuration Management, Standards, Formal Documents, Testware, Measurement, Tools.

Chapter 4 : Testing Methods 12 Hours Verification Testing : Basic verification methods, getting leverage on verification, verifying documents at different phases, getting the best from verification, three critical success factors for implementing verification, recommendation. Validation Testing : Validation overview, Validation Methods, Validation Activities, Recommendation Strategies for Validation Testing. Controlling Validation Costs: Minimizing the cost performing tests, Minimizing the cost of maintaining the tests, Minimizing validation testware development costs, Recommendations. Testing Tasks, Deliverables and Chronology : Master test planning, verification testing tasks and deliverables, Validation testing tasks and deliverables, A testing orphan User manuals, Product release criteria, Summary of IEEE/ANSI test related documents. Software Testing Tools : Categorizing testing tools, Tool acquisition. Measurements : Useful and other interesting measures, Recommendations.

Chapter 5 : Managing Testing Technology 06 Hours Organizational Approaches to Testing : Organizing and Reorganizing Testing, Structural Design Elements, Approaches to organizing the test functions, Selecting the right approach. Current Practices, Trends, Challenges : GUIs : What is new here, Usage testing, tester to developer ratios, Software measures and practices benchmark study. Getting Sustainable Gains in Place: Getting gains to happen, Getting Help, Follow up, Verification Check Lists.

References : 1. Brain W Kernighan and Rob Pike : The Practice of Programming, Addison Wesley. 2. Ed Kit : Software Testing in the Real World, Addison Wesley. 3. William Perry : Effective Methods for Software Testing, Jhon Wiely. 4. Bezier B : Software Testing Techniques, II Edition, Van Nstrand Reinluold.

36

2K6CIL 67: LINUX/UNIX PROGRAMMING LABORATORY (Regular laboratory)


Programs illustrating the use of Shell and system calls and library functions are to be developed and executed in UNIX environment.

1. Typical programs would include awk programs (fold long line into 80 columns; calendar service etc.),

2. Bourne shell scripts (calendar service; finding which cmd in path is executed; find links to a file specified as an argument; find information about users given their ids etc.).

3. Korn shell scripts ( write last component of a pathname argument; given a directory name, write maximum of lengths of files in that directory; shell function to list number of regular files, directories etc, rewrite makepaths as a non-recursive function etc.);.

4. C Programs to make use of system calls (use of low-level file I/O operations, create and kill child processes).

5. IPC using pipes, FIFOs, message queues, semaphores, shared memory. 6. Demonstration of deadlocks. 7. Implementation of coprocessor, daemon processes etc.

2K6CIL 68 : SYSTEM SOFTWARE LABORATORY (Programming and Mini Project Laboratory)


Part A Execution of the following programs using LEX:

1. Program to count the number of vowels and consonants in a given string. 2. Program to count the number of characters, words, spaces and lines in a given input file. 3. Program to count number of (i) positive and negative integers (ii) positive and negative

fractions. 4. Program to count the number of comment lines in a given C program. Also eliminate them and

copy that program into separate file. 5. Program to count the number of scanf and printf statements in a C program. Replace them

with readf and writef statements respectively. 6. Program to recognize a valid arithmetic expression and identify the identifiers and operators

present. Print them separately. 7. Program to recognize whether a given sentence is simple or compound. 8. Program to recognize and count the number of indentifiers in a given input file.

Execution of the following programs using YACC: 1. Program to test the validity of a simple expression involving operators +, -, *, and /. 2. Program to recognize nested IF control statements and display the number of levels of

nesting. 3. Program to recognize a valid arithmetic expression that uses operators +, -, * and /. 4. Program to recognize a valid variable, which starts with a letter followed by any number of

letters or digits. 5. Program to evaluate an arithmetic expression involving operators +, -, * and /. 6. Program to recognize strings aabb, ab and a using the grammar (a

nbn, n>=0).

Part B

The students must do one of the following mini projects : (i) 2 pass assembler for the working model of 8086, (ii) Text Editor, (iii) Linux Shell for a set of commands.

37

BE VII SEMESTER COMPUTER SCIENCE & ENGINEERING

2K6CS 71 : ADVANCED COMPUTER ARCHITECTURE Note :



Part A

Chapter 1 : Parallel Computer Architecture 12 Hours The State of Computing, Computer Development Milestones, Elements of Modern Computers, Evolution of Computer Architecture, System Attributes to Performance, Multiprocessors, Multivector and SIMD Computers. Chapter 2 : Program and Network Properties 6 Hours Conditions of Parallelism, Program Partitioning and Scheduling, Program Flow Mechanisms, System Interconnect Architecture. Chapter 3 : Processor and Memory Technologies 6 Hours Advanced Processor Technology, Superscalar and Vector Processor, Backplane Bus System, Shared Memory Organizations.

Part B

Chapter 4 : Pipelining and Superscalar Technologies 6 Hours Linear Pipeline Processors, Non Linear Pipeline Processors, Instruction Pipeline Design, Arithmetic Pipeline Design. Chapter 5 : Multiprocessors and Multi Computers 6 Hours Multiprocessor System Interconnects, Cache Coherence and Synchronization Mechanisms, Message Passing Schemes. Chapter 6 : Parallel Programs 6 Hours Parallel Application Case Studies, The Parallelization Process, Parallelization of an Example Program. Chapter 7 : Scalable Multiprocessors 6 Hours Scalability, Realizing Programming Model. References :

1. Kai Hwang, Advanced Computer Architecture Parallelism, Scalability, Programmability, McGraw Hill.

2. David E Culler, J P Singh, Anoop Gupta, Parallel Computer Architecture, Harcoust Asia and Morgan Kaufmann.

3. John P Hayes, Computer Architecture and Organization, 3rd Edition, McGrawHill.

4. V Rajaraman, C Siva Ram Murthy, Parallel Computers Architecture and Programming, PHI.

38

2K6CI 72 : DATA MINING AND ALGORITHMS



Part A

Chapter 1. Introduction 6 Hours Data Mining, Kinds of Data, Data Mining Functionalities, Classification of Data Mining Systems, Primitives, Major Issues in Data Mining.

Chapter 2. Data Preprocessing 6 Hours Descriptive Data Summarization, Data Cleaning, Data Integration and Transformation, Data Reduction, Data Discretization and Concept Hierarchy Generation. Chapter 3. Data Warehouse and OLAP Technology 6 Hours What is Data Warehouse, A Multidimensional Data Model, Data Warehouse Architecture, Data Warehouse Implementation, From Data Warehouse to Data Mining.

Chapter 4. Mining Frequent Patterns and Associations 6 Hours Basic Concepts, Efficient and Scalable Frequent Itemset Mining Methods, Mining Various Kinds of Association Rules.

Part B

Chapter 5. Classification and Prediction 12 Hours Issues regarding classification and prediction, classification by decision tree induction, Bayesian classification, rule based classification, classification by backpropagation, support vector machines, Lazy Learners, Prediction, Accuracy and Error Measures, Evaluating the Accuracy of a classifier, Ensemble Methods, Model Selection.

Chapter 6. Cluster Analysis 12 Hours Types of Data in Cluster Analysis, A Categorization of Major Clustering Methods, Partitioning Methods, Hierarchical Methods, Density based Methods, Grid based methods, model based clustering methods, Clustering high dimensional data, Constraint based cluster analysis, Outlier analysis. References :

1. Jiawei Han and Micheline Kamber, Data Mining, Concepts and Techniques, Elsevier, II Edition.

2. David Hand, Heikki Mannila, Padhraic Smyth, Principles of Data Mining, PHI. 3. Margaret H Dunham, Data Mining Introductory and Advanced Topics, Pearson Education. 4. K R Venugopal, et al., Data Mining Algorithms, Tata McGraw Hill.

39

2K6CI 73 : INTERNET PROGRAMMING


Hours per Week : 4 Examination Marks 100 Sessional Marks 25

Part A

Chapter 1 : The Common Gate Way Interface (CGI) 6 Hours CGI applications, configuring the server, programming in CGI. Input to the CGI - Environmental variables, accessing from input. Languages under different operating systems. Examinationining environmental variables. Output from CGI - CGI and response headers; Accept types and content types; the context length header; Server redirection; The Expires and Pragma headers. Status codes, complete headers.

Chapter 2 : Forms and CGI 6 Hours HTML tags; sending data to the server; Designing applications using forms in PERL. Decoding forms in other languages. Server Side Includes (SSI) - configuration, environmental variables. Including boilerplates. File statistics. Executing external programs and CGI programs. Tailoring SSI output. Common errors.

Chapter 3 : Hypermedia Documents 6 Hours Creating dynamic pages. CGI Examples with postscript. The gd graphics library. CGI Examples with gnuplot and pgperl. Animation. Advanced form applications - Guestbook, Survey/poll and pie graphs, quiz/test form application. Security.

Chapter 4 : Java 6 Hours Introduction to Java & internet, overview of objects & classes. Data type and control structure in Java.

Part B Chapter 5 : Classes in Java 6 Hours Defining classes in Java, access mechanisms, static variables and static methods. Inheritance in Java. Examples in Java classes. Objects and references. The class hierarchy. General classes and constructors. Java programs. Exceptions - Defining and throwing exceptions, creating exceptions, a data structure for a web crawler.

Chapter 6 : Libraries 6 Hours Documentation of packages, the Java.util package. The vector class and hash table class. The object class and object wrappers. Mixing objects. Abstraction mechanisms - Abstract methods, interfaces packages. Threads - Creating threads, suspend and resume methods, threads priorities, problem with shared objects, the circular buffer.

Chapter 7 : Input and Output 6 Hours The class print stream, data streams, string tokenizer class. Stream tokenizer. Human Computer Interface (HCI) and Java - overview of AWT, HCI elements, containers and layouts, control elements, the event system, graphics.

Chapter 8 : Applets 6 Hours Applet methods. Drawing and handling events. Threads in applets. Interface to the applet. Double buffering. Network Programming - The URL, Socket and Serversocket classes. The common protocol. Writing a server. Writing an applet.

References : 1. Shishir Gundavaran, CGI programming on The World Wide Web, O'Reilly & Associates. 2. Thomas Boutel, CGI programming in C and Perl, Addison Wesley. 3. Darrel Ince and Adam Freeman, Programming the Internet With Java, Addison Wesley. 4. KenArnold and James Gosling, The Java Programming Language, Addison Wesley. 5. Venugopal K R et al., Mastering Java, TMH.

40

2K6CIL 75 : NETWORKING LABORATORY (Programming and Mini Project Laboratory)


Part A

1. Write a C/C++ Program for frame sorting technique using in buffer.

2. Write a C/C++ Program to implement MLMA collision free protocol.

3. Write a C/C++ Program for transmission flow control protocol Goback N or Selective Repeat.

4. Write a C/C++ Program to find the shortest path in a network of 6 to 10 nodes.

5. Write a C/C++ Program for Private Key encryption using DES 64 bit Key.

6. Using NS2, Simulate ALOHA and compare the performance.

7. Using NS2, Simulate Token Ring Protocol

8. Using NS2, Simulate CSMA/CD

9. Using NS2, Simulate X.25 and Frame Relay

10. Using NS2, Simulate Store and Forward Mechanism

Part B

The Student has to develop one Mini project like :

a) Simulate the client side for FTP in a UNIX network. Implement as many functions as possible. Testing may be done using the FTP server on the operating system.

b) Develop a spooler program to print files on a printer connected to a different machine on the UNIX network.

c) Develop programs for remote login facility / remote command execution.

d) Packet switching

e) UDP

f) TCP

g) Telnet

h) 802.11

i) HTTP

j) ARP / RARP / DHCP

k) ATM IPV4 to IPV6

l) Firewall

m) GPS

n) SMTP

o) SNMP

p) RSA / DES

q) Blue tooth

r) Internet Phone

Note : The evaluation is based on Execution of any one Part A Program and demonstration of Mini

Project. The student has to submit a report to the examiner.

41

2K6CIL 76 : DBMS LABORATORY (Programming and Mini Project Laboratory)


Part A

I. Consider the Insurance database given below. The primary keys are underlined and the datatypes are specified.

PERSON (driver id #: String, name: string, address: string)

CAR (Regno: string, model: string, year: int)

ACCIDENT (report-number: int, date: date, location: string)

OWNS (driver-id #:string, Regno:string)

PARTICIPATED (driver-id: string, Regno:string, report-number:int, damage amount:int)

(i) Create the above tables by properly specifying the primary keys and the foreign keys.

(ii) Enter atleast five tuples for each relation.

(iii) Demonstrate how you

a. Update the damage amount for the car with a specific Regno in the accident with report number 12 to 25000.

b. Add a new accident to the database.

(iv) Find the total number of people who owned cars that were involved in accidents in 2002.

(v) Find the number of accidents in which cars belonging to a specific model were involved.

(vi) Generation of suitable reports.

(vii) Create suitable front end for querying and displaying the results.

II. Consider the following relations for an order processing database application in a company.

CUSTOMER (cust #: int , cname: string, city: string)

ORDER (order #: int, odate: date, cust #: int, ord-Amt: int)

ORDER ITEM (order #: int, Item #: int, qty: int)

ITEM (item # : int, unit price: int)

SHIPMENT (order #: int, warehouse#: int, ship-date: date)

WAREHOUSE (warehouse #: int, city: string)



(iii) Produce a listing: CUSTNAME, #oforders, AVG_ORDER_AMT, where the middle column is the total numbers of orders by the customer and the last column is the average order amount for that customer.

(iv) List the order# for orders that were shipped from all the warehouses that the company has in a specific city.

(v) Demonstrate how you delete item# 10 from the ITEM table and make that field null in the ORDER_ITEM table.

(vi) Generation of suitable reports.

(vii) Create suitable front end for querying and displaying the results.

42

III. Consider the following database of student enrollment in courses & books adopted for each course.

STUDENT (regno: string, name: string, major: string, bdate:date)

COURSE (course #:int, cname:string, dept:string)

ENROLL ( regno:string, course#:int, sem:int, marks:int)

BOOK _ ADOPTION (course# :int, sem:int, book-ISBN:int)

TEXT (book-ISBN:int, book-title:string, publisher:string, author:string)



(iii) Demonstrate how you add a new text book to the database and make this book be adopted by some department.

(iv) Produce a list of text books (include Course #, Book-ISBN, Book-title) in the alphabetical order for courses offered by the CS department that use more than two books.

(v) List any department that has all its adopted