With effect from academic year 2012-13

11CS201CV MATHEMATICAL FOUNDATIONS OF COMPUTER

SCIENCE(Common to CSE & IT)

Instruction : 3 periods/week End Examination : 75 MarksTutorial : 1 period /Week Duration : 3 hoursCredits : 3 Sessional marks : 25UNIT-I Mathematical Logic : Statements and notations, Connectives, Well formed formulas, Truth Tables, tautology, equivalence implication, Normal forms, Quantifiers, universal QuantifiersUNIT-II Predicates : Predicative logic, Free & Bound variables, Rules of inference, Consistency, proof of contradiction, Automatic Theorem Proving. UNIT-III Relations: Properties of binary Relations, equivalence, Transitive closure, compatibility and partial ordering relations, lattices, Hasse diagram. Functions: Inverse Function Composition of functions, recursive Functions, Lattice and its Properties . UNIT-IV Algebraic structures : Algebraic systems Examples and general properties, Semi groups and monads, groups sub groups homomorphism, Isomorphism. UNIT-V Elementary Combinatorics: Basis of counting, Combinations & Permutations, with repetitions, Constrained repetitions, Binomial Coefficients, Binomial Multinomial theorems, the principles of Inclusion- Exclusion. Pigeon hole principles and its application UNIT-VI Recurrence Relation : Generating Functions, Function of Sequences Calculating Coefficient of generating function, Recurrence relations, Solving recurrence relation by substitution and Generating funds. Characteristics roots solution of in homogeneous Recurrence Relation. UNIT-VII Graph Theory : Representation of Graph, DFS, BFS, Spanning Trees, planar Graphs UNIT-VIII Graph Theory and Applications, Basic Concepts Isomorphism and Sub graphs, Multi graphs and Euler circuits, Hamiltonian graphs, Chromatic Numbers .TEXT BOOKS : 1. Discrete and Combinational Mathematics- An Applied Introduction 5th Edition - Ralph. P.Grimaldi. Pearson Education2. Discrete mathematics for computer scientists & mathematicians JL Mott, A Kandel, TP Baker PHI.

REFERENCES :

1. Elements of Discrete Mathematics-A computer oriented approach CL Liu, D P mohapatra, 3rd ed TMH 2 Discrete Mathematics and its Applications, Kenneth H. Rosen, Fifth Edition.TMH. 3. Discrete Mathematics with Applications, Thomas Koshy, Elsevier

With effect from academic year 2012-1311CS202CV

DATASTRUCTURES THROUGH C++

(Common to CSE & IT)Instruction : 4 periods/week End Examination : 75 MarksTutorial : 1 Period/Week Duration : 3 hoursCredits : 4 Sessional marks : 25Unit I : C++ Class Overview- Basic OOP concepts, Class Definition, Objects, Class Members, Access Control, Class Scope, Constructors and destructors, parameter passing methods, Inline functions, static class members, this pointer, friend functions, dynamic memory allocation and deallocation (new and delete), exception handling.Unit II : Function Over Loading, Operator Overloading, Generic Programming- Function and class templates, Inheritance basics, base and derived classes, inheritance types, base class access control, runtime polymorphism using virtual functions, abstract classes. Unit III : Algorithms, performance analysis- time complexity and space complexity. Review of basic data structures- The list ADT, Stack ADT, Queue ADT, Array and linked list Implementations using template classes in C++. Trees – Basic terminology, Binary tree ADT, Array and linked representations, traversals, threaded binary treesUnit IV : Dictionaries, linear list representation, skip list representation, operations insertion, deletion and searching, Hashing-hash table representation, hash functions, collision resolution-separate chaining, open addressing-linear probing, quadratic probing, double hashing, rehashing, extendible hashing, comparison of hashing and skip lists. Unit V : Priority Queues- Definition, ADT, Realizing a Priority Queue using Heaps, Definition, insertion, Deletion, Heap sort, External Sorting- Model for external sorting, Multiway merge, Polyphase merge. Unit VI : Search Trees (Part1):Binary Search Trees, Definition, ADT, Implementation, Operations- Searching, Insertion and Deletion, AVL Trees, Definition, Operations Insertion and Searching Unit VII : Search trees (part II) : B-Trees, Definition, B-Tree of order m, insertion, deletion and searching, Comparison of Search Trees Graphs: Basic terminology, representations of Graphs, Graph search methods DFS, BFS. Unit VIII : Text Processing : Pattern matching algorithms-Brute force, the Knuth-Morris-Pratt algorithm, Standard Tries, Compressed Tries, Suffix tries. TEXT BOOKS : 1. C++ Complete reference by Herberbert Schildt ,4th Edition, TMH2. Data structures, Algorithms and Applications in C++, S.Sahni, 2nd edition, Mc Grawhill.

3. Data structures and Algorithms in C++, Michael T.Goodrich, R.Tamassia and D Mount, Wiley student edition, Seventh edition, John Wiley and Sons. REFERENCES : 1. Data structures and Algorithm Analysis in C++, Mark Allen Weiss, Pearson Education. Ltd., Second Edition. 2. Data structures and algorithms in C++, 3rd Edition, Adam Drozdek, Cengage 3. Data structures using C++, D S malik,Cengage learning,India Edition.

4. Data structures with C++, Using STL, 2Nd edition , W.H. Ford and W.R. Troop Pearson/PHI.

With effect from academic year 2012-1311CS231CV

DATA STRUCTURES THROUGH C++ LAB(Common to CSE & IT)

Practical : 3 periods/week End Examination : 50 MarksCredits : 2 Duration : 3 hours

Sessional marks : 25Week1 Execute following C language programs using GDB. a) Sorting b)SearchingWeek2Execute following C language programs using GDB. a)Linked List b) Binary TreeWeek3Write C++ programs to demonstrate the followinga) class scope b) Constructors c) Destructors d)In line functions e) static membersWeek 4Write C++ programs to demonstrate the following a) Dynamic memory management b) Friend functions c)exception handling Week 5Write C++ programs to demonstrate the following a)Overloading b) Function & Class templatesWeek 6Write C++ programs to demonstrate the following

a) All inheritance types b) run time polymorphism using virtual functions and abstract classes

(Note: use Template for all remaining programs)Week 7Write C++ programs to implement the following using an arrays. a) Stack ADT b) Queue ADT Week 8Write C++ programs to implement the following using linked lists. a) Stack ADT b) Queue ADT Week 9Write a C++ program to implement binary search tree operations: a) Insert an element .b) Delete an element. c) Search for a key element. Week 10Write C++ programs to traverse the given binary tree in

a) Preorder b) inorder and c) postorder. Week 11Write a C++ program to implement all the functions of a dictionary (ADT) using hashing.Week 12-.Write C++ programs for the implementation of Knuth-morris pratt pattern matching

Additional programs1. Write C++ program to implement prority queue operations.2. Write C++ program to implement AVL trees.3. Write C++ program to implement B Trees.

REFERENCES : 1. Data structures a pseudo code approach with c++ , Indian edition, R.F.Gilberg and B.A.Forouzan Cengage Learning. 2. Programming Prinicples and Practice using C++, B.Stroustrup, Pearson Education3. Data Structures and Algorithms in C++, Third Edition, Adam Drozdek, Thomson. 4. Data Structures using C++, D.S. Malik, Thomson .

With effect from academic year 2012-1311CS251CV

COMPUTER ORGANIZATION (Common to CSE & IT)

Instruction : 3 periods/week End Examination : 75 MarksTutorial : 1 Period/Week Duration : 3 hoursCredits : 3 Sessional marks : 25UNIT-IBasic structure of computers: computer Types, Functional unit, Basic OPERATIONAL concepts, Bus structures, Software, Performance, Multiprocessors and multi

computers. Data Representation. Fixed Point Representation. Floating – Point Representation. Error Detection codes, Computer Arithmetic: Multiplication and Division Algorithms.UNIT-IIREGISTER TRANSFER LANGUAGE AND MICROOPERATIONS: Register Transfer language. Register Transfer Bus and memory transfers, Arithmetic Micro operations, shift micro operations, Arithmetic logic shift unit, Instruction codes. Computer Registers Computer instructions – Instruction cycle, I/P-O/P and Interrupt.UNIT-IIIINSTRUCTION SETS. STACK organization. Instruction formats. Addressing modes. DATA Transfer and manipulation. Program control. Reduced Instruction set computer,IA-32 Architecture and instruction set.UNIT-IVMICRO PROGRAMMED CONTROL : Control memory, Address sequencing, microprogram example, design of control unit Hard wired control. Microprogrammed control.UNIT-VTHE MEMORY SYSTEM : Basic concepts semiconductor RAM memories. Read – only memories Cache memories performance considerations, virtual memories secondary storage. Introduction to RAID.UNIT-VIINPUT-OUTPUT ORGANIZATION : Peripheral Devices, DMA, Input – Output Interface, Asynchronous data transfer Modes of Transfer, Priority Interrupt ,PCI Bus.UNIT-VIIPIPELINE AND VECTOR PROCESSING: Parallel Processing, Pipelining, Arithmetic Pipeline, Instruction Pipeline, RISC Pipeline Vector Processing, Array Processors.UNIT-VIIIMULTIPROCESSORS: Characteristics or Multiprocessors, Interconnection Structures, Interprocessor Arbitration. Inter Processor Communication and Synchronization Cache Coherence. Shared Memory Multiprocessors.

TEXT BOOKS:1. Computer Systems Architecture – M.Moris Mano, IIIrd Edition, Pearson/

PHI(Units II,III,IV,VI,VII,VIII)2. computer organization carl hamacher zvonks vranesic safeazaky 5th

Edition, McGraw Hill.(Units I & V)REFERENCES:

1. Computer Organization and Architecture – William Stallings Sixth Edition, Pearson/PHI

2. Structured Computer Organization – Andrew S.Tanenbaum, 4th Edition PHI/Pearson

With effect from academic year 2012-1311CS252CV

DATA BASE MANAGEMENT SYSTEMS(Common to CSE & IT)

Instruction : 4 periods/week End Examination : 75 MarksTutorial : 1 Period/Week Duration : 3 hoursCredits : 4 Sessional marks : 25UNIT – I Database System Applications, database systems Vs File Systems. View of data-data abstraction-instances and schemas- data models- the ER model—Relational model-other model-Database languages-DDL-DML –Database access for application programs-Data base users and administrators-Transaction Management- database system structure-Storage Manager-the Query Processor UNIT –IIHistory Of DataBase Systems. DataBase Design and ER-Diagrams-beyond ER Design Entities. Attributes And Entity Sets-RelationShips and Relationship Sets-Additional Features Of ER Model-Concept Design With ER Model-Conceptual Design For Large Enterprises.UNIT IIIIntroduction to the relational Model-Integrity constraints over relations-Enforcing Intigrity constraints –Querying Relational data-logical database design – introduction to views –destroying/altering Tables and Views.Relational algebra-selection and projection set operations-renaming-joins-division-examples of algebra overviews – relational Calculus-Tuple Relational calculus-Domain relational Calculus .UNIT IVForm of basic query- Examples of basic SQL query-Introduction to Nested Queries – correlated nested queries-set comparison operator-Aggregate operators- NULL values and comparison using NULL values -Logical connectivities- AND ,OR and NOT –Impacts On SQL Constructs-OUTER Joins –Disallowing NULL Values-Complex Integrity constraints in SQL Triggers. UNIT - V Scheme Refinement: problems caused by redundancy-Decompositions-problems related to Decompositions-reasoning about FDS-FIRST, SECOND THIRD Normal Forms-BCNF-lossless join decomposition-dependency preserving decomposition- Multi-valued dependencies -forth Normal Forms. UNIT - VITransaction concepts : Transaction state –Implementation Of Atomicity and Durability-concurrent –execution-serializability-recoverability—Implementation Of Isolation –testing for serializability –Lock Based Protocols-TimeStampBased Protocols-Validation Based Protocols-Multiple Granularity.UNIT VIIRecovery and Atomicity-Log Based Recovery –Recovery with concurrent transactions –Buffer Management –Failure with Loss Of nonvolatile storage –Advance recovery systems -Remote Backup Systems.UNIT-VIIIData on external storage-File Organization and indexing-cluster Indexes- primary and secondary indexes- index data structure-Hash based indexing-tree based indexing- comparison of File organizations - indexes and performance tuning-Intuitions for tree

Indexes –Indexed sequential Access Methods(ISAM)-B+ Trees :A Dynamic Index Structure

TEXT BOOKS :1. "Database Managemetn Systems", Raghu Rama Krishnan, Johannes gehrke ,TMH,l 3rd Edition2. Database System Concepts, Abraham Silberschatz, Henry F. Korth, S. Sudarshan ,Mc GrawHill 5th Edition.REFERENCES: 1. Fundamental Of Database systems . Elmasri Navathe pearson education.2. Introduction to Database Systems, C.J Date Pearson Education.3. Oracle for professionals The X team S shah and V shah SPD.4. Database system using Oracle A simplified guide to SQL and PL/SQL - shah PHI.

With effect from academic year 2012-13

11CS253CV OBJECT ORIENTED PROGRAMMING

(Common to CSE & IT)Instruction : 4 periods/week End Examination : 75 MarksCredits : 4 Duration : 3 hoursSessional marks : 25UNIT I:Java Basics History of Java, Java buzzwords, data types, variables, scope and life time of variables, arrays, operators, expressions, control statements, type conversion and casting, simple java program, classes and objects – concepts of classes, objects, constructors, methods, access control, this keyword, garbage collection, overloading methods and constructors, parameter passing, recursion, nested and inner classes, exploring string classUNIT II:Inheritance – Hierarchical abstractions, Base class object, subclass, subtype, substitutability, forms of inheritance- specialization, specification, construction, extension, limitation, combination, benefits of inheritance, costs of inheritance. Member access rules, super uses, using final with inheritance, polymorphism- method overriding, abstract classes, the Object classUNIT III:Packages and Interfaces : Defining, Creating and Accessing a Package, Understanding CLASSPATH, importing packages, differences between classes and interfaces, defining an interface, implementing interface, applying interfaces, variables in interface and extending interfacesUNIT IV:Exceptional Handling Concepts of exception handling, benefits of exception handling, exception hierarchy, usage of try, catch, throw, throws and finally, built in exceptions, creating own exception subclass, String handling ,Exploring java.io packageUNIT V:Multithreading:-Differences between multithreading and multitasking, thread life cycle, creating threads, thread priorities, synchronizing threads, Interthread communication ,Exploring java.util-ArrayList, StringTokenizer, Random and Vector classes.UNIT VI: Applets – Concepts of Applets, differences between applets and applications, life cycle of an applet, types of applets, creating applets, passing parameters to appletsEvent Handling: Events, Event sources, Event classes, Event Listeners, Delegation event model, handling mouse and keyboard events, Adapter classes, Anonymous Inner classesUNIT VIIThe AWT class hierarchy, user interface components-labels, button, canvas, scrollbars, text components, checkbox, checkbox groups, choices, list panels-scrollpane, dialogs, menubar, Graphics, layout manager-layout manager types-border, grid, flow, card and grid bag.

UNIT VIII:Swing – Introduction, limitations of AWT, MVC architecture, components, containers, exploring swing- JApplet, JFrame and JComponent, Icons and Labels, text fields, buttons – The JButton class, Check boxes, Radio buttons, Combo boxes,

Tabbed Panes, Scroll Panes, Trees, and Tables.TEXT BOOKS :1. Java; the complete reference, 7th editon, Herbert schildt, TMH. 2. Understanding OOP with Java, T. Budd, pearson education. REFERENCES1 Core Java 2, Vol 1, Fundamentals, Cay.S.Horstmann and Gary Cornell, eighth Edition, Pearson Education. 2 Core Java 2, Vol 2, Advanced Features, Cay.S.Horstmann and Gary Cornell, eighth Edition, Pearson Education3 Java and Object Orientation, an introduction, John Hunt, second edition; Springer4 Maurach’s Beginning Java2 JDK 5, Joel Murach, Andrea Steelman, Doug Lowe, SPD

With effect from academic year 2012-1311CS254CV

FORMAL LANGUAGES AND AUTOMATA THEORY (CSE)

Instruction : 3 periods/week End Examination : 75 Marks

Tutorial : 1 Period/Week Duration : 3 hoursCredits : 3 Sessional marks : 25UNIT- IFundamentals : String, Alphabet, Language, Operations, Finite state machine, definitions, finite automaton model, acceptance of strings, and languages, deterministic finite automaton and non deterministic finite automaton, transition diagrams and language recognizers.UNIT - IIFinite Automata: NFA with l transitions – Significance, acceptance of languages. Conversions and Equivalence : Equivalence between NFA with and without l transitions, NFA to DFA conversion, minimization of FSM, equivalence between two FSM’s, Finite Automata with output-Moore and Melay machines.UNIT- IIIRegular Languages: Regular sets, regular expressions, identity rules, Constructing finite Automata for a given regular expressions, Conversion of Finite Automata to Regular expressions. Pumping lemma of regular sets, closure properties of regular sets (proofs not required).UNIT- IVGrammar Formalism: Regular grammars-right linear and left linear grammars, equivalence between regular linear grammar and FA, inter conversion, Context free grammar, derivation trees, sentential forms. Right most and left most derivation of strings.UNIT – VContext Free Grammars: Ambiguity in context free grammars, Minimization of Context Free Grammars, Chomsky normal form, Greiback normal form, Pumping Lemma for Context Free Languages. Enumeration of properties of CFL (proofs omitted).UNIT - VIPush Down Automata: Push down automata, definition, model acceptance of CFL Acceptance by final state and acceptance by empty state and its equivalence. Equivalence of CFL and PDA interconversion. (Proofs not required). Introduction to DCFL and DPDA.UNIT – VIITuning Machine : Turing Machine ,Definition, Model, Design of TM. Computable functions, recursively enumerable languages, church’s Hypothesis, counter machine, types of Turing machines,(Proofs not required).UNIT – VIIIComputability Theory: Chomsky hierarchy of languages, linear bounded automata and context sensitive language, decidability of problems, Universal Turing Machine, Undecidability of post Correspondence problems, reducibility.

Text Books :1.“Introduction to Automata Theory Languages and Computation”. Hopcroft H.E. and Ullman J.D. Pearson Education2.Introduction to Computer Theory, Daniel I. A. Cohen. John Wiley.References :1. Introduction to languages and the Theory of Computation, John C Martin, TMH“2.Elements of Theory of Computation”, Lewis H.P. & Papadimition C.H. Pearson / PHI.3.Theory of Computer Science – Automata languages and computation – Mishra and Chandrashekaran, 2nd edition, PHI.

4. Introduction to Theory of Computation – Sipser 2nd edition Thomson.

With effect from academic year 2012-1311CS255CV

DESIGN AND ANALYSIS OF ALGORITHMS(CSE)

Instruction : 3 periods/week End Examination : 75 MarksTutorial : 1 Period/Week Duration : 3 hoursCredits : 3 Sessional marks : 25UNIT-IINTRODUCTION: Algorithm ,Pseudo code for expressing algorithms, performance analysis, Time complexity and space complexity, Asymptotic notations- O notation

Omega notation and theta notation, little-o notation, probabilistic analysis, amortized analysis. UNIT-IIDISJOINT SETS: Disjoint set operations, union and find algorithms, spanning trees, connected components and biconnected components.UNIT-IIIDIVIDE AND CONQUER: General method, Applications: Binary search, merge sort, quick sort, Strassen's matrix multiplication. UNIT-IVGREEDY METHOD: General method, Applications: job sequencing with deadlines,0/1 knapsack problem, minimum spanning tree, single source shortest path problemUNIT-VDYNAMIC PROGRAMMING: General method, application: Matrix chain multiplications, optimal binary search trees, 0/1 knapsack problem, All pairs shortest path problem, reliability design problem, travelling sales person problem. UNIT-VIBACK TRACKING: General method, applications: n_queens problem, Sum of subsets problem, graph colouring problem. Hamiltonian cycles.UNIT-VIIBRANCH and BOUND: General method, Applications: Travelling sales person problem,0/1 knapsack problem, LC branch and bound solution,, FIFO branch and bound solutionUNIT-VIIINP-hard and NP-complete problems: basic concepts, nondeterministic algorithms, NP-hard and NP-complete classes, Cook’s theorem

TEXT BOOKS: 1. E. HOROWITZ and S.SAHNI: "Fundamentals of algorithms" Galgotia 2. Introduction to algorithms, 2nd edition, T.H.Cormen, C.E.Leiserson, R.L.Rivest, and C.Stein, PHI Pvt .Ltd/Pearson Education. REFERENCES: 1.Algorithm Design, Michael P. Goodrich, Roberto Tamassia 2.The Design and Analysis of Computer Algorithms – AHO ,Hop Croft, Ullman – Low Price edition

With effect from academic year 2012-1311CS281CV

OBJECT ORIENTED PROGRAMMING LAB(Common to CSE & IT)

Practical : 3 periods/week End Examination : 50 MarksCredits : 2 Duration : 3 hoursSessional marks : 25Week 1:Write java programs that demonstrate the use of following keywords a)this b)static c) final d)super Week 2a) Write a java program that checks whether a given string is palindrome or not.Ex:

MADAM is a palindromeb) Write a Java program for sorting a given list of names in ascending order.c) Write a Java program that reads a line of integers,and then displays each integer and the sum of all the integers(Use StringTokenizer class of java.util) d) Write a java program which demonstrate the concept of dynamic method dispatch?Week 3a)Develop a user defined package and create class Account in it ,and display the names of customers whose balance is less than zerob) Write a java program to demonstrate the concept of access specifiers?Week4a) Write a Java Program that reads a file name from the user, then displays information about Whether the file exists, whether the file is readable, whether the file is writable, the type of file and the length of the file in bytes.b) Write a Java program to copy the content from one file to another filec) Write a Java Program that displays the number of characters ,lines and words in a text file.Week 5a)Write a Java Program(using java.util.* package) that Implements stack ADTb)Write java programs that demonstrates uncaught exceptions and user defined ExceptionsWeek 6.a)Write a Java program that creates three threads. First thread displays “Good Morning” every One second, the second thread displays “Hello” every two seconds and third displays “Welcome” every three seconds.b)Write a Java program that correctly implements producer consumer problem using the concept of inter thread communication.Week 7a)Develop an applet that displays a simple messageb)Develop an applet that receives an integer in one test field, and computes its factorial Value and returns it in another text field, when the button named “Compute “is clicked.Week 8a)Write a Java program for handling mouse and key events.b)Write a program that creates a user interface to perform integer divisions. The user enters two numbers in the text fields.Num1 and Num2.The division of Num1 and Num2 is displayed in the Result field when the Divide button is clicked .If Num1 or Num2 were not an integer, the program would throw a NumberFormatException. If Num2 were zero, the program would throw an Arithmetic ExceptionWeek 9Write a Java program that works as a simple calculator. Use a grid layout to arrange buttons for the digits and for the +,-,*, % operations. Add a test field to display the result.Week 10a)Write a Java program that simulates a traffic light. The program lets the user select one of three Lights: red, yellow, or green. When a radio button is selected, the light is turned on, and only one Light can be on at a time. No light is on when program starts.b)Write a Java program that allows the user to draw lines, rectangles and ovals.Week 11a)Write a applet program to create a GUI with menus, dialog boxes.(use card layout for GUI)

Week 12a)Suppose that a table named Table.txt is stored in a test file. The first line in the file is the header and the remaining lines corresponds to rows in a table. The elements are separated by commas, Write a java program to display the table using Jtable component.REFERENCES:

1. Java How To Program,Sixth Edition,H.M.Dietel and P.J.Dietel,Pearson Education/PHI

2. Programming with Java,M.P.Bhave and S.A.Patekar,Pearson Education3. Big Java,2nd Edition,Cay Horstmann,Wiley Student Edition.Wiley India Private

Limited.4. Introduction to Programming with Java,J Dean & R.Dean.McGraw Hill

education.

With effect from academic year 2012-1311CS282CV

DATABASE MANAGEMENT SYSTEMS LAB(Common to CSE & IT)

Practical : 3 periods/week End Examination : 50 MarksCredits : 2 Duration : 3 hoursSessional marks : 25

1 In the process of computerization of Roadway Travels you have to design and develop a Database which consists the data of Buses, Passengers, Tickets, and Reservation and cancellation details. You should also develop query's using SQL to retrieve the data from the database . Analyzing the problem and identifying the Entities and Relationships.2. E-R Model 3. Relational Model

4. Normalization 5. Creating the database.6. Creating tables for various relations7. Querying. a)Insertion b) Retrieval( operations like Union, Insert, Minus, in, exist, aggregate functions etc. c) Updation d) Deletion8.Creating Views9.Writing Assertions.10.Writing triggers.11 Implementing operations on relations using PL/SQL.12. Creating Reports.

REFERENCES:1. Introduction to SQL,Rick F.Vander Lans,Pearson education. 2. Oracle PLlSQL Programming,Steven Feuerstein,SPD. 3. SQL & PLlSQL for Oracle 1 Og,Black Book, Dr.P.S.Deshpande, Dream Tech. 4. Oracle Database11g PL/SQL Programming,M.Mc Laughlin,TMH.

With effect from academic year 2012-1311IT251CV

PRINCIPLES OF PROGRAMMING LANGUAGES (IT)

Instruction : 3 periods/week End Examination : 75 MarksTutorial : 1 Period/Week Duration : 3 hoursCredits : 3 Sessional marks : 25UNIT IPreliminary Concepts: Reasons for studying concepts of programming languages programming domains, language evaluation criteria, Influences on language design, Language categories, programming paradigms- Imperative programming language,OOPs and Functional programming Languages, logic programming, Language implementation –compilation and virtual machines, programming environments. UNIT IISyntax and Semantics: General problems of describing syntax and semantics, BNF, EBNF for common programming language features, parse trees, ambiguous grammars, Attribute grammer, denotational semantics and axiomatic semantics for

common programming language features.UNIT IIIData types and variables: Primitive and Non-primitive Data type,character,user defined,array,associative,record,union,pointer and reference types,design and implementation uses related to these types. Names,variable,concept of binding, Type checking, type compatibility, Strong type, named constants, variable initialization.UNIT IVExpression & statements: Arithmatic, Relational and Boolean Expression,Short circuit evaluation mixed mode assignment, Assignment Statements, Control Structures-Statement Level Control Structures, Compound Statements,Selection, Iteration, Unconditional Statements,guarded commands.UNIT VSubprograms and blocks: Fundamentals of subprograms, scope and lifetime of variable,static and dynamic scope,design issues of subprograms and operations, local referencing environments, Parameter passing method, Overloaded Subprograms and Generic Subprograms,parameters that are sub program names,design issues for functions user overloaded operators,co-routines.UNIT VIAbstract data types: Abstractions and encapsulation, Introduction to Data Abstraction, Design Issues, Language Examples, C++ parameterized abstract data types,OOP in small talk,C++,java,c#.ada95.Concurrency: Subprogram Level concurrency, Semaphores,Monitors, Message passing, JAVA Threads,c# threads.UNIT VIIException Handling: Exceptions,exception propagation, Exception handler in Ada,C++ and java.Logic programming language: Introduction and overview of logic programmming language, The basic elements of PROLOG, Applications of logic programming.UNIT VIIIFunctional programming languages: Introduction, Fundamentals of FPL, LISP, Application of functional programming language and comparison of functional and imperative languages.Scripting Languages: Introduction to HTML, Case Study: JavaScript- Key Concepts, Values and Types, Variables, Objects in JavaScript, Dynamic HTML with JavaScript.

TEXT BOOKS:1. Concepts of programming languages Robert.W.sebesta 6/e,pearson

education.2. Programming Languages design and implementation - pratt and Zelkowitz,

fourth edition PHI/Pearson Education.3. Web Programming, building internet applications, Chris Bates 2nd edition,

Wiley DreamTech.REFERENCES :

1. programming languages - Ghezzi,3/e,John wiley.2. programming languages – Louden, second Edition,Thomson.3. LISP patric henry Winston and paul horn pearson education.4. programming in PROLOG clocksin , springer.

With effect from academic year 2012-1311CS203CV

DIGITAL LOGIC DESIGN(Common to CSE ,IT & EEE)

Instruction : 3 periods/week End Examination : 75 MarksTutorial : 1 Period/Week Duration : 3 hoursCredits : 3 Sessional marks : 25UNIT-I BINARY SYSTEMS : Digital Systems, Binary Numbers, Number base conversions, Octal and Hexadecimal Numbers, complements, Signed binary numbers, Binary codes, Binary Storage and Registers, Binary logic. UNIT-II BOOLEAN ALGEBRA AND LOGIC GATES : Basic Definitions, Axiomatic definition of Boolean Algebra, Basic theorems and properties of Boolean algebra, Boolean functions canonical and standard forms, other logic operations, Digital logic gates, integrated circuits. UNIT-III GATE LEVEL MINIMIZATION : The map method, Four-variable map, Five-Variable map, product of sums simplification Don’t-care conditions, NAND and NOR implementation other Two-level implementations, Exclusive -Or function, Hard ward Description language (HDL). UNIT - IV

COMBINATIONAL LOGIC : Combinational Circuits, Analysis procedure Design procedure, Binary Adder-Subtractor Decimal Adder, Binary multiplier, magnitude comparator, Decoders, Encoders, Multiplexers, HDL for combinational circuits. UNIT - V SYNCHRONOUS SEQUENTIAL LOGIC : Sequential circuits, latches, Flip-Flops Analysis of clocked sequential circuits, HDL for sequential circuits, State Reduction and Assignment, Design Procedure. UNIT - VI Registers, shift Registers, Ripple counters synchronous counters, other counters, HDL for Registers and counters. UNIT - VII Introduction, Random-Access Memory, Memory Decoding, Error Detection and correction Read-only memory, Programmable logic Array programmable Array logic, Sequential Programmable Devices. UNIT-VIII ASYNCHRONOUS SEQUENTIAL LOGIC : Introduction, Analysis Procedure, Circuits with Latches, Design Procedure, Reduciton of state and Flow Tables, Race-Free state Assignment Hazards, Design Example. TEXT BOOKS : 1. Digital Design , M.Morris Mano, Third Edition, Pearson Education/PHI. 2. Fundamentals of Logic design, Roth, 5th Edition,Thomson. REFERENCES : 1. Switching and Finite Automata Theory by Zvi. Kohavi, Tata McGraw Hill. 2. Fundamentals of Digital Logic&micro Computer Design, M. Rafiquzzaman 5Ed, WE 3. Digital Principles and Design ,Donald D.Givone, Tata McGraw Hill, Edition.

With effect from academic year 2012-1312CS101CV

PROBLEM SOLVING THROUGH ‘C’ (Common to all Branches)

Instruction : 3 periods/week End Examination : 75 MarksCredits : 3 Duration : 3 hoursSessional marks : 25UNIT - IIntroduction to Computers: Hardware components: CPU, RAM, I/O Devices. Software : Application software and System Software. Computer Languages. Simple problem solving: Algorithms, Pseudo code, flow charts. Example problems- solving a quadratic equation, finding sum of digits of a given number,. UNIT – IIIntroduction to C Language: Structure of C program. Compilation process.Basic Programming constructs- Identifiers, Basic data types, Variables, Constants, I/O functions. Operators- Expressions, Precedence and Associativity, Expression Evaluation, Type conversions, Bit wise operators, Statements, Programming examples.UNIT – III Selection Statements: if –if-else, nested if, else-if ladder. Block of statements and scope. switch statement. break and goto statements.

Examples- student grade decision based on marks obtained, simple calculator program.Loop statements – while, for, do-while statements, Loop examples.Other statements related to looping – break, continue, goto, Programming examples-finding gcd of two numbers, finding factorial of given number, generating prime numbers etc.UNIT - IVIntroduction to Structured Programming: Preprocessing phase Preprocessor directives-symbolic constants, macros, conditional compilation. Standard symbolic constants. Functions Basics –function header, function prototype specification, function definition and function call. Actual, formal parameters and return statement. Examples-standard library functions and simple user defined functions.UNIT - VRecursion: recursion- recursive functions and tracing recursive calls. Examples factorial, Fibonacci, Towers of Hanoi. Scope and extent of variables.Storage classes-automatic, register, static and global. UNIT -VI Arrays: Concepts, arrays representation in C, passing array as argument to functions. Two – dimensional arrays-2D array organization in memory-row major and column major. Basics of multidimensional arrays. Examples programs on Matrix operations.

UNIT - VIIPointers: Introduction (Basic Concepts), Pointers as arguments to functions. Pointers to arrays, pointer-to-pointer , array-of-pointers.Dynamic memory allocation functions, programming applications.UNIT - VIIIStrings: String representation , String Input / Output functions. String manipulation function implementation. Command line arguments.

TEXT BOOKS :1. C Programming & Data Structures, B.A.Forouzan and R.F. Gilberg,

Third Edition, Cengage Learning.2. Problem Solving and Program Design in C, J.R. Hanly and E.B. Koffman, Fifth

Edition, Pearson education.REFERENCES :

1. “How to Solve it by Computer” by R G Dromey2. The C Programming Language, B.W. Kernighan and Dennis M.Ritchie,

PHI/Pearson Education3. C Programming with problem solving, J.A. Jones & K. Harrow, dreamtech Press4. Programming in C – Stephen G. Kochan, III Edition, Pearson Eductaion.

With effect from academic year 2012-1312CS151CV

DATA STRUCTURES THROUGH ‘C’ (Common to all Branches)

Instruction : 3 periods/week End Examination : 75 MarksCredits : 3 Duration : 3 hoursSessional marks : 25UNIT – IDerived Types : Structures –Declaration definition, type-defining. Initialization, accessing structures. Array of structures, passing structures as arguments to functions, pointers to structures, nested structures, self referential structures.Unions and enumerated types.UNIT - IIInput and Output: Persistent storage of data, streams, standard input / output functions- character I/O, string I/O, formatted I/O and binary I/O. Other file status and position functions-feof((), ferror(), fseek(), ftell(), rewind() etcUNIT-IIISearching Techniques: Introduction to algorithm time and space complexities. O and Ө notations. Searching problem - sequential search and binary search and their time complexity.UNIT-IVSorting Techniques- Introduction to sorting problem selection sort, bubble sort, insertion sort, quick sort, merge sort and their time complexities.UNIT-VData Structures – Introduction to Data Structures, abstract data types, Linear list – singly linked list implementation, insertion, deletion and searching operations on linear list, UNIT-VI

Stacks and Applications: Stack ADT , operations on stack, array and linked representations of stacks.Stack application- infix to postfix conversion, postfix expression evaluation, recursion implementationUNIT-VIIQueues-Queue ADT, operations on queues, array and linked representations of queue. Applications of queue data structure.UNIT-VIIIIntroduction to Non-Linear Data Structures: Introduction to trees and graphs. Theoretical concepts of binary trees. Traversal techniques-inorder, preorder and postorder . TEXT BOOKS :1. C Programming & Data Structures, B.A.Forouzan and R.F. Gilberg, Third Edition, Cengage Learning.2. “Data Structures A pseudocode Approach with C” by R.F.Gilberg and B.A.Forouzan Thomson 2nd editionREFERENCES:1)C Programming with problem solving, J.A. Jones & K. Harrow, dreamtech Press2)Programming in C – Stephen G. Kochan, III Edition, Pearson Education.3)Data Structures using C – A.M.Tanenbaum, Y.Langsam, and M.J. Augenstein, Pearson Education / PHI4)“How to Solve it by Computer” by R G Dromey

With effect from academic year 2012-1312CS131CV

COMPUTER PROGRAMMING LAB(Common to all Branches)

Practical : 3 periods/week End Examination : 50 MarksCredits : 2 Duration : 3 hoursSessional marks : 25

1. Write the algorithm and draw the flow chart to find the roots of a quadratic equation

2. Write the algorithm and draw the flow chart to find the sum of digits of a given n digit number

3. Write a C program to explore decimal , octal, hexadecimal, unsigned, unsigned long long formats of integers with printf and scanf functions.

4. Write a C program to convert the given temperature in Celsius into Fahrenheit.

5. Given marks of 6 subjects as input in real format, find whether a given student is passed or not. Also display his aggregate percentage and pass category ( 70 and above : distinction, 60 to 70: first division, 50 to 60: second division, 35 to 50: third division).

6. Write a simple calculator program which reads operand1, operator and operand2 as input and displays the result .

7. Write a C program to find the sum of individual digits of a positive integer. 8. Rewrite the calculator program given in question no 6 to y run the operations

until user’s choice is exit. 9. Write a C program to generate all the prime numbers between 1 and n, where

n is a value supplied by the user.10. A number is said to be Armstrong if the number is equivalent to the sum of

cubes of its digits. Write a C program to check whether a given number is Armstrong or not.

11. Write a C program to define the macros SUM(a, b), SQUARE(a) and SQUARE( SUM(a,b) ) and print the results.

12. Write a C program to illustrate functions without parameters and without return type, without parameters and with return type, with parameters and without return type and with parameters and with return type.

13. Write a C function to calculate the sine series sum 1- x3/3! + x5//5!-…………… and call the function.

14. Write a C program to Write a C program in which a recursive and non recursive functions are called to compute factorial values based on user’s choice.

15. Write a C program in which a recursive and non recursive functions are called to generate Fibonacci series based on user’s choice.

16. Write a C program to find the sum of the elements of a given list(array).17. Implement two separate functions which return the minimum and

maximum values of a given array-list and call these functions.18. Write a C program to find the transpose of a given input matrix(read the

dimensions of matrix too as input). 19. Implement two separate functions for finding the sum and product of matrices

and call these functions.20. Implement a C function to exchange the values of given two variables and call

the function(using pointers).21. Implement two separate C functions to perform insertion of an element

and deletion of an element operations on an array at a specified position( pass the array and its size as pointers).

22. Write a C program to create a dynamic list of real numbers where the size of the list is accepted as input, extend its size and release it (use dynamic memory allocation functions).

23. Write a C program to accept string as input and find its length using a user-defined string length function, reverse the string and check whether the string is palindrome or not.

24. Implement a C function to read a multi-word string and copy the input string to other string(the destination string must be a dynamically allocated string).

25. Write a C program to illustrate command-line arguments.

With effect from academic year 2012-1312CS181CV

DATASTRUCTURES THROUGH ‘C’ LAB(Common to all Branches)

Practical : 3 periods/week End Examination : 50 MarksCredits : 2 Duration : 3 hoursSessional marks : 25

1. Write a C program to create a user defined data-type Complex and implement addition, subtraction and multiplication operations on complex numbers.

2. Create a user defined data-type Student containing the fields rollNo, name and dateOfBirth(by creating a user defined type Date). Implement C functions to read the details of a student and create an array of students.

3. Write a C program illustrate the user-defined data type union.4. Write a C program to read the content of a given text file and count the

number of characters, words and lines in it(Read the file name as command line argument ).

5. Write a C program to read the content of a given text file, convert all lower case letters into upper case and display it on the screen.

6. Write a C program to write the record list of Student type into a binary file student.dat. Re-open the file read the records from the file and display on the screen.

7. Write a C program to implement sequential search. 8. Implement functions recursive and non-recursive binary search and call

these functions from main. 9. Write a C program to implement bubble sort using functions10. Write a C program to implement selection sort using functions11. Write a C program to implement insertion sort using functions12. Write a C program to implement quick sort using functions13. Write a C program to implement merge sort using functions14. Implement Array list ADT and all operations on it as C functions.15. Implement Single Linked List ADT and all operations on it as C functions.16. Implement Stack ADT and all operations on it as C functions17. Write a C program, to convert an infix-expression into post-fix expression.

18. Write a C program, to evaluate post-fix expression.19. Implement Queue ADT and all operations on it as C functions.