• Share
  • Email
  • Embed
  • Like
  • Save
  • Private Content
Student kit MCA-V
 

Student kit MCA-V

on

  • 1,792 views

 

Statistics

Views

Total Views
1,792
Views on SlideShare
1,792
Embed Views
0

Actions

Likes
0
Downloads
14
Comments
0

0 Embeds 0

No embeds

Accessibility

Categories

Upload Details

Uploaded via as Microsoft Word

Usage Rights

© All Rights Reserved

Report content

Flagged as inappropriate Flag as inappropriate
Flag as inappropriate

Select your reason for flagging this presentation as inappropriate.

Cancel
  • Full Name Full Name Comment goes here.
    Are you sure you want to
    Your message goes here
    Processing…
Post Comment
Edit your comment

    Student kit MCA-V Student kit MCA-V Document Transcript

    • Course Specification Institution D.A. University, Indore College/Department School of Computer Science & Information Technology Code Subject L T P C Internal Practical/Projec End Total t Sem CS-521 Design and Analysis of 3 1 2 5 30 20 50 100 6 Algorithms CS-662 Mobile and Wireless 3 1 0 4 40 - 60 100 3 Systems CS-440 Enterprise Resource 3 1 0 4 40 - 60 100 9 Planning CS-541 Data Mining and 3 1 4 6 30 20 50 100 3 Warehousing Project 4 Comprehensive Viva 4 2 7 CS-5216 Design and Analysis of algorithms 1. Course title and code: Design and Analysis of algorithms CS 5216 2. Credit hours 05 3 Program(s) in which the course is offered (If general elective available in many programs indicate this rather than list programs): M.C.A. 4. Name of faculty member responsible for the course : Mr. Deepak Abhyankar 5. Level/year at which this course is offered: M.C.A. (V) 6. Pre-requisites for this course (if any) Data Structures, C language 7. Co-requisites for this course (if any): None 8. Date of approval of the course specification within the institution: Since beginning of the courses 9. Location if not on main campus: Main Campus
    • B Aim and Objectives 1. Aim of the Course: The aim of the course is to make students able to design elegant algorithms and to be able to analyze them. Upon completion of this course the student should be able to: 1. Apply the algorithm analysis and algorithm design techniques to solve problems; 2. Have a sense of the complexities of various problems in different domains. 2. Briefly describe any course development objectives that are being implemented. (e.g. increased use of IT or web based reference material, changes in content as a result of new research in the field): Design and analysis of algorithms is a heavily researched discipline. We will try to incorporate latest developments in the area of subject by referring research papers while teaching the course. C. Course Description CLR: Cormen, Leiserson, and Rivest. Algorithms, MIT Press 2001 Class Schedule Week TOPIC READING Order Analysis: Objectives of time analysis of algorithms; Big-oh and CLR ch1, 1 Theta notations. ch2, ch3 Assignments: all exercises of CLR ch1, CLR ch2, CLR ch3 Master Theorem and its proof, solution of divide and conquer CLR ch4 2 recurrence relations Assignments: all exercises of CLR ch4 3 Searching, Sorting and Divide and Conquer Strategy: CLR ch6, Linear Search, Binary Search ch7 Assignments: all exercises of CLR ch6, ch7 4 Searching, Sorting and Divide and Conquer Strategy: CLR ch 8, Merge-sort; Quick-sort with average case analysis. Heaps ch 9 and heap-sort. Lower bound on comparison-based sorting and Counting sort. Assignments: all exercises of CLR ch8, ch9 5 Dynamic Programming: methodology and examples (Fibonaci CLR ch 15 numbers, Knapsack problem and some other simple examples ) Assignments: all exercises of CLR ch 15 Dynamic Programming: Longest integer subsequence, Longest CLR ch 15 6 common subsequence ,Weighted interval scheduling Assignments: Presentation on CLR ch 15
    • Greedy Method: Methodology, examples (lecture Scheduling, process CLR ch 16 7 scheduling) and comparison with DP (more examples to come later in graph algorithms) Assignments: all exercises of CLR ch 16 8 Greedy Method: Knapsack problem and some other CLR ch 16 simple examples Assignments: Presentation on CLR ch 16 9 Graph Algorithms: Basics of graphs and their representations. BFS. CLR ch 22, DFS. Topological sorting. ch 23 Assignments: all exercises of CLR ch 22, ch 23 10 Minimum spanning trees (Kruskal and Prim'salgorithms and brief CLR ch 24, discussions of disjoint set andFibonacci heap data structures). Shortest ch 25 Paths (Dijkstra, Bellman-Ford, Floyd-Warshall). Assignments: all exercises of CLR ch 24, ch 25 11 Hard problems and approximation algorithms. Problem CLR ch 34 classes P, NP, NP-hard and NP-complete, deterministic and nondeterministic polynomial-time algorithms. Assignments: all exercises of CLR ch 34 12 Approximation algorithms for some NP-complete problems. CLR ch 34 Assignments: all exercises of CLR ch 35 13 Revision 14 Revision E Learning Resources 1. Required Text(s). Cormen, Leiserson, and Rivest. Algorithms, MIT Press 2001 2. Essential References ALGORITHMS IN C++ by Robert Sedgewick (Pearson Education)2008 3- Recommended Books and Reference Material (Journals, Reports, etc) (Attach List) IEEE & ACM Journals 4-. Electronic Materials, Web Sites etc http://www.acm.org/, http://www.ieeexplore.ieee.org/Xplore/dynhome.jsp 5- Other learning material such as computer-based programs/CD, professional standards/regulations
    • CS-6623 Mobile and Wireless Systems 1. Course title and code: Mobile and Wireless Systems (CS-6623). 2. Credit hours: 04. 3. Program(s) in which the course is offered: MCA–V Semester. (If general elective available in many programs indicate this rather than list programs) 4. Name of faculty member responsible for the course: Anand More. 5. Level/year at which this course is offered: Post Graduate (MCA –V) /III year. 6. Pre-requisites for this course (if any): Computer Networks, Digital Communications. 7. Co-requisites for this course (if any) : Mobile Application Languages, MOS. 8. Date of approval of the course specification within the institution - 9. Location if not on main campus – Main Campus Aims and Objectives 1. Aims of the Course: Wireless technology has enormous potential to change the way people and things communicate. Future wireless networks will allow people on the move to communicate with anyone, anywhere, at any time, using a range of multimedia services. Wireless communications will also enable a new class of intelligent home electronics that can interact with each other and with the Internet. A wireless communications infrastructure is needed for automated highways and for sensor networks and wireless video will support applications such as distance learning and remote medicine. The course explains working of wireless systems, mobility supported, and infrastructure for mobile systems. 2. Briefly describe any course development objectives that are being implemented. (eg increased use of IT or web based reference material, changes in content as a result of new
    • research in the field) Objectives: - To familiarise students with recent wireless technology used. The course will be taught through LCD projector & laboratory experiments on communication for the first time. Therefore the objective is to develop journals for laboratory work. Course Description (Note: General description in the form to be used for the Bulletin or Handbook should be attached) A: Mobile Communications author Jochen Schiller, publication John Willy & Sons, Ltd. B: Wireless And Mobile Systems author D P Agrawal & Qing-An zeng, publication Thomson. C: Wireless Networks author P Nicopotidis, publication Addision –Wesley-An zeng publication CLASS SCHEDULE Week TOPIC READING Week 1 Overview of the emerging field of mobile computing; B -Ch 1 Historical perspectives (mainly from the perspective of radio), A-Ch 1 Land mobile vs. Satellite vs. In-building communications systems, RF vs. IR. Assignment -1 Week 2 Characteristic of Cellular Systems, Mobility support in B-Ch 5 cellular telephone networks, Personal Communications C-Ch 1 Systems/Personal Communications Networks, Mobile applications, Limitations, Health Concerns, Cordless phone. Assignment -2 Week3 Wireless Personal Area Network, Wireless Local Area C-Ch 2, 9 Network and Internet Access. Mobility management, Security. Cellular telephony as a case study in network support: hand- off, mobility, roaming, billing/authorization/authentication. Assignment -3 Week 4 Mobile communication: Fiber or wire based transmission, A- Ch 2 Wireless Transmission: Frequencies, Antennas and Signal Propagation, Modulation Techniques, Multiplexing techniques, Coding techniques. Assignment -4 Week 5 Cellular structure, Voice Oriented Data Communication: A- Ch 4 GSM, CDMA.GSM Architecture, Authentication & security, frequency hopping. Assignment -5 Week 6 Speech coding, Data communication with PCs, Wireless web B- Ch 10 browsing, Testing cellular Systems. Case Study on GSM. Assignment -6 Week 7 Satellite Systems: History, Application, and Basics of Satellite A- Ch 5 Systems: LEO, MEO, GEO, Routing, Handover, VSAT, installation & Configuration.
    • Week 8 Cyclic repetition of data, Digital Audio Video Broadcasting, A- Ch 6 Multi media object transfer Protocol, Wireless LAN topologies, requirements. Assignment -7 Week 9 Physical layer, MAC layer, IEEE802.11.HIPERLAN: Protocol A- Ch 7 architecture, layers, Information bases and networking, Bluetooth. Case Study on Wireless LAN infrastructure. Week 10 Basics of Discrete Event Simulation, Application and C-Ch 13 Experimentation, Simulation models. Case Study on Performance Evolution of IEEE 802.11 WLAN configuration Using Simulation. Assignment -8 Week 11 Economics Benefits of Wireless Networks, Wireless Data C-Ch 14 Forecast, Charging issues, role of Government, Infrastructure manufacturer, Enabling Applications. Assignment -9 Week 12 Mobile IP, goals, assumptions requirements, entities & B-Ch12 terminology, IP packet delivery, tunnelling and encapsulation, Feature & formate IPv6, DHCP, TCP over Wireless. Week 13 Characteristic of Ad Hoc networks, Applications, need for B-Ch 13 routing, routing classification, Wireless sensor networks, classification & Fundamental of MAC protocol for wireless sensor networks. Assignment -10 Week 14 Mobile operating System, file system, Process, Task, Thread, A-Ch11 ISR and IST, CODA, HTTP versus HTML.WML, XML B-Ch 15 application for wireless handheld devices. Week 15 UWB systems Characteristics, Signal propagations, B-Ch 15 technology, Mobility management for integrated systems, Current approaches for security. Assignment -11 Week 16 Revision, Discussions & End Semester Examinations. Learning Resources 1-Required Text(s) A: Mobile Communications author Jochen Schiller, publication John Willy & Sons, Ltd. B: Wireless And Mobile Systems author D P Agrawal & Qing-An zeng, publication Thomson. C: Wireless Networks author P Nicopotidis, publication Addision –Wesley. 2-Essential References(s) 1. Mobile Wireless Communications author Mischa Schwartz, publication Cambridge University Press.
    • 2. Mobile Computing Principles author Reza B’Far, publication Cambridge University Press. 3-Recommended Books and Reference Material (Journals, Reports, etc) (Attach List) 4-Electronic Materials, Web Sites etcwww.stanford.edu/class , www.iitk.ac.in 5- Other learning material such as computer-based programs/CD, professional standards/regulations Assignments: Objective : The assignment focuses on wireless and mobile Systems. The topics include digital communication with applications to next generation wireless systems. Students can have, understanding of the concepts. Format of Assignment • For each assignment , it is expected each student writes a report to :- o Explain her/his observations from the experiment/libray o Analyze the results collected from the study. o Each student is expected to analyze the issues and understand for her/his benefit. o Report submitted will consists of proper diagram with good presentation in folder. Sr No. Title of Assignments 1 Explain Amplitude Modulation with advantages & disadvantages. 2 Explain Pulse Width Modulation 3 Explain Amplitude Shift Keying 4 Explain Frequency Shift Keying 5 Explain Time Division Multiplexing 6 Explain Frequency Modulation (VCO-PLL Type) 7 Explain Study of Frequency Reuse (Simulation) 8 Explain Design of Cellular Structure (Simulation) 9 Explain Installation of V-SAT (Simulation) 10 Explain Web browsing in mobile systems 11 Explain VPN Configuration for mobile systems
    • CS-4409 Enterprise Resource Planning 1. Course title and code: Enterprise Resource Planning CS-4409 2. Credit hours : Four 3. Program(s) in which the course is offered. (If general elective available in many programs indicate this rather than list programs) MCA V semester 4. Name of faculty member responsible for the course Ms. Archana Chaudhary 5. Level/year at which this course is offered : II year of learning 6. Pre-requisites for this course (if any) Basic understanding of information systems helpful for managers. 7. Co-requisites for this course (if any) - Information systems for managers and E- commerce 8. Date of approval of the course specification within the institution 9. Location if not on main campus Not applicable B Aim and Objectives 1. Aim of the Course The objective of this course is to help students acquire the basic understanding of the major enterprise wide business processes , their integration through IT enabled applications and to develop a managerial perspective to leverage them for competitive advantage.
    • 2. Briefly describe any course development objectives that are being implemented. (eg increased use of IT or web based reference material, changes in content as a result of new research in the field) Along with the textbook, recent changes will also be incorporated in the course using web- based material. Students will also be given case studies as cases form the crux for this subject. C. Course Description WEEK TOPIC UNI T Week 1 Process view of organization : Introduction to business process, problems Unit1 of functional division, ERP-introduction. Assignment 1:Discuss manufacturing business process as regards to an enterprise. Week 2 Evolution of Enterprise applications, Technology as process enabler, Unit1 Mapping an existing process , Process redesign, new process validation. Assignment 2:Discuss accounting process as regards to an enterprise. Week 3 Approaches to process improvement: Salient features of Re- Unit2 engineering, Re-engineering initiatives, Managerial implications of process Re-engineering efforts, Kaizen. Assignment 3 : Discuss sales and distribution business process as regards to an enterprise. Week 4 Total quality management, implementing new process. Unit2 Assignment 4 : Discuss purchasing business process as regards to an enterprise. Week5 Critical success factors of re-engineering project , comparison of different Unit2 approaches. Assignment 5: Fed-Ex e-Procurement journey. Week6 Introduction to Enterprise Resource Planning: Reasons for the growth Unit3 of the ERP market, ERP packages role. Assignment 6 :Business case: ERP implementation at BPCL Week7 Enterprise application implementation projects: Rationale for ERP, Unit3 Enterprise architecture planning, Selection of an ERP vendor, Contracts with vendors, consultants and employees, ERP project management and monitoring, Pitfalls of ERP packages, ERP implementation lifecycle, Implementation methodology, organizing the implementation. Assignment 7 : Business case: ERP implementation at BPCL Week8 Overview of ERP modules, ERP market place - SAP AG, PeopleSoft , Unit3 Baan company, JD Edwards world solutions company , Oracle Corporation, ERP and related technologies. Assignment 8 : Supply Chain Applications– SCM Practices (A), Wal-Mart SCM Practices(B) Week9 Supply chain and CRM applications : Overview of supply and demand Unit4 chain, Supply chain framework, advanced planning systems. Assignment 8 : Supply Chain Applications– SCM Practices (A), Wal-Mart SCM Practices(B)
    • Week10 Introduction to CRM applications , Growth of CRM applications. Unit4 Assignment 9 : CRM Applications – CRM initiatives at 3M , Mobile CRM , Dow Chemical e-CRM Strategy. Week11 ERP package application : Detailed study of any one ERP package with Unit5 emphasis on :- Application basics , cross-sectional analysis of the other ERP systems with the application. Assignment 9 : CRM Applications – CRM initiatives at 3M , Mobile CRM , Dow Chemical e-CRM Strategy. Week12 Package architecture, understanding of the application with the Business Unit5 process reference model. Assignment 10 : Sears Logistics Management Practices. Week13 Business process integration part I Unit5 Assignment 10 : Sears Logistics Management Practices. Week14 Business process integration part I Unit5 E Learning Resources 1. Required Text(s) Enterprise Resource Planning –Alexis Leon -Tata McGraw Hill publication. 2. References Books : a)Concepts in Enterprise Resource Planning - Brady , Monk and Wagner – Thomson Learning. b)CRM at the speed of Light .- Greenberg , Paul – TMH c) The E-Marketplace : Strategies for success in B2B commerce – Raisch ,Warren D – McGraw Hill inc.2000. d)ERP strategy – Vinod Kumar Garg , Bharat Vakharia , Jaico 3- Recommended Books and Reference Material (Journals, Reports, etc) 4-.Electronic Materials, Web Sites etc www.ibm.com/solutions/businesssolutions/erp/ www.sap.com/solutions/business-suite/erp/ www.sap.com/usa/solutions/index.epx 5- Other learning material such as computer-based programs/CD, professional standards/regulations Business Process Integration Part-I and Business Process Integration Part-II
    • CS-5413 Data Mining & Data Warehousing 1. Course title and code: CS-5413 Data Mining & Data Warehousing 2. Credit hours-4 3. Program(s) in which the course is offered. MCA-V, M.Tech.(CS) 4. Name of faculty member responsible for the course- Ms. Shraddha Masih 5. Level/year at which this course is offered – Post Graduate 6. Pre-requisites for this course – Good familiarity with relational databases and programming. Basic knowledge of Data structures, Internet and web technology & Statistics. 7. Co-requisites for this course The course will be structured around a comprehensive set of computer assignments to enable you to get hands on experience. Our tool of choice will be any data mining freeware. The subject Design and Analysis of Algorithm will help to students to develop their own better mining algorithms. 8. Date of approval of the course specification within the institution 9. Location if not on main campus
    • B Aim and Objectives 1. Aim Both data warehousing and data mining are advanced recent developments in database technology which aim to address the problem of extracting information from the overwhelmingly large amounts of data which modern societies are capable of amassing. Data warehousing focuses on supporting the analysis of data in a multidimensional way. Data mining focuses on inducing compressed representations of data in the form of descriptive and predictive models. The main aim is to clear the concept and applications of data mining and data warehousing. 2. Objective • To give students a good overview of the ideas and the techniques which are behind recent developments in the data warehousing • To make students understand On Line Analytical Processing (OLAP) • Learn to create data models • Work on data mining query languages, conceptual design methodologies, and storage techniques. • Identify and develop useful algorithms to discover useful knowledge out of tremendous data volumes. Also to determine in what application areas can data mining be applied. • The data mining part of the course unit aims to motivate, define and characterize data mining as a process; to motivate, define and characterize data mining applications. • To survey, and present in some detail, a small range of representative data mining techniques and tools. C. Course Description CLASS SCHEDULE: DATE TOPIC READING Week 1 Unit 1:Introduction: Data Warehouse, Evolution, Definition, Very Chap - 1AKP, large database, Application, Multidimensional Data Model, OLTP vs Chap - 2AKP, Data Warehouse, Warehouse Schema, Data Warehouse Architecture, Lecture Notes Week 2 Unit 1:Data Warehouse Server, Data Warehouse Implementation, Chap- 2 AKP, Metadata, Data Warehouse Backend Process: Data Extraction, Lecture Notes Data Cleaning, Data Transformation, Data Reduction, Data loading and refreshing. ETL and Data warehouse, Metadata Week 3 Unit 2: Structuring/Modeling Issues, Derived Data, Schema Design, Chap- 2 AKP, Dimension Tables, Fact Table, Star Schema, Snowflake schema, FactLecture Notes Constellation, De-normalization, Data Partitioning, Data Warehouse and Data Marts. Week 4 Unit 2:SQL Extensions, PLSQL. Chap- 2 AKP,
    • Lecture Notes Week 5 OLAP, Strengths of OLAP, OLTP vs OLAP, Multi-dimensional Chap- 2 AKP, Data, Slicing and Dicing, Roll-up and Drill Down, OLAP queries, Lecture Notes Successful Warehouse, Data Warehouse Pitfalls, DW and OLAP Research Issues, Tools. Week 6 Unit 3: Fundamentals of data mining, Data Mining definitions, KDD Chap- 3 AKP, vs Data Mining, Data Mining Functionalities, From Data Lecture Notes Warehousing to Data Mining, DBMS vs DM, Issues and challenges in Data Mining. Week 7 Unit 3: Data Mining Primitives, Data Mining Query Languages. Chap- 3 AKP, Data Mining applications-Case studies. Lecture Notes Week 8 Unit 4: Association rules: Methods to discover association rules. Chap- 4 AKP, Various algorithms to discover association rules like A Priori Lecture Notes Algorithm. Partition, Pincer search, Dynamic Itemset Counting Algorithm etc. Week 9 Unit 5: Cluster Analysis Introduction : Types of Data in Cluster Chap- 5 AKP, Analysis, A Categorization of Major Clustering Methods, Lecture Notes Partitioning Algorithms, Hierarchical and Categorical clustering, Week 10 Unit 5: Decision Trees, Neural networks, Genetic Algorithm. Chap- 6 AKP, Chap- 7 AKP Lecture Notes Week 11 Unit 6: Web Mining , Web content mining, Web Structure mining, Chap- 8 AKP Text mining, Lecture Notes Week 12 Unit 6: Temporal Data Mining, Spatial Data Mining Chap- 9 AKP Lecture Notes Week13 Lab work Presentations comprising of mini projects using freeware data mining tools. Reviewing practical and assignments. Final exam Learning Resources Required Text(s)- Text Book: 1. Data Mining Techniques – ARUN K PUJARI, University Press 2. Data Mining – Concepts and Techniques - JIAWEI HAN & MICHELINE KAMBER Harcourt India. 3. Building the Data Warehouse- W. H. Inmon, Wiley Dreamtech India Pvt. Ltd.. 4. The Data Warehouse Life cycle Tool kit – RALPH KIMBALL WILEY STUDENT EDITION 2. Essential References 1. Data Warehousing in the Real World – SAM ANAHORY & DENNIS MURRAY. Pearson Edn Asia. 2. Data Warehousing Fundamentals – PAULRAJ PONNAIAH WILEY STUDENT EDITION 3. Data Mining Introductory and advanced topics –MARGARET H DUNHAM, PEARSON EDUCATION
    • 3- Recommended Books and Reference Material (Journals, Reports, etc) (Attach List) Research papers related to data mining and warehousing published in international journals. 4-.Electronic Materials, Web Sites etc Will be uploaded on www.dauniv.ac.in 5- Other learning material such as computer-based programs/CD, professional standards/regulations ASSIGNMENTS: 1. Search a voluminous data file and understand it.(hint: you may get free data from internet) 2. Replace all tabs with commas from file or vice versa. 3. Normalize the data: for each value, set the minimum value to 0 and the maximum to 100. 4. Transform the data file (text, excel etc) into database. 5. Create a subject oriented data warehouse. 6. Analysis of existing data (semantical correctness, completeness) 7. Use of free ETL tool. 8. Review of data mining tools, applications, and algorithms. 9. Describe a new application area where data mining algorithms can be applied. Description should contain application scenario, scale of the problem, existing approach, data mining algorithm that can be used and the benefits of using the algorithms. 10. Analysis of various data presentation and visualization formats. Note: Extra assignments may be given in classroom. PROJECT (Any One for one team): 1. Efficient Implementation of any data mining algorithm. 2. Design a data warehouse based on the available data. Integrate the data from the two separate data sources and import into your data warehouse. 3. Research Paper in recent developments in data mining and warehousing. 4. Data mining application using any freeware data mining tool. Deliverables: a. Project proposal: A one-page description of what you plan to do for your project, due Nov. 1st. Please include: i. Who is in your group ii. Project title iii. Brief description of the problem you'll solve or the question you'll investigate iv. What data you'll use and where you'll get it v. Which algorithms/techniques you plan to use vi. What you expect to submit at the end of the quarter
    • b. Final project write up This is a comprehensive description of your project. You should include the following: 1.Project idea 2.Your specific implementation 3.Key results and metrics of your system 4.What worked, what did not work, what surprised you, and why c. Final presentation: In the last week of class , each team presents their project to the rest of the class. The presentation should be no more than 15 minutes.