AGARWAL COLLEGE & WEB SERVICES TRUST. In Collaboration with KARANATAKA STATE OPEN UNIVERSITY



Similar documents
KITES TECHNOLOGY COURSE MODULE (C, C++, DS)

ALLIED PAPER : DISCRETE MATHEMATICS (for B.Sc. Computer Technology & B.Sc. Multimedia and Web Technology)

DATA STRUCTURES USING C

BCS2B02: OOP Concepts and Data Structures Using C++

2) What is the structure of an organization? Explain how IT support at different organizational levels.

Krishna Institute of Engineering & Technology, Ghaziabad Department of Computer Application MCA-213 : DATA STRUCTURES USING C

ADVANCED SCHOOL OF SYSTEMS AND DATA STUDIES (ASSDAS) PROGRAM: CTech in Computer Science

Bachelor of Games and Virtual Worlds (Programming) Subject and Course Summaries

Java EE Web Development Course Program

Eastern Washington University Department of Computer Science. Questionnaire for Prospective Masters in Computer Science Students

Data Structure [Question Bank]

COMPUTER SCIENCE. 1. Computer Fundamentals and Applications

Thomas Jefferson High School for Science and Technology Program of Studies Foundations of Computer Science. Unit of Study / Textbook Correlation

Course Name: ADVANCE COURSE IN SOFTWARE DEVELOPMENT (Specialization:.Net Technologies)

Curriculum Map. Discipline: Computer Science Course: C++

WORKSPACE WEB DEVELOPMENT & OUTSOURCING TRAINING CENTER

Class XII (Theory) C++

10CS35: Data Structures Using C

Java Application Developer Certificate Program Competencies

CompuScholar, Inc. Alignment to Utah's Computer Programming II Standards

B.Sc. (Computer Science) First Year

Fundamentals of Java Programming

Java Software Structures

Assessment Plan for CS and CIS Degree Programs Computer Science Dept. Texas A&M University - Commerce

Division of Mathematical Sciences

Bachelor of Computer Application (BCA)

Bangalore University B.Sc Computer Science Syllabus ( Semester System)

Assessment for Master s Degree Program Fall Spring 2011 Computer Science Dept. Texas A&M University - Commerce

5. A full binary tree with n leaves contains [A] n nodes. [B] log n 2 nodes. [C] 2n 1 nodes. [D] n 2 nodes.

2. Advance Certificate Course in Information Technology

University of Dayton Department of Computer Science Undergraduate Programs Assessment Plan DRAFT September 14, 2011

AP Computer Science AB Syllabus 1

Domains and Competencies

Glossary of Object Oriented Terms

Java (12 Weeks) Introduction to Java Programming Language


Eastern Washington University Department of Computer Science. Questionnaire for Prospective Masters in Computer Science Students

El Dorado Union High School District Educational Services

Operating Systems CSE 410, Spring File Management. Stephen Wagner Michigan State University

Abstract Data Type. EECS 281: Data Structures and Algorithms. The Foundation: Data Structures and Abstract Data Types

THREE YEAR DEGREE (HONS.) COURSE BACHELOR OF COMPUTER APPLICATION (BCA) First Year Paper I Computer Fundamentals

Course MS10975A Introduction to Programming. Length: 5 Days

Java the UML Way: Integrating Object-Oriented Design and Programming

PES Institute of Technology-BSC QUESTION BANK

INTERNATIONAL JOURNAL OF PURE AND APPLIED RESEARCH IN ENGINEERING AND TECHNOLOGY

OKLAHOMA SUBJECT AREA TESTS (OSAT )

Information and Communications Technology Courses at a Glance

WESTMORELAND COUNTY PUBLIC SCHOOLS Integrated Instructional Pacing Guide and Checklist Computer Math

PART-A Questions. 2. How does an enumerated statement differ from a typedef statement?

University of Pune Revised Structure for the B. Sc. (Computer Science) Course (Second Year to be implemented from Academic Year )

An Introduction to Programming and Computer Science

Department of Computer Science

COURSE DESCRIPTION FOR THE COMPUTER INFORMATION SYSTEMS CURRICULUM

1. INTRODUCTION TO RDBMS

C++ Programming Language

Chapter 11 I/O Management and Disk Scheduling

Computer Science. 232 Computer Science. Degrees and Certificates Awarded. A.S. Degree Requirements. Program Student Outcomes. Department Offices

IT2304: Database Systems 1 (DBS 1)

Summit Public Schools Summit, New Jersey Grade Level / Content Area: Mathematics Length of Course: 1 Academic Year Curriculum: AP Computer Science A

Home Page. Data Structures. Title Page. Page 1 of 24. Go Back. Full Screen. Close. Quit

INFORMATION TECHNOLOGY PROGRAM

Copyright 2007 Ramez Elmasri and Shamkant B. Navathe. Slide 13-1

Computing Concepts with Java Essentials

Java 6 'th. Concepts INTERNATIONAL STUDENT VERSION. edition

Eastern Washington University Department of Computer Science. Questionnaire for Prospective Masters in Computer Science Students

Android Application Development Course Program

RARITAN VALLEY COMMUNITY COLLEGE ACADEMIC COURSE OUTLINE. CISY 105 Foundations of Computer Science

MSc Information Technology - E521

Chapter 13 Disk Storage, Basic File Structures, and Hashing.

Computer Science/Software Engineering

Chapter 13. Disk Storage, Basic File Structures, and Hashing

COMPUTER SCIENCE, BACHELOR OF SCIENCE (B.S.)

ML for the Working Programmer

DE 6211 DISTANCE EDUCATION. M.Sc. (IT) DEGREE EXAMINATION, MAY PRINCIPLES OF INFORMATION TECHNOLOGY. (2002 onwards) PART A (10 3 = 30 marks)

Chapter 126. Texas Essential Knowledge and Skills for Technology Applications. Subchapter C. High School

Programming and Software Development CTAG Alignments

Course Structure of Three Year Degree B.A Programme in Computer Application under Semester System of Dibrugarh University (General Programme)

Mathematics for Algorithm and System Analysis

Paper-I (MCA-101) : Introduction to Information Technology

TECHNOLOGY Computer Programming II Grade: 9-12 Standard 2: Technology and Society Interaction

Sample Questions Csci 1112 A. Bellaachia

Please consult the Department of Engineering about the Computer Engineering Emphasis.

IT2305 Database Systems I (Compulsory)

Computer Science. Computer Science 207. Degrees and Certificates Awarded. A.S. Computer Science Degree Requirements. Program Student Outcomes

1) The postfix expression for the infix expression A+B*(C+D)/F+D*E is ABCD+*F/DE*++

Curriculum for the Bachelor Degree in Computer Science (CS)

PROBLEM SOLVING SEVENTH EDITION WALTER SAVITCH UNIVERSITY OF CALIFORNIA, SAN DIEGO CONTRIBUTOR KENRICK MOCK UNIVERSITY OF ALASKA, ANCHORAGE PEARSON

1. Relational database accesses data in a sequential form. (Figures 7.1, 7.2)

Objected oriented Programming: C++ Unit 1 1. Introduction 1.1. Introduction to Object Oriented Programming C++ fundamentals.

1. The memory address of the first element of an array is called A. floor address B. foundation addressc. first address D.

Syllabus for Computer Science. Proposed scheme for B.Sc Programme under Choice Based Credit System

Facebook Twitter YouTube Google Plus Website

Specialized Programme on Web Application Development using Open Source Tools

BCA. Database Management System

Embedded Programming in C/C++: Lesson-1: Programming Elements and Programming in C

CSE 326, Data Structures. Sample Final Exam. Problem Max Points Score 1 14 (2x7) 2 18 (3x6) Total 92.

Department of Computer Science

Computer Science 1-3 (AP) Syllabus/Online Course Plan

Transcription:

AGARWAL COLLEGE & WEB SERVICES TRUST In Collaboration with KARANATAKA STATE OPEN UNIVERSITY Syllabus of Post Graduate Diploma in Computer Application (PGDCA)

Post Graduate Diploma in Computer Applications: Program Structure 1 st Semester Code Course Title Credits PGDCA 101 Mathematics 4 PGDCA 102 Data Structure 4 PGDCA 103 Programming in c 4 PGDCA 104 Financial Accounting 4 PGDCA 105 C Programming Lab and Windows based Application lab 2 PGDCA 106 Data Structure Lab 2 Total Credit : 20 2nd Semester Code Course Title Credits PGDCA 201 Discrete Mathematics 4 PGDCA 202 DBMS 4 PGDCA 203 OOPS with C++ 4

PGDCA 204 Computer Organization and Architecture 4 PGDCA 205 DBMS Lab 2 PGDCA 206 OOPS(C++) Lab 2 Total Credit 20 PGDCA101 Mathematics DETAILED SYLLABUS Section- 1 Unit- 1 Unit- 2 Set Theory Sets, Relations and Functions The Concept of a Set Notations and Representation of a Set Types of Sets Theorem on Subsets, Unit- 3 Venn Diagram Set Operations De-Morgan s Laws Applications of Venn Diagrams Ordered Pairs, Relations & Functions Section- 2 Unit- 4 Graph Theory Graphs, Application of Graph Theory. Unit- 5 Trees, Application of Trees. Section- 3 Unit- 6 Introduction To Recurrence Relations A sequence, Recurrence relation.

Unit- 7 Section- 4 Unit- 8 Solving a recurrence relation, Characteristics equations. Introduction To Propositional Calculus Logic, Conditional Propositions. Unit- 9 Quantifiers, Applications of Logic. Section- 5 Unit- 10 Unit- 11 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 PGDCA102 : Section- 1 Data Structures INTRODUCTION TO DATA STRUCTURES Unit- 1 Basic Concepts, Algorithms, Notations, Data Structure operations. Unit- 2 Implementations of Data Structures, Pseudo-code for Algorithms. Unit- 3 Mathematical Notations, Functions and Procedure Section- 2 Unit- 4 Unit- 5 ARRAYS Definitions, Array, Index or Subscript, Dimensions of an Array. Memory Allocation to Arrays, Memory Allocation to Onedimensional Array. Unit- 6 Memory Representation of Two Dimensional Arrays.

Unit- 7 Memory Allocation to Three Dimensional Array, Memory Allocation to Multidimensional Array. Unit- 8 Static and Dynamic Variables, Pointer Type Variables, Pointers in Pascal. Unit- 9 Pointers in C, Static and Dynamic Memory Allocation. Section- 3 LINKED LISTS Unit- 10 Dynamic Allocation of Memory, Representation of Linked List, Implementation of Linked List. Unit- 11 Insertion of a Node at the Beginning, Insertion of a Node at the End, Insertion of a Node after a Specified Node. Unit- 12 Traversing the Entire Linked List, Deletion of a Node from Linked List, Concatenation of Linked Lists. Unit- 13 Merging Linked Lists, Reversing of Linked List. Unit- 14 Applications of Linked List, Doubly Linked Lists, Circular Linked List, Generalized List. Section- 4 Unit- 15 Unit- 16 Unit- 17 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. Unit- 18 Return from a Function, Simulation of Factorial, Proving Correctness of Parenthesis in an Expression. Unit- 19 Queue Implementation, Array-based Implementation, Pointerbased Implementation, Applications of Queues, Priority Queues. Section- 5 Trees and Graphs

Unit- 20 Section- 6 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 Unit- 21 Linear or Sequential Search, Binary Search, Tree Searching, Breadth First Search (BFS), Depth First Search (DFS), General Search Trees, Hashing. Section- 7 GARBAGE COLLECTION AND COMPACTION, DYNAMIC MEMORY ALLOCATION Unit- 22 Reference Counting Garbage Collection,, When Objects Refer to Other Objects, Why Reference Counting Does Not Work, Mark-and-Sweep Garbage Collection. Unit- 23 The Fragmentation Problem, Stop-and-Copy Garbage Collection, The Copy Algorithm, Markand-Compact Garbage Collection. Unit- 24 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 PGDCA103 : Programming in C Section- 1 Units- 1 Section- 2 Unit- 2 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.

Section- 3 Control Constructs Unit- 3 Control Statements, Conditional Statements, Loops in C The break Statement, The Continue Statement. Section- 4 Unit- 4 Section- 5 Arrays Introduction to Arrays One Dimensional Array Strings Two Dimensional, Array Multi- dimensional Array. Functions Unit- 5 Introduction to Functions, Function Declaration and Prototypes, Storage Classes Recursion in Function.Section- 6 Pointers Unit-6 Introduction to Pointers, Pointer Notation, Pointer Declaration and Initialization, Accessing Variable through Pointer, Pointer Expressions. Unit-7 Pointers and Section- 7 Unit- 8 Pointers and One Dimensional Arrays, Arrays of Pointers, Pointer to Pointers, Functions. Structures and Unions Structure Definition, Structure Initialization, Arrays of Structures, Arrays within Structures, Structures within Structures, Passing Structures to Functions. Unit- 9 Structure Pointers, Union Definition and Declaration, Accessing a Union Member, Initialization of a Union Variable, Use of User Defined Type Declarations. Section- 8 Unit- 10 Section- 9 Unit- 11 Files. 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 1. Programming in C By Stephen G. Kochan

2. Programming in C By M.T.Somashekara 3. Let Us C By Yashwant Kanitkar PGDCA104 : Financial Accounting UNIT 65: Financial Accounting an Introduction, Basic Accounting Concepts, Double Entry Accounting, The Accounting Trail UNIT 66: Financial Statements and Their Nature, the Accounting Equation UNIT 67: Recording in the Primary Books Introduction, Ground Rules of Journalisation, Journalisation, Types of Journals UNIT 68: Posting in Secondary Books Introduction, Types of Secondary Books, Posting Techniques in the Ledger UNIT 69: Bank Reconciliation Statement Introduction, Purpose of Bank Reconciliation Statements, Causes of Difference UNIT 70: Trial Balance and Final Accounts Introduction, Preparation of the Trial Balance, Errors and Their Rectification, Final Accounts UNIT 71: Accounting Standards in India Introduction, Indian Accounting Standards UNIT 72: Corporate Financial Statements Part-I Introduction, Statutory Books, Financial Statements, Comprehensive Illustration, UNIT 73: Directors Report, Significant Accounting Policies, Inventory Valuation UNIT 74: Corporate Financial Statements Part-II Introduction, Managerial Remuneration, Depreciation Accounting, UNIT 75: Provision for Taxation Case Study: Horizon Ltd. UNIT 76: Divisible Profits, Accounting Treatment of MODVAT, Prior period Adjustments UNIT 77: Understanding Published Financial Statements Introduction, Published Financial Statements A Case Study: JCT Electronics Ltd., Understanding Financial Statements.

UNIT 78: Interpretation of Financial Statements, Quantitative Disclosures UNIT 79: Consolidated Financial Statements Introduction, Legal Framework, Consolidated Financial Statements, Chain Holding UNIT 80: Accounting for Amalgamations Legal Framework, Definitions, Purchase Consideration, Determination of Swap Ratio, Methods of Accounting for Amalgamations, Asset Buyouts (ABOs) - 1. Financial Accounting 6e with Annual Report by Robert Libby, Patricia Libby, and Daniel G. Short (Hardcover - Jul 17, 2008) 2. Financial Accounting: Tools for Business Decision Making by Paul D. Kimmel, Jerry J. Weygandt, and Donald E. Kieso (Hardcover - Oct 24, 2008) 3. Financial Accounting: An Introduction to Concepts, Methods and Uses by Clyde P. Stickney, Roman L. Weil, Katherine Schipper, and Jennifer Francis (Hardcover - Feb 25, 2009) Semester II PGDCA 201 : Discrete Mathematics Section 1 Set Theory Unit-1 Relations and functions: Set notations and description. Unit-2 Subsets, basic set operations. Venn diagrams, laws of set theory. Unit-3 Partition of sets, min sets, duality principle. Section 2 Relations Unit-4 Basic definitions of relations and functions. Unit-5 Graphics of relations, properties of relations. Unit-6 Injective, surjective and bijective functions, composition. Section3 Unit-7 Combinations Rule of products, permutations, combinations.

Section 4 Unit-8 set. Unit-9 Unit-10 faces of Algebra Of Logic Propositions and logic operations, truth tables and propositions generated by equivalence and implication laws of logic, mathematical system, and propositions over a universe. Mathematical induction, quantifiers. Recursion and recurrence: The many recursion, recurrence, relations, and some common recurrence relations, generating functions. Section 5 Graph Theory Unit-11 Various types of graphics, simple and multigraphs. Unit-12 Directed and undirected graphs, Eulerian and Hamiltonian graph. Unit-13 Graph connectivity, traversals, graph optimizations. Unit-14 Graph coloring, trees, spanning trees, rooted trees, binary trees. 1. Discrete Mathematics and Its Applications by Kenneth H. Rosen 2. Discrete Mathematics with Applications by Susanna S. Epp PGDCA202 : DBMS Section 1 Unit-1 Section 2 Introduction to Databases Database and its Hierarchies, History of Databases, Types of DBMS. Database Environment Unit-2 Database and DBMS Software, Database Architectural. Unit-3 Three Layered Architectural/O Functions. Unit-4 Characteristics of Database Approach. Section 3 Unit-5 Unit-6 Relational Model Logical Data Models, Relational Data Model. Querying Relational Data, Relational Algebra, Relational Calculus. Section 4 Unit-7 Unit-8 Updating SQL: Data Manipulation, Data Definition SQL Language, SQL Database Objects. SQL Data Types, DDL, DML and TCL Commands, Retrieving Data, Inserting Data, Data, Deleting Data.

Unit-9 Section 5 Unit-10 Database Unit- 11 Unit-12 Section 6 Creating and Altering Tables, Views, Sequence, Index. Database Planning, Design And Administration Database Application Life-cycle, Alternate System Development Methodologies, Planning, System Definition. Requirements Collections and Analysis, Database Design. DBMS Selection, Application Design, Database Administration Entity Relationship Modeling, Normalization Unit-13 Database Design, Entity, Attributes and Entity Sets. Unit-14 Relationships and Relationship Sets, ER Diagrams. Unit-15 Additional Features of ER Model, Conceptual Database Design with the ER Model, Anomalies in Databases, Redundancy. Unit-16 Inconsistency, Update Anomalies, Good Database Designing. Unit-17 First Normal Form (1NF),Second Normal Form (2NF), Third Normal Form (3NF), Boyce- Codd Normal Form, Fourth Normal Form (4NF). Section 7 Unit-18 Unit-19 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 PGDCA203 : OOPS with C++ Section 1 Classes And Objects Unit-1 Introduction, Class, Object. Unit-2 Nature of Class, Types of Relationships, "Kind of" Relationship, "Is a" Relationship, "Has a" Relationship/Part of Relationship, Classification of Classes, Abstraction. Section 2 Unit-3 Unit-4 Constructors And Destructors And Operators Overloading Introduction, Constructors, Destructors. Introduction-Operators Overloading, Example, Type Conversion.

Section 3 Unit-5 Unit-6 Unit-7 Section 4 Inheritance, Polymorphism And Virtual Functions Introduction- Inheritance. Type of Inheritance, Introduction- Polymorphism. Virtual Functions, Need for Virtual Functions, Rules for Virtual Functions. File Handling Unit-8 Introduction, files, Stream Input/Output, Buffering and Flush. Unit-9 Exception Handling, String Handling, Sequential Fixed Length Structure. Unit-10 Linked List Fixed Size Nodes, Strings Manipulations. Unit-11 Character String Output Functions,String Handling Functions Postfix Expression, Simulating. Section 5 Unit-12 Unit-13 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 PGDCA204 : Computer Organization and Architecture Section 1 Unit-1 Unit-2 Introduction Computer System, Components of a Computer System. Computer Organization, Data Representation, Performance Factors. Section 2 Central Processing Unit Unit-3 Introduction, General Register Organization. Unit-4 Stack Organization, Instruction Formats. Unit-5 Addressing Modes, Program Control, Program Interrupt. Section 3 Unit-6 Unit-7 Control Unit Introduction, Control Memory, Microprogramming. Computer Configuration, Design of Control Unit, Overview of RISC/CISC. Section 4 Memory Organization Unit-8 Memory Hierarchy, Main Memory or Primary Memory. Unit-9 Design of Main Memory,Auxiliary Memory. Unit-10 Virtual Memory, Memory Management,Associative Memory.

Section 5 Input-Output Devices Unit-11 Introduction, Peripheral, Asynchronous Communication. Unit-12 Asynchronous Serial Transfer, Asynchronous Communication Interface. Unit-13 Synchronous Communication, Character-Oriented Protocol. Unit-14 Input-Output Interface, Modes of Data Transfer. Unit-15 Interrupt, Multiple Interrupts,Direct Memory Access (DMA). Section 6 Hardware Interfacing Issues Unit-16 Introduction, I/O Processing. Unit-17 Bus Interface, I/O versus Memory Bus. Unit-18 Data Transfer Techniques, Mode of Transfer, Software Routines. Unit-19 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