Académique Documents
Professionnel Documents
Culture Documents
Sub No.
Subject Name
Software Engineering Management Information System Advance Operating System Advance web-Technology-1 Advance Java Technology Total
Credits
4 4 6 6 6 26
Examination Scheme External Marks Durations Prac. Duration /Oral 3 hrs 3 hrs 3 hrs 3 hrs 3 hrs 35 3 hrs 3 hrs 35 3 hrs 3 hrs 35 3 hrs
KSKV Kachchh University M.Sc. (CA & IT), Non-CBCS, Semester VII CS 701, Software Engineering Internal Exam Structure Maximum Marks 50 Duration 1.5 Hours Passing Marks 20
KSKV Kachchh University M.Sc. (CA & IT), Non-CBCS, Semester VII CS 702, Management Information System Internal Exam Structure Maximum Marks 50 Duration 1.5 Hours Passing Marks 20
Unix System Administration Hand Book By: Evi Nemeth, Garth Snyder, Scott Seebass, Trent R. Hein Publication : Low Price Edition (Pearson Education Asia) Chapters : 3,4,6,9,10,20,21,22,27,28 3. For Unit 3 Linux System Administration Hand Book By: Evi Nemeth, Garth Snyder, Scott Seebass, Trent R. Hein Edition : Low Price Edition (Pearson Education Asia) Chapters : 3,4,6,9,10,20,21,22,28,29 (Practical List) 1. Make the program that demonstrate the use of fork () system call. 2. Make program that demonstrates the use of getPid (), getppid (),getgid () function. 3. Prepare a one orphan process and also check for its parent process from process table. 4. Implements a zombie process and identify it from process table. 5. Demonstrate & discuss the wait () & sleep () system call. 6. Make four child process for a process, the parent process will not execute until the death of all four process. When the parent executes it should display all its four child PIDs. 7. Write a program that will create the maximum no. of process Unix allows. 8. How it is possible that for a same variable in to result (parent & Child) processes has a same address & different values demonstrate and discuss. 9. Make a process named Ex2 for display its process Id and its parents process Id , execute Ex1 from process Ex1. 10. Explain the following function with example for each Execv () Execl () Ececvp () 11. What is the advantage of exec () called through a fork () demonotstate it. 12. Calculate time taken by a child process for the execution 13. Write a program that display system details like. (a) System name (b) Node name (c) Release (d) Version (e) Processor name 14. Write a program that display the user detail like (a) Login name (b) encrypted password (c) userid (d) groupid (e) Password age (f) comment (g) Miscellany (h) login directory (i) shell 15. Cache the SIGINT signal and display appropriate message also display the corresponding signal key 16. Ignore the SIGINT signal.17. Cache the SIGQUIT signal and display appropriate message also display the corresponding signal key. 18. Igonre the SIGQUIT signal. 19. Cache the SIGILL signal and display appropriate message also display the orresponding signal key. 20. Igonre the SIGILL signal. 21. Cache the SIGHUP signal and display appropriate message also display the corresponding signal key. 22. Igonre the SIGHUP signal. 23. Cache the SIGCLD signal and display appropriate message also display the corresponding signal key. 24. Igonre the SIGCLD signal. 25. Cache the SIGALRM signal and display appropriate message also display the
orresponding signal key. 26. Igonre the SIGALRM signal. 27. Cache the SIGUSR1 signal and display appropriate message also display the corresponding signal key. 28. Igonre the SIGUSR1 signal. 29. Cache the SIGUSR2 signal and display appropriate message also display the corresponding signal key. 30. Igonre the SIGUSR2 signal. 31. Make a child process for a process, the process goes to sleep until the child process completes. When the child complete it should receive a signal. Cache the signal and display the message "CHILD DIED". 32. Send a SIGINT signal from a parent process to a child process using kill(),the child process catch the signal SIGINT and should display and appropriate message. 33. Install following types of Linux in graphical mode as well as non-graphical mode. (a) Linux server 9.0 (b) Linux client 9.0 (c) Upgrade from 8.0 to 9.0 (d) Dual booting with either Windows 98/Windows-NT/Windows XP. 34. Prepare following partition using appropriate command Partition Size /boot 150 MB /swap 300 MB / 2000MB 35. Configure following boot loaders. (a) GRUB (b) LILO 36. Mount windows drives (formatted using FAT16/FAT32) in Linux. 37. By default Linux 9.0 gives six logical screens expand it up to eleven. 38. Add your host into network using graphical tool as well as non-graphically (i.e. using command). 39. Add user using graphical tool as well as non-graphically (i.e. using command). 40. Suppose you forgot your root password, how can u recover this problem and in which condition it is possible. 37. By default Linux 9.0 gives six logical screens expand it up to eleven. 38. Add your host into network using graphical tool as well as nongraphically (i.e. using command). 39. Add user using graphical tool as well as non -graphically (i.e. using command). 40. Suppose you forgot your root password, how can u recover this problem and in which condition it is possible.
KSKV Kachchh University M.Sc. (CA & IT), Non-CBCS, Semester VII CS 703, Advance Operating System Internal Exam Structure Maximum Marks 50 Duration 1.5 Hours Passing Marks 20
KSKV Kachchh University M.Sc. (CA & IT), Non-CBCS, Semester VII CS 704,Advance Web-Technology-1 Internal Exam Structure Maximum Marks Duration Passing Marks 50 1.5 Hours 20
1. There are 5 questions each carrying 14 marks.
Questions Question 1 (Unit 1) Question 2 (Unit 2) Question 3 (Unit 3) Question 4 (Unit 4) Question 5 (Programs)
Section A (Medium length questions), (Two out of Three) B (Essay type questions) (Two out of Three) A (Medium length questions), (Two out of Three) B (Essay type questions) (Two out of Three) A (Medium length questions), (Two out of Three) B (Essay type questions) (Two out of Three) A (Medium length questions), (Two out of Three) B (Essay type questions) (Two out of Three) Programs (Two out of Three)
Marks 5 marks 5 marks 6 marks 4 marks 6 marks 4 marks 6 marks 4 marks 10 marks
Duration 3 Hours
Passing Marks 28 Marks 6 marks 8 marks 6 marks 8 marks 6 marks 8 marks 6 marks 8 marks 14 marks
Questions Question 1 (Unit 1) Question 2 (Unit 2) Question 3 (Unit 3) Question 4 (Unit 4) Question 5 (Programs)
Section A (Medium length questions), (Two out of Three) B (Essay type questions) (Two out of Three) A (Medium length questions), (Two out of Three) B (Essay type questions) (Two out of Three) A (Medium length questions), (Two out of Three) B (Essay type questions) (Two out of Three) A (Medium length questions), (Two out of Three) B (Essay type questions) (Two out of Three) Programs (Two out of Three)
KSKV Kachchh University M.Sc. (CA & IT), Non-CBCS, Semester VII CS 705,Advance Java Technology Internal Exam Structure Maximum Marks Duration Passing Marks 50 1.5 Hours 20
2. There are 5 questions each carrying 14 marks.
Questions Question 1 (Unit 1,2) Question 2 (Unit 3) Question 3 (Unit 4) Question 4 (Unit 5) Question 5 (Programs)
Section A (Medium length questions), (Two out of Three) B (Essay type questions) (Two out of Three) A (Medium length questions), (Two out of Three) B (Essay type questions) (Two out of Three) A (Medium length questions), (Two out of Three) B (Essay type questions) (Two out of Three) A (Medium length questions), (Two out of Three) B (Essay type questions) (Two out of Three) Programs (Two out of Three)
Marks 5 marks 5 marks 6 marks 4 marks 6 marks 4 marks 6 marks 4 marks 10 marks
Duration 3 Hours
Passing Marks 28 Marks 6 marks 8 marks 6 marks 8 marks 6 marks 8 marks 6 marks 8 marks 14 marks
Questions Question 1 (Unit 1,2) Question 2 (Unit 3) Question 3 (Unit 4) Question 4 (Unit 5) Question 5 (Programs)
Section A (Medium length questions), (Two out of Three) B (Essay type questions) (Two out of Three) A (Medium length questions), (Two out of Three) B (Essay type questions) (Two out of Three) A (Medium length questions), (Two out of Three) B (Essay type questions) (Two out of Three) A (Medium length questions), (Two out of Three) B (Essay type questions) (Two out of Three) Programs (Two out of Three)
Sub No.
Subject Name
Advance Networking Personality Development & Aptitude Web development using PHP Computer Security Health & Yoga Total
Credits
4 6 6 6 6 28
Examination Scheme External Marks Th. Durations Prac. Duration /Oral 70 3 hrs 3 hrs 35 35 35 35 3 hrs 3 hrs 3 hrs 3 hrs 35 35 35 35 3 hrs 3 hrs 3 hrs 3 hrs
KSKV Kachchh University M.Sc. (CA & IT), Non-CBCS, Semester VIII CS 801, Advance Networking Internal Exam Structure Maximum Marks 50 Duration 1.5 Hours Passing Marks 20
KSKV Kachchh University M.Sc. (CA & IT), Non-CBCS, Semester VIII CS 802, Personality Development & Aptitute Internal Exam Structure Maximum Marks 50 Duration 1.5 Hours Passing Marks 20
11. Write a PHP Program to Upload File. 12. Write a PHP program to demonstrate the use of array. 13. Write a PHP program to prepare student Mark sheet. 14. Write a PHP program to generate the multiplication of matrix. 15. Write a PHP program to perform demonstrate the college Website. 16. Write a PHP program to add new rows in a Table. 17. Write a PHP program to modify the rows in a Table. 18. Write a PHP program to delete the rows in a Table. 19. Write a PHP program to fetch rows in a Table. 20. Develop an PHP application to make following Operation i. Registration of user. ii. Insert the details of user. iii. Modify the details. iv. Transaction Maintained like the use of session and cookies variable.
KSKV Kachchh University M.Sc. (CA & IT), Non-CBCS, Semester VII CS 803,Web Development Using PHP Internal Exam Structure Maximum Marks Duration Passing Marks 50 1.5 Hours 20
3. There are 5 questions each carrying 14 marks.
Questions Question 1 (Unit 1) Question 2 (Unit 2) Question 3 (Unit 3) Question 4 (Unit 4) Question 5 (Programs)
Section A (Medium length questions), (Two out of Three) B (Essay type questions) (Two out of Three) A (Medium length questions), (Two out of Three) B (Essay type questions) (Two out of Three) A (Medium length questions), (Two out of Three) B (Essay type questions) (Two out of Three) A (Medium length questions), (Two out of Three) B (Essay type questions) (Two out of Three) Programs (Two out of Three)
Marks 5 marks 5 marks 6 marks 4 marks 6 marks 4 marks 6 marks 4 marks 10 marks
Duration 3 Hours
Passing Marks 28 Marks 6 marks 8 marks 6 marks 8 marks 6 marks 8 marks 6 marks 8 marks 14 marks
Questions Question 1 (Unit 1) Question 2 (Unit 2) Question 3 (Unit 3) Question 4 (Unit 4) Question 5 (Programs)
Section A (Medium length questions), (Two out of Three) B (Essay type questions) (Two out of Three) A (Medium length questions), (Two out of Three) B (Essay type questions) (Two out of Three) A (Medium length questions), (Two out of Three) B (Essay type questions) (Two out of Three) A (Medium length questions), (Two out of Three) B (Essay type questions) (Two out of Three) Programs (Two out of Three)
Unit : 4 [35%] Network Security(book no-2) - Protocols :- Digital Signature standards. - Electronics Mail Security - PGP (Pretty Good Privacy) MIME, data Compression technique. - IP Security:- Architecture, Authentication Leader, Encapsulating security Payload - Key Management. - Web security: -Secure Socket Layer & Transport Layer security, secure electronics transactions. book no 3 - Local and Metropolitan Area Network Security Environment. - Wide Area Network Security. - Virtual Networks Security. - Distributed Systems Security. - Wireless Networking Security Textbooks: 1. IT Security Cook Book(http://www.boran.com/security) 2. Cryptography and Network Security (2nd edition) William Stallings(Pearson Education) 3. Enterprise Security, 1/e Robert C. Newman(Pearson Education) Reference books: 1. Computer Security Basics By Debby Russell, G.T. Gangemi, Sr.(Oreilly) 2. Network Security private communication in a PUBLIC world By Charlie Kaufman, Radia Perlman , Mike Speciner 3. Security in Computing, 3/e Charless P. Pfleeger, Shari Lawrence Pfleeger.804 : Computer Security
[Practical List] 1. Write a 'c' program to encrypt the plaintext and display the cipher text using Ceaser Cipher. 2. Write a 'c' program to decrypt the ciphetext and display the plain text using Ceaser Cipher. 3. Write a 'c' program to encrypt the plaintext and display the cipher text using Monoalphabetic Substitution Cipher. 4. Write a 'c' program to Decrypt the cipher text and display the plain text using Monoalphabetic Substitution Cipher. 5. Write a 'c' program to Encrypt the plaintext and display the cipher text using playfair Cipher. 6. Write a 'c' program to Decrypt the Ciphertext and display the plaintext using playfairCipher. 7. Write a 'c' program to Encrypt the plaintext and display the cipher text using Hill Cipher. 8. Write a 'c' program to Decrypt the Ciphertext and display the plaintext using Hill Cipher. 9. Write a 'c' program to Encrypt the plaintext and display the cipher text using VigenereCipher. 10. Write a 'c' program to Decrypt the cipher text and display the plain text using VigenereCipher. 11. Write a 'c' program to Encrypt the plaintext and display the cipher text using AutokeyVigenere Cipher. 12. Write a 'c' program to Decrypt the ciphertext and display the plain text using AutokeyVigenere Cipher. 13. Write a 'c' program to Encrypt the plaintext and display the cipher text using One-Time PadVigenere Cipher. 14. Write a 'c' program to Decrypt the ciphertext and display the plaintext using One-Time PadVigenere Cipher. 15. Write a 'c' program to Encrypt the plaintext and display the cipher text using Rail FenceTransposition Cipher. 16. Write a 'c' program to Decrypt the cipher text and display the plaintext using Rail FenceTransposition Cipher. 17. Write a 'c' program to Encrypt the plaintext and display the cipher text using ColumnarTransposition Cipher. 18. Write a 'c' program to Decrypt the cipher text and display the plain text using ColumnarTransposition Cipher. 19. Write a 'c' program to Encrypt the plaintext and display the cipher text using Three-Rotormachine. 20. Write a 'c' program to Decrypt the cipher text and display the plain text using Three-RotorMachine.
KSKV Kachchh University M.Sc. (CA & IT), Non-CBCS, Semester VIII CS 804,Computer Security Internal Exam Structure Maximum Marks Duration Passing Marks 50 1.5 Hours 20
4. There are 5 questions each carrying 14 marks.
Questions Question 1 (Unit 1) Question 2 (Unit 2) Question 3 (Unit 3) Question 4 (Unit 4) Question 5 (Programs)
Section A (Medium length questions), (Two out of Three) B (Essay type questions) (Two out of Three) A (Medium length questions), (Two out of Three) B (Essay type questions) (Two out of Three) A (Medium length questions), (Two out of Three) B (Essay type questions) (Two out of Three) A (Medium length questions), (Two out of Three) B (Essay type questions) (Two out of Three) Programs (Two out of Three)
Marks 5 marks 5 marks 6 marks 4 marks 6 marks 4 marks 6 marks 4 marks 10 marks
Duration 3 Hours
Passing Marks 28 Marks 6 marks 8 marks 6 marks 8 marks 6 marks 8 marks 6 marks 8 marks 14 marks
Questions Question 1 (Unit 1) Question 2 (Unit 2) Question 3 (Unit 3) Question 4 (Unit 4) Question 5 (Programs)
Section A (Medium length questions), (Two out of Three) B (Essay type questions) (Two out of Three) A (Medium length questions), (Two out of Three) B (Essay type questions) (Two out of Three) A (Medium length questions), (Two out of Three) B (Essay type questions) (Two out of Three) A (Medium length questions), (Two out of Three) B (Essay type questions) (Two out of Three) Programs (Two out of Three)
7. Bhujangasan 8. Dhanurasan 9. Tiryakasan 10. Padangushtasan 11. Anuvrattasan 12. Uttanpadasun 13. Chakrasan 14. Halasan 15. Matsyasan 16. Lolasan 17. Kraunchasan 18. Kukkutasan 19. Sarvangasan 20. Shirshasan 4. Surya Namaskar
KSKV Kachchh University M.Sc. (CA & IT), Non-CBCS, Semester VIII CS 805, Health & Yoga Internal Exam Structure Maximum Marks 50 Duration 1.5 Hours Passing Marks 20
Internal Marks
Lectures Per Batch * Th. Prac. Total Th. Durations Prac. Duration Total Hours/ Hours/Week (I) /Oral (E) Week CS-901 Artificial Intelligence CS-902 Embedded System
Elective I Elective - II
4 4 * * * --
3 3 --12 --
30 30 ---
-----
30 70 30 70 -----
----180
----6 hrs --
70 70 --180 --
--
Elective Subjects: Sub No. Subject Name Teaching Scheme Theory Practical Examination Scheme External Marks
Grand Lectures Per Batch * Th. Prac. Total Th. Durations Prac. Duration Total Total Hours/ Hours/Week (I) /Oral (E) (I+E) Week
Mobile Computing Biomformatics Image Processing Data Warehousing and Data Mining Advanced Database Management system Geographical Information System 3 3 5 3 3 5 3 3 3 3 30 30 30 30 30 30 30 30 30 30 30 30 70 70 70 70 70 70 3 hrs 3 hrs 3 hrs 3 hrs 3 hrs 3 hrs 70 70 70 70 70 70 100 100 100 100 100 100
Internal Marks
UNIT-I [20%] Introduction and Application of Artificial Intelligence. Problem Solving: Defining the Problem as State Space Search, Production System, Problem Characteristics, Production System Characteristics. Heuristic Search Techniques: Generate and Test, Hill Climbing, Best First Search, A* Algorithm, Problem Reduction, Constraint Satisfaction, Means End Analysis. UNIT-II [15%] Knowledge Representation: Types and Level of Knowledge, Predicate Logic, Forward Vs. Backward Reasoning, Semantic Nets, Frame, Script. Formalized Symbolic Logics: syntax and semantics for propositional logic, Inference Rules. UNIT-III [10%] Expert System: Definition of an Expert System, Role of Knowledge in Expert System, Architecture of Expert System, Expert System Development Life Cycle, Knowledge Acquisition. UNIT-IV [25%] Introduction to Neural Networks: Hop field Networks, Learning in Neural Networks, Perceptrons, Backpropagation Networks, Application of Neural Networks. Perception And Action: Robot Architecture, Vision, Texture and Images, Representing and Recognizing Scene. Game Playing: The Minimax Search Procedure, Alpha Beta Cutoffs. Natural Language Processing: Syntactic Processing, Semantic Analysis, Augmented Transition Networks. UNIT-V [30%] Programming in Logic (PROLOG): Introduction, PROLOG variables, Using Rules, Input and Output Predicates, Fail and Cut Predicates, Recursion, Arithmetic Operation, Compound Object, Dynamic Database, Lists, String and File operation. Texts/References: 1. Artificial Intelligence (2nd Edition). By Elaine Rich & Kevin Knight Tata McGraw-Hill Edition. 2. Artificial Intelligence By George F Luger.Pearson Education 3. Introduction to A.I. & Expert System. By Dan W. Patterson, Prentice-Hall India Pvt. Ltd. 4. Introduction to Turbo PROLOG By Carl Townsend BPB Publication.
KSKV Kachchh University M.Sc. (CA & IT), Non-CBCS, Semester IX CS 901, Artificial Intelligence Internal Exam Structure Duration 1.5 Hours
Maximum Marks 50 Questions Question 1 (Unit 1) Question 2 (Unit 2) Question 3 (Unit 3) Question 4 (Unit 4) Question 5 (Programs)
Passing Marks 20 Marks 5 marks 5 marks 6 marks 4 marks 6 marks 4 marks 6 marks 4 marks 10 marks
Section A (Medium length questions), (Two out of Three) B (Essay type questions) (Two out of Three) A (Medium length questions), (Two out of Three) B (Essay type questions) (Two out of Three) A (Medium length questions), (Two out of Three) B (Essay type questions) (Two out of Three) A (Medium length questions), (Two out of Three) B (Essay type questions) (Two out of Three) Programs (Two out of Three)
KSKV Kachchh University M.Sc. (CA & IT), Non-CBCS, Semester IX CS 901, Artificial Intelligence External Exam Structure Maximum Marks 70 Duration 3 Hours Passing Marks 28
KSKV Kachchh University M.Sc. (CA & IT), Non-CBCS, Semester IX CS 902, Embedded Systems Internal Exam Structure Duration 1.5 Hours
Maximum Marks 50 Questions Question 1 (Unit 1) Question 2 (Unit 2) Question 3 (Unit 3) Question 4 (Unit 4) Question 5
Passing Marks 20 Marks 5 marks 5 marks 6 marks 4 marks 6 marks 4 marks 6 marks 4 marks 4 marks 6 marks
Section A (Medium length questions), (Two out of Three) B (Essay type questions) (Two out of Three) A (Medium length questions), (Two out of Three) B (Essay type questions) (Two out of Three) A (Medium length questions), (Two out of Three) B (Essay type questions) (Two out of Three) A (Medium length questions), (Two out of Three) B (Essay type questions) (Two out of Three) A (Medium length questions/Programs), (Two out of Three) B (Medium length questions/Programs) (Two out of Three)
KSKV Kachchh University M.Sc. (CA & IT), Non-CBCS, Semester IX CS 902, Embedded Systems External Exam Structure Maximum Marks 70 Duration 3 Hours Passing Marks 28
5. Deploying Android Application to the World [1Hr] Selling your Android application
Text Book:
1. Lauren Darcey and Education, 2nd ed. (2011) Shane Conder, "Android Wireless Application Development", Pearson
Reference Books:
1. Reto Meier, "Professional Android 2 Application Development", Wiley India Pvt Ltd (2011) 2. Mark L Murphy, "Beginning Android", Wiley India Pvt Ltd(2009) 3. Sayed Y Hashimi and Satya Komatineni, "Pro Android", Wiley India Pvt Ltd(2009)
Chapter wise Coverage from Text Book: Chapters: 1, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 16, 29
KSKV Kachchh University M.Sc. (CA & IT), Non-CBCS, Semester IX CS-903, Elective I - Mobile Computing (MC) Internal Exam Structure
Maximum Marks 50 Duration 1.5 Hours Passing Marks 20
Section
Marks
A B A B A B A B Programs
5 marks 5 marks
4 marks 6 marks 4 marks 6 marks 4 marks 6 marks 10 Marks
KSKV Kachchh University M.Sc. (CA & IT), Non-CBCS, Semester IX CS-903, Elective I - Mobile Computing (MC) External Exam Structure
Maximum Marks 70 Duration Passing Marks 28
3 Hours
Section
Marks
A B A B A B A B Programs
7 marks 7 marks
6 marks 8 marks 6 marks 8 marks 6 marks 8 marks 10 marks
KSKV Kachchh University M.Sc. (CA & IT), Non-CBCS, Semester IX CS-904,Elective -I Biomformatics (Bio-I) Internal Exam Structure
Maximum Marks 50 Duration 1.6 Hours Passing Marks 20
Section
Marks
A B A B A B A B A: B: KSKV Kachchh University M.Sc. (CA & IT), Non-CBCS, Semester IX CS-904,Elective -I Biomformatics (Bio-I) External Exam Structure
Maximum Marks 70 Duration
5 marks 5 marks
4 marks 6 marks 4 marks 6 marks 4 marks 6 marks 4 marks 6 marks
4 Hours
Passing Marks 28
Section
Marks
A B A B A B A B A: B:
7 marks 7 marks
6 marks 8 marks 6 marks 8 marks 6 marks 8 marks 6 marks 8 marks
CS: 905 Image Processing Unit 1 : Introduction [10%] What is Digital Image Processing The origins of Digital Image Processing Examples of Fields that use Digital Image Processing o Gamma-Ray imaging o X.-Ray Imaging o Imaging in the Ultraviolet Band o Imaging in the visible and Infrared Bands o Imaging in the Microwave Band o Imaging in the Radio band o Other Imaging Modalities Fundamental steps in Digital Image processing Components of Image Processing system Unit 2: Digital Image Fundamentals [10%] Elements of Visual Perception o Structure of the Human o Image Formation in the Eye o Brightness Adaptation and Discrimination Light and Electromagnetic Spectrum Image Sensing and Acquisition o Image Acquisition using a Single sensor o Image Acquisition using a Sensor Strips o Image Acquisition using a Sensor Arrays o A sample Image Formation Model Image Sampling and Quantization o Basic Concepts and Sampling and Quantization o Representing Digital Image o Spatial and Gray level resolution o Aliasing and Moire Pattern o Zooming and Shrinking Digital Images Some basic Relationships between Pixels o Neighbors of a pixel o Adjacency,connectivity,regions and Boundaries o Distance Measures o Image Operations on a pixel basics Linear and Nonlinear Operations Unit 3 : Image Enhancement in the spatial domain [20%] Background Some basic gray level transformation Histogram processing Enhancement using Arithmetic/Logic operations Basics of spatial filtering Smoothing spatial filters Sharpening spatial filters Combining Spatial Enhancement features Unit 4: Image Restoration [20%] A model of the Image Degradation/Restoration process
Noise Models Restoration in the presence of noise only spatial filtering Periodic noise reduction by Frequency domain filtering Linear, Position-invariant degradation Estimating the degradation functions Inverse filtering Minimum Mean Square Error (Wiener) filtering Constrained least squares filtering Geometric mean filter Geometric Transformations Unit 5: Color Image Processing [15%] Color Fundamentals Color models o The RGB color model o The CMY and CMYK color models o The HSI color model Pseudo Color image processing o Intensity slicing o Gray level to color transformations Basics of full color image processing Color transformations o Formulation o Color complements o Color slicing o Tone and color corrections o Histogram processing Smoothing and sharpening o Color image smoothing o Color image sharpening Color segmentation o Segmentation in HSI color space, Segmentation in RGB vector space o Color edge detection Noise in color images , Color Image compression Unit 6: Image Compression [25%] Fundamentals o Coding Redundancy , Interpixel Redundancy ,Psycho visual Redundancy,Fidelity criteria Image Compression models o The source encoder and decoder o The Channel encoder and decoder Elements of Information theory o Measuring information,The information channel,Fundamental coding theorems o Using information theorems Error free compression o Variable length coding,LZW coding ,Bit plane coding, Loss less predictive coding Lossy compression o Lossy predictive coding , Transform coding , Wavelet coding Text Book : Digital Image Processing (Second Edition) By Rafael C. Gozales, Richard E. Woods. (Pearson Education)
KSKV Kachchh University M.Sc. (CA & IT), Non-CBCS, Semester IX CS-905,Elective -I Image Processing (Bio-I) Internal Exam Structure
Maximum Marks 50 Duration 1.7 Hours Passing Marks 20
Section
Marks
A B A B A B A B A: B: KSKV Kachchh University M.Sc. (CA & IT), Non-CBCS, Semester IX CS-904,Elective -I Image Processing (Bio-I) External Exam Structure
Maximum Marks 70 Duration
5 marks 5 marks
4 marks 6 marks 4 marks 6 marks 4 marks 6 marks 4 marks 6 marks
5 Hours
Passing Marks 28
Section
Marks
A B A B A B A B A: B:
7 marks 7 marks
6 marks 8 marks 6 marks 8 marks 6 marks 8 marks 6 marks 8 marks
CS : 906 Data Warehousing & Data Mining (DWDM) 1. Introduction to Data Warehousing, A Multi-dimensional Data Model & OLAP Operations & Servers
Schemas, (6 Lect.)
An overview and definition along with clear understanding of the four key-words appearing in the definition. Differences between Operational Database Systems and Data Warehouses; Difference between OLTP & OLAP Overview of Multi-dimensional Data Model, and the basic differentiation between "Fact" and "Dimension"; Multi-dimensional Cube Concept Hierarchies of "Dimensions" Parameters: Examples and the advantages Star, Snowflakes, and Fact Constellations Schemas for Multi-dimensional Databases Measures: Their Categorization and Computation Pre-computation of Cubes, Constraint on Storage Space, Possible Solutions OLAP Operations in Multi-dimensional Data Model: Roll-up, Drill-down, Slice & Dice, Pivot (Rotate) Indexing OLAP Data; Efficient Processing of OLAP Queries Type of OLAP Servers: ROLAP versus MOLAP versus HOLAP Metadata Repository
2. Data Warehouse Architecture; Further Development of Data Cube & OLAP Technology
(3 Lect.)
The Design of A Data Warehouse: A Business Analysis Framework; The Process of Data Warehouse Design A 3-Tier Data Warehouse Architecture; Enterprise Warehouse, Data mart, Virtual Warehouse Discovery-Driven Exploration of Data Cubes; Complex Aggregation at Multiple Granularity: Multi-feature Cubes Constrained Gradient Analysis of Data Cubes
3. P re-processing
(7 Lect.)
The need for Pre-processing, Descriptive Data Summarization Data Cleaning: Missing Values, Noisy Data, Data Cleaning as a Process Data Integration & Transformation Data Cube Aggregation; Attribute Subset Selection Dimesionality Reduction: Basic Concepts only Numerosity Reduction: Regression & Log-linear Models, Histograms, Clustering, Sampling Data Dicretization & Concept Hierarchy Generation For Numerical Data: Binning, Histogram Analysis, Entropy-based Discretization, Interval Merging by x Analysis, Cluster Analysis, Discretization by Intuitive Partitioning For Categorical Data
(4 Lect.)
Concept/Class Associations,
An Overview; What is Data Mining; Data Mining - on What Kind of Data Data Mining Functionalities - What Kind of Patterns Can be Mined; Description: Characterization & Discrimination; Mining Frequent Patterns, and Correlations; Classification & Prediction; Cluster Analysis; Outlier Analysis Are All of the Patterns Interesting Classification of Data Mining Systems Data Mining Task Primitives Integration of a Data Mining System with a Database or Data Warehouse System Major Issues in Data Mining
5. Attribute-Oriented Induction: An Alternate Method for Data Generalization & Concept Description (4 Lect.)
Attribute-Oriented Induction for Data Characterization, and Presentation of the Derived Generalization Mining Class Comparisons: Discrimination between Different Classes Class Descriptions: Presentation of both Characterization & Comparison Its Efficient Implementation;
(4 Lect.)
Basic Concepts: Market Basket Analysis; Frequent Itemsets, Closed Itemsets, and Association Rules; Frequent Pattern Mining: A Roadmap Apriori Algorithm: Finding Frequent Itemsets Using Candidate Generation; Generating Association Rules from Frequent Itemsets; Improving the Efficiency of Apriori From Association Mining to Correlation Analysis; Strong Rules Are Not Necessarily Interesting: An Example; From Association Analysis to Correlation Analysis
(9+2 Lect.)
Introduction to Classification and Prediction; Basics of Supervised & Unsupervised Learning; Preparing the Data for Classification and Prediction; Comparing Classification and Prediction Methods Classification by Decision Tree Induction, Attribute Selection Measures; Tree Pruning; Scalability and Decision Tree Induction Rule-based Classification: Using IF-THEN Rules for Classification; Rule Extraction from a Decision Trees; Rule Induction Using a Sequential Covering Algorithm Bayesian Classification: Bayes' Theorem, Naive Bayesian Classification; Bayesian Belief Networks An Overview of Other Classification Methods (2 Lectures) Prediction: Linear Regression; Non-linear Regression; Other Regression Models Classifier Accuracy and Error Measures: Classifier Accuracy Measures; Predictor Error Measures Evaluating the Accuracy of a Classifier or Predictor: Holdout Method and Random Subsampling; Cross Validation; Bootstrap Ensemble Methods - Increasing the Accuracy: Bagging; Boosting
8. Cluster Analysis
(6+2 Lect.)
Introduction to Cluster Analysis; Types of Data in Cluster Analysis; A Categorization of major Clustering Methods Partitioning Methods; Centroid-Based Technique: K-Means Method; Overview of Other Clustering Methods An Overview of Other Clustering Methods (2 Lectures) Outlier Analysis; Statistical Distribution-based Outlier Detection; Distance-based Outlier Detection; Density-based Outlier Detection; Deviation-based Outlier Detection
(3 Lect.)
Data Mining for: (a) Financial Data Analysis; (b) The Retail Industry; (c) The Telecommunication Industry; (d) Biological Data Analysis; (e) Other Scientific Applications; (f) Intrusion detection Data Mining Systems: (a) How to Choose; (b) Examples of Commercial Data Mining Systems
Text Book:
1. Jiawei Han & Micheline Kamber, "Data Mining: Concepts & Techniques", Morgan Kaufmann Publishers (2002)
3. Pieter Adriaans & Dolf Zentinge, "Data Mining", Addison-Wesley, 4. Daniel T. Larose, "Data Mining Methods & Models", Wiley-India (2007)
4.
Laboratory Exercise
The objective of the lab exercises is to use data mining techniques to identify customer segments and understand their buying behavior and to use standard databases available to understand DM processes using WEKA (or any other DM tool) 1. 2. 3. Gain insight for running pre- defined decision trees and explore results using MS OLAP Analytics. Using IBM OLAP Miner - Understand the use of data mining for evaluating the content of multidimensional cubes. Using Teradata Warehouse Miner - Create mining models that are executed in SQL.
BI Portal Lab: The objective of the lab exercises is to integrate pre-built reports into a portal application
4. Publish cognos cubes to a business intelligence portal.
Metadata & ETL Lab: The objective of the lab exercises is to implement metadata import agents to pull metadata from leading business intelligence tools and populate a metadata repository. To understand ETL processes
5. 6. 7. Import metadata from specific business intelligence repository. Publish metadata stored in the repository. Load data from heterogeneous sources including text schema. tools and populate a metadata
files
into
pre-defined
warehouse
KSKV Kachchh University M.Sc. (CA & IT), Non-CBCS, Semester IX CS-906, Elective II - Data Warehousing & Data Mining (DWDM) Internal Exam Structure
Maximum Marks 50 Duration 1.8 Hours Passing Marks 20
Section
Marks
5 marks 5 marks
4 marks 6 marks 4 marks 6 marks 4 marks 6 marks 4 marks 6 marks
CS-903, Elective I - Data Warehousing & Data Mining (DWDM) External Exam Structure
Maximum Marks 70 Duration Passing Marks 28
6 Hours
Section
Marks
A B A B A B A B A B
7 marks 7 marks
6 marks 8 marks 6 marks 8 marks 6 marks 8 marks 6 marks 8 marks
CS-907: Advanced Data Base Management Systems (ADBMS) 1. Getting Started with Database Architecture and Managing Data Storage (10%)
Introduction to Database, Database System Environment - an Example, Data Models, Schema and Instances, Three Schema Architecture of Database, Component Modules of Database Systems, Database System Utilities, Memory Hierarchy and Storage Devices, Storage of Databases, Buffering of Blocks, Places File Record on Disk, Files of Unordered Records and Unordered Records
2.
3.
4.
Contents
Chps. 1.1,1.2, 2.1, 2.2, 2.4.1, 2.4.2, 13.1, 13.1.1, 13.1.2, 13.3, 13.4 Chps. 16.1.1, 16.1.2, 16.2, 23.1, 23.2, 23.3, 23.6 Chps. 1.6, 19.1, 19.2, 19.3, 25.5, 25.7, 14.1, 14.2 Chps. 24.2, 24.4, 25.1, 25.2, 25.3 Chps. 22.1, 22.2, 22.5, 22.6, 30.1, 30.2, 30.3, 30.4 Pgs. 521 - 538, 318 - 323, 552 - 561, 589 - 590
KSKV Kachchh University M.Sc. (CA & IT), Non-CBCS, Semester IX CS-907, Elective II - Advanced Data Base Management Systems (ADBMS) Internal Exam Structure
Maximum Marks 50 Duration 1.9 Hours Passing Marks 20
Section
Marks
A B A B A B A B A : Programs/Query B : Programs/Query
5 marks 5 marks
4 marks 6 marks 4 marks 6 marks 4 marks 6 marks 4 marks 6 marks
KSKV Kachchh University M.Sc. (CA & IT), Non-CBCS, Semester IX CS-907, Elective II - Advanced Data Base Management Systems (ADBMS) External Exam Structure
Maximum Marks 70 Duration Passing Marks 28
7 Hours
Section
Marks
7 marks 7 marks
6 marks 8 marks 6 marks 8 marks 6 marks 8 marks 6 marks 8 marks
Primary Data, Input Devices, Vector Input, Raster Input, Remote Sensing Data Input, GPS Data Input, Metadata and Metadata Standards. Data Storage and Editing: Storage of GIS Databases, Detecting and Editing Errors of Different Types, Dealing with Projection Changes, Edge Matching, Rubber Shitting.
Unit - 3 - Analysis
Elementary Spatial Analysis: GIS Data Query, Defining Spatial Characteristics, Working with Higher - Level Objectives Measurement: Measuring Length of Linear Objectives, Polygons, Shape and Distance Classification: Classification Principal, Elements of Reclassification, Neighborhood Functions, Roving Windows, Buffers Statistical Surfaces: Surface Mapping, Sampling the Statistical Surface, The DEM, Raster Surface, Interpolation, Terrain Reclassification, Slicing the Statistical Surface, Cut and Fill Spatial Arrangement Point, Line and Area Arrangement, Point Patterns, Thiessen Polygons, Area Patterns, Distance and Adjacency, Polygon Arrangement Measures, Linear Patterns, Directionality of Linear and Areal Objective, Connectivity of Linear Objects, Gravity Model, Routing and Allocation, The Missing Variables Comparing Variables Among Maps: The Cartographic Overlay, Point-in-Polygon, Line-in-Polygon, Polygon Overlay, Automating the of Vector Overlay, CAD-Type Overlay, Dasymetric Mapping Cartographic Modeling: Model Components, The Cartographic Models, Types of Cartographic Models, Inductive Modeling, Factor Selection, model Flowcharting, Model implementation, Model Verification
Overlay,
Types
and
Deductive
Analysis,
Cartographic
Output,
The
Design
Process,
Map
Design
Controls,
Text Book:
1. Michael N DeMers, "Fundamentals of Geographic Information Systems", Wiley India Education
Reference Books:
1. Kang-tsung Chang, "Introduction to Geographic Information Systems", McGraw-Hill Publication 2. YEUNG, ALBERT K. W., LO, C. P., "Concepts and Techniques of Geographic Information Systems", PHI Learning
KSKV Kachchh University M.Sc. (CA & IT), Non-CBCS, Semester IX CS-908, Elective II Geographical Information System Internal Exam Structure
Maximum Marks 50 Duration 1.10 Hours Passing Marks 20
Section
Marks
A B A B A B A B A B
5 marks 5 marks
4 marks 6 marks 4 marks 6 marks 4 marks 6 marks 4 marks 6 marks
KSKV Kachchh University M.Sc. (CA & IT), Non-CBCS, Semester IX CS-908, Elective II Geographical Information System External Exam Structure
Maximum Marks 70 Duration Passing Marks 28
8 Hours
Section
Marks
A B A B A B A B A B
7 marks 7 marks
6 marks 8 marks 6 marks 8 marks 6 marks 8 marks 6 marks 8 marks
Semester X(Non-CBCS)
Teaching Scheme Subject Name Reporting Hours 2 Industry Work Hours 30 Credits Internal Marks (I) Explanation of Code 100 Examination Scheme External Marks Explanation of Analysis Documentation & Design 100 100
Presentation 100
30 30
200 200