B.SC INFOMATION TECHNOLOGY (HONOURS) Core course ~ 14 Papers, Discipline Specific Elective(DSE) - 4 Papers Skill Enhancement Compulsory Course- SECC-1 / SECC - 2 Generic Elective for Non IT students ~ 4 papers (In-case University offers 2 subjects as GE, then papers 1 and 2 of those subjects will be the GE paper). Marks per paper (Core Course, DSE, GE)— Papers with Practical - Midterm: 15 marks, End term: 60 marks, Practical: 25 marks. Papers without Practical - Midterm: 20 marks, End term: 80 marks. Total Marks — 100 (For Papers having 6 Credits) Teaching hours per paper (Having 6 Credits) For Practical Papers - 40 Hours Theory Classes + 20 Hours Practical Classes. For Non- Practical Papers - 50 Hours Theory Classes + 10 Hours Tutorial Classes. CORE COURSE -I PROGRAMMING AND PROBLEM SOLVING THROUGH C LANGUAGE UNIT -1 Algorithm, Flowchart, Logic Development & Problem Solving. Pseudocode, Control structures (sequence, selection, Iteration), Testing and debugging. Introduction to Programming Language: Introduction to C Programming, Character Set, C Tokens, Keywords & Identifiers, Constants, Variables, Data Types, Variables, Storage Classes. Operators and Expressions: Properties of operators, Priority of operators, Comma and conditional operator, Arithmetic operators, Relational operators, Assignment operators and expressions, Logical Operators, Increment & Decrement operators, Conditional & Bitwise operators, Expressions, Input and Output Operations inc.UNIT - II Decision Making and Branching: Simple IF Statement, IF ..... ELSE Statement, Nesting IF .... ELSE Statement, ELSE IF Ladder, Switch Statement, Operator, GOTO Statement. Decision Making and Looping: The WHILE Statement, The DO Statement, The FOR Statement, Jumps in LOOPS. Arrays: Creating and Using One Dimensional Arrays (Declaring and Defining an Array, Initializing an Array, accessing individual elements in an Array, Manipulating array elements using loops), Use Various types of arrays (integer, float and character arrays / Strings) Two- dimensional Arrays (Declaring, Defining and Initializing Two Dimensional Array, Working with Rows and Columns), Passing objects in Array. UNIT - II User-defined Functions: Need, Elements & Definition, Function Calls, Function Definition, Category of Functions, Void functions, Inline Functions, Return data type of functions, Functions parameters, Differentiating between Declaration and Definition of Functions, Command Line Arguments/Parameters in Functions, Functions with variable number of Arguments, Recursion. Pointers: Accessing the Address of a Variable, Declaring Pointer Variables, Initializations of Pointer Variable, Accessing a Variable through its Pointer, Chain of Pointers, Pointer Expressions, Pointer Increments and Scale Factor, Pointers and Arrays, Pointers and Character Strings, Array of Pointers, Pointers as Function Arguments, Functions Retuming Pointers, Pointers to Functions, Pointers to Structures, Troubles with Pointers, Pointers variables. UNIT -IV Structures and Unions: Defining, Declaring, Accessing, Initialization Structure, Arrays of Structures, Arrays within Structures, Structures and Functions, Unions, Passing structure to function, Pointers to structures. File Management in C: Defining and Opening a File, Closing a File, Input! Output Operations on Files,standard 1/0, Formatted 1/0, Error Handling during VO Operations, Random Access to Files, Command Line Arguments. Memory Allocation: Differentiating between static and dynamic memory allocation, use of malloc, calloc and free functions, use of new and delete operators, storage of variables in static and dynamic memory allocation. ‘TEXT BOOKS: 1. E. Balaguruswamy “Programming in ANSI C’, Tata McGraw Hil REFFERENCE BOOKS : 4. B. Kernighan & D.M. Ritche, “The C Programming Language”, PHI 2. Byron Gottfried, “Programming with C" TMH Publications.SEMESTER -|_CORE ~ | (PRACTICAL) 48™ YEAR (25 MARKS ) LIST OF PRACTICALS (USING C) 1. WAP to print the sum and product of digits of an integer. 2. WAP to reverse a number. 3. WAP to compute the sum of the first n terms of the following series S = 1+1/2#1/3+1/4+...... 4. WAP to compute the sum of the first n terms of the following series S =1-2+3-4+5. 5. Write a function that checks whether a given string is Palindrome or not. Use this function to find whether the string entered by user is Palindrome or not. 6. Write a function to find whether a given no. is prime or not. Use the same to generate the prime numbers less than 100. 7. WAP to compute the factors of a given number. 8. Write a macro that swaps two numbers. WAP to use it. 9. WAP to find out greatest number without using third variable. 10. WAP to find out Permutation and Combination of numbers. 11. WAP to print a triangle of stars as follows (take number of lines from user): 12. WAP to perform following actions on an array entered by the user: i) Print the even-valued elements ii) Print the odd-valued elements ii) Calculate and print the sum and average of the elements of array iv) Print the maximum and minimum element of array v) Remove the duplicates from the array vi) Print the array in reverse order The program should present a menu to the user and ask for one of the options. The menu should also include options to re-enter array and to quit the program. 13. WAP that prints a table indicating the number of occurrences of each alphabet in the text entered as command line arguments. 14. Write a program that swaps two numbers using pointers.15. Write a program in which a function is passed address of two variables and then alter its contents. 16. Write a program which takes the radius of a circle as input from the user, passes it to another function that computes the area and the circumference of the circle and displays the value of area and circumference from the main() function. 17. Write a program to find sum of n elements entered by the user. To write this program, Allocate memory dynamically using malloc() / calloc{) functions or new operator. 18. Write a program to perform following operations on strings: ) Show address of each character in string b) Concatenate two strings without using struct function. ©) Concatenate two strings using struct function. 4) Compare two strings. €) Calculate length of the string (use pointers). f) Convert all lowercase characters to uppercase, 9) Convert all uppercase characters to lowercase. h) Calculate number of vowels. i) Reverse the string 19. Given two ordered arrays of integers, write a program to merge the two-arrays to get an ordered array. 20. WAP to display Fibonacci series (jJusing recursion, (ii) using iteration. 21. WAP to calculate Factorial of a number () using recursion, (i) using iteration, 22. WAP to calculate GCD of two numbers () with recursion, (i) without recursion. 23. Create Matrix class using templates. Write a menu-driven program to perform following Matrix operations (2-D array implementation):a) Sum, b) Difference, c) Product, d) Transpose. 24. Copy the contents of one text file to another file, after removing all whitespaces. 25. Write a function that reverses the elements of an array in place. The function must accept only one pointer value and retum void. 26. Write a program that will read 10 integers from user and store them in an array. Implement array using pointers. The program will print the array elements in ascending and descending order. 27. Write C program to convert decimal system to binary, octal and hexadecimal 28. Display the following output on the screen a.b.c. “4A "12 AB ** 423 ABC *** 41234 ABCD 8 12345 ABCDE UNIT Intro cul. float com Che Mini UNI Cla gen Loc Flo Pr Pr CirCORE COURSE - II SEMESTER -1 157 YEAR __(15 + 60 = 75 MARKS) COMPUTER ORGANIZATION AND ARCHITECTURE UNIT -1 Introduction to Computers: Hardware, Software, Types of Software, Introduction to OS. GUI vs CUL. Data Representation and Basic Computer Arithmetic :Number systems, Decimal, Binary, Octal and Hexa-decimal number systems and their inter conversion, complements, fixed and floating point representation, character representation, addition, subtraction, magnitude comparison, multiplication and division algorithms for integers , Overflow and Underflow \Character Codes, Boolean Algebra, Electronic Logic Gates, Synthesis of Logic Functions, Minimization of Logic Expressions, Minimization using Kamaugh Maps, Synthesis with NAND and NOR Gates. UNIT - Il Classification to Programming Language: Machine language, Assembly language, 3°84" generation languages, Characteristic of 3 GI's and 4 G's, Assemblers and Compilers. Basic Logic Functions: Flip-Flops, Gated Latches, Master-Slave Flip-Flops, Edge-Triggering, T Flip- Flops, JK Flip-Flops. Registers and Shift Registers, Counters, Decoders, Multiplexers, Programmable Logic Devices (PLDs), Programmable Array Logic (PAL), Complex Programmable Logic Devices (CPLDs), Field-Programmable Gate Array (FPGA), Sequential Circuits, Timing Diagrams, The Finite State Machine Model, Synthesis of Finite State Machines. UNIT = It Basic Structure of Computers: Computer Types, Functional Units, Input Unit, Memory Unit, Arithmetic and Logic Unit, Output Unit, Control Unit, Basic Operational Concepts, Bus Structures, Software. Memory System: Semiconductor RAM Memories, Internal Organization of Memory Chips, Static Memories, Asynchronous DRAMS, Synchronous DRAMS, Structure of Large Memories, Memory System Considerations, RAMBUS Memory. Read-Only Memories: ROM, PROM, EPROM, EEPROM, Flash Memory, Speed, Size, and Cost of Memory. Secondary Storage: Magnetic Hard Disks, Optical Disks, Magnetic Tape Systems. UNIT -IV Machine Instructions and Programs : Numbers, Arithmetic Operations, and Characters: Number Representation, Addition of Positive Numbers, Addition and Subtraction of Signed Numbers, Overflow of Integer Arithmetic, Characters, Memory Locations and Addresses, Byte Addressability, Word Alignment, Accessing Numbers, Characters, and Character Strings, Memory Operations, Instructions and Instruction Sequencing, Register Transfer Notation, Basic Instruction Types, Instruction Execution and Straight-Line Sequencing, Branching, Condition Codes, Generating Memory Addresses, Addressing Modes, Implementation of Variables and Constants, indirection and Pointers, indexing and Arrays, Relative AddressingTHE ARM EXAMPLE: Registers, Memory Access, and Data Transfer, Register Structure, Memory Access Instructions and Addressing Modes, Register Movelnstructions, Arithmetic and Logic Instructions: Arithmetic Instructions, Logic Instructions, Branch Instructions, Setting Condition Codes, Assembly Language, Psedo-Instructions, /O Operations, Subroutines, Vector Dot Product Program, Byte-Sorting Program, Linked-List Insertion and Deletion Subroutines. Basic Input-Output Operations, Stacks and Queues, Subroutines. PowerPC Example: Basic PowerPC Processor Organization, Load and Store Instructions, Arithmetic and Logic Instructions, Flow Control Instructions, Compare Instructions, Logic Instructions, Subroutines. TEXT BOOKS: 1. William Stallings: “Computer Organization and Architecture’,Pearson Education 2. Morris M. Mano, “Computer System Architecture",PHI New Delhi. REFFERENCE BOOKS: 1. Carl Hamacher, Z. Vranesic, S. Zaky: “Computer Organization’, 5/e (TMH) 2. B, Ram, “Computer Fundamentals", New Age Intemational Publishers. SEMESTER-1I CORE-II(PRACTICAL) 15" YEAR (25 MARKS ) LIST OF PRACTICALS (USING MS-OFFICE) WINDOWS 1. Creating folder, cut, copy, paste, managing file and folder in windows. 2. Arrange icons, set display properties 3. Adding and removing software and hardware 4, Setting date and time, screen saver and appearance. 5. Using windows accessories, 6, Settings of all control panel items 7, Search file. MS-Word 1. Creating & Editing Document 2. Formatting Document 3. Use of Auto-text, Autocorrect, Spelling and Grammar Tool, 4, Page Formatting, Page Border, Background,5, Creation of MS-Word-Mail Merge, Macros, Tables. 6. Practice of Printing, page setup etc. MS-Excel 1. Creating & Editing Worksheet, Fill Handle 2. Use Formulas and Functions 3. Preparing Charts MS-PowerPoint 1. Creating, Manipulating & Enhancing Slides, 2. Inserting Organizational Charts, Excel Charts 3. Using Word Art 4, Putting Animations and Sounds 5. Inserting Animated Pictures & Recorded Sound Effect. CORE COURSE - III SEMESTER = Il 157 YEAR (15 + 60 = 75 MARKS) OBJECT ORIENTED PROGRAMMING USING C++ UNIT-1 Principles of Object-Oriented Programming: Object-Oriented Programming (OOP)Paradigm, Basic Concepts of OOP, Benefits of OOP, Object Oriented Languages, Applications of OOP. Beginning with C++: Applications of C++, C++ statements, Example with Class, Structure of C++ Program, Creating the Source File, Compilingand Linking. Tokens, Expressions and Control Structures: Tokens, Keywords, Identifiers& Constants, Basic Data Types, User-Defined Data Types, Derived Data Types,Symbolic Constants, Type Compatibility, Declaration of Variables, Dynamic Initializationof Variables, Reference Variables, Operators in C++, Scope Resolution Operator,Member Differencing Operators, Memory Management Operators, Manipulators, TypeCast Operators, Expressions and their Types, Special Assignment Expressions, Impli Conversions, Control Structures. UNIT- I Functions in C++: The Main Function, Function Prototyping, Call By Reference, Returnby Reference, Inline Functions, Default Arguments, Const. Arguments, FunctionOverloading, Friend & Virtual Functions, Math. Library Functions. Classes and Objects: Specifying a Class, Defining Member Functions, Making an outside Function InlineNested Member Functions, Private Member Functions, Arrays within a Class, MemoryAllocation for Objects, Static Data Members,Static Member Functions, Arrays ofObjects, Objects as Function eee Function, Returning Objects, Cons.Member Functions, Pointer to Members, Local . nm Nstructors Destructors: Introduction, Default Constructor, Parameterized Constructors, Multiple Constuc in a Class, Constructors with Default Arguments, Dynamic Initialization ofObjects, cg Constructor, Dynamic Constructors, Constructing Two-DimensionalArays, Const. Objegs Destructors. UNIT- Ill Operator Overloading and Type Conversions:Defining Operator Overloading, Operator Precedence, Overloading Unary Operators, Overloading BinaryOperators, Overloading Binary Operators using Friends, Manipulation of Strings usingOperators, Rules for Overloading Operators, Type Conversions. Data Conversion between objects and basic types, Inheritance : Introduction, understanding inheritance, Advantages provided by inheritance, Defining Derived Classes, Single Inheritance, Making a Private Memberlnheritance, Multilevel Inheritance, Multiple Inheritance, Hierarchical Inheritance, Hybridinheritance, Virtual Base Classes, Abstract Classes, Constructors in Derived Classes,Member Classes, Nesting of Classes. Pointers, Polymorphism and Virtual Functions: Compile time & Run time polymorphisms, object slicing, base class initialization, Pointers, Pointers to Objects, this Pointer, Pointers to Derived Classes, Introduction and need of Pure Virtual Functions,Static Functions, this Pointer, abstract classes, virtual destructors, UNIT- IV Exception Handling Mechanisms: Exceptions and exception class, exception declarations, unexpected exceptions, RTTI, Calling abort(), Returning an Error Code, Exception Mechanism, Using Objects as Exceptions. Managing Console, /O Operations: C++ Streams, C++ Stream Classes, Unformattedl/O Operations, Formatted Console VO Operations, Managing Output with Manipulators. Files in C++ : Classes for File Stream Operations,Buffers, and the iostream File, Opening and Closing a File, Detecting endoffile, File Modes, File Pointers and their Manipulations, Sequential input and Output, Operations, Updating a File: Random Access, Error Handling During File Operations, Command-line Arguments. TEXT BOOKS: 1. E. Balguruswamy. Object-Oriented Programming with C++, Tata McGraw-Hill (TMH). 2. B.A. Forouzan& R. F. Gilberg, “Astructured approach using C++", CENGAGE learning India REFERENCE BOOKS: 1. Paul Deitel, Harvey Deitel, "C++: How to Program", Prentice Hall. 2. J. Farrell, “Object-Oriented Programming, Cengage LearningST YEAR 25 MARKS. LIST OF PROGRAMMES (USING C ++) 1, Clann and methods ‘A. Doslgn an employoe class for reading and displaying the omployoo Information, the gotinfo() and display Info() mothods will bo used respectivoly, Whore gotinfo() will be private method. B. Dosign tho clave stucont containing gotData() and displayData() as two of its methods which will be used for roading and displaying tho studont information respectively. Where getData() will bo private mothod, , Dosign the class Domo which will contain tho following mothods: readNo(), factorial() for calculating the factorial of a number, reverse No() will reverse the given number, is Palindroma() will check the given number Is palindrome, is Armstrong() which will calculate the givon number Is Armstrong or not, Where Readno() will be private method. D. Writo a program to demonstrate function dofinition outside class and accessing class mombers in function dofinition. 2. Using friend functions. ‘A. Write a friond function for adding the two complex numbers, using a single class B. Write a friend function for adding the two different distances and display its sum, using two classes. . Write a friend function for adding the two matrices from two different classes and display its sum. 3. Constructors and mothod overloading. A, Design a class Complex for adding the two complex numbers and also show the use of constructor. B. Design a class Geometry containing the methods area() and volume() and also overload the area() function. C. Design a class StaticDemo to show the implementation of static variable and static function. 4, Operator Overloading ‘A. Overload the operator unary (-) for demonstrating operator overloading. B. Overload the operator + for adding the timings of two clocks, And also pass objects as an argument. C. Overioad the + for concatenating the two strings. For e.g “Py” + “thon” = Python. 5. Inheritance A. Design a class for single level inheritance using public and private type derivation. B. Design a class for multiple inheritance. C. Implement the hierarchical inheritance. 6, Virtual functions and abstract classes ‘A. Implement the concept of method overriding. B, Show the use of virtual function . Show the implementation of abstract class. 7. String handling A. String operations for string length, string concatenation. B. String operations for string reverse, string comparison, G. Console formatting functions.8. Exception handling A. Show the implementation of exception handling B. Show the implementation for exception handling for strings C. Show the implementation of exception handling for using the pointers. 9. File handling A. Design a class FileDemo open a file in read mode and display the total number ofwords. and lines in the file. B. Design a class to handle multiple files and file operations C. Design a editor for appending and editing the files CORE COURSE - IV SEMESTER - II 157 YEAR (15 + 60 = 75 MARKS) DATA STRUCTURE UNIT -1 Basic definitions: Classifications, ADT; Linear Data Structures - Sequential representations, Non- linear data structures ~ representations .Arrays: Single and Multidimensional Arrays; Sparse Matrices (Array and Linked Rey rices (Array presentation); Row majorand column-major order; different applications. Linked Lists: Singly, Doubly and Circular Lists (Array and Linked representation), Normal and Circular representation of Stack in Lists, Self-Organizing Lists; Skip Lists UNIT =I Stacks: Implementing single / multiple stack/s in an Array; Prefix, Infix and Postfix expressions, Utility and conversion of these expressions from one to another, Evaluation of postfix expression using stack; Applications of stack; Limitations of Array representation of stack Queues: Array and Linked representation of Queue, De-queue, Priority Queues Recursion: Developing Recursive Definition of Simple Problems and their implementation; Advantages and Limitations of Recursion; Understanding what goes behind Recursion (Internal ‘Stacklmplementation); Tail Recursion; When not to use recursion; Removal of recursion. UNIT —IIl Trees and Graphs: Introduction to Tree as a data structure; Binary Trees (Insertion, Deletion , Recursive and Iterative Traversals on Binary Search Trees); Different Properties of Binary trees; Threaded Binary Trees(Insertion, Deletion, Traversals); Height-Balanced Trees (Various operations on AVL Trees); B- tree, B+ tree; Graphs - Representations, Breadth-first and Depth- first Search. Searching and Sorting: Linear Search, Binary Search, Comparison of Linear and Binary Search; Bubble Sort, SelectionSort, Insertion Sort, Heap Sort, Merge Sort, Radix Sort, Bucket Sort, Shell Sort; Comparison of Sorting Techniques.UNIT -IV Hashing: Introduction to Hashing, Deleting from Hash Table, Efficiency of Rehash Methods, Hash Table, Reordering, Resolving collision by Open Addressing, Coalesced Hashing, Separate Chaining, Dynamic and Extendible Hashing, Choosing a Hash Function, Perfect Hashing Function .File Structures: Sequential and Direct Access. Relative Files, Indexed Files - B+ tree as. index. Multi-indexed Files, Inverted Files, Hashed Files. TEXT BOOKS: 1. D. Samanta, ‘Classic data Structures”, PHI. REFFERENCE BOOKS: 1. Aaron M. Tenenbaum, Moshe J. Augenstein, YedidyahLangsam, "Data Structures Using C and C++, Second edition, PHI, 2009. 2. Robert L. Kruse, "Data Structures and Program Design in C*, Pearson. SEMESTER - I, CORE - IV (PRACTICAL) 18 YEAR (25 MARKS ) LIST OF PROGRAMMES (USING C/C ++) 41. Write a program to search an element from a list. Give user the option to perform Linear or Binary search. Use Template functions. 2. WAP using templates to sort a list of elements. Give user the option to perform sorting using Insertion sort, Bubble sort or Selection sort. 3. Implement Linked List using templates. Include functions for insertion, deletion and search of a number, reverse the list and concatenate two linked lists (include a function and also overload operator +). 4. Implement Doubly Linked List using templates. Include functions for insertion, deletion and search of a number, reverse the list. 5. Implement Circular Linked List using templates. Include functions for insertion, deletion and search of a number, reverse the list. 6. Perform Stack operations using Linked List implementation. 7. Perform Stack operations using Array implementation. Use Templates. 8. Perform Queues operations using Circular Array implementation. Use Templates. 9. Create and perform different operations on Double-ended Queues using Linked List implementation. 10. WAP to scan a polynomial using linked list and add two polynomials. 11. WAP to calculate factorial and to compute the factors of a given no. (i) using recursion, (i) using iteration 12. WAP to display Fibonacci series (i) using recursion, (i) using iteration 13. WAP to calculate GCD of 2 numbers (i) with recursion (ii) without recursion44, WAP to create a Binary Search Tree and include following operations in tree: (a) Insertion (Recursive and Iterative Implementation) (b) Deletion by copying (c) Deletion by Merging (d) Search a no. in BST (€) Display its preorder, postorder and inorder traversals Recursively ( Display its preorder, postorder and inorder traversals lteratively (g) Display its level-by-level traversals (h) Count the non-leaf nodes and leaf nodes (i) Display height of tree () Create a mirror image of tree (k) Check whether two BSTs are equal or not 15. WAP to convert the Sparse Matrix into non-zero form and vice-versa. 16. WAP to reverse the order of the elements in the stack using additional stack. 17. WAP to reverse the order of the elements in the stack using additional Queue. 18. WAP to implement Diagonal Matrix using one-dimensional array. 19. WAP to implement Lower Triangular Matrix using one-dimensional array. 20. WAP to implement Upper Triangular Matrix using one-dimensional array. 21. WAP to implement Symmetric Matrix using one-dimensional array. 22. WAP to create a Threaded Binary Tree as per in order traversal, and implement operations like finding the successor / predecessor of an element, insert an element, in order traversal. 23. WAP to implement various operations on AVL Tree. CORE COURSE -V SEMESTE! il 28D YEAR 15 + 60 = 75 MARKS) DATABASE MANAGEMENT SYSTEM UNIT -1 Fundamental of DBMS : Data , Information, Database & Computers. DBMS definition, DBMS versus file processing system, Components of DBMS Environment, Instances & Schemas, Three Levels Architecture, Data Independence, Data Dictionary, Database Users, Data Administrators: Data Modelling Using the Entity-Relationship(ER) Model. : UNIT Modelling the Real World, Various Data Models & their comparison, Entity Relationship Models: RDBMS —Concept, Components, Data Integrity, Constrain . , : ts, i lator: Relational Algebra and Calculus. saeeptone Dee teUNIT = II Relational Database Design by ER and EER to Relational Mapping, Introduction to SQL,DDL. DML and DCL statements, Creating tables, Adding Constraints, Altering Tables, Update, Insert, Delete & Various Forms of SELECT — simple, Using Special Operators for Data Access, Nested Queries & Exposure to Joins, Aggregate Functions. UNIT -IV Functional Dependencies and Normalization for Relational Database Normalization: Definition, Decomposition, Basic concepts like FD, Objectives of Normalization, Normal Forms ~ First, ‘Second and Third Normal Form, BCNF, Concept of Multi-valued dependencies. Transaction; Concurrency Control - Problem & its Basis, Concurrency Control-Locks & Deadlocks, Recovery - Kind of Failures, Recovery Techniques, Security- Authentication, Authorization, Access Control. TEST BOOKS: 1.R. Elmasri, S.B. Navathe, “Fundamentals of Database Systems”, 6/e, Pearson Education. 2. A. Silberschatz, H.F. Korth, S. Sudarshan, “Database System Concepts” 6/e, McGraw Hill . REFERENCE BOOKS: 1. C.J. Date , An Introduction to Database Systems , Pearson Education,New Delhi. 2. C. Coronel, S. Morris, & P. Rob, “Database Principles (Fundamentals of Design, Implementation, and Management), 9/e, Cengage Learning. 3. Ivan Bayross , SQL , PLSQL , BPB Publication, New Delhi SEMESTER - Ill, CORE - V (PRACTICAL) 2N° YEAR (25 MARKS ) Create and use the following database schema to answer the given queries. EMPLOYEE Schema Field Type NULL KEY DEFAULT Eno Char(3) NO PRI NIL Ename Varchar(50) NO NIL Job_type Varchar(50) NO NIL Manager Char(3) Yes FK NIL Hire_date Date NO NIL Dno’ Integer YES FK NIL ‘Commission Decimal(10,2) YES NIL Salary Decimal(7,2) NO NIL DEPARTMENT Schema Field Type NULL KEY DEFAULT Dno Integer No PRI NULL Dname Varchar(50) Yes NULL Location Varchar(50) Yes New DethiQuery List 1. Query to display Employee Name, Job, Hire Date, Employee Number, for each employee with the Employee Number appearing first. 2. Query to display unique Jobs from the Employee Table. 3. Query to display the Employee Name concatenated by a Job separated by a comma, 4. Query to display all the data from the Employee Table. Separate each Column by a comma and name the said column as THE_OUTPUT. 5. Query to display the Employee Name and Salary of all the employees earning more than $2850. 6. Query to display Employee Name and Department Number for the Employee No= 7900. 7. Query to display Employee Name and Salary for all employees whose salary is not in the range of $1500 and $2850. 8. Query to display Employee Name and Department No. of all the employees in Dept 10 and Dept 30 in the alphabetical order by name. 9. Query to display Name and Hire Date of every Employee who was hired in 1981. 10.Query to display Name and Job of all employees who don't have a current Manager. 14.Query to display the Name, Salary and Commission for all the employees who eam commission. 12. Sort the data in descending order of Salary and Commission. 13.Query to display Name of all the employees where the third letter of their name is ‘A’. 14.Query to display Name of all employees either have two ‘R's or have two ‘A's in their name and are either in Dept No = 30 or their Mangers Employee No = 7788. 15.Query to display Name, Salary and Commission for all employees whose Commission ‘Amount is 14 greater than their Salary increased by 5%. 16. Query to display the Current Date, 17.Query to display Name, Hire Date and Salary Review Date which is the 1stMonday after si months of employment. 18. Query to display Name and calculate the number of months between today and the date each employee was hired. 49. Query to display the following for each employee eams < Salary> monthly bul wants <3*Current Salary>. Label the Column as Dream Salary. 20. Query to display Name with the ‘stletter capitalized and all other letter lower case and length of their name of all the employees whose name starts with‘ 5 ‘Nand ‘M. 21. Query to display Name, Hire Date and Day of the week on which the employee started 22. Query to display Name, Department Name and Department No for all the employees. 23. Query to display Unique Listing ofall Jobs that are in Department # 30 24, Query fo display Name, Department Name of all employees who have an ‘A’ in their nam96, Query to display Name, Job, Department No. and Department Name forall the employees working at the Dallas location. 26. Query to display Name and Employee no. Along with their Manger's Name and the Manager's employee no; along with the Employees Name who do not have a Manager. 27. Query to display Name, Department No. And Salary of any employee whose department No. and salary matches both the department no. And the salary of any employee who earns a commission. 28. Query to display Name and Salaries represented by asterisks, where each asterisk (*) signifies $100. 29. Query to display the Highest, Lowest, Sum and Average Salaries of all the employees. 30. Query to display the number of employees performing the same Job type functions. 31. Query to display the no. of managers without listing their names. 32. Query to display the Department Name, Location Name, No. of Employees and the average salary for all employees in that department. 33. Query to display Name and Hire Date for all employees in the same dept. as Blake. 34. Query to display the Employee No. And Name for all employees who eam more thanthe average salary. 35. Query to display Employee Number and Name for all employees who work in a department with any employee whose name contains a 'T’. 36. Query to display the names and salaries of all employees who report to King. CORE COURSE - VI SEMESTER 282 YEAR 100 MARKS) LOGIC AND DISCRETE MATHEMATICAL STRUCTURE UNIT =1 Logic and Proofs: Propositional Logic, Propositional Equivalences, Predicates and Quantifiers, Nested Quantifiers, Rules of Inference, Introduction to Proofs, Normal Forms, Proof Methods and Strategy, Mathematical Induction. UNIT =I Sets & Functions: Sets, Set Operations, Functions, Recursive Functions, Sequences and ‘Summations. Relations; Representing Rel Relations and their Properties, n-ary Relations and their Applications, ns, Closures of Relations, Equivalence Relations, Partial Ordering.UNIT =I : Jean Ful Algebra: Boolean Functions, Representing Booleal Circuits. Algebraic Structures: The Structure of Algebras, Homomorphism, Normal Subgroups. Counting: Basics of Counting, The Pigeonhole Princi Binomial Coefficients, Applications of Inclusion-Exclusion, Probability, Bayes’ Theorem. nctions, Logic Gates, Minimization of Semi-groups, Monoids and Groups, iple, Permutations and Combinations, Discrete probability, Conditiona, UNIT -1V : Graphs: Graphs and Graph Models, Graph Terminology and Special Types of Graphs, Havel. Hakimi Theorem, Representing Graphs and Graph Isomorphism, Connectivity, Cut-Sets, Euler and Hamiltonian Paths, Shortest-Path Problem, Planar Graphs, Graph Coloring, Network Flows, rooted trees and path length in rooted trees, Spanning tree and Minimal Spanning tree, Isomorphism of trees, Weighted trees and Prefix Codes. Trees: Tree: TEST BOOKS: 1. Kenneth H Rosen, Discrete Mathematics & Its Applications, McGraw-Hill. 7/e. REFERENCE BOOKS: 1. Discrete mathematical structures by B Kolman RC Busby, S Ross PHI Pvt. Ltd. 2. J. L. Hein, Discrete Structures, Logic, and Computability, 3rd Edition,Jones and Bartlett Publishers, 2009 3. C.L. Liu , D.P. Mahopatra, Elements of Discrete mathematics, 2nd Edition, Tata McGraw Hill 4.M. O. Albertson and J. P. Hutchinson, Discrete Mathematics with Algorithms , John wiley Publication. 5. Discrete Mathematics for computer scientists and Mathematicians, Joe L. Mott, Abraham Kandel Theodore P. Baker, Prentice - Hall of India Pvt. Ltd. CORE COURSE - VII SEMESTER - Ill 2N° YEAR 15 + 60 = 75 MARKS, OPERATING SYSTEMS, UNIT -1 Operating System, Computer-System Organization, Computer-System Architecture, Operating- System Structure, Operating-System Operations, Process Management, Memory Management, Storage Management, Protection and Security, Distributed Systems, Special Purpose Systems, Computing Environments, Open-Source Operating Systems. Types of operating systems (LINUX/UNIX & WINDOWS) Operating System Services, User Operating System Interface, System Calls, Types of System Calls, System Programs, Operating-System Design and Implementation, Operating System Structure, Operating System Debugging, Operating System Generations. shell programming in bash. Conditional and looping statements, case statement, parameter passing and arguments, Writing and executing simple scripts.UNIT - I Process: Process Concept, Process Scheduling, Operations on Processes, Inter- Process Communication, Examples of IPC Systems, Communication in Client- Server Systems. Multithreaded Programming: Multithreading Models, Thread Libraries, Threading Issues, Operating-System Examples. Process Scheduling: Basic Concepts, Scheduling Criteria, Scheduling Algorithms, Thread Scheduling. Multiple-Process Scheduling. Synchronization: The Critical Section Problem, Peterson's Solution, Synchronization Hardware, Semaphores, Classical Problems of Synchronization, Monitors, Synchronization Examples, Atomic Transactions. UNIT - til Deadlocks: System Model, Deadlock Characterization, Methods of Handling Deadlocks, Deadlock Prevention, Deadlock avoidance, Deadlock Detection, Recovery from Deadlock, Starvation, Memory Management Strategies: Swapping, Contiguous Memory Allocation, Paging, Structure of the Page Table, Segmentation, Example: The Intel Pentium. UNIT - IV Virtual-Memory Management: Demand Paging, Copy-on-Write, Page Replacement, Allocation of Frames, Thrashing, Memory-Mapped Files, Allocating Kernel Memory. File System: File Concept, Access Methods, Directory and Disk Structure, File-System Mounting, File Sharing, Protection. TEST BOOKS: 1. A Silberschatz, P.B. Galvin, G. Gagne, Operating Systems Concepts, 8/e, Wiley Student Edition 2009. REFERENCE BOOKS: 1. AS, Tanenbaum, Modern Operating Systems, 3/e, Pearson Education ,2007 2. W. Stallings, “Operating Systems, Internals & Design Principles”, S/e, Prentice Hall of India. 2008. 3. Neil Mathew & Richard Stones - Beginning Linux Programming, Fourth edition, Wiley Dreamtech , india. 4. M. Milenkovic Operating Systems - Concepts and design, Tata McGraw Hill 5 .Operating Systems - A Concept based Approach , TMH. SEMESTER - Ill_ CORE — Vil (PRACTICAL) 2" YEAR (25 MARKS ) LIST OF EXPERIMENTS: 1. Write a program (using fork() and/or exec() commands) where parent and child execute: a) same program, same code. b) same program, different code. ©) before terminating, the parent waits for the child to finish its task. 2. Write a program to report behavior of Linux kemel including kemel version, CPU type and model. (CPU information)3. Write a program to report behavior of Linux kemel including information on configured Memory, amount of free and used memory. (memory information) 4. Write a program to print fle details including owner access permissions, file access time, where file name is given as argument. 5. Write a program to copy files using system calls. 6. Write a program using C to implement FCFS scheduling algorithm. 7. Write a program using C to implement Round Robin scheduling algorithm. 8. Write a program using C to implement SUF scheduling algorithm. 9. Write a program using C to implement non-preemptive priority based scheduling algorithm. 10. Write a program using C to implement preemptive priority based scheduling algorithm. 11. Write a program using C to implement SRTF scheduling algorithm. 12. Write a program using C to implement first-fit, best-fit and worst-fit allocation strategies. CORE COURSE - VIII JAVA PROGRAMMING UNIT -1 Introduction to Java: Java Architecture and Features, Understanding the semantic and syntax differences between C++ and Java, Compiling and Executing a Java Program, Variables, Constants, Keywords Data Types, Operators (Arithmetic, Logical and Bitwise) and Expressions. Comments, Doing Basic Program Output, Decision Making Constructs (conditional statements and loops) and Nesting, Java Methods (Defining, Scope, Passing and Returning Arguments, Type Conversion and Type and Checking, Built-in Java Class Methods). UNIT - Arrays, Strings and VO: Creating & Using Arrays (One Dimension and Multidimensional), Referencing Arrays Dynamically, Java Strings: The Java String class, Creating & Using Stind Objects, Manipulating Strings, String Immutability & Equality, Passing Strings To & FO" Methods, String Buffer Classes. Simple /O using System.out and the Scanner class, Byte 2" Character streams, ReadingMWriting from console and files. Object-Oriented Programming Overview: Principles of Object-Oriented Programming. Defining TUS eae, Conta ‘Access to Class Members, Class Constructors, Method Overloading, Class Variables & Methods Objects as parameters, final classes, Object class, Garbage Collection.UNIT = II Inheritance, Interfaces, Packages, Enumerations, Autoboxing and Metadata: Inheritance: (Single Level and Multilevel, Method Overriding, Dynamic Method Dispatch, Abstract Classes), Interfaces and Packages, Extending interfaces and packages, Package and Class Visibility, Using Standard Java Packages (util, lang, io, net), Wrapper Classes, Autoboxing/Unboxing, Enumerations and Metadata. UNIT -1V Exception Handling, Threading, Networking and Database Connectivity: Exception types, uncaught exceptions, throw, built-in exceptions, Creating your own exceptions; Multi-threading: The Thread class and Runnable interface, creating single and multiple threads, Thread prioritization, synchronization and communication, suspending/resuming threads. Using java.net package, Overview of TCP/IP and Datagram programming. Accessing and manipulating databases using JDBC. Applets and Event Handling: Java Applets: Introduction to Applets, Writing Java Applets, Working with Graphics, Incorporating Images & Sounds. Event Handling Mechanisms, Listener Interfaces, ‘Adapter and Inner Classes. The design and Implementation of GUIs using the AWT controls, Swing components of Java Foundation Classes such as labels, buttons, text fields, layout managers, menus, events and listeners; Graphic objects for drawing figures such as lines, rectangles, ovals, using different fonts. Overview of servlets. TEST BOOKS: 1. E, Balagurusamy, “ Programming with Java’, 4/e, TMH REFERENCE BOOKS: 4. Bruce Eckel, "Thinking Java", 8/e, Pearson India, 2010. 2. John R. Hubbard, "Programming with JAVA", Schaum's Series, 2/e, 2004. 3. Hebert Schildt , “ The Complete Reference to Java" , TMH, 10" ed. SEMESTER - IV, CORE - Vill (PRACTICAL) 282 YEAR (25 MARKS) LIST OF PRACTICALS 1. To find the sum of any number of integers entered as command line arguments. 2. To find the factorial of a given number. 3. To convert a decimal to binary number. 4. To check if a number is prime or not, by taking the number as input from the keyboard. 5. To find the sum of any number of integers interactively, i.e., entering every number from the keyboard, whereas the total number of integers is given as a command line argument. 6. Write a program that show working of different functions of String and StringBufferclasss like setCharAt( ), setLength(), append(), insert(), concat(Jand equals(). 7.Write a program to create a — “distance” class with methods where distance is computed interms of feet and inches, how to create objects of a class and to see the use of this pointer8. Modify the ~ “distance” class by creating constructor for assigning values (feetandinches)tg the distance object. Create another object and assign second object as reference variable tg another object reference variable. Further create a third object which is a clone of the first object. 9. Write a program to show that during function overloading, if no matching argument is found, then Java will apply automatic type conversions(from lower to higher data type) 10. Write a program to show the difference between public and private access specifiers. The Program should also show that primitive data types are passed by value and objects are passed by reference and to leam use of final keyword. 11. Write a program to show the use of static functions and to pass variable length arguments ina function. 14. Write a program to demonstrate the concept of boxing and unboxing. 15. Create a multi-file program where in one file a string message is taken as input from the user and the function to display the message on the screen is given in another file (make use of ‘Scanner package in this program). 16. Write a program to create a multilevel package and also creates a reusable class to generate Fibonacci series, where the function to generate Fibonacci series is given in a different file belonging to the same package. 17. Write a program that creates illustrates different levels of protection in classes/subclasses belonging to same package or different packages 18. Write a program — “Divide By Zero” that takes two numbers a and b as input, computes alb, and invokes Arithmetic Exception to generate a message when the denominator is zero. 19. Write a program to show the use of nested try statements that emphasizes the sequence of checking for catch handler statements. 20. Write a program to create your own exception types to handle situation specific to your application (Hint: Define a subclass of Exception which itself is a subclass of Throwable). 21. Write a program to demonstrate priorities among multiple threads. 22. Write a program to demonstrate different mouse handling events like mouseClicked(), mouseEntered(), mouseExited(), mousePressed( ), mouseReleased() &mouseDragged(). 23. Write a program to demonstrate different keyboard handling events.CORE COURSE - IX SEMESTER — 1V. 2N° YEAR (15 + 60 = 75 MARKS) SOFTWARE ENGINEERING UNIT-1 Introduction: Evolution of Software to an Engineering Discipline, Software Development Projects, Exploratory Style of Software Development, Emergence of Software Engineering, Changes in Software Development Practices, Computer Systems Engineering. Software Lifecycle Models: Waterfall Model and its Extensions, Rapid Application Development (RAD), Agile Development” Models, Spiral Model eee eee UNIT-II Software Project Management: Software Project Management Complexities, Responsibilities of a Software Project Manager, Project Planning, Metrics for Project Size Estimation, Project Estimation Techniques, Empirical Estimation Techniques, COCOMO, Halstead's Software Science, Staffing Level Estimation, Scheduling, Organization and Team Structures, Staffing, Risk Management, Software Configuration Management. UNIT-IIt Design and Implementation: Object-Oriented Design using the UML, Design Patterns, Implementation Issues, Open Source Development, Software Testing: Development Testing, Test-Driven Development, Release Testing, User Testing,Software Evolution: Evolution Processes, Program Evolution Dynamics, Software Maintenance, Legacy System Management, Dependability and Security. UNIT-IV Requirement Analysis and Specification: Requirements Gathering and Analysis, Software Requirement Specifications, Formal System Specification Axiomatic Specification, Algebraic Specification, Executable Specification and 4GL. Software Design: Design Process, Characterize a Good Software Design, Cohesion and Coupling, Layered Arrangements of Modules, Approaches to Software Design (Function Oriented & Object-Oriented). Coding and Testing: Coding: Code Review, Software Documentation, Testing, Unit Testing, Black Box and White Box Testing, Debugging, Program Analysis Tools, Integration Testing, System Testing, Software Maintenance. TEST BOOKS: 4. Fundamental of Software Engineering, Rajib Mall, Fifth Edition, PHI Publication, India. REFERENCE BOOKS: 1. Software Engineering lan Sommenville, 10/Ed, Pearson. 2.. Software Engineering Concepts and Practice - Ugrasen Suman, Cengage Leaming India Pvt, Ltd. 3. Principles of Software Engineering & System Design - R. Misra, C. Panigrahi, B. Panda, YesDee PublicationSEMESTER - IV, CORE - IX (PRACTICAL 2N YEAR 25 MARKs LIST OF PRACTICALS 4, + Problem Statement, + Process Model Requirement Analysis: + Creating a Data Flow + Data Dictionary, Use Cases 3. Project Management: + Computing FP + Effort + Schedule, Risk Table, Timeline chart 4. Design Engineering: + Architectural Design + Data Design, Component Level Design 5. Testing: + Basis Path Testing CORE COURSE - X SEMESTER — IV. 2N YEAR. __(15 + 60 = 75 MARKS) COMPUTER GRAPHICS UNIT -1 Introduction Computer Graphics and Primitive Algorithms: Introduction to Image and Objects, Image Representation, Basic Graphics Pipeline, Bitmap and Vector-Based Graphics, Applications of Computer Graphics, Display Devices, Cathode Ray Tubes, Raster-Scan Display, Random-Scan Display, Flat Panel Display, Input Technology, Coordinate System Overview. Scan-Conversion of graphics primitives: Scan-Conversion of a Lines (Digital Differential Analyzer Algorithm, Bresenham's Line- Drawing Algorithm, Scan-Conversion of Circle and Ellipse (Bresenham's Method of Circle Drawing, Midpoint Circle Algorithm),Drawing Elipses and Other Conics. UNIT Il Two Dimensional Transformation: Introduction to transformations, Transformation Matrix, Types of Transformations in Two-Dimensional Graphics: Identity Transformation, Scaling. Reflection, Shear Transformations, Rotation, Translation, Rotation about an Arbitrary Point Combined Transformation, Homogeneous Coordinates, 2D Transformations using Homogeneous Coordinates. Three-dimensional transformations: Objects in Homogeneous Coordinates; The Dimensional Transformations: Scaling, Translation, Rotation, Shear Transformations, Reflection. World Coordinates and Viewing Coordinates, Projection, Parallel Projection, PersPe* Projection.UNIT - Ill Viewing and Solid Area Scan-Conversion : Introduction to viewing and clipping, viewing Transformation in Two Dimensions, Introduction to Clipping, Two-Dimensional Clipping, Point Gipping, Line Clipping, Introduction to a Polygon Clipping, Viewing and Clipping in Three Dimensions, Three-Dimensional Viewing Transformations, Text Clipping. UNIT - IV Introduction to curves, Curve Continuity, Conic Curves, Piecewise Curve Design, Parametric Curve Design, Spline Curve Representation, Bezier Curves, B-Spline Curves, Fractals and its applications. Surface Design : Bilinear Surfaces, Ruled Surfaces, Developable Surfaces, Coons Surfaces, Surface of Revolution, Quadric Surfaces,Constructive Solid Geometry, Patch, Sweep Bezier Surfaces, B-Spline Surfaces, Subdivision Surfaces. Visible Surfaces : Introduction to visible and hidden surfaces, Coherence for visibility, Extents and Bounding Volumes, Back Face Culling, Painter's Algorithm, Z-Buffer Algorithm, Floating Horizon Algorithm, Roberts Algorithm. TEST BOOKS: 1. Mathematical elements of Computer Graphics, David F. Rogers, J.Alan Adams, MGH, 2ed 2. Computer Graphics with Open GL, Donald Heam and M. Pauline Baker, Pearson Education . REFERENCE BOOKS: 14. Computer Graphics, R. K. Maurya, John Wiley. Procedural elements of Computer Graphics, David F. Rogers, Tata McGraw-Hill. ~ Introduction to Computer Graphics, J.D. Foley, A. Van Dam, S. K.Feiner, J.F. Hughes and 3. RL. Phillips, Addision Wesley. SEMESTER - IV, CORE ~ X (PRACTICAL) 2"? YEAR 25 MARKS LIST OF PRACTICALS (USING C / C++#/ JAVA) 4. Write a program to implement Bresenham's line drawing algorithm. 2. Write a program to implement mid-point circle drawing algorithm. 3. Write a program to clip a line using Cohen and Sutherland line clipping algorithm. 4. Write a program to clip a polygon using Sutherland Hodgeman algorithm. 5. Write a program to apply various 2D transformations on a 2D object (use homogenous coordinates). 6. Write a program to apply various 3D transformations on a 3D object and then apply parallel and perspective projection on it.CORE COURSE = XT EMESTER - V 3° YEAR 15 + 60 = 75 MARKs) COMPUTER NETWORK UNIT ~1 Introduction to Computer Networks, Components of a computer network Based on transmission technology, Based on their scale, LAN ,MAN, WAN . , Networks, Internets, Intranets, Protocols, OSI and TCP/IP . Network Devices and drivers : Router. Modem, Repeater, Hub, Switch, Bridge (Fundamental Concept only). Models. Network Topologies- Bus Topology, Ring Topology, Star Topology, Mesh Topology. Physical Layer - Signals, Analog, Digital, Analog vs Digital, Transmission impairment, Data Rate UNIT =I Data Link Layer -Framing, Flow & Error Control, Stop-N- Wait ARQ, Go Back N ARQ, Selective Repeat ARQ. Medium Access-Random access (ALOHA, CSMA/CD, CSMAICA) Transmission media: Guided Media, Unguided Media Switching: Introduction, circuit switched networks, packet switching, structure of a switch. Error detection and correction, block coding, cyclic codes, checksum, forward error correction, error correcting codes, error detecting codes. UNIT - IL Network layer protocol - internetworking, IPv4, Unicast, Broadcast and Multicast addresses, Subnetting, Super-netting, IPv4 protocol packet format, fundamentals of IPv6 Addresses, Address mapping (ARP, RARP, BOOTP, DHCP), ICMP, IGMP UNIT -IV Introduction to the Transport Layer: Introduction, Transport layer protocols (Simple protocol, Stop-and-wait protocol, Go-Back-n protocol, Selective repeat protocol, Bidirectional protocols), Transport layer services, User datagram protocol, Transmission control protocol, Domain Name System (DNS)-Name Space, Domain Name space, Distribution of name space, ONS in internet, Resolution. Remote Logging (Telnet), Electronic Mail, Simple Mail Transfer Protocol (SMTP), Mail Access Protocols (POP, IMAP), File Transfer Protocol (FTP) WWW, HTTP. TEXT BOOKS: 1, Data Communications and Networking: Behrouz A. Forouzan, Tata McGraw-Hill, 4thEd. 2. TCPIP Protocol Suite , Behrouz A. Forouzan , Fourth Edition , Tata McGraw HilREFERENCE BOOKS: 4, Computer Networks:A system Approach:Larry L, Peterson and Bruce S. Davie,Elsevier, AthEd 2. Computer Networks: Natalia Olifer, Victor lifer, Willey India. 3. Computer Networks: A. S. Tannenbum, D. Wetherall, Prentice Hall, Imprint of Pearson, SthEd. 4, Computer Networking: A Top-Down Approach, James F. Kurose, K.W. Ross, Pearson.6" ed. SEMESTER - V,, CORE ~ XI (PRACTICAL, 38° YEAR 25 MARKS COMPUTER NETWORK LAB . Simulate Even Parity generator and Checker . Simulate two dimensional Parity generator and checker. }. Simulate checksum generator and checker. |. Simulate Hamming Code method. . Simulate Cyclic Redundancy Check (CRC) error detection algorithm for noisy channel. . Simulate and implement stop and wait protocol for noisy channel. Simulate and implement go back and sliding window protocol. . Simulate and implement selective repeat sliding window protocol. |. Simulate and implement distance vector routing algorithm. CeEnNaneena CORE COURSE - XII SEMESTER - V_ 3°° YEAR ‘15 + 60 = 75 MARKS) DESIGN AND ANALYSIS OF ALGORITHM UNIT -1 Introduction, Definition, Chrematistics of algorithm, Growth of Functions, Asymptotic analysis, Amortized analysis, standard notations and common functions, Recurrences, solution of recurrences by substitution, recursion tree, induction method, and Master methods, Algorithm design techniques, worst case analysis of Merge sort, Quick sort and Binary search, Design & Analysis of Divide and conquer algorithms.UNIT - II Heapsort mechanism, Heaps, Building a heap, The heapsort algorithm, Priority Queue, (oy, bounds for sorting. Dynamic programming methodology, Elements of dynamic Program ; Matrix-chain multiplication, Longest common subsequence, Greedy Algorithms, Elements Greedy strategy, Assembly-line scheduling, Activity selection Problem, Fractional knapsay problem, Huffman codes). UNIT — II Data structure for disjoint sets, Disjoint set operations, Linked list representation, pa, compression, Disjoint set forests. Graph Algorithms and their characteristics, Breadth first search and depth-first search, Minimum Spanning Trees, Kruskal algorithm and Prim's algorithms, single- source shortest paths (Bellman-ford algorithm and Dijkstra's algorithms), All-pairs shortest Paths (Floyd — Warshalll Algorithm). UNIT -IV Back tracking, Branch and Bound, Eight Queen problem, string matching algorithms, naive sting Matching algorithm, Rabin-Karp algorithm, Knuth—MorrisPratt algorithm, NP - Completeness (Polynomial time, Polynomial time verification, NP - Completeness and reducibility, NP-Complete Problems (without Proofs), Approximation algorithms characteristics, Traveling Salesman Problem. TEXT BOOKS : 1. T.H. Cormen, C.E. Leiserson, R.L. Rivest, C.Stein : Introduction to Algorithms, 2" Edition, PHI Leaming Pvt. Ltd. 2. H. Bhasin: Algorithms, Design and Analysis, First Edition, Oxford Higher Education. REFERENCE BOOKS : 1. Sanjay Dasgupta, Umesh Vazirani: Algorithms, McGraw-Hill Education. 2. Horowitz & Sahani, Fundamentals of Algorithm, 2nd Edition, Universities Press. 3. Goodrich, Tamassia, Algorithm Design, Wiley India.LIST OF PRACTICALS (USING C++) 1. i, Implement Insertion Sort (The program should report the number of comparisons) ii, Implement Merge Sort(The program should report the number of comparisons) 2. Implement Heap Sort(The program should report the number of comparisons) 3,[mplement Randomized Quick sort (The program should report the number of comparisons) 4, Implement Radix Sort 5, Create a Red-Black Tree and perform following operations on it: i. Insert a node , ii. Delete anode, iii, Search for a number & also report the color of the node containing this number. 6. Write a program to determine the LCS of two given sequences 7. Implement Breadth-First Search in a graph 8. Implement Depth-First Search in a graph 9. Write a program to determine the minimum spanning tree of a graph for the algorithms at SI. No.1 to 3 test run the algorithm on 100 different inputs of sizes varying from 30 to 1000. Count the number of comparisons and draw the graph. Compare it with a graph of nlogn. 10. Write down a program to find out a solution for 0 / 1 Knapsack problem. 14. Implement binary search and linear search in a program. 42. Write a program to implement Krushkal's algorithm. 43. Write a program to implement Prim's algorithm. 44, Implement Travelling salesman Algorithm to find the minimum shortest path between four cities. 15. Using dynamic programming implement LCS. 46. Find out the solution to the N-Queen problem. (bjimplement back tracking using game trees.CORE COURSE - XIII SEMESTER - VI 3° YEAR MICROPROCESSOR (INTEL 8085) UNIT-1 ARCHITECTURE OF 8085 MICROPROCESSOR Functional block diagram of Intel 8085- Register structure-multiplexing & Demultiplexing of address / data bus - Control Signal Generation and status signals - 8085 pin-out diagram & functions - Interrupts - Priority Concept INSTRUCTION SET OF 8085 -Instruction set classification - addressing modes UNIT - II MEMORY-Instruction cycle - machine cycle - T-state -Timing diagrams for Opcode Fetch Cycle Memory Read, Memory Write, VO Read, 1/0 Write, - Functional explanation for RAM, ROM, EPROM, EEPROM. UNIT- Ill PROGRAMMING 8085- addition & subtraction(16-bit), multiplication, division, largest, smallest, block data transfer (all 8-bit data), Binary to BCD, BCD to Binary, Binary to ASCII, ASCII to Binary, BCD to ASCII, ASCII to BCD (all 6-bit data) - Stack & Subroutines Concept - time delay using single and double register & calculations ~ Debugging program. UNIT- IV INTERFACING MEMORY - 2K X 8, 4K X 8 ROM, RAM to 8085, Interfacing an /O portin Memory Mapped VO and VO Mapped V/O - Difference between VO mapped and Memory Mapped VO. MICROPROCESSOR APPLICATIONS - Programmable Peripheral devices (8255,8253)- Pin functions, Different Modes & Block Diagram - Keyboard and Display Interface 8279 (Architecture) - Simple temperature controller- Simple traffic ight controller-stepper motor control interface. TEXT BOOKS : 1, Ramesh S. Gaonakar, Microprocessor Architecture, Programming and Application with the 8085- PenramLntemational Publishing, Mumbai. 2. Mathur A.P., Introduction to Microprocessors ,3rd edn., Tata McGraw, New Delhi.REFERENCE BOOKS : 4. N -Senthilkumar, M. Saravanan & S. Jeevananthan, Microprocessors & Microcontrollers, 1st edition, Oxford press(Helpful for interfacing applications) 2. Leventhal L.A., Microprocessor Organisation and Architecture, Prentice Hall India. 3, Ram, Fundamentals of microprocessors and microcomputers - Dhanpat Rai Publications, New Delhi. 4, Microprocessors & Microcontrollers by B.P.Singh, Galgotia publications Pvt.Ltd. SEMESTER - VI, CORE — XI (PRACTICAL) 3° YEAR (25 MARKS ) LIST OF PRACTICALS (USING C /C++ /JAVA) 1 Addition and subtraction of two 8 bit numbers with carry and borrow 2. Sum of n numbers (n <= 10). Find smallest /greatest number. 3. Transfer of memory block i) overtapping and ji) not overlapping. 4..Multiplication of two positive numbers with product greater than 255. CORE COURSE - XIV SEMESTER — VI. 3°2 YEAR (15 + 60 = 75 MARKS) ARTIFICIAL INTELLIGENCE UNIT -I Introduction to Al and Searching Techniques , Introduction to Al What is AI? The Foundations of Artificial Intelligence The State of the Art Agents and Environments, Good Behavior: The Concept of Rationality, the Nature of Environments, the Structure of Agents Searching Techniques Problem-Solving Agents, Example Problems, Searching for Solutions. UNIT - It Uninformed Search Strategies, Informed (Heuristic) Search Strategies, Heuristic Functions, Local Search Algorithms and Optimization Problems. Problem Solving and Searching Techniques , Problem Characteristics, Production Systems, Control Strategies, Breadth First Search, Depth First Search, Hill cimbing and its Variations, Heuristics Search Techniques: Best First Search.UNIT - I AX algorithm, Constraint Satisfaction Prob Playing, Min-Max and Alpha-Beta pruning algo to First Order Predicate Logic, Resolution Algorithms, Genetic Algorithms g-End Analysis, Introduction 10 Gan, Knowledge Representation, Introduction ification Introduction to Gene, Jem, Mean: rithms. Principle, U UNIT -1V Introduction to Fuzzy System, Fuzzy Systems The Case ie ee eae Perspective, The Utility of Fuzzy Systems, Limitations of Fuzzy Sys! wn a ae Uncertainty and Accuracy, Uncertainty and Information, The Unkn« a i is and Membership, Chance verses Fuzziness. A Brief History of Evolutionary ae — 1@ Appeal for Evolution, Biological Terminology, Search Spaces and Finest ton aa ee Genetic Algorithms, A Simple Genetic Algorithm . Some Applications of Genetic Algorithms. TEXT BOOKS : {.Stuart Russel, Peter Norvig, “Artificial Inteligence A Modem Approach”, Pearson Education (3/ED) 2. Elaine Rich, Kevin Knight, “Artificial Intelligence” , TMH,3/ED REFERENCE BOOKS : 4. DAN W. Patterson, “Introduction to Artificial Intelligence and Expert Systems” , PHI 2. Ivan Bratko, Prolog Programming for Artificial Intelligence, Addison-Wesley, Pearson Education, 3rd edition, 2000. 3. W.F. Clocksin and Mellish, Programming in PROLOG, Narosa Publishing House, 3rd edition, 2001. Vi, CORE - XIV (PRACTICAL, 3°° YEAR 25 MARKS ARTIFICIAL INTELLIGENCE LAB (USING C++, JAVA) SEMESTE! 1. Implementation of any 2 uninformed search methods with some meaningful application. 2, Implementation of any 2 informed search methods with some application. 3. Implementation of a simple NN for any suitable application (with toovlibrary). 4, Implementation of a simple NN for any suitable application (without tool). 5. Implementation of a simple GA for any suitable application (with toolibrary). 6. Implementation of a simple NN for any suitable application (without tool). 7. implementation of MiniMax approach for TIC-TAC-TO| “TOE using Java/ C++DISCIPLINE SPECIFIC ELECTIVE: DSE - 1 SEMESTER — V. 3°° YEAR (15 + 60 = 75 MARKS) NETWORK SECURITY AND INTERNET TECHNOLOGY UNIT! Computer Security and Cryptography Computer Security ; Introduction, Need for security, Principles of Security, Types of Attacks Cryptography : Plain text and Cipher Text, Substitution techniques, Caesar Cipher, Mono-alphabetic Cipher, Polygram, Poly alphabetic Substitution, Playfair, Hill Cipher, Transposition techniques, Encryption and Decryption, Symmetric and ‘Asymmetric Key Cryptography, Diffie-Hellman Key Exchange. UNIT II Symmetric Key, Asymmetric Key Algorithms, Digital Signature DES, AES, Brief history of Asymmetric Key Cryptography, Overview of Asymmetric Key Cryptography, RSA algorithm, Blowfish, Digital Signatures, Digital Certificates, Private Key Management, PKI and Security. UNIT III Network Security What makes Network Vulnerable? Who attacks Networks? Threats in Transit: Eavesdropping and wiretapping, Spoofing, DoS and DDoS, Link Encryption, End-to-End encryption, VPN, IPSec, Kerberos, Firewall, different types of firewall, IDS, Different types of IDS, Security of E-Mail. UNIT IV Transmission control protocol, User datagram protocol Socket Programming and RMI Transmission contro! protocol Services, Transmission control protocol handshake, Concept of windows in TCP, Congestion control, UDP Datagram, Socket concept, Types of socket, Sockets for Clients, Sockets for Servers, Remote Method Invocation, RMI Programming. Socket concept, Types of socket, Sockets for Clients, Sockets for Servers, Remote Method Invocation, RMI Programming. Application of Transmission control protocol and user datagram protocol in network layer. TEXT BOOKS : 1. Atul Kahate: Cryptography and Network Security by Atul Kahate, 2nd Edition, Tata McGrawHill. 2. Behrouz A. Forouzan: TCP/IP Protocol Suite, 4th Edition, Tata McGrawHill REFERENCE BOOKS: 1. Charles P Pfleeger, S.L. Pfleger, ,” Security in Computing’, Pearson.gfo_YEAR 25 MARKS SEMESTER - Vi, DSE - 1 (PRACTICAL! LIST OF PRACTICALS , er. 1. Write a socket program using TCP to find the factorial of a numbs provided is even or odd. x Write a socket program using UDP to whether the number implement a menu driven task. o - Write a program using RMI concept to of number. ption and decryption. . Write RMI program to implement sum of digits a Write a java code to implement Caeser Cipher with encry 6. Write a java code to implement polygram substitution Cipher with encryption and decryption 7. Write java program to implement RailFence Transposition Technique taking no of rows from the user as input. 8. Write java program to implement Vernam cipher with encryption and decryption. 9. Implement RSA algorithm accepting the inputs from user. 10. Implement the Biow Fish algorithm. 11. Implement the sub byte transformation using S-Box of AES. 12. Implement digital signature in the program DISCIPLINE SPECIFIC ELECTIVE: DSE - 2 SEMESTER - V 3° YEAR (15 + 60 = 75 MARKS) CLOUD COMPUTING UNIT -I Introduction : Introduction to Cloud Computing, History and Evolution of Cloud Computing, Types of clouds, Private Public and hybrid clouds, Cloud Computing architecture, Cloud computing infrastructure, Merits of Cloud computing, , Cloud computing delivery models and services (1aaS, PaaS, SaaS), obstacles for cloud technology, Cloud vulnerabilities. UNIT - I Cloud Computing Companies and Migrating to Cloud : Web-based busi ° iness , Delivering Business Processes from the Cloud: Business process examples, road Approaches © Migrating into the Cloud, The Seven Step Model of Migration into a Cloud, Efficient Steps for migrating to cloud., Risks’ Measuring and assessment of risks, Comps ms Risk Miugation methodology for Cloud computing, Case Studies, . Company concerUNIT - It Cloud Cost Management and Selection of Cloud Provider :Assessing the Cloud: software Evaluation, System Testing, Seasonal or peak loading, Cost cutting and cost-benefit analysis, Selecting the right scalable application. Considerations for selecting cloud solution. Understanding Best Practices used in selection of Cloud service and providers, Clouding the standards and Best Practices Issue: Interoperability, Portability, Integration, Security, Standards Organizations and Groups associated with Cloud Computing, Commercial and Business Consideration. UNIT -IV Interoperability, Portability, Integration, Security, Standards Organizations and Groups associated with Cloud Computing, Commercial and Business Consideration Governance in the Cloud: Industry Standards Organizations and Groups associated with Cloud Computing, Need for IT governance in cloud computing, Cloud Governance Solution: Access Controls, Financial Controls. Key Management and Encryption, Logging and Auditing, API integration. Legal Issues: Data Privacy and Security Issues, Cloud Contracting models, Jurisdictional Issues Raised by Virtualization and Data Location, Legal issues in Commercial and Business Considerations. , Cloud challenges, Practical applications of cloud computing. TEXT BOOKS : 4.Cloud Computing: Principles and Paradigms, RajkumarBuyya, James Broberg, Andrzej M. Goscinski,, John Wiley and Sons Publications, 2011. 2. Cloud Computing Bible, Barrie Sosinsky, Wiley-India, 2010. REFERENCE BOOKS : 1, Cloud Security: A Comprehensive Guide to Secure Cloud Computing, Ronald L. Krutz, Russell Dean Vines, Wiley-India, 2010. . Toby Velte, Anthony Velte, Robert Elsenpeter, Cloud Computing, A Practical Approach ‘McGraw Hills, 2010.RKS 2 (PRACTICAL) 3R2_YEAR CLOUD COMPUTING LAB 1. Create virtual machines that access different programs on same platform. 2. Create virtual machines that access different programs on different platforms. 3. Working on tools used in cloud computing online- a) Storage b) Sharing of data ¢) manage your calendar, to-do lists, d) a document editing tool B . Exploring Google cloud a Exploring Microsoft cloud o Exploring Amazon cloud DISCIPLINE SPECIFIC ELECTIVE: DSE - 3 SEMESTER - Vi 3P° YEAR (15 + 60 = 75 MARKS) THEORY OF COMPUTATION UNIT -1 Introduction to Automata: The Methods Introduction to Finite Automata, Structural Representations, Automata and Complexity. Proving Equivalences about Sets, The Contrapositive, Proof by Contradiction, Inductive Proofs: General Concepts of Automata Theory: Alphabets Strings, Languages, Applications of Automata Theory. Finite Automata: The Ground Rules, The Protocol, Deterministic Finite Automata: Definition of a Deterministic Finite Automata, How a DFA Processes Strings, Simpler Notations for DFA's, Extending the Transition Function to Strings, The Language of a DFA Nondeterministic Finite Automata: An Informal View. The Extended Transition Function, The Languages of an NFA, Equivalence of Deterministic and Nondeterministic Finite Automata. Finite Automata With Epsilon-Transitions: Uses of €- The Formal Notation for an €-NFA, Epsilon-Closures, Extended Transitions and Transitions, . ting €- Transitions. Languages for €-NFA's, Elimin:UNIT =I Regular Expressions and Languages: Regular Expressions: The Operators of regular Expressions, Building Regular Expressions, Precedence of Regular-Expression Operators, Precedence of Regular-Expression Operators Finite Automata and Regular Expressions: From DFA's to Regular Expressions, Converting DFA’s to Regular Expressions, Converting DFA's to Regular Expressions by Eliminating States, Converting Regular Expressions to Automata. Algebraic Laws for Regular Expressions: Properties of Regular Languages: The Pumping Lemma for Regular Languages, Applications of the Pumping Lemma Closure Properties of Regular Languages, Decision Properties of Regular Languages, Equivalence and Minimization of Automata, Context-Free Grammars and Languages: Definition of Context-Free Grammars, Derivations Using a Grammars Leftmost and Rightmost Derivations, The Languages of a Grammar, Parse Trees: Constructing Parse Trees, The Yield of a Parse Tree, Inference Derivations, and Parse Trees, From Inferences to Trees, From Trees to Derivations, From Derivation to Recursive Inferences, Applications of Context-Free Grammars: Parsers, Ambiguity in Grammars and Languages: Ambiguous Grammars, Removing Ambiguity From Grammars, Leftmost Derivations as a Way to Express Ambiguity, Inherent Ambiguity. UNIT — Pushdown Automata: Definition Formal Definition of Pushdown Automata, A Graphical Notation for PDA's, Instantaneous Descriptions of a PDA, Languages of PDA: Acceptance by Final State, Acceptance by Empty Stack, From Empty Stack to Final State, From Final State to Empty Stack Equivalence of PDA’s and CFG's: From Grammars to Pushdown Automata, From PDA's to Grammars Deterministic Pushdown Automata: Definition of a Deterministic PDA, Regular Languages and Deterministic PDA's, DPDA's and Context-Free Languages, DPDA's and Ambiguous Grammars Properties of Context-Free Languages: Normal Forms for Context-Free Grammars, The Pumping Lemma for Context-Free Languages, Closure Properties of Context- Free Languages, Decision Properties of CFL's UNIT -1V Introduction to Turing Machines: The Turing Machine: The Instantaneous Descriptions for Turing Machines, Transition Diagrams for Turing Machines, The Language of a Turing Machine, Turing Machines and Halting Programming Techniques for Turing Machines, Extensions to the Basic Turing Machine, Restricted Turing Machines, Turing Machines and Computers, Undecidability: A Language That is Not Recursively Enumerable, Enumerating the Binary Strings, Codes for Turing Machines, The Diagonalization Language An Undecidable Problem That Is RE: Recursive Languages, Complements of Recursive and RE languages, The Universal Languages, Undecidability of the Universal Language Undecidable Problems About Turing Machines: Reductions, Turing Machines That Accept the Empty Language. Post's Correspondence Problem: Definition of Post's Correspondence Problem, The “Modified” PCP, Other Undecidable Problems: Undecidability of Ambiguity for CFG'sTEXT BOOKS: tion, by J E.Hopcroft, R.Motwani a tation, by J: 4. Introduction to Automata Theory Languages: and Comp 4.D.Ullman (3rd Edition) - Pearson Education ge & Computations), PY K.L.Mishra & N, angua 2. Theory of Computer Science (Automata L: Chandrashekhar, PHI REFERENCE BOOKS: ion , PHI 1997. 1, Lewis & Papadimitriou, Elements of the theory of comp! uation e & Computation ,3rd Edition, 2. Hoperoft, Aho, Ullman, Introduction to Automata theory, Languads Pearson Education, 2006 Vid SEMESTER ~ VI, DSE - 3 (PRACTICAL) 0 YEAR 25 MARKS LAB Practice ( USING JFLAP) 1.Conversion of Non-deterministic finite automaton (NFA) to Deterministic finite automaton (DFA). 2. Conversion of FA to Regular Expression. 3. Converting FA to Grammar. 4. Conversion of Pushdown Automata to Context free Grammar. 5. Implementation of Turing machine. DISCIPLINE SPECIFIC ELECTIVE: DSE - 4 SEMESTER — VI 3° YEAR FTP, e-commerce, video conferencing, e. server, intemet address World Wide Web N) : : World Wik . resoure cal (URL). Browsers -inemet explore, netscape sve 2nd its evolution, uniform Mazi. Search engine, web saver -spache IS, poy soe HTTeatot Pera firefox, chrome, ‘ * HTTP protocol, .UNIT =I HTML and Graphics : HTML Tag Reference, Global Attributes, Event Handlers, Document Structure Tags, Formatting Tags, Text Level formatting, Block Level formatting, List Tags, Hyperlink tags, Image and Image maps, Table tags, Form Tags, Frame Tags, Executable content tags. Imagemaps : What are Imagemaps ? Client-side Imagemaps, Server-side Imagemaps, Using Server-side and Client-side Imagempas together, alternative text for Imagemaps, Tables :Introduction to HTML tables and their structure, Frames :Introduction to Frames, Applications, Frames document, The tag, Nesting tag, Placing content in frames with the tag, Targeting named frames, Creating floating frames, Using Hidden frames, Forms :Creating Forms, The

tag, Named Input fields, The tag, Multiple lines text windows, Drop down and list boxes, Hidden, Text, Text Area, Password. UNIT - III Java Script : Introduction, Client-Side JavaScript, Server-Side JavaScript, JavaScript Objects, JavaScript Security, Operators & Statements, Core JavaScript (Properties and Methods of Each) ‘Array, Boolean, Date, Function, Math, Number, Object, String, reg Exp, Document and its associated objects :document, Link, Area, Anchor, Image, Applet, Layer. Events and Event Handlers : General Information about Events, Defining Event Handlers,event, onAbort, onBlur, onChange, onClick, onDbIClick, onDragDrop, onError, onFocus, onKeyDown, onKeyPress, onKeyUp, onload, onMouseDown, onMouseMove, onMouseOut, onMouseOver, onMouseUp, onMove, onReset, onResize, onSelect, onSubmit,onUnload . UNIT - IV Style Sheets ‘What are style sheets?, Why are style sheets valuable? Different approaches to style sheets, Using Multiple approaches, Linking to style information in s separate file, Setting up style information, Using the tag, embedded style information, Using