Difference between revisions of "Syllabus Review/VTU/BE/Information Science and Engineering"

<center>'''(With effect from 2006-2007)'''</center>

<center>'''Information Science and Engineering'''</center>

|-

|-

|}

<center>(Hrs)</center>

|-

|}

|}

|-

|-

|-

|-

|-

|-

|-

|-

|-

| -

<center>'''VISVESVARAYA TECHNOLOGICAL UNIVERSITY, BELGAUM'''</center>

|-

|-

|}

<center>'''(Hrs)'''</center>

|-

|}

|}

|-

|-

|-

|-

|-

|-

|-

|-

|-

|}

= Elective I – Group A =

06IS662/06CS62 Compiler Design

06IS665/06CS65Computer Graphics and Visualization

|-

|-

|}

<center>'''(Hrs)'''</center>

|-

|}

|}

|-

|-

|-

|-

|-

|-

|-

|-

|-

|}

= Elective II – Group BElective III – Group C =

06CS74/06IS752 Embedded Computing Systems06CS762 Digital Image Processing

06CS756 Neural Networks06CS766Fuzzy Logic

|-

|-

|}

|-

|}

|-

|-

|-

|-

|-

|-

|-

|}

= Elective IV – Group DElective V– Group E =

06CS832 Web 2.0 06CS842 Information Retrieval  

'''V SEMESTER'''

=== Subject Code: 06CS51 I.A. Marks : 25 ===

Basic Loader Functions - Design of an Absolute Loader, A Simple Bootstrap Loader, Machine-Dependent Loader Features – Relocation, Program Linking, Algorithm and Data Structures for a Linking Loader; Machine-Independent Loader Features - Automatic Library Search, Loader Options, Loader Design Options - Linkage Editor, Dynamic Linkage, Bootstrap Loaders, Implementation Examples - MS-DOS Linker, Sun OS Linker, Cray MPP Linker.

Using YACC – Grammars, Recursive Rules, Shift/Reduce Parsing, What YACC Cannot Parse, A YACC Parser - The Definition Section, The Rules Section, Symbol Values and Actions, The LEXER, Compiling and Running a Simple Parser, Arithmetic Expressions and Ambiguity, Variables and Typed Tokens.

'''Text Books:'''

(Chapters 1, 2 (Page 27-42), 3 (Page 51-65))

Tata McGraw - Hill, 1999.  

=== Subject Code: 06CS52 I.A. Marks : 25 ===

What operating systems do; Computer System organization; Computer System architecture; Operating System structure; Operating System operations; Process management; Memory management; Storage management; Protection and security; Distributed system; Special-purpose systems; Computing environments.

Process concept; Process scheduling; Operations on processes; Inter-process communication.

Multi-Threaded Programming: Overview; Multithreading models; Thread Libraries; Threading issues.

Deadlocks: System model; Deadlock characterization; Methods for handling deadlocks; Deadlock prevention; Deadlock avoidance; Deadlock detection and recovery from deadlock.

Virtual Memory Management: Background; Demand paging; Copy-on-write; Page replacement; Allocation of frames; Thrashing.

File System:''' '''File concept; Access methods; Directory structure; File system mounting; File sharing; Protection.

2. Harvey M Deital: Operating systems, 3^rd Edition, Addison Wesley, 1990.  

Data models, schemas and instances; Three-schema architecture and data independence; Database languages and interfaces; The database system environment; Centralized and client-server architectures; Classification of Database Management systems.  

SQL Data Definition and Data Types; Specifying basic constraints in SQL; Schema change statements in SQL; Basic queries in SQL; More complex SQL Queries.  

The ACID Properties; Transactions and Schedules; Concurrent Execution of Transactions; Lock- Based Concurrency Control; Performance of locking; Transaction support in SQL; Introduction to crash recovery; 2PL, Serializability and Recoverability; Lock Management; Introduction to ARIES; The log; Other recovery-related structures; The write-ahead log protocol; Checkpointing; Recovering from a System Crash; Media Recovery; Other approaches and interaction with concurrency control.

(Chapters 16, 17.1, 17.2, 18)

# Silberschatz, Korth and Sudharshan: Data base System Concepts,'' ''5^th Edition, Mc-GrawHill, 2006.

== Hours/Week : 04 Exam Hours: 03 ==

# Evolution of Network Architecture and Services; Future network architectures and their services; Key factors in communication network evolution.  

Digital Representation of Information: Block-Oriented Information, Stream Information; Why Digital Communications ? Comparison of Analog and Digital Transmission , Basic properties of Digital Transmission Systems; Digital Representation of Analog Signals: Bandwidth of Analog Signals, Sampling of an Analog Signal, Digital Transmission of Analog Signals; Characterization of Communication Channels: Frequency Domain Characterization, Time Domain Characterization; Fundamental Limits in Digital Transmission: The Nyquist Signaling Rate, The Shannon Channel Capacity; Line Coding.

Modems and Digital Modulation: Binary Phase Modulation, QAM and Signal Constellations, Telephone Modem Standards;''' '''Properties of Media and Digital Transmission Systems: Twisted Pair, Coaxial Cable, Optical Fiber, Radio Transmission, Infrared Light; Error Detection and Correction: Error Detection, Two Dimensional Parity Checks, Internet Checksum, Polynomial Codes, Standardized Polynomial Codes, Error Detecting Capability of a Polynomial Code.

Multiplexing: Frequency Division Multiplexing, Time Division Multiplexing, Wavelength-Division Multiplexing; SONET: SONET Multiplexing, SONET Frame Structure; Transport Networks: SONET Networks, Optical Transport networks; Circuit Switches: Space Division Switches, Time Division Switches; The Telephone Network: Transmission Facilities, End to End Digital Services; Cellular telephone networks.

LAN Protocols: LAN Structure , The Medium Access Control Sublayer, The Logical Link Control Sublayer; Ethernet and IEEE 802.3 LAN Standard: Ethernet Protocol, Frame structure, Physical Layers, Fast Ethernet ,Gigabit Ethernet, 10 Gigabit Ethernet; Token Ring and IEEE 802.5 LAN Standard: Token-Ring Protocol, Frame structure; FDDI; Wireless LANs and IEEE 802.11 Standard: Ad hoc and Infrastructure Networks, Frame structure and addressing, Medium Access Control; LAN Bridges and Ethernet Switches: Transparent Bridges, Source Routing Bridges, Mixed-Media Bridges, Virtual LANs.

( Chapters 1, 2.1 to 2.3, 2.5, 3.1 to 3.9 except 3.3.4, 3.9.7 and 3.9.8 , 4.1 to 4.5, 4.8, 5, 6.1 to 6.4, 6 except 6.10.4)  

5. Nader F. Mir: Computer and Communication Networks, Pearson Education, 2007.

=== Subject Code: 06CS55 I.A. Marks : 25 ===

Introduction to Finite Automata; The central concepts of Automata theory; Deterministic finite automata; Nondeterministic finite automata.

An application of finite automata; Finite automata with Epsilon-transitions;  

Regular expressions; Finite Automata and Regular Expressions; Applications of Regular Expressions.  

Regular languages; Proving languages not to be regular languages; Closure properties of regular languages; Decision properties of regular languages; Equivalence and minimization of automata.

Context –free grammars; Parse trees; Applications; Ambiguity in grammars and  

'''5. Pushdown Automata7 Hrs'''

Problems that Computers cannot solve; The turning machine; Programming techniques for Turning Machines; Extensions to the basic Turning Machines; Turing Machine and Computers.  

A Language that is not recursively enumerable; An Undecidable problem that is RE; Post’s Correspondence problem; Other undecidable problems.  

2. John C Martin: Introduction to Languages and Automata Theory, 3^rd Edition, Tata McGraw-Hill, 2007.

4. Thomas A. Sudkamp: An Introduction to the Theory of Computer Science, Languages and Machines, 3^rd Edition, Pearson Education, 2006

=== Subject Code: 06CSL57 I.A. Marks : 25 ===

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

OWNS (driver-id <nowiki>#:string</nowiki>, Regno:string)

# Create the above tables by properly specifying the primary keys and the foreign keys.

# Enter at least five tuples for each relation.

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

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

# Generate suitable reports.

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

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

# Create the above tables by properly specifying the primary keys and the foreign keys.

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

# Generate suitable reports.

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

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

# Create the above tables by properly specifying the primary keys and the foreign keys.

# Enter at least five tuples for each relation.

# 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.

# List any department that has ''all'' its adopted books published by a specific publisher.

# Generate suitable reports.

IV. The following tables are maintained by a book dealer.

CATEGORY (category-id:int, description:string)

# Create the above tables by properly specifying the primary keys and the foreign keys.

# Give the details of the authors who have 2 or more books in the catalog and the price of the books is greater than the average price of the books in the catalog and the year of publication is after 2000.

# Demonstrate how you increase the price of books published by a specific publisher by 10%.

# Generate suitable reports.

BRANCH(branch-name:string, branch-city:string, assets:real)

LOAN(loan-number:int, branch-name:string, amount:real)

# Create the above tables by properly specifying the primary keys and the foreign keys

# Demonstrate how you delete all account tuples at every branch located in a specific city.

# Generate suitable reports.

# The exercises are to be solved in an RDBMS environment like Oracle or DB2.

# The student need not create the front end in the examination. The results of the queries may be displayed directly.

# Relevant queries other than the ones listed along with the exercises may also be asked in the examination.

=== Subject Code: 06CSL58 I.A. Marks : 25 ===

5. a. Obtain the Topological ordering of vertices in a given digraph.

6. Implement 0/1 Knapsack problem using dynamic programming.

algorithm.

b. Check whether a given graph is connected or not using DFS method.  

'''Note: In the examination questions must be given based on lots. '''

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 Standards.  

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.

'''3. UNIX File APIs 7 Hrs'''