
PGDCA Course
The PGDCA programme gives you a complete, career-ready foundation in computer science, programming, databases, networking, and web development. You will move from core computing concepts to hands-on projects that mirror real IT workplace demands. This is the credential that opens doors to software development, system administration, and data management roles.
What your team will master:
You will master programming in C and C++, design and query relational databases with SQL, and build dynamic web applications using PHP and JavaScript. The curriculum covers operating systems, data structures, algorithms, and computer networks from the ground up. You will also gain practical exposure to Python for data analysis, cloud computing fundamentals, and information security principles. Software engineering practices, agile project management, and emerging technologies like AI and IoT round out the programme. By the end, you will have a portfolio of real projects and the technical skills employers in the IT industry actively seek.
How your team learns practically PGDCA Course
How your team practises PGDCA Course
Professionals from these companies study at Dedika









Course content
8 Chapters • 40 LessonsDuration between 4 and 360 hours (you decide)
Chapter 1HideHide detailsSee detailsFoundations of Computer Science
Foundations of Computer Science
Lesson 1 • History and Evolution of Computers
Traces computing from mechanical calculators to modern processors, establishing context for all subsequent topics. Students can place technologies on a generational timeline.
Lesson 2 • Software Categories and System Software
Distinguishes system software, application software, and utilities, explaining how each layer interacts. Prepares students for operating system and programming topics ahead.
Lesson 3 • Number Systems and Data Representation
Covers binary, octal, and hexadecimal systems and how computers encode text, images, and sound. Enables students to perform base conversions and interpret raw data.
Lesson 4 • Boolean Logic and Digital Circuits
Introduces logic gates, truth tables, and combinational circuits as the foundation of processor design. Students simplify expressions using Boolean algebra.
Lesson 5 • Computer Hardware Components
Identifies and explains CPU, memory, storage, and I/O devices and their roles. Connects physical components to logical operations performed by software.
Chapter 2HideHide detailsSee detailsOperating Systems Concepts and Usage
Operating Systems Concepts and Usage
Lesson 1 • Memory Management Techniques
Teaches paging, segmentation, and virtual memory to explain how OSes allocate RAM efficiently. Students calculate page table entries and identify thrashing conditions.
Lesson 2 • Process and Thread Management
Covers process lifecycle, scheduling algorithms, and multithreading concepts critical to performance. Students analyse scheduling trade-offs using Gantt charts.
Lesson 3 • Operating System Architecture
Explains kernel, shell, and system call interfaces and how they mediate hardware access. Grounds students in OS design before exploring specific functions.
Lesson 4 • File Systems and Storage Management
Examines file system structures, directory hierarchies, and disk scheduling for reliable data storage. Connects to database and networking chapters that depend on file I/O.
Lesson 5 • Command-Line Interface Proficiency
Builds hands-on skill with shell commands for file manipulation, process control, and scripting. Students write basic shell scripts to automate repetitive tasks.
Chapter 3HideHide detailsSee detailsProgramming Fundamentals with C
Programming Fundamentals with C
Lesson 1 • Structures, Unions, and File I/O
Introduces user-defined types and persistent data storage through file operations. Students build a record-management program using structures and binary files.
Lesson 2 • Arrays, Strings, and Pointers
Explains memory addressing through arrays, string manipulation, and pointer arithmetic. Students implement string processing routines using pointer-based techniques.
Lesson 3 • C Language Syntax and Data Types
Introduces tokens, keywords, operators, and primitive data types that form every C program. Students write and compile their first complete programs.
Lesson 4 • Control Flow and Looping Constructs
Covers if-else, switch, for, while, and do-while to direct program execution. Students implement decision trees and iterative algorithms.
Lesson 5 • Functions and Modular Programming
Teaches function declaration, parameter passing, recursion, and scope to promote code reuse. Students refactor monolithic code into modular, testable units.
Chapter 4HideHide detailsSee detailsObject-Oriented Programming with C++
Object-Oriented Programming with C++
Lesson 1 • Polymorphism and Virtual Functions
Explains compile-time and runtime polymorphism through overloading and virtual dispatch. Students implement a plugin-style design using abstract base classes.
Lesson 2 • Inheritance and Code Reuse
Covers single, multiple, and hierarchical inheritance to extend existing classes without duplication. Students design class hierarchies for a domain model.
Lesson 3 • Exception Handling and File Streams
Teaches try-catch-throw and C++ stream classes for robust, error-tolerant programs. Students add exception safety to the domain model built earlier.
Lesson 4 • Classes, Objects, and Encapsulation
Defines class syntax, access specifiers, and constructors to encapsulate data and behaviour. Builds directly on C structures introduced in the previous chapter.
Lesson 5 • Templates and the Standard Template Library
Introduces generic programming with function and class templates and STL containers. Students replace manual data structures with STL equivalents.
Chapter 5HideHide detailsSee detailsData Structures and Algorithms
Data Structures and Algorithms
Lesson 1 • Sorting, Searching, and Hashing
Analyses and implements major sorting algorithms and hash table operations for fast retrieval. Students benchmark algorithms on datasets of varying sizes.
Lesson 2 • Graphs and Graph Algorithms
Represents graphs using adjacency matrices and lists, then applies BFS, DFS, and shortest-path algorithms. Students solve connectivity and routing problems.
Lesson 3 • Linear Data Structures
Implements arrays, linked lists, stacks, and queues with their core operations and use cases. Students choose the right linear structure for given algorithmic scenarios.
Lesson 4 • Algorithm Analysis and Complexity
Establishes Big-O, Big-Omega, and Big-Theta notation to evaluate algorithm efficiency. Students classify common algorithms by growth rate.
Lesson 5 • Trees and Binary Search Trees
Covers tree terminology, traversals, and BST operations for hierarchical data organisation. Students implement insertion, deletion, and search on BSTs.
Chapter 6HideHide detailsSee detailsDatabase Management Systems
Database Management Systems
Lesson 1 • Database Concepts and ER Modelling
Introduces DBMS architecture, data models, and entity-relationship diagrams for schema design. Students convert business requirements into ER diagrams.
Lesson 2 • SQL: Data Definition and Manipulation
Covers DDL commands for schema creation and DML commands for inserting, updating, and deleting records. Students build and populate a complete relational database.
Lesson 3 • Advanced SQL and Joins
Teaches inner, outer, and self joins, views, stored procedures, and triggers for complex data retrieval. Students write multi-table queries for reporting scenarios.
Lesson 4 • Transaction Management and Concurrency
Explains ACID properties, isolation levels, and locking protocols to ensure data integrity under concurrent access. Students simulate transaction conflicts and apply solutions.
Lesson 5 • Relational Model and Normalisation
Explains relational algebra, functional dependencies, and normal forms to eliminate data redundancy. Students normalise a denormalised schema to third normal form.
Chapter 7HideHide detailsSee detailsComputer Networks and Internet Technologies
Computer Networks and Internet Technologies
Lesson 1 • Network Fundamentals and OSI Model
Introduces transmission media, topologies, and the seven-layer OSI reference model. Students map real protocols to OSI layers.
Lesson 2 • Transport and Application Layer Protocols
Explains TCP three-way handshake, UDP, and key application protocols for end-to-end communication. Students trace HTTP and DNS transactions using packet analysis tools.
Lesson 3 • Data Link and Network Layer Protocols
Covers MAC addressing, framing, IP addressing, and subnetting for packet delivery. Students perform subnetting calculations and configure IP addresses.
Lesson 4 • Network Security Fundamentals
Identifies common network threats and applies firewalls, VPNs, and encryption to protect data in transit. Connects to the security chapter in supplementary content.
Lesson 5 • Routing and Switching Concepts
Teaches static and dynamic routing, VLANs, and switching to build scalable network infrastructures. Students configure basic routing tables.
Chapter 8HideHide detailsSee detailsWeb Technologies and Application Development
Web Technologies and Application Development
Lesson 1 • HTML5 and CSS3 Fundamentals
Covers semantic HTML5 elements and CSS3 styling rules to create structured, accessible web pages. Students build a multi-page static website.
Lesson 2 • Deployment and Web Server Configuration
Covers web server setup, virtual hosts, HTTPS configuration, and basic performance tuning. Students deploy their application to a live server environment.
Lesson 3 • Server-Side Programming with PHP
Introduces PHP syntax, session management, and database connectivity for dynamic page generation. Students build a login system backed by a relational database.
Lesson 4 • Web Frameworks and MVC Architecture
Explains the Model-View-Controller pattern and demonstrates it using a lightweight web framework. Students refactor a procedural PHP application into MVC structure.
Lesson 5 • JavaScript and DOM Manipulation
Teaches JavaScript syntax, events, and DOM API to add interactivity to web pages. Students implement form validation and dynamic content updates.
Your valid completion certificate
This course is for you:
Recent graduates: seeking a structured entry point into the IT industry.
Commerce or arts graduates: pivoting toward a technology-focused professional career.
Working professionals: adding computer science credentials to boost promotion prospects.
Small business owners: wanting to manage their own digital systems more confidently.
Aspiring developers: ready to move beyond tutorials into a rigorous, full curriculum.
Related Courses
FAQs
Who is Dedika?
Is the certificate valid in Pakistan?
Are the courses free?
What is the course workload?
What are the courses like?
How do the courses work?
What is the duration of the courses?
What is the cost or price of the courses?
What is an EAD or online course and how does it work?
PDF Course



















