COURSE STRUCTURE AND SYLLABUS

2012-13

Central University of Punjab

Bathinda-151001

Vice Chancellor’s Message

Central University of Punjab, Bathinda was established under the Central Universities Act No. 25 (2009)

in the educationally backward Malwa region of Punjab with the purpose of providing world-class

educational facilities of higher learning to the aspiring students unable to have access to such

institutions in metropolitan cities. After consideration of various locations for the establishment of the

university, an abandoned spinning mill was selected for conversion into the transit campus of Central

University of Punjab. The campus is an excellent example of transformation of a barren piece of land

into a humming university campus in record time with all the facilities of an ideal institution of higher

learning. In October 2009, the university started functioning from this 37 acre premises. Now, this

campus provides most suitable, pollution free and eco-friendly atmosphere.

Based on open public debate and advice of several experts from prestigious institutions across

the country, the university decided to establish 68 Centers of Studies under 12 Schools covering almost

all important disciplines of study in Basic and Applied Sciences, Environment, Health and Life sciences,

Engineering, Management, Legal Studies, Humanities, Social Sciences, Languages, Literature and

Culture. Beginning with only four courses in four Centres in 2009-10, the University plans to start

twenty-five courses under eight Schools in 2012-13 session. Different Schools have been conceptualized

and created in specialized broader areas of knowledge under which diverse but interrelated centers

have been formed. The aim is to reach all the potential scholars and researchers across the country with

our new course structures featuring several new areas at different levels. The details of course structure

and their respective syllabi have been compiled for the ready reference of the students.

I thank all the experts, educationists and intellectuals who have participated in the process of

development of courses and programmes that are currently being offered in the university. I also thank

faculty members for their dynamic and enthusiastic participation in this exercise.

I am confident that the university will soon carve out a niche among the finest academic bodies

of the world and maintain its national character and global outreach through its instructional and

research programmes. As multi-facility and multi-faculty university incorporating state-of-the-art

infrastructural support systems for teaching and research, it will bring into public domain the global

technological trends for the benefit of every strata of society.

Prof. Jai Rup Singh

Vice Chancellor

Centre for Computer Science & Technology

M.Tech. Programme in Computer Science & Technology

Semester-I Course Code

Course Title Credit Hours Total

Theory Practical Research

CST.501 Research Methodology 3 - - 3

CST.502 Data Structure & Algorithms 3 - - 3

CST.503 Network Design & Performance Analysis 3 - - 3

CST.504 Automata Theory & Formal Languages 3 - - 3

CST.505 Advanced Software Engineering 3 - - 3

CST.552 Software Lab-I (Data Structure & Algorithms)

- 1 - 1

Total 15 1 16

Semester-II CST.506 Advanced Database Management System 3 - - 3

CST.507 Wireless LAN's & Mobile Computing 3 - - 3

CST.508 Information & Network Security 3 - - 3

Option-I (Select one out of the three courses)

CST.521 Image Processing 3 - - 3

CST.522 Data Warehousing & Data Mining 3 - -

CST.523 Parallel Computing 3 - -

option-II (Select one out of the three courses)

CST.524 Bioinformatics 3 - - 3

CST.525 Advanced Web Technologies 3 - -

CST.526 Internet Technologies 3 - -

CST.556 Software Lab-II (Advanced Database Management System)

- 1 - 1

CST.599 Seminar in Computer Science & Technology

1 - - 1

Total 16 1 - 17

Semester-III CST.599 Seminar in Computer Science &

Technology 1 - - 1

CST.500 Dissertation Research - - 18 18

Total 1 - 18 19

Semester-IV

CST.500 Dissertation Research - - 12 12

Total - - 12 12

Grand Total 32 2 30 64

M.Tech. Programme – Four Semesters.

Semester: I

CST.501: Research Methodology. Credit Hours: 3.

Unit I

Introduction to research: Concept, Types, Objectives, Research Approaches, Significance of Research. Reviewing literature: Need, Sources-Primary and Secondary, Purposes of Review, Scope of Review, Steps in conducting review. Identifying and defining research problem: Locating, Analysing, Stating and Evaluating Problem, Generating different types of hypothesis and evaluating them.

Unit II Method of research: Descriptive research design-survey, case study, content analysis, Ex-post Facto Research, Co-relational and Experimental Research. Sampling techniques: Concept of Population and Sample, Sampling techniques-simple random sampling, stratified random sampling, systematic sampling, cluster sampling, area sampling, Multi-Stage Sampling, Sequential Sampling, determining size of sample. Design and development of measuring instruments: Tests, questionnaires, checklists, observation schedules, evaluating research instruments, selecting a standardized test.

Unit III Methods of data collection: Observation Methods, Interview Method, Collection of Data through Questionnaires & Schedules. Statistical methods of analysis: Descriptive statistics: Meaning, graphical representations, mean, range and standard deviation, characteristics and uses of normal curve, Inferential statistics: t-test, Chi-square tests, Co-relation (rank difference and product moment), ANOVA (one way, two-way).

Unit IV Procedure for writing a research proposal: Purpose, types and components of research proposal. Procedure for writing a research report: Audiences and types of research reports, Format of Research report and journal, Strategies for evaluating, research, disseminating and utilizing research- An Overview.

Text books:

1. Kothari, C.R. 2008. Research Methodology: Methods and Techniques. 2nded. New Age International.

2. Gall, J.P., Borg, W.R. and Gall, M.D. 2006. Educational Research: An Introduction. Prentice Hall.

Suggested readings:

1. William, W. 2009. Research Methods in Education. India: Pearson Education.

CST.502: Data Structures and Algorithms. Credit Hours: 3.

Unit I Introduction to algorithm concepts: Role of algorithms in computing, Algorithm analysis, Algorithms design, asymptotic notation, Complexity analysis.

Unit II Data structures: Link Lists, Queues, Hash tables, Binary search trees, Red-black tree,

heaps. Design strategies: Divide-and-conquer, Dynamic Programming, Greedy Method.

Unit III Sorting & searching algorithms: Sorting, Sorting algorithms: Radix sorting, heap sort, quick sort, Search algorithms: linear search and binary search algorithm. Advanced data structure: B trees, Fibonacci Heaps, Data structures for disjoint sets.

Unit IV Graph algorithms: Elementary graph algorithms, Minimum spanning trees, shortest path algorithms: single source and all pair, Max flow problem and its solutions.

Text books:

1. Cormen, T.H., Leiserson, C.E., Rivest, R.L. and Stein, C. 2009. Introduction to Algorithms. 3rded. Mit Press.

2. Lipschutz, S. 2009. Data Structures with C. Tata McGraw-Hill Education. Suggested readings:

1. Aho, A.V., Hopcroft, J.E. and Ullman, J. D. 2009. Data Structures and Algorithms. India: Pearson Education.

2. Horowitz, E., Sahni, S. and Rajasekaran, S. 2010. Fundamentals of Computer Algorithms. Galgotia Publications.

3. Weiss, M.A. 2009. Data Structures and Algorithm Analysis in C++. India: Pearson Education.

CST.503: Network Design & Performance Analysis. Credit Hours: 3.

Unit I Requirements, planning & choosing technology: System requirements, traffic sizing characteristics, time & delay consideration. Traffic engineering and capacity planning: Throughput calculation traffic characteristics & source models, traditional traffic engineering, queued data & packet switched traffic modeling, designing for peaks, delay or latency.

Unit II

Network performance modelling: Creating traffic matrix, design tools, components of design tools, types of design projects.

Technology Comparisons: Generic packet switching networks characteristics, private vs. public networking, Business aspects of packet, frame and cell switching services, High speed LAN protocols comparison, Application performance needs, Throughput, burstiness, response time and delay tolerance, selecting service provider, vendor, service levels etc.

Unit III Access Network Design: N/W design layers, Access N/W design, access n/w capacity, Backbone n/w design, Backbone segments, backbone capacity, topologies, Tuning the network, securing the network, Design for network security.

Unit IV Documentation and network management: Documentation, network management, SNMP, RMON. Network Optimization: Network optimization theory: Goals of network optimization, measurements for network optimization, optimization tools, optimization techniques.

Text books:

1. McCabe, J.D. 2007. Network Analysis, Architecture and Design. 2nd ed. Morgan Kaufman Series in Networking.

2. Zheng, Y. and Akhtar, S. 2007. Network for Computer Scientists and Engineers. Indian University, Oxford University Press.

3. Forouzan, B.A. 2009. Data Communications & Networking. 4th ed. Tata McGraw-Hill Education.

CST.504: Automata Theory & Formal Languages. Credit Hours: 3.

Unit I Introduction to finite automata: Description of Finite Automata, Concepts of Automata Theory, Deterministic Finite Automata, Non-deterministic Finite Automata, Equivalence of Deterministic and Non-Deterministic Finite Automata, Finite Automata and Regular Expressions, Properties of Regular Language.

Unit II Context free languages: Context Free Grammar, Simplification for context free Grammar, Normal forms for Context free Grammar, Properties of Context-Free Languages: Closure Properties, Periodicity Properties, Decision Properties, Pushdown Automata and Context free Languages, Parsing.

Unit III Turing machines: Definition of Turing Machine, Computing with Turing Machines, Extensions to Basic Turing Machine. Decidability: Decidable Languages, undecidable languages, Halting problem of Turing machine.

Unit IV Computational complexity: Computability, Turing Model for Computation, The Classes P and NP, NP-Completeness, Importance of NP-Completeness, other NP-Complete problems, uses of NP-Completeness.

Text books: 1. Mishra, K.L.P. and Chandrasekaran, N. 2008. Theory of Computer Science: Automata,

Languages and Computation. 3rd ed. PHI Learning Pvt. Ltd. 2. Hopcroft, J.E., Motwani, R. and Ullman, J.D. 2008. Introduction to Automata Theory,

Languages, and Computation. 3rded. Addison Wesley. Suggested readings:

1. Padma Reddy, A.M. 2001. Finite Automata and Formal Languages: A Simple Approach. India: Pearson Education.

2. Linz, P. 2011. An Introduction to Formal Languages and Automata. 5th ed. Jones & Bartlett Publishers.

CST.505: Advanced Software Engineering. Credit Hours: 3.

Unit I Introduction: Software Engineering, Software Process Models, Management Process, Scheduling, Estimation, Software Metrics. Software requirements analysis & specification: Requirements Engineering, Requirements Elicitation, Requirements Analysis, Requirements Documentation, Case Study of SRS.

Unit II Software quality: Quality Concepts, Quality Control, Quality Assurance, Cost of Quality, SQA Activities, Total Quality Management Principles, Software Reviews, Formal Technical Reviews, Software Reliability, Software Safety, ISO Approaches to Quality Assurance Systems. Software design: Design Concepts, Function-oriented design, Object-oriented design, Complexity metrics.

Unit III Risk and software configuration management: Software Risks, Risk Management, Software Configuration Management Process: Version Control, Change Control. Coding & software testing: Programming Principles, Incrementally Developing code, Managing Evolving code, Testing process, Software test case design techniques- Black box testing, white box testing, Unit testing, Integration Testing, Validation Testing, System Testing, Debugging, Case Study of Software Testing.

Unit IV Software maintenance & reuse: Characteristics of Software Maintenance, Software Reverse Engineering, Software Maintenance Process Models, Estimation of Maintenance Cost, Software reuse approach.

Text books: 1. Pressman, R.S. 2010. Software engineering: a practitioner's approach. 7th ed. McGraw-

Hill Higher Education. 2. Aggarwal, K.K. and Singh, Y. 2008. Software Engineering. 3rded. New Age International

(P) Ltd. Suggested readings:

3. Sommerville, I. 2008. Software Engineering. 8th ed. India: Pearson Education. 4. Jalote, P. 2010. An Integrated Approach to Software Engineering. 3rd ed. Springer. 5. Mall, R. 2009. Fundamentals of Software Engineering. 3rd ed. PHI Learning Pvt. Ltd.

CST.552: Software Lab-I (Data Structures and Algorithms). Credit Hour: 1.

Students should be asked to implement the algorithms/programs: search an element in a two dimensional array, Binary search, quick sort, operations on strings, linked list, double linked list, queue, Min/Max heaps, Binary search Trees, AVL trees, B-trees, graphs, depth-first & breadth-first search, minimal spanning tree in C++.

Semester: II

CST.506: Advanced Database Management System. Credit Hours: 3.

Unit I Introduction: Database System Concepts and Architecture, Data Independence, Database Integrity, Normalization: 1NF, 2NF, 3NF, BCNF, 4NF, 5NF. Advanced transaction processing and concurrency control: Transaction Concepts, Concurrency Control: Locking Methods, Time stamping Methods, Optimistic Methods for Concurrency Control and Concurrency Control in Distributed Systems.

Unit II Object oriented and object relational databases: Object Oriented Concepts with respect to Database Systems, Object Oriented Data Model, OODB, OODBMS, Object Query Language, ORDBMS, ORDBMS Design, and ORDBMS Query Language. Parallel and distributed databases: Parallel Databases, Distributed Databases, Differences between Parallel and Distributed Databases, Architecture of Distributed Databases, Architecture of Parallel Databases, Key elements of Parallel Database Processing, Fragmentation, Replication and Allocation for distributed databases, Intra-query parallelism, Inter-query parallelism, Intra-operation parallelism, Inter-operation parallelism.

Unit III

Backup and recovery techniques: Backup and Recovery Concepts, Types of Database Failures, Types of Database Recovery, Recovery Techniques: Deferred Update, Immediate Update, Shadow Paging, Checkpoints, Buffer Management and Recovery Control in Distributed Systems. XML and internet databases: Structured, Semi Structured, and Unstructured Data, XML Hierarchical Data Model, XML Documents, DTD, XML Schema, XML Querying: XPath, XQuery.

Unit IV Emerging database technologies: Introduction to Deductive Databases, Temporal Databases, Multimedia Databases, Mobile Databases, Main Memory Databases, Spatial and Multidimensional Databases. PL/SQL: Control Structures like If-else statements, loops like: For, Do-while, while, Cursors, Procedures, Packages and Triggers.

Text books:

1. Connolly, T. and Begg, C. 2009. Database Systems: A Practical Approach to Design, Implementation and Management. 4th ed. India: Pearson Education.

2. Elmasri, R. and Navathe, S.B. 2009. Fundamentals of Database Systems. 5th ed. India: Pearson Education.

Suggested readings: 1. Silberschatz, A., Korth, H.F. and Sudarshan, S. 2010. Database System Concepts. 6th ed.

McGraw-Hill. 2. Ramakrishnan, R. and Gehrke, J. 2003. Database Management Systems. 2nd ed. McGraw-

Hill. CST.507: Wireless LAN & Mobile Computing. Credit Hours: 3.

Unit I Introduction to wireless systems: History, Overview of Wireless Networks, Types & Range of Wireless Communication, Wireless Network Standards, Security Issues of Wireless Technology. Wireless communication technology: Introduction to wireless communication, Antennas & RF signal propagation, Signal Encoding Techniques, Spread Spectrum Coding and Error Control, Overview of modulation techniques, Multiple Access Techniques.

Unit II Wireless networking: Cellular Wireless Networks, Cordless Systems and Wireless Local Loop, Mobile Communications, Mobile IP and Wireless Access Protocol. Wireless LANs: Introduction, Characteristics, Benefits, WLANs Configurations and Standards, Security, IEEE 802.11 standards specification, 802.11 MAC Management, IEEE 802.16/.20/.21/.22 comparison, Bluetooth standards specification, Wi-Fi Security.

Unit III Wireless mesh networks: Introduction, Characteristics, Benefits, Challenges and Opportunities. WAP: History of WAP, Architecture, and Components. Cellular technology: Design and Principles of Cellular Operation, Cellular Telephony Operations.

Unit IV Android: Introduction to Android, Android Architecture, Application structure, User Interface design, Emulator-Android virtual device, preferences, menu, Linkify, Notifications, custom components.

Case studies: IEEE 802.11 (Wi-Fi), IEEE 802.16 (Wi-Max), Bluetooth, GSM. Text books:

1. Schiller, J. 2008. Mobile Communications. 2nd ed. India: Pearson Education. 2. Rappaport, T.S. 2009. Wireless Communications. 2nded. India: Pearson Education.

Suggested readings:

1. Stalling, W. 2009. Wireless Communications & Networks. India: Pearson Education.

CST.508: Information& Network Security. Credit Hours: 3.

Unit I Encryption and decryption: Attackers and Types of Threats, challenges for information security, Encryption Techniques, Classical Cryptographic Algorithms: Monoalphabetic Substitutions such as the Caesar Cipher, Cryptanalysis of Monoalphabetic ciphers, Polyalphabetic Ciphers such as Vigenere, Vernam Cipher, Stream and Block Ciphers.

Unit II Symmetric key systems: Data encryption Standard (DES), DES Structure, DES Analysis, Multiple DES, Security of DES, Advance Encryption Standard (AES). Key management protocols: Solving Key Distribution Problem, Diffie-Hellman Key Exchange Algorithm.

Unit III Public key encryption systems: Concept and Characteristics of Public Key Encryption System, Rivest-Shamir-Adleman (RSA) Encryption, Introduction to Digital Signatures: digital Signature, authentication Protocols, The Digital Signature Standard (DSS). Hash algorithms: Hash concept, Description of Hash Algorithms: Message Digest Algorithms such as MD4 and MD5, Secure Hash Algorithms.

Unit IV Network security: Security vulnerabilities at different layers, Security Goals, Denial of Service Attacks, Intrusion Detection System, Firewalls, DMZs, Virtual Private Networks, IPSec Secure Communication Mechanism.

Text books:

1. Stallings, W. 2010. Cryptography and Network Security. 5th ed. Prentice Hall. 2. Kahate, A. 2009. Cryptography and Network Security. McGraw-Hill Higher Ed.

Suggested readings: 1. Forouzan, B.A. 2010. Cryptography & Network Security. Tata McGraw-Hill Education.

Option-I: - Select one out of the three courses

CST.521: Image Processing. Credit Hours: 3.

Unit I Introduction: Fundamental steps in Image Processing System, Components of Image Processing System, Elements of Visual Perception, Image Sensing and acquisition, Image sampling & Quantization, Basic Relationship between pixels, Colour Fundamentals & Models.

Unit II Image enhancement techniques: Spatial Domain Methods: Basic grey level transformation, Histogram equalization, Image subtraction, image averaging, Spatial filtering: Smoothing, sharpening filters, laplacian filters, frequency domain filters, Smoothing and sharpening filters, Homomorphism filtering.

Unit III Image restoration & reconstruction: Model of Image Degradation/restoration process, Noise models, Spatial filtering, Inverse filtering, Minimum mean square Error filtering, constrained least square filtering, Geometric mean filter, Image reconstruction from projections.

Unit IV Image compression: Image Compression Methods, Compression Standards, Basic compression methods, Digital Image water marking. Image segmentation & representation: Point, line & edge detection, thresholding, region based segmentation, chain codes, polygon approximations, boundary descriptors, regional descriptors.

Text books:

1. Gonzalez, R.C. and Woods, R.E. 2009. Digital Image Processing. 2nded. India: Person Education.

2. Pratt, W. K. 2001. Digital Image Processing. John Wiley.

CST.522: Data Warehousing & Data Mining. Credit Hours: 3. Unit I

Data warehouse: Basic Concepts, Multi-tier Architecture, Data Warehousing Modeling: Multidimensional Data Model, Schemas for multidimensional data models, OLAP, Data Warehouse Implementation.

Unit II Data mining: Basic concepts, Data Pre-processing: Data Cleaning, Data Integration and Reduction, Data Transformation, Data Discretization, Association rules mining, Correlational analysis, Constraint based association mining.

Unit III Classification: Basic Concepts, Decision tree Method, Bayes classification Method, Rule based Classification, Back propagation Classification, Associative Classification. Cluster analysis: Types of data in Cluster analysis, Major Clustering Methods Partitioning Methods, Hierarchical Methods, Density-based methods, Grid-based methods, Model-based clustering methods, clustering high dimensional data, clustering with constraints.

Unit IV Data mining trends: Mining Complex data types, Visual and Audio data mining, Data miming Applications.

Text book:

1. Han, J., Kamber, M. and Pei, J. 2011. Data Mining: Concepts and Techniques. Elsevier. Suggested readings:

1. Berson, A. and Smith S.J. 2008. Data Warehousing, Data Mining, & Olap. Tata McGraw-Hill Education.

2. Dunham, M.H. 2008. Data Mining: Introductory and Advanced Topics. India: Pearson Education.

CST.523: Parallel Computing. Credit Hours: 3.

Unit I Introduction: Paradigms of parallel computing: Synchronous- vector/array, SIMD, Systolic, Asynchronous-MIMD, Reduction paradigm. Hardware taxonomy: Flynn's classifications, Handler's classifications. Software taxonomy: Kung's taxonomy, SPMD.

Unit II Abstract parallel computational models: Combinational circuits, Sorting Network, PRAM models, Interconnection RAMs, Parallelism approaches- data parallelism, control parallelism. Performance metrics: Laws governing performance measurements, Metrics- speedups, efficiency, utilization, communication overheads, Single/multiple program performances, Bench marks.

Unit III Parallel processors: Taxonomy and topology- shared memory multiprocessors, distributed memory Networks, Processor organization- Static and dynamic interconnections, Embeddings and simulations.

Unit IV Scheduling and parallelization: Scheduling parallel programs, Loop scheduling, Parallelization of sequential Programs, Parallel programming support environments.

Text book:

1. Rajaraman, V. and Ram Murthy, C.S. 2004. Parallel Computers: Architecture and Programming. India: Prentice-Hall.

Suggested readings:

1. Fountain, T. J. 2006. Parallel Computing: Principles and Practice. Cambridge University Press.

2. Petersen, W.P. and Arbenz, P. 2004. Introduction to Parallel Computing. Oxford University Press.

Option-II: - Select one out of the three courses

CST.524: Bioinformatics. Credit Hours: 3.

Unit I Introductory concepts: The Central Dogma: The Killer Application, Parallel Universes, Watson’s Definition, Top Down Versus Bottom up, Information Flow, Convergence. Databases: Data Management, Data Life Cycle, Database Technology, Networks: Geographical Scope, Communication Models, Transmissions Technology, Protocols, Bandwidth, Topology, Hardware, Contents, Security, Ownership and Management.

Unit II Search engines and data visualization: Search Engines: The search process, Search Engine Technology, Searching and Information Theory, Computational methods, Search Engines and Knowledge Management. Data Visualization: sequence visualization, structure visualization, user Interface, Animation Versus simulation.

Unit III Statistics and data mining: Statistics: Statistical concepts, Microarrays, Imperfect Data, Randomness, Variability, Approximation, Interface Noise, Assumptions, Sampling and Distributions, Hypothesis Testing, Quantifying Randomness, Data Analysis, Tool selection statistics of Alignment, Clustering and Classification. Data Mining: Methods, Pattern Recognition and Discovery, Machine Learning, Text Mining, Tools.

Unit IV Pattern matching: Pairwise sequence alignment, Local versus global alignment, Multiple sequence Alignment, Computational methods, Dot Matrix analysis, Substitution matrices, Dynamic Programming, Word methods, Bayesian methods, Multiple sequence alignment, Tools, Nucleotide Pattern Matching, Polypeptide pattern matching, Utilities, Sequence Databases. Bioperl: Introduction, Installation Procedure, uses of Bioperl.

Text books: 1. Bergeron, B. P. 2003. Bioinformatics Computing. Prentice Hall Professional. 2. Mount, D.W. 2006. Bioinformatics: Sequence & Genome Analysis. CSHL Press.

CST.525: Advanced Web Technologies. Credit Hours: 3

Unit I Introduction: Introduction to Java, Difference between C/C++ and Java, Applets and Applications, Java Development Kit, Advantages of Java, Data types, modifiers, expressions, operators in Java, Control Statements in Java, Classes statements in Java, Classes, Inheritance (single, multilevel, hierarchical), Multiple Inheritance using Interfaces, Arrays, Strings and Vectors, Java packages, Exception handling, Multithreading, Applets, Graphics and AWT.

Unit II Name services and configuration: DNS, DHCP, X500 Directory Services, LDAP, Internet Security, Authentication and Encryption, Watermarks, Firewall, SSL, Digital Signatures. Web Services: Web services, Evolution and differences with Distributed computing, XML, WSDL, SOAP, UDDI, Transactions, Business Process Execution Language for Web Services, WS-Security and the Web services security specifications, WS-Reliable Messaging, WS-Policy, WS-Attachments. Web 2.0 technologies: Introduction to Ajax, Ajax Design Basics, JavaScript, Blogs, Wikis, RSS feeds.

Unit III Content delivery and preparation: Introduction to WWW, TCP/IP, HTTP, FTP, UDP, N-Tier, Markup Languages VRML– HTML, DHTML, DNS, URL, Browsers, Platform for Web Services Development, MVC Design Pattern, .NET, J2EE Architecture, J2EE Components & Containers, Specification, Application servers, Struts.

Unit IV Dynamic web programming: Java Applets, Java script, JSP, JSTL, ASP, PHP, Servlets, Servlet Life cycle, C#, Component Technologies, Java beans, CORBA, Introduction to EJBs, JDBC, Secure Electronic Transactions over Web. Introduction to cloud computing: Cloud Computing- History of Cloud Computing, Cloud Architecture, Cloud Storage, Why Cloud Computing Matters, Pros and Cons of Cloud Computing, Companies in the Cloud Today, Cloud Services.

Text books:

1. Balagurusamy, E. 2009. Programming With Java. 4th ed. Tata McGraw-Hill Education. 2. Ladd, E. and O'Donnell, J. 2001. Platinum Edition Using Xhtml, Xml and Java 2. 4th ed.

Que Publishing. 3. Deitel, P.J., Deitel, H. and Deitel, A. 2011. Internet and World Wide Web How to

Program. 5th ed. India: Pearson Education, Limited. 4. Miller, M. August 2008. Cloud Computing: Web-Based Applications That Change the

Way You Work and Collaborate Online. Que Publishing.

CST.526: Internet Technologies. Credit Hours: 3. .

Unit I Introduction: Evolution of Internet, TCP/IP, addressing and routing. Internet applications: FTP, Telnet, Email, Chat, World Wide Web-http protocol.

Unit II Designing web pages: HTML, forms, CGI Scripts and clickable maps, Java Applets, Java Scripts, Java Servlets, Perl, DHTML, XML. Internet security: Basic Cryptography issues- symmetric and asymmetric key, encryption and digital signature, authentication, Firewall Design Issues.

Unit III Emerging trends: E-Commerce, Internet Telephony, Search Engine and web crawler, Intranet & Extranet. Legal, privacy and ethical issues in digital security: Program and data Protection by patents, copyrights and trademarks, information and the law, computer crime, privacy, ethical issues in digital security and codes of professional ethics.

Unit IV Introduction to python: Python's basic data types, working with data, Program organization and functions.

Text books:

1. Gralla, P. 2008. How the Internet Works. 8th ed. Que Pub. 2. Deitel, P.J., Deitel, H. and Deitel, A. 2011. Internet and World Wide Web How to

Program. 5th ed. India: Pearson Education, Limited. 3. Lutz, M. 2011. Learning Python, 4th ed. O'Reilly Media, Inc.

Suggested readings:

1. Balagurusamy, E. 2009. Programming With Java. 4th ed. Tata McGraw-Hill Education. 2. Ladd, E. and O'Donnell, J. 2001. Platinum Edition Using Xhtml, Xml and Java 2. 4th ed.

Que Publishing.

CST.556: Software Lab-II (Advanced Database Management System). Credit Hour: 1.

Students should be asked to run the various queries using commands of SQL- SELECT, FROM, WHERE Clause, UPDATE Statement, INSERT Statement, DELETE Statement, DROP Statement, AND & OR, WHERE, ORDER BY Statement, IN & BETWEEN, LIKE, GROUP BY & HAVING, EXIST & ALL. Views, CHECK DATABASE Statement, Group Functions, Keys: Primary & Foreign Keys, Joins: Joining Tables, Cartesian Join / Simple Join, Aliases/ In/Sub queries, Conditional Selection, Relational Operators, Compound Conditions, Grouping Data ,Using Collections (IN and NOT IN Statements), Union Statement, Multiple conditions , Complex conditions.

Advanced SQL Statements, SQL COUNT Function, SQL MAX Function, SQL MIN Function, SQL AVG Function, SQL SUM Function, SQL SQRT Functions, SQL RAND Function, SQL CONCAT Function, SQL Numeric Functions, SQL String Functions. And to write programs using control structures of PL/SQL like If-else statements, using loops of PL/SQL like: For, Do-while, while, Implementation of Cursors, Procedures, Packages and Triggers.

CST.599: Seminar in Computer Science & Technology. Credit Hour: 1.

Semester III:

CST.599: Seminar in Computer Science & Technology. Credit Hour: 1.

CST.500: Dissertation Research. Credits: 18.

Semester IV:

CST.500: Dissertation Research. Credits: 12.