MNPE In Collaboration with. Karnataka State Open University. Manasagangotri, Mysore-6. Syllabus. Diploma in Computer Application

Similar documents
Preface... (vii) CHAPTER 1 INTRODUCTION TO COMPUTERS

Seth Jai Parkash Polytechnic, Damla

CIS 1.5 Course Objectives. a. Understand the concept of a program (i.e., a computer following a series of instructions)

STRUCTURE AND SYLLABUS APPROVED IN THE BOARD OF STUDIES MEETING ON 2001 TO BE EFFECTIVE FROM THE ACADEMIC YEAR

5. (a) What is secondary storage? How does it differ from a primary storage? (b) Explain the functions of (i) cache memory (ii) Register

COURSE OUTCOMES OF M.Sc(IT)

Fundamental of I.T. (c) Application of computer *************

Computer Science (330)

Week. Lecture Topic day (including assignment/test) 1 st 1 st Introduction to Module 1 st. Practical

COURSE: DATA STRUCTURES USING C & C++ CODE: 05BMCAR17161 CREDITS: 05

Total No. of Questions : 18] [Total No. of Pages : 02. M.Sc. DEGREE EXAMINATION, DEC First Year COMPUTER SCIENCE.

SECOND SEMESTER BCA : Syllabus Copy

DEPARTMENT OF COMPUTER APPLICATIONS B.C.A. - FIRST YEAR ( REGULATION) SECOND SEMESTER LESSON PLAN SRM INSTITUTE OF SCIENCE AND TECHNOLOGY

1) What is information system? Describe the basic concepts of information systems.

ADMINISTRATIVE MANAGEMENT COLLEGE

S Y B Voc Software Development Syllabus

LESSON PLAN B.C.A. - FIRST YEAR ( REGULATION) SECOND SEMESTER

M.C.A. DEGREE EXAMINATION, MAY First Year. Paper I INFORMATION TECHNOLOGY. SECTION A (3 15 = 45 marks) Answer any THREE of the following.

M.Sc. (Computer Science) I Year Assignments for May Paper I DATA STRUCTURES Assignment I

ANDHRA MAHILA SABHA ARTS & SCIENCE COLLEGE FOR WOMEN (AUTONOMOUS), NAAC Accredited O.U. CAMPUS, HYDERABAD.

CHOICE BASED CREDIT SYSTEM (With effect from )

M.C.A. FIRST YEAR DEGREE

I Year MCA I Semester L T P To C FOUNDATIONS OF INFORMATION TECHNOLOGY

M.Sc. (Previous) DEGREE EXAMINATION, MAY (Examination at the end of First Year) Computer Science. Paper - I : DATA STRUCTURES

B.Sc. Computer Science (Ancillary)

SAURASHTRA UNIVERSITY

Syllabi & Scheme of Examination BCA-2 nd Year. Website:-

Lesson Plan for Even semester


Jh fouk;d egkfo ky;] xkmjokjk RANI DURGAVATI VISHWAVIDYALAYA, JABALPUR BACHLOR OF COMPUTER APPLICATION BCA SYLLABUS THIRD SEMESTER

SECOND SEMESTER JAVA PROGRAMMING

Big Java Late Objects

Department of Computer Science & Engineering School of Engineering & Technology HNB Garhwal University Srinagar Garhwal

B.C.A. SECOND YEAR

DYNAMIC MEMORY ALLOCATION AND DEALLOCATION

Subject: OBJECT ORIENTED PROGRAMMING WITH C++ Paper (U.G): BCA -231 S. No. Course Outcomes

CERTIFICATE IN WEB PROGRAMMING

Madhya Pradesh Bhoj (Open) University, Bhopal

SUBJECT COMPUTER SCIENCE PAGE 1

(DMCA101) M.C.A. DEGREE EXAMINATION, MAY First Year INFORMATION TECHNOLOGY

JAVA PROGRAMMING. Unit-3 :Creating Gui Using The Abstract Windowing Toolkit:

LIST OF EXPERIMENTS. (1) (Office Automation)

SPLIT-UP SYLLABUS ----CHENNAI REGION COMPUTER SCIENCE (Code: 083) Class-XII Academic Session

Syllabus for Computer Science General Part I

MAHARAJA KRISHNAKUMARSINHJI BHAVNAGAR UNIVERSITY NAAC Accreditation Grade B (With effect from Academic Year: )

Personalised Learning Checklist ( ) SOUND

M.C.A. DEGREE EXAMINATION, DEC First Year. Time : 03 Hours Maximum Marks : 75

Week Day Topic Sub Topic Type Hours Pre-Evaluation Experience Collection & Demographics Online 2 OOPS concepts 1

2HS306 Applied Engineering Mathematics [ ]

OBJECT ORIENTED DATA STRUCTURE & ALGORITHMS

C & Data Structures syllabus

SYLLABUS. M.Sc. I.T. Ist Year

B.Sc II Year Computer Science (Optional)

Preface to the Second Edition Preface to the First Edition Brief Contents Introduction to C++ p. 1 A Review of Structures p.

DBMS Lesson Plan. Name of the faculty: Ms. Kavita. Discipline: CSE. Semester: IV (January-April 2018) Subject: DBMS (CSE 202-F)

Diploma in Android Programming (DAP)

Department of Information Technology B.E/B.Tech : CSE/IT Regulation: 2013 Sub. Code / Sub. Name : CS6302 Database Management Systems

INFORMATION TECHNOLOGY

Note: Select one full question from each unit

WITH C+ + William Ford University of the Pacific. William Topp University of the Pacific. Prentice Hall, Englewood Cliffs, New Jersey 07632

OUTCOMES BASED LEARNING MATRIX

2) Explain in detail about different AVL rotation applied on unbalanced trees.

Time : 03 Hours Maximum Marks : 75

1) What is the role of information technology in modern organizations? 2) Discuss the memory and storage devices.

Government of Karnataka SYLLABUS FOR SECOND PUC - COMPUTER SCIENCE (41) SUB-UNITS

GATE 2018 Online Test Series - Computer science Engineering

PGDCA Syllabus Directorate of Distance Education, University of Kashmir Directorate of Distance Education University of Kashmir Srinagar

M.C.A. DEGREE EXAMINATION, MAY First Year Paper - I : INFORMATION TECHNOLOGY. Time : 03 Hours Maximum Marks : 75

LOGIC AND DISCRETE MATHEMATICS

Computer Science and Engineering

Syllabus For F. Y. B. Sc. Semester 1 Core Paper No.: 102 Core Paper Title: Programming in C I 1. Algorithm & Flowcharting 2. Programming Languages & S

SCHEME OF EXAMINATION FOR B.Sc.(COMPUTER SCIENCE) SEMESTER SYSTEM (Regular Course) w.e.f Scheme for B.Sc.-I. Semester-I. Internal Assessment

COURSE STRUCTURE AND SYLLABUS APPROVED IN THE BOARD OF STUDIES MEETING HELD ON JULY TO BE EFFECTIVE FROM THE ACADEMIC YEAR

«Computer Science» Requirements for applicants by Innopolis University

Sub: EM-III (14MA301) Section: A & B Date: 13/07/17 One Mark Questions: 1. a) Write the iterative formula to compute 3 N by Newton s method.

KLiC C Programming. (KLiC Certificate in C Programming)

SIR C R REDDY COLLEGE OF ENGINEERING

R10 SET - 1. Code No: R II B. Tech I Semester, Supplementary Examinations, May

NORTH MAHARASHTRA UNIVERSITY, JALGAON. SYLLABUS FOR F.Y.B.Sc. COMPUTER SCIENCE (With effect from June 2012)

M.Sc. (Previous) DEGREE EXAMINATION, MAY First Year Information Technology. Time : 03 Hours Maximum Marks : 75

CONTENTS. Chapter 1 Introduction and Evolution of Computer

Draw a diagram of an empty circular queue and describe it to the reader.

SUBJECT: INFORMATION TECHNOLOGY

Deccan Education Society s FERGUSSON COLLEGE, PUNE (AUTONOMOUS) SYLLABUS UNDER AUTONOMY. FIRST YEAR B.Sc. COMPUTER SCIENCE SEMESTER I


KLiC C++ Programming. (KLiC Certificate in C++ Programming)

July 2012 Masters in Computer Application (MCA) - Semester 2 MCA 2010 Operating System 4 Credits

Lesson Plan. Week Theory Practical. Lecture Day Topic(including assignment Test) Practical Day

UNIVERSITY POLYTECHNIC B.I.T., MESRA, RANCHI. COURSE STRUCTURE (W.E.F Batch Students) (Total Unit 7.5) Sessional Unit Code. Theory Unit Course

1 P a g e A r y a n C o l l e g e \ B S c _ I T \ C \

DATA STRUCTURES THROUGH C++

Syllabus for Computer Applications

MaanavaN.Com CS1203 OBJECT ORIENTED PROGRAMMING DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING

M.Sc. (Previous) DEGREE EXAMINATION, MAY (Examination at the end of First Year) Computer Science. Time : 03 Hours Maximum Marks : 75

4. BOOLEAN ALGEBRA 8 5. NETWORKING AND OPEN SOURCE SOFTWARE 10

Kumaun University Nainital Proposed Syllabus for B. Sc. Semester program to be implemented from session Subject: Computer Science

Syllabus of B.A./B.Sc. Computer Application

Short Notes of CS201

ASSIGNMENT - 1 M.Sc. DEGREE EXAMINATION, MAY 2019 First Year COMPUTER SCIENCE Data Structures MAXIMUM : 30 MARKS ANSWER ALL QUESTIONS

Silver Oak Engineering College and technology Information Technology Department

Transcription:

MNPE-09425068494 In Collaboration with Karnataka State Open University Manasagangotri, Mysore-6 Syllabus Diploma in Computer Application www.maanarmadaedu.org

Diploma in Computer Application Programme Structure (Face to Face) Code Course Title Credits 1st Semester DCA101 Computer Fundamentals and Windows Based Application 3 DCA102 Communication Skills in English 3 DCA103 Programming in C 3 DCA104 Data Structure 3 DCA105 C Programming Lab 2 DCA106 Windows based Application lab 2 Total Credits 2nd Semester 16 Code Course Title Credits DCA201 Mathematics 3 DCA202 Computer Organization and Architecture 3 3 DCA203 DBMS 3 DCA204 OOPS with C++ 2 DCA205 C++ Lab 2 DCA206 Data Structure Lab 3 Total Credits 16 Detailed Syllabus Semester I DCA101 : Computer Fundamentals and Windows Based Applications Introduction to Computers, Need for Computer Literacy. Computer: The Definition, Basic Anatomy of Computers, Characteristics of Computers, Evolution of Computers, The Computer Generations

Section 2 Unit-4 Section 3 Section 4 Unit- 7 Section 5 Section 6 1 Section 7 2 Basic Computer Organization Introduction, Components of a Digital Computer. The Input Unit, The Output Unit, The Central Processing Unit, The Control Unit, The Main Memory Unit, Storage Unit. Number Systems Introduction, Classification of Number System, Different Number Systems, Conversions, Arithmetic Operations in Binary Systems. Processor and Memory Introduction, the Central Processing Unit, Registers, Instruction Sets, Program Interrupts, Processor Speed Memory, Memory Unit. Main Memory Organization, Main Memory Capacity, Other Types of Memory. Secondary Storage Devices Introductions, Need of Secondary Storage Devices, Characteristics of Secondary Storage Devices, Types of Storage Devices. Magnetic Tape Systems, Magnetic Disk, Types of Disks, Optical Disk, Mass Storage Devices, Storage Hierarchy. Input and Output Devices Introductions, Input Devices, Data Scanning Devices, Digitizer, Electronic Card Reader, Voice Recognition Devices. Vision Input System, Output Devices, Voice Response System, Screen Image Projector. Computer Languages Introduction, Analogy with Natural Languages, Computer Programming Languages, Low Level Languages, High Level Languages (HLL).1

3 4 Section 8 5 6 7 Compiler Based and Interpreter based Language, Some High-level Languages, Some more High-level Languages. User-Friendly Languages, Object Oriented Languages, Characteristics of a Good Programming Language, Selecting a Language for coding an application Subprogram. Application Software Packages and Internet Introductions, Word Processor Packages, Database Management Packages, Spreadsheet Packages, Office Automation Packages (Microsoft Office 2000). Desktop Publishing Software, Graphics, Multimedia and Animation Software, Application Software to Personal Assistance Package. Uses of the Internet Basic Services of Internet, WWW Browsers, Microsoft Internet Explorer (IE). 8 Internet Explorer Keyboard Shortcuts, Cookies, Browser Terms in Netscape Navigator and Internet Explorer. 1. Introduction To Computers By Subramanian 2. Peter Norton's Introduction To Computers By Norton, Peter 4. Pc Software Made Simple By Taxali, Ravi Kant DCA102 : Communication Skills in English Section 1 Section 2 Section- 3 Unit- 7 Introduction Sentence, Kinds of Sentences, Positive, Negative. Statement, Interrogative, Exclamatory. BASIC GRAMMAR Introduction, Subject Verb Agreement, Articles, Countable and Uncountable Nouns. Countable Nouns, Uncountable Nouns, Nouns Used as Countable as well as Uncountable. Writing Names with and without "the", Concepts of Vocabulary Building. Simple Rules for Pronunciation and Intonation, Prepositions. TENSES Present Tense-Types, Past Tense-Types, Future Tense, Modal Auxiliary Verbs:Could, Would

Section- 4 Section- 6 1 DEBATES and GROUP DISCUSSION Debates, Types of Debates, Rules for Debate,Advantages of Debate, Disadvantage. Group Discussion, Technique of Group Discussions, Qualities Needed for Group Discussion, Strategies for Group Discussions: Do's and Don'ts, Role Playing. WRITING SKILLS Paragraph and Précis writing, Business Report Writing, Resume Writing, Essay Writing, Script Writing, Business Correspondence. CONNVERSATION-FACE TO FACE Formal Conversation, Informal Conversation. 1. English Grammar By Thomson and Martinet 2. Essays by Samuel Smiles 3. Write Better, Read Better : Reader's Digest Publication DCA103 Programming in C Section- 1 Units- 1 Section- 2 Section- 3 Section- 4 Origin and Introduction Programming languages About C, Evolution of C, Structure of a C Program, Compilers & Interpreters Compiling a C Program, Pseudo Codes, A Simple C Program. Data Types, Variables and Constants Data Types Variables, Constants Operators, Type Modifiers and Expressions Operators Type Modifiers Expressions Type Definitions Using typedef. Introduction to Input / Output Console I/O Functions Unformatted Console I/O Functions. Control Constructs Control Statements, Conditional Statements, Loops in C The break Statement, The Continue Statement. Arrays Introduction to Arrays One Dimensional Array Strings Two Dimensional, Array Multidimensional Array. Functions Introduction to Functions, Function Declaration and Prototypes, Storage Classes Recursion in Function.

Section- 6 Unit-6 Unit-7 Section- 7 Section- 8 Section- 9 1 Pointers Introduction to Pointers, Pointer Notation, Pointer Declaration and Initialization, Accessing Variable through Pointer, Pointer Expressions. Pointers and One Dimensional Arrays, Arrays of Pointers, Pointer to Pointers, Pointers and Functions. Structures and Unions Structure Definition, Structure Initialization, Arrays of Structures, Arrays within Structures, Structures within Structures, Passing Structures to Functions. Structure Pointers, Union Definition and Declaration, Accessing a Union Member, Initialization of a Union Variable, Use of User Defined Type Declarations. Linked List Dynamic Memory Allocation, Linked List, Basic List Operations. File Handling in C What is a File, Defining and Opening a File, Functions for Random Access to Files. 1. Programming in C By Stephen G. Kochan 2. Programming in C By M.T.Somashekara 3. Let Us C By Yashwant Kanitkar DCA104 Section- 1 Section- 2 Data Structures INTRODUCTION TO DATA STRUCTURES Basic Concepts, Algorithms, Notations, Data Structure operations. Implementations of Data Structures, Pseudo-code for Algorithms. Mathematical Notations, Functions and Procedure ARRAYS Definitions, Array, Index or Subscript, Dimensions of an Array. Memory Allocation to Arrays, Memory Allocation to One-dimensional Array. Memory Representation of Two Dimensional Arrays.

Unit- 7 Section- 3 1 2 3 4 Section- 4 5 6 7 8 9 0 Section- 6 1 Section- 7 2 Memory Allocation to Three Dimensional Array, Memory Allocation to Multidimensional Array. Static and Dynamic Variables, Pointer Type Variables, Pointers in Pascal. Pointers in C, Static and Dynamic Memory Allocation. LINKED LISTS Dynamic Allocation of Memory, Representation of Linked List, Implementation of Linked List. Insertion of a Node at the Beginning, Insertion of a Node at the End, Insertion of a Node after a Specified Node. Traversing the Entire Linked List, Deletion of a Node from Linked List, Concatenation of Linked Lists. Merging Linked Lists, Reversing of Linked List. Applications of Linked List, Doubly Linked Lists, Circular Linked List, Generalized List. STACK And Queue Implementation of Stack, Array-based Implementation, Pointer-based Implementation, Applications of Stacks, Maze Problem. Evaluation of Expressions, Evaluating Postfix Expression. Simulating Recursive Function using Stack, Passing Arguments. Return from a Function, Simulation of Factorial, Proving Correctness of Parenthesis in an Expression. Queue Implementation, Array-based Implementation, Pointer-based Implementation, Applications of Queues, Priority Queues. Trees and Graphs Trees, N-ary Tree, Linked Tree Representation, Binary Tree Traversal, Searching a Binary Tree, Heap Tree, AVL Trees, Threaded Trees, Splay Trees, B-Trees. Searching and Sorting Linear or Sequential Search, Binary Search, Tree Searching, Breadth First Search (BFS), Depth First Search (DFS), General Search Trees, Hashing. GARBAGE COLLECTION AND COMPACTION, DYNAMIC MEMORY ALLOCATION Reference Counting Garbage Collection,, When Objects Refer to Other Objects, Why Reference Counting Does Not Work, Mark-and-Sweep Garbage Collection.

3 4 The Fragmentation Problem, Stop-and-Copy Garbage Collection, The Copy Algorithm, Markand-Compact Garbage Collection. The Heap, Singly Linked Free storage, Doubly Linked Free storage, Buddy System for Storage Management. 1. Purely functional data structures By Chris Okasaki 2. Algorithms and Data Structures :the science of computing by Chris Okasaki 3. Data Structures and Algorithms Bu Alfred V.Aho and Jeffrey D.Ullman DCA201 Mathematics Semester II Section- 1 Section- 2 Section- 3 Unit- 7 Section- 4 1 Set Theory Sets, Relations and Functions The Concept of a Set Notations and Representation of a Set Types of Sets Theorem on Subsets, Venn Diagram Set Operations De-Morgan s Laws Applications of Venn Diagrams Ordered Pairs, Relations & Functions Graph Theory Graphs, Application of Graph Theory. Trees, Application of Trees. Introduction To Recurrence Relations A sequence, Recurrence relation. Solving a recurrence relation, Characteristics equations. Introduction To Propositional Calculus Logic, Conditional Propositions. Quantifiers, Applications of Logic. Boolean Algebra & Its Applications Introduction Boolean Expressions and Boolean Functions. Identities of Boolean Algebra Duality, Algebra of Switching Circuits

1. Schaum's Outlines of Discrete Mathematics By Seymour Lipschutz, Marc Lipson 2. Mathematics for Computer Science. Eric Lehman and Tom Leighton DCA202 : Computer Organization and Architecture Section- 1 Section- 2 Section- 3 Unit- 7 Introduction Computer System, Components of a Computer System. Computer Organization, Data Representation, Performance Factors Central Processing Unit Introduction, General Register Organization. Stack Organization, Instruction Formats. Addressing Modes, Program Control. Program Interrupt. Control Unit Introduction, Control Memory. Microprogramming, Computer Configuration, Design of Control Unit, Overview of RISC/CISC Section- 4 1 2 Memory Organization Memory Hierarchy, Main Memory or Primary Memory, Design of Main Memory, Auxiliary Memory,Virtual Memory. Memory Management,Associative Memory 3 4 5 Input-Output Devices Introduction, Peripheral, Asynchronous Communication, Asynchronous Serial Transfer, Asynchronous Communication Interface, Synchronous Communication, Character-Oriented Protocol,

6 Section- 6 7 8 9 Input-Output Interface, Modes of Data Transfer, Interrupt, Multiple Interrupts,Direct Memory Access (DMA) Hardware Interfacing Issues Introduction, I/O Processing, Bus Interface, I/O versus Memory Bus, Data Transfer Techniques, Mode of Transfer, Software Routines, Direct Memory Access (DMA), Input-output Processor (IOP), CPU-IOP Communication, Channel 1. Computer organization and architecture by William Stallings 2. Essentials of Computer Organization and Architecture, Second Edition by Linda Null and Julia Lobur DCA203 DBMS Section- 1 Section- 2 Introduction to Databases Database and its Hierarchies. History of Databases, Types of DBMS Database Environment Database and DBMS Software, Database Architectural, Three Layered Architectural/O Functions, Characteristics of Database Approach Section- 3 Section- 4 Unit- 7 Relational Model Logical Data Models, Relational Data Model, Querying Relational Data, Relational Algebra, Relational Calculus SQL: Data Manipulation, Data Definition SQL Language, SQL Database Objects. SQL Data Types, DDL, DML and TCL Commands, Retrieving Data, Inserting Data, Updating Data, Deleting Data. Creating and Altering Tables, Views, Sequence, Index. Database Planning, Design And Administration Database Application Life-cycle, Alternate System Development Methodologies,

1 2 Section- 6 3 4 5 6 7 Database Planning, System Definition, Requirements Collections and Analysis, Database Design, DBMS Selection, Application Design, Database Administration Entity Relationship Modeling, Normalization Database Design, Entity, Attributes and Entity Sets, Relationships and Relationship Sets, ER Diagrams, Additional Features of ER Model, Conceptual Database Design with the ER Model, Anomalies in Databases, Redundancy, Inconsistency, Update Anomalies, Good Database Designing, First Normal Form (1NF), Second Normal Form (2NF), Third Normal Form (3NF), Boyce-Codd Normal Form, Fourth Normal Form (4NF) Section- 7 8 9 Database Security Access Control, Discretionary Access Control, Mandatory Access Control, Additional Issues to Security 1. Database design for mere mortals. Hernandez 2. Database management by Watson DCA204 OOPS with C++ Section- 1 Section 2 Section 3 Classes And Objects Introduction, Class, Object, Nature of Class. Types of Relationships, "Kind of" Relationship, "Is a" Relationship, "Has a" Relationship/Part of Relationship. Classification of Classes, Abstraction. Constructors And Destructors And Operators Overloading Introduction, Constructors, Destructors. Introduction-Operators Overloading, Example, Type Conversion Inheritance, Polymorphism And Virtual Functions] Introduction- Inheritance, Type of Inheritance.

Unit- 7 Section 4 1 2 3 4 Introduction- Polymorphism, Virtual Functions. Need for Virtual Functions, Rules for Virtual Functions. File Handling Introduction, files, Stream Input/Output, Buffering and Flush, Exception Handling, String Handling, Sequential Fixed Length Structure. Linked List Fixed Size Nodes, Strings Manipulations, Character String Output Functions, String Handling Functions Postfix Expression, Simulating. Arrays Introduction, Arrays, Array Declaration. Important Points about Arrays, Multidimensional Arrays. 1. Object Oriented Programming With C++ - E Balagurusamy 2. Object Oriented Programming Using C++, Sanjeev Sofat, Cyber Tech. Publication