department of computer science engineering sggs institute...

9
Department of Computer Science Engineering SGGS Institute of Engineering and Technology Vishnupuri, Nanded - 431606 The following shall be the scheme of Instructions and Examinations for the Final Year (Computer Science and Engineering) CSE B. Tech. students. Sr. No. Name of the course Total No. of credits Lectures/ week Tutorials/ week Practical/ week I Semester CSE401 Industrial Training 1 -- -- 2 CSE402 Advanced Database Management Systems 4 3 - 2 CSE403 TCP/IP Networking 5 4 - 2 CSE404 Object Oriented Modeling and Design 4 4 - - Elective-I * 4 3 - 2 CSE410 Project-I 4 -- -- 8 Sub Total 22 14 - 16 II Semester CSE411 Distributed Computing 4 3 - 2 CSE412 Cryptography and Network Security 5 4 - 2 CSE413 Mobile Computing 5 4 - 2 Elective-II ** 4 3 - 2 CSE419 Project-II 4 -- -- 8 Sub Total 22 14 - 16 Total 44 28 32 Electives: The list of electives is stated below. The students will select any one from each group *Elective-I: **Elective-II: CSE405 AI & Expert Systems CSE414 Data Warehousing and Mining CSE406 Real Time Systems CSE415 Multimedia Systems CSE407 Artificial Neural Networks CSE416 Computer Vision CSE408 Information Theory & Coding CSE417 High Performance Computing CSE409 Simulation and Modeling CSE418 Advanced Algorithms We propose the following syllabus of B.Tech. CSE for the academic year 2012-13. DUGPC Members: 1. Dr. U. V. Kulkarni. 2. Prof. R. K. Chavan 3. Prof. P. S. Nalawade. 4. Prof. S. S. Hatkar Dr U. V. Kulkarni Head, CSE.

Upload: duongdiep

Post on 01-Feb-2018

217 views

Category:

Documents


3 download

TRANSCRIPT

Page 1: Department of Computer Science Engineering SGGS Institute ...csed.sggs.ac.in/csed/sites/default/files/files/btech_structure... · Department of Computer Science Engineering SGGS Institute

Department of Computer Science EngineeringSGGS Institute of Engineering and Technology

Vishnupuri, Nanded - 431606

The following shall be the scheme of Instructions and Examinations for the Final Year (Computer Science and Engineering) CSE B. Tech. students.

Sr. No. Name of the courseTotal No. of

creditsLectures/

weekTutorials/

weekPractical/

week

I SemesterCSE401 Industrial Training 1 -- -- 2

CSE402Advanced Database Management Systems 4 3 - 2

CSE403 TCP/IP Networking 5 4 - 2

CSE404Object Oriented Modeling and Design 4 4 - -

Elective-I* 4 3 - 2CSE410 Project-I 4 -- -- 8

Sub Total 22 14 - 16

II SemesterCSE411 Distributed Computing 4 3 - 2

CSE412Cryptography and Network Security 5 4 - 2

CSE413 Mobile Computing 5 4 - 2Elective-II** 4 3 - 2

CSE419 Project-II 4 -- -- 8

Sub Total 22 14 - 16

Total 44 28 32

Electives: The list of electives is stated below. The students will select any one from each group

*Elective-I: **Elective-II:

CSE405 AI & Expert Systems CSE414 Data Warehousing and Mining

CSE406 Real Time Systems CSE415 Multimedia Systems

CSE407 Artificial Neural Networks CSE416 Computer Vision

CSE408 Information Theory & Coding CSE417 High Performance Computing

CSE409 Simulation and Modeling CSE418 Advanced Algorithms

We propose the following syllabus of B.Tech. CSE for the academic year 2012-13.

DUGPC Members:

1. Dr. U. V. Kulkarni. 2. Prof. R. K. Chavan3. Prof. P. S. Nalawade.4. Prof. S. S. Hatkar

Dr U. V. KulkarniHead, CSE.

Page 2: Department of Computer Science Engineering SGGS Institute ...csed.sggs.ac.in/csed/sites/default/files/files/btech_structure... · Department of Computer Science Engineering SGGS Institute

CSE401 INDUSTRIAL TRAINING (L-0, T-0, P-2, CR-1)

Students are supposed to submit the detail report covering the aspects related to computer engineering projects that are relevant to industry in which they receive training.

CSE402 ADVANCED DATABASE MANAGEMENT SYSTEMS (L-3, T-0, P-2, CR-4)

1. Distributed Databases: Introduction, Promises of DDBSs, Complicating factors, problem areas of DDBSs, Architectural models for Distributed DBMS, Distributed DBMS architecture, Distributed database Design: Alternative Design Strategies, Distribution Design issues.

2. Distributed Query Processing: Query processing problem, objectives of Query processing, Complexity of Relational Algebra operation, Characterization of Query processors, Layers of Query processing. Distributed Transactions, Commit protocols, Concurrency control in Distributed Databases, Failures and fault Tolerance in Distributed databases.

3. Parallel Databases: Database servers, Parallel architectures, parallel DBMS techniques, parallel execution problems, parallel execution for Hierarchical architecture.

4. Application development and administration: Web interfaces to databases, performance tuning, performance benchmarks, standardization, e-commerce, and legacy systems

5. Advanced Querying and Information Retrieval: Decision support systems, Information Integration: modes of information, wrappers in mediator based systems, data analysis and OLAP, data mining, data warehousing, and information retrieval systems, and applications

6. Advanced Data Types and New Applications: Motivation, time in databases, spatial and geographic data, multimedia databases, mobility and personal databases

7. Advanced Transaction Processing: Transaction processing monitors, transactional workflows, main memory databases, real time transaction systems, long duration transactions, transaction management in multidatabases

8. Multidimensional Indexes: Application needing multiple dimensions, hash like structures for multidimensional data, tree like structures for multidimensional data, bitmap indexes

9. XML: Background, Structure of XML Data, XML Document Schema, Querying and Transformation, API, Storage of XML Data, XML Applications.

References:1. Naveen Prakash, “Introduction to database management”, TMH2. Rob and Coronel, “Database Systems”, Fifth Edition, Thomson3. Molino, Ullman and Widom, “Database System Implementation”, Pearson Education Asia4. Ozsu and Valduriez, “Principles of Distributed Database Systems”, Pearson Education Asia5. Database management, Objectives, system functions and administration, Gordon Everest,6. Ramkrishnan and Gehrke, “Database Management Systems”, MGH International Edition7. Silberchatz, Korth and Sudarshan, “Data base systems concepts”, MGH, 4th edition

CSE403 TCP/IP NETWORKING (L-4, T-0, P-2, CR-5)

1. Introduction and Underlying Technologies: Introduction, The OSI Model and the TCP/IP Protocol Suite, Underlying Technologies

2. Network Layer: Introduction to Network Layer, IPv4 Addresses, Delivery and Forwarding of IP Packets, Internet Protocol Version 4 (IPv4), Address Resolution Protocol (ARP), Internet Control Message Protocol Version 4 (ICMPv4), Unicast Routing Protocols (RIP, OSPF, and BGP), Multicasting and Multicast Routing Protocols

3. Transport Layer: Introduction to the Transport Layer, User Datagram Protocol (UDP), Transmission Control Protocol (TCP), Stream Control Transmission Protocol (SCTP)

4. Application Layer: Introduction to the Application Layer, Host Configuration: DHCP, Domain Name System (DNS), Remote Login: TELNET and SSH, File Transfer: FTP and TFTP, World Wide Web and HTTP, Electronic Mail: SMTP, POP, IMAP, and MIME, Network Management: SNMP, Multimedia

5. IPv6 Addressing

References:1. Internetworking with TCP/IP(5th Edition), Douglas E. Comer2. TCP/IP Protocol Suite, 4/e, Forouzan3. Computer Networks, 4/e, Andrew S. Tanenbaum

Page 3: Department of Computer Science Engineering SGGS Institute ...csed.sggs.ac.in/csed/sites/default/files/files/btech_structure... · Department of Computer Science Engineering SGGS Institute

CSE404 OBJECT ORIENTED MODELING AND DESIGN(L-4,T-0,P-0,CR-4)

1. Introduction: Object Orientation-System Development, Review of objects, Inheritance, Object Relationship, Dynamic binding, - OOSD life cycle, Process, Analysis, Design, Prototyping, Implementation- Testing

2. Methodology and UML: Overview of Methodologies, OMT- Booch methodology, Jacobson Methodology, Unified approach -UML -Class Diagram, Dynamic modeling

3. Analysis: Use case model- Creation of classes-Noun phrase approach- Responsibilities-Collaborators- Object Relationship-Super-Sub class- Aggregation.

4. Design: OO Design Examples- Class visibility- Refining attributes- Methods- Access layers- OODBMS- Tables- Class mapping view layers- VI designing.

5. Software Quality: Quality Assurance testing—Inheritance and testing- Test plan Usability testing- User satisfaction- Testing.

References1. Ali Bahrami- “ Object oriented System Development”, Mcgraw Hill International Edition, 19992. Booch G. “Object Orineted Ananlysis and Design”, Addition Wesley Publishing Company,

1994.3. Rambaugh J. Blaha, M. Premerlani W. Eddy F and Loresen W. “Object Oriented Modeling and

Design”. PHI 1997.

CSE405 AI & EXPERT SYSTEMS(L-3, T-0, P-2, CR-4)

1. Introduction: General, Developments in Artificial Intelligence, Developments in Expert Systems, Role of AI and Expert Systems in Engineering

2. Search Techniques: Problem Definition and Solution Process, Production Systems, Search Techniques, Problem Decomposition and AND-OR Graphs

3. Knowledge-Based Expert System: What is KBES?, Architecture of KBES4. Engineering Design Synthesis: Synthesis, Decomposition Model for Synthesis, Role of

Synthesizer in KBES Environment, An Architecture for a Synthesizer-A Generic Tool Generic Synthesis Tool-GENSYNT

5. Criticism and Evaluation: Methodologies Used in Knowledge Based Environment, A Framework for Critiquing and Evaluation, Generic Critiquing Tool-GENCRIT

6. Case-Based Reasoning: Applications of Case-Based Reasoning, Case-Based Reasoning ProcessA Framework for CBR in Engineering Design (CASETOOL), Architecture of CASETOOLApplication Example

7. Process Models and Knowledge-Based System: Expert Systems for Diagnosis, Blackboard Model of Problem Solving, ODESSY-An Integrated System for Preliminary Design of Reinforced Concrete Multistory Office Buildings, Conceptual Design of a Car Body Shape, SETHU-An Integrated KBES for Concrete Road Bridge Design

References:1. C.S. Krishnamoorthy, S. Rajeev: Artificial Intelligence and Expert Systems for Engineers, 2. Stuart E. Savory, Artificial Intelligence & Expert Systems, Ellis Horwood Ltd

CSE406: REAL TIME SYSTEMS: (L-3, T-0, P-2, CR-4)

Introduction, Real-Time Task Scheduling, Handling Resource Sharing and Dependencies among Real-Time Tasks, Scheduling Real-Time Tasks in Multiprocessor and Distributed Systems, Commercial Real-Time Operating Systems, Real-Time Communication, Real-Time Databases

References:

Page 4: Department of Computer Science Engineering SGGS Institute ...csed.sggs.ac.in/csed/sites/default/files/files/btech_structure... · Department of Computer Science Engineering SGGS Institute

1. Rajib Mall, Real-Time Systems: Theory and Practice, Pearson Education.2. Jane W. S. Liu., Real-Time systems, Pearson Education.

CSE407 ARTIFICIAL NEURAL NETWORKS(L-3, T-0, P-2, CR-4)

1. Feedforward networks: Fundamental concepts- Models of artificial neural network (ANN); Learning and adaption; Learning rules, Classification model, Features and decision regions, Perceptron networks, Delta learning rules for multi-perceptron layer, Generalized learning rule, Error backpropagation training, Learning factors.

2. Recurrent networks: Mathematical foundation of discrete time and gradient type Hopefield networks, Transient response and relaxation modeling.

3. Self-organizing networks: Hamming net and MAXNET, Unsupervised learning of clusters, Counterpropagation network, Feature mapping, Self organizing feature maps, Cluster discovery network (ART1).

4. Fuzzy Neural Networks: Fuzzy set theory, Operations on fuzzy sets, Fuzzy neural networks, Fuzzy min-max neural networks, General fuzzy min-max neural network

5. Applications: Handwritten character recognition, Face recognition, Image compression

References:1. Jacek Zurada, “Introduction to ANN”, Jaico Publishing House2. Bose and Liang, “Neural network fundamentals with Graphs, Algorithms, and Applications”,

TMH edition3. Ham and Kostanic, “Principles of Neurocomputing for Science and Engineerin”, TMH edition

CSE408 INFORMATION THEORY & CODING (L-3, T-0, P-2, CR-4)

1. Information Theory: Information – Entropy, Information rate, classification of codes, Kraft McMillan inequality, Source coding theorem, Shannon-Fano coding, Huffman coding, Extended Huffman coding - Joint and conditional entropies, Mutual information - Discrete memory less channels – BSC, BEC – Channel capacity, Shannon limit.

2. Source Coding: Text, Audio and Speech: Text: Adaptive Huffman Coding, Arithmetic Coding, LZW algorithm – Audio: Perceptual coding, Masking techniques, Psychoacoustic model, MEG Audio layers I,II,III, Dolby AC3 - Speech: Channel decoder, Linear Predictive Coding

3. Source Coding: Image and Video: Image and Video Formats – GIF, TIFF, SIF, CIF, QCIF – Image compression: READ, JPEG – Video Compression: Principles-I,B,P frames, Motion estimation, Motion compensation, H.261, MPEG standard

4. Error Control Coding: Block codes: Definitions and Principles: Hamming weight, Hamming distance, Minimum distance decoding - Single parity codes, Hamming codes, Repetition codes - Linear block codes, Cyclic codes - Syndrome calculation, Encoder and decoder – CRC

5. Error Control Coding: Convolution codes : Convolution codes – code tree, trellis, state diagram - Encoding – Decoding: Sequential search and Viterbi algorithm – Principle of Turbo coding

References:

1. R Bose, “Information Theory, Coding and Cryptography”, TMH 20072. Fred Halsall, “Multimedia Communications: Applications, Networks, Protocols and3. Standards”, Perason Education Asia, 20024. 3.. K Sayood, “Introduction to Data Compression” 3/e, Elsevier 20065. S Gravano, “Introduction to Error Control Codes”, Oxford University Press 20076. Amitabha Bhattacharya, “Digital Communication”, TMH 2006

CSE 409: SIMULATION & MODELING

Page 5: Department of Computer Science Engineering SGGS Institute ...csed.sggs.ac.in/csed/sites/default/files/files/btech_structure... · Department of Computer Science Engineering SGGS Institute

(L-3, T-0, P-2, CR-4)

1. Introduction - systems and models - computer simulation and its applications, continuous system simulation - modeling continuous systems - simulation of continuous systems - discrete system simulation - methodology - event scheduling and process interaction approaches - random number generation - testing of randomness - generation of stochastic variates - random samples from continuous distributions -uniform distribution - exponential distribution m-Erlang distribution – gamma distribution - normal distribution - beta distribution - random samples from discrete distributions - Bernoulli - discrete uniform - binomial - geometric and poisson

2. Evaluation of simulation experiments - verification and validation of simulation experiments - statistical reliability in evaluating simulation experiments – confidence intervals for terminating simulation runs - simulation languages – programming considerations - general features of GPSS - SIM SCRIPT and SIMULA

3. Simulation of queuing systems - parameters of queue - formulation of queuing problems - generation of arrival pattern - generation of service patterns - Simulation of single server queues - simulation of multi-server queues - simulation of random queues

4. Simulation of stochastic network - simulation of PERT network - definition of network diagrams - forward pass computation - simulation of forward pass – backward pass computations - simulation of backward pass - determination of float and slack times determination of critical path - simulation of complete network - merits of simulation of stochastic networks

References:1. Deo N., System Simulation And Digital Computer, Prentice Hall of India.2. Gordan G., System Simulation, Prentice Hall of India.3. Law A.M. & Ketton W.D., Simulation Modeling and Analysis, McGraw Hill.

CSE410: PROJECT-I (L-0, T-0, P-8, CR-4)

Project shall be based on any recent topic selected by the students working in a group. In any group more than two students are not allowed. Teaching load of two hours per week per group shall be allotted to the teacher. The guide shall give the term-work marks by assessing the work done and the submitted bound report by the students in the group. External practical examination shall be based on the work demonstrated by the group, followed by the oral examination conducted by the panel of examiners, consisting of guide working as a senior examiner and other external examiner(s), appointed by the Institute.

CSE411 DISTRIBUTED COMPUTING(L-3, T-0, P-2, CR-4)

1. Introduction Distributed Computing: Definition of a distributed system ,goals, architectures,2. Processes: Threads, virtualization ,clients, servers ,code migration Case study: Mobile Agents3. Communication: Remote procedure call, message-oriented communication, stream-oriented

communication, Case, Study: RMI, MPI4. Naming: flat naming ,structured naming ,attribute-based naming Case study: LDAP5. Synchronization: clock synchronization ,mutual exclusion ,election algorithms6. Consistency and replication: Data-centric consistency models ,client-centric consistency

models ,consistency protocols7. Distributed object-based systems : Distributed Objects, Object Servers, Binding a Client to an

Object, Java RMI, Common Object Request, Broker Architecture (CORBA) Case Studies: Enterprise Java Beans

8. Distributed file systems: architecture, NFS, synchronization, consistency and replication ,Case Studies: Hadoop Distributed File System (HDFS)

9. Distributed web-based systems: Web-Based Systems ,Web Services, Web Server /Client, Web Server Clusters ,Web Proxy Caching, Case Study: Apache Web Server, Squid

10. Programming Models for Distributed Systems: MapReduce: Simplified data processing on large clusters

References:

Page 6: Department of Computer Science Engineering SGGS Institute ...csed.sggs.ac.in/csed/sites/default/files/files/btech_structure... · Department of Computer Science Engineering SGGS Institute

1. Distributed Systems. Principles and Paradigms. (2nd Ed.) Prentice Hall, 2007. Andrew S.2. Tanenbaum, Vrije University, Amsterdam, The Netherlands, Maarten Van Steen3. Distributed System Concepts and Design(5th Ed.), George Coulouris, Jean Dollimore, Tim4. Kindberg, Gordon Blair5. Hadoop, The Definitive Guide, Oreilly , 2010 . Tom White

CSE412 CRYPTOGRAPHY AND NETWORK SECURITY(L-4, T-0, P-2, CR-5)

1. Introduction to cryptography: What is Cryptography, Encryption Schemes, Functions, Secret Key Cryptography, Public Key Cryptography, Hash Algorithms

2. Mathematical Background for Cryptography: Modulo arithmetic, Euclid's algorithm, algebraic structures- groups, rings, fields-Polynomial fields, prime numbers, Fermat's theorem, Eyler's totient function, Euler's theorem, testing for primality- Probabilistic Considerations, Chinese reminder theorem, Discrete Logarithms – the powers of an integer, Modulo n, Indices, calculation of Discrete Logarithms

3. Conventional Encryption: Classical techniques, Modern Techniques, Algorithms, Confidentiality using conventional encryption

4. Public Key encryption and Hash Function: Public Key Cryptography, Message authentication and hash function, Digital Signatures and authentication protocols

5. System Security: Kerberos, Web security SSL, TSL, Firewalls

References:

1. Bernard Menezes, “Network Security and Cryptography”, Cengage Learning,2. William Stalling, “Cryptography and Network and Network security-Principals and

practices”, Pearson Education3. King, Dalton, and Osmanoglu, “Security Architecture”, TMH edition 4. Kaufman, Perlman, and Spenciner, “Network Security”, PHI

CSE413 MOBILE COMPUTING(L-4, T-0, P-2, CR-5)

1. Wireless Transmission: Signals, propagation, signal encoding, multiplexing, modulation and spread spectrum

2. Wireless LANS: IEEE 802.11, Bluetooth and Hiperlan3. Mobile Network Layer: IP packet delivery, agent discovery, registration, tunneling and

encapsulation, optimization, reverse tunneling, mobile ad-hoc networks4. Mobile Transport Layer: Indirect TCP, snooping TCP, mobile TCP, transaction oriented TCP,

TCP over 3G wireless networks5. Wireless WANS: Cellular network, GSM, GPRS, UMTS , CDPD and CDMA6. Other Topics: Operating Systems for mobile devices, wireless application protocol, WML and

WMLScripts

References:1. Mobile Communications, Jochen Schiller2. Wireless Communications and Networks, William Stallings3. Mobile Computing, Talukder and Yavagal4. The Wireless Appilcation Protocol, Singhal, Bridgman, Mauney, Alvinen, Bevis,

Chan and Hild

CSE414 DATA WAREHOUSING AND MINING (L-3, T-0, P-2, CR-4)

1. Introduction data warehousing and data mining: Data Warehouses, Data Mining Functionalities, Characterization and Discrimination, Mining Frequent Patterns, Associations, and Correlations, Classification and Prediction.

2. Data Warehouse and OLAP Technology: Differences between Operational Database Systems and Data Warehouses, A Multidimensional Data Model, Stars, Snowflakes, and Fact

Page 7: Department of Computer Science Engineering SGGS Institute ...csed.sggs.ac.in/csed/sites/default/files/files/btech_structure... · Department of Computer Science Engineering SGGS Institute

Constellations Schemas for Multidimensional Databases, A Starnet Query Model for Querying, Multidimensional Databases.

3. Data Warehouse Architecture: Steps for the Design and Construction of Data Warehouses, A Three-Tier Data Warehouse Architecture, Metadata Repository, Data Warehouse Implementation tools and techniques.

4. Data Preprocessing: Data Summarization, Measuring the Dispersion of Data, Data Cleaning, Missing Values, Noisy Data, Data Integration and Transformation, Data Reduction, Data Cube Aggregation, Attribute Subset Selection, Dimensionality Reduction, Numerosity Reduction, Data Discretization and Concept Hierarchy Generation.

5. Data Mining: Mining Frequent Patterns, Associations and Correlations, Frequent Itemsets, Closed Itemsets, and Association Rules, Frequent Pattern Mining: Efficient and Scalable Frequent Itemset Mining Methods, The Apriori Algorithm, Mining Various Kinds of Association Rules, Mining Multidimensional Association Rules, Constraint-Based Association Mining.

6. Classification and Prediction: Issues Regarding Classification and Prediction, Preparing the Data for Classification and Prediction, Classification by Decision Tree Induction, Decision Tree Induction, Attribute Selection Measures, Tree Pruning, Scalability and Decision Tree Induction, Bayesian Classification, A Multilayer Feed-Forward Neural Network, Support Vector Machines, k-Nearest-Neighbor Classifiers, Genetic Algorithms, Rough Set Approach, Fuzzy Set Approaches, Prediction, Linear Regression.

7. Cluster Analysis: Types of Data in Cluster Analysis, Partitioning Methods, Classical Partitioning Methods: k-Means and k-Medoids, Partitioning Methods in Large Databases from k-Medoids to CLARANS, Hierarchical Methods, Outlier Analysis.

References:1. Jiawei Han and Miceline Kamber, “Data Mining: Concepts and Techniques”, Elsevier

publication.2. George M. Marakas, “Modern Data Warehousing, Mining & Visualization”, Pearson Education,

2003.3. Margaret H. Dunham, “Data mining: Introductory & Advanced Concepts”, Pearson Education,

2003.

CSE415 MULTIMEDIA SYSTEMS(L-3, T-0, P-2, CR-4)

1. Introduction: Multimedia elements and applications, Architecture, Evolving technologies, Defining objects, Data interface standards, Multimedia databases

2. Compression and decompression: Types of compression, Binary image compression schemes, Color, gray scale and still video image compression, Video image and audio compression

3. Data and file format standards: RTF, TIFF, BMP, RIFF, MIDI, JPEG DIB, AVI and MPEG4. Multimedia input/output technologies: Issues, pen input, video and image display systems,

print output technologies, image scanners, digital voice and audio, digital camera, video images and animation, and full motion video

5. Storage and retrieval technologies: Magnetic media technologies, optical media, hierarchical storage and cache management

6. Architectural and telecommunications considerations: Specialized computational processors, memory systems, multimedia board solutions, LAN/WAN connectivity, Distributed object model

7. Multimedia application design: Application classes, types of multimedia systems, virtual reality design, components of multimedia systems, organizing multimedia databases, application workflow and distributed application design issues

8. Multimedia authoring and user interface: Multimedia authoring systems, hypermedia application design considerations, user interface design, information access, and object display/ playback issues

9. Multimedia messaging: Mobile messaging, hypermedia message components, hypermedia linking and embedding, creating hypermedia messages, integrated multimedia message standards and document management

Page 8: Department of Computer Science Engineering SGGS Institute ...csed.sggs.ac.in/csed/sites/default/files/files/btech_structure... · Department of Computer Science Engineering SGGS Institute

10. Distributed multimedia systems: Components, distributed client-server operation, multimedia object severs, multi-server network topologies, distributed multimedia databases and managing distributed objects

11. Multimedia Database Systems: Multimedia database management system, characteristics of an MDBMS, data analysis, data structure, operations on data, integration in a database model, relational database model, object-oriented database model

References:

1. Prabhat K. Andleigh and Kiran Thakrarar, “Multimedia systems design”, PHI, 20022. John F. Koegel Buford, “Multimedia systems”, Pearson Education, 20023. Steinmetz and Nahrstedt, “Multimedia: Computing, Communications and Applications” 4. Tay Vaughan, “Multimedia Making it work”, Fifth Edition, TMH5. Chapman,” Digital Multimedia” Wiley India.6. Ranajan Parekh, “Principles of Multimedia”, Tata McGraw Hill 7. Buford – “Multimedia Systems”, Pearson

CSE416 COMPUTER VISION(L-3, T-0, P-2, CR-4)

1. Introduction: Image formation-image model, imaging devices2. Early processing: Recovering intrinsic structure, Filtering Image, finding local edges, Range

information from geometry, Surface orientation, Optical flow, Resolution pyramids.3. Boundary detection: Searching near and approximate location, Hough method for curve

detection, Edge following as graph searching, Edge following as dynamic programming, Contour following

4. Region growing: Regions, local technique, Blob coloring, Global techniques, Splitting and merging

5. Texture: Structural models, Texture as a pattern recognition problem, Texture gradients6. Motion: Motion understanding, Optical flow, Image sequences7. Representation of 2-D geometrical structure: Boundary representation, Region

representation, Simple shape properties, Representation of 3-D structures, Solids and their representation, Surface representation, Generalized cylinder representation, Volumetric representation, Understanding line drawings

8. Knowledge representation and use: Knowledge base models and processes, Semantic nets, Control issues in vision systems

9. Matching: Aspects, Graph theoretic algorithms, Implementation, Matching in practice 10. Inference: First order predicate Calculus, computer reasoning, Production systems, Scene

labeling, Active knowledge

References:

1. Ballard and Brown, “Computer Vision”, Prentice Hall publication2. Jain, Kasturi and Schunck, “Machine Vision”, McGraw-Hill International Editions

CSE417 HIGH PERFORMANCE COMPUTING (L-3, T-0, P-2, CR-4)

1. Introduction to parallel computing: Motivating parallelism, scope of parallel computing, Parallel programming platforms2. Principles of parallel algorithm design: preliminaries, decomposition techniques, Mapping techniques and load balancing,Parallel algorithms models3. Parallel programming: message passing: Introduction to MPI, using clusters of computers, evaluating parallel programs, debugging4. Parallel programming: shared-memory: Thread basics, programming with pthreads, java threads, openMp5. Load balancing and termination detection: Dynamic load Balancing, Distributed termination detection algorithms

References:

Page 9: Department of Computer Science Engineering SGGS Institute ...csed.sggs.ac.in/csed/sites/default/files/files/btech_structure... · Department of Computer Science Engineering SGGS Institute

1. An Introduction to Parallel Computing: Design and Analysis of Algorithms, Second Edition - A.Grama, A. Gupta, G. Karypis and V. Kumar, Pearson2. Parallel Programming: Techniques and Applications using Networked Workstations and Parallel Computers" (2nd ed.) by B. Wilkinson and M. Allen, Prentice Hall.3. Parallel Programming: for Multicore and Cluster Systems, Thomas Rauber, Gudula Rünger, Springer.

CSE418 ADVANCED ALGORITHMS(L-3, T-0, P-2, CR-4)

Algorithmic paradigms: Dynamic Programming, Greedy, Branch-and-bound; Asymptotic Com-plexity, Amortized analysis; Graph Algorithms: Shortest paths, Flow networks; NP-com pleteness; Approximation algorithms; Randomized algorithms and advanced data-structures, topics of current Research

References:1. T.H. Cormen, C.E. Leiserson, R.L. Rivest, Introduction to Algorithms, McGraw Hill, 1994.2. Jon Kleinberg, Eva Tardos, Algorithm Design, Pearson Addison-Wesley, 20063. Dan Gusfield, Algorithms on Strings, trees and Sequences, Cambridge, 2005.4. Sara Baase, Computer Algorithms: Introduction to Design and Analysis, Addison Wesley, 1998.

Michael T Goodrich & Roberto Tamassia, Algorithm Design: Foundations, Analysis & Internet Examples, John Wiley, 2002.

CSE419 PROJECT -II(L-0, T-0, P-8, CR-4)

Project shall be based on any recent topic selected by the students working in a group. In any group more than two students are not allowed. Teaching load of two hours per week per group shall be allotted to the teacher. The guide shall give the term-work marks by assessing the work done and the submitted bound report by the students in the group. External practical examination shall be based on the work demonstrated by the group, followed by the oral examination conducted by the panel of examiners, consisting of guide working as a senior examiner and other external examiner(s), appointed by the Institute.