You are on page 1of 20

MANAGEMENT, ENTREPRENEURSHIP AND CYBER LAW

[As per Choice Based Credit System (CBCS) scheme]
(Effective from the academic year 2016 -2017)
SEMESTER – V
Subject Code 15CS51 IA Marks 20
Number of Lecture Hours/Week 4 Exam Marks 80
Total Number of Lecture Hours 50 Exam Hours 03
CREDITS – 04
Course objectives: This course will enable students to
• Explain the principles of management, organization and entrepreneur.
• Discuss on planning, staffing, ERP and their importance
• Infer the importance of intellectual property rights and relate the institutional support
Module – 1 Teaching
Hours
Introduction – Meaning, nature and characteristics of management, scope and 10 Hours
functional areas of management, goals of management, levels of management,
brief overview of evolution of management. Planning- Nature, importance, types
of plans, steps in planning, Organizing- nature and purpose, types of
organization.
Module – 2
Staffing- meaning, process of recruitment and selection. Directing and 10 Hours
controlling- meaning and nature of directing, leadership styles, motivation
theories. Controlling- meaning, steps in controlling, methods of establishing
control, Communication- Meaning and importance, Coordination- meaning and
importance
Module – 3
Entrepreneur – meaning of entrepreneur, types of entrepreneurship, stages of 10 Hours
entrepreneurial process, role of entrepreneurs in economic development,
entrepreneurship in India, barriers to entrepreneurship. Identification of business
opportunities- market feasibility study, technical feasibility study, financial
feasibility study and social feasibility study.
Module – 4
Preparation of project and ERP - meaning of project, project identification, 10 Hours
project selection, project report, need and significance of report, contents,
formulation, guidelines by planning commission for project report Enterprise
Resource Planning: Meaning and Importance- ERP and Functional areas of
Management – Marketing / Sales- Supply Chain Management – Finance and
Accounting – Human Resources – Types of reports and methods of report
generation
Module – 5
Small Scale Industry: case study(Microsoft), Shahnaz Husain(Ayurveda 10 Hours
Entrepreneur), Government policy towards SSI, Case study(Captain G R Gopinath),
case study (N R Narayana Murthy & Infosys) Institutional support: case study:
Amar Gopal Bose and Bose corporation, supporting agencies of Govt for SSI,
Different schemes, Types of Help, Case study Dr Devi Prasad Shetty. Introduction
to IPR.
Course outcomes: The students should be able to:
• Define management, organization, entrepreneur, planning, staffing, ERP and outline
their importance in entrepreneurship

• Utilize the resources available effectively through ERP
• Make us of IPRs and institutional support in entrepreneurship
Question paper pattern:
The question paper will have TEN questions.
There will be TWO questions from each module.
Each question will have questions covering all the topics under a module.
The students will have to answer FIVE full questions, selecting ONE full question from each
module.
Text Books:
1. Principles of Management -P. C. Tripathi, P. N. Reddy; Tata McGraw Hill, 4th
Edition, 2010.
2. Dynamics of Entrepreneurial Development & Management -Vasant Desai Himalaya
Publishing House.
3. Entrepreneurship Development -Small Business Enterprises -Poornima M
Charantimath Pearson Education – 2006.
4. Management and Enterpreneurship- Kanishka Bedi- Oxford University Press-2017
Reference Books:
1. Management Fundamentals -Concepts, Application, Skill Development Robert Lusier
– Thomson.
2. Entrepreneurship Development -S S Khanka -S Chand & Co.
3. Management -Stephen Robbins -Pearson Education /PHI -17th Edition, 2003

. Security and Network Management Module – 1 Teaching Hours Application Layer: Principles of Network Applications: Network Application 10 Hours Architectures. Switching. Multiplexing and Demultiplexing: Connectionless Transport: UDP. Application-Layer Protocols. Overview of How DNS Works. Principles of Reliable Data Transfer: Building a Reliable Data Transfer Protocol. Processes Communicating. Comparison with HTTP. IP and Routing Algorithms in network layer • Disseminate the Wireless and Mobile Networks covering IEEE 802. IPv6.A Brief foray into IP Security. TCP Connection Management. 10 Hours Output Processing. UDP Checksum. File Transfer: FTP Commands & Replies. Connection-Oriented Transport TCP: The TCP Connection. Mail Message Format. Flow Control. DNS. The Conditional GET. Approaches to Congestion Control. Electronic Mail in the Internet: SMTP. Round-Trip Time Estimation and Timeout. Peer-to-Peer Applications: P2P File Distribution. Web Caching. The Internet's Directory Service: Services Provided by DNS. Non-persistent and Persistent Connections. User-Server Interaction: Cookies. T1: Chap 3 Module – 3 The Network layer: What's Inside a Router?: Input Processing. Pipelined Reliable Data Transfer Protocols. Transport Services Available to Applications. Socket Programming with TCP. Routing Algorithms: The Link-State (LS) Routing Algorithm. DNS Records and Messages. ATM ABR Congestion control. HTTP Message Format. Go-Back-N.11 Standard • Illustrate concepts of Multimedia Networking. TCP Congestion Control: Fairness. Distributed Hash Tables. COMPUTER NETWORKS [As per Choice Based Credit System (CBCS) scheme] (Effective from the academic year 2016 -2017) SEMESTER – V Subject Code 15CS52 IA Marks 20 Number of Lecture Hours/Week 4 Exam Marks 80 Total Number of Lecture Hours 50 Exam Hours 03 CREDITS – 04 Course objectives: This course will enable students to • Demonstration of application layer protocols • Discuss transport layer services and understand UDP and TCP protocols • Explain routers. The Web and HTTP: Overview of HTTP. Selective repeat. Mail Access Protocols. Hierarchical Routing. TCP Segment Structure. Transport Services Provided by the Internet.UDP Segment Structure. Socket Programming: creating Network Applications: Socket Programming with UDP. Overview of the Transport Layer in the Internet. The Distance-Vector (DV) Routing Algorithm. Reliable Data Transfer. Network-assisted congestion-control example. Where Does Queuing Occur? Routing control plane. Principles of Congestion Control: The Causes and the Costs of Congestion. T1: Chap 2 Module – 2 Transport Layer : Introduction and Transport-Layer Services: Relationship 10 Hours Between Transport and Network Layers.

Andrew S Tanenbaum. A Top-Down Approach. ELSEVIER 3. Per-Connection Quality-of- Service (QoS) Guarantees: Resource Reservation and Call Admission T1: Chap: 7:7.11 Standard • Describe Multimedia Networking and Network Management Question paper pattern: The question paper will have TEN questions. Adaptive streaming and DASH. Text Books: 1. Computer Networking. Each question will have questions covering all the topics under a module. HTTP Streaming. Behrouz A Forouzan. Mayank Dave.4-6.8 Module – 5 Multimedia Networking Applications: Properties of video.2. Computer Networks. Inter/AS Routing: BGP. Routing calls to a Mobile user. Larry L Peterson and Brusce S Davie. properties of Audio. Indian Edition 2. 10 Hours Types of multimedia Network Applications.Routing in the Internet. Data and Communications and Networking. The students will have to answer FIVE full questions.5 Course outcomes: The students should be able to: • Explain principles of application layer protocols • Recognize transport layer services and infer UDP and TCP protocols • Classify routers. Sixth edition.2017 . fifth edition. fifth edition. Streaming stored video: UDP Streaming. case studies: Netflix.3-4. Second edition. Reference Books: 1. There will be TWO questions from each module. Diffserv. 3G Cellular Data Networks: Extending the Internet to Cellular subscribers. Intra-AS Routing in the Internet: RIP. Network Support for Multimedia : Dimensioning Best-Effort Networks. You Tube and Kankan. McGraw Hill. Pearson 4. selecting ONE full question from each module. T1: Chap: 6 : 6.Mobility management: Principles. Fifth Edition. Wireless and Mobility: Impact on Higher-layer protocols. Addressing. Handoffs in GSM.1. Pearson. On to 4G:LTE. Broadcast and Multicast Routing: Broadcast Routing Algorithms and Multicast. Computer Networks. IP and Routing Algorithms in network layer • Understand the Wireless and Mobile Networks covering IEEE 802. Cengage Learning . James F Kurose and Keith W Ross. T1: Chap 4:4. Computer Networks. Mobile IP. Routing to a mobile node. Providing Multiple Classes of Service.7. Intra-AS Routing in the Internet: OSPF. Managing mobility in cellular Networks.7 Module – 4 Mobile and Multimedia Networks: Cellular Internet Access: An Overview of 10 Hours Cellular Network Architecture.7. content distribution Networks.

DELETE. 2. database languages.8. Three schema architecture and data independence.5. and dealing with constraint violations.1 to 4. Module – 4 Normalization: Database Design Theory – Introduction to Normalization using 10 Hours Functional and Multivalued Dependencies: Informal design guidelines for relation schema. 6.6. 7. Textbook 1: 4.) Examples of Queries in relational algebra. and Instances. Schemas. examples. Module – 1 Teaching Hours Introduction to Databases: Introduction. An introduction to JDBC. and interfaces. Relational Model Constraints 10 Hours and relational database schemas. Internet Applications: The three-Tier application architecture. Textbook 2: 3. and structural constraints. Characteristics of database approach. Overview of Database Languages and Architectures: Data Models. grouping. 8. Mapping Conceptual Design into a Logical Design: Relational Database Design using ER-to-Relational mapping. Second and Third Normal Forms. Database Application Development: Accessing databases from applications. Additional features of SQL. technology. etc. JDBC classes and interfaces. Schema change statements in SQL. Conceptual Data Modelling using Entities and Relationships: Entity types.1. Specifying 10 Hours constraints as assertions and action triggers. The presentation layer. SQLJ. attributes.1 to 5. The Database System environment. Functional Dependencies.7. History of database applications. The Middle Tier Textbook 1: Ch 5. Textbook 1: Ch 3.1 to 7.1.1 to 6. Case study: The internet Bookshop. Textbook 1: Ch 1. retrieval queries in SQL. Views in SQL. Entity sets.8.5.1 to 2.6.1 to 1. and practice. transactions. ER diagrams. Boyce-Codd Normal Form. • Practice SQL programming through a variety of database problems. 7. specifying constraints in SQL. Weak entity types.5 to 7. and UPDATE statements in SQL. Stored procedures. 3. Normal Forms based on Primary Keys. 10 Hours Advantages of using the DBMS approach.4.5 Module – 3 SQL : Advances Queries: More complex SQL retrieval queries.2. Multivalued .10 Module – 2 Relational Model: Relational Model Concepts. Textbook 2: 6. DATABASE MANAGEMENT SYSTEM [As per Choice Based Credit System (CBCS) scheme] (Effective from the academic year 2016 -2017) SEMESTER – V Subject Code 15CS53 IA Marks 20 Number of Lecture Hours/Week 4 Exam Marks 80 Total Number of Lecture Hours 50 Exam Hours 03 CREDITS – 04 Course objectives: This course will enable students to • Provide a strong foundation in database concepts. SQL: SQL data definition and data types. Update operations. 7. roles. INSERT. Specialization and Generalization. additional relational operations (aggregate.1 to 6. • Demonstrate the use of concurrency and transactions in database • Design and build database applications for real world problems. Relational Algebra: Unary and Binary relational operations.

Navathe. 22. . Database Principles Fundamentals of Design. Morris. Algorithms for Relational Database Schema Design. Shadow paging. Languages. Properties of Relational Decompositions.5. Design and Application Programming. and Gehrke. Equivalence. Concurrency control based on Timestamp ordering. 22.7. 2013. Characterizing schedules based on Serializability. Other dependencies and Normal Forms Textbook 1: Ch 15. Recovery techniques based on immediate update.1 to 15. Database systems Models. Implementation and Management.Dependency and Fourth Normal Form. 2. Each question will have questions covering all the topics under a module. Mc-Graw Hill. Desirable properties of Transactions. There will be TWO questions from each module. analyze and define database objects. and alternate Relational Designs.4. Granularity of Data items and Multiple Granularity Locking. Ramez Elmasri and Shamkant B. Introduction to Database Recovery Protocols: Recovery Concepts. Concurrency Control in Databases: Two-phase locking techniques for Concurrency control. Join Dependencies and Fifth Normal Form. Transaction 10 Hours and System concepts.1 to 21. 3rd Edition. Pearson. Dangling tuples. The students will have to answer FIVE full questions. Text Books: 1. 21. Normalization Algorithms: Inference Rules. Multiversion Concurrency control techniques. Characterizing schedules based on recoverability. Question paper pattern: The question paper will have TEN questions. • Use Structured Query Language (SQL) for database manipulation.1 to 20. Validation Concurrency control techniques. Database backup and recovery from catastrophic failures Textbook 1: 20. and Minimal Cover. Further discussion of Multivalued dependencies and 4NF.6. • Design and build simple database systems • Design and build GUI application to interact with databases. selecting ONE full question from each module. McGraw Hill Reference Books: 1. Cengage Learning 2012. Database management systems. 2. 2014. Transaction support in SQL. Ramakrishnan. Course outcomes: The students should be able to: • Identify.1 to 22. and Rob. enforce integrity constraints on a database using RDBMS. Silberschatz Korth and Sudharshan: Database System Concepts. NO-UNDO/REDO recovery based on Deferred update. Nulls. 6th Edition.6 Module – 5 Transaction Processing: Introduction to Transaction Processing. 6th Edition. Coronel.

8. 12. alternatives that are not equivalent to PDA. Textbook 2: Ch 9. alternative equivalent definitions of a PDA. 5. 8. 7. 10 Hours Languages. decidability.2. Language acceptability by TM. Turing Machine: Turing machine model. 7. Pushdown Automata (PDA): Definition of non-deterministic PDA.6 Module – 4 Context-Free and Non-Context-Free Languages: Where do the Context-Free 10 Hours Languages(CFL) fit. Textbook 1: Ch 6. Techniques for TM construction.1 to 5. Algorithms and Decision Procedures for CFLs: Decidable questions. Bidirectional Transducers. proving that a Grammar is correct. Regular Grammars and Regular languages.1 to 13. AUTOMATA THEORY AND COMPUTABILITY [As per Choice Based Credit System (CBCS) scheme] (Effective from the academic year 2016 -2017) SEMESTER – V Subject Code 15CS54 IA Marks 20 Number of Lecture Hours/Week 4 Exam Marks 80 Total Number of Lecture Hours 50 Exam Hours 03 CREDITS – 04 Course objectives: This course will enable students to • Introduce core concepts in Automata and Theory of Computation • Identify different Formal language Classes and their Relationships • Design Grammars and Recognizers for different formal languages • Prove or disprove theorems in automata theory using their properties • Determine the decidability and intractability of Computational problems Module – 1 Teaching Hours Why study the Theory of Computation. Textbook 1: Ch 11.1 to 9. Finite State Transducers. Derivation and Parse trees. Ambiguity. Finite State Machines (FSM): Deterministic FSM. Nondeterministic FSMs.5. To show that a language is regular. Languages and Strings: Strings. Showing a language is context-free. Kleene’s theorem. Canonical form of Regular languages.1 to 8.10 Module – 2 Regular Expressions (RE): what is a RE?. Computation.2.6 Module – 5 Variants of Turing Machines (TM). Textbook 1: Ch 1. designing CFGs. Deterministic and Non-deterministic PDAs. to show some languages are not RLs. Regular languages. 9: 6. Regular Grammars: Definition. Important closure properties of CFLs. A Language Hierarchy. 12: 11. decidable languages. Simulators for FSMs. 7. simplifying CFGs. Pumping theorem for CFL. .8. design of TM. Un-decidable questions. Regular Languages (RL) and Non- regular Languages: How many RLs.4. The model of Linear Bounded automata: 10 Hours Decidability: Definition of an algorithm. Manipulating and Simplifying REs. Closure properties of RLs.4 Module – 3 Context-Free Grammars(CFG): Introduction to Rewrite Systems and Grammars. Normal Forms. Minimizing FSMs. Representation. From FSMs to Operational Systems. Textbook 1: Ch 13: 13.1 to 11.1 to 6. Designing FSM.1. Deterministic CFLs. Applications of 10 Hours REs. Non-determinism and Halting. 10 Hours CFGs and languages.1 to 12.

Complexity: Growth rate of functions. 3rd Edition. 3rd Edition.8. Languages. 12. 12. • Classify a problem with respect to different models of Computation. “An Introduction to Formal Languages and Automata”.1. 2013 4. 2012 . Elaine Rich. Narosa Publishers.2013 3. 1998 5. 2013 2. 3rd edition.2 Course outcomes: The students should be able to: • Acquire fundamental understanding of the core concepts in automata theory and Theory of Computation • Learn how to translate between different models of Computation (e. The students will have to answer FIVE full questions. 3rd Edition.Undecidable languages. Context Free) and their relative powers.1 to 10. Formal Languages and Automata theory. Church-Turing thesis. and Computation. 12.8. Anami. selecting ONE full question from each module. Theory of Computer Science. There will be TWO questions from each module. Introduction to AutomataTheory. 12. Textbook 2: Ch 9. Deterministic and Non-deterministic and Software models). N Chandrasekaran . 10. Tata McGraw –Hill Publishing Company Limited.8. with an emphasis on semantic precision and conciseness. Jeffery D Ullman.7. John C Martin. Computability and Complexity. Karibasappa K G. halting problem of TM. McGraw hill. Michael Sipser : Introduction to the Theory of Computation. 12. Basavaraj S.2012/2013 2. John E Hopcroft. Question paper pattern: The question paper will have TEN questions. Wiley India. Quantum Computation: quantum computers. Rajeev Motwani. Pearson Education. Post correspondence problem. K L P Mishra. Peter Linz.. • Design Grammars and Automata (recognizers) for different language classes and become knowledgeable about restricted models of Computation (Regular. 1st Edition.8. 3rd Edition.g. Cengage learning. Each question will have questions covering all the topics under a module. Introduction to Languages and The Theory of Computation. 2012 Reference Books: 1. • Develop skills in formal reasoning and reduction of a problem to a formal model. Automata. Pearson Education.7 to 9. Text Books: 1.1.2. the classes of P and NP.

11. Updating the Design Class Diagram. Identifying Object Behaviour-The state chart Diagram. Detailed object. Domain interaction model. • Explain the facets of the unified process approach to design and build a Software system. System Conception and Domain Analysis: Process Overview: 8 Hours Development stages. A sample class model. Evidence for usefulness of OO development. N-ary associations.8 Hours oriented Requirements definitions. Modelling as Design technique: Modelling. 2. Development life Cycle. System Processes-A use case/Scenario view. Domain Analysis: Overview of analysis. Text Book-1:Chapter. sequence model and state chart model for a given problem. • Demonstrate concept of use-case model. Domain Class model: Domain state model. Advanced Class Modelling.and 12 Module – 4 Use case Realization :The Design Discipline within up iterations: Object 8 Hours Oriented Design-The Bridge between Requirements and Implementation. Derived Data. abstraction. preparing a problem statement. Packages. Modelling Concepts and Class Modelling: What is Object 8 Hours orientation? What is OO development? OO Themes. elaborating a concept. 3 and 4 Module – 2 UseCase Modelling and Detailed Requirements: Overview. Constraints. Integrated Object-oriented Models. Aggregation. System Conception: Devising a system concept. Class Modelling: Object and Class Concept. OO modelling history. Multiple inheritance. Iterating the analysis. The Three models. Association ends. Generalization and Inheritance. Advanced object and class concepts. Designing with Communication Diagrams. Reification. OBJECT ORIENTED MODELING AND DESIGN [As per Choice Based Credit System (CBCS) scheme] (Effective from the academic year 2016 -2017) SEMESTER – V Subject Code 15CS551 IA Marks 20 Number of Lecture Hours/Week 3 Exam Marks 80 Total Number of Lecture Hours 40 Exam Hours 03 CREDITS – 03 Course objectives: This course will enable students to • Describe the concepts involved in Object-Oriented modelling and their benefits. Package Diagrams-Structuring the Major Components. Text Book-2:Chapter. Text Book-2: Chapter 8: page 292 to 346 .6:Page 210 to 250 Module – 3 Process Overview. Link and associations concepts. Interaction Diagrams-Realizing Use Case and defining methods. Identifying Input and outputs-The System sequence diagram.10. Design Classes and Design within Class Diagrams. Module – 1 Teaching Hours Introduction. Implementation Issues for Three-Layer Design. Metadata. Abstract classes. Navigation of class models. • Translate the requirements into implementation for Object Oriented design. • Choose an appropriate design pattern to facilitate development procedure. Text Book-1: Ch 1.

3. 1.: Object-Oriented Analysis and Design with Applications.3. Grady Booch et.2007. what is a design pattern?. Text Books: 1. • Choose and apply a befitting design pattern for the given problem. Reprint 2013 . 1. There will be TWO questions from each module.4. Organizing the catalog.al.2007. Hans Rohnert. Peter Sommerlad. 1. 1. RegineMeunier. Text Book-3:Chapter-1: 1. Erich Gamma. Volume 1.7. how to use a design pattern. Michel Stal: Pattern –Oriented Software Architecture. 2. Pearson Education. Richard Helm. 3rd edition. Jackson and Burd: Object-Oriented Analysis & Design with the Unified Process. 3. selecting ONE full question from each module. • Draw class diagrams. Describing design 8 Hours patterns. Course outcomes: The students should be able to: • Describe the concepts of object-oriented and basic class modelling. Ralph Johnson and john Vlissides: Design Patterns – Elements of Reusable Object-Oriented Software.3rd Edition.8. sequence diagrams and interaction diagrams to solve problems. 1.1. 3. Pearson Education. How design patterns solve design problems. A system of Patterns . Rambaugh : Object-Oriented Analysis and Design with Applications.Chapter-3. 1. John Wiley and Sons. Creational patterns: prototype and singleton(only). The students will have to answer FIVE full questions. Reference Books: 1.Chapter-4. Booch. Cengage Learning. Each question will have questions covering all the topics under a module. Question paper pattern: The question paper will have TEN questions. the catalog of design patterns.6. James Rumbaugh: Object Oriented Modelling and Design with UML.2nd Edition.5. Satzinger.Frank Buschmann. pearson.structural patterns adaptor and proxy(only). Jacobson.2007.Pearson Education. Michael Blaha.2005 2.2005. how to select a design patterns.Module – 5 Design Patterns: Introduction. 2.

SOCIAL NETWORK ANALYSIS [As per Choice Based Credit System (CBCS) scheme] (Effective from the academic year 2016 -2017) SEMESTER – V Subject Code 15IS552 IA Marks 20 Number of Lecture Hours/Week 03 Exam Marks 80 Total Number of Lecture Hours 40 Exam Hours 03 CREDITS – 03 Course objectives: This course will enable students to • Discuss essential knowledge of network analysis applicable to real world data. Module 3 Network communities and Affiliation networks: Networks communities. David Easley and John Kleinberg. • Explain basic principles behind network analysis algorithms. Graph theory basics. Recommendation systems. Low -dimensional projections Module 5 Social media mining and SNA in real world: FB/VK and Twitter analysis: 8 Hours Natural language processing and sentiment mining. Modularity clustering. Influence maximization. likes. Network visualization and graph layouts. summarize and compare networks. Course Outcomes: The students should be able to: • Define notation and terminology used in network science. Networks examples. Module 2 Network structure. Degree distribution. Affiliation network and bipartite graphs. Basic cascade model. . "Networks. with examples from today’s most popular social networks. closeness and betweenness centrality. Node centrality metrics: degree. connections. Cliques and k-cores. Each question will have questions covering all the topics under a module. Module 4 Information and influence propagation on networks and Network 8 Hours visualization: Social Diffusion. • Analyzing real world network. Most influential nodes in network. Properties of large social networks: friends. Question paper pattern: The question paper will have TEN questions. There will be TWO questions from each module. Algorithm HITS. Text Books: 1. Frequent patterns. Statistical network properties." Cambridge University Press 2010. and Markets: Reasoning About a Highly Connected World. • Demonstrate. re-tweets. The students will have to answer FIVE full questions. clustering coefficient. Module 1 Teaching Hours Introduction to social network analysis and Descriptive network analysis: 8 Hours Introduction to new science of networks. Node centralities and ranking on network: Nodes and 8 Hours edges. 1-mode projections. Graph sampling. Network motifs. network diameter and average path length. Edge betweenness. Eigenvector centrality and PageRank. selecting ONE full question from each module. Crowds. 8 Hours Graph partitioning and cut metrics.

“Statistical Analysis of Network Data with R (Use R!)”. 3. NIL . Stanley Wasserman and Katherine Faust. 2. Springer. Gabor Csardi. Eric Kolaczyk. Methods and Applications. 1994. "Social Network Analysis. Reference Books: 1." Cambridge University Press. 2014.

JDBCDriverTypes.Met adata. Working With Maps. Obtaining Annotations at run time by use of reflection. Boolean and character values. Single Member annotations. example. type wrappers. Reading HTTP Request Headers. the values() and valueOf() Methods. Datagrams. URI Class.JDBCPackages. specifying retention policy. Sending Data to a client and writing the HTTP Response Header. Autoboxing/Unboxing. java enumerations are class types.InetAddress.Inet4address and Inet6 address. URL. Anatomy of a Java servlet.ABrief Overview oftheJDBCprocess.Datatypes. Recent Changes to 8 Hours Collections. Tracking Sessions.StatementObjects. Module – 4 Java Servlets: Java Servlets and Common Gateway Interface Programming.The Networking Classes and 8 Hours Interfaces. Cookies. Marker Annotations. Working with Cookies.TransactionProcessing.Exceptions.TCP/IP Client Sockets. The legacy Classes and Interfaces. Why Generic Collections?. Autoboxing and Annotations(metadata): Enumerations. HttpURL connection. Comparators.Associating the JDBC/ODBC BridgewiththeDatabase.Java2EnterpriseEditionOverview: J2EE andJ2SE. Autoboxing. A word of Warning. Accessing a collection Via an Iterator. Annotation basics. Annotated element Interface.ResultSet. Deployment Descriptor. Annotations. Module – 3 Networking:Networking Basics. Reading Data from a Client. The Collection Algorithms.DatabaseConnection. Autoboxing and Methods. The Collection Interfaces. Autoboxing/Unboxing helps prevent errors. Autoboxing/Unboxing occurs in Expressions.JDBC Objects: TheConcept ofJDBC. The Random Access Interface. Parting Thoughts on Collections. Module – 2 The collections and Framework: Collections Overview. enumerations Inherits Enum. 8 Hours Benefits of using a Java Servlet. 8 Hours Enumeration fundamentals. ADVANCED JAVA AND J2EE [As per Choice Based Credit System (CBCS) scheme] (Effective from the academic year 2016 -2017) SEMESTER – V Subject Code 15CS553 IA Marks 20 Number of Lecture Hours/Week 3 Exam Marks 80 Total Number of Lecture Hours 40 Exam Hours 03 CREDITS – 03 Course objectives: This course will enable students to • Identify the need for advanced Java concepts like Enumerations and Collections • Construct client-server applications using Java socket API • Make use of JDBC to access database through Java Programs • Adapt servlets to build server side programs • Demonstrate the use of JavaBeans to develop component-based Java software Module – 1 Teaching Hours Enumerations. Storing User Defined Classes in Collections. The Collection Classes. Using Default values.URL connection.TCP/IP Server Sockets. . Built-In annotations.

The JAR File. 7th Edition. Course outcomes: The students should be able to: • Interpret the need for advanced Java concepts like enumerations and collections in developing modular and efficient programs • Build client-server applications and TCP/IP socket programs • Illustrate database access and details for managing information using the JDBC API • Describe how servlets fit into Java-based web application architecture • Develop reusable software components using Java Beans Graduate Attributes • Problem Analysis • Development of solutions • Modern tool usage • Communication • Life-long learning Question paper pattern: The question paper will have TEN questions. Session Objects. Daniel Liang: Introduction to JAVA Programming. . StephanieBodoffetal:TheJ2EETutorial.TataMcGrawHill. JimKeogh:J2EE-TheCompleteReference. 2 Edition. 2. Pearson Education. Each question will have questions covering all the topics under a module.Module – 5 Java Server Pages (JSP): JSP.Pearson Education. Session Java Bean. 7 Edition. Java Remote Method Invocation: Remote Method Invocation concept.2004. Enterprise Java Beans: Enterprise Java Beans. 2007. Tomcat. Tata McGraw Hill. JSP Tags. Client side. Y. Deployment Descriptors. Herbert Schildt: Java The Complete Reference. Text Books: 1. nd 2. Entity Java Bean. 8 Hours Cookies. Server side. selecting ONE full question from each module. Request String. Reference Books: th 1. User Sessions. 2007. There will be TWO questions from each module. 2007. Message-Driven Bean. The students will have to answer FIVE full questions.

functional programming 8 Hours Module – 5 Logic programming. Programming languages by Allen B. memory management 8 Hours Module – 4 Imperative programming. object oriented programming. There will be TWO questions from each module. PROGRAMMING LANGAUGES [As per Choice Based Credit System (CBCS) scheme] (Effective from the academic year 2016 -2017) SEMESTER – V Subject Code 15IS554 IA Marks 20 Number of Lecture Hours/Week 3 Exam Marks 80 Total Number of Lecture Hours 40 Exam Hours 03 CREDITS – 03 Course objectives: This course will enable students to • Acquaint with discipline of programming • Familiarize with semantics of different constructs of languages • Introduce different programming paradigms • Illustrate use of different languages and their applications Module – 1 Teaching Hours Overview. The students will have to answer FIVE full questions. semantic interpretation 8 Hours Module – 3 Functions. event-driven programming. selecting ONE full question from each module. function implementation. Each question will have questions covering all the topics under a module. Types. concurrent programming 8 Hours Course outcomes: The students should be able to: • Select appropriate languages for given applications • Demonstrate usage and justification of different languages • Compare and contrast the strengths and weaknesses of different languages Question paper pattern: The question paper will have TEN questions. Noonan Reference Books: NIL . Text Books: 1. Type systems 8 Hours Module – 2 Semantics. Tucker and Robert E. Names.

9. Implement the above program using as message queues or FIFOs as IPC channels. 5. Write a program for congestion control using leaky bucket algorithm. Implement simple ESS and with transmitting nodes in wire-less LAN by simulation and determine the performance with respect to transmission of packets. . typed at the server side. Study Experiment / Project: NIL Course outcomes: The students should be able to: • Analyze and Compare various networking protocols. vary the bandwidth and find the number of packets dropped. Write a program to find the shortest path between vertices using bellman-ford algorithm. 12. Write a program for simple RSA algorithm to encrypt and decrypt the data. 3. 4. COMPUTER NETWORK LABORATORY [As per Choice Based Credit System (CBCS) scheme] (Effective from the academic year 2016 -2017) SEMESTER – V Subject Code 15CSL57 IA Marks 20 Number of Lecture Hours/Week 01I + 02P Exam Marks 80 Total Number of Lecture Hours 40 Exam Hours 03 CREDITS – 02 Course objectives: This course will enable students to • Demonstrate operation of network and its management commands • Simulate and demonstrate the performance of GSM and CDMA • Implement data link layer and transport layer protocols. Using TCP/IP sockets. 2. 10. Set the queue size. 6. Implement an Ethernet LAN using n nodes and set multiple traffic nodes and plot congestion window for different source / destination. Plot necessary graphs and conclude using any suitable tool. Write a program on datagram socket for client/server to display the messages on client side.bits). 11. write a client – server program to make the client send the file name and to make the server send back the contents of the requested file if present. Implement three nodes point – to – point network with duplex links between them. Write a program for error detecting code using CRC-CCITT (16. 8. Implement transmission of ping messages/trace route over a network topology consisting of 6 nodes and find the number of packets dropped due to congestion. PART B Implement the following in Java: 7. Implement and study the performance of CDMA on NS2/NS3 (Using stack called Call net) or equivalent environment. Implement and study the performance of GSM on NS2/NS3 (Using MAC layer) or equivalent environment. Lab Experiments: PART A 1. Description (If any): For the experiments below modify the topology and parameters set for the experiment and take multiple rounds of reading and analyze the results available in log files.

Strictly follow the instructions as printed on the cover page of answer script 4. 3. Marks distribution: Procedure + Conduction + Viva: 80 Part A: 5+30+5 =40 Part B: 5+30+5 =40 5. All laboratory experiments are to be included for practical examination. • Demonstrate the working of different concepts of networking. analyze and evaluate networking protocols in NS2 / NS3 Conduction of Practical Examination: 1. Students are allowed to pick one experiment from part A and part B with lot. • Implement. Change of experiment is allowed only once and marks allotted to the procedure part to be made zero. . 2.

Date_Out. number of copies in each branch. Card_No.) Lab Experiments: Part A: SQL Programming 1 Consider the following schema for a Library Database: BOOK(Book_id. develop. . 4. PHP. Exam Mks. technology and practice to groom students into well-informed database application developers. or any other similar front-end tool. Add appropriate database constraints. 30) • Use Java. Create a view of all books and its number of copies that are currently available in the Library. Count the customers with grades above Bangalore’s average. Author_Name) PUBLISHER(Name. title. 50) • Design. MS SQL Server. Due_Date) LIBRARY_BRANCH(Branch_id. Retrieve details of all books in the library – id. PART-B: Mini Project (Max. Update the contents of other tables to reflect this data manipulation operation. Publisher_Name. Delete a book in BOOK table. C#. Exam Mks. Salesman_id) Write SQL queries to 1. MySQL. No-of_Copies) BOOK_LENDING(Book_id. Python. name of publisher. Grade. Phone) BOOK_COPIES(Book_id. Title. • Strong practice in SQL programming through a variety of database problems. Ord_Date. DBMS LABORATORY WITH MINI PROJECT [As per Choice Based Credit System (CBCS) scheme] (Effective from the academic year 2016 -2017) SEMESTER – V Subject Code 15CSL58 IA Marks 20 Number of Lecture Hours/Week 01I + 02P Exam Marks 80 Total Number of Lecture Hours 40 Exam Hours 03 CREDITS – 02 Course objectives: This course will enable students to • Foundation knowledge in database concepts. • Create Schema and insert at least 5 records for each table. 3. Commission) CUSTOMER(Customer_id. authors. Partition the BOOK table based on year of publication. 2. Purchase_Amt. 2 Consider the following schema for Order Database: SALESMAN(Salesman_id. Description (If any): PART-A: SQL Programming (Max. Branch_Name. Customer_id. City. Branch_id. and implement the specified queries for the following problems using Oracle. Cust_Name. Name. • Develop database applications using front-end tools and back-end DBMS. 5. Demonstrate its working with a simple query. Address. Address) Write SQL queries to 1. etc. Branch_id. Salesman_id) ORDERS(Ord_No. City. Get the particulars of borrowers who have borrowed more than 3 books. All applications must be demonstrated on desktop/laptop as a stand-alone or web based application (Mobile apps on Android/IOS are not permitted. Pub_Year) BOOK_AUTHORS(Book_id. but from Jan 2017 to Jun 2017. or any other DBMS under LINUX/Windows environment.

) 4. 4. Sec) CLASS(USN. PLocation. Sex. PNo. Mov_Year. Address. Sem. List all actors who acted in a movie before 2000 and also in a movie after 2015 (use JOIN operation). Demonstrate the DELETE operation by removing salesman with id 1000. Sort the result by movie title. and C section students. Address. Mov_Title. 5. B. 5. Dir_Phone) MOVIES(Mov_id. Dir_Name. List the titles of all movies directed by ‘Hitchcock’. DNo) DEPARTMENT(DNo. Update rating of all movies directed by ‘Steven Spielberg’ to 5. Phone. 2. Dir_id) MOVIE_CAST(Act_id. Title. Act_Name. Find the name and numbers of all salesman who had more than one customer. 3. Rev_Stars) Write SQL queries to 1. 5. MgrSSN. Mov_id. 2. 5 Consider the schema for Company Database: EMPLOYEE(SSN. 3. List all the salesman and indicate those who have and don’t have customers in their cities (Use UNION operation. Sem. SName. Test3. 3 Consider the schema for Movie Database: ACTOR(Act_id. List all the student details studying in fourth semester ‘C’ section. PName. Categorize students based on the following criterion: If FinalIA = 17 to 20 then CAT = ‘Outstanding’ If FinalIA = 12 to 16 then CAT = ‘Average’ If FinalIA< 12 then CAT = ‘Weak’ Give these details only for 8th semester A. Gender) SEMSEC(SSID. SSID) SUBJECT(Subcode. 4. SuperSSN. 4 Consider the schema for College Database: STUDENT(USN. Act_Gender) DIRECTOR(Dir_id. Calculate the FinalIA (average of best two test marks) and update the corresponding table for all students. Mov_Lang. Find the movie names where one or more actors acted in two or more movies. either as a worker or as a manager of the department that controls the project. Role) RATING(Mov_id. 2.DLoc) PROJECT(PNo. Hours) Write SQL queries to 1. FinalIA) Write SQL queries to 1. DName. SSID. Create a view that finds the salesman who has the customer with the highest order of a day. Compute the total number of male and female students in each semester and in each section. Salary. Test1. All his orders must also be deleted. Create a view of Test1 marks of student USN ‘1BI15CS101’ in all subjects. Name. Credits) IAMARKS(USN. DNo) WORKS_ON(SSN. Make a list of all project numbers for projects that involve an employee whose last name is ‘Scott’. MgrStartDate) DLOCATION(DNo. Find the title of movies and number of stars for each movie that has at least one rating and find the highest number of stars that movie received. Test2. 3. Subcode. .

2. All laboratory experiments from part A are to be included for practical examination. Show the resulting salaries if every employee working on the ‘IoT’ project is given a 10 percent raise. and the average salary in this department 4. Conduction of Practical Examination: 1. 5. Retrieve the name of each employee who works on all the projects controlledby department number 5 (use NOT EXISTS operator). 6. Find the sum of the salaries of all employees of the ‘Accounts’ department. at least one trigger and one stored procedure. Marks distribution: a) Part A: Procedure + Conduction + Viva:10 + 35 +5 =50 Marks b) Part B: Demonstration + Report + Viva voce = 15+10+05 = 30 Marks 7. analyze and evaluate the project developed for an application. apply ER-mapping rules.000. 3. Students are allowed to pick one experiment from the lot. 4. 5. the minimum salary. Mini project has to be evaluated for 30 Marks as per 6(b).00. retrieve the department number and the number of its employees who are making more than Rs. Course outcomes: The students should be able to: • Create. Change of experiment is allowed only once and marks allotted to the procedure part to be made zero. using suitable frontend tool. • Make sure that the application should have five or more tables. Part B: Mini project • For any problem selected. • Indicative areas include. supply chain. industry. health care. education. as well as the maximum salary. normalize the relations. 3. For each department that has more than five employees. . Strictly follow the instructions as printed on the cover page of answer script. 2. 6. transport. • Demonstrate the working of different concepts of DBMS • Implement. Update and query on the database. etc. write the ER Diagram. Report should be prepared in a standard format prescribed for project work. and follow the application development process.