KRANTIGURU SHYAMJI KRISHNA VERMA

KACHCHH UNIVERSITY

Department of Computer Science

Semester III, IV Syllabus for Two years fulltime

Master of Science (Information Technology) [M. Sc. (IT)]
(Effective from academic year 2011)

KSKV KACHCHH UNIVERSITY BHUJ-KACHCHH

FACULTY OF SCIENCE

The Faculty has three affiliated colleges where science is being taught at UG level whereas six colleges teach BCA course. It has three PG departments on the campus viz. Department of Chemistry, Department of Earth & Environmental Science and Department of Computer Science. There are four PG courses offered at the campus viz. M.Sc. with Chemistry, Geology, Environmental Science, Information Technology and MCA.

M.Sc. (IT) 2 Years Fulltime Programme

This is a masters programme of 4 semester duration and comprises of 120 credits. Each year will be divided into two semesters. CREDIT SYSTEM A student of M.Sc. (IT) programme is required to choose different types of courses viz., core compulsory, foundation courses etc. Semester wise distribution of credits among these courses is shown in the table below.

Semester Wise Credit Distribution Semester 3: No. Course Name Credit Theory 1 2 3 3 Core Compulsory Core Elective I Core Elective II Semester-end Project 8 4 4 -6 --6 Total : z 14 04 04 06 28 Credit ( Practical) Total Credit

Semester 4: No. Course Name Credit Theory 1 Industrial Project -24+4 28 Credit ( Practical) Total Credit

The student will be awarded the M.Sc. (IT) degree after successfully earning 120 credits. For Sem I and Sem II, ONE CREDIT IN THEORY course is equivalent to classroom learning of 1 hour per week for 15 weeks whereas ONE CREDIT IN PRACTICAL requires 1 hours of performing practical/experiment per week for 15 weeks.

ELIGIBILITY CRITERIA 1. Candidates must have passed B.C.A., B.Sc., B.E. (Information Technology / Computer Science / Computer Engg.) from a university recognized by UGC. 2. A candidate who has passed an equivalent examination from any other university/examining body will have to produce Eligibility Certificate from K S K V K a c h c h h University, Bhuj (which can be obtained from the University Office) along with the application for admission in the first semester.

DOCUMENTS REQUIRED Original as well as self attested copies of 1. 2. 3. 4. 5. 6. 7. 8. S.S.C (10th) mark sheet, Passing and Trial Certificate. H.S.C. (10+2) or Equivalent Mark sheet. All graduation mark sheets. Graduation Degree or Provisional Degree Certificate. School Leaving Certificate. Migration Certificate if from another university. SC/ST/SEBC caste certificate wherever applicable. Non-Creamy Layer Certificate in case of SEBC.

ADMISSION PROCEDURE Counseling will be given to the candidates on the day of admission before actual admission takes place in each college.

SEMESTER-3 CORE COMPULSORY COURSES: ERP, Data Warehousing and Data Mining, Semester End Project 03, LAB 03. CORE ELECTIVES COURSES (ANY TWO): Cryptography and Network Security, Embedded Systems, Parallel and Distributed Systems, Artificial Intelligence.

SEMESTER-4 1 Semester duration Live/Research Project

*The decision of the Principal of the college/dean will be the last and final regarding the formation of the subject formations.

KACHCHH UNIVERSITY Faculty of Science CRITERIA FOR THE EVALUATION: EVALUATION SCHEME:

A. Theory:

1. Continuous and Comprehensive Evaluation (CCE) will be conducted by respective departments. However, they will be centrally coordinated by the faculty examination cell so that overlapping of examination schedules can be avoided.

2. CCE will have 30% weightage. It is compulsory for a student to score minimum 40 % in internal evaluation (CCE) to pass.

3. End semester examination will have 70% weightage. It is compulsory for a student to score minimum 40 % in semester end examination to pass.

4. CCE Marking Scheme for theory courses other than foundation: For each paper, 30 % of CCE may be further distributed as under: a) Seminar/Assignment/Project/Presentation : b) Internal Test: Internal Test comprises of 50 Marks and 1
1 hours duration. 2

10 Marks 20 Marks

5. CCE Marking Scheme for Lab courses : a) Lab Performance/Internal practical Test : 30 Marks

6. CCE Marking Scheme for Semester-end Project: a) Internal project paper presentation : 30 Marks

Note: The Dean, Faculty of Science is authorized to resolve any issue related to any courses or in the proposed examination structure.

Semester III Code

CSM 211 CSM 212 CSM XXX CSM XXX CSM 215 CSM 216

Title
ERP, Data Warehousing & Data Mining Mobile Computing Elective I Elective II Semester-end Project III LAB 03

Category
Core Core Elective Elective Core Core 4 4 4 4 6 6

Contact Hours

Credits
4 4 4 4 6 6

Total (Any two elective subjects to be chosen from the available)

28

Semester IV Code
CSM 221 Final Project

Title

Category
Core

Reporting
4

Industry
24

Credits

28 Total 28 (Final semester project shall be implemented by individual student based on industrial or institutional problem or research.)

M.Sc. (IT) Semester III

Sub No. Subject Name Teaching Scheme Theory Practical Lectures Per Batch * Hours/ Hours/Week Week 4 4 4 4 0 0 16 0 0 0 0 6 6 12 6 6 32 4 4 4 30 ---30 30 30 30 30 180 70 --3 hrs ---70 70 --3 hrs 3 hrs 70 70 70 520 100 100 100 700 Examination Scheme External Marks Durations Prac. /Oral

Credits

Th.

Internal Marks Prac. Total (I)

Th.

Duration

Total (E)

Grand Total (I+E)

CSM-211 ERP, Data

Warehousing & Data Mining CSM-212 Mobile Computing

4 30 30 30 ---30 30 30 70 70 70 3 hrs 3 hrs 3 hrs -------70 70 70 100 100 100

CSM-21X Core Elective I CSM-21X Core Elective II CSM-215 Semester End

Project CSM-216 LAB -003

Total

CSM 211 ERP, Data Warehousing and Data Mining

Unit. 1 Introduction Overview of Information Systems, Information Systems Hierarchy, IT in Business Intelligence, Overview of Data Warehousing, Overview of Data Mining, Overview of DR (Disaster Recovery), BCP (Business Continuity Planning), Backup, NAS, RAID. ERP and CRM Introduction, ERP/CRM/SCM systems, ERP Modules: Sales/Logistics/Inventory Management and Control/Financial Accounting/Human Resource Management/Work Flow/ SCM/CRM/Production Planning and Control etc., Applications. Demonstration Using Free Tools. Data Warehousing Architecture, Design, Hardware, Software, Applications. Demonstration Using Free Tools. Data Mining Machine Learning, Overview of Searching and Sorting Algorithms, Data Mining Techniques, Mathematical Modeling, Applications. Demonstration Using Free Tools. 25 %

Unit. 2

25 %

Unit. 3

25%

Unit. 4

25 %

References: ERP Demystified, Alexis Leon, TMH

CSM 211 ERP, Data Warehousing and Data Mining Internal Exam Structure Maximum Marks 50 Questions Question 1 Question 2 Question 3 Question 4 Question 5 Duration 1.5 Hours Section Attempt any two out of three. Attempt any two out of three. Attempt any two out of three. Attempt any two out of three. Attempt any two out of three. Passing Marks 20 Marks 10 Marks 10 Marks 10 Marks 10 Marks 10 Marks

1. There are 5 questions each carrying 10 marks.

External Exam Structure Maximum Marks 70 Duration 3 Hours Passing Marks 28

1. There are 5 questions each carrying 14 marks.

Questions Question 1 Question 2 Question 3 Question 4 Question 5

Section Attempt any two out of three. Attempt any two out of three. Attempt any two out of three. Attempt any two out of three. Attempt any two out of three.

Marks 14 Marks 14 Marks 14 Marks 14 Marks 14 Marks

10

CSM 212 Mobile Computing

Unit. 1 Introduction 25 Wireless Transmission: Frequencies, Modulation, Multiplexing, Spread Spectrum, % Cellular System, Wireless Networks: Bluetooth, Infrared, Radio, Infrastructure and Ad-Hoc Networks, IEEE 802.x, GSM, GPRS/EDGE, 2G/3G Networks, UMTS/HSDPA, CDMA, Wireless Devices: Power Management, SIM, Mobile IP. Introduction to J2ME 25 Understanding J2ME, Introduction to MIDlets, Building User Interfaces, Storing % Data, Accessing Files and Other Data, Java Mobile Game API, Xlets and Personal Basis Profile, Remote Method Invocation. Introduction to Android Platform 25% Android Platform and Tools, Activities and Intents, Android User Interface, Views, Menus, Data Persistence, Messaging and Networking, Location Based Services, Publishing Android Applications. Introduction to Qt and Symbian Platform 25 Symbian OS, Introduction to Qt, Signals and Slots, Qt Object Model, User % Interface, System, Communication, Qt Mobile APIs: Contacts, Location, Messaging, Multimedia, System Information.

Unit. 2

Unit. 3

Unit. 4

Reference:
1. 2. 3. 4. Mobile Communications, Jochen Schiller, Addison-Wesley Beginning Java ME Platform, Ray Rischapter, Apress Beginning Android Application Development: Wei-Meng Lee, Wrox Publications Qt for Symbian: Frank H.P. Fitzek, Tommi Mikkonen, Tony Torp, John Wiley & Sons

11

CSM 212 Mobile Computing Internal Exam Structure Maximum Marks Duration 50 1.5 Hours There are 5 questions each carrying 10 marks. Questions Question 1 Question 2 Question 3 Question 4 Question 5 Section Attempt any two out of three. Attempt any two out of three. Attempt any two out of three. Attempt any two out of three. Programs (Two out of Three) Passing Marks 20

Marks 10 Marks 10 Marks 10 Marks 10 Marks 10 Marks

External Exam Structure Maximum Marks 70 Duration 3 Hours Passing Marks 28

There are 5 questions each carrying 14 marks.

Questions Question 1 Question 2 Question 3 Question 4 Question 5

Section Attempt any two out of three. Attempt any two out of three. Attempt any two out of three. Attempt any two out of three. Programs (Two out of Three)

Marks 14 Marks 14 Marks 14 Marks 14 Marks 14 Marks

12

CSM 213 Cryptography and Network Security (Core Elective) Unit. 1 Introduction Computer Security Concepts, OSI Security Architecture, Security Threats, Virus, Malware, Trojan, Birthday Attack, Brute Force, Security Mechanisms, History and Overview of Cryptology. Symmetric Ciphers Classical Encryption Techniques: Symmetric Cipher Model, Substitution Techniques, Transposition Techniques, Rotor Machines, Enigma, Steganography. Block Ciphers: Principles, Data Encryption Standard/ 3DES, DES Operation, DES Strength Advanced Encryption Standard (AES), Structure, Round Functions, Key Expansion Asymmetric Ciphers Prime Numbers, Fermats Theorem, Eulers Theorem, Primality Test, Chinese Remainder Theorem, Discrete Logarithms, Principles of Public Key Cryptosystems, The RSA Algorithm, Diffie-Hellman Key Exchange, ElGamal Cryptosystem, Elliptic Curve Cryptography, Pseudorandom Number Generation based on Asymmetric Cipher, Cryptographic Hash Functions, Secure Hash Algorithm, Message Authentication Codes, Digital Signatures Network and Internet Security Key Distribution, X.509 Certificates, Public Key Infrastructure, Web Security Issues, Secure Sockets Layer (SSL), Transport Layer Security (TLS), HTTPS, Secure Shell (SSH), Wireless Network Security Overview, Email Security: PGP, S/MIME, DKIM. Scams and Cyber Laws DoS and DDoS attacks, CAPTCHA, Spam, Phishing, Ponzi Schemes, Indian IT Act 2000 with subsequent Amendments. References: 1. Cryptography and Network Security: Principles and Practice, William Stallings, Pearson. 2. Applied Cryptography Applied Cryptography, Bruce Schneier, Willey. 10 %

Unit. 2

30 %

Unit. 3

30%

Unit. 4

30%

13

CSM 213 Cryptography and Network Security (Core Elective) Internal Exam Structure Maximum Marks Duration 50 1.5 Hours There are 5 questions each carrying 10 marks. Questions Question 1 Question 2 Question 3 Question 4 Question 5 Section Attempt any two out of three. Attempt any two out of three. Attempt any two out of three. Attempt any two out of three. Programs (Two out of Three) Passing Marks 20

Marks 10 Marks 10 Marks 10 Marks 10 Marks 10 Marks

External Exam Structure Maximum Marks 70 Duration 3 Hours Passing Marks 28

There are 5 questions each carrying 14 marks.

Questions Question 1 Question 2 Question 3 Question 4 Question 5

Section Attempt any two out of three. Attempt any two out of three. Attempt any two out of three. Attempt any two out of three. Programs (Two out of Three)

Marks 14 Marks 14 Marks 14 Marks 14 Marks 14 Marks

14

CSM 214 Embedded Systems (Core Elective)

Unit. 1 Introduction 30 % CISC, RISC, Instruction Set, Logic Gates, Number Systems, Microprocessor and Microcontroller. Memory: PROM, EPROM, EEPROM. Industrial Control Systems: DCS, PLC, SCADA. Conductors, Semi-Conductors, Insulators, Ohms Law, Resistors, Transistor, Diode, Capacitor, Sensors, Switches, Relay, ADC, DAC. VLSI, Moores Law. Embedded Systems Architecture 25 % ISA, Introduction to ARM, ATMEL, ParallaX, PIC Microcontrollers. 8051 Architecture, SoC, I/O Ports, External Memory, I2C. Introduction to Real Time OS 15% The need, Hard and Soft Real Time OS, Functions, Applications, Examples of Free and Proprietary Distributions e.g. Clinux, Android, QNX, RTLinux, VxWorks etc. Interfacing Microcontrollers 30 % Getting inputs from Switches, Matrix Keypad, Serial Port, Analog and Digital Sensors etc. Outputting to Displays, Serial Port, Buzzer etc. Interfacing Ethernet and Secondary Storage Devices.

Unit. 2

Unit. 3

Unit. 4

References: 1. Introduction to Microprocessors and Microcontrollers, John Crisp, Elsevier. 2. The 8051 Microcontroller and Embedded Systems, M. Mazidi, PHI.

15

CSM 214 Embedded Systems (Core Elective)

Internal Exam Structure Maximum Marks Duration 50 1.5 Hours There are 5 questions each carrying 10 marks. Questions Question 1 Question 2 Question 3 Question 4 Question 5 Section Attempt any two out of three. Attempt any two out of three. Attempt any two out of three. Attempt any two out of three. Programs (Two out of Three) Passing Marks 20

Marks 10 Marks 10 Marks 10 Marks 10 Marks 10 Marks

External Exam Structure Maximum Marks 70 Duration 3 Hours Passing Marks 28

There are 5 questions each carrying 14 marks.

Questions Question 1 Question 2 Question 3 Question 4 Question 5

Section Attempt any two out of three. Attempt any two out of three. Attempt any two out of three. Attempt any two out of three. Programs (Two out of Three)

Marks 14 Marks 14 Marks 14 Marks 14 Marks 14 Marks

16

CSM 215 Parallel and Distributed Computing (Core Elective)

Unit. 1 Introduction John von Neumann Architecture, Stored Procedure Concept, John von Neumann Architecture, Scalar and Vector Processors, SMP, MPP, Pipelining, Moores Law, Flynns Classification, Amdahls Law and Gustafsons Law for Performance Measures, Evolution of Parallel Computers. Introduction to High Performance Computing, Beowulf Computing, Grid Computing, Cloud Computing. Parallel Programming PVM, MPI and OpenMP Architecture, Programming with MPI. Distributed Systems Programming Introduction to pthreads, RPC, JAVA-RMI, CORBA. Grid and Cloud Computing Introduction to Cloud Computing, Grid Computing. Introduction, Web Services, SOAP, XML, IDL, WSDL, WSRF, REST. Example Grid and Cloud Services, Globus, Condor, BOINC, AppEngine, Amazon EC2 etc. 30 %

Unit. 2 Unit. 3 Unit. 4

25 % 25 % 20 %

References: 1. J2EE Bible, James McGovern, Willy. 2. Java Web Services in a Nutshell, Kim Topely, OReilly. 3. Grid 2, Ian Foster, Carl Keseelman, Morgan Kaufmann. 4. MPI Complete Reference.

17

CSM 215 Parallel and Distributed Computing (Core Elective)

Internal Exam Structure Maximum Marks Duration 50 1.5 Hours There are 5 questions each carrying 10 marks. Questions Question 1 Question 2 Question 3 Question 4 Question 5 Section Attempt any two out of three. Attempt any two out of three. Attempt any two out of three. Attempt any two out of three. Programs (Two out of Three) Passing Marks 20

Marks 10 Marks 10 Marks 10 Marks 10 Marks 10 Marks

External Exam Structure Maximum Marks 70 Duration 3 Hours Passing Marks 28

There are 5 questions each carrying 14 marks.

Questions Question 1 Question 2 Question 3 Question 4 Question 5

Section Attempt any two out of three. Attempt any two out of three. Attempt any two out of three. Attempt any two out of three. Programs (Two out of Three)

Marks 14 Marks 14 Marks 14 Marks 14 Marks 14 Marks

18

CSM 216 Artificial Intelligence (Core Elective)

Unit. 1 Introduction Overview, scope, history and applications of AI, Probability Theory, Matrix Algebra. Searching Natural Language Processing Game Playing Learning, Automated Reasoning Introduction to LISP Computer Vision, Pattern Recognition 20 %

Unit. 2 Unit. 3 Unit. 4 Unit. 5 Unit. 6 Unit. 7

15 % 10 % 10 % 15% 15% 15%

References: 1. Artificial Intelligence: A Modern Approach, Stuart Russell and Peter Norvig, Pearson.

19

CSM 216 Artificial Intelligence (Core Elective)

Internal Exam Structure Maximum Marks Duration 50 1.5 Hours There are 5 questions each carrying 10 marks. Questions Question 1 Question 2 Question 3 Question 4 Question 5 Section Attempt any two out of three. Attempt any two out of three. Attempt any two out of three. Attempt any two out of three. Programs (Two out of Three) Passing Marks 20

Marks 10 Marks 10 Marks 10 Marks 10 Marks 10 Marks

External Exam Structure Maximum Marks 70 Duration 3 Hours Passing Marks 28

There are 5 questions each carrying 14 marks.

Questions Question 1 Question 2 Question 3 Question 4 Question 5

Section Attempt any two out of three. Attempt any two out of three. Attempt any two out of three. Attempt any two out of three. Programs (Two out of Three)

Marks 14 Marks 14 Marks 14 Marks 14 Marks 14 Marks

20

CSM 221 Industrial Project (1 Semester Live/Research Project)

Students have to individually do Information system development/reengineering work and/or design work or software development work in any organization/ Company/institute to acquire industry experience or to conduct research in the field of Computer Science or Information Technology. Following could be the possible alternatives for the projects. 1) Development of a system for an IT/ITES company local firm or institutional or government department. 2) Development of a system for a university or students own college. 3) Development of Research Application. Project work includes few or all of the phases of system development life cycle. Like - Analysis of a system - Designing, Source Coding - Documentation - Implementation & - Updating in system (if Any)

21