1 PCA341C Computer Networks PCA342C Java Programming PCA343C Analysis and Design of Algorithms

Size: px

Start display at page:

Download "1 PCA341C Computer Networks PCA342C Java Programming PCA343C Analysis and Design of Algorithms"

Kristopher Holt
6 years ago
Views:

1 Sl. No. Subject Code B. V. V. S Basaveshwar Engineering College(Autonomous), Bagalkot Department of Computer Applications (MCA) Scheme and syllabus for III Semester MCA No. of hours per week Total Examination Marks Subject LecturerPracticalTutorials Credits CIE SEE Total 1 PCA341C Computer Networks PCA342C Java Programming PCA343C Analysis and Design of Algorithms PCA344C Software Engineering Elective - I PCA345L Computer Networks Laboratory PCA346L Java Programming Laboratory PCA347L Advanced DBMS Laboratory PCA348S Seminar Total Elective I Sl. No. Subject Code Subject 1 PCA001E Advanced DBMS 2 PCA002E Computer Graphics 3 PCA003E Web 2.0 and Rich Internet Applications 4 PCA004E Operations Research 5 PCA005E Principles of User Interface Design 6 PCA006E Human Resource Management

2 PCA341C: Computer Networks 4 Credits (4-0-0) CIE Marks: 50 SEE Marks: 100 Total Hours: 52 SEE Hours: 03 UNIT I Introduction: Uses of computer networks : Business Applications, Home Applications, Mobile Users, Social Issues; Network hardware: Local Area Networks, Metropolitan Area Networks, Wide Area Networks, Wireless Networks, Home Networks, Internetworks; Network software: Protocol Hierarchies, Design Issues for the Layers, Connection-Oriented and Connection less Services, Service Primitives, The Relationship of Services to Protocols; Example Networks: The Internet, The ARPANET, NSFNET, Internet usage. Reference Models: OSI reference model, TCP/IP reference model, and Comparison of OSI and TCP/IP reference models. Example Networks: The Internet, Connection-Oriented Networks, Ethernet, Wireless LANS. Physical Layer: Guided Transmission Media: Magnetic media, Twistted pair, Coaxial cable and Fiber optics. Data Link Layer: Design Issues: Service provided by the network layer, Framing, Error Control and Flow Control, Error Detection and Correction: Error correcting codes and Error-Detecting Codes, Elementary Data Link Protocols: An unrestricted simplex protocol, A simplex stop and wait protocol and A simplex protocol for noisy channel, Sliding Window Protocols: A one bit sliding window protocol, Protocol using Go Back N and A protocol using Selective Repeat. UNIT II Network layer and Routing Algorithms: Network layer design issues: Store and Forward packet Switching, Services Provided to the Transport Layer, Implementation of Connectionless Service, Implementation of Connection-Oriented Service, Comparison of Virtual Circuit and Datagram Subnets. Routing algorithms: The Optimality Principal, Shortest Path Routing, Flooding, Distance Vector Routing, Link state Routing, Hierarchical Routing, Broadcast Routing, Multicast Routing, Routing for Mobile Hosts; Congestion Control Algorithms: General Principles of Congestion Control, Congestion Prevention Policies, Congestion Control in Virtual-Circuit Subnets, Congestion Control in Datagram Subnets, Load Shedding, Jitter Control; Quality Of Service: Requirements, Techniques for Achieving Good Quality of Service, Integrated Services, Differentiated Services; Internetworking: How networks differ, How Networks Can Be Connected, Concatenated Virtual Circuits, Connectionless Internetworking; Tunneling; Internetwork Routing; Fragmentation. The Network Layer in the Internet: The IP Protocol, IP Addresses, Internet Control Protocols, The Interior Gateway Routing Protocol: OSPF, The Exterior Gateway Routing Protocol: BGP. Mobile IP and IPV6. UNIT III The Transport Layer: The Transport Service: Services Provided to the Upper Layers, Transport Service Primitives, Berkley Sockets; Elements of Transport Protocols: Addressing, Connection Establishment, Connection Release, Flow Control and Buffering, Multiplexing, Crash Recovery; The Internet Transport Protocols - UDP: Introduction to UDP, Remote Procedure Call, The Real-Time Transport Protocol; The

3 Internet Transport Protocols - TCP: Introduction to TCP, The TCP Service Model, The TCP Protocol, The TCP Segment Header, TCP Connection Establishment, TCP Connection Release, Modeling TCP Connection Management, TCP Transmission Policy, TCP Congestion Control, TCP Timer Management, Wireless TCP and UDP. UNIT IV The Application Layer and Network Security: DNS- The Domain Name System: The DNS Name Space, Resource Records, Name Servers; Electronic Mail: Architecture and Services, The User Agent, Message Formats, Message Transfer, Final Delivery; The World Wide Web: Architectural Overview, Static Web Documents, Dynamic Web Documents, HTTP, Performance Enhancements, The Wireless Web. Cryptography: Introduction to Cryptography, Substitution Ciphers, Transposition Ciphers, Two Fundamental Cryptographic Principles; Symmetric key Algorithms: DES-The Data Encryption Standard, AES - The Advanced Encryption Standard; Public key algorithms: RSA, Digital Signatures, Symmetric-Key Signature, Public key Signature, Message Digests. Text Books: 1. Andrew S. Tanenbaum. Computer Networks, Fourth edition, Pearson Publication, Reference Books: 1. Behrouz A. Forouzan. Data Communications and Networking, Second edition,tata McGraw-Hill, William Stallings. Data and Computer Communication, Sixth Edition, Pearson Education 2001.

4 PCA342C: Java Programming 4 Credits (4-0-0) CIE Marks: 50 SEE Marks: 100 Total Hours: 52 SEE Hours: 03 UNIT I Java Programming Fundamentals: The Java Language, The Key Attributes of Object-Oriented Programming, The Java Development Kit, A First Simple Program, Keywords and Identifies in Java. Introducing Data Types and Operators: Java s Primitive Types, Literals, Variables, The Scope and Lifetime of Variables, string variables Final keyword, Operators, The Bitwise operators, Type conversion in Assignments, Using Cast, Operator Precedence and Expressions. Program Control Statements: Input characters from the Keyword, if statement, Nested ifs, if-else-if Ladder, Switch Statement, Nested switch statements, for Loop, Enhanced for Loop, While Loop, do-while Loop, Use break, Use continue, Nested Loops. Introducing Classes, Objects and Methods: Class Fundamentals, How Objects are Created, Constructors, Parameterized Constructors, this Keyword, Garbage Collection and Finalizers, Methods, Types of methods, Access Specifies and Method specifies, returning objects from a Method, Returning Value, Using Parameters, pass Objects to Methods, Method Overloading, Overloading Constructors. UNIT II Arrays: Types of Arrays, Array Declaration and initialization, Assigning, Using the Length Member, Understanding Static. Closer look at classes: Introducing Nested and Inner Classes, Varargs: Variable- Length Arguments. String Handling: String Fundamentals, The String Constructors, String handling Methods, String comparison, StringBuffer and String Builder. Inheritance: Inheritance Basics, Member Access and Inheritance, Constructors and Inheritance, Using super to Call Superclass constructors, Using super to Access Superclass Members, Creating Multilevel Hierarchy, When are Constructors Executed, Superclass References and Subclass Objects, Method Overriding, Overridden Methods support polymorphism, Why Overridden Methods. UNIT III Abstract: Using Abstract Classes, methods, Using final, Object Class and its methods. Interfaces: Interface Fundamentals, Creating an Interface, Implementing an Interface, Using Interface References, Implementing Multiple Interfaces, Constants in Interfaces, Interfaces can be extended, Nested Interfaces, Final Thoughts on Interfaces. Packages: Package Fundamentals, Packages and Member Access, Importing Packages, Static Import. Exception Handling: The Exception Hierarchy, Exception Handling Fundamentals, The Consequences of an Uncaught Exception, Exceptions to handle errors gracefully, using multiple catch clauses, Catching subclass Exceptions, try blocks can be nested, throwing an Exception, A Closer look at Throwable, using finally, using throws, Java s Built-in Exceptions, New Exception features added by JDK 7, Creating Exception Subclasses.

5 UNIT IV Multithreaded Programming: Multithreading fundamentals, life cycle, Thread Class and Runnable Interface, Creating Thread, Creating Multiple Threads,, Thread Priorities, Synchronization, Thread Communication using notify(), wait() and notify All(), suspending, Resuming and stopping Threads. Networking with Java.net: Networking fundamentals, The Networking classes and Interfaces, The InetAddress class, The Socket Class, The URL class, The URLConnection Class, The HttpURL. Collection Framework: Exploring Collection Framework, Collections Overview, Wrapper classes, boxing and unboxing, The Collection Interfaces, classes List, Set, Map. Text books: 1. Herbert Schildt: Java The Complete Reference, 7th Edition, Tata McGraw Hill, Reference books: 1. Y. Daniel Liang: Introduction to JAVA Programming, 6th Edition, Pearson Education, Stephanie Bodoff et al: The J2EE Tutorial, 2nd Edition, Pearson Education, 2004.

6 PCA343C: Analysis and Design of Algorithms 4 Credits (4-0-1) CIE Marks: 50 SEE Marks: 100 Total Hours: 52 SEE Hours: 03 UNIT I Introduction: Notion of Algorithm, Fundamentals of Algorithmic Problem Solving, Important Problem Types, Fundamental Data Structures. Fundamentals Of The Analysis Of Algorithm Efficiency: Analysis Framework, Asymptotic Notations and Basic efficiency classes, Mathematical analysis of Recursive and Non-Recursive algorithms, Examples. Brute Force: Selection Sort and Bubble Sort, Sequential Search and String Matching, Exhaustive Search. UNIT II Divide-And Conquer: Merge sort, Quick sort, Binary Search, Binary Tree Traversals and related properties, Multiplication of large integers, Strassen s Matrix, Multiplication. Decrease-And-Conquer: Insertion Sort, Depth First and Breadth First Search, Topological Sorting, Algorithms for Generating Combinatorial Objects. UNIT III Transform And Conquer: Presorting, Balanced Search Trees, Heaps and Heap sort, Problem Reduction. Dynamic Programming: Computing a binomial coefficient, Warshall s and Floyd s Algorithms, The Knapsack Problem and Memory Functions. UNIT IV Greedy Technique: Prim s Algorithm, Kruskal s Algorithm, Dijkstra s Algorithm, Huffman Trees. Backtracking: n-queen s Problem,Hamiltonian Circuit problem, Subset-Sum problem, Branch and bound, Assignment problem, Knapsack problem, Traveling salesman problem. Text books: 1. Anany Levitin, Introduction to the Design and Analysis of Algorithms, 2 nd edition, Pearson education, A.V.Aho, J.E. Hopcroft and J.D.Ullman, The Design and Analysis of Computer Algorithms, Pearson education, Reference books: 1. Introduction to Algorithms by Coremen, T.H., Leiserson C.E., and Rivest R.L. PHI, Computer Algorithms by Horowitz E., Sahani S., Rajashekaran S., Galgotia Publications, 2001.

7 PCA344C : Software Engineering 4 Credits (4-0-1) CIE Marks: 50 SEE Marks: 100 Total Hours: 52 SEE Hours: 03 UNIT I Introduction: FAQ's about software engineering, Professional and ethical responsibility. Software Processes: Software Process Models, Process iteration, Process activities, The Rational Unified Process, Computer-Aided Software Engineering. Software Requirements: Functional and Non-functional requirements, User requirements, System requirements, Interface specification, the Software requirements document. UNIT II Requirements Engineering Processes: Feasibility studies, Requirements elicitation and analysis, Requirements validation, Requirements management. System Models, Context models, Behavioral models, Data models, Object models, Structured methods. Architectural Design: Architectural design decisions, System organization, Modular decomposition styles, Control styles. Object-Oriented design: Objects and Object Classes, An Object Oriented design process, Design evolution. UNIT III Rapid Software Development: Agile methods, Extreme programming, Rapid application development. Software Prototyping. Verification and Validation: Planning verification and validation, Software inspections, Automated static analysis, Verification and formal methods. Software Testing: System testing, Component testing, Test case design, Test automation. UNIT IV Project Management: Management activities, Project planning, Project scheduling, Risk management. Managing People: Selecting staff, Motivating people, Managing people, The People Capability Maturity Model. Software Cost Estimation: Productivity, Quality Management: Process and product quality, Quality assurance and standards, Quality planning, Software measurement and metrics. Text books: 1. Ian Somerville, Software Engineering, 8th Edition, Pearson Education, Reference books: 1. Roger S. Pressman, Software Engineering: A Practitioners Approach, 7th Edition, McGraw-Hill, Pankaj Jalote, An Integrated Approach to Software Engineering, Narosa Publications. 3. Waman S Jawadekar, Software Engineering Principles and Practice, Tata McGraw Hill, 2004.

8 PCA001E : Computer Graphics 4 Credits (3-0-1) CIE Marks: 50 SEE Marks: 100 Total Hours: 40 SEE Hours: 03 UNIT I Overview of Graphics Systems: Video Display devices, Raster-scan Systems, Random-Scan Systems, Graphics Monitors and Workstations, Input Devices, Hard-Copy Devices, Graphics Software. Output primitives :Points and Lines, Line-Drawing Algorithms, Loading the Frame Buffer, Line Function, Circle- Generating Algorithms. Attributes of output primitives: Line Attributes, Color and Grayscale levels, Area- Fill Attributes, Character Attributes, Antialiasing UNIT II 13Hours. Two dimensional geometric transformations: Basic Transformations, Matrix Representations and Homogeneous coordinates, Composite Transformations, Other Transformations, Transformations Between Coordinate Systems, Affine Transformations, Transformation Functions, Raster Methods for Transformations. Two dimensional viewing: The Viewing Pipeline, Viewing Coordinate Reference Frame, Window-to-Viewport Coordinate Transformation, Two-Dimensional Viewing Functions, Clipping Operations, Point Clipping, Line Clipping, Polygon Clipping, Text Clipping, Exterior Clipping. UNIT III Graphical user interfaces and interactive input methods: The User Dialogue, Input of Graphical Data, Input Functions, Initial Values for Input-Device Parameters, Interactive Picture Construction Techniques, Virtual- Reality Environments. Three dimensional concepts and object representations: Three Dimensional Display Methods, Polygon Surfaces, Curved Lines and Surfaces, Quadric Surfaces, Busier Curves and Surfaces, B-Spline Curves and Surfaces, Octrees. UNIT IV Three-dimensional geometric and modeling transformation: Translation, Rotation, Scaling, Other Transformations, Composite Transformations, Three-Dimensional Transformation Functions, Modeling and Coordinate Transformations. Three-dimensional viewing:viewing Pipeline, Viewing Coordinates, Projections, View Volumes, Clipping. Visible-surface detection methods: Classification of Visible-Surface Detection Algorithms, Back-Face Detection, Depth-Buffer Method, Scan-line method, Area- Subdivision Method, Curved Surfaces, Wire frame Methods. Text Book: 1. Donald Hearn and M. Pauline Baker, Computer Graphics: C version, Second Edition- Pearson Education Reference Books: 1. Steven Harrington, Computer Graphics - A Programming Tata McGraw Hill- Second Edition. 2. Foley, VanDam, Feiner & Hughes. Computer Graphics- Principles and Practice Second Edition, Pearson Education. 3. Willam Neuman and Robert. L. Sproull, Principles of Computer Interactive Computer Graphics.

9 PCA345L : Computer Networks Laboratory 1.5 Credits (0-0-3) CIE Marks: 50 SEE Marks: 50 Total Hours: 42 SEE Hours: 03 Note: Student is required to solve one problem from PART-A and one problem from PART-B. Both the parts have equal weightage. PART A (The following experiments shall be conducted using C/C++ OR JAVA) 1. Implement the data link layer framing methods such as character stuffing and bit stuffing. 2. Implement on a data set of characters the three CRC polynomials CRC 12, CRC 16 and CRC CCIP. 3. Implement Dijkstra s algorithm to compute the Shortest path through a graph. 4. Take an example subnet graph with weights indicating delay between nodes. Now obtain Routing table at each node using distance vector routing algorithm. 5. Take an example subnet of hosts, obtain broadcast tree. 6. Take a 64 bit text and encrypt the same using DES algorithm. 7. Write a program to break the above DES coding. 8. Using RSA algorithm encrypt a text data and decrypt the same. PART B (The following experiments shall be conducted using basic networking device tool and Network Tracer) 1. Connect the computers in Local Area Network (LAN) and demonstrate ip configuration with subnet and super net. 2. Demonstrate the network configuration commands using windows environment and describe network IP. 3. Demonstrate the network configuration commands using Linux/Unix Environment. 4. Demonstrate proxy and print server environment Using LAN. 5. Demonstrate troubleshooting of networking command using LAN.

10 PCA346L : Java Programming Laboratory 1.5 Credits (0-0-3) CIE Marks: 50 SEE Marks: 50 Total Hours: 42 SEE Hours: Write a Java program that accepts three numbers and prints All numbers are equal if all three numbers are equal, All numbers are different if all three numbers are different and Neither all are equal or different otherwise (Conditional statements). 2. Write a Java program to calculate sum of diagonal elements of a square matrix (Array). 3. Write a Java program to find min and max element from given array (Array). 4. Write a Java program to read technical skills of two persons and find common skills between two persons (string array). 5. Write a Java program to replace each substring of a given string that matches the given regular expression with the given replacemnt. Sample String: The quick brown fox jumbs over the lazy dog. In the given string replace all the fox with cat (string handling). 6. Write a Java method to check whether a string is valid password or not? Password rules are given below: (methods and string handling). A password must have at least ten characters. A password consists of only letters and digits. A password must contain at least two digits. 7. Write a Java program to demonstrate multi thread programming (Threading). 8. Write a Java Program to demonstrate openacc(), deposit() and withdraw() operations. Minimum balace to open account is 500 and display message Balance is below minimum if withdrawal amount is less than minimum balance (using exception handling). 9. Write a Java program to read paragraph from the keboard and write the same to text file (file handling). 10. Write a Java program to read a file content line by line (file handling). 11. Write a Java program t o create array list and demonstrate different operations done with array list (collection class). 12. Write a Java program to associate the specified value with the specified key in a HashMap (Collection class).

11 PCA347L : Advanced DBMS Laboratory 1 Credit (0-0-2) CIE Marks: 50 SEE Marks: 50 Total Hours: 28 SEE Hours: Execution of MySQL schema change commands: i. Add a new column (attribute) to an existing table. ii. Delete an existing column (attribute) from a table. iii. Modify the data type of an existing column (attribute). iv. Change the name of an existing column (attribute). v. Add Primary key, Foreign key constraint to existing table. 2. Execution of administrative privileges: i. Creation of a user ii. Creation of a database iii. Granting different accession permission of database to a user iv. Revoking different accession permission of database from a user v. Import data from external source and export data to outside database 3. Insertion of data into table, if the value to be inserted has no duplicate value, using stored procedure. 4. Demonstration of arithmetic operations on data stored in the database using stored procedure. 5. Demonstration of use of cursors in stored procedure. 6. Demonstration of trigger activation on insertion of new values/data. 7. Demonstration of trigger activation on deletion of existing values/data. 8. Demonstration of trigger activation on modification / updation of existing values/data. 9. Demonstration of user-defined functions. 10. Demonstration of different types of Views. 11. Demonstration of MySQL connection device driver interface for programming language.

12 PCA348S Seminar 1 Credit (0-0-2) CIE Marks: 50 SEE Marks: 50 Total Hours: 28 SEE Hours: Students should present the seminar on cutting edge/emerging/state of the art technologies in the field of Computer Science and Applications. 2. Duration of the seminar should be approximately 20minutes. 3. Student should submit the write up on seminar topic containing at least 10 pages. Scheme of Evaluation for Seminar Seminar-I is evaluated for 100 marks (50 CIE and 50 SEE) Allocation of 50 Marks for CIE : 30 Marks evaluated by guide and coordinator. 20 Marks CIE test conduction by panel of 2 members (guide and one internal faculty). Allocation of 50 Marks for SEE: Panel of 2 members (guide and one internal faculty). 25% for write up and viva-voce. 25% for report. 50% for presentation.

SRM ARTS AND SCIENCE COLLEGE SRM NAGAR, KATTANKULATHUR

SRM ARTS AND SCIENCE COLLEGE SRM NAGAR, KATTANKULATHUR 603203 DEPARTMENT OF COMPUTER SCIENCE & APPLICATIONS LESSON PLAN (207-208) Course / Branch : M.Sc CS Total Hours : 45 Subject Name : Computer Networks