PGDCA Syllabus

Can you provide me the syllabus of PGDCA course of SCOPE in Bangalore which is in collaboration with Karnataka State Open University?

[Quick Sam]

The syllabus of PGDCA course of SCOPE in Bangalore which is in collaboration with Karnataka State Open University is as follows:

SYLLABUS
Semester I
PGDCA101: Mathematics
Section 1: Sets
Unit-1: Definition of sets, subsets, complement of a set, universal set.
Unit-2: Intersection and union of sets, De-Morgan’s laws, Cartesian products, Equivalent sets, Countable and uncountable sets, minset, Partitions of sets.
Section 2: Relations
Unit-3: Basic definitions, graphs of relations, properties of relations.
Section 3: Matrix
Unit-4: Introduction of a Matrix, its different kinds.
Unit-5: Matrix addition and scalar multiplication, multiplication of matrices, transpose etc.
Unit-6: Square matrices, inverse and rank of a square matrix.
Unit-7: Solving simultaneous equations using Gauss elimination, Gauss Jordan Methods, Matrix Inversion method.
Section 4: Algebra
Unit-8: Algebra of logic, Propositions, connectives.
Unit-9: Tautologies and contradiction, Equivalence and implication, Principle of Mathematical induction, quantifiers.

PGDCA102: Data Structures
Section 1: Introduction to Data Structures
Unit-1: Basic Concepts, Algorithms, Notations, Data Structure operations.
Unit-2: Implementations of Data Structures, Pseudo-code for Algorithms, Mathematical Notations, Functions and Procedure.


Section 2: Arrays
Unit-3: Definitions, Array, Index or Subscript, Dimensions of an Array.
Unit-4: Memory Allocation to Arrays, Memory Allocation to One-dimensional Array, Memory Representation of Two Dimensional Arrays.
Unit-5: Memory Allocation to Three Dimensional Array, Memory Allocation to Multidimensional Array, Static and Dynamic Variables.
Unit-6: Pointer Type Variables, Pointers in Pascal, Pointers in C, Static and Dynamic Memory Allocation
Section 3: Linked Lists
Unit-7: Dynamic Allocation of Memory, Representation of Linked List.
Unit-8: Implementation of Linked List, Insertion of a Node at the Beginning.
Unit-9: Insertion of a Node at the End, Insertion of a Node after a Specified Node.
Unit-10: Traversing the Entire Linked List, Deletion of a Node from Linked List.
Unit-11: Concatenation of Linked Lists, Merging Linked Lists, Reversing of Linked List.
Unit-12: Applications of Linked List, Doubly Linked Lists, Circular Linked List, Generalized List.
Section 4: STACK and Queue
Unit-13: Implementation of Stack, Array-based Implementation.
Unit-14: Pointer-based Implementation, Applications of Stacks.
Unit-15: Maze Problem, Evaluation of Expressions.
Unit-16: Evaluating Postfix Expression, Simulating Recursive Function using Stack.
Unit-17: Passing Arguments, Return from a Function, Simulation of Factorial.
Unit-18: Proving Correctness of Parenthesis in an Expression.
Unit-19: Queue Implementation, Array-based Implementation.
Unit-20: Pointer-based Implementation, Applications of Queues, Priority Queues.
Section 5: Trees and Graphs
Unit-21: Trees, N-ary Tree, Linked Tree Representation, Binary Tree Traversal.
Unit-22: Searching a Binary Tree, Heap Tree, AVL Trees.
Unit-23: Threaded Trees, Splay Trees, B-Trees.


Section 6: Searching and Sorting
Unit-24: Linear or Sequential Search, Binary Search.
Unit-25: Tree Searching, Breadth First Search (BFS).
Unit-26: Depth First Search (DFS), General Search Trees, Hashing.
Section 7: Garbage Collection And Compaction, Dynamic Memory Allocation
Unit-27: Reference Counting Garbage Collection.
Unit-28: When Objects Refer to Other Objects, Why Reference Counting Does Not Work.
Unit-29: Mark-and-Sweep Garbage Collection, The Fragmentation Problem.
Unit-30: Stop-and-Copy Garbage Collection, The Copy Algorithm, Mark-and-Compact Garbage Collection.
Unit-31: The Heap, Singly Linked Free storage, Doubly Linked Free storage, Buddy System for Storage Management.

PGDCA103: Programming in C
Section 1: Origin and Introduction
Unit-1: Programming languages About C, Evolution of C.
Unit-2: Structure of a C Program, Compilers & Interpreters Compiling a C Program.
Unit-3: Pseudo Codes, A Simple C Program.
Section 2: Data Types, Variables and Constants
Unit-4: Data Types Variables, Constants Operators.
Unit-5: Type Modifiers and Expressions Operators Type Modifiers Expressions Type Definitions Using ‘typedef’.
Unit-6: Introduction to Input/Output Console I/O Functions Unformatted Console I/O Functions.
Section 3: Control Constructs
Unit-7: Control Statements, Conditional Statements.
Unit-8: Loops in C The break Statement, The Continue Statement.
Section 4: Arrays
Unit-9: Introduction to Arrays One Dimensional Array Strings Two Dimensional.
Unit-10: Array Multi-dimensional Array.


Section 5: Functions
Unit-11: Introduction to Functions, Function Declaration and Prototypes.
Unit-12: Storage Classes Recursion in Function.
Section 6: Pointers
Unit-13: Introduction to Pointers, Pointer Notation.
Unit-14: Pointer Declaration and Initialization, Accessing Variable through Pointer.
Unit-15: Pointer Expressions, Pointers and One Dimensional Arrays.
Unit-16: Arrays of Pointers, Pointer to Pointers, Pointers and Functions.
Section 7: Structures and Unions
Unit-17: Structure Definition, Structure Initialization, Arrays of Structures, Arrays within Structures.
Unit-18: Structures within Structures, Passing Structures to Functions, Structure Pointers.
Unit-19: Union–Definition and Declaration, Accessing a Union Member.
Unit-20: Initialization of a Union Variable, Use of User Defined Type Declarations.
Section 8: Linked List
Unit-21: Dynamic Memory Allocation.
Unit-22: Linked List, Basic List Operations.
Section 9: File Handling in C
Unit-23: What is a File, Defining and Opening a File, Functions for Random Access to Files.
PGDCA104: Financial Accounting
Section 1: Accounting
Unit-1: Principles, concepts and conventions, double entry system of accounting.
Unit-2: Introduction to basis books of accounts of sole proprietary concern.
Unit-3: Closing of books of accounts and preparation of trial balance.
Section 2: Final Accounts
Unit-4: Trading, Profit and Loss accounts and Balance sheet of sole proprietary.


Section 3: Financial Management
Unit-5: Meaning, scope and role, a brief study of functional areas of financial management.
Unit-6: Introduction to various FM tools: Ration Analysis, Fund Flow statement and cash flow statement (without adjustments).
Section 4: Costing
Unit-7: Nature, Importance and basic principles. Marginal costing: Nature scope and importance, Break even analysis, its uses and limitations.
Unit-8: Construction of break even chart, Standard costing: Nature, scope and variances (only introduction).
Section 5: Computerized Accounting
Unit-9: Meaning and advantages, Computer Programs for accounting.
Unit-10: Balancing accounts, Trial balance and final accounts in computerized.
Unit-11: Accounting, control, and Audit, Sub-Modules of computerized accounting systems.
Semester II
PGDCA201: 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, subjective and bijective functions, composition.
Section 3: Combinations
Unit-7: Rule of products, permutations, combinations.
Section 4: Algebra Of Logic
Unit-8: Propositions and logic operations, truth tables and propositions generated by set.


Unit-9: Equivalence and implication laws of logic, mathematical system, and propositions over a universe.
Unit-10: Mathematical induction, quantifiers. Recursion and recurrence: The many faces of 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.
PGDCA202: DBMS
Section 1: Introduction to Databases
Unit-1: Database and its Hierarchies, History of Databases, Types of DBMS.
Section 2: 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: Relational Model
Unit-5: Logical Data Models, Relational Data Model.
Unit-6: Querying Relational Data, Relational Algebra, Relational Calculus.
Section 4: SQL: Data Manipulation, Data Definition
Unit-7: SQL Language, SQL Database Objects.
Unit-8: SQL Data Types, DDL, DML and TCL Commands, Retrieving Data, Inserting Data, Updating Data, Deleting Data.
Unit-9: Creating and Altering Tables, Views, Sequence, Index.
Section 5: Database Planning, Design And Administration
Unit-10: Database Application Life-cycle, Alternate System Development Methodologies, Database Planning, System Definition.
Unit-11: Requirements Collections and Analysis, Database Design.
Unit-12: DBMS Selection, Application Design, Database Administration


Section 6: 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: Database Security
Unit-18: Access Control, Discretionary Access Control.
Unit-19: Mandatory Access Control, Additional Issues to Security.
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: Constructors And Destructors And Operators Overloading
Unit-3: Introduction, Constructors, Destructors.
Unit-4: Introduction-Operators Overloading, Example, Type Conversion.
Section 3: Inheritance, Polymorphism And Virtual Functions
Unit-5: Introduction- Inheritance
Unit-6: Type of Inheritance, Introduction- Polymorphism.
Unit-7: Virtual Functions, Need for Virtual Functions, Rules for Virtual Functions.
Section 4: 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 Simulating. Expression,


Section 5: Arrays
Unit-12: Introduction, Arrays, Array Declaration.
Unit-13: Important Points about Arrays, Multidimensional Arrays.
PGDCA204: Computer Organization and Architecture
Section 1: Introduction
Unit-1: Computer System, Components of a Computer System.
Unit-2: 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: Control Unit
Unit-6: Introduction, Control Memory, Microprogramming.
Unit-7: 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.