UNIVERSITY OF PUNE Structure of B.E. (Information Technology) 2003 Term - I Subject Code No. Lect.

414441 Information System Security 414442 Advanced Database Management 414443 Software Testing & Quality Assurance 410444 Object Oriented Modeling & Design 414445 Elective – I 414446 Computer Lab Practice – I 414447 Project Work Total Total of Part I(A) --20 2 8 28 Hrs. Term - II Subject Code No. Lect. 414448 System Operation & Maintenance 414449 Distributed System 414450 Information Retrieval 410451 Elective – II 414452 Computer Lab Practice – II 4 4 4 ---------2 4 100 100 100 ---------50 50 ------------------50 50 100 100 200 100 4 Pract. ---Paper 100 T/W ---Pract ---Oral ---Subject Teaching Scheme Examination Scheme Total Marks Total 100 ---500 ---100 ---50 ---100 ---750 750 4 ---4 100 ------50 ---50 ---50 100 150 4 100 ---------100 4 100 ---------100 4 100 ---------100 4 Pract. 2 Paper 100 T/W 50 Pract ---Oral 50 Subject Teaching Scheme Examination Scheme Total Marks Total 200

414447 Project Work Total Total of Part II (B) Grand Total (A) + (B)

---16

6 12 28 Hrs

---400

100 200

-----

50 150 750

150 750 1500

Elective -I . Elective - II 1) Bio Infonnatics 1) Artificial Intelligence 2) Mobile Computing 2) Software Architecture 3) GIS & Remote Sensing 3) Real Time System 4) Organizational behavior & management Concept 414441:- Information System Security. Teaching Scheme: Examination Scheme: Lectures: 4 Hrs! Week Theory: 100 marks U nit I: Introduction & Foundations The Basic Components, Threats, Policy and Mechanism, Assumptions and Trust, Assurance, Operational Issues, Human Issues, Protection state, Access control Matrix model, protection state transitions, Copying, Owning, and the attenuation of privilege, The general questions and basic foundational results,. Trojan Horses, Computer Viruses, Computer Worms, Other forms of malicious logic. Unit U: Policy Security Policy, Types of Security Policy, The role of Trust, Types of Access control, Policy languages, Example: Academic computer Security policy, Security and Precision, Goals of Integrity policies, Biba Integrity Model, Clark -Wilson Integrity Model, Chinese wall model of hybrid policies, Clinical information systems security policies. Unit ill: Cryptography What is Cryptography, Classical cryptosystems, Secrete Key cryptography, Public Key Cryptography, Cryptographic Checksums, Session and Interchange Keys, Key Exchange, Key Generation, Cryptography Key Infrastructures, Storing and Revoking Keys, Digital Signature, Digital certificates. Unit IV: Advanced Cryptography Problems of cipher techniques, Stream and Block ciphers, Networks and Cryptography, Example protocols such as secure electronic mail: PEM, SSL, IPSec, Authentication basic, Passwords, Challenge and response, Biometrics

Implement a secret key algorithm. example ACLs for router 1721 7. Vulnerability Classifications. Execution based mechanism. Teaching Scheme: Examination Scheme: Practical: 2 Hrs/ Week. What is Identity? . IDS (Intrusion Detection System) Introduction. . Implement access control list for a router. Principle & basic of Intrusion detection. free tool as Nessus 9.Information system security Lab. Write a client server socket program in which server will authenticate client using authentication algorithm. "computer security . Identity on the Web. Unit VI: Vulnerability. Pearson Publication. Assignments 1. Penetration Studies.Unit V: Implementation: System. Overview. Designing an auditing system. Users. Auditing. Configure proxy server 2. Groups and Roles.Arts& Science". 8. Compiler based mechanism. Download vulnerability scanning tool. Implementation of protocol analyse/ sniffer 3. . Models. Anatomy of an auditing system. Protection analysis model. Files and Objects. Example Information flow controls. Generate the report for any sample network ex. Information flow basics and backgrounds. 414441:. Oral: 50 Marks. Naming Certificate. Access control Lists. Intrusion response. Book Reference : Matt Bishop. . Architecture. Design Principles. Find the IP address of remote machine 5. Design Security policy for a commercial organization 6. T/ W : 50 marks. Organization of Intrusion detection System. Download free tool for port scanning and test it 4. Auditing Definition.

Commit protocols. Implement a virtual LAN using a Router and a manageable switch 12. DDBMS architectures_ Homogeneous and Heterogeneous Databases. / Week Theory: 100 Marks Objectives: To learn and understand advances in Database System Implementations To learn and understand various database architectures and applications. Parallel database architecture. control in distributed databases. Business logic .10.I: Parallel databases Introduction. Teaching Scheme: Examination Scheme: Lecturers: 4 Hrs. Introduction. Distributed query processing. Student will submit the term work in the form of a journal which will include assignments with problem statement.Advance Database Management. 414442:. Concurrency. implementation and result. I/O parallelism. Implement a public key algorithm. 10. Design of parallel systems Unit-ll: Distributed Databases . Directory systems Unit-llI: Web based systems Web based systems .Overview of client server architecture. Distributed data storage. Implement SSL protocol Staff In charge should suitably frame assignment on the above topics.SOAP . Ntier architecture. Availability. Simulate SYN flood attack 11. Prerequisites: DBMS Visual Programming Unit . Databases and web architecture. Inter-operational and Intra-operational parallelism. Inter-query and Intra-query parallelism. Distributed transactions.

descriptive and predictive data mining. Unit-VI: Advanced Topics Information retrieval . web search engines. data cleaning.Introduction. Introduction to Data warehousing. Database systems: Design implementation and management.overview. Database Management Systems. data reduction Unit -V: Data Mining . outlier analysis. Operations on cubes. Introduction to machine learning. data integration and transformation. Dimensional data modeling. McGraw Hill International Edition 2. OLAP and data cubes. Baysian classifiers. classification . architecture. snowflake schemas. Morgan Kaufmann publishers Reference Books 1. Rob Coronel.k means algorithm. Relevance ranking using terms and hyperlinks. S. Thomson Learning Press 2. Micheline Kamber. Henry Korth. Data Mining: Concepts and systems.star. 4th Edition.decision tree. synonyms.XML . Raghu Ramkrishnan. clustering . Indexing of documents. 51h Edition. Introducti0l1 to data mining.apriori algorithm. Jiawei han. Text Books : 1. Information retrieval and structured data . Data preprocessing need for preprocessing. Abraham Silberschatz. Database system concepts. Domain specific DTD's . Sudarshan. association rules . measuring retrieval effectiveness. McGraw HiJllnternational Edition . Second Edition. fact constellation. XML DTD's. Introduction to text mining. homonyms. ontologies. Johannes Gehrke. Querying XML data Unit-IV: Data Warehousing .

functional testing. defects. white box testing. beta and acceptance testing.errors. recovery testing. Test Planning . regression testing. configuration testing. Teaching scheme: Examination Scheme: Lectures : 4 Hrs/W eek Theory: 100 marks UNIT!: Testing Principles . test bed.4100443:. equivalence class partitioning and boundary value analysis Test case design strategies white box approach test adequacy criteria.random testing. mutation testing. coverage and control flow graphs. black box testing.Roles and activities. performance testing. faults. Test execution . execute . stress testing. integration testing. record test results efect Life Cycle - .forming a test team. failures.build test data. unit testing. eed of testing. develop test plan anti review Test cases design strategies black box approach . alpha. loop sting. Basic concepts . security testing.test. verification and validation NIT 2: Test Management Testing Life Cycle . paths.Software Testing And Quality Assurance. system sting.

maintainability. defect density. software configuration management (SCM). Pearson Education. defect prevention (QP). defect analysis and prevention. testing security. Inprocess quality metrics.MTTF. . software product engineering (SPE). CMMI. life cycle of defect.SQA activities. . 4. organization process definition (OPD). Basic concepts of . What to measure . defect tracking. interoperability. quantitative process management (QPM). Classifying software measures. portability. Pressman.correctness. "Practical Software Testing". Measurement basics representational theory. quality control. Testing methods at class vels Client Server Testing.ISO 9000 & 900 I. customer problems. Metrics for software maintenance. Norman E. quality assurance. UNIT 4: Quality Assurance Quality concepts . References Books: 1. Object Oriented Testing strategies. hikawa's Seven Basics Tools reliability Quality UNIT 5: Quality Standards MM . "CMM in Practice". defect detection stages. 3. software reviews.GQM technique. 6. cost of quality Software quality assurance . 5. Fenton "Software Metrics A Rigorous and Practical Approach". lnction point. Second Edition. Stephen H. William E Perry. peer views (PR). Second Edition.quality. Control flow structure. TATA McHi11. Fifth Edition.Thomson Publication. usability. customer satisfaction. 'Software Engineering". integrity. Springer Publication. Pankaj Jalote. UNIT 3: software Metrics scope of software metrics. inspections. Iiene Burnstein. defect types. web application testing. Kan "Metrics and Models in Software Quality Engineering" Pearson Education. process change management. 6 sigma UNIT 6: Trends And Research Object Oriented Testing: Testing OOA and OOD Models.Following KP As : requirements management (RM).defect data.. meaningfulness. Product quality metrics . Software attributes . audits. software project tracking and oversight (SPTO). 2. "Effective Methods for Software Testing". Wiley Publication_. scales. defect :verity. reliability.

Activities. 00 Concepts Review. UML 2.0. Activity diagrams.0. UML 2. UNIT 5 : State Machine diagrams. aggregation. tagged values. . MOF. Overview of all diagrams in UML 2. partitions. UNIT 1 : Introduction to OMG Standards: MDA. 2. Introduce UML 2. constraints and profiles. UNIT 2: Introduction to UML. Construction. Interaction Overview diagrams including interactions. 3. Rational Unified Process emphasizing Inception. XMI. Composite structure diagrams including composite structures.Object Oriented Modeling and Design Teaching Scheme: Examination Scheme: Lectures 4 Hours IW eek Theory: 100 Marks Objectives of the course: 1. transitions. partitions.0 and its diagrams as a modeling tool for large and complex systems. Templates. Classes and Relationships. UML History. Class diagrams. Advanced relationships generalization. Interfaces and ports. firm-ware and business processes. Sequence diagrams. OCL. Timing diagrams. signals. association. UNIT 4 : Interaction diagrams. state generalization. Extensibility mechanisms like stereotypes. submachine.CORBA .410444:. exceptions. sub activities. Introduction to Modeling and Design of software. Iterative approach. collaborations. . encapsulation of states. States. UML MetaModel. Transition Phases. CRC method. Review of 00 concepts.0 New Features. regions. Architectural approaches: Use case Centric. 4+ 1 View architecture. Communication diagrams. Elaboration. Active Objects. regions. Understand the concepts being modeled in UML. exceptions. UNIT 3 : Object diagrams. signals. Architecture driven. dependencies.

3. Applications of UML in embedded systems. (Addison.UNIT 6 : Support for modeling Architecture in UML. "Unified Modeling Language User Guide".0" . Magnus Penker. Forward Engineering. Brian Lyons. Paperback 5. The 2nd Edition . Schardt. "UML 2 and the Unified Process: Practical Object. commercial applications. Concepts. Martin Fowler. All diagrams are to be assumed for UML 2. (2nd Edition).Addison-Wesley Object Technology Series (Hardcover) Reference Books : 1. Deployment diagrams. Third edition. Web applications. Joseph Schmuller. "UML Distilled A Brief Guide to the Standard Object modeling language". . Notation.Wesley Object Technology Series» (Paperback) 6. Michael Jesse. Reverse Engineering & Application must be considered. James A. Third Edition Paperback. Addision Wesley. Dan Pilone. David Fado UML 2 Toolkit. Neil Pitman . IIa Neustadt. "Apress Fast track UML 2. "SAMS Teach yourself UML in 24 Hours".Oriented Analysis and Design". 2. Grady Booch. James Rumhaugh. Jim Arlow.0 for each diagram the need.0 for dummies" 7. Package diagrams. purpose."UML 2.0 in a Nutshell (In a Nutshell (O'Reilly). "UML 2. IvaI' Jacobson. Component diagrams. Text Books: 1. Paperback 4. Kendal Scott. Hans-Erik Eriksson.

collabration & communications.machine learning . (8 hrs) .user interface.stastics of alignment.Bioinformatics.infrastructure . data management. animation verses simulation .pattern recognition & discovery .structure visualization . Modeling . (Elective-I) Teaching Scheme: Examination Scheme: Lectures: 4 Hrs/Week Theory: 100 Marks UNIT I: Introduction & Information Retrieval Introduction.tools for pattern matching.multiple sequence alignment . data analysis. (8 hrs) UNIT III: Data mining and pattern matching Methods & Technology overview .tool selection .simulation & collaboration Drug discovery . word methods. micro arrays . system biology . dynamic programming. Bioinformatics Applications. Historical overview.imperfect data.general purpose technologies. quantitive randomness. molecular biology (8 hrs) UNIT II: Data Visualization & Statistics Sequence Visualization . protein structure. standards. Issues.414445:.text mining & tools. major databases.fundamentals. dot matrix analysis . clustering and classification. data analysis . Bayesian methods .substitution matrics. stastical concepts. (8 hrs) UNIT IV: .

Rastogi. (8 hrs) Text Books: 1.working with FASTA. Pearson Eduction[BB}. [RMR]PHI 2. 2.P.UNIT V : Bioinformatics tools Introduction . working with BLAST.Rastogi -'Bioinformatics-Methods & Application".S. filtering and capped BLAST. Reference Books: 1.Mendiratta. "Bioinformatics Computing". Bryan Bergeron.N. Imtiyaz Alam Khan(IAK) "Elementery Bioinformatics". Indu Shekhar Thakur(IST) "Environmental Biotechnology".F AST A & BLAST algorithms & comparison (8 hrs) UNIT VI : Further Scope Introduction to environmental biotechnology.Phanna Book Syndicate.IK International Publication.C. introduction to generic engineering. .

Architecture for Mobile Computing. General Packet Radio Service (GPRS): . Internet-The Ubiquitous Network. Gsm Addresses and Identifiers. PLMN Interfaces. Dialogue Control. GSM Entities.Tier Architecture. Middleware and Gateways. Design Considerations for Mobile Computing. Mobile Computing Through Telephony: Evolution of Telephony. Internet Protocol Version 6 (Ipv6) . Mobile Computing through Internet. Global System For Mobile Communications (GSM): Global System for Mobile Communications. . Wireless Broadband (WiMAX) . Short Message Service (SMS): Mobile Computing over SMS. Multiple Access Procedures. Authentication and Security. . Three . Accessing the SMS Bearer. History of Internet. Standards. Network Aspects in GSM.414445:. Networks.Mobile Computing (Elective-I) Teaching Scheme: Examination Scheme: Lectures: 4 Hrs/W eek Theory: 100 marks Unit 1 Introduction: Mobility of Bits and Bytes. Wireless-The Beginning. Developing Mobile Computing Applications. Short Message Services (SMS) . Unit 2 Emerging Technologies: Introduction. . GSM Frequency Allocation. 'GSM Architecture. Bluetooth. Value Added Services through SMS. Mobile IP. Mobile Computing Through Telephone. Application and Services (Contents). Telephony Application Programming Interface (TAP I). Mobile Computing. Making Existing Application Mobile-Enabled. Radio Frequency Identification (Rfid) .Standard Bodies Mobile Computing Architecture: History of Computers. Unit 3 . Java Card. Security in Mobile Computing. Call Routing in GSM.Voice XML. developing an IVR Application .

Mobility in Wireless LAN. Technologies and Interfaces for IN. Deploying Wireless LAN. A Peek under the Hood: Hardware Overview. Optional Packages.Cdma versus GSM . W AP. Localization. Unit 5 Programming for the Palmos:. IEEE 802. Security on the Symbian OS. Moving Beyond the Desktop.Introduction. Billing and Charging in GPRS . Application Development. SS#7 Signaling. Wireless Application Protocol (W AP) : Introduction. Applications for GPRS . Applications on 3G. Programming for CLDC . Communication in Palm OS . Design Constraints in Applications for Handled Devices. Controls and Compounds Controls. Intelligence in the Networks. Enhancements in the Current Release. Data Services in GPRS . ls-95. Fundamentals of Call Processing. Communication in MIDP. Applications for Symbian . Mobile Phones . Limitations of GPRS . Softswitch . Record Management System.11 Standards. Unit 6 Wireless Devices with Windows CE: . GPRS Network Architecture. Security Considerations in MIDP. CDMA AND 3G : Introduction. Wireless LAN Architecture. Multimedia. The Three-Prong Approach to Java Everywhere. Wireless LAN Advantages. Client programming: Introduction. Introduction. GPRS Network Operations. GPRS Applications. WiFi Versus 3G: Internet Networks and Interworking: Introduction.PDA . Active Objects. Wireless Devices With Symbian OS: Introduction to Symbian OS . Third Generation Networks. Wireless LAN Security. Multimedia. Java 2 Micro Edition (J2ME) Technology. 15 12ME: Java in the Handset. UI design issues. GUI in MIDP . GPRS and Packet Data Network. MMS’. Symbian OS Architecture. Unit 4 Wireless Lan: Introduction. Spread-Spectrum Technology. IN Conceptual Model (INCM) . Mobile Ad hoc Networks and Sensor Networks. Programmable Netvvorks . History of Palm OS Architecture.Wireless Data.

Trust. 5. Yavagal. 2. The remaining two assignment are to be study assignment. Comparision between H. Write a 'C.Introduction. "Mobile Communication" 2)Yi-Bing Lin. Session Initiation protocol (SIP) .I Teaching Scheme: Examination scheme: Practical: 4 Hrs/ Week T. Security techniques and Algorithms .Applications and Service Creation)".W : 50 marks Practical: 50 marks. K Talukder and Roopa R. Security Issues in Mobile Computing: Introduction. 4. Write recursive queries & evaluate them Implement any data or mining algorithm. Text Book: Asoke. Different Flavors of Windows CE .0 Implement any A of the assignments using any CASE tool. Mobile VoIP.Adison Wesely.Computer Lab Practical. Design use case diagram. Write a 'c' program to implement R trees for any database application. Oral : 50 marks Advance Database Management 1. "Wireless and Mobile Network Architecture" 414446:. "Mobile Computing (Technology . Windows CE Development Environment.TA T A McGRAW HILL Reference: 1 )--Jachan Schiller . H.323 Framework for Voice over IP. Real Time Protocols. Voice over IP Applications.Security Frameworks for Mobile Environment. 6.0 or 2.Public Key Infrastructure .security Protocols . Windows CE Architecture. call Routing. Explore & implement SQL query optimization or query evaluation based on any database 3. . Security Models . IP Multimedia Subsystem(IMS) . Voice over Internet Protocal and Convergence: Voce over IP .323 and SIP. Information security. program for multiple transaction single database. Design database using XML & evaluate queries. 1. Wiley. Object Oriented Modeling & Design A 71 following assignments are to be done with any hypothetical system using UML 1. Convergence Technologies. Evaluate queries involving stored procedures & triggers based on any database.

The aim of project is to allow the student to study the feasibility of implementing project and planning project. Student will submit term work in form of a journal which will have full documented report of each mini project. Design sequence & communication diagrams. Testing with complete documentation and user interface. 6. . studying existing system. Design class diagram & composite structure diagram. These sheets must be available during term work assessment.Oracle / Access application using automated testing tool. Design activity diagram & state diagrams. Test a ready VB. With life cycle testing and as an executable package. Software Testing & Quality Assurance 1. 3. Staff in charge will maintain a full record of continuous assessment with grades. The project must involve the detail Software design Specification. Candidate will have the C.Project work Teaching Scheme: Practical: 2 Hrs/ Week The Student will undertake one project over the academic year. Candidate will submit journal for term work assessment by Internal & external examiner. Practical examination will be based on the mini project assignment. 5. Oral examination will be on the tern1 work submitted by candidate. design development & component diagrams. 3. Data Structure Layout. . Staff in charge will prepare 6 mini project which will based on Advance Data Base Management (ADBM) Which will be implemented supported by Object Oriented Modeling & Design (OOMD) arid testing. of the mini project to demonstrate of necessary. . Design interaction overview diagrams. which will involve the design of a system or sub system in the area of Information Technology and Computer Science and Engineering. Test a ready 'C' program using automated testing tool. Generate test cases for a ready Database with frontend application using manual testing. 414447:. File Design. 2.2. Practical examination will not be on drawing only UML diagram.D. 4. tools available and state of art software testing procedures and technology with use of case tools.

System Operations And Maintenance. Business and marketing support. The group will submit at the end of Semester II. Platform choice use. The project report contains the details. System design.rest repot as per A TP. The preliminary report must minimally contain literature survey. Business & Marketing Support System: Status. plan of execution. 2.The project will be undertaken preferably by a group of at least 4 students who will jointly work and implement the project.members assigned) and submit the name of the project with a synopsis of not more than 2 to 3 pages not later than the second week of August in the academic year. References. Service request & change: Technology.code documentation . project specification. 7. SRS. Category. Markets of operations. Class Diagrams etc. System implementation . . Oral examination will be based on the project work completed by the candidates. organization structures of provider. trends. 6. . Preliminary report must also be presented during the oral examination. definitions. 3. Teaching scheme: Examination Scheme: Lectures: 4 Hrs/W eek Theory: 100 Marks Unit 1 Operations. 4. market drivers for support system. documentation. I.1 copy for the Institute and 1 copy of each student in the group for certification. 414448:. 5. Problem definition and requirement specification. Appendix tools used. Test result and procedure . This is compulsory for the grant of first term. acceptance test procedure ( A TP ). 8. Documentation will use UML approach \\ith presentation. trends with support system. preliminary design. System definition-requirement Analysis.dataflow diagrams/ algorithm. protocols used. (A) The workable project. A preliminary report by the group must be submitted and certified at the end of Semester I. (B) Project report in the form of bound journal complete in ail respect . Use Case. Conclusions. The term work will be accessed by the examiners in consultation with the guide. The group will select a project with approval of the guide ( Staff.

security management. John Wiley. customer care. calls rating. telecommunication oriented management protocols. service configuration. enterprise oriented management protocols. order processing. Network operational management. service order process. web for telecom provider. Unit 6 . . job profile & responsibilities. IP billing. LDAP. Economics of billing. Invoicing. suite framework product for support system. discounting. Workforce management for service provider: Building team. monitoring applications for service level agreement. Network planning. . Unit 1: Introduction. Theory: 100 Marks . middleware solutions. customer QOS management. documentation & management: Management frames works. Planning. Unit 5 Support. Reference Books: Komel Terplan.Unit 2 Management Protocol: Product. enabling new technologies for work force management bench marking.Distributed Systems Teaching scheme: Examination Scheme: Lecturers: 4 Hrs/ Week. sales process. Unit 3 Customer Care & Billing Process: Customer care. customer interface. service creation. "OSS Essentials: Support systems solutions" 414449:. Unit 4 Inventory management process: Inventory.& service their portfolio.

Case Studies on CORBA. Fundamental Models. Layered Protocols: Lower Level. Distributed Transaction. characteristics. design issues. "Distributed Systems . Logical clocks. Distributed Objects: RPC & LRPC. Time and Global States: Clock Synchronization. Comparisons. Removing unreferenced entities Studies: DNS Directory. goal hardware and software concepts. Interprocess Communication: Message oriented Communication. Architectural Model. Grid and Clusters. Locating Mobile Entities. mutual "exclusion. Andrew S. Text Books: 1.Introduction to distributed Systems. resource sharing and the web. Stream Oriented Communication. Global Name Service. Unit 5: Fault Tolerance. challenges. Unit 6: Case Studies. Coordination: Election Algorithms. Name Services: Name Entities. examples of distributed systems. Reliable client server communication. Tanenbaum & Maarten van Steen. CODA. Events and Notifications. Unit 3: Distributed File Systems. Process Resilience. Reliable group communication Distributed Commit and Recovery. Other OS. X 500 DS Unit 4: Synchronization. and Client Server Models. System Models: Introduction. Distributed File Systems: SUN NFS. global state. Remote Method Invocation. Transport Level and Higher-level Protocols. Unit 2: Communication.

Information Retrieval. George Coulouris. Theory: 100 Marks.Concepts and Design". .Concepts and Design" Publisher: Pearson (LPE) Reference Book: 1. "Distributed Operating Systems . Teaching scheme: Examination Scheme: Lecturers: 4 Hrs/ Week.Principles and Paradigms". Publisher: PHI. By Pradeep K. 414450:. "Distributed Systems . Jean Dollimore & Tim Kindberg. Publication: PHI. Sinha. 2.

Measures Of Association. Boolean Model. Single Pass Algorithm. Distributed IR . Unit 1 Basic Concepts of IR. Search Engines. Luhn's ideas. Probabilistic Indexing. standards. one dimensional time series. Inverted file. Hrs 7 Unit 4 Libraries & Bibliographical system. representation & access. automatic feature extraction Hrs 8 Unit 6 Searching the Web.MIMD Architectures. Parallel IR . Fuzzy Set Model. Boolean search. organization. OPACs. & access to information items.Objective: To deal with IR representation. Source Selection. Automatic Classification. IR system block diagram. Conflation Algorithm. Signature files. IR Models. Rochhio's Algorithm and Dendograms. Evaluation of XML Queries Hrs 10 Unit 3 Performance Evaluation – precision and recall alternative measures reference Collection (TREC Collection) Users Interface & Visualization HCI Concepts.Collection Partitioning. Basic concepts.Online IR system. Vector Model. Ring Structure. storage. X Query. XML Data Model. query languages Indexing & searching. Two dimensional color images. Query Processing Hrs 8 . Characterizing the Web. Information access process. Indexing and Index Term Weighing. Suffix trees & suffix arrays. Different Matching Coefficient. Classification methods. cluster based retrieval. prototypes. Cluster Hypothesis.data modeling. Digital librariesArchitecture issues. Hrs7 Unit 5 Multimedia IR models & languages. document models. Automatic Text Analysis. Single Link Algorithm. Challenges. projects & interfaces. Meta searchers. Browsing. starting query specification. serial search. Data Retrieval & Information Retrieval. Hrs8 Unit 2 File Structures. Matching Function.generic multimedia indexing approach. Clustering Algorithms.

"Database Management Systems".uk) Reference Books: 1. "Information Retrieval".Rijsbergen.gla. (www. C. Yates & Neto. -Hill Publication Proceedings of International Symposium on machine translation NLP & TSS . "Modern Information Retrieval". Pearson Education.Text Books : 1.J. 2.ac.dcs. Ramkrishan.Mcgraw.

Generate-And-Test. prolog in AI Architecture of expert system. State Space Search. Non. TMS UNIT III Perception Definition & types of Perception. Components of a planning system. Failure-driven learning. scripts & conceptual dependency. Production System. Hill Climbing. Block Diagram. Criteria for Success. Waltz algorithm. characteristics of Intelligence. Case Studies of an expert system. Semantic nets.Steps in the process. Semantic Analysis. Block world. Learning in Neural Networks Perceptrons. Heuristic search techniques . cnstraint satisfaction & Game Playing Minmax Search procedure. learning languages.Linear planning. Goal stack Planning. least commitment stratagy. Knowledge representation in predicate logic. AI Techniques. Knowledge Acquisition. Discourse and pragmatic processing UNIT IV: Planning Introduction to planning. Problem Characteristics.410451:. Inference rules in prepositional logic . learning by Being told. Understanding . Waiting for quiescence. learning by exploration. explanation.beta Cutoffs. planning versus programming. How prolog answers questions. Back propagation Networks. natural deduction Fuzzy Logic. Approaches & Issues in Knowledge Representation Prepositional Logic. Speech Recognition. Hierarchical planning. Alpha . Recursive rules. . NLP . Application of Neural network_ UNIT VI AI languages & Expert systems Introduction to prolog. unsupervised learning.What is understanding? Understanding as constraint satisfaction. UNIT V : Learning & Neural Networks Introduction. syntactic processing. learning as Induction. frames. Vision. resolution. syntax & meaning of prolog programs. UNIT II: Knowledge representation. expert system shell.Artificial Intelligence (Elective-II) Teaching Scheme: Examination Scheme: Lectures: 4 Hrs/Week Theory: I 00 Marks Unit I: Artificial Intelligence Concepts Introduction to AI.

tvlohon. . truth maintenance system using prolog 5. Krishna Mehrotra. Same algorithm can be implemented for different problems 3.Reference: 1. Implementation of minmax search procedure for game playing 6. "Education PROLOG-programming for Artificial Intelligence" 410457:. Unification algorithm implementation 4. Eugane Charniak Frew Mc Dermott. Development of expert system using prolog Guidelines 1. Sal_jay Rawika K. "Artificial Neural Network" 3. Elaine Rich and Kerin Knight. implementation of A * algorithm using 8 puzzle problem (sliding files) 2. "Artificial Intelligence" 2. "Introduction to artificial intelligence" 4. Oral examination should based upon the assignment on the term work. Ivan Bratko . Students can be given choice of language(c/c++/Java) for implementation 4. there is a variation in assignment programs 2. Passing method implementation using prolog 7. Staff member should frame assignments in such a way that. Implementation of AO* algorithm 3.Artificial Intelligence Lab Teaching Scheme: Examination Scheme: Practical: 2 Hrs/W eek Term Work: 50 marks Oral : 50 marks Staff members should frame any six assignment based on following topics: I.Pearson.

cost function and hard deadline . Protocol Contention based. Maintaining serialization consistency. Deadline based. Transaction priorities. Fault tolerance scheduling.AlgorithmsRM. Overloading & Generics. Typical real time applications . Performability .410451:.MOS. Elements of Multiprocessor scheduling algorithm. Tools & Databases Language Characteristics. Issues in real time computing .properties of performance measure.Sending messages.Estimating program real time. Real Time versus General Purpose databases. Unit 4: Real Time Communication Network topologies. Structure of RTS.II) Teaching Scheme: Examination Scheme: Lectures 4 Hours /Week Theory: I 00 Marks Objectives: To get an overview of design and evaluation issues of RTS. Two phase approach to improve predictability. Error handling. .EDF. Main memory databases.Digital Control .EdDF. CSMA based DCR.. Task Assignment . Use of POSIX Programming API in RTS. Databases for hard Real Time Systems. Hierarchical Round Robin. Token based. Unit 3: Programming Languages.Constraints. pipelining.Signal Processing Characterizing RTS. MACRT LAN.FAB. Fault tolerant Routing. Basic definition of databases. dependencies. Unit 2: Task Assignment and scheduling Uniprocessor scheduling algorithms-RM.Real Time Systems (Elective . Control structures. Aborts. Real Time Communication and Operating Systems. Data typing. Performance measures of RTS . Analysis of source code. Concurrency control issues. Unit 1: Introduction to RTS Definition of RTS.IRIS. Facilitating hierarchical decomposition. The Pooled Bus. Packages. Network architecture issues. Precedence conditions. Real Time communication with periodic and a periodic messages. Stop & Go Multihop Protocol.

a. Time.Real Time Systems. C. 410451:. During the night for a certain period of time.Liu .Real Time Systems .Resource Management in Real Time Systems & Network-MIT ISBN. yellow for Y seconds and red for R seconds. b.Real Time Computer Control.Unit 5: Real Time Operating Systems Time services and scheduling mechanism. Jane W. Redundancy. c. Develop an object oriented design. . Consider an intersection with two. Stuart Bennet . fault tolerance synchronization in hardware and software. Pearson Education. Data diversity. the intersection will automatically suspend normal service and its lights will flash yellow.Manimaran .Shin . Make suitable assumptions and state them clearly. Design and develop the code for controlling traffic lights at an intersection. processor Reserves and Resource Kernel.MC Graw Hill International Edition 2. Reliability models and hardware redundancy and software error models. Using programming language. Analyze the source code to estimate the execution time of different modules. Integrated failure handling. 2.81-203-2682-2 4. c. Define accomplishment levels for the system and calculate its performability. Teaching Scheme: Examination Scheme: Practical: 2 HrslWeek Term Work: 50 marks Oral: 50 marks 1. Predictability of general purpose OS Unit 6: Fault Tolerance and Reliability Fault types. Reversal checks.Hardware. detection. Krishna. Malicious or Byzantine failures.Sivaraman Murthy & G.S. Pearson Education Asia 2001 3. Open Systems Architecture. Capabilities of commercial RTOS. C. Software. References : 1. Performance analysis and Run time estimation of the System a. Information redundancy. two-way streets.M. A traffic light will normally be green for G seconds. KaI1g G. error containment. Make suitable assumptions and state them clearly. Asia 2003.Real Time System Lab. b. An Introduction.

Ways of using patterns.Software Architecture (Elective . architecture and quality attributes. 4. where missing of even a single deadline is unacceptable. Run VTCSMA for 3 different values of the virtual clock rate and the window protocol for 3 different values of the initial window size. by adding push button walk signals at the traffic intersection. Proxy. Compare their performances in tem1S of the number of packets that meet their deadlines. .II) Teaching Scheme: Examination Scheme: Lectures 4 Hours /Week Theory: 1 00 marks Objectives of tbe course: l. Introduction to Software architecture as a discipline 2. Mention the features you would provide and explain how you would implement them 410451:. Event Listener. UNIT 2: Understanding quality attributes. Study of a number of representative patterns like Singleton. Introduction to software Architecture strategies. Factory. There will be 8 such buttons in our scenario. What is software architecture. Adaptor. Documenting software architectures. While his signal is green. Introduction to current architecture approaches.3. Extend the part one of assignment 1. 3. Pipes and Filter. UNIT 1: Architecture Business Cycle. principles and expectations. why is software architecture important. A push button walk signal works as follows: whenever a person wants to cross a road. achieving quality attribute UNIT 3: Design Patterns: history. 5. Observer. Iterator. Mediator. keep the number of nodes and the sequence of packets (along with their deadlines) same. The coding can be done in any language of your choice. so that their performances can be compared. Describe how you would construct a hard real-time database. the traffic on the remaining roads should be allowed to continue as appropriate. • • • • In both cases. Make suitable assumptions if required and state them clearly. Write a report on 'Hard Real-Time Databases'. he pushes the appropriate button on his side of the road and within a time period W. his walk signal turns green. Implement the two contention based protocols taught in class-'Virtual Time CSMA' (VTCSMAL) and 'Window Protocol'. Facade.

0 Architecture.1-tar. James P. ISBN: 0-471-20459-5. Active X controls. JSF. Implementation of Conflation Algorithm. Client side technologies DHTM Java Applets. Braude. Ralph Johnson. Introduction to Java EE. Write a program to simulate the Election algorithms (both ring and bus topology) 4. UNIT 6 : Components. Len Bass. Iunknown. . 3. Message beans. EJB 3. Second' Edition (Hardcover) . a) Implement RPC b) Implement RMI having following components: Interface. Rick Kazm_ "Software Architecture in Practice".NET Remoting. Session.NET Web services Text Books: Reference Books: 1. John Vlissides Design Patterns: Elements of Reusable Object-Oriented Software (Addison-Wesley Professional Computing Series) (Hardcover) 441452:. Crume (publisher) Beginning J2EE 1. Study assignment on NFS : This should emphasize the usage of Path name resolution and mounting. Interfaces. Weaver.. Paul Clements.4: From Novice to Professional (Apress Beginner Series) (paperback) 5. Entity. Dale Rogerson. 5. .NET assemblies.UNIT 4 : Introduction to three tier and N Tier Web Architectures. Erich Gamma. James L. Server side technologies JSP. "Software Design: From Programming to Architecture" Boston Univ. UNIT 5: Types of Middleware. Introduction to .NET architecture. Application servers. Java Servlets. Implementation. Introduction to Java EE technologies like JMS. XML. "Inside Com (Microsoft Programming Series" (paperback) 4. JDBC. Kevin Muk. JAX-WS.@2004 3. DLL Servers. Richard Helm. . JXTA. 2. Simulate logical clock synchronization using any method. .Computer Lab Practical-II Teaching Scheme: Examination Scheme: Practical: 4 HrslWeek T/W: 50 marks Oral: 50 marks 1. stub procedures and client -server. Eric J. 2.

1. acceptance test procedure (ATP). Oral: 50 marks The Student will undertake one project over the academic year. The project will be undertaken preferably by a group of at least 4 student who will jointly work and implement the project. System design. preliminary design. With life cycle testing and as an executable package. Study of any recent paper on IR / search engine I Digital Libraries.members assigned) and submit the name of the project with a synopsis of not more than 2 to 3 pages not later than the second week of August in the academic year. 7. 414447:. The aim of project is to allow the student to study the feasibility of implementing project and planning project. Preliminary report must also be presented during the oral examination.1 copy for the Institute and 1 copy of each student in the group for certification. The term work will be accessed by the examiners in consultation with the guide. The group will submit at the end of Semester n. 2. (B) Project report in the form of bound journal complete in all respect . The group will select a project with approval of the guide ( Staff. The project repot contain the details. The project must involve the detail Software design Specification. (A) The workable project. which will involve the design of a system or sub system in the area of Information Technology and Computer Science and Engineering. 8. plan of execution. Problem definition and requirement specification. System definition-requirement Analysis. Data Structure Layout. File Design. 3. tools available and state of art software testing procedures and technology with use of case tools. Teaching Scheme: Examination Scheme: Practical: 6 Hrs/ Week T/W: 100 marks. Testing with complete documentation and user interface. BRS. Oral examination will be based on the project work completed by the candidates.6. . project specification. The preliminary report must minimally contain literature survey.Project work. Implementation of single pass algorithm for clustering. A preliminary report by the group must be submitted and certified at the end of Semester I. studying existing system. This is compulsory for the grant of first term. Implementation of Boolean/ Search strategy.

dataflow diagrams/ algorithm. Conclusion. References. Use Case. 5. Appendix tools used. Category. Platform choice use. Class Diagrams etc. 1 . 8. System implementation . 7.4.code documentation . Test result and procedure . protocols used. Documentation will use UML approach with presentation.test repot as per ATP. 6.

Master your semester with Scribd & The New York Times

Special offer for students: Only $4.99/month.

Master your semester with Scribd & The New York Times

Cancel anytime.