Mapping of GECA's academic resources

 Updated: 5 hours read

This post mean’t to index all the links, resources, labs, and notes made for GECA’s academics. Here are all the links, categorized subject wise.

Table of contents

Open Table of contents

📌 Projects

Quick Access: 🔗 SYLLABUS

These are the projects we have completed or are currently working on as part of the academic curriculum or personal interest.

CSPCC5004 Mini Project I

📌 Advanced Data Structures

Quick Access: 🔗 FOLDER | 🔗 SYLLABUS

CSPEC5001 Theory

📌 Advanced Machine Learning

Quick Access: 🔗 FOLDER | 🔗 SYLLABUS

CSPEC5002 Theory

📌 Advanced Computer Network

Quick Access: 🔗 FOLDER | 🔗 SYLLABUS

CSPEC5002 Theory

CSPCC5003 Labs

📌 Research Methodology

Quick Access: 🔗 FOLDER | 🔗 SYLLABUS

📌 Application Development Tools

Quick Access: 🔗 SYLLABUS

CS3014 Labs

  1. 💻 LAB 01 Introduction to ASP.NET Web Framework
  2. 💻 LAB 02 Develop a web UI for a TODO list using ASP.NET Core MVC, C#, and AJAX.
  3. 💻 LAB 03 Develop master pages and user controls for modularity and consistent UI design.
  4. 💻 LAB 04 Apply OOP principles in C# with design patterns for robust software architecture.
  5. 💻 LAB 05 Implement ASP.NET validation controls for multi-layered data integrity enforcement.
View all labs

Tentative list of labs:

  • 💻 LAB 04 Apply OOP principles in C# with design patterns for robust software architecture.
  • 💻 LAB 05 Implement ASP.NET validation controls for multi-layered data integrity enforcement.
  • 💻 LAB 06 Establish secure SQL Server connectivity using ADO.NET and LINQ for efficient data access.
  • 💻 LAB 07 Design and consume SOAP/RESTful web services for distributed application interoperability.
  • 💻 LAB 08 Integrate AJAX techniques in ASP.NET for asynchronous data processing.
  • 💻 LAB 09 Deploy web applications on IIS with optimized security, performance tuning, and configuration.
  • 💻 LAB 10 Execute a capstone project integrating front-end development, back-end logic, and deployment methodologies.

📌 Advanced Algorithm

Quick Access: 🔗 SYLLABUS

CS3016 Labs

  1. 💻 LAB 01 (Warm-Up) Implement divide-and-conquer algorithms for binary search, merge sort, and quick sort.
  2. 💻 LAB 02 Program graph theory reductions among clique, vertex cover, and independent set problems.
View all labs

Tentative list of labs:

  • 💻 LAB 03 Engineer approximation techniques for NP-hard problems with performance benchmarking.
  • 💻 LAB 04 Create heuristic-based approximation algorithms for various TSP variants.
  • 💻 LAB 05 Implement randomized QuickSort with pivot randomization to assess average-case complexity.
  • 💻 LAB 06 Develop a randomized min-cut algorithm for graph partitioning and probabilistic analysis.
  • 💻 LAB 07 Simulate a Markov chain to demonstrate the Markov property and compute stationary distributions.
  • 💻 LAB 08 Code the Viterbi algorithm for optimal state sequence decoding in HMMs.
  • 💻 LAB 09 Execute the forward algorithm in HMMs to calculate sequence probabilities.
  • 💻 LAB 10 Develop algorithms addressing computational geometry and big data with optimization and parallel processing.

📌 Advanced C and C++

Quick Access: 🔗 SYLLABUS

CSPC2005 Labs

  1. 💻 LAB 01 Construct and execute C program showing use of pointer to structure.
  2. 💻 LAB 02 Implement C program for self-referential structure.

📌 Web Technology

Quick Access: 🔗 SYLLABUS

CSPC2006 Labs

  1. 💻 LAB 01 Creating User Research and User Profiles.
  2. 💻 LAB 02 Creating Wireframes and Prototypes.
Previous Post
CS3014/05. Validation Controls | Application Development Tools
Next Post
CS3016/02. Program graph theory reductions among clique, vertex cover, and independent set problems.