Internal Assessment. IV Software Engineering 4 20 Marks 80 Marks 100 Marks. VII Operating Systems LAB 4-50 Marks 50 Marks 2. Total Marks

Transcription

1 Semester-I Mathematics Department Osmania University Proposed Choice Based Credit System (CBCS) M.Sc. Computer Science Scheme of Instruction and Examination ( ) S. No Code No Paper Paper Title Hours/ Week Internal Assessment Semester Exam Total Credits Theory 1 CS 101 T 2 CS 102 T 3 CS 103 T I Discrete Mathematical Structures II Programming Using Python III Operating Systems CS 104 T Practical 5 CS 105P 6 CS 106 P 7 CS 107 P 8 CS 108 P IV Software Engineering V VI Discrete Mathematics LAB Python Programming LAB VII Operating Systems LAB VIII Software Engineering LAB Total AddOn 1 Communication Skills

2 Semester-II S. No Code No Mathematics Department Osmania University Proposed Choice Based Credit System (CBCS) M.Sc. Computer Science Scheme of Instruction and Examination ( ) Paper Paper Title Hours/ Week Internal Assessment Semester Exam Total Credits Theory 1 CS 201 T 2 CS 202 T 3 CS 203 T I Advanced Java II Advanced RDBMS using Oracle III Computer Networks CS 204 T Practical 5 CS 205 P IV V Design and Analysis of Algorithms Advanced Java LAB CS 206 VI Oracle LAB P 7 CS 207 VII Networks LAB P 8 CS 208 VIII DAA LAB Total AddOn 2 Human Values and Professional Ethics

3 Mathematics Department Osmania University Proposed Choice Based Credit System (CBCS) M.Sc. Computer Science Scheme of Instruction and Examination ( ) Semester-III S. No Code No Paper Paper Title Hours/ week Theory Internal Assessment Semester Exam Total 1 CS 301 T I. NET Technologies and C# CS 302 T II Object Oriented Analysis and Design 3 CS 303 T Elective III A).Cloud Computing B). Robotics and artificial Intelligence CS 304 T Elective Practical IV A).Mobile Computing B). Cyber and Information Security Credits CS 305 P V Dot Net LAB CS 306 P VI Case Tools and UML LAB CS 307 P VII Lab Experiments on Cloud Computing/Robotics & AI 8 CS 308P VIII Lab Experiments on MC & CIS Total AddOn 3 Personality Development

4 Mathematics Department Osmania University Proposed Choice Based Credit System (CBCS) M.Sc. Computer Science Scheme of Instruction and Examination ( ) Semester-IV S. No Code No Paper Paper Title Hours/ Week Internal Assessment Semester Exam Total Credits Theory 1 CS 401 T I Mobile Application Development 2 CS 402 T II Distributed Systems 3 CS 403 T Elective III a) Formal Languages and Automata theory b) Big Data Analytics c) Machine Intelligence CS 404 PJ IV Project Work Practical 5 CS 405 P I Mobile Application Development 6 CS 406 P II Distributed Systems 7 CS 407 P III Language processing using Python Total

5 M.SC. COMPUTER SCIENCE SEMESTER-I CS-101T DISCRETE MATHEMATICAL STRUCTURES 4 Hr. per week UNIT-I: Mathematical Logic proofs Propositions New Propositions from old ones- Algorithms, Truth Tables and Tautologies- Equivalent Propositions- the conditional and bi conditionalargument and proofs of predicate Logic-Logical and electric circuits - Boolean algebra Boolean functions, some applications- Minimization. Section 1.1 to 1.9, 3.1 to 3.6 of (1). UNIT_II: Graph Theory Basic ideas and definitions Subgraphs - Components-Degrees of vertices-planar Graphs Properties of Planar graphs- Trees- Euler s formula,complete graphs- Complete Bipartite Graphs-Distance and diameter -Spanning Trees and Cut sets Directed graphs and Trees Paths, Cycles etc. Dijkstra s algorithm. UNIT-III: Elementary Combinations Basics of Counting combinations and permutations, their enumerations with repetitions- Engineering permutations with constrained repetitions Binomial coefficients the binomial theorem the principle of inclusion and exclusion. Section 2.2,Section 2.3,Section 2.4,Section2.7 UNIT-IV: Recurrence relations Generating functions of sequences calculating coefficients of generating functions Recurrance relations Solving recurrence relations by substitution and generating the method of characteristic roots. Section to Section 3.5 TEXT BOOKS: 1. Stephen A. Wiitala, Discrete Mathematics, A Unified Approach, Mc GrawHil International edition, Computer Science Series, New editions, available (if any) 2. Joe. L. Mott, Abraham Kandel, Theodore P. Basker; Discrete Mathematics for Computer Scientists and Mathematics, Prentice Hall, NJ,1986. REFERENCE BOOK: Kenneth H. Rosen; Discrete Mathematics, Mc Graw Hill International Edition.

6 CS 102T OPERATING SYSTEMS UNIT-I Introduction Mainframe systems Desktop Systems - Multiprocessor Systems - Distributed Systems Clustered Systems Real Time Systems Handheld Systems - Hardware Protection System Components Operating System Services System Calls System Programs Process Concept Process Scheduling Operations on Processes Cooperating Processes Inter process Communication. UNIT-II Threads Overview Threading issues CPU Scheduling Basic Concepts Scheduling Criteria Scheduling Algorithms Multiple Processor Scheduling Real Time Scheduling The Critical Section Problem Synchronization Hardware Semaphores Classic problems of Synchronization Critical regions monitors. UNIT III: System Model Deadlock Characterization Methods for handling Deadlocks Deadlock Prevention Deadlock avoidance Deadlock detection Recovery from Deadlocks - Storage Management Swapping Contiguous Memory Allocation - Paging Segmentation Segmentation with paging UNIT- IV: Virtual Memory Demand Paging Process Creation Page Replacement Allocation of frames Thrashing file Concept Access Methods Directory Structure File System Mounting File Sharing Protection File System Structure File System Implementation Directory Implementation Allocation Methods- Free space Management Kernel I/O Subsystems Disk Structure Disk Scheduling Disk Management Swap Space Management. Case study: The Linux System, Windows. REFERENCE BOOKS: 1. Abraham Silberschatz, Peter Baer Galvin and Greg Gagne, Operating System Concepts, Sixth Edition, John Wiley & Sons (ASIA) Pvt. Ltd, Harvey M. Deitel, Operating Systems, Second Edition, Pearson Education Pvt. Ltd, Andrew S. Tanenbaum, : Modern Operating Systems, Prentice Halla of India Pvt. Ltd, William Stallings, Operating System, Prentice Hall if India, 4 th Edition, PromodChnadraP.Bhatt An Introduction to Operating Systems, Concepts and Practice, PHI, 2003

7 CS 103T Programming using Python Unit I Introduction to Python Programming: Features, basic syntax, Writing and program, Basic Data Types such as numbers, executing simple Strings, etc, Declaring variables, Performing assignments, arithmetic operations, Simple inputoutput. Sequence Control Precedence of operators, Type conversion.conditional Statements: if, if-else, nested if else Looping: for, while, nested loops Control statements: Terminating loops, skipping specific conditions StringManipulation : declaring strings, string functions Manipulating Collections Lists, Tuples Unit II Dictionaries Concept of dictionary, techniques to create, update & delete dictionary items. Functions: Defining a function, calling a function, Advantages of functions, types of functions, function parameters, Formal parameters, Actual parameters, anonymous functions, global and local Variables Modules: Importing module, Creating & exploring modules, Math module, Random Module, Time module. Unit III Python File Input-Output: Opening and closing file, Various types of file modes, reading and writing to files, manipulating directories Exception Handling What is exception, Various keywords to handle exception such try, catch, except, else, finally, raise Regular Expressions Concept of regular expression, various types of regular expressions, using match function Unit IV GUI Programming in Python (using Tkinter/wxPython/Qt) -What is GUI, Advantages of GUI, Introduction to GUI libray, Layout management, Events and bindings, Font, Colors, drawing on canvas (line, oval, rectangle, etc.) Widget such as : Frame, Label, Button, Checkbutton, Entry, Listbox, Message, Radiobutton, Text, Spinbox etc. Text Box 1) Charles Dierbach, Introduction to Computer Science using Python, Wiley, ) James Payne, Beginning Python: Using Python 2.6 and Python 3, Wiley India, 2010 Additional References: 3) Paul Gries, Jennifer Campbell, Jason Montojo, Practical Programming: An Introduction to Computer Science Using Python 3, Pragmatic Bookshelf, 2/E ) Adesh Pandey, Programming Languages Principles and Paradigms, Narosa, ) Paul Gries, Jennifer Campbell, Jason Montojo, Practical Programming: An Introduction to Computer Science Using Python 3, Pragmatic Bookshelf, 2/E ) James Payne, Beginning Python: Using Python 2.6 and Python 3, Wiley India, 2010 Additional References: 7) A. Lukaszewski, MySQL for Python: Database Access Made Easy, Pact Publisher, 2010

8 CS-104T SOFTWARE ENGINEERING UNIT- I: Introduction to software Engineering Project size and its categories planning a software project software developing life cycle planning and organizational Structure. UNIT-II: Software cost estimation, Least factor cost estimation techniques maintenance cost estimation Software Requirement Specifications formal specification techniques. UNIT-III: Software Design Fundamental Design concepts and relations of Modularization Module design techniques detailed design consideration Implementation issues Structures coding techniques coding style standards and guidelines Documentation Verification and Validation techniques Quality Assurance Walk through and inspection Testing format verification. UNIT-IV: Software tools Overview of CASE Software reliability Software errors Faculty Repairs and availability Software maintenance Management aspects of maintenance Maintenance tools and techniques. TEXT BOOK: Pressman Software Engineering, Mc. Graw Hills Publishing Co., REFERENCE BOOK: R. Fairly Software Engineering, Mc. Graw Hills Publishing Co., CS 105P Discrete Mathematical Structures LABORATORY

9 CS 106P Python Programming LABORATORY Using the Operating system (logging, creating deleting folders, creating-deleting files, using editors etc.) (1) Installing python and setting up environment. Simple statements like printing the names, numbers, mathematical calculations,etc. (2) Simple programs containing variable declaration and arithmeticoperations (3) Programs based on conditionalconstructs (4) Programs based onloops (5) Programs related to stringmanipulation (6) Programs related to Lists,Tuples (7) Programs related todictionaries (8) Programs related to functions &modules 9. Programs to read & writefile. 10. Program to demonstrate exceptionhandling 11. Program to demonstrate the use of regularexpressions 12. Program to drawshapes 13. Program to show GUI controls andprocessing-i 14. Program to show GUI controls andprocessing-ii 15. Program to show databaseconnectivity 16. Programs to do searching andsorting

10 CS 107P OPERATING SYSTEM LABORATORY LIST OF EXERCISES (Implement the following on LINUX platform. Use C for high level language implementation) 1. Shell programming - command syntax - write simple functions - basic tests 2. Shell programming - loops - patterns - expansions - substitutions 3. Write programs using the following system calls of UNIX operating system: fork,exec, getpid,exit, wait, close, stat, opendir, readdir 4. Write programs using the I/O system calls of UNIX operating system (open,read,write, etc) 5. Write C programs to simulate UNIX commands like ls, grep, etc. 6. Given the list of processes, their CPU burst times and arrival times, display/print the Gantt chart for FCFS and SJF. For each of the scheduling policies, compute and print the average waiting time and average turnaround time 7. Given the list of processes, their CPU burst times and arrival times, display/print the Ganttchart for Priority and Round robin. For each of the scheduling policies, compute and print theaverage waiting time and average turnaround time 8. Implement the Producer Consumer problem using semaphores. 9. Implement some memory management schemes I 10. Implement some memory management schemes II EXAMPLE FOR EXPT 9 &10 : Free space is maintained as a linked list of nodes with each node having the starting byteaddress and the ending byte address of a free block. Each memory request consists of the process-id and the amount of storage space required in bytes. Allocated memory space is again maintained as a linked list of nodes with each node having the process-id, starting byte address and the ending byte address of the allocated space. When a process finishes (taken as input) the appropriate node from the allocated list should bedeleted and this free disk space should be added to the free space list. [Care should be taken to merge contiguous free blocks into one single block. This results in deleting more than one node from the free space list and changing the start and end address in the appropriate node]. For allocation use first fit, worst fit and best fit

11 CS 108P SOFTWARE ENGINEERING LABORATORY 1. Study of case tool 2. REQUIREMENTS 3. Implementation of requirements engineering activities such as elicitation, validation, management using case tools 4. ANALYSIS AND DESIGN Implementation of Analysis and design using case tools 5. Study and usage of software project management tools such cost estimates and scheduling 6. Documentation generators Study and practice of Documentation generators 7. Data Modeling using automated tools 8. Practice reverse engineering and re engineering using tools 9. Exposure towards test plan generators, test case generators, test coverage and software metrics. 10. Meta modeling and software life ccle management. Case Studies: 1. Structure charts, Data Flow Diagrams, Decision tables and ER diagrams for Banking System 2. Structure charts, Data Flow Diagrams, Decision tables and ER diagrams for Railway Reservation System 3. Structure charts, Data Flow Diagrams, Decision tables and ER diagrams for Food Ordering System 4. Structure charts, Data Flow Diagrams, Decision tables and ER diagrams for Inventory System

12 M.SC. COMPUTER SCIENCE SEMESTER-II CS 201T ADVANCED JAVA UNIT- I Event Handling: The delegation event model, Events, Event classes, Event Listener Interfaces, Using the Delegation event model, Adaptor classes, inner classes AWT : Windows fundamentals, Working with frame windows, controlfundamentals, - Labels, Buttons, checkbox, Radio button TextField, Understanding Layout Manager Swing: JcolorChooser, JComboBox, JFileChooser, JInternalFrame, JLabel,JMenuBar, JOptionPane, JLayeredPane, LDesktopPane, JPanel, jpopupmenu,jprogressbar, JRootPane, JScrollBar, JScrollPane, JSeparator, JSlider, JSplitPane, TabbedPane, Jtable, JTabelheader, JTOolBar, JToolTip, JTree, JViewPort, JEditorPane, JTextPane, JTextArea, JTextField, JPasswordField, JButton, JMenuItem, jcheckbox-menuitem, JRatioButton-MenuItem, JCheckBox, JRadioButton, JMenu. UNIT-II Introduction to servlets: Need for Dynamic content, Java Servlet Technology, why Servlets? Servlet API and Lifecycle: servlet API, servletconfig interface, servletrequest and servletresponse Interfaces, Genericservlet Class. ServletInputStream And ServletOutputStream Classes, requestdispatcher Interface, HttpServlet Class, HttpServletRequest and HttpServletResponse Interfaces, HttpSession Interface, Servlet LifeCycle. JDBC: Design of JDBC Configuration, Executing SQL statement, Query Execution, scorollable and updatable result sets, row sets, mediadata, Transaction. UNIT-III JSP: Introduction, Disadvantages, JSP v/s Servlets, Lifecycle of JSP, Cmments, JSP documents, JSP elements, Action elements, implicit objets, Scope, CharacterQuoting Conventions, Unified Expression Language. Java server Faces: Need of MVC, what is JSF?, components of JSF, JSFas an application, JSF lifecycle, JSF configuration, JSF web applications(login form, JSF pages). EJB: Enterprise Bean Architecture, Benefits of Enterprise Bean, Types of Beans, Accessing Beans, Packaging Beans, Creating Web Applications, Creating Enterprise Bean, Creating Web Client, Creating JSP File, Building and Running Web Application. UNIT- IV HIBERNATIVE: Introduction, Writing the application, application development approach, creating database and tables in MySQL, creating a web application, Adding the required library files, creating a java bean class, creating hibernate configuration and mapping file, adding a mapping resource, creating JSPs.

13 STRUTS: Introduction, Struts framework core components, installing and setting up struts, getting started with struts. TextBooks: B1 Java Complete Reference, Herberttschildt, Seventh Edition, tata McGraw Hill. (Unit 1 Chapter 20,21,22) B2 Core Java Vol. II Advanced Features, Cay S. Horstmans, Gray Coronell, Eight Edition Pearson Education ( Unit II: Chapter 6, Unit IV: Chapter 4 and Oracle Java Documentation on UIS Wing). B3 Java EE 6 for Beginners, Sharanam Shah, Vaishali Shah, Shroff Publishers and Distributors (Unit III: Chapter 5,6,7, Unit IV: Chapter 13,14,15,16, Unit V: chapter 18,1,9,24,25, Unit V: Chapter 33,34,35,36,37,38). References: 1. Java EE Project using EJB 3, JPA and struts 2 for beginners, Shah, SPD 2. Java Programming a practical Approach, C Xavier, McGraw Hill 3. Java Server Faces a Practical Approach for beginners, B M Harwani, Eastern Economy Edition(PHI). Advanced Java Technology, Savaliya, Dreamtech.

14 CS 202T Advanced RDBMS using Oracle UNIT-I Basic concepts Database and Need for DBMS, Characteristics of DBMS Database Users, 3-tier architecture of DBMS (its advantages over 2-tier), Views of data-schemas and instances Data Independence Data Models Introduction to various data models Record based & Object based, Cardinality Ratio & Relationships, Representation of entities, attributes, relationship attributes, relationship set, Generalization, aggregation, Structure of relational Database and different types of keys Relational Model Codd s rules, Relational data model & relational algebra, Relational model concept,relational model constraints, Relational Algebra, Relational database language,data definition in SQL, Views and,queries in SQL, Specifying constraints and Indexes insql, Specifying constraints management systems,oracle / Ingres/ SQL Server / My SQL UNIT-II Relational Database design Database Design ER to Relational, Functional dependencies, Normalization,Normal forms based on primary keys(1 NF, 2 NF, 3 NF, BCNF, 4 NF, 5 NF), Loss less joins and dependency,preserving decomposition. Queries Select with all options Operators Arithmetic ComparisonLogical( in, between, like, all, %, _, any, exists, is null, and,or,not, Distinct) Order by clause SQL Functions DateSys_date,next_day, Add_months, last_day, months_between,numericround, trunc, abs, ceil, cos, exp, floor Character initcap, lower, upper, ltrim, rtrim, translate, length, lpad, rpad, replace Conversion to_char, to_date, to_number Miscellaneous Uid, User, nvl, vsize, decode, rownumgroup function avg, max, min, sum, count, with Group by and Having ClauseNested functions UNIT-III Joins Simple join Equi join Non equi join Self join Outer join,set operators (Union, union all, intersect, minus) Sub queries and Correlated query,dml statements (Insert, Update, Delete withclause)tcl (Commit, Rollback, Savepoint) Locks in Oracle DDL Statements Data types CharacterChar,Varchar/varchar2, Long NumberNumber (p) - fixed point, Number (p,s) - floating pointdate RawLong raw Introduction to LOB data types (CLOB,BLOB, BFILE) PL / SQL Introduction to PL/SQLAdvantages of PL/SQL PL/SQL Character SetData types - Character, Raw,rowid,boolean, binary, integer,number, Variable, constantpl/sql blocks Attribute - % type, %rowtypeoperators function comparison, numeric, character, date. control structure sequential -goto Error handlingconcept of exception pre defined exceptions - no_data_foundcursor_allready_open,dup_val_on_index, storage_error, program_error,zero_divide, invalid_cursor, login_denied, invalid_number, too_many_rows, dbms_output, user_defined exceptions UNIT-IV Cursor Explicit& implicit Cursor, Cursor for loop, Parametric cursor,declaring cursor variables, Constrained and unconstrained,cursor variables, Opening a cursor variable from a query,closing cursor variables, Restrictions using cursor variables.composite Data types Record, Declaration, refer, record assignment Table declaration, table attributes (count, delete, exists, first,last, next, prior) Database Triggers Types of Triggers Enabling, disabling Predicates- inserting, updating, deleting Procedures and Functions Definition, Implementation and Execution Packages

15 Books : 1. Introduction To Database Systems By C.J.Date, Pearson. 2. Data Base System Concept by Korth, TMH, 5 th Ed. 3. Data Management Systems by Alexis Leon, Mathew Leon 4. Principals of Database Management by James Martin, PHI. 5. Computer Database Organization by James Martin,PHI,3 rd Ed. 6. Relational database design for Micro Computers applications by Prentice Hall(Jackson) 7. Introduction to Data Management Systems by AtulKahate, Pearson Education Pub. 8. Fundamentals of Database Systems by Elmasri, Navathe, Pearson,5 th Ed 9. Data Mining: Concepts and systems - Jiawei nan, MichelineKamber, (MorganKaufmann publishers 10. Database systems : "Design implementation and management"- Rob Coronel, 4th Edition, (Thomson Learning Press) Books: 1. SQL - The complete Reference by Groff James & Weinberg Paul.,TMH,2 nd Ed. 2. SQL for Professionals by Kishore Swapna&NaikRajesh,TMH. 3. SQL from the ground up by Pyofinch Mary 4. SQL Unleashed by Ladanyi Hans. 5. Oracle 7 by Ivan Bayross,BPB Pub. 6. Understanding SQL by Gruber Martin,BPB Pub. 7. Teach yourself SQL in 14 days by Morgan Bryan & Perkins Jeff 8. Oracle PL/SQL Programming by Scott Urman Teach yourself PL/SQL in 21 days by Lucus Tom,techmedia,2 nd Ed. OCP: Oracle 10g Certification Kit (1Z0-042 and 1Z0-043) 11. Oracle Database 10g OCP Certification All-In-One Exam Guide (Oracle Database 10g Handbook) by DamirBersinic, John Watso 12. Oracle Database 10g DBA Handbook by Kevin Loney, Bob Bryla, PublisherMcGraw-Hill 13. Understanding SQL by Gruber Martin,BPB Pub. 14. Teach yourself SQL in 14 days by Morgan Bryan & Perkins Jeff 15. Oracle PL/SQL Programming by Scott Urman Teach yourself PL/SQL in 21 days by Lucus Tom,techmedia,2 nd Ed. OCP: Oracle 10g Certification Kit (1Z0-042 and 1Z0-043) 18. Oracle Database 10g OCP Certification All-In-One Exam Guide (Oracle Database 10g Handbook) by DamirBersinic, John Watson 19. Oracle Database 10g DBA Handbook by Kevin Loney, Bob Bryla, PublisherMcGraw-Hill

16 CS 203T COMPUTER NETWORKS UNIT I UNIT II UNIT III UNIT IV Overview of the Internet: Protocol, Layering scenario, TCP/IP Protocol Suite: The OSI Model, Internet history standards and administration; Comparison of the OSI and TCP/IP reference model Data Link Layer Design issues, CRC Codes, Elementary Data Link Layer Protocols, Sliding Window Protocol Multiple Access Protocols ALOHA, CSMA, Collision free Protocol s, Ethernet -Physical Layer, Ethernet Mac Sub Layer, Data Link Layer Switching & use of bridges, Learning bridges, Spanning Tree bridges, Repeaters, Hubs, Bridges, Switches, Routers and Gateways. Network Layer, Network Layer Design Issues, store and forwards packet switching connection less and connection oriented networks-routing algorithms-optimality principle, shortest path, flooding, Distance Vector Routing, Count to Infinite Problem, Hierarchical Routing, Congestion control algorithms, admission control. Internetworking: Tunneling,Internetwork Routing, Packet fragmentation, IPv4, IPv6 Protocol, IP addresses, CIDR, IMCP, ARP, RARP, DHCP, Transport Layer: Services Provided to the upper layers elements of transport protocol-addressing connection establishment, Connection Release, Connection Release, Crash Recovery. The Internet Transport Protocols UDP-RPC, Real Time Transport Protocols, The internet Transport Protocols-Introduction to TCP, The TCP Service Model, The TCP Segment Header, The Connection Establishment, The TCP Connection Release, The TCP Connection Management Modeling, TCP Sliding Window, The TCP Connection Release, The TCP Connection Management Modeling, The TCP Sliding Window, The TCP Congestion Control, The future of TCP. Application Layer-Introduction, Providing Services, Applications Layer paradigms, Client server model, Standard Client-Server application-http, FTP, Electronic mail, TELNET, DNS, SSH. TEXT BOOKS: 1) Computer Networks, Andrew S.Tanenbaum, David J Wetherall, Pearson Education, 5 th Edition. 2) Computer Networks A Top-Down Approach, Behrouz A Forouzan, FirouzMosharraf, TMH.

17 REFERENCE BOOKS: 1) An Engineering Approach to Computer Networks-S.Keshav, 2 nd Edition, pearson Education. 2) Understanding Communications and Networks, 3 rd Edition, W.A.Shay, Cengage Learning. 3) Computer Networks, L.L.Peterson and B.S.Davie, 4 th Edition, ELSEVIER. 4) Computer Networking: A Top-Down Approach Featuring the Internet, James F.kurose, K.W.Ross, 3 rd Edition, Pearson Education.

18 CS-204 T DESIGN AND ANALYSIS OF ALGORITHMS 4 Hr. per week UNIT-I: Introduction and elementary data structures order notation Analysis of algorithm Review of elementary data structures - head and Heap Sort Hashing sets representation - UNION, FIND operation. UNIT-II: Divide and conquer and the Greedy Model The General Method, binary search, finding, maximum and minimum - Merge sort Quick sort and selection sort Knapsack problem - Optimal storage on tapes, job sequencing with deadlines optimal merge pattern, minimum spanning trees and single source shortest pattern. UNIT-III: Dynamic Programming and traversal techniques Multistage graphs, all pairs shortest path Optimal binary search trees O/I Knapsack reliability design, travelling sales man problem game trees, disconnected components and depth first search. UNIT-IV: Back Tracking and branch bound Technique 8 queens problem, graph colouring, Hamiltonian cycles Knapsack problems, O/I Knapsack problems, Travelling sales person problems, Lower Bound theory. NP hard and NP-Completeness, Basic concepts, cook s theorem NP Hard Graph problem and scheduling problem NP Hard code generation problem decision problem node covering theorem. TEXT BOOK: 1. E. Horowitz and S. Sahini, Fundamentals of Computer Algorithms, Galgotia Publications, A.V. Aho, J.V. Hopcraft and J.D. Ullmann, The design and analysis of computer Algorithm, Addison Wesley Publications Company 1974

19 CS 205P Advanced Java Practicals 1. Write a java program to present a set of choices for a user to select stationary products and display the price of Product after Selection from the list. 2. Write a java program to demonstrate typical Editable Table, Describing Employee details for a software company. 3. Write a java program using split pane to demonstrate a screen divided into two parts, one part contains the names of Planets and another Displays the image of planet. When user selects the planet name room the left screen, appropriate image of planet displayed in right screen. 4. Develop simple Servlet Question Answer Application to Demonstrate use of HttpServletRequest and HttpServletRequest interfaces. 5. Develop Servlet Application of Basic Calculator (+,-,*,/,%) using ServletInputStream and ServletOutputStream. 6. Develop a JSP Application to accept Registration Details from the user and store it into the database table. 7. Develop a JSP Application to Authenticate User Login as per the Registration Details. If Login Success then forward User to Index Page otherwise show Login failure Message. 8. Develop a web Application to add items in the inventory using JSF. 9. Develop a Room Reservation System Application using Enterprise java Beans. 10. Develop a Hibernate application to Store Feedback of Website Visitors in MySQL Database. 11. Develop a simple Struts Application to Demonstrate 3 page Website of Teaching Classes which passes values from every page to another. 12. Develop a simple Struts Application to Demonstrate Validator. 13. Create forms using swing 14. Create database and write JDBC routines to access database 15. Create applications using RMI 16. Create 3-tire application using servlets 17. Create application using JSP 18. Generate web based mails for reminders 19. Create applications using session beans 20. Create database access using entity beans 21. Create message based applications

20 CS 206P PracticalbasedonAdvancesinDBMS using Oracle 1. Createemployeetablewithemp_id,emp_name,empadd,empsalfieldsandenterat least10recordsintoit. 2. Displayalltherecordofemployeetablewithselectquery. 3. Usedifferentselectqueryclauseswithdifferentconditionanddisplaytheoutput. 4. Createatableemployee(emp_id: integer,emp_name:string)department(dept_id:integer,dept_name:string)paydetails(emp_i d:integer,dept_id:integer,basic:integer,deductions:integer,additions:integer,doj:date)payr oll(emp_id:integer,pay_date:date) a. Createthetableswiththeappropriateintegrityconstraints b. Insertaround10recordsineachofthetables c. Listalltheemployeenameswhojoinedafterparticulardate d. Listthedetailsofemployeeswhosebasicsalaryisbetween10,000and20,000 e. Giveacountofhowmanyemployeesareworkingineachdepartment f. Giveanamesoftheemployeeswhosenetsalary>10,000 g. Listthedetailsforanemployee_id=5 h. Createaviewwhichlistsouttheemp_name,department,basic,dedeuctions,netsalary i. Createaviewwhichliststheemp_nameandhisnetsalary. 5. Addingprimary,foreignkeysatthetablecreationtimeaswellaswiththealterquery. 6. JoiningthedifferenttablesandfieldsofthetableusingJoin. 7. Creatingusersandgivingandremovingpermissionswithgrantandrevoke. 8. Writeaprogramtodemonstrate%typeand%rowtypeattributes 9. WriteaPL/SQLprogramtocheckwhetherthegivennumberisArmstrongornot 10. WritePL/SQLprogramfordisplayingthedatafromtablesonthescreen. 11. WritePL/SQLprogramforupdatingthetablecontentsusingdifferentconditions 12. CreateaPL/SQLproceduretofindreverseofagivennumber 13. CreateaPL/SQLproceduretoupdatethesalariesofallemployeesasperthegivendata 14. Createacursor,whichupdatethesalariesofallemployeesasperthegivendata. 15. Createacursor,whichdisplaysallemployeenumbersandnamesfromtheEMPtable.

21 16. Createacursor,whichdisplaysnamesofemployeeshavingsalary> Createatriggerbefore/afterdeleteonemployeetableforeachrow/statement. 18. Createatriggerbefore/afterinsertonemployeetableforeachrow/statement. (Apartfromtheabovelist,concernedteachercanconductdifferentkindsofprogramsforthebetteru nderstandingoftheconcepts)

22 CS 207P Network Programming Lab 1) Socket pair system call usage in IPC 2) Echo concurrent Stream Server 3) Echo concurrent stream client 4) Listener 5) Talker 6) Socket options using signals 7) TCP time service 8) UDP time service 9) Ping service 10) Route tracing program 11) Shortest path routing Algorithm implementation 12) I/O Multiplexing using select system call 13) Distance Vector Routing Implementation 14) ICMP Error Message simulations

23 CS 208P PracticalbasedonDesign and AnalysisofAlgorithm 1. WriteaprogramforInsertionandDeletionofElementsfromArrays 2. WriteaprogramforInsertionandDeletionofElementsfromLinkedList 3. WriteaprogramforInsertionandDeletionofElementsfromStack 4. WriteaprogramforInsertionandDeletionofElementsfromQueue 5. WriteaprogramfortraversingofTree 6. WriteaprogramforBubblesortTechnique 7. WriteaprogramforSelectionSortTechnique 8. WriteaprogramforLinearSearch 9. WriteaprogramforBinarySearch 10. Writeaprogramfortwowayordoublylinkedlist 11. WriteaprogramtofindelapsedtimeforQuicksorttechnique 12. WriteaprogramtosolveknapsackproblemusingGreedymethod 13. Writeaprogramtosolvetravellingsalesmanproblem 14. WriteaprogramtofindoutshortestpathforagraphV(G) 15. Writeaprogramtoconvertinfixnotationintopostfixnotation (Apartfromtheabovelist,concernedteachercanconductdifferentkindsofprogramsforthebetterunderstandingoftheconcepts)