KRANTIGURU SHYAMJI KRISHNA VERMA. Department of Computer Science

Transcription

1 KRANTGURU SHYAMJ KRSHNA VERMA KACHCHH UNVERSTY Department of Computer Science Syllabus for Five Years ntegrated Master of Science (Computer Applications & nformation Technology) (Effective from June 2016) 1

2 Master of Science (Computer Applications & nformation Technology) Five Years ntegrated Full Time Program This course abbreviated as M.Sc. (CA & T) is an integrated post-graduate programme of 10 semester s duration. CREDT SYSTEM One credit in theory course is equivalent to classroom teaching of 1 hour per week for 15 weeks, whereas one credit in practical requires 3 hours of performing practical per week for 15 weeks. ELGBLTY CRTERA 1. A student who have passed H.S.C. Examination with minimum 40% marks with a. Science Stream with A or B groups or b. Commerce Stream. 2. A candidate who has passed an equivalent examination from any other university/examining body shall have to produce Eligibility Certificate from KS KV Ka c hc hh University, Bhuj (which can be obtained from the University Office) along with the application for admission in the first semester. Original as well as self attested copies of : DOCUMENTS REQURED 1. S.S.C (10 th ) mark sheet, Passing and Trial Certificate. 2. H.S.C. (10+2) or Equivalent Mark sheet. 3. School Leaving Certificate. 4. SC/ST/SEBC caste certificate wherever applicable. 5. Non-Creamy Layer Certificate in case of SEBC 6. Relevant reservation documents as notified by the government. ADMSSON PROCEDURE Counselling will be given to the candidates on the day of admission before actual admission takes place in each college. CRTERA FOR EVALUATON Continuous and Comprehensive Evaluation (CCE) will be conducted by respective departments; CCE will have 30% weightage. A student shall have to score minimum 40% marks in internal evaluation to pass. End semester examination will have 70% weightage. A student shall have to score minimum 40% marks in internal evaluation to pass. 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 : 10 Marks b) nternal Test: 20 Marks nternal Test comprises of 40 Marks and hours duration. 2

3 Course Type Semester Course Code Name of Course Theory / Practical Credit Exam Duration in Hours Component of Marks nternal External Total CCCS101 ntroduction to Computer Science and Theory Programming CCCS102 Fundamentals of Computers and Data Theory Core Courses Processing CCCS103 Practical Based on CCCS101 Practical CCCS104 Practical /Viva Based on CCCS102 and Practical Elective Courses Foundation Courses FCCS101 Communication Skills in English Theory Elective Courses (Any One) CECS101 PC Software and Applications Theory CECS102 Desktop Publishing Theory CECS103 Financial Management and Accounting Theory Total

4 Semester: Paper Code: CCCS101 Total Credit : 4 Title of Paper: ntroduction to Computer Science and Programming Unit Description Weighting ntroduction: Core Elements of a DLE, types of objects, operators, overloading, commands, variable, assignment, input, straight line and branching programs, looping constructs, Turing completeness, conditionals, nesting. Problem Solving: Termination, decrementing functions, exhaustive enumeration, brute force, while loop, for loop, approximation, specifications, bisection search. Machine nterpretation of a Decomposition, module, function, abstraction, formal parameter, actual parameter, argument, assert, scope, mapping, stack, last in first out, string, slicing. V Object in Python: Tuples, lists, dictionaries, methods, identifiers, modifying objects, aliasing, mutability Recursion: Dictionaries, modular abstraction, divide and conquer, recursion, tower of Hanoi, base case, Fibonacci Sequence. V Efficiency and Order of Growth: Efficiency, problem reduction, RAM, best case, worst case, expected case, growth, exponential growth, polynomial growth, logarithmic growth, global variable. Memory and Search Methods: Memory, storage, indirection, sorting Basic Text & Reference Books :- 1. Guttag, John. ntroduction to Computation and Programming Using Python, MT Press, SBN: Downey, Allen B. Think Python, Shroff, SBN:

5 Semester: Paper Code: CCCS101 Total Credit : 4 Title of Paper: ntroduction to Computer Science and Programming Unit Description Total Marks Q.1 (A) Answer the Following. (Definitions, Blanks, Full Forms, True/False, Match the Following) Q.1 (B) Medium / Long Questions. (With nternal Option) Q.1 (C) Algorithm/ Pseudo Code/Program in Python. (With nternal Option) 04 Q.2 (A) Answer the Following. (Definitions, Blanks, Full Forms, True/False, Match the Following) Q.2 (B) Medium / Long Questions. (With nternal Option) Q.2 (C) Algorithm/ Pseudo Code/Program in Python. (With nternal Option) V V Q.3 (A) Short / Medium Questions (With nternal Option) 04 Q.3 (B) Medium / Long Questions. (With nternal Option) 06 Q.3 (C) Algorithm/ Pseudo Code/Program in Python. (With nternal Option) Q.4 (A) Short / Medium Questions (With nternal Option) 04 Q.4 (B) Medium / Long Questions. (With nternal Option) 06 Q.4 (C) Algorithm/ Pseudo Code/Program in Python. (With nternal Option) Q.5 (A) Short / Medium Questions (With nternal Option) 04 Q.5 (B) Medium / Long Questions. (With nternal Option) Q.5 (C) Algorithm/ Pseudo Code/Program in Python. (With nternal Option) 04 5

6 Semester: Paper Code: CCCS102 Total Credit : 4 Title of Paper: Fundamental of Computers and Data Processing Unit Description Weighting nformation concept and processing: ntroduction, Data and nformation, Features of nformation, Categories of nformation, Levels of nformation. Concepts of Data: Organization of Data as a file, Types of File, Classification of data files by functions, File Organization. Elements of Electronic Data Processing (EDP): ntroduction to computerized business data processing, Benefits of EDP, Overview of Commercial Application. Number systems: Binary, Octal, Decimal, Hexadecimal, Conversion of Number System ASC, BCD Elements of Computer Systems: ntroduction, Computer Classification, Capabilities and Limitations, Computer Generation nput Units: Functions of nput Units, Types of nput Devices. V Output Units: Types of Output Devices, Types of Printer, Types of VDU, Types of Plotters. Memory: ntroduction, Classification of Memory, Primary Memory, Types of RAM and ROM, Characteristics of Memory. V Data Storage Devices: Secondary storage devices, magnetic media, types of disks, storage principles, magnetic tape, hard disk and floppy disk, optical media, CD-ROM, CD, DVD. Merits, demerits and application of storage devices. Basic Text & Reference Books :- 1. Computer Fundamentals 4/e, Pradeep Sinha, BPB Publications 6

7 Semester: Paper Code: CCCS102 Total Credit : 4 Title of Paper: Fundamental of Computers and Data Processing Unit Description Total Marks Q.1 (A) Answer the Following. (Definitions, Blanks, Full Forms, True/False, Match the Following) Q.1 (B) Medium / Long Questions. (With nternal Option) 08 Q.2 (A) Answer the Following. (Definitions, Blanks, Full Forms, True/False, Match the Following) Q.2 (B) Medium / Long Questions. (With nternal Option) 08 Q.3 (A) Short / Medium Questions (With nternal Option) Q.3 (B) Medium / Long Questions. (With nternal Option) 08 V Q.4 (A) Short / Medium Questions (With nternal Option) Q.4 (B) Medium / Long Questions. (With nternal Option) 08 V Q.5 (A) Short / Medium Questions (With nternal Option) Q.5 (B) Medium / Long Questions. (With nternal Option) 08 7

8 Semester: Paper Code: CCCS103 Total Credit : 4 Title of Paper: Practical Based on CCCS101 Description 1. Understanding DLE: nstalling, Running Programs, Saving and Loading Files 2. Understanding Python Operators. 3. Understanding Branching. 4. Understanding Looping. 5. Understanding Functions and Parameters. 6. Understanding Tuples, Lists, Dictionaries. 7. Understanding Mutability of various objects. 8. Understanding Recursion. 8

9 Semester: Paper Code : CCCS103 Total Credit : 4 Title of Paper: Practical Based on CCCS101 Unit Description Total Marks Q.1 (A) Viva Voce 20 Q.1 (B) Practical

10 Semester: Paper Code: CCCS104 Total Credit : 4 Title of Paper: Practical Based on CCCS102 and Elective Courses Description 1. To understand and implement concept of desktop publishing software 2. To understand and implement the basic concept of Word Processing Software 3. To understand and implement the concept of Presentation Packages 4. To understand and implement the concept of Spreadsheet Packages 10

11 Semester: Paper Code : CCCS104 Total Credit : 4 Title of Paper: Practical Based on CCCS102 and Elective Courses Unit Description Total Marks Q.1 (A) Viva Voce 20 Q.1 (B) Practical

12 Semester: Paper Code: FCCS101 Total Credit : 4 Title of Paper: Communication Skills in English Unit Description Weighting ORAL COMMUNCATON : - Meaning, nature and scope - Principles of effective oral communication - Techniques of effective speech - Meaning and Definition - Process Functions Objectives - mportance Essentials of good communication - Communication barriers - Overcoming communication barriers - Communication: At the college, On the campus, Outside the campus, At the post office, For Business and pleasure, Review. GRAMMER AND USAGE : - The Articles - Nouns & Pronouns - Tenses - Auxiliary verbs ( Model auxiliaries ) - Questions and negatives - Prepositions attached to verbs GRAMMER AND USAGE : - Vocabulary words often confused, Abbreviations and Numerals - Active-Passive - Conjunctions - Reported speech - Translation V BUSNESS COMMUNCATON - Enquiries and Replies - Quotations - Voluntary offers - Placing of orders - Cancellations of orders - Complaints and Adjustments V NFORMATONTECHNOLOGYFOR COMMUNCATON - Word Processor-Telex-Facsimile(Fax) - -Voic -nternet Multimedia-Teleconferencing - Mobile Phone Conversation - Video Conferencing - SMS - Telephone Answering Machine - Advantages and limitations of these types. Basic Text & Reference Books :- 1. Creative English Communication By N.Krishnaswami and T.Sriraman. 2. Contemporary English Grammar, Structure and Composition By David Green.(MacMillan) 3. Essential of Business Communication By Rajendra Pal and J.S.Korlahalli(S.Chand & Sons) 4. Business correspondence & Report By R.C.Sharma & Krishna Mohan. 5. Business Communication Dr. S.V. Kadvekar, Prin. Dr. C.N. Rawal and Prof.Ravindra Kothavade Diamond Publications, Pune. 12

13 Semester: Paper Code: FCCS101 Total Credit : 4 Title of Paper: Communication Skills in English Unit Description Total Marks Q.1 (A) Short /Medium Questions. (With nternal Option) 06 V V Q.1 (B) Medium / Long Questions. (With nternal Option) 08 Q.2 (A) Short /Medium Questions. (With nternal Option) 06 Q.2 (B) Medium / Long Questions. (With nternal Option) 08 Q.3 (A) Short / Medium Questions (With nternal Option) 06 Q.3 (B) Medium / Long Questions. (With nternal Option) 08 Q.4 (A) Short / Medium Questions (With nternal Option) 06 Q.4 (B) Medium / Long Questions. (With nternal Option) 08 Q.5 (A) Short / Medium Questions (With nternal Option) 06 Q.5 (B) Medium / Long Questions. (With nternal Option)

14 Semester: Paper Code: CECS101 Total Credit : 4 Title of Paper: PC Software and Applications Unit Description Weighting Operating System : ntroduction, Types of Operating System DOS: nternal & External commands, file name, wildcard character, autoexec.bat & config.sys, hidden system files. Commands like DR, MKDR, CHDR, COPY, TYPE, DELETE,RENAME, PRNT, FORMAT, SYS, LABEL, CHKDSK, SCANDSK, ATTRB, PATH, PROMPT, DATE, TME, BACKUP, RESTORE etc. WNDOWS: Concept of Window, icon, menu, picture Control Panel etc. Desktop : my computer, network neighbourhood, recycle bin etc., start menu, windows explorer, long & short file names, creating folder, copying & moving files, deleting files, creating shortcuts, adding & deleting from start menu, adding & removing hardware, scanning disk, defragmentation, security features, installing other software etc. ntroduction to personal computers Significance and use of a typical PC Operating System ntroduction to Editors Classification of PC Software ntroduction to word processing Examples of some popular word processing packages Uses of word processors Creation, editing, and formatting of documents Mail merge facility in word processors Global search & replacement of text Page layout and printing of a document Spelling checker, Tables, Templates, Advanced features ntroduction to spreadsheets Examples of some popular spreadsheet packages Uses of spreadsheet packages V Addressing cells in a spreadsheet Building Spreadsheets using formulas, conditional calculations, builtin functions Graph-plotting facilities Sorting and filtering data Using externally created data files in a spreadsheet package V What-if analysis and protection facility in spreadsheets Using pivot tables Applications of spreadsheets ntroduction to presentation tools Creating a presentation Formatting slides Slide transition and adding special effects nserting pictures, sound, charts Basic Text & Reference Books :- 1. Taxali R.K : PC Software for windows made simple, Tata McGraw-Hill Publishing Co. Ltd. 2. Manuals of PC Software 14

15 Semester: Paper Code: CECS101 Total Credit : 4 Title of Paper: PC Software and Applications Unit Description Total Marks Q.1 (A) Short /Medium Questions. (With nternal Option) 06 V V Q.1 (B) Medium / Long Questions. (With nternal Option) 08 Q.2 (A) Short /Medium Questions. (With nternal Option) 06 Q.2 (B) Medium / Long Questions. (With nternal Option) 08 Q.3 (A) Short / Medium Questions (With nternal Option) 06 Q.3 (B) Medium / Long Questions. (With nternal Option) 08 Q.4 (A) Short / Medium Questions (With nternal Option) 06 Q.4 (B) Medium / Long Questions. (With nternal Option) 08 Q.5 (A) Short / Medium Questions (With nternal Option) 06 Q.5 (B) Medium / Long Questions. (With nternal Option)

16 Semester: Paper Code: CECS102 Total Credit : 4 Title of Paper: Desktop Publishing Unit Description Weighting ntroduction Publishing meaning and planning Graphics and desktop publishing, Publication purpose and effectiveness, ntroduction to a popular desktop publishing software and key features Using DTP Software- (Page Maker) Working with document - creating, saving, printing, etc. Working with tools and pallets, navigation Working with margins, indents, tabs and ruler Working with text, paragraph and graphics Using DTP Software- (Page Maker) Working with multipage documents Working with master pages, hyperlinks Working with frames, text frames, Using tables Using styles and story board, Working with objects, forms Working with templates, mporting and exporting V Corel Draw ntroduction, Surfing the nterface, Getting to know the status bar. Getting to scrollbar and color palette. Understanding Dialog box, Exploring the standard toolbar, Toolbox. Browsing the Menus, File, Edit, View, Layout, Arrange, Effect, Bitmaps, Text, Tools, Drawing and working with Lines and Curves. Drawing and working with Rectangles, Ellipse and Polygons, Adding Text and Formatting Text, Working with Objects, Defining Outline and Fill Color, Working with outlines, The outline pen dialog, The outline color dialog, Understanding fills, Fountain fills, Pattern fills, Creating Special Effects, Using an envelope, Creating perspective effects, Blending objects V Photo Shop Photoshop's Environment Graphics and Environment Elements Navigating in Photoshop. Sizing mages, mage Size and Resolution Cropping. Selecting mage Areas. The Rectangular and Elliptical Marquee Tools. The Lasso Tools and Saving Selections. The Magic Wand Tool. The Magnetic Lasso Tool and Modifying Selections Layers, Feathering Edges: mage Modes, Color and Painting, Selecting Colors, Painting Tools and the Clone Stamp Tool. Text, Layer Effects, and Filters, Filters, Merging, and Flattening. Adjusting mages, Brightness/Contrast and Levels Adjustment Layers, Toning Tools and Hue/Saturation Basic Text & Reference Books :- 1. Jain S. : PageMaker 7 Training Guide, BPB, Manuals of Photoshop 3. Connally C. : PageMaker (R) 7 The Complete Reference, McGraw-Hill/Osborne Media, Mastering Corel Draw by Rick Altman, BPB 4th Edition 16

17 Semester: Paper Code: CECS102 Total Credit : 4 Title of Paper: Desktop Publishing Unit Description Total Marks Q.1 (A) Short /Medium Questions. (With nternal Option) 06 V V Q.1 (B) Medium / Long Questions. (With nternal Option) 08 Q.2 (A) Short /Medium Questions. (With nternal Option) 06 Q.2 (B) Medium / Long Questions. (With nternal Option) 08 Q.3 (A) Short / Medium Questions (With nternal Option) 06 Q.3 (B) Medium / Long Questions. (With nternal Option) 08 Q.4 (A) Short / Medium Questions (With nternal Option) 06 Q.4 (B) Medium / Long Questions. (With nternal Option) 08 Q.5 (A) Short / Medium Questions (With nternal Option) 06 Q.5 (B) Medium / Long Questions. (With nternal Option)

18 Semester: Paper Code: CECS103 Total Credit : 4 Title of Paper: Financial Management and Accounting Unit Description Weighting Accounting principles, concepts and conventions, double entry system of accounting, types of accounts journalizing, introduction of basic books of accounts of sole proprietary concern, control accounts for debtors and creditors, closing of books of accounts and preparation of trial balance. Trading and profit and loss account and balance sheet of sole proprietary concern with normal closing entries.final accounts of partnership firms and limited company. Financial Management: Meaning, role and importance of financial management. Ratio analysis: Meaning, advantages, limitations, types of ratios and their usefulness. Costing: Nature, importance and basic principles, methods, elements of cost, cost sheet, pro-forma of cost-sheet, tender price. Budget and Budgetary Control: Nature and scope, importance methods of finalization of master budget and functional budgets. Standard Costing: Nature and scope, computation and analysis of variances with reference to material cost, labor cost, interpretation of the variances. V Marginal Costing: Meaning and scope of marginal costing, uses and limitations of marginal costing, breakeven point, simple example on decision making. V Accounting Software Role of computers in commerce, ntroduction to Accounting Packages, Hardware and software requirement for tally, Features of tally, Flow of Accounting package tally through examples, Various Phases of Accounting Cycle in Tally, Tax calculation & tally Basic Text & Reference Books :- 1. Accounting & Financial Management by D.R.Patel, Atul Prakashan 2. Manuals of Tally 18

19 Semester: Paper Code: CECS103 Total Credit : 4 Title of Paper: Financial Management and Accounting Unit Description Total Marks All Q.1 MCQ 14 14,,,V V, V Q.2 (A) Short /Medium Questions. (With nternal Option) 06 Q.2 (B) Medium / Long Questions. (With nternal Option) 08 OR 14 Q.2 Long Question Q.3 (A) Short / Medium Questions (With nternal Option) 06 Q.3 (B) Medium / Long Questions. (With nternal Option) 08 OR 14 Q.3 Long Question Q.4 (A) Short / Medium Questions (With nternal Option) 06 Q.4 (B) Medium / Long Questions. (With nternal Option) 08 OR 14 Q.4 Long Question Q.5 (A) Short / Medium Questions (With nternal Option) 06 Q.5 (B) Medium / Long Questions. (With nternal Option) Q.5 Long Question OR 14 19

20 Course Type Semester Course Code Name of Course Theory / Practical Credit Exam Duration in Hours Component of Marks nternal External Total CCCS205 ntroduction to Data Structures and Theory Algorithms CCCS206 ntroduction to nternet and Web Theory Core Courses Programming CCCS207 Practical Based on CCCS205 Practical CCCS208 Practical Based on CCCS206 and Elective Practical Courses Foundation Courses FCCS202 Foundation Course of BAOU Theory FCCS203 Mathematical Foundation of Computer Science- Elective Courses CECS204 Elements of C Programming Theory (Any One) CECS205 Digital Computer Electronics Theory Total

21 Semester: Paper Code: CCCS205 Total Credit : 4 Title of Paper: ntroduction to Data Structure and Algorithm Unit Description Weighting ntroduction Variables, Data Types, Data Structures, Abstract Data Types (ADTs) What is an Algorithm? Why the Analysis of Algorithms? Goal of the Analysis of Algorithms, What is Running Time Analysis? How to Compare Algorithms, What is Rate of Growth? Commonly Used Rates of Growth, Types of Analysis, Asymptotic Notation, Big-O Notation, Omega-Ω Notation, Theta-ϴ Notation, Why is it called Asymptotic Analysis? Guidelines for Asymptotic Analysis, Properties of Notations, Commonly used Logarithms and Summations, Master Theorem for Divide and Conquer, Divide and Conquer Master Theorem: Problems & Solutions, Master Theorem for Subtract and Conquer Recurrences, Variant of Subtraction and Conquer Master Theorem, Method of Guessing and Confirming, Amortized Analysis Algorithms Analysis: Problems & Solutions Recursion and Backtracking ntroduction, What is Recursion? Why Recursion? Format of a Recursive Function, Recursion and Memory (Visualization), Recursion versus teration, Notes on Recursion, Example Algorithms of Recursion, Recursion: Problems & Solutions, What is Backtracking? Example Algorithms of Backtracking, Backtracking: Problems & Solutions Linked Lists What is a Linked List? Linked Lists ADT, Why Linked Lists? Arrays Overview, Comparison of Linked Lists with Arrays and Dynamic Arrays, Singly Linked Lists, Doubly Linked Lists, Circular Linked Lists, A Memory-efficient Doubly Linked List, Unrolled Linked Lists Skip Lists, Linked Lists: Problems & Solutions Stacks What is a Stack? How Stacks are Used, Stack ADT, Applications mplementation, Comparison of mplementations, Stacks: Problems & Solutions Queues What is a Queue?, How are Queues Used, Queue ADT, Exceptions Applications, mplementation, Queues: Problems & Solutions Trees What is a Tree? Glossary, Binary Trees, Types of Binary Trees, Properties of Binary Trees, Binary Tree Traversals, Generic Trees (N-ary Trees), V Threaded Binary Tree Traversals (Stack or Queue-less Traversals), Expression Trees, XOR Trees, Binary Search Trees (BSTs), Balanced Binary Search Trees, AVL (Adelson-Velskii and Landis) Trees, Other Variations on Trees V Algorithms Design Techniques ntroduction, Classification, Classification by mplementation Method Classification by Design Method, Other Classifications Greedy Algorithms ntroduction, Greedy Strategy, Elements of Greedy Algorithms, Does Greedy Always Work? Advantages and Disadvantages of Greedy Method, Greedy Applications, Understanding Greedy Technique Greedy Algorithms: Problems & Solutions Divide and Conquer Algorithms Basic Text & Reference Books :- 1. Data Structures And Algorithmic Thinking With Python, Narasimha Karumanchi, CareerMonk Publications 2. ntroduction to Algorithms, Thomas H. Cormen, Prentice-Hall of ndia 21

22 Semester: Paper Code: CCCS205 Total Credit : 4 Title of Paper: ntroduction to Data Structure and Algorithm Unit Description Total Marks Q.1 (A) Answer the Following. (Definitions, Blanks, Full Forms, True/False, Match the Following) Q.1 (B) Medium / Long Questions. (With nternal Option) 08 Q.2 (A) Answer the Following. (Definitions, Blanks, Full Forms, True/False, Match the Following) Q.2 (B) Medium / Long Questions. (With nternal Option) 08 Q.3 (A) Short / Medium Questions (With nternal Option) Q.3 (B) Medium / Long Questions. (With nternal Option) 08 V Q.4 (A) Short / Medium Questions (With nternal Option) Q.4 (B) Medium / Long Questions. (With nternal Option) 08 V Q.5 (A) Short / Medium Questions (With nternal Option) Q.5 (B) Medium / Long Questions. (With nternal Option) 08 22

23 Semester: Paper Code: CCCS206 Total Credit : 4 Title of Paper: ntroduction to nternet and Web Programming Unit Description Weighting The nternet and Web Browsers ntroduction to the nternet, History of the nternet Services provided by the nternet, Some basic terminology and concepts (WWW, URL, webpage, web site, web servers, web browsers, HTML, search engines, etc.) Components of a browser window, Use of menus and toolbar buttons History and navigation, Setting basic options, security and privacy precautions, Managing bookmarks/favorites, Tabbed browsing, downloading files, saving web pages for offline reading Web Page Designing- An introduction to HTML HTML tags Structure of an HTML document Text and paragraph formatting Ordered and unordered lists, nested lists Web Page Designing- HTML tables Hyperlinks mages Frames, framesets, nested framesets V Web Page Designing- Designing HTML forms, Webpage layout, ntroduction to a selected website development tool, Key features of the website development tool, Developing websites using the tool, Defining Style with HTML Tags, Features of Style Sheet. V ntroduction to Java Script: ntroduction, Using operators, control statements, user defined functions, working with built-in objects: window object, document object, string object, array object and date object. Handling events in JavaScript A brief ntroduction to Dreamweaver, Planning and creation of web Site, Site Management Basic Text & Reference Books :- 1. van Bayross, Web Enabled Commercial Applications Development using HTML, DHTML, Javascript, Perl CG, BPB, Douglas E Comer: The nternet, PH, Second Edition, May Xavier C : World Wide Web Design With HTML, Tata McGraw Hill Publication,

24 Semester: Paper Code: CCCS206 Total Credit : 4 Title of Paper: Fundamental of nternet and Web Programming Unit Description Total Marks Q.1 (A) Answer the Following. (Definitions, Blanks, Full Forms, True/False, Match the Following) Q.1 (B) Medium / Long Questions. (With nternal Option) 08 Q.2 (A) Answer the Following. (Definitions, Blanks, Full Forms, True/False, Match the Following) Q.2 (B) Medium / Long Questions. (With nternal Option) 08 V Q.3 (A) Short / Medium Questions (With nternal Option) Q.3 (B) Medium / Long Questions based on Table Designing. (With nternal Option) Q.4 (A) Short / Medium Questions (With nternal Option) Q.4 (B) Medium / Long Questions. (With nternal Option) 08 V Q.5 (A) Short / Medium Questions (With nternal Option) Q.5 (B) Java Script Program. (With nternal Option) 08 24

25 Semester: Paper Code: CCCS207 Total Credit : 4 Title of Paper: Practical Based on CCCS205 Unit Description Weighting Recursion and Backtracking 1. Solving Tower of Hanoi Problem. 2. Given an array, check whether the array is sorted or not using recursion. 3. Generate all the binary strings with n bits. Assume A[0 n-1] is an array of size n. Linked List 4. mplement Stack using Linked List. 5. Check whether the given Linked List is either null terminated or not, if there is a cycle, find the start node of the loop. 6. nsert a node in sorted Linked List. 7. How to display a Linked List from end? Stacks and Queues 8. Evaluate postfix expressions with Stack. 9. Given a Stack, how to reverse the Stack using only Stack operations push and pop. 10. How to implement three Stacks in one array? Every node in array should be used. 11. Given an array of elements, replace every element with nearest greater element on the right of that element. 12. mplement a Queue using just two Stacks, How can we efficiently implement one Stack using two Queues. 13. Given a string, check whether it is palindrome or not using a double ended queue. Trees 14. Searching an element in a binary tree (with and without recursion). 15. nserting an element into a binary tree. 16. Finding deepest node of the binary tree. 17. For a given binary tree (not threaded) how do we find a pre-order successor? NOTE: This list is not exhaustive; the instructor should formulate appropriate problems wherever required. 25

26 Semester: Paper Code : CCCS207 Total Credit : 4 Title of Paper: Practical Based on CCCS205 Unit Description Total Marks Q.1 (A) Viva Voce 20 Q.1 (B) Practical

27 Semester: Paper Code: CCCS208 Total Credit : 4 Title of Paper: Practical Based on CCCS206 and Elective Courses Description 1. Develop a simple web page having attractive background color, text color. 2. Develop a HTML document for a web page of your course detail. Design a page with attractive font, suitable heading and horizontal rules (use paragraph and line tag). 3. Develop a HTML document with an example of Ordered Lists and Unordered List. 4. Develop a HTML document for a web page of your favorite teacher. Design a page with attractive color combination, suitable headings and appropriate text styles. 5. Develop a HTML document for a web page having the mage and also indicate the another image as background. 6. Develop a HTML document for a web page with an example of Table Format having the information of Hardware and Software used in your lab. 7. Develop a HTML document for a web page of your Bio-Data with use of Table tag. 8. Develop a HTML document for a web page with use of frame and frameset tag. 9. Develop a HTML document for a web page which linking with another pages. 10. Develop a HTML document having the Student nformation Form.(Use all necessary tags) 11. Develop an HTML document which will use style sheets. Use inline style sheet and external style sheet. 12. Develop an HTML document for a web page of your favorite National Leader. Design the page with an attractive color combination, with suitable headings and horizontal rules. 13. Write an HTML document with an example of Table format to print your Telephone Bill. Write an HTML code for designing the subscription form of mail account in the website with appropriate fields. 14. Looping and Branching practices of Java Script 15. User defined practices of Java Script 16. Java Script implementation of objects 27

28 Semester: Paper Code : CCCS208 Total Credit : 4 Title of Paper: Practical Based on CCCS206 and Elective Courses Unit Description Total Marks Q.1 (A) Viva Voce 20 Q.1 (B) Practical

29 Semester: Paper Code: FCCS203 Total Credit : 4 Title of Paper: Mathematical Foundation of Computer Science- Unit Description Weighting Set Theory ntroduction of Set Types of Sets Operations on Sets Venn Diagram Laws related to set theory Numerical based on operations on sets and Venn diagram Application and mportance of Set Theory in Computing Science Matrices ntroduction of Matrix Types of Matrices Operations on Matrices Cramer s Rule Adjoin, Minor and nverse of a Matrix Solving equation using matrices Determinant of Matrix Application and mportance of Matrices in Computing Science Graph Theory ntroduction of Graph Multi-graph, Degree of vertex Paths, connectivity, sub-graph Connected components, cut points, bridges Special Graphs: complete, regular and bipartite graphs Matrices and Graphs Application and mportance of Graph Theory in Computing Science V Functions ntroduction to Functions Domain and Range Types of Functions Numerical based on functions V Elementary Data Analysis Discrete and continuous frequency distribution, Cumulative Frequency, Distribution, Graphical Representation, Measures of central tendency: Mean, Median, Mode. Basic Text & Reference Books :- 1. S.Lipschutz and Marc Lars Lipson : Discrete Mathematics, Schaum s series (nterational edition,1992). 2. Vinay Kumar: Discrete Mathematics (BPB Publication, First edition-2002) 3. S. C. Gupta, Fundamentals of Statistics, Himalaya Publishing House,

30 Semester: Paper Code: FCCS203 Total Credit : 4 Title of Paper: Mathematical Foundation of Computer Science- Unit Description Total Marks Q.1 (A) Answer the Following. (Definitions, Blanks, Full Forms, True/False, Match the Following) Q.1 (B) Medium / Long Questions. (With nternal Option) 08 Q.2 (A) Answer the Following. (Definitions, Blanks, Full Forms, True/False, Match the Following) Q.2 (B) Medium / Long Questions. (With nternal Option) 08 V Q.3 (A) Short / Medium Questions (With nternal Option) Q.3 (B) Medium / Long Questions based on Table Designing. (With nternal Option) Q.4 (A) Short / Medium Questions (With nternal Option) Q.4 (B) Medium / Long Questions. (With nternal Option) 08 V Q.5 (A) Short / Medium Questions (With nternal Option) Q.5 (B) Medium / Long Questions. (With nternal Option) 08 30

31 Semester: Paper Code: CECS204 Total Credit : 4 Title of Paper: Elements of C Programming Unit Description Weighting Concept of Algorithm, Flowchart and Languages Concept of an algorithm and a flow chart, need and definition Symbols used to draw a flow chart Typical (primitive) examples of flow charts and algorithms Generations of computer languages High-level and low-level languages Translators, ntroduction to editors and details about one of the editors Basics of Programming Problem analysis, Variables, expressions & manipulation Data types in a high-level language, operators, /O statements, Assignment statements, Control strategies, Conditions Structured Programming and Arrays, Strings Loop statements Common standard library functions Arrays, Strings and string handling functions V Functions and Pointers Functions and Working with functions, Pointer, Pointer Arithmetic and Pointer Manipulations, Calling functions, passing arguments V Structure, Union and File Management Structure and Union, File Management, Command Line Arguments Basic Text & Reference Books :- 1. Balaguruswami : Programming in ANS C., Tata McGraw Hill Publication. 2. Kernighan B., Ritchie D. : The C Programming Language, Prentice Hall. 3. Cooper H. & Mullish H : The Sprit of C, Jaico Publication House, New Delhi. 31

32 Semester: Paper Code: CECS204 Total Credit : 4 Total Marks : Title of Paper: Elements of C Programming 70 Unit Description Total Marks Q.1(A) Multiple Choice Questions (MCQ) All Q.1 (B) Short Questions (Definitions, Blanks, Full Forms, True/False, Match the Following) 08, Q.2(A) Medium Questions (Any Two) Q.2(B) Medium Questions / Long Questions (Any Three) 08, Q.3(A) Medium Questions / Long Questions (Any Two) Q.3(B) Medium Questions / Long Questions (Any Two) 08,V Q.4 (A) Short / Medium Questions (With nternal Option) Q.4 (B) C Program. (With nternal Option) 08 V,V Q.5 (A) Short / Medium Questions (With nternal Option) Q.5 (B) C Program. (With nternal Option) 08 32

33 Semester: Paper Code: CECS205 Total Credit : 4 Title of Paper: Digital Computer Electronics Unit Description Weighting Number Systems- Binary, Octal, Decimal, Hexadecimal, Floating Point representation of numbers, Number base conversion, Binary Addition, Subtraction, Multiplication, Division, 2 complement arithmetic, BCD Numbers, The ASC code,the EXCESS-3 code,the Gray code, Error correcting and correcting method Gates and Boolean Algebra Gates, Boolean algebra, Truth tables Circuit equivalence, De Morgan's theorem Basic Digital Logic Circuits- Usage of Karnaugh maps Encoders, decoders, comparators V Basic Digital Logic Circuits- Half adder, full adder, binary adder-subtractor Multiplexers V Memory Elements & Counters D Flip flops, Shift-left, shift-right and controlled buffer registers Ring counters Basic Text & Reference Books :- 1. Malvino A. P.: Digital Computer Electronics,2nd Edition, Tata McGraw, Hill Pub. Co. Ltd.,New Delhi, Gothmann, William H. : Digital Electronics - An ntroduction to Theory and Practice, 2nd Edition,PH, Tanenbaum A. S. : Structured Computer Organization, 3rd Edition, Prentice-Hall of ndia Pvt. Ltd., Hall Douglas V. : Microprocessors and nterfacing - Programming and Hardware., McGraw Hill Book Company, M.M. Mano : Computer System Architecture, 3rd Edition, Pearson Education,

34 Semester: Paper Code: CECS205 Total Credit : 4 Title of Paper: Digital Computer Electronics Unit Description Total Marks Q.1 (A) Answer the Following. (Definitions, Blanks, Full Forms, True/False, Match the Following) Q.1 (B) Medium / Long Questions. (With nternal Option) 08 Q.2 (A) Answer the Following. (Definitions, Blanks, Full Forms, True/False, Match the Following) Q.2 (B) Medium / Long Questions. (With nternal Option) 08 V Q.3 (A) Short / Medium Questions (With nternal Option) Q.3 (B) Medium / Long Questions. (With nternal Option) 08 Q.4 (A) Short / Medium Questions (With nternal Option) Q.4 (B) Medium / Long Questions. (With nternal Option) 08 V Q.5 (A) Short / Medium Questions (With nternal Option) Q.5 (B) Medium / Long Questions. (With nternal Option) 08 34

35 Semester Course Type Course Code Name of Course Theory / Practical Credit Exam Duration in Hours Component of Marks nternal External Total CCCS309 Object Oriented Programming with C++ Theory CCCS310 Database Management System Theory CCCS311 Practical Based on CCCS309 Practical Core Courses CCCS312 Practical Based on CCCS310 and elective Practical courses Foundation Courses FCCS304 Mathematical Foundation of Computer Theory Science- Elective Courses CECS306 Operating Systems Theory (Any One) CECS307 Advanced Computer Architecture Theory Total

36 Semester: Paper Code: CCCS309 Total Credit : 4 Title of Paper: Object Oriented Programming with C++ Unit Description Weighting Object Oriented Programming (OOP) Concepts and ntroduction to C++ Structured programming vs. object oriented programming Basic OOP concepts : objects, classes, encapsulation, data hiding, inheritance, polymorphism ntroduction to C++: structure of a C++ program, data types, variables, constants, expressions, statements and operators Usage of header files Control flow statements : if else, for loop, while loop, do while loop, switch, break and continue Basic /O in C++ Arrays in C++ : introduction, declaration, initialization of one, two and multi-dimensional arrays, operations on arrays Working with strings : introduction, declaration, string manipulation and arrays of string Classes and objects in C++ Constructors : default, parameterized, copy, constructor overloading and destructor Access specifiers, implementing and accessing class members Working with objects: constant objects, nameless objects, live objects, arrays of objects. ntroduction to functions, library and user-defined functions, parameters passing, default arguments Functions overloading, inline functions, friend functions and virtual functions nheritance: ntroduction, derived class declaration, forms of inheritance, nheritance and member access ability, constructor and destructor in derived class, construction invocation and data member initialization. V Operator overloading : ntroduction, overloaded operators, unary operator overloading, operator keyword, operator return values, binary operators overloading, overloading with friend function Usages of Pointers in C++ : basic overview Dynamic memory allocation V Files : ntroduction and applications File operations: open, read, write, seek and close, Command Line Arguments. Exception Handling, Components of exception handling and its example, Namespaces: The Name conflict problem, Using Namespaces, Defining Namespaces, Unnamed Namespaces, Nested namespaces, Namespace Aliases, std Namespace Basic Text & Reference Books :- 1. Object Oriented Programming with C++ by E. Balagurusamy, Tata McGraw-Hill. 2. Object Oriented Programming in Turbo C++ by Robert Lafore, Galgotia Publications. 3. Programming with ANS C++ by Bhusan Trivedi 36

37 Semester: Paper Code: CCCS309 Total Credit : 4 Title of Paper: Object Oriented Programming with C++ Unit Description Total Marks All,,, V Q.1 (A) Multiple Choice Question Q.1 (B) Answer the following. (With nternal Option) (Definitions, Blanks, Full Forms, True/False, Match the Following) Q.2 (A) Short / Medium Questions (With nternal Option) Q.2 (B) Medium / Long Questions. (With nternal Option) 08 Q.3 (A) Short / Medium Questions (With nternal Option) Q.3 (B) Medium / Long Questions. (With nternal Option) Q.4 (A) Short / Medium Questions (With nternal Option) Q.4 (B) C++ Program. (With nternal Option) V, V Q.5 (A) Short / Medium Questions (With nternal Option) Q.5 (B) C++ Program. (With nternal Option) 08 37

38 Semester: Paper Code: CCCS310 Total Credit : 4 Title of Paper: Database Management System Unit Description Weighting Database Management System ntroduction Definition of DBMS File processing system Vs DBMS - Limitation of file processing system - Comparison of File processing system and DBMS Advantages and Disadvantages of DBMS Users of DBMS - Database Designers - Application programmer - Sophisticated Users - End Users Capabilities of good DBMS Overall System structure Data Models ntroduction Object Based Logical Model Record Base Logical Model - Relational Model, Network Model, Hierarchical Model Entity Relationship Model - Entity Set, Attribute, Relationship Set Entity Relationship Diagram (ERD) Extended features of ERD Relational Databases ntroduction Terms - Relation, Tuple, Attribute, Cardinality, Degree, Domain Keys - Super Key, Candidate Key, Primary Key, Foreign Key Relational Algebra Operations - Select, Project, Union, Difference, ntersection, Cartesian, Product, Natural Join V Relational Database Design ntroduction, Anomalies of un normalized database Normalization, Normal Forms: 1 NF, 2 NF, 3 NF, 4 NF, BCNF, DKNF V SQL (Structured Query Language) ntroduction, History Of SQL, Basic Structure DDL Commands: CREATE, ALTER, DROP, TRUNCATE DML Commands: SELECT, NSERT, UPDATE, DELETE Clauses : FROM, GROUP BY, HAVNG, ORDER BY, N Aggregate Functions: AVG, COUNT, FRST, LAST, MN, MAX, SUM Simple Queries and Nested Queries MS Access Forms and Reports Basic Text & Reference Books :- 1. Database System Concepts By Henry Korth and A. Silberschatz 2. An ntroduction to Database System by Bipin Desai 38

39 Semester: Paper Code: CCCS310 Total Credit : 4 Title of Paper: Database Management System Unit Description Total Marks Q.1 (A) Answer the Following. (Definitions, Blanks, Full Forms, True/False, Match the Following) Q.1 (B) Medium / Long Questions. (With nternal Option) 08 Q.2 (A) Answer the Following. (Definitions, Blanks, Full Forms, True/False, Match the Following) Q.2 (B) Medium / Long Questions. (With nternal Option) 08 V Q.3 (A) Short / Medium Questions (With nternal Option) Q.3 (B) Medium / Long Questions. (With nternal Option) Q.4 (A) Short / Medium Questions (With nternal Option) Q.4 (B) Medium / Long Questions. (With nternal Option) 08 V Q.5 (A) Short / Medium Questions (With nternal Option) 06 Q.5 (B) Medium / Long Questions. (With nternal Option)

40 Semester: Paper Code: CCCS311 Total Credit : 4 Title of Paper: Practical Based on CCCS309 Total Marks : 70 Description C++ Program List 1. mplementation of a scope resolution operator, Manipulators and reference variable 2. mplementation of feature of a inline function. 3. mplementation of user defined functions and its various features 4. mplementation of Class and its basic feature 5. mplantation of arrays within a class. 6. Show use of Static Member Function". 7. Concept of "Array of Object". 8. Concept of Object as a Arguments". 9. mplementation of a friend function and its various features. 10. Concept of a returning objects. 11. mplementation of constructors and its various features. 12. Concept of constructing matrix objects. 13. mplementation of destructors. 14. mplantation of overloading various operator 15. mplementation of inheritance and its types 16. Concept of virtual base class. 17. mplementation of pointers to objects. 18. mplementation of this pointer. 19. mplementation of virtual function. 20. mplantation of file and its various operations 21. mplementation of exception handling 40

41 Semester: Paper Code : CCCS311 Total Credit : 4 Title of Paper: Practical Based on CCCS309 Unit Description Total Marks Q.1 (A) Viva Voce 20 Q.1 (B) Practical

42 Semester: Paper Code: CCCS312 Total Credit : 4 Title of Paper: Practical Based on CCCS310 and Elective Courses Total Marks : 70 Unit Description 1. To create ER diagrams using MS Access and at least one other such tool e.g. MS Visio. 2. To create a database from given ER diagram. 3. To understand Primary Key constraint. (Given an ERD, the students shall identify suitable primary keys for each table.) 4. To understand Foreign Key constraint. (dentify suitable relationships and foreign keys and granularity of the relationship for given ERD.) 5. The instructor shall formulate appropriate laboratory exercises which can result into good understanding of : a. Data definition commands: CREATE, ALTER, DROP and TRUNCATE. b. Data manipulation commands: NSERT, UPDATE and SELECT. c. Clauses in SQL : FROM, GROUP BY, HAVNG, ORDER BY, N d. Nested queries e. Aggregate functions: AVG, COUNT, FRST, LAST, MN, MAX, SUM f. Project, Union, Difference, ntersection, Cartesian Product and Natural Join. 6. To create forms and reports in MS Access: student should be able to create a tiny self sufficient application in MS Access. 7. To understand need of normalization: the instructor shall present students with a spreadsheet and show anomalies in it (e.g. data redundancy, multiple updates etc.) and show how relational database can be used to remove these anomalies. 8. To normalize given database (or spreadsheet) up to given normal form. 9. To understand the differences between various normal forms. 10. To understand design of a real life database used by an organization. 42

43 Semester: Paper Code : CCCS312 Total Credit : 4 Title of Paper: Practical Based on CCCS310 and Elective Courses Unit Description Total Marks Q.1 (A) Viva Voce 20 Q.1 (B) Practical

44 Semester: Paper Code: FCCS304 Total Credit : 4 Title of Paper: Mathematical Foundation of Computer Science Total Marks : 70 Unit Description Weighting Connectives ntroduction Statements, Connectives, Negation, Conjunction, Disjunction, Conditional and Bi-conditional, Equivalence of formulae and well-formed formulae, Two state devices, Gate and module, Two level networks, NOR and NAND gates. Poset and Lattices ntroduction, Posets, Lattices as Posets, Lattices as algebraic systems, Sublattices, Complete Lattices, Bounds of Lattices, Modular and distributive lattices Algebraic System Binary operations, Semigroups, Groups, Homomrphism, Rings, ntegral domains, Fields. V Data Analysis Measures of dispersions: range; quartile deviation; mean deviations, Standard deviations V Data Analysis ntroduction to Correlation, Methods of finding coefficient of correlation Rank Correlation Basic Text & Reference Books :- 1. S.Lipschutz and Marc Lars Lipson : Discrete Mathematics, Schaum s series(nterational edition,1992) 2. Vinay Kumar: Discrete Mathematics (BPB Publication,First edition-2002) 3. S. C. Gupta, Fundamentals of Statistics, Himalaya Publishing House,

45 Semester: Paper Code: FCCS304 Total Credit : 4 Title of Paper: Mathematical Foundation of Computer Science - Unit Description Total Marks Q.1 (A) Answer the Following. (Definitions, Blanks, Full Forms, True/False, Match the Following) Q.1 (B) Medium / Long Questions. (With nternal Option) 08 Q.2 (A) Answer the Following. (Definitions, Blanks, Full Forms, True/False, Match the Following) Q.2 (B) Medium / Long Questions. (With nternal Option) 08 V Q.3 (A) Short / Medium Questions (With nternal Option) Q.3 (B) Medium / Long Questions. (With nternal Option) Q.4 (A) Short / Medium Questions (With nternal Option) Q.4 (B) Medium / Long Questions. (With nternal Option) 08 V Q.5 (A) Short / Medium Questions (With nternal Option) Q.5 (B) Medium / Long Questions. (With nternal Option) 08 45

46 Semester: Paper Code: CCCS306 Total Credit : 4 Title of Paper: Operating Systems Total Marks : 70 Unit Description Weighting ntroduction to Operating System, Functions of OS Different types of Operating Systems: Real time, Multi-user, Time sharing OS Structure Monolithic, Layered, Virtual Machine, Client-Server CPU Scheduling: ntroduction to process, process control block, process scheduling FCFS Scheduling, SJF scheduling, Priority scheduling, Round Robin Scheduling Memory Management: Concept, Basic memory management techniques:, Swapping, Virtual Memory System, Demand Paging 1) The Optimal Page Replacement Algorithm 2) The NRU Page Replacement Algorithm 3) The FFO Page Replacement Algorithm 4) The second change Page Replacement Algorithm 5) The clock Page Replacement Algorithm ntroduction to Cooperating process Process Synchronization, Critical Section Problem Two process solution, Multiple process solution Semaphores and race condition, Deadlock and characterization, Starvation, RAD V ntroduction to Linux System & History Features of Linux ntroduction to File System & Memory Management Basic Commands: login, logout, date, man, pwd, who, whoami, dir, ls, cd, mkdir, rmdir Use of Wild card characters and introduction to vi editor ntroduction to environment variable like HOME, PATH, PS1 Types of FAP, use of chmod command V Basic commands like cp, mv, rm, rev, file redirection, grep, cut, paste, find sort commands with example ntroduction to shell script: execution of it, shell script variable, expr, test commands Control structure: if, if..else, case structure teration: while, for construct, break, continue, exit commands Basic Text & Reference Books :- 1. Andrew S. Tanenbaum: Operating System deign & mplementation, Prentice Hall nternational 2. James Peterson and Abraham Silberschatz: Operating System Concept, Addition Wesley 3. Linux Commands nstant reference Bryan Pfaffenberger, BPB Publication 4. Advanced Linux Programming Samuel, Techmedia Publications 46

47 Semester: Paper Code: CCCS306 Total Credit : 4 Title of Paper: Operating Systems Unit Description Total Marks Q.1 (A) Answer the Following. (Definitions, Blanks, Full Forms, True/False, Match the Following) Q.1 (B) Medium / Long Questions. (With nternal Option) 08 Q.2 (A) Answer the Following. (Definitions, Blanks, Full Forms, True/False, Match the Following) Q.2 (B) Medium / Long Questions. (With nternal Option) 08 V Q.3 (A) Short / Medium Questions (With nternal Option) Q.3 (B) Medium / Long Questions. (With nternal Option) Q.4 (A) Short / Medium Questions (With nternal Option) Q.4 (B) Medium / Long Questions. (With nternal Option) 08 V Q.5 (A) Short / Medium Questions (With nternal Option) Q.5 (B) Shell Script Program. (With nternal Option) 08 47