Punjabi University



B.Sc. Part III(Mathematics and Computing)(Sessions 2019-20, 2020-21, 2021-22)Department of MathematicsPunjabi University, PatialaB.Sc. (Mathematics & Computing) Part-IIIOutlines of Tests, Syllabi and Courses of Reading(2019-20, 2020-21, 2021-22)SEMESTER-VCORE SUBJECTSCode Title of Paper/SubjectHrs./WeekMax. Cont. Asmt.Marks Univ. Exam.TotalMC-501Algebra (Group and Ring Theory)53070100MC-502Mechanics- I53070100CS-503Modeling and Simulation53070100CS-504 ASoft Computing5104050CS-504 BSoftware Lab-V (Matlab Programming)5203050ELECTIVE SUBJECTS (Select any one subject according to available facilities)Code Title of Paper/SubjectHrs./WeekMax. Cont. Asmt.Marks Univ. Exam.TotalMC-505Discrete Mathematics and Graph Theory53070100SC-506Sample Surveys53070100CS-507Web Programming53070100CS-508Design and Analysis of Algorithms53070100MC-509Mathematical Accounting53070100SEMESTER-VICORE SUBJECTSCode Title of Paper/SubjectHrs./WeekMax. Cont. Asmt.Marks Univ. Exam.TotalMC-601Partial Differential Equations53070100MC-602Numerical Analysis 53070100CS-603Computer Networks53070100CS-604 ADatabase Management System5104050CS-604 BSoftware Lab-VI(Oracle)4203050ELECTIVE SUBJECTS (Select any one subject according to available facilities)Code Title of Paper/SubjectHrs./WeekMax. Cont. Asmt.Marks Univ. Exam.TotalMC-605Tensor Analysis53070100SC-606Analysis and design of Experiments53070100CS-607Pervasive and Mobile Computing53070100CS-608Cloud Computing53070100MC-501 : Algebra (Group and Ring Theory)LTP University Exam: 70410 Internal Assesment: 30 Time Allowed: 3hrs. Total: 100INSTRUCTION FOR THE PAPER SETTERThe question paper will consist of three sections A, B and C. Sections A and B will have four questions each from the respective sections of the syllabus and Section C will consist of one compulsory question having ten short answer type questions covering the entire syllabus uniformly. Each question in Sections A and B will be of 10 marks and Section C will be of 30 marks.INSTRUCTIONS FOR THE CANDIDATESCandidates are required to attempt five questions in all selecting two questions from each of the Section A and B and compulsory question of Section C.Section ADerived subgroups, Normal and Subnormal series, Composition series, Solvable groups, Zassenhaus lemma, Schereier’s refinement theorem and Jordan-Holder theorem.Rings: Definitions and Simple properties, Integral domains, Division rings, Fields, Sub rings and Ideals, Algebra of ideals, Nilpotent and Nil ideals, Prime ideals, Maximal ideals. Section BQuotient Rings, Homomorphism, Fundamental theorem of ring homomorphism, First and Second theorems of isomorphism, Field of quotients, Embedding Theorems. Polynomial Rings, Factorization and Divisibility in integral domains, Unique Factorization Domains(UFDs), Principal Ideal Domains (PIDs), Euclidean domains and relationships between them.Books recommended1. David S. Dummit and Richard M Foote: Abstract Algebra, John Wiley &Sons, 2004.2. Surjeet Singh and Qazi Zameeruddin: Modern Algebra, 7th Edition, VikasPublishing House, New Delhi 1993.3. I.N. Herstein: Topics in Algebra, 2nd Edition, Vikas Publishing House,1976.MC-502: Mechanics- ILTP University Exam: 70410 Internal Assesment: 30 Time Allowed: 3hrs. Total: 100INSTRUCTION FOR THE PAPER SETTERThe question paper will consist of three sections A, B and C. Sections A and B will have four questions each from the respective sections of the syllabus and Section C will consist of one compulsory question having ten short answer type questions covering the entire syllabus uniformly. Each question in Sections A and B will be of 10 marks and Section C will be of 30 marks.INSTRUCTIONS FOR THE CANDIDATESCandidates are required to attempt five questions in all selecting two questions from each of the Section A and B and compulsory question of Section C.SECTION-AStatics: Basic notation, Newton Laws of motion, system of two forces, parallelogram law of forces, resultant of two collinear forces, resolution of forces, moment of a force, couple, theorem on moments of a couple, coplanar forces, resultant of three coplanar concurrent forces, theorem of resolved parts, resultant of two forces acting on a rigid body, Varignon’s theorem, generalized theorem of moments.SECTION-BEquilibrium of two concurrent forces, equilibrium condition for any number of coplanar concurrent forces, Lami’s theorem. λ - ? theorem, theorems of moments, resultant of a force and a copule. Equilibrium conditions for coplanar non-concurrent forces. Friction: Definition and nature of friction , laws of friction, Centre of gravity.Books recommended:S.L. Loney: The elements of statics and dynamics, 5th edition, Cambridge University Press, 1947.J. L. Synge and B. A. Griffth : Principles of mechanics, Published by Nabu Press.CS-503: MODELING AND SIMULATIONL T P University Exam: 704 1 0 Internal Assessment: 30Time Allowed: 3 hours Total: 100INSTRUCTIONS FOR THE PAPER-SETTERThe question paper will consist of three sections A, B and C. Sections A and B will have four questions each from the respective sections of the syllabus and Section C will consist of one compulsory question having ten short answer type questions covering the entire syllabus uniformly. Each question in Sections A and B will be of 10 marks and Section C will be of 30 marks.INSTRUCTIONS FOR THE CANDIDATESCandidates are required to attempt five questions in all selecting two questions from each of the Section A and B and compulsory question of Section C.SECTION – AIntroduction: What is modeling and simulation, application areas, definition and types of system, model and simulation, introduction to discrete-event and continuous simulation.Simulation Methods: Discrete-event Simulation, Time advance Mechanisms, Components and organization of Discrete event simulation, Flowchart of next-event time advance approach, Continuous Simulation, Random Number generation methods.SECTION – BQueuing Models: Single server queuing system, introduction to arrival and departure time, flowcharts for arrival and departure routine. Event graphs of queuing model. Determining the events and variables.Random Numbers: Introduction to Random Numbers, Importance of Random Numbers in Simulation, Mid-Square random number generator, Residue method, Arithmetic Congruential generator.Books Recommended:1. Averill M. Law and W. David Kelton: “Simulation Modeling and Analysis”, Tata McGraw-Hill Publication.2. Geoffery Gordon: “System Simulation”, Prentice-Hall of India.3. D.S. Hira: “System Simulation”, S. Chand Publication.4. Stephen J. Chapman: “MATLAB Programming for Engineers”, Thomson learning inc.5. Jerry Banks, John S. Carson, Barry L. Nelson and David M. Nicol: “Discrete-Event System Simulation”, Prentice-Hall of India.CS-504 A: SOFT COMPUTINGL T P University Exam: 404 1 0 Internal Assessment: 10Time Allowed: 3 hours Total: 50INSTRUCTIONS FOR THE PAPER-SETTERThe question paper will consist of three sections A, B and C. Sections A and B will have four questions each from the respective sections of the syllabus and Section C will consist of one compulsory question having ten short answer type questions covering the entire syllabus uniformly. Each question in Sections A and B will be of 6 marks and Section C will be of 16 marks.INSTRUCTIONS FOR THE CANDIDATESCandidates are required to attempt five questions in all selecting two questions from each of the Section A and B and compulsory question of Section C.SECTION – AIntroduction: Introduction to Soft Computing and its application.NEURAL NETWORK: Basic concepts and characteristics, Model of an artificial neuron and terminology, Neural Network Architectures: Single Layer Feedforward Networks; Multilayer Feedforward Networks and Recurrent Networks, Characteristics of Neural Networks, Learning Methods, ADALINE and MADALINE networks, Application Domains of Neural Network.SECTION – BFUZZY LOGIC: Fuzzy sets, membership function, basic fuzzy set operations, fuzzy set properties, Fuzzy relations, operation on fuzzy relations, fuzzy systems, crisp logic, predicate logic, fuzzy logic, fuzzy rule based system and de-fuzzification methods, Applications of fuzzy systems.GENETIC ALGORITHM AND GENETIC MODELLING: Basic concepts, survival of the fittest, working principle, encoding techniques, fitness function, reproduction including Roulette-wheel selection, tournament selection, rank selection and steady state selection, Operators: Crossover techniques, mutation.Books Recommended:1. S. Rajasekaran, G.A. Vijayalakshmi Pai: Neural Networks, Fuzzy Logic and Genetic Algorithms:Synthesis and Applications, 15th Edition, PHI Learning.2. S.N Sivanandam, SN Deepa: Principles of Soft Computing, Wiley India, 2nd Edition3. James Freeman A. and David Skapura: Neural Networks - Algorithms, Applications &Programming Techniques, Addison Wesley CS-504(B): Software Lab-V (MATLAB PROGRAMMING)L T P University Exam: 300 0 5 Internal Assessment: 20Time Allowed: 3 hours Total: 50This lab will be based on the following topics:Programming Environment: ? MATLAB Windows, Expressions, Constant, Variables and assignment statement, Arrays and various operationsGraph Plots: Basic plotting, Built in functions, Generating waveforms,?Sound replay, load and save.Procedures and Functions: Arguments and return values, M-files, Formatted console input-output, String handlingControl Statements: Conditional statements: If, Else, Elseif, Repetition statements: While, For.Manipulating Text: Writing to a text file, Reading from a text files, Randomising and sorting a list, searching a list.Arbitrary function fit : Error function, Fixing parameters. Matrix and simulations.MATLAB toolboxe: Fuzzy logic tool boxReferences:"Essential MATLAB for scientists and engineers" by Brian D. Hahn, Arnold, 2001, ISBN 0-7506524-0-3."MATLAB: A Practical Introduction to Programming and Problem Solving" by Stormy Attaway, 3rd edition, Elsevier, 2013."Modeling and Simulation using MATLAB - Simulink" by Dr. Shailendra Jain,, Wiley, January 2015.MATLAB Getting Started Guide Central (script, toolbox, blog, newsgroup) : Discrete Mathematics and Graph TheoryLTP University Exam: 70410 Internal Assessment: 30 Time Allowed: 3hrs. Total: 100INSTRUCTION FOR THE PAPER SETTERThe question paper will consist of three sections A, B and C. Sections A and B will have four questions each from the respective sections of the syllabus and Section C will consist of one compulsory question having ten short answer type questions covering the entire syllabus uniformly. Each question in Sections A and B will be of 10 marks and Section C will be of 30 marks.INSTRUCTIONS FOR THE CANDIDATESCandidates are required to attempt five questions in all selecting two questions from each of the Section A and B and compulsory question of Section C.Section-APigeonhole principle, Basic counting principles, permutations and combinations of sets andmultisets, Binomial and multinomial theorems, Combinatorial identities, inclusion and exclusionprinciple, Recurrence relations, Generating functions solution of recurrence relations usingdifference equations and generating functions.Section-BElements of Graph Theory, Eulerian and Hamiltonian trails and cycles. Bipartite multigraphs,Trees, Spanning Trees, Algorithms for BFS and DFS trees weighted Graphs, Greedy algorithmand Prim’s Algorithm for generating minimum weight spanning graphs, Digraphs, Planar graphs,Euler formula and Chromatic numbers. (Scope as in Introductory Combinatorics, 5th Edition byBrualdi , Chapters 1-3,5-8,11 (except § 11.6), 12 .1, 13.1,13.2)Reference Books:1. Brualdi: Introductory Combinatorics, 5th Edition, Pearson, 2010.2. J. L. Mott, Kandel and T. P. Baker: Discrete Mathematics for Computer Scientists andMathematicians, Prentice Hall, 1986.SC 506 - SAMPLE SURVEYSLTP University Exam: 70410 Internal Assessment: 30 Time Allowed: 3hrs. Total: 100INSTRUCTION FOR THE PAPER SETTERThe question paper will consist of three sections A, B and C. Sections A and B will have four questions each from the respective sections of the syllabus and Section C will consist of one compulsory question having ten short answer type questions covering the entire syllabus uniformly. Each question in Sections A and B will be of 10 marks and Section C will be of 30 marks.INSTRUCTIONS FOR THE CANDIDATESCandidates are required to attempt five questions in all selecting two questions from each of the Section A and B and compulsory question of Section C.Section ASample Surveys, Concepts of population and sample, need for sampling, Census and sample survey, basic concepts in sampling, organizational aspects of survey sampling, sample selection and sample size. Some basic sampling methods- simple random sampling (SRS) with and with out replacement. Stratified random sampling, Systematic sampling, Section BRatio and regression methods of estimation under SRS. Non sampling errors, acquaintance with the working (questionnaires, sampling design, methods followed in field investigation, principal findings etc.) of NSSO, and other agencies undertaking sample surveys.Reference Books:Cochran W.G and Cox G.M (1957): Experimental Designs, John Wiley and Sons.Das M.N and Giri (1986): Design and Analysis of Experiments, Springer Verlag Murthy M.N( 1967): Sampling Theory and Methods, Statistical Publishing Society, Calcutta.Sampath S. (2000): Sampling Theory and Methods, Narosa Publishing House.Sukhatme B.V(1984) : Sample Survey methods and Its Applications, Indian Society of Agricultural Statistics. Des Raj (2000) : Sample Survey Theory, Narosa Publishing House. CS-507: WEB PROGRAMMINGLTP University Exam: 70410 Internal Assessment: 30 Time Allowed: 3hrs. Total: 100INSTRUCTION FOR THE PAPER SETTERThe question paper will consist of three sections A, B and C. Sections A and B will have four questions each from the respective sections of the syllabus and Section C will consist of one compulsory question having ten short answer type questions covering the entire syllabus uniformly. Each question in Sections A and B will be of 10 marks and Section C will be of 30 marks.INSTRUCTIONS FOR THE CANDIDATESCandidates are required to attempt five questions in all selecting two questions from each of the Section A and B and compulsory question of Section C.SECTION AIntroduction to internet, www, http, webpages & URL structures, and HTML. Markup vs. traditional programming languages. Creating HTML pages, viewing pages in different browsers. Structures of HTML page, tags and attributes, color codes and fonts, different elements in head section of HTML document. Text-formatting tags, applying formatting to the body section of HTML document, block level and text level tags, behavior of formatting tags in different browsersCreating external and internal links.Adding graphics with image tag, image element attributes, using images as links, image maps, supported image file formatsAdding multimedia to web pages, supported audio & video formats. Tables: Presenting information in tables, table attributes, table as layout tool, nested tablesFrames: using frames, frameset, targeted links, no-frames element.Forms: using HTML forms, input control elements and attributes, processing forms.DHTML basics : CSS, DOM, Javascript.SECTION-BCreating and applying stylesheets to HTML elements, inline embedded and linking external stylesheets, conflicting stylesDOM and object collection, using the frames and forms collection, event model ,Introduction to client side scripting and javascript, Javascript operators , control structures, functions and arrays, examples of javascript Using javascript's in-built objects : Math, String, Number and Date.Introduction to Microsoft , .Net Framework, An introduction to Web Forms, The execution model,. Web Application User Interface: Creating an Web application user interface, Implementing event handlers by using code-behind files, Explain user input by using validation controls, Create and use user controls.Reference Books Deitel, Deitel and Nieto : Internet & WWW- How to program, 2001, Pearson Education Asia.Matthew MacDonald: : The Complete Reference, Osborne.E Stephen Mack, Janan Platt : HTML 4.0 , no experience required, 1998, BPB Publications.Shiran & Shiran : Advanced Javascript programming, 1998, BPB Publications.D. Bertsellas and R. Gallager, “Data Networks”, 2nd Edition, Prentice Hall, 1992.Jesse Liberty, Dan Hurwitz: Programming , OReilly.CS-508: DESIGN AND ANALYSIS OF ALGORITHMSL T P University Exam: 704 1 0 Internal Assessment: 30Time Allowed: 3 hours Total: 100INSTRUCTIONS FOR THE PAPER-SETTERThe question paper will consist of three sections A, B and C. Sections A and B will have four questions each from the respective sections of the syllabus and Section C will consist of one compulsory question having ten short answer type questions covering the entire syllabus uniformly. Each question in Sections A and B will be of 10 marks and Section C will be of 30 marks.INSTRUCTIONS FOR THE CANDIDATESCandidates are required to attempt five questions in all selecting two questions from each of the Section A and B and compulsory question of Section C.SECTION-AAlgorithms and Analysis: Role of Algorithms in Computing; Growth of functions: AsymptoticNotation, Standard notation & common functions; Introduction to Recurrences: substitution method, recursion-tree method; Randomizing AlgorithmsDivide and Conquer: General method, Binary Search, Merge sort, Quick sort, Selection sort, Strassen's matrix multiplication and analysis of these problems.Greedy Method: General Method, Activity Selection Problem, Knapsack problem, Minimum spanning TreesSECTION-BBack Tracking: General method, 8 queen's problem, Graph colouring, Hamiltonian cycles, Analysis of these problems.Branch-And-Bound: Method, 0/1 Knapsack and Travelling Salesperson problems, Efficiencyconsiderations.Lower-Bound Theory: Techniques for Algebraic problems, Some Lower Bounds on ParallelComputation..Books Recommended:1. Cormen, Leiserson, Rivest and Stein:Introduction to algorithms, Prentice-Hall of INDIA.2. Horowitz, Sahni and Rajsekaran:Fundamentals of Computer Algorithms, Galgotia Publications3. Aho, Hopcroft, Ullman:The Design and analysis of algorithms”, Pearson Education.4. Bentley, J.L.: Writing Efficient Programs, Prentice-Hall India, Eastern Economy Edition.5. Goodman, S.E. & Hedetniemi, 2004: Introduction to the Design and Analysis of Algorithms,McGraw-Hill Book Comp.6. Knuth, D. E., 1996: Fundamental of Algorithms: The Art of Computer Programming, Vol.-1,Naresh Publ. House.MC-509 MATHEMATICAL ACCOUNTINGL T P University Exam: 704 1 0 Internal Assessment: 30Time Allowed: 3 hours Total: 100INSTRUCTIONS FOR THE PAPER-SETTERThe question paper will consist of three sections A, B and C. Sections A and B will have four questions each from the respective sections of the syllabus and Section C will consist of one compulsory question having ten short answer type questions covering the entire syllabus uniformly. Each question in Sections A and B will be of 10 marks and Section C will be of 30 marks.INSTRUCTIONS FOR THE CANDIDATESCandidates are required to attempt five questions in all selecting two questions from each of the Section A and B and compulsory question of Section C. Section AOverview: Accounting concepts, conventions and principles; Accounting Equation, International Accounting principles and standards; Matching of Indian Standards with International Accounting Standards.Mechanics of Accounting: Double entry system of accounting, Journalizing of transactions; preparation of final accounts, Profit & Loss Account, Profit & Loss Appropriation account and Balance Sheet, Policies related with depreciation, inventory and intangible assets like copyright, trademark, patents and goodwill.Section BAnalysis of financial Statement: Ratio Analysis- solvency ratios, profitability ratios, activity ratios. Market capitalization ratios; common Size Statement; comparative balance sheet and trend analysis of manufacturing, service & banking organizations.Funds Flow Statement: Meaning, Concepts of Gross and Net Working Capital, Preparation of Schedule of Changes in Working Capital, Preparation of find flows statement and its analysis; cash flow statement: Various cash and non cash transactions ,flow of cash. Preparation of cash flow statement and its analysis.Suggested ReadingNarayanswami-Financial Accounting : A Managerial Perspective(PHI,2nd Edition).Mukherjee-Financial Accounting for Management(TMH 1st Edition) .MC-601: Partial Differential EquationsLTP University Exam: 70410 Internal Assessment: 30 Time Allowed: 3hrs. Total: 100INSTRUCTION FOR THE PAPER SETTERThe question paper will consist of three sections A, B and C. Sections A and B will have four questions each from the respective sections of the syllabus and Section C will consist of one compulsory question having ten short answer type questions covering the entire syllabus uniformly. Each question in Sections A and B will be of 10 marks and Section C will be of 30 marks.INSTRUCTIONS FOR THE CANDIDATESCandidates are required to attempt five questions in all selecting two questions from each of the Section A and B and compulsory question of Section C.Section-AOrdinary differential equations in more than two variables : Simultaneous Differential equations of the first order and the first degree in three variables, Methods of their solution and applications, Pfaffian Differential forms and equations, solutions of Pfaffian Differentialequations in three variables.Partial differential equations of the first order: Partial differential equations, solution of Partialdifferential equations in three variables. Partial differential equations of the first order. Cauchy’s Problem for first order equations, Linear Partial differential equations of the first order, Integral surfaces passing through a given curve, surfaces orthogonal to a given system of surfaces.Section-BPartial differential equations of the first order: Nonlinear Partial differential equations of the first order, compatible system of first order equations, Charpit method, Jacobi Method, Cauchy’s method of characteristics.Partial differential equations of the second order and their classification into hyperbolic, ellipticand parabolic types, canonical forms. Linear partial differential equations with constantcoefficients. Laplace, Diffusion and Wave equations and their solutions in Cartesian, Spherical polar and cylindrical polar coordinates by Separation of Variables.[Scope as in the book ‘Differential Equations’ by I. N. Sneddon, Chapter 1, Chapter 2, Chapter3(4, 5, 9)]Books recommended1. R. K. Jain and S.R.K.Iyengar: Advanced Engineering Mathematics, 2nd Edition,Narosa Publishing House, 2nd Edition, 2003.2. I. N. Sneddon: Elements of Partial Differential Equations, Dover Publications, Inc.Mineola, NY, 2006.MC-602: Numerical AnalysisLTP University Exam: 70410 Internal Assessment: 30 Time Allowed: 3hrs. Total: 100INSTRUCTION FOR THE PAPER SETTERThe question paper will consist of three sections A, B and C. Sections A and B will have four questions each from the respective sections of the syllabus and Section C will consist of one compulsory question having ten short answer type questions covering the entire syllabus uniformly. Each question in Sections A and B will be of 10 marks and Section C will be of 30 marks.INSTRUCTIONS FOR THE CANDIDATESCandidates are required to attempt five questions in all selecting two questions from each of the Section A and B and compulsory question of Section C. Use of Non-Programmable Scientific Calculator is allowed.Section-AError Analysis: Number system, Floating point arithmetic, Loss of significance and propagation of errors, Error in Numerical computation, Bounds on error, Condition and Instability.Non-Linear Equations: Bisection Method, Regula-Falsi Method, Secant Method, Newton-Raphson Method, Muller Method, Chebyshev Method, Methods for multiple roots - Newton-Raphson Method, Convergence of Secant, Newton Raphson and Iterative methods.Linear System of Equations:Direct Methods: Gauss elimination method, Gauss-Jordan Elimination methods, Decomposition methods (Doolittle, Crout and Cholesky), Partition method and their error analysis. Iterative Methods: Jacobi iterative method, Gauss-Seidel iterative method, Successive over relaxation iterative method, iterative method to determine A-1, Convergence Analysis matrix. Eigen Value Problems: Power and Inverse Power method, Jacobi Method, Givens method, Householder’s method for Symmetric matrices, Ruthishauser method.Section-BInterpolation and Approximation of Functions:Lagrange’s interpolation, Newton Interpolation, Finite Difference Operators, Piecewise and Spline Interpolation, Interpolating Polynomials using Finite Differences and Hermite Interpolation, Least square approximation, Uniform approximation.Numerical Integration: Newton Cotes formulae, Trapezoidal Rule, Simpson’s 1/3-Rule, Simpson’s 3/8-Rule, Weddle’s Rule, Romberg Integration.Numerical solutions to first order ordinary differential equations: Taylor’s Series method, Picard’s Method, Euler’s and modified Euler’s methods, Runge Kutta methods.Reference Books1. MK Jain, SRK lyenger and RK Jain: Numerical Methods for Scientific and Engineering Computations, 5th Edition, New Age International (P) Limited, Publishers, New Delhi, 2007.2. Kendall E Atkinson: An introduction to Numerical Analysis, 2nd Edition John Wiley & Sons, Printed in India by Replika Pvt. Ltd., 1989.3. S.S. Sastry: Introductory Methods of Numerical Analysis, 3rd Edition (2000), Prentice Hall of India Pvt. Ltd., New Delhi.4. FB Hilderbrand: Introduction to Numerical Analysis, 2nd Edition, Dover Publication Inc, New York, 1987.5. S.D. Conte and Carl de Boor: Elementary Numerical Analysis: An Algorithmic Approach, 3rd edition, McGraw-Hill Book Company.CS-603: COMPUTER NETWORKSLTP University Exam: 70410 Internal Assessment: 30 Time Allowed: 3hrs. Total: 100INSTRUCTION FOR THE PAPER SETTERThe question paper will consist of three sections A, B and C. Sections A and B will have four questions each from the respective sections of the syllabus and Section C will consist of one compulsory question having ten short answer type questions covering the entire syllabus uniformly. Each question in Sections A and B will be of 10 marks and Section C will be of 30 marks.INSTRUCTIONS FOR THE CANDIDATESCandidates are required to attempt five questions in all selecting two questions from each of the Section A and B and compulsory question of Section C.SECTION AComputer Networks: Uses of Computer Network, Network Hardware, Network Software: Protocol hierarchies, Design issues for layers, Interfaces and services, types of services, service primitives, Goals and Applications of Computer networks, Structure of Computer Network: Point-to-point structure, Broadcasting structure, Types of Networks, Topologies. Reference Models: OSI Reference Model, TCP/IP reference Model, Comparison of OSI and TCP Reference Model. ISDN: Narrowband ISDN – Services, architecture, Interface. Data Communication: Transmission media, Wireless communication, and the Telephone system, Introduction to cellular radio and communication satellite, Data Rate of Channel, Electromagnetic spectrum. SECTION BSwitching : Circuit switching, packet switching, comparison.Multiple access protocols - ALOHA, CSMA, CSMA/CD, Collision Free protocol, Limited-contention protocols, WDMA.Introduction to Internetworking – Concepts, Repeaters, Routers, Bridges, and Gateways. Internet Protocol: IP protocol, IP Addresses, Subnets, Internet Control Protocol, Introduction to interior and exterior gateway routing protocol., internet multicasting and mobile IP. Internet Applications: Domain Name System, Electronic mail, The World Wide Web, Introduction to Multimedia - Audio, Video, Data compression. Congestion Control :General principles, prevention policies, Traffic shaping, flow specification, congestion Control in virtual circuits, choke packets, load shedding, jitter control and congestion Control in multicasting.Reference BooksAndrew S. Tanenbaum, “Computer Networks”, Third Edition, PHI Publications, 1997.Stallings William, “Data & Computer Communication”, 6th Edition, PHI Publications. REFERENCE READINGSD.E. Corner, “Computer Networks and Internets’, Second Edition, Addison-Wesley Publication, 2000.D. Bertsellas and R. Gallager, “Data Networks”, 2nd Edition, Prentice Hall, 1992.CS-604 A: DATABASE MANAGEMENT SYSTEM LTP University Exam: 40410 Internal Assessment: 10 Time Allowed: 3hrs. Total: 50INSTRUCTION FOR THE PAPER SETTERThe question paper will consist of three sections A, B and C. Sections A and B will have four questions each from the respective sections of the syllabus and Section C will consist of one compulsory question having ten short answer type questions covering the entire syllabus uniformly. Each question in Sections A and B will be of 6 marks and Section C will be of 16 marks.INSTRUCTIONS FOR THE CANDIDATESCandidates are required to attempt five questions in all selecting two questions from each of the Section A and B and compulsory question of Section C.SECTION AIntroduction: Traditional file processing system and its limitations, Characteristics of Database Approach, Advantages and Disadvantages of Using DBMS, Schemas, Instances, DBMS Architecture, Data Independence, Database Languages And Interfaces, DBA and its responsibilities.Conceptual database design: Conceptual database design, Entity Types, Entity Sets, Attributes, Keys, Relationships, Relationship Types, Constrains, Weak Entity Types, ER Diagrams, generalization, specialization and aggregation Logical database design: Relational Model Concepts, Relational Database Schema, Basic Relational Algebra Operations, Functional Dependencies and Normalization for Relational Databases, Transformation of entity relationship model into relational schema. SECTION BTransaction Processing Concepts: Introduction to Transaction Processing, Transaction and System Concepts, Desirable Properties of Transactions, Schedules and Recoverability, Serializability of Schedules.Concurrency Control Techniques: Locking Techniques for Concurrency Control, Concurrency Control Based on Timestamp OrderingDatabase Recovery Techniques: Recovery Concepts, Recovery Techniques Based on Deferred Update, Recovery Techniques Based on Immediate Update, Shadow Paging. Reference Books1. A Silberschatz, H Korth, and S. Sudarshan “Database System Concepts”, 5th Edition McGraw-Hill.2. R Elmasrhi and S Navathe, “Fundamentals of database Systems”, 5th Edition Pearson Education.3. C J Date, “An introduction to Database Systems”, Addison-WesleyCS-604(B): SOFTWARE LAB-VI (Oracle)LTP University Exam: 30004 Internal Assessment: 20 Instruction for the Paper Setter and the CandidatesThe setting and evaluation will be done by a board of examiners consisting of Head, External examiner and the teacher(s) involved with the teaching of this paper.Lab Course:The lab course will comprise of exercises based on Oracle..MC-605: Tensor AnalysisLTP University Exam: 70410 Internal Assessment: 30 Time Allowed: 3hrs. Total: 100INSTRUCTION FOR THE PAPER SETTERThe question paper will consist of three sections A, B and C. Sections A and B will have four questions each from the respective sections of the syllabus and Section C will consist of one compulsory question having ten short answer type questions covering the entire syllabus uniformly. Each question in Sections A and B will be of 10 marks and Section C will be of 30 marks.INSTRUCTIONS FOR THE CANDIDATESCandidates are required to attempt five questions in all selecting two questions from each of the Section A and B and compulsory question of Section C.Section-ATensors: Space of N-dimensions , Dummy and free index, Summation convention, Kronecker deltaManifolds and tensors. Transformation of coordinates, e- systems, Tensor notation on matrices, Contravariant vector and Tensor, Co-variant vector and tensor, mixed tensor, invariants,operations on tensors, Quotient law of tensors, Symmetric, skew symmetric and Pseudo tensors,reciprocal tensor, relative and Cartesian tensor, The metric tensor, Associated tensors, Affinecoordinates.Section-BCurvilinear Coordinates: Co-ordinate Surfaces and curves , line element, length of a vector, Angle between two vectors, reciprocal base system, partial derivative.Christoffel symbols: Properties and transformations. Co-variant differentiation, Gradient ,Divergence and Curl, Laplacian Operator, Intrinsic derivative.Books RecommendedPrasun Kumar Nayak: Text Book of Tensor Calcul and Differential Geometry, PHI-2012.Zafar Ahsan: Tensors, PHI-2015.SC 606- ANALYSIS AND DESIGN OF EXPERIMENTSLTP University Exam: 70410 Internal Assessment: 30 Time Allowed: 3hrs. Total: 100INSTRUCTION FOR THE PAPER SETTERThe question paper will consist of three sections A, B and C. Sections A and B will have four questions each from the respective sections of the syllabus and Section C will consist of one compulsory question having ten short answer type questions covering the entire syllabus uniformly. Each question in Sections A and B will be of 10 marks and Section C will be of 30 marks.INSTRUCTIONS FOR THE CANDIDATESCandidates are required to attempt five questions in all selecting two questions from each of the Section A and B and compulsory question of Section C.Section AAnalysis of variance for one way and two-way classifications. Need for design of experiments, fundamental principles of design.Section BBasic designs CRD, RBD, LSD and their analysis. Factorial designs - 2 n designs, illustrations, main effects and interaction effects and confounding in 23 design. REFERENCES Cochran W.G and Cox G.M (1957): Experimental Designs, John Wiley and Sons.Das M.N and Giri (1986): Design and Analysis of Experiments, Springer Verlag Murthy M.N( 1967): Sampling Theory and Methods, Statistical Publishing Society, Calcutta.Sampath S. (2000): Sampling Theory and Methods, Narosa Publishing House.Sukhatme B.V(1984) : Sample Survey methods and Its Applications, Indian Society of Agricultural Statistics. Des Raj (2000) : Sample Survey Theory, Narosa Publishing House. CS-607: PERVASIVE AND MOBILE COMPUTINGLTP University Exam: 70410 Internal Assessment: 30 Time Allowed: 3hrs. Total: 100INSTRUCTION FOR THE PAPER SETTERThe question paper will consist of three sections A, B and C. Sections A and B will have four questions each from the respective sections of the syllabus and Section C will consist of one compulsory question having ten short answer type questions covering the entire syllabus uniformly. Each question in Sections A and B will be of 10 marks and Section C will be of 30 marks.INSTRUCTIONS FOR THE CANDIDATESCandidates are required to attempt five questions in all selecting two questions from each of the Section A and B and compulsory question of Section C.SECTION -AIntroduction: Challenges in mobile and pervasive computing, coping with uncertainties, resource poorness, bandwidth, etc. Cellular architecture, Relationship of wireless, internet and ubiquitous computing , Ambient computing ,Requirements of computational infrastructure , User interface design issues, Pervasive Web application architecture.Mobility Management: Cellular architecture, Co-channel interference, Mobility: handoff, types of handoffs; location management, HLR-VLR scheme, hierarchical scheme, predictive location management schemes. Mobile IP, cellular IP, Wireless Networks: Cellular Wireless Networks, Security, Power management, Data aggregation, Clustering, Congestion, GPRS, Evolution of mobile system: CDMA, FDMA, TDMA, GSM. Wireless LANs and PANs: IEEE 802.11 Standard, Architecture, Services, HiperLAN, BlueTooth, Wi-Fi, WiMAX.SECTION -BRouting Protocols: Mobile IP, DHCP, Ad-hoc, Proactive and Reactive Routing Protocols, Multicast Routing, Ad hoc Network Routing Protocols: Ad hoc network routing protocols, destination sequenced distance vector algorithm, cluster based gateway switch routing, global state routing, fish-eye state routing, dynamic source routing, ad hoc on-demand routing, location aided routing, zonal routing algorithm, Routing protocols for sensor networks. Sensor Networks and RFID’s: Introduction to sensor networks , Sensor node architecture, Sensor network architecture ,Types of sensor networks ,Platforms for wireless sensor networks , Applications of wireless sensor networks , Introduction to RFID , Transponder and reader architecture, Application of RFID technologies.Applications of mobile and pervasive computing : Home Networking, vehicle networks, Retail , healthcare , sales force automation , smart tokens, on board computing systems, entertainment systems, tracking applications: precision agriculture, environmental monitoring, pollution monitoring, traffic monitoring etc.? Reference BooksJ.Schiller, Mobile Communication, Addison Wesley, 2000.Ivan Stojmenovic , Handbook of Wireless Networks and Mobile Computing, JohnWiley & sons Inc, Canada, 2002.Asoke K Taukder,Roopa R Yavagal, Mobile Computing, Tata McGraw Hill PubCo. , New Delhi, 2005.William Stallings, “Wireless Communication and Networks”, Pearson Education,2003Uwe Hansmann et. al , Pervasive Computing, Springer, New York,2001. Jochen Burkhardt, , Stefan Hepper, Klaus Rindtorff, Thomas Schaeck ”PervasiveComputing-Technology and Architecture of Mobile Internet Application”,PearsonEducation,sixth Edition 2009.CS-608: CLOUD COMPUTINGL T P University Exam: 704 1 0 Internal Assessment: 30Time Allowed: 3 hours Total: 100INSTRUCTIONS FOR THE PAPER-SETTERThe question paper will consist of three sections A, B and C. Sections A and B will have four questions each from the respective sections of the syllabus and Section C will consist of one compulsory question having ten short answer type questions covering the entire syllabus uniformly. Each question in Sections A and B will be of 10 marks and Section C will be of 30 marks.INSTRUCTIONS FOR THE CANDIDATESCandidates are required to attempt five questions in all selecting two questions from each of the Section A and B and compulsory question of Section C.Section-ACloud Introduction: Cloud Computing Fundamentals: Cloud Computing definition, Types of cloud, Cloud services: Benefits and challenges of cloud computing, Evolution of Cloud Computing , usage scenarios and Applications , Business models around Cloud, Major Players in Cloud Computing, Issues in Cloud, Eucalyptus, Nimbus, Open Nebula, CloudSim. Cloud Services: Types of Cloud services: Software as a Service, Platform as a Service, Infrastructure as a Service, Database as a Service, Monitoring as a Service, and Communication as services. Service providers: - Google App Engine, Amazon EC2, Microsoft Azure.Section-BCollaborating With Cloud: Collaborating on Calendars, Schedules and Task Management, Collaborating on Event Management, Contact Management, Project Management, Collaborating on Word Processing, Databases: Storing and Sharing Files, Collaborating via Web-Based Communication Tools Virtualization For Cloud: Need for Virtualization, Pros and cons of Virtualization, Types of Virtualization, System Vm, Process VM, Virtual Machine monitor, Virtual machine properties. Books Recommended:Bloor R., Kanfman M., Halper F. Judith Hurwitz “Cloud Computing ” Wiley India Edition ,2010 John Rittinghouse & James Ransome, “Cloud Computing mplementation Management and Strategy”, CRC Press, 2010 Antohy T Velte ,Cloud Computing : “A Practical Approach”, McGraw Hill,2009 Michael Miller, Cloud Computing: “Web-Based Applications That Change the Way You Work and Collaborate Online”, Que Publishing, August 2008.James E Smith, Ravi Nair, “Virtual Machines”, Morgan Kaufmann Publishers, 2006. ................
................

In order to avoid copyright disputes, this page is only a partial summary.

Google Online Preview   Download