PANJAB UNIVERSITY CHANDIGARH- 160 014 (INDIA) (Estted.

under the Panjab Univerasity Act VII of 1947-enacted by the Govt. of India)

FACULTY OF SCIENCE

SYLLABI FOR M.Sc. INFORMATION TECHNOLOGY (SEMESTER SYSTEM) SESSION 2011- 2012 --:O:--

0

Outlines of Tests, Syllabi and Courses of Reading for M. Sc. (Information Technology) (Two Year Degree Programme) 2011- 2012.

OUTLINES OF TESTS Paper Code Paper Name Theory Lectures Univ. Exam Marks Int. Ass. Marks.

FIRST YEAR (SEMESTER –1)
MS-01 MS-02 MS-22 MS-04 MS-05 MS-06 Advance JAVA Programming Language Interactive Computer Graphics Software Engineering & Management Algorithm Design and Analysis Minor Project Based on MS 01 Minor Project Based on MS – 02 & MS – 04 6 6 6 6 6 6 80 80 80 80 80 80 20 20 20 20 20 20

FIRST YEAR (SEMESTER –2)
MS-23 MS-08 MS-09 MS-28 MS-27 MS-24 MS-25 Operating System Electronic Commerce and Tools Artificial Intelligence and LISP Trends in Computing Seminar Minor Project Based on MS – 08 Minor Project Based on MS – 09 6 6 6 6 2 6 6 80 80 80 80 80 80 20 20 20 20 50 20 20

1

The project will involve development of application/system software in industrial/ commercial/ scientific environment. 400 2 .SECOND YEAR (Semester –3) MS-26 MS-12 MS-13 MS-14 Software Testing and Quality Assurance Visual C++ Programming Linux Administration Systems Approach to Management and Optimization Techniques Seminar Minor Project Based on MS – 12 Minor Project Based on MS – 13 SECOND YEAR (Semester -4) 6 6 6 6 80 80 80 80 20 20 20 20 MS-18 MS-19 MS-20 2 6 6 80 80 50 20 20 MS-21 Major Project The project period will be of 6 months duration.

carrying figure or table. The student must prepare 5 copies of the report including one copy for self. The student must present his/ her work in 15 minutes mainly focusing on his/her contribution with the help of slides followed by demonstration of the practical work done. An external examiner. 4. Name of the Department and Names of the Project Guides (both External and Internal). Further scope of the project • Bibliography • Appendices (any other information related to project) Each student should observe the following norms while submitting the synopsis/thesis for the Project : (a) (b) (c) (d) Use both sides of the paper instead of only single side. internal examiner and the internal guide will conduct project viva. 2.Listing of well commented programs with result/output or detailed algorithms with input and output.Hardware and software used .GUIDELINES FOR SUBMISSION OF PROJECT REPORT (MS-21) The report should consist of the following : • • • • • • • Cover page including Project title. Name of the student. Certificates from company and department duly signed by external guide. The remaining four are to be submitted before 31st May every year as per the following : 1. Try to insert figure/table in the text page itself (instead of using a fresh page for it. • Implementation and Testing .) Students must consult/inform the internal guides regarding the progress of their work at least once in 20 days. Introduction (includes background and application or importance of the project) Objectives System Analysis System Feasibility study • Software requirement specifications • Design with system flowcharts and input/output design. It is the duty of the student to be in touch with his internal guide. Use one and half interline spacing in the text (instead of double space) Stop using a blank sheet before the page. each time. Principal and internal guide. Main Library Department Library Internal Guide Company One softcopy of the work is to be submitted to the concerned head of the department/institution along with the report. The project Viva will be completed before 15th June every year Exact dates will be informed before 31st May every year. 3. Contents with page numbers. 3 . Acknowledgements.

Java Database Connectivity : Connectivity model. Maximum Marks : 80 Number of Lectures : 90 (45 minutes duration) L P 6 8 Objectives : This course enables students to learn advanced features of JAVA such as JDBC and Swings. iv. of Lectures : 23) SECTION . Networking : Networking basics. TCP/IP server sockets. creating RMI applications. creating user interface using swing. Review of Java Basics : Features.FIRST -SEMESTER Objectives: After completing this course. interface. Servlet lifecycle. Examiner will set total of NINE questions comprising TWO questions from each Section and ONE compulsory question of short answer type covering whole syllabi. sliders. of Lectures : 22) 4 2. exception handling. they 1) Can become entrepreneurs 2) Can go for higher studies 3) Can be employed in middle level industry sector both of IT and general Paper Code : MS – 01 Paper Title : Advanced JAVA Programming Language. (No. SECTION . Data manipulation and navigation. applets. Note : i. swing containers. creating and running servlets. class. (No. All questions carry equal marks unless specified. iii. swing vs AWT. The students are required to attempt ONE question from each Section and the Compulsory question. using Dialogs. progress bars. . SQL package. 6. Java RMI : Distributed object technologies. files. inheritance. environment. TCP/IP client sockets. JDBC Exception classes.B 3. URL. Database connectivity. 4. components. The Question Paper will consist of Four Sections. (No. of Lectures : 22) SECTION . Java. controls.A 1. multithreading. Inet Address. Java Servlets : Servelets vs CGI. Java and the Net. AWT. Datrgrams. creating networking applications.C 5. ii. package. Swing : Features. RMI architecture. tables.

of Lectures : 22) SECTION . Bayross. iii. Continual refresh and storage displays. track balls). (No. : INSTANT ENTERPRISE JAVABEANS. 2. Raster. user co-ordinates. BPB. The view algorithm. developing Beans. 3. color look-up tables. introspection. : The complete Reference Java 2. Digital frame buffer. the mouse.D 7. Color . iv. digitizing tablet. use of homogeneous coordinates). 5 . Screen coordinates. The Java Beans API. analog false colors. 2003 Schildt. Interactive Graphics : Pointing and positioning devices (cursor.B 2.speed drawing. 3. 2001 : Web Enabled commercial Application Development using Java 2. of Lectures : 23) REFERENCES : 1.SECTION . hard-copy color printers). JAR files.display techniques (shadow mask and penetration CRT. SECTION . Note : i. Interactive graphical techniques. pixel and point plotters. Ivan. High . Plasma panel displays.dimensional transformation. Display Devices : Line and point plotting systems. what are Beans. TMH : J2EE: The complete Reference. James. ii. Display processors.02 Paper Title : Interactive Computer Graphics Maximum Marks : 80 Number of Lectures : 90 (45 minutes duration) L P 6 4 Objectives : This course enables students to understand graphics hardware and various 2D and 3D algorithms. Paper Code : MS . 1998 Keogh. Display code generation. Display Discription. The students are required to attempt ONE question from each Section and the Compulsory question. 4.0. Line-drawing. 2002 Tata McGraw-Hill. Using Bound properties. Herbert. Very high resolution devices. Character generators. (No. vector. Graphical functions. Graphical data structures (compressed incremental list. All questions carry equal marks unless specified.A 1. lightpen. The Question Paper will consist of Four Sections. Two . vector list. Advantages of Beans. Java Beans : Component architecture. Bean Developer kit (BDK). Examiner will set total of NINE questions comprising TWO questions from each Section and ONE compulsory question of short answer type covering whole syllabi. Circle drawing algorithms.

actions. 1982 : Fundamentals of Interactive Computer Graphics. Harrington. J. Inking. 1989 Roy. S.. (No. 3-dimensional ransformations. REFERENCES : 1.D. Loading and Printing graphics images from/to disk. 1983 Kelley Bootle.D 5. zooming. Foley. Concept of Animation. of Lectures : 23) SECTION . R. Turbo C/C++ (Graphics Routines) is to be used as the standard teaching tool. : Interactive Computer Graphics.. W. Van Dam A.C 4. Schaum Series 6 . 1978 Tosijasu. Mouse Programming. (Elastic or Rubber Band lines.. Prentice-Hall.K. windowing.Hill.. Baker P. : Mastering Turbo C. scissoring). Addison-Wesley. Shading. 1986 : Computer Graphics. Towers of Hanoi etc. McGraw.K. 3-D Graphics: Wire-frame. PrenticeHall Newman. Graphic Languages : Primitives (Constants. plotting and geometric transformations.M.. GUI.. operators. L.F. (No. perspective display. display subroutines. Plastock. Projective transformations. panning.. 1986 : Computer Graphics. 8. Programming Projects: Two dimensional Transformations. Perspective depth. Animated algorithms for Sorting. 4. 2. Tata McGraw-Hill.. Springer-Velag. Hidden line and surface elimination. of Lectures : 23) 6. D. of Lectures : 22) SECTION . 1985 : Procedural Elements for Computer Graphics. variables). 6. 7. Rogers. 5. W.Positioning. 3. clipping. 1983 : Computer Graphics : A Programming Approach.. Interactive Graphical Techniques. Hearn. Theory & Problems of Computer Graphics. Transparent solids. Sproul. D. McGraw-Hill.F.. Turbo-C. Giloi. 9. (No. : Principles of Interactive Computer 1980 Graphics. Saving.

Operation plan and Maintenance. 6. Design Process. Cost estimation models. Software process Models: Waterfall. Data Dictionary (No. Prerequisite: Computer Organisation Solving and C-Programming. Prototyping. S/w Inspection. Risk in estimation. 2. Software Project Planning & Scheduling : Objectives. icons. E-R-diagram. Fourth Generation Techniques. Problem based estimation. of Lectures : 22) SECTION – B 3. Design Methodologies. System Administration and Training : User manual. Checklist. Object oriented design. The students are required to attempt ONE question from each Section and the Compulsory question. of Lectures : 22) SECTION – D 7. Implementation. Human factors in Software Engineering. 7 . Features of a Modern GUI. Structured design.Paper Code : MS . Examiner will set total of NINE questions comprising TWO questions from each Section and ONE compulsory question of short answer type covering whole syllabi. ii.22 Paper Title : Software Engineering & Management Maximum Marks : 80 Number of Lectures : 90 (45 minutes duration) L P 6 -Objectives : This course enables students to understand Software Configuration Managements Tools and Techniques. Types of Software Metrices. problem SECTION – A 1. Characteristics of well-engineered software. Components of SRS. Composition of inspection team. Concepts. All questions carry equal marks unless specified. Definition. Decomposition techniques. Windows. Communication skills for Software Engineer. Spiral. Software requirements specifications (SRS). iv. COCOMO model. Introduction: Software Engineering goals. (No. (No. Note : i. System Analysis : Principles of structures Analysis. Principles. The Question Paper will consist of Four Sections. Userinterface design. Software Metrics: Role of Metrices and Measurements. 4. error messages etc. of Lectures : 23) SECTION – C 5. & Assembly Language Programming. Documentation. Software Specifications: Software requirements. iii. Modular design. Preview and Inspection Procedures. Software design: Objectives. DFD.

Pankaj. 1989 : Software Quality Engineering. : Software Engineering concepts. 1985 Lewis. iv. Hardware and Software Selection : Hardware acquisition. A Total Technical and Management Approach. 1978 : Constructing Quality Software 5. Ian Murrey.Narosa Publ. Sommerville. SECTION . Doug Bell. Heaps and Heap sort. G. The students are required to attempt ONE question from each Section and the Compulsory question. : Software Engineering . Graphs. 10. Hibbard. 1988 : Software Engineering & Management. John : Software Engineering A Programming Pugh. All questions carry equal marks unless specified.E.Carlo. 1992 Approach Prentice Hall. iii.McCraw-Will. The Question Paper will consist of Four Sections. 1982 Meyers.. Fairley. Prentice_Hall. 4. Narosa Publ. Wiley-InterScience. ii. 7. 1995 : Fundaments of Software Engginering. House 8. 8 . Software selection. 9. Prentice.04 Paper Title : Algorithm Design and Analysis Maximum Marks : 80 Number of Lectures : 90 (45 minutes duration) L P 6 4 Objectives : The course enables students to understand different algorithmic techniques and their analysis. 1995 : An integrated approach to Software Enggineering. 2010 : Software Engineering. Jalota. 6.Hall.T. Trees. Examiner will set total of NINE questions comprising TWO questions from each Section and ONE compulsory question of short answer type covering whole syllabi. 2. Review of Algorithms and Data Structures : Analysing algorithms. PHI.McCraw-Hill. 1986 : Software Engineering. Ghazzi. 1979 Paper Code : MS . Performance and acceptance criteria. Pressman.. I. Stacks and Queues.R. Shere.A 1. Benchmarking.8. of Lectures : 23) SUGGESTED READINGS 1. (No. Willis. Site preparation. 3.G. Find and Disjoint set union. : The art of Software Testing. Sets.. 11. Vendor selection.. Deutsch. Note : i.

analysis of these problems. Example of recursive programs. Algorithms.C 5. o/1 Knapsack and Travelling Salesperson problems. John Wiley & Sons. Knapsack. P. Divide and Conquer : General method. Knapsack problem.The Construction.. Naresh Publ. : The Design and Analysis of Computer Ullman J. of Lectures – 22) SECTION . 0/1 (No. Sartaj. 3. 6. the travelling Salesperson problem. 2. Hopcroft J.-1. Quick sort. Eastern Economy Edition. : Fundamental of Algorithms . 1974 Algorithms. Addison-Wesley. Statement of Cook's Theorem. Bentley..D. D. 1985.L. method. E. Proof and Analysis of Programs. Converting recursive algorithms into iterative ones. Graph colouring. NP-hard and NP-complete problems : Basic concepts.Hashing.E. Dynamic Programming : General method.. Branch-And-Bound : Method. (No. House 9 . S. Berlionx. Goodman. P. J. Job sequencing with dead lines. 8. Horowitz.B 3. Aho A. : Introduction to the Design and Analysis of 1977. Minimum spanning Trees. Optimal Binary Search Trees. Examples of NP-hard graph and NP-scheduling problems.E. of Lectures – 23) SECTION . Ellis and Sahni : Fundamentals of Computer Algorithms. (No.V. Prentice-Hall India. some simplified NP-hard problems. of Lectures – 23) 7.. 4. Merge sort. Binary Search. 4. (No. Selection sort. Bizard. 6. McGraw-Hill Book Comp. Single source Shortest path. Some Lower Bounds on parallel Computation.D Lower-Bound Theory : Techniques for Algebraic problems. The Art of Computer Programming Vol. 2. Efficiency considerations. Analysing algorithms. 8 queen's problem. Greedy Method : General Method. 1986 : Algorithms . & Hedetnieni. 1978 Galgotia Publications. 5.. of Lectures – 22) SECTION . Big Oh and Asymptotic notations. Knuth. 1982 : Writing efficient programs. REFERENCES : 1. Backtracking : General Hamiltonian cycles.. Strassen's matrix multiplication and analysis of these problems.

system : Queue management. 2. The Question Paper will consist of Four Sections. of Lectures : 23) 10 . Memory memory. Multiprogramming scheduling. SECTION – D System deadlock : Prevention. interrupt mechanism. of Lectures : 23) SECTION – C Scheduling : Process states. Support for concurrent process : Mutual exclusion. 6. SECTION – A Introduction to Operating System : OS.23 Paper Title : Operating System Maximum Marks : 80 Number of Lectures : 90 (45 minutes duration) L P 6 8 Objectives : To understand the concepts of Operating System including dealing with deadlocks & file management. (No. of Lectures : 22) SECTION – B Management (II) : cache memory. ii. page replacement algorithms. 3. detection and avoidance. Memory Management (I) : Address protection. busy form of waiting. synchronization. disk (No. segmentation. (No. associative 1. The students are required to attempt ONE question from each Section and the Compulsory question. 4. iv. types of OS. hierarchy of memory types. paging.SECOND SEMESTER Paper Code : MS . scheduling algorithms. History of OS. of Lectures : 22) 5.preemptive and non. virtual memory. lock and unlock primitives. virtual processors. shared data. (No. 7. iii. All questions carry equal marks unless specified. Users services/jobs.preemptive scheduling. Note : i. Examiner will set total of NINE questions comprising TWO questions from each Section and ONE compulsory question of short answer type covering whole syllabi. File and directory systems. critical sections. Functions/Operations of OS.

2. : Operating System . Comp.A Electronic Commerce Fundamentals: Introduction to E-commerce and its advantages & disadvantages. 1984 Milenkovic. E-commerce consumer & organization applications. 1978 : Design of the UNIX operating systems. McGraw-Hill International Editions. Prentice-Hall India. 4. All questions carry equal marks unless specified. (No. Technology behind the web. Domain Name Registration. 3. : An Introduction to Operating System. Architecture and components of Internet. 2. Traditional vs E-Commerce. 2001 Hansen Per Brineh. 7. E-Commerce Framework. Growth of E-Commerce in India vis-à-vis Other Nations. Addision-Wesley Publ. 11 .Concepts and Design. of Lectures : 22) SECTION . 5. AddisionWesley. of Lectures : 23) 1. The anatomy of E-commerce Applications. Internet Administration. Publ.. 1986 Peterson. The Question Paper will consist of Four Sections. 1978 Madnick and Donovan. 1985 Deitel. C. : Operating System. McGraw-Hill Book Comparation. Hypertext Publishing.. Note : i. The students are required to attempt ONE question from each Section and the Compulsory question. Internet Protocol Suite. Paper Code : MS . ISPs at Local/National/Global Level. Architectural Framework for E-Commerce. iv. iii.08 Paper Title : Electronic Commerce and Tools Maximum Marks : 80 Number of Lectures : 90 (45 minutes duration) L P 6 4 Objectives : This course enables students to know fundamentals of Electronic Commerce applications and issues.SUGGESTED READINGS 1. and : Operating System Concepts. 6. M. Comp. Examiner will set total of NINE questions comprising TWO questions from each Section and ONE compulsory question of short answer type covering whole syllabi. Bach. (No. Silberschatz. Internet Services. SECTION . James. L. : Operating System : Operating System Principles. Security behind the web. 1987 Richie. A. M. Prospects and limitations in the growth of E-commerce in Indian context.M. ii. H.B Internet as a Network infrastructure for E-commerce. WWW as the architecture..

Public Key Certificates. Maximum Marks : 80 Number of Lectures : 90 (45 minutes duration) L P 6 4 Objectives : The course enables students to understand Artificial Intelligence techniques and also enables to learn the Artificial Intelligence Language LISP. Note : i. Patent Law. iii. Addison Wesley.g. Symmetric and Asymmetric Cryptosystems. The Question Paper will consist of Four Sections. Cryptographic standards e. REFERENCES 1. : E-Commerce-The Cutting Edge of Business. Advertising and marketing on the internet. of Lectures : 22) SECTION . Examiner will set total of NINE questions comprising TWO questions from each Section and ONE compulsory question of short answer type covering whole syllabi. iv. Daniel & Minoli. of Lectures : 23) 4. 3. Mercantile Process Model. SECTION . ii. Data Encryption Standard(DES). David. Microsoft Press. 2000 Minoli. Paper Code : MS . Network Security and Firewalls. Encrypted Documents and E-mail. Data and Message Security.3. The corporate digital library.Hill.C Consumer oriented applications. Mercantile Model from the Consumer’s perspective. Copyright Law. The students are required to attempt ONE question from each Section and the Compulsory question. EDI software implementation. Debjani.09 Paper Title : Artificial Intelligence and LISP. Digital Signatures. 1997 : Frontiers of Electronic Commerce. : Understanding E-Commerce. ERP and Supply-Chain Management. Ravi & Whinston. Electronic Data Interchange(EDI) and its applications in business. Emma. Kamlesh & Nag. : Web Commerce Technology Handbook. (No. Andrew B.D Issues in E-commerce: The legal and policy environment of E-Commerce. (No. Intellectual Property. Mercantile Model from the Merchant’s perspective. 4. Principles of digital cryptography. advertising and consumer protection. Client-Server Network Security Threats. Security and Privacy issues in EDI. All questions carry equal marks unless specified. 2. Tata McGraw.. KalaKota. On-demand education and Digital copyrights. Legal. 1999 Kosiur. Internal Information Systems. 12 . Tata McGraw Hill. 1986 Bajaj.

Horn's Clauses. of Lectures : 22) SECTION . Recursion. Conditionals. Iteration.Hill Climbing. State space representation.C 5. Natural Language understanding and Processing: Complexity of the problem. Gameplaying: Minimax Search Procedure. 6. Defining functions. COUNT-IF. (No. Adding Alpha-Beta Cutoffs (No. Case studies of Expert Systems like MYCIN. Characteristics of Expert Systems. Constraint satisfaction and means-ends analysis techniques. of Lectures : 23) 2. Partitioned Semantic Nets. AI techniques. of Lectures : 23) SECTION . of Lectures : 22) SECTION . Specific Application of AI. Use of Advanced functions like MAPCAR. Ao*. Knowledge Representation : Information and Knowledge.D 7. Introduction to Perception and Action. Semantic networks. A*.SECTION . Building an Expert System. Problem Solving Concepts and Methods . creating. 4. Knowledge Acquisition and Manipulation. Knowledge Representation Methods. Syntactic processing. Artificial Intelligence (AI) : Introduction and Applications : History of AI from Alan Turing and developments in AI. Lambda Expressions. Pragmatic processing. Propositional Logic and First Order Predicate Logic. Introduction to LISP : Symbolic expressions. Predicates. Issues in knowledge representation. Knowledge Acquisition. Problem Characteristics. Heuristic Search Techniques . 13 . Appending and modifying lists. Frames. Criteria for success. Problem reduction. (No. REMOVE-IF. Expert Systems : Definition and Applications. Architecture of a typical expert system. Semantic Analysis.A 1. Best first Search. Scripts and Conceptual Dependencies. Resolution Principle. (No. Breadth -first Search and Depth-First Search methods.B 3. Expert system Shells.

. Winston.. 8. Sangal. India. : Artificial Intelligence. George F Luger. Ivan : Introduction to Prolog. 7. : Artificial Intelligence. 1993.. & Norviig. Russel.. 5. 14 . Prentice-Hall of India Pvt. 2005 : Natural Language Processing. Patterson. Tata1991 McGraw Hill Company. 1995. New Delhi. : LISP 3rd Edition. Indian Branch.P. 3.B. Structures and Stubblefield. Addison-Wesley pub. Delhi . Co. : Introduction to Artificial Intelligence and Expert Systems. 6. Ltd. Rich Elaine and Knight Kevin.K. Ltd. 2. 2009 Strategies for Complex problem solving.I. a modern Approach 2007 published by Person Education (Singapore) Pvt. New York. William A.REFERENCES : 1. New Delhi.Rajeev.H.110092.. 482 F.P.and Horn. 1995 : LISP Programming. New Delhi. Ltd. Peter.. Patparganj. Sturat. : Artificial Intelligence. Bharti & Chaitany. Balaguruswami. 4. 1994 : Artifical Intelligence & Technology. Dan W. second edition. Co.E. Tata McGraw Hill pub. PHI. Second edition.

B 3. iv. classification. commercial data mining tools (No.28 Paper Title : Trends in Computing Maximum Marks : 80 Number of Lectures : 90 (45 minutes duration) L P 6 -- Objectives : This course enables students to be familiar with emerging technologies as Parallel Computing. Parallel Computing : Parallel virtual machine(PVM) and message passing interface (MPI) libraries and calls.Paper Code : MS . mobile information access devices. JPEG and MPEG compressions (No. of Lectures : 22) SECTION .introduction to knowledge query and manipulation language (KQML). Mobile databases-protocols. steps to build a data warehouse. Note : i. M-Business. scope. Intelligent Agent Technology : Introduction to agents. sequential patterns. applications. Examiner will set total of NINE questions comprising TWO questions from each Section and ONE compulsory question of short answer type covering whole syllabi. of Lectures : 23) SECTION – C 4. Classes of data encoding techniques. 2. 5. tools and technology. SECTION . PNG. cellular data communication protocols. (No. Association rules. mobile data internetworking standards. mobile computing applications. GIF. ii. Applications of data mining. iii. space/storage compression. All questions carry equal marks unless specified. Today’s fastest computers and Supercomputers. Intelligent software systems. agent communication protocols . wireless delivery technology and switching methods. Mobile Computing : Mobile connectivity-Cells. clustering etc.. Data compression technology: Introduction. The Question Paper will consist of Four Sections. Framework. Intelligent architectures. of Lectures : 22) 15 . The students are required to attempt ONE question from each Section and the Compulsory question. components of intelligent agent based distributed systems. Mobile Computing and intelligent Agent Technologies.A 1. Advanced architectures. Data Warehousing and data mining : characteristics of data warehousing. Lossy versus lossless data compression. Graphics Metafiles. data modeling for data warehousing. Case Study-Road Traffic Management System.

. use of XML. Michael Allen. 3. (for P. Addison Wesley Longaman (Singapore) Pvt. 2003 : Internetworking Technologies: An Engineering perspective. 2003. of Lectures : 23) REFERENCES : 1.9 & 10). Pearson Education Asia. XML : An overview of XML. Ltd.NET Meta language (No.Net. integrity of XML with databases. 3rd Edition by Platt.net framework over view structural diagram. 2008 : Fundamentals of database Systems By Introducing Microsoft .3 & 4) (for sections C & D) Gerhard Weiss. Ravi Prakash. (Section A) Elmasri & Navathe. (For Section D). (for section B) Rahul Bannerjee. PHI. Edited The MIT Press. 6. 2004 section A) Barry Wilkinson.. 2. PHI Andy Dorman. . : Introduction to Parallel Processing. LONDON.D 6. 4.NET – evolution : Need and perspective in current scenario.SECTION . (Chapter – 1.(Chapters. 5. Sasikumar. M. PHI. Dinesh Shikhare. 2006 Workstations and Parallel Computers. : Techniques and Applications Using Networked Parallel Programming. XML as the . 2001 : The Essential Guide to Wireless Applications. 16 .2. 1999 : Multiagent Systems : A Modern Approach to Distributed Artificial Intelligence.

Objectives of Software Testing. iv. 2. basics of concepts of Quality Assurance reliability & Conf. Object Oriented Testing. Static and Dynamic Analysis. Functional Testing. All questions carry equal marks unless specified. Examiner will set total of NINE questions comprising TWO questions from each Section and ONE compulsory question of short answer type covering whole syllabi. 4. 6. Software Testing Process. SECTION – A 1. of Lectures : 22) SECTION – B 3.THIRD SEMESTER Paper Code : MS . Quality Management & Quality Models: Software Quality System. of Lectures : 23) SECTION – C 5. Essence of International Standards.26 Paper Title : Software Testing and Quality Assurance Maximum Marks : 80 Number of Lectures : 90 (45 minutes duration) L P Objective: This course enable students to learn software testing process and tech. Object-Oriented Metrics. The Question Paper will consist of Four Sections. Software Quality Metrics. Software Testing Strategies: Characteristics. Building Software Quality Assurance Plan. Management. (No. Alpha and Beta Testing. (No. An overview of Testing Process: Software Testing. Software Testing Techniques: BBT & its Technique. SEI Capability Maturity Model. Components of SQAP. of Lectures : 22) 17 . CauseEffect Graph. white-Box Testing and its Techniques: Domain and Boundary Testing. Integration Testing. Elements of STEP and STEP Architecture. iii. Software Metrics: Product Metrics: Software Size Metrics. The students are required to attempt ONE question from each Section and the Compulsory question. Overview of Testing Tools (No. Software Quality Attributes. Control Complexity Metrics. Quality Assurance: Overview of Software Quality. Factors Affecting Software Quality. Logic Based Testing. Metrics for Software: Importance of Metrics to Software Project. Note : i. Boundary Value Analysis. Software Quality Metrics. STEP Methodology. Data Flow Testing. ii. ISO 9000 Quality Standard. Quality Management Principles.

: Systemetic Software Testing: Artech House Jaskiel. Note : i. Developer Studio wizards. William E. of Lectures : 23) Reference : 1. System Configuration Management (SCM): Basic requirements for SCM system. Planning and organiging for SCM. Using AppWizard. Rick D Craig and Stefan P. All questions carry equal marks unless specified. Linda I. Gill. arrays. 2002 Publishers. Robert T. SECTION – A 1. Software Reliability: Factors Affecting Software Reliability. The Gallery and the InfoViewer. iii. Version and release management. Futrell. 2. data-types. SCM principles. Hall. The debugging environment. pointers. Doutsch. 1988 : Software Quality Engineering: A total Technique and management Approach. Testing and Quality Assurance. functions. db creation & app. 5. 4. Software Reliability Metrics. 2006 : Effective methods for Software Testing: 1. Perry. Change management. Introduction to Developer Studio. : Quality Software Project ManagementPearson Snafer. The students are required to attempt ONE question from each Section and the Compulsory question. Examiner will set total of NINE questions comprising TWO questions from each Section and ONE compulsory question of short answer type covering whole syllabi. Nasib Singh : Software Engineering: Softwrae reliability. . WILEY. dynamic memory allocation. ii. basic I/O.Donald F. Paper Code : MS . Deployment. Wills. 18 2. 8. Visual C++ Programming Visual C++ ‘s Program Structure.12 Paper Title : Visual C++ Programming Maximum Marks : 80 Number of Lectures : 90 (45 minutes duration) L P Objective: This course enables students to learn various features of VC++ program. Software Reliability VS Hardware Reliability. selection statements. Creating a basic application.SECTION – D 7. iv. (No. 3. Variables. Shafter. Benefits of SCM. 2002 Education. The Question Paper will consist of Four Sections. recursion. Khanna book publishing. repetition statements. Resource editors.

Database Creation Programming in Windows Data access with MFC: Introduction to data access. Ivor. MFC and user interface programming: MFC classes and user interface elements. 1998 Kanetkar. Querydefs and parameterized. MFC support for Context-sensitive help. ( No. Creating a joined recordset. polymorphism. 1998. Linking. Creating dialog boxes. of Lectures : 22) SECTION . inheritance. BPB. Querying the database: Customizing a query. MFC and DLLs. Michael. Dialog Data Exchange (DDX) and Dialog Data Validation (DDV).Visual C++ library of functions. Structure of a database application.D 6. Developing database applications: Creating an ODBC application. MFC support for multithreading. MFC diagnostic functions and macros. Using list boxes. Handling multiple views. Managing handlers with ClassWizard. Exceptions and exception handling. Horton. Seek and Find functions. virtual functions. Standard windows controls and MFC classes. 1999 Holzner. Handling window messages. Toolbars. MFC class categories. Windows Programming with MFC MFC fundamentals: The structure and usage of the MFC. BPB. Connecting the recordset to controls. Dialog bars and status bars. The application framework. (No. Elements of Windows GUI. Splitter windows. Architecture of a Win32 program. Errors and error handling. BPB Mastering Visual C++. using disk files. 4. (No. of Periods : 22) SECTION . 1998 : : : : : Beginning Visual C++ 6. of Lectures : 23) REFERENCES 1. Visual C++ 5. Visual C++ Projects. 5. queries. MFC database classes. 1998 Kanetkar. Yashwant. ( No. 3. BPB. Wrox Press Ltd. Application Deployment The Registry and application setup. Recordsets and transactions. 7. storing data in disk files. The document/view architecture. Steven. 2.B 3. . Control views. Yashwant. Visual C++ Programming. Win32 architecture and the Windows GUI The Win32 API. Commands and menus. of Periods : 23) SECTION – C 5. Building an ActiveX control framework. 1997 Young. 19 4. Viewing and Storing Data: Form views.

filenames. Parent directories and sub-directories. file & dir. Changing directory permissions. Basic Linux Commands : How Linux Commands Work. Common types of files. /dev. Absolute and relative filenames. Fear of Compression: The Zipless file. ii. /usr/bin. 5. Navigating the Linux file System : pwd command. Commands and Programs. Process and How to Terminate them. /usr. The process termination command : kill. Partitioning the Hard Disk : Linux Swap Space Partitions. the su command. Other Parameters. Setting up your Hard Drive. Creating Directories. . Online help available in Linux. Using LILO. Environment Variables. Creating and Deleting files : Cat. Minimum System Requirements. Creating the Linux File-system partition. Boot and Root Disks. The students are required to attempt ONE question from each Section and the Compulsory question.13 Paper Title : Linux Administration Maximum Marks : 80 Number of Lectures : 90 (45 minutes duration) L P Objective: This course enables students to get familiar with Linux system. Finding keywords in Man pages. Creating a New Login. (No. Trying out your new Login : Linux Error Messages. The bash shell help facility. Examiner will set total of NINE questions comprising TWO questions from each Section and ONE compulsory question of short answer type covering whole syllabi. 20 2. Installing Linux : Working with Linux. /usr/bin. Setting up the Ethernet. User and ownership. Introduction to Linux : What is Linux. All questions carry equal marks unless specified. UMASK Setting. Removing files and directories. The home directory. Moving and Copying with Wildcards. National conventions used to Describe Linux commands. system. The root directory. The Question Paper will consist of Four Sections. Moving Directories. Changing group ownership. The process status Commands : ps. The who Command. Floppy-less Installation. /bin. cd command. /home. Linux's fdisk. Wildcards : * and ?. Important directories in the Linux file System : / . Selecting packages to Install. Configuration X. /usr/spool. of Periods : 22) SECTION . iii. File Permissions. 4. File and Directory Permissions : File and Directory ownership. 3. Choosing Text or Graphics Installation. SECTION – A 1. /sbin. Bash : What is Shell ? How the Shell gets Started. Command Options. The Bourne Shell: Command-line Completion. How directories are named. Login. Linux Shutdown Commands. Using LILO Using Linux : Starting and Stopping your Linux System. shell program PERL prog and system admn. Note : i. Formatting the Partitions. Search Paths. Directories an Overview.Paper Code : MS . iv. Moving and Copying files. its commands. Passwords. The Linux Man pages. /etc. Groups. The most common Shells. Enabling the Swap Space for Installation. Linux's History. the grep command.B Using the File System : Files Overview. Logging Out. Changing File Permission. Input and Output Redirection.

The root Account. Copying and Moving Text. Correcting Spelling Errors. 8. Tim Parker. PHI. Command completion. DNS. Networking & Network Services : What is TCP/IP ? Hardware Requirements. LINUX System Administration Handbook.. Iteration Statements : for Statement. Special Edition using LINUX. Shell Programming : Creating and Running Shell Programs. The netstat Command. Testing and Troubleshooting. 1999 Tackett. Using variables : Assigning a value to a variable. Conditional Statements : if Statement . Creating a New file System. Perl Operators. Setting up the Dummy Interface. Shutting Down Linux. of Periods : 22) SECTION . Command History. unless Statements. (No. shift Command. FTP. Techmedia. case Statement. of Periods : 23) SECTION . Setting up your System : Setting the System Name. Un-mounting file Systems. tcsh Command Summary. Numbers. tcsh variables.C 6. until Statements. Starting vi. 10. Aliases. Aliases. Pipelines.D PERL : Creating and Executing Perl Programs. Linux .Wildcards. ping. J.. Wildcards. Inserting Text. bash commands. Command History. bash variables. Change directory Commands. Setting Preferences. Using a file as Swap Space. Forgetting the root Password. Prompts. Configuration Files. Techmedia. repeat Statement. Strings. Quitting vi. 7. Job control. Backups. (No. Functions. Mounting File Systems : Mounting a Floppy. P. Pipelines Shell. 4. The tcsh Equivalent of the test command. Compressing files with gzip and compress : Using tar. NIS. Job Control. News. File Operators: Arrays. www. while Statement. The vi Editor. AW.tcsh : An Introduction to tcsh. Booting from a Floppy. Using LILO to Boot. 2. M. Deleting Text. The Importance of Quotation Marks : The test Command. Positional Parameters and other Built-In Shell Variables. vi modes. If Statements. Functions : Passing Arguments to Functions. 3. select Statement. Accessing the value of a variable. Configuring Linux Files. Input and Output Redirection. Editing and Typesetting : Text Editors vi. 1998 : : : : Linux Unleashed Third Edition. Setting the Login Message. Output Redirection. 2000 Komarinski. while Statements. Customizing bash. NFS.. Searching and Replacing Text. Using a Maintenance Disk. Moving the Cursor. for Statements. Linux for System Administrators : System Administration Basics. Key Bindings. Customizing tcsh. Pre-commands. Handling Data in Perl: Variables. (No. Starting and Stopping the System. Input Redirection. until Statement. Complete guide to LINUX. Mail. Perl Programming Constructs : Statement Blocks. Checking file Systems. Using Return Values. 11. 9. of Periods : 23) REFERENCES : 1. 21 . 2000 Norton. for each Statements. Monitoring Logins and Logouts. Prompts.

6. of periods: 23) 1. order replenishment stock. SECTION . iv. All questions carry equal marks unless specified. subsystems including Marketing Research. subsystems for filling customer order. Place.14 Paper Title : Systems Approach to Management and Optimization Techniques Maximum Marks : 80 Number of Lectures : 90 (45 minutes duration) L P Objective: This course enables students to be familiar with different types of Info systems. Promotion and Pricing subsystems (No. Examiner will set total of NINE questions comprising TWO questions from each Section and ONE compulsory question of short answer type covering whole syllabi. HRIS Database. Marketing Information System: Basic concepts. 5. 2. Marketing Intelligence.A Concepts of Computer Based Systems: Data. human resources intelligence. model. 3. Note : i. Manufacturing Information System: Model and subsystems including Accounting Information. The Question Paper will consist of Four Sections. Funds Management and Control Subsystems. Introduction to Management Information System. of Lectures : 22) SECTION . Information Systems. Decision Support System and Knowledge Based Systems Accounting Information System: Characteristics. sample system.B 4. Industrial Engineering. Product. The students are required to attempt ONE question from each Section and the Compulsory question. HRIS output (No. Quality and Cost Subsystems Financial Information System: Model and Subsystems including Forecasting.Paper Code : MS . Information. features and use of Accounting Information System Package-Tally. Model of computer based information system. performing general ledger processes. iii. Inventory. ii. 22 . basics of DR and its practical problems. Human Resources Information Systems: Model and Subsystems including human resources research.

Murdick. Binary Linear Programming. : Introduction to Optimization: Theory & Applications. P. of Lectures : 23) REFERENCES 1. Branch and Bound Techniques. Deterministic & Probabilistic Dynamic Programming (No. Prentice Hall : Operations Research.D 9 Special types of Linear Programming problems –Transportation and Assignment problems. of Lectures : 22) SECTION .. Gupta. Duality in Linear programming. Wheeler Publishing : Information Systems for Modern Management. Assignment & Traveling salesman problems. 2 3 4. S. D.E.K. Suresh K. & Claggtt J. Kanti. Limitations of OR Linear Programming: Mathematical Formulation. Gupta. : Operations Research. Sultan Chand & Sons 7th ed. Prem Kumar & Hira. The Revised Simplex Method. 1984 Swarup. Characteristics of OR..G. S. ******** 23 . 5. 1978 : Computer Systems Today. Dynamic Programming. 11. Dual Simplex Method. & Ross J. Integer Programming: Introduction. 1999 Rao. Sensitivity Analysis.R. R. . & Manmohan. Models in OR. (No. Basandra. Wiley Eastern 8 10.SECTION – C 7 Basics of Operations Research (OR): Origin and Development of OR. Role of Computers in OR. OR and Decision Making. 1994. Graphical and Simplex method.S.

24 .

Sign up to vote on this title
UsefulNot useful