VIIM Programmes

Projects, Internships and Skill Certification

One Source Catalogue. Four Distinct Learning Approaches

The Venugopal Institute of Independent Mathematics (VIIM) offers structured learning opportunities in Mathematics, Computer Science, Management, Artificial Intelligence and related interdisciplinary areas.

The existing VIIM Internship Programme Catalogue serves as the common source catalogue of topics from which suitable programmes may be developed as projects, internships, skill certificate courses or integrated internship and skill certification programmes.

The same subject area can support different learning objectives. What distinguishes these programmes is not necessarily the topic selected, but the purpose of the learning, the activities undertaken, the expected outcomes and the method of assessment.

VIIM therefore organises its offerings into four distinct programme categories.

1. VIIM Project Programmes

Independent inquiry, problem-solving and the development of mathematical, computational or interdisciplinary solutions.

A VIIM Project Programme centres on a defined problem, question, investigation or development task. Participants are expected to explore the problem, identify an appropriate methodology, undertake independent or guided investigation, analyse the findings and present a reasoned outcome.

Depending on the topic, the work may involve mathematical analysis, computational experiments, software tools, modelling, simulation, data analysis, optimisation or interdisciplinary applications.

The emphasis is on the process of inquiry: understanding a problem, selecting an approach, developing a solution, examining the results and communicating the conclusions.

A project may produce a mathematical investigation, computational implementation, analytical report, model, prototype or other suitable output.

The defining feature is the development and presentation of an independently investigated solution or outcome.

Assessment should consider the quality of the investigation, appropriateness of the methodology, correctness of the analysis, interpretation of results and quality of the final output.

2. VIIM Internship Programmes

Practical learning, investigation and project experience.

A VIIM Internship Programme provides participants with structured practical exposure to a subject, method, tool or application area.

Participants develop familiarity with relevant concepts, explore appropriate software or methods, undertake guided activities and apply their learning to practical problems. Depending on the programme, they may investigate a problem, perform computational exercises, examine a model, analyse data or complete a mini-project.

The internship approach emphasises learning through practical engagement. Participants gain experience in applying concepts, following a methodology, using tools appropriately, examining results and documenting their work.

An internship may include a project or practical assignment, but its primary purpose is structured practical learning and experience. It need not require the same degree of independent investigation or the same depth of final-solution development as a dedicated project programme.

The defining feature is practical exposure and learning through guided investigation and application.

Assessment may consider participation in practical activities, application of concepts, use of tools, completion of assigned tasks, reflection on learning and the quality of the internship report or other required evidence.

3. VIIM Skill Certificate Courses

Structured training with defined competency assessment.

A VIIM Skill Certificate Course is designed to develop specified skills that participants can demonstrate against stated learning outcomes and assessment criteria.

The programme begins by identifying the competencies participants are expected to acquire. Training activities then provide opportunities to learn, practise and refine those competencies. The course concludes with an appropriate assessment to determine whether the required skills have been demonstrated.

Depending on the subject, competencies may include using software, applying mathematical or computational methods, analysing data, constructing models, implementing algorithms, preparing digital content or performing other defined tasks.

The emphasis is not simply on exposure to a topic or completion of a learning activity. It is on demonstrating the ability to perform specified tasks to an appropriate standard.

The defining feature is assessed competence against predetermined criteria.

Assessment may involve practical exercises, individual tasks, demonstrations, submitted work, oral explanations or other suitable methods. The certificate should be issued only when the participant satisfies the stated requirements.

A Skill Certificate Course may use topics from the common VIIM catalogue, but its learning outcomes, training activities and assessment criteria must be designed specifically around the competencies to be demonstrated.

4. VIIM Integrated Internship and Skill Certification Programmes

Practical experience combined with separately documented skill assessment.

A VIIM Integrated Internship and Skill Certification Programme combines the practical learning approach of an internship with a distinct process for developing and assessing defined competencies.

The internship component provides structured exposure, guided investigation and practical experience. The skill certification component identifies the required competencies, provides appropriate opportunities for focused practice and evaluates whether the participant can demonstrate the specified skills.

The two components are related but have different purposes. Completing the internship activities does not, by itself, establish that the participant has demonstrated every competency required for skill certification.

The programme must therefore distinguish the internship activities from the skill development and assessment activities. Where the same topic is used in both components, the activities and evidence should be planned carefully to avoid simply counting the same work twice.

The defining feature is the combination of practical internship experience and a separately defined, documented competency assessment.

The internship component and the skill certification component should have clearly stated requirements. Participants who meet the internship requirements may receive an Internship Completion Certificate. Participants who independently satisfy the skill assessment requirements may receive a Skill Certificate. Where both sets of requirements are met, VIIM may issue the corresponding certificates or an appropriately worded integrated certificate in accordance with the programme's published policy.

The duration, assessment requirements and certificate arrangements should be specified for each programme before enrolment.

One Common Catalogue, Four Different Approaches

The VIIM Internship Programme Catalogue provides the common source of subject areas and topics for these offerings. The catalogue should be consulted when selecting a programme, rather than reproducing the entire list under each category.

A topic such as graph algorithms, mathematical modelling, spreadsheet-based optimisation, AI-assisted analysis or website development can be adapted to more than one programme type.

As a project, it may require the participant to investigate a problem and develop a solution. As an internship, it may involve guided exploration, practical exercises and experience with relevant tools. As a skill certificate course, it must focus on defined competencies and assess whether the participant can demonstrate them. As an integrated internship and skill certification programme, it must combine practical experience with a distinct and documented competency assessment.

The programme category must therefore be selected according to the intended learning outcomes and assessment design, not merely the title of the topic.

Learning, Assessment and Certification

VIIM aims to provide meaningful learning experiences through structured activities, practical application and appropriate assessment.

Each programme should specify its purpose, learning outcomes, duration, activities, expected outputs, assessment requirements and certificate conditions before it begins.

Project programmes should assess the quality of inquiry and the resulting work. Internship programmes should assess practical engagement and the application of learning. Skill Certificate Courses should assess defined competencies against stated criteria. Integrated programmes should document both the internship experience and the separate skill assessment.

The award of a certificate is subject to the requirements published for the relevant programme. Participation alone should not be represented as proof of competency where a skill assessment is required.

VIIM-issued certificates document the programme completed and the requirements satisfied. They should not be interpreted as university credits, degrees, diplomas or externally accredited qualifications unless the relevant recognition or approval has formally been obtained.

Our Approach

VIIM seeks to cultivate independent thinking, practical capability and responsible application of knowledge.

Across its programmes, participants are encouraged to understand the problem, select appropriate methods, use digital and computational tools thoughtfully, examine results critically and communicate their work clearly.

The common catalogue provides the breadth of subject choices. The four programme approaches provide the structure through which those subjects become meaningful learning experiences.

Common structure for every 30-hour program

Each programme carries a 30-hour learning and project workload, divided into six blocks:

• Block 1 — Foundations and problem orientation: 4 hours

• Block 2 — Concepts and methods: 5 hours

• Block 3 — Software-based exploration: 6 hours

• Block 4 — Guided investigation or model development: 7 hours

• Block 5 — Mini-project, testing and interpretation: 5 hours

• Block 6 — Report and presentation: 3 hours

Total: 30 hours.

The exact emphasis will vary by topic, but the total remains 30 hours. The programme will culminate in a practical output: a mathematical investigation, computational experiment, model, analysis, simulation, decision-support solution or documented case study.

Common report requirements for all three sets

A practical 30-hour program can conclude with a report of approximately 15 pages, subject to the college's prescribed format.

Suggested report structure:

1. Title page and abstract

2. Introduction and problem statement

3. Objectives and scope

4. Mathematical or computational foundations

5. Methodology and software used

6. Model, algorithm or analytical procedure

7. Experiments, calculations or case study

8. Results and interpretation

9. Verification, limitations and possible improvements

10. Conclusion and references

Students should attach relevant software outputs, calculations, screenshots, graphs or model results. For AI-assisted work, they should record the role of AI and independently verify important claims and results.

VIIM Programmes for Mathematics Majors

Indicative 30-Hour Portfolios

These programmes emphasise mathematical concepts, proof and reasoning, computation, modelling, optimisation, statistical analysis and interpretation. They encourage students to investigate mathematical problems, apply computational tools, develop practical solutions and communicate their findings.

The first 10 topics are designated as VIIM Signature programs. The remaining topics form the broader portfolio, offering students a range of options across five classifications.

VIIM Signature programs— Top 10

1. Mathematical Modelling of Real-World Systems (Topic 7) ★

Students formulate a real-world problem, develop a mathematical model, explore it computationally, and interpret its results and limitations.

2. Numerical Methods for Mathematical Problems using SageMath (Topic 3) ★

Students implement numerical methods, investigate approximation techniques, compare computational results, and analyse accuracy, convergence and limitations.

3. Graph Algorithms and Network Analysis (Topic 12) ★

Students represent problems using graphs, investigate graph algorithms, analyse connectivity and paths, and explore applications in interconnected systems.

4. Matching, Assignment and Network Optimisation (Topic 16) ★

Students formulate matching and assignment problems, apply appropriate algorithms, and analyse alternative solutions to resource-allocation problems.

5. Linear Programming with Microsoft Excel Solver (Topic 21) ★

Students formulate linear programming problems, define objective functions and constraints, determine optimal solutions using Excel Solver, and interpret the results.

6. Game Theory and Strategic Decision Models (Topic 28) ★

Students investigate strategic decision-making through mathematical models, analyse payoff matrices, and explore selected game-theoretic concepts and applications.

7. Monte Carlo Simulation with Excel (Topic 36) ★

Students design randomised computational experiments, estimate quantities using simulation, and investigate the effects of sample size and uncertainty on results.

8. Statistical Modelling and Interpretation of Real-World Data (Topic 38) ★

Students analyse a suitable dataset, apply appropriate statistical methods, interpret patterns and uncertainty, and communicate evidence-based conclusions.

9. Independent Verification of AI-Generated Mathematical Solutions (Topic 45) ★

Students examine AI-generated mathematical solutions, identify errors or unsupported reasoning, verify results independently, and document their findings.

10. Mathematical Problem-Solving and Independent Inquiry using VIIM AI-GUIDE (Topic 8) ★

Students apply the VIIM AI-GUIDE framework—Gather, Understand, Identify, Design and Evaluate—to investigate mathematical problems, develop solutions, and independently verify their conclusions.

Complete Portfolio: 50 Topics

A. Calculus, Computational Mathematics and Applied Mathematics

1. Calculus with SageMath

Students investigate selected calculus problems using SageMath, perform symbolic and numerical computations, and interpret graphical and computational results.

2. Differential Equations with SageMath

Students formulate and solve selected differential equations, explore solution behaviour computationally, and interpret their mathematical significance.

3. Numerical Methods for Mathematical Problems using SageMath ★

Students implement numerical methods, investigate approximation techniques, compare computational results, and analyse accuracy, convergence and limitations.

4. Computational Experiments in Real Analysis

Students explore selected concepts in real analysis through computational experiments, formulate conjectures, and examine the relationship between numerical observations and rigorous mathematical reasoning.

5. Linear Algebra and Matrix Computation with SageMath

Students investigate matrix operations, systems of linear equations, eigenvalues and related concepts using computational methods, interpreting their mathematical and practical significance.

6. Mathematical Visualisation and Exploration with GeoGebra

Students construct mathematical visualisations, explore geometric and algebraic relationships, and use dynamic representations to investigate conjectures and mathematical properties.

7. Mathematical Modelling of Real-World Systems ★

Students formulate a real-world problem, develop a mathematical model, explore it computationally, and interpret its results and limitations.

8. Mathematical Problem-Solving and Independent Inquiry using VIIM AI-GUIDE ★

Students apply the VIIM AI-GUIDE framework—Gather, Understand, Identify, Design and Evaluate—to investigate mathematical problems, develop solutions, and independently verify their conclusions.

9. Sequences, Series and Convergence through Computational Experiments

Students investigate selected sequences and series, conduct computational experiments, explore convergence behaviour, and relate numerical observations to mathematical definitions and results.

10. Discrete Mathematics with SageMath

Students investigate selected discrete mathematical structures and problems using SageMath, combining mathematical reasoning with computational exploration.

B. Graph Theory and Discrete Structures

11. Graph Theory with GRIN / Gephi / Graph Tea

Students construct and analyse graphs using Software, investigate fundamental graph properties, and explore selected theoretical and practical problems.

12. Graph Algorithms and Network Analysis ★

Students represent problems using graphs, investigate graph algorithms, analyse connectivity and paths, and explore applications in interconnected systems.

13. Trees, Spanning Trees and Network Design

Students investigate tree structures and spanning trees, construct alternative network designs, and compare solutions according to specified criteria.

14. Shortest-Path and Minimum-Cost Network Problems

Students formulate network problems, apply shortest-path and minimum-cost methods, and compare alternative solutions under different conditions.

15. Graph Colouring and Mathematical Applications

Students investigate graph-colouring problems, develop and test colouring methods, and explore applications in scheduling, allocation and conflict resolution.

16. Matching, Assignment and Network Optimisation ★

Students formulate matching and assignment problems, apply appropriate algorithms, and analyse alternative solutions to resource-allocation problems.

17. Eulerian and Hamiltonian Graphs: Theory and Computation

Students investigate Eulerian and Hamiltonian properties, construct examples, test relevant conditions, and explore computational approaches to selected graph problems.

18. Graph Theory Applications in Transportation and Communication Networks

Students model transportation or communication systems using graphs, analyse network properties, and investigate connectivity, routes and related problems.

19. Combinatorics and Enumeration with SageMath

Students investigate counting problems, combinatorial structures and enumeration techniques using SageMath, comparing computational results with mathematical reasoning.

20. Discrete Structures and Computational Problem-Solving

Students formulate problems involving discrete structures, select appropriate mathematical methods, and investigate solutions through computational experiments.

C. Operations Research and Optimisation

21. Linear Programming with Microsoft Excel Solver ★

Students formulate linear programming problems, define objective functions and constraints, determine optimal solutions using Excel Solver, and interpret the results.

22. Linear Programming with OpenSolver

Students develop linear programming models using OpenSolver, solve resource-allocation problems, and evaluate the suitability and limitations of the resulting solutions.

23. Transportation and Assignment Models using Excel

Students formulate transportation and assignment problems, implement suitable solution methods in Excel, and compare alternative allocation strategies.

24. Integer Programming for Resource Allocation

Students formulate resource-allocation problems using integer decision variables, investigate feasible solutions, and interpret the implications of discrete constraints.

25. Sensitivity Analysis in Linear Programming

Students investigate how changes in objective-function coefficients and constraints affect optimal solutions, and interpret the implications for decision-making.

26. Network Optimisation using Graph Algorithms

Students formulate network optimisation problems, apply suitable graph algorithms, and compare alternative solutions according to cost, distance or other objectives.

27. Decision Models and Optimisation with Excel

Students construct quantitative decision models using Excel, evaluate alternative choices, and investigate how constraints and objectives influence outcomes.

28. Game Theory and Strategic Decision Models ★

Students investigate strategic decision-making through mathematical models, analyse payoff matrices, and explore selected game-theoretic concepts and applications.

29. Inventory Control Models in Operations Research

Students develop inventory models, investigate stock levels and replenishment decisions, and evaluate the trade-offs between inventory availability and associated costs.

30. Queuing Theory and Service-System Analysis

Students formulate queuing models, investigate arrival and service processes, and analyse waiting times, utilisation and service-system performance.

D. Statistics, Probability and Simulation

31. Probability and Random Experiments with SageMath

Students investigate probability problems through random experiments and computational methods, comparing experimental observations with theoretical results.

32. Statistical Data Analysis using Excel

Students organise and analyse datasets using Excel, apply appropriate statistical techniques, and interpret the findings in relation to the questions investigated.

33. Descriptive Statistics and Data Visualisation

Students summarise datasets using descriptive statistics, construct appropriate visualisations, and investigate patterns, variability and potential anomalies.

34. Correlation and Regression Analysis with Excel

Students investigate relationships between variables, construct correlation and regression analyses, and interpret the strength, direction and limitations of observed relationships.

35. Probability Distributions and Computational Exploration

Students investigate selected probability distributions, conduct computational experiments, and compare theoretical properties with simulated results.

36. Monte Carlo Simulation with Excel ★

Students design randomised computational experiments, estimate quantities using simulation, and investigate the effects of sample size and uncertainty on results.

37. Simulation of Random Processes using SageMath

Students construct computational models of selected random processes, investigate their behaviour, and interpret the resulting simulations.

38. Statistical Modelling and Interpretation of Real-World Data ★

Students analyse a suitable dataset, apply appropriate statistical methods, interpret patterns and uncertainty, and communicate evidence-based conclusions.

39. Sampling Methods and Statistical Inference

Students investigate sampling strategies, explore sampling variability, apply selected inferential methods, and examine the limitations of conclusions drawn from samples.

40. Time-Series Exploration and Forecasting with Excel

Students analyse time-series data, investigate trends and patterns, apply selected forecasting methods, and evaluate forecast performance.

E. Automata, Mathematical Heritage and AI-GUIDE

41. Automata Theory with JFLAP

Students construct and analyse automata using JFLAP, investigate state transitions and language recognition, and explore selected problems in computational theory.

42. Finite-State Machines and Formal Language Models

Students develop finite-state machine models, investigate transitions and acceptance conditions, and explore applications of formal models in computational systems.

43. Logic, Sets and Relations through Computational Exploration

Students investigate logical propositions, set operations and relations, using examples and computational exploration to examine mathematical properties.

44. Mathematical Modelling and Verification using VIIM AI-GUIDE

Students formulate a mathematical problem, construct a model, investigate solutions, and evaluate the results through the structured application of VIIM AI-GUIDE.

45. Independent Verification of AI-Generated Mathematical Solutions ★

Students examine AI-generated mathematical solutions, identify errors or unsupported reasoning, verify results independently, and document their findings.

46. AI-Assisted Mathematical Investigation with SageMath

Students use AI-assisted inquiry and SageMath to explore mathematical problems, conduct computational experiments, and independently verify important results.

47. Ancient Indian Mathematics: Computational Study of Selected Methods

Students investigate selected methods from ancient Indian mathematics, reconstruct their mathematical procedures, and examine examples through modern computational techniques.

48. Vedic Mathematics: Mathematical Analysis and Verification of Selected Techniques

Students examine selected Vedic Mathematics techniques, analyse the underlying mathematical operations, and verify their applicability and limitations through worked examples.

49. Mathematics in Indian Knowledge Traditions: Historical Methods and Modern Computation

Students study selected mathematical methods from Indian knowledge traditions, examine their historical context, and investigate their mathematical properties using modern computational approaches.

50. Integrated Mathematical Modelling, Computation and Evaluation using VIIM AI-GUIDE

Students formulate a mathematical problem, develop a model, conduct computational investigations, and evaluate their results through independent reasoning and the VIIM AI-GUIDE framework.

Common 30-Hour Structure for Mathematics Majors

Each program follows a common six-block structure:

• Block 1 — Foundations and problem orientation: 4 hours: Define the problem, establish the objectives, identify inputs and outputs, and clarify constraints and expected behaviour.

• Block 2 — Concepts and methods: 5 hours: Investigate the relevant mathematical foundations, methods and techniques.

• Block 3 — Software-based exploration: 6 hours: Explore examples and conduct initial experiments using suitable tools such as SageMath, GRIN, GeoGebra, Excel or other relevant software.

• Block 4 — Guided investigation or model development: 7 hours: Develop the mathematical model, computational procedure, analytical approach or project.

• Block 5 — Mini-project, testing and interpretation: 5 hours: Test results, verify calculations, investigate limitations and interpret findings.

• Block 6 — Report and presentation: 3 hours: Document the work, prepare the internship report and present the findings.

Total: 30 hours.

Expected Output

A completed mathematical or computational investigation supported by documented experiments, calculations, software outputs, a mini-project and a report.

For AI-assisted programs, students should document the role of AI and independently verify significant mathematical claims and computational results.

VIIM Programmes for Computer Science Majors

Indicative 30-Hour Portfolios

These programmes connect computer science with algorithms, data structures, graph theory, automata, formal languages, optimisation, simulation, statistical computing and computational problem-solving. They emphasise investigation, mathematical reasoning, implementation, experimentation, testing and independent verification rather than conventional programming-language or software-development training alone.

The first 10 topics are designated as VIIM Signature Programs. The remaining topics form the broader portfolio, offering students opportunities to investigate computational problems across five classifications.

VIIM Signature programs— Top 10

1. Algorithm Design, Analysis and Computational Problem-Solving (Topic 1) ★

Students formulate computational problems, design suitable algorithms, analyse their correctness and efficiency, and evaluate alternative approaches through mathematical reasoning and computational experiments.

2. Graph Algorithms and Network Analysis (Topic 12) ★

Students represent computational problems using graphs, investigate graph algorithms, analyse connectivity and paths, and explore applications in computer networks and interconnected systems.

3. Shortest-Path Analysis and Intelligent Network Routing (Topic 13) ★

Students model routing problems, implement shortest-path algorithms, compare alternative routes, and investigate how network structure influences computational performance.

4. Matching Algorithms and Allocation Problems (Topic 16) ★

Students formulate matching and allocation problems, implement suitable algorithms, and compare solutions under different constraints and resource requirements.

5. Automata Theory and Computational Modelling using JFLAP (Topic 21) ★

Students construct and analyse automata using JFLAP, investigate state transitions and language recognition, and explore the mathematical foundations of computational models.

6. Finite-State Machines and Formal Language Recognition (Topic 22) ★

Students develop finite-state machines, model state transitions, and investigate how formal computational structures recognise specified languages and patterns.

7. Comparative Evaluation of Algorithms using Computational Experiments (Topic 35) ★

Students conduct computational experiments to compare algorithms, analyse performance measures, investigate the influence of input characteristics, and interpret experimental findings.

8. Monte Carlo Simulation and Computational Investigation (Topic 37) ★

Students design randomised computational experiments, investigate problems using Monte Carlo methods, and evaluate estimation accuracy and uncertainty.

9. Testing, Debugging and Verification of AI-Generated Mathematical Code (Topic 42) ★

Students examine AI-generated mathematical code, develop test cases, identify implementation errors, and verify computational outputs against expected results or independent methods.

10. Integrated Algorithm Design, Simulation and Independent Verification using VIIM AI-GUIDE (Topic 50) ★

Students formulate a computational problem, design or select an appropriate algorithm, conduct simulations, test results, and independently evaluate correctness and limitations using the VIIM AI-GUIDE framework.

Complete Portfolio: 50 Topics

A. Algorithms, Computational Thinking and Mathematical Computation

1. Algorithm Design, Analysis and Computational Problem-Solving ★

Students formulate computational problems, design suitable algorithms, analyse their correctness and efficiency, and evaluate alternative approaches through mathematical reasoning and computational experiments.

2. Computational Problem-Solving using AI, SageMath and Python

Students investigate mathematical and computational problems using AI-assisted inquiry, SageMath and Python, compare alternative approaches, and verify results independently.

3. Numerical Algorithms and Computational Error Analysis

Students implement selected numerical algorithms, investigate approximation errors, compare computational results, and analyse accuracy and numerical limitations.

4. Computational Exploration of Sequences and Number Patterns

Students investigate numerical sequences and patterns, formulate conjectures, conduct computational experiments, and examine the mathematical validity of their observations.

5. Combinatorial Algorithm Design and Evaluation using SageMath

Students investigate combinatorial problems, develop or apply suitable algorithms, and evaluate their outputs against mathematical reasoning and computational evidence.

6. Mathematical Logic and Computational Reasoning

Students investigate logical propositions and mathematical reasoning, construct computational examples, and analyse the validity of selected arguments.

7. Recurrence Relations and Algorithmic Growth Analysis

Students investigate recurrence relations, analyse the growth of selected algorithms, and compare theoretical predictions with computational observations.

8. Computational Experiments for Testing Mathematical Conjectures

Students formulate mathematical conjectures, design computational experiments, investigate examples and counterexamples, and distinguish numerical evidence from mathematical proof.

9. Independent Verification of Algorithms and Computational Results

Students examine algorithmic solutions, construct test cases, verify computational outputs independently, and document errors, limitations and corrections.

10. Analytical Inquiry into Algorithm Design using VIIM AI-GUIDE

Students apply the VIIM AI-GUIDE framework—Gather, Understand, Identify, Design and Evaluate—to investigate computational problems, develop solutions, and independently verify results.

B. Graph Theory and Network Applications

11. Graph-Theory Exploration using GRIN / Gephi / Graph Tea

Students construct and analyse graphs using GRIN, investigate fundamental graph properties, and explore selected graph-theoretic problems.

12. Graph Algorithms and Network Analysis ★

Students represent computational problems using graphs, investigate graph algorithms, analyse connectivity and paths, and explore applications in computer networks and interconnected systems.

13. Shortest-Path Analysis and Intelligent Network Routing ★

Students model routing problems, implement shortest-path algorithms, compare alternative routes, and investigate how network structure influences computational performance.

14. Minimum Spanning Trees and Network Connectivity Analysis

Students construct minimum spanning trees, compare network designs, and investigate how spanning-tree algorithms support connectivity and cost-efficient network structures.

15. Graph Colouring for Scheduling and Resource Allocation

Students formulate graph-colouring problems, investigate suitable algorithms, and explore applications in scheduling, allocation and conflict avoidance.

16. Matching Algorithms and Allocation Problems ★

Students formulate matching and allocation problems, implement suitable algorithms, and compare solutions under different constraints and resource requirements.

17. Network Flow Models and Algorithmic Optimisation

Students formulate network-flow problems, investigate flow algorithms, and analyse how capacity constraints affect feasible flows and computational solutions.

18. Computational Analysis of Communication and Information Networks

Students represent communication or information systems as graphs, analyse structural properties, and investigate connectivity, paths and network relationships.

19. Graph Analysis of Dependency and Precedence Networks

Students construct dependency graphs, analyse precedence relationships, and investigate how graph structures support task ordering and process planning.

20. Computational Network Analysis using Graph-Theory Software

Students investigate network structures using appropriate graph-theory software, apply selected algorithms, and interpret computational results.

C. Automata Theory and Formal Languages

21. Automata Theory and Computational Modelling using JFLAP ★

Students construct and analyse automata using JFLAP, investigate state transitions and language recognition, and explore the mathematical foundations of computational models.

22. Finite-State Machines and Formal Language Recognition ★

Students develop finite-state machines, model state transitions, and investigate how formal computational structures recognise specified languages and patterns.

23. Regular Expressions and Finite-State Modelling

Students investigate regular expressions, construct corresponding finite-state models, and explore the relationships between pattern descriptions and language recognition.

24. Design and Verification of Deterministic and Nondeterministic Finite Automata

Students construct deterministic and nondeterministic finite automata, test their behaviour, and verify language-recognition properties using suitable examples and computational tools.

25. Context-Free Grammars and Pushdown Automata using JFLAP

Students construct context-free grammars and pushdown automata, investigate their relationships, and explore selected language-recognition problems using JFLAP.

26. Turing Machines and Computational Models using JFLAP

Students investigate Turing machines, construct selected computational models, and explore their operation through carefully designed examples.

27. State Transition Modelling and Formal Verification

Students develop state-transition models, examine possible system behaviours, and investigate formal methods for checking specified properties.

28. Finite-State Modelling of Intelligent Digital and Information Systems

Students model selected digital or information systems using finite-state machines, investigate state transitions, and evaluate the suitability of the models.

29. Formal Language Recognition and Computational Experiments

Students investigate formal languages, construct recognition models, and conduct computational experiments to evaluate their behaviour.

30. Design and Independent Verification of Finite-State Machines

Students design finite-state machines for specified problems, test their transitions and outputs, and independently verify their behaviour against requirements.

D. Optimisation, Simulation and Statistical Computing

31. Linear Programming for Computational Resource Allocation

Students formulate linear programming problems, define objectives and constraints, and investigate computational solutions to resource-allocation problems.

32. Graph-Based Network Optimisation

Students formulate network optimisation problems using graph models, apply suitable algorithms, and compare solutions according to cost, distance or other objectives.

33. Combinatorial Optimisation using AI and SageMath

Students investigate combinatorial optimisation problems, use appropriate computational methods, and evaluate solutions through mathematical reasoning and independent verification.

34. Scheduling Models using Excel Solver and OpenSolver

Students formulate scheduling problems, implement optimisation models, and analyse how constraints and objectives influence feasible schedules.

35. Comparative Evaluation of Algorithms using Computational Experiments ★

Students conduct computational experiments to compare algorithms, analyse performance measures, investigate the influence of input characteristics, and interpret experimental findings.

36. Discrete-Event Modelling and System Simulation

Students develop discrete-event models of selected systems, simulate their operation, and investigate how changes in parameters influence system behaviour.

37. Monte Carlo Simulation and Computational Investigation ★

Students design randomised computational experiments, investigate problems using Monte Carlo methods, and evaluate estimation accuracy and uncertainty.

38. Probability Simulation and Randomised Experiments using SageMath

Students implement probability simulations using SageMath, compare experimental outcomes with theoretical expectations, and investigate the effects of repeated trials.

39. Statistical Analysis of Algorithmic Performance using Excel and AI

Students collect or generate algorithmic performance data, analyse relevant measures, and use statistical methods to compare results and interpret limitations.

40. Queuing Models and Computer-System Performance Analysis

Students formulate queuing models, investigate arrival and service processes, and analyse waiting times, utilisation and selected measures of computer-system performance.

E. VIIM AI-GUIDE, Verification and Integrated Computational Applications

41. Analytical Inquiry into Computational Problems using VIIM AI-GUIDE

Students apply the VIIM AI-GUIDE framework to formulate computational problems, investigate alternative approaches, and evaluate proposed solutions.

42. Testing, Debugging and Verification of AI-Generated Mathematical Code ★

Students examine AI-generated mathematical code, develop test cases, identify implementation errors, and verify computational outputs against expected results or independent methods.

43. Independent Verification of AI-Generated Solutions using SageMath

Students examine AI-generated mathematical solutions, reproduce calculations using SageMath, compare results, and document discrepancies or limitations.

44. Mathematical Modelling, Simulation and Computational Testing with AI Assistance

Students formulate mathematical models, conduct computational simulations, and investigate model behaviour using AI-assisted inquiry and independent verification.

45. Evidence-Based Evaluation of AI-Generated Algorithms and Their Limitations

Students evaluate AI-generated algorithms, examine assumptions and edge cases, conduct tests, and document evidence concerning correctness, performance and limitations.

46. Computational Experiments for Algorithm Validation

Students design experiments to test algorithmic behaviour, develop representative test cases, compare observed results with expected outcomes, and document findings.

47. Graph-Theory Problem Analysis and Verification using AI Assistance

Students investigate graph-theoretic problems using AI-assisted inquiry, apply appropriate graph algorithms, and independently verify important mathematical and computational results.

48. Formal Modelling and Verification using Automata Theory

Students construct formal models using automata theory, examine state transitions and language-recognition behaviour, and verify the models against specified requirements.

49. Computational Decision-Making using Graph Theory and Optimisation

Students formulate decision problems using graph models and optimisation techniques, compare alternative solutions, and investigate the influence of constraints and objectives.

50. Integrated Algorithm Design, Simulation and Independent Verification using VIIM AI-GUIDE ★

Students formulate a computational problem, design or select an appropriate algorithm, conduct simulations, test results, and independently evaluate correctness and limitations using the VIIM AI-GUIDE framework.

Common 30-Hour Structure for Computer Science Majors

Each program follows a common six-block structure:

• Block 1 — Foundations and problem orientation: 4 hours: Define the problem, establish objectives, identify inputs and outputs, and clarify constraints and expected behaviour.

• Block 2 — Concepts and methods: 5 hours: Investigate the relevant algorithms, data structures, mathematical foundations, graph models, automata or computational methods.

• Block 3 — Software-based exploration: 6 hours: Explore examples and conduct initial experiments using suitable tools such as Python, SageMath, GRIN, JFLAP, Excel or OpenSolver.

• Block 4 — Guided investigation or model development: 7 hours: Develop or implement the algorithm, graph model, automaton, simulation or computational procedure.

• Block 5 — Mini-project, testing and interpretation: 5 hours: Test representative cases, verify outputs, investigate errors and limitations, and interpret the results.

• Block 6 — Report and presentation: 3 hours: Document the problem, methodology, experiments, verification evidence, findings and conclusions.

Total: 30 hours.

Expected Output

A tested computational model, algorithm, graph analysis, finite-state machine, simulation or verification study, supported by documented experiments, implementation evidence and a report.

For AI-assisted programs, students should document the role of AI and independently verify significant algorithms, mathematical claims and computational results.

VIIM Programmes for Management Majors

Indicative 30-Hour Portfolio

VIIM Programmes for Management Majors provide practical exposure to quantitative management, business analytics, operations research, optimisation, forecasting, service operations, network analysis and evidence-based decision-making.

Students investigate management problems, explore appropriate analytical methods, work with relevant data and computational tools, and develop practical recommendations supported by evidence. The programmes also introduce students to AI-assisted inquiry through the VIIM AI-GUIDE framework—Gather, Understand, Identify, Design and Evaluate—with emphasis on independent verification and critical evaluation.

The first 10 topics are designated as VIIM Signature Programs. The complete portfolio contains 50 topics organised into five classifications.

VIIM Signature programs — Top 10

1. Operations Research for Managerial Decision-Making (Topic 1) ★

Students investigate a managerial decision problem using Operations Research methods. They identify objectives and constraints, formulate the problem, compare alternative solutions, and interpret the implications for managerial decision-making.

2. Linear Programming for Business Resource Allocation (Topic 2) ★

Students investigate a business resource-allocation problem, formulate a linear programming model, identify decision variables and constraints, and evaluate the implications of alternative resource-allocation decisions.

3. Transportation and Distribution Modelling using Excel (Topic 5) ★

Students examine a transportation or distribution problem, construct a quantitative model using Excel, investigate alternative allocation plans, and analyse their implications for cost and distribution efficiency.

4. Queuing Models for Customer-Service Systems (Topic 12) ★

Students investigate waiting-line problems in customer-service environments. They explore arrival and service processes, analyse waiting time and service capacity, and identify possible improvements in service-system performance.

5. Inventory Management and Reorder-Point Analysis (Topic 17) ★

Students investigate inventory-control problems using demand and replenishment information. They examine stock requirements, estimate reorder points under stated assumptions, and explore approaches to reducing stock-related inefficiencies.

6. Business Data Analysis using Microsoft Excel (Topic 22) ★

Students work with a relevant business dataset, organise and analyse data using Excel, develop appropriate visualisations, and interpret findings that may support managerial decisions.

7. Forecasting Methods for Business Planning (Topic 25) ★

Students investigate a business-planning problem using historical data. They explore suitable forecasting methods, compare forecast results, and examine how forecasts can support planning decisions.

8. Project Networks and Critical-Path Analysis (Topic 37) ★

Students investigate project scheduling through network models. They identify activity dependencies, analyse scheduling constraints, determine the critical path where applicable, and examine implications for project completion.

9. Independent Evaluation of AI-Generated Business Recommendations (Topic 42) ★

Students examine business recommendations generated by AI, identify assumptions, verify quantitative claims, assess feasibility, and develop evidence-based interpretations of the recommendations and their limitations.

10. Integrated Business Modelling, Optimisation and Evaluation using VIIM AI-GUIDE (Topic 50) ★

Students investigate a management problem using the VIIM AI-GUIDE framework. They formulate the problem, select appropriate analytical methods, develop or evaluate a quantitative model, compare alternatives, and independently verify important results before presenting their findings.

Complete Portfolio: 50 Topics

A. Operations Research and Business Optimisation

1. Operations Research for Managerial Decision-Making ★

Investigate a managerial decision problem using Operations Research methods. Identify objectives and constraints, formulate the problem, compare alternative solutions, and interpret the implications for managerial decision-making.

2. Linear Programming for Business Resource Allocation ★

Investigate a business resource-allocation problem, formulate a linear programming model, identify decision variables and constraints, and evaluate the implications of alternative resource-allocation decisions.

3. Linear Programming with Microsoft Excel Solver

Explore the formulation and solution of a business problem using linear programming and Excel Solver. Examine the model structure, investigate feasible solutions, and interpret the results.

4. Business Optimisation using Excel and OpenSolver

Investigate a business optimisation problem using Excel or OpenSolver. Develop the model, examine alternative scenarios, and interpret the implications of the resulting solutions.

5. Transportation and Distribution Modelling using Excel ★

Examine a transportation or distribution problem, construct a quantitative model using Excel, investigate alternative allocation plans, and analyse their implications for cost and distribution efficiency.

6. Assignment Models for Workforce and Task Allocation

Investigate a workforce or task-allocation problem. Explore assignment models, examine feasible allocations, and analyse how different assignments affect operational requirements.

7. Integer Programming for Business Planning

Explore a business-planning problem involving discrete decisions. Formulate an integer programming model and investigate how the constraints influence feasible planning alternatives.

8. Sensitivity Analysis for Managerial Decisions

Investigate how changes in model parameters affect an optimisation solution. Explore sensitivity analysis and examine the conditions under which managerial recommendations may change.

9. Network Optimisation for Logistics and Distribution

Represent a logistics or distribution problem as a network. Explore suitable optimisation methods and compare alternatives according to cost, distance or other relevant criteria.

10. Quantitative Methods for Business Decision-Making

Investigate a managerial problem using appropriate quantitative methods. Compare alternatives, interpret numerical evidence, and develop recommendations supported by the analysis.

B. Service Operations, Simulation and Process Improvement

11. Service Operations Management through Quantitative Models

Investigate a service-operation problem using quantitative models. Examine operational constraints, compare possible approaches, and identify opportunities for service improvement.

12. Queuing Models for Customer-Service Systems ★

Investigate waiting-line problems in customer-service environments. Explore arrival and service processes, analyse waiting time and service capacity, and identify possible improvements in service-system performance.

13. Simulation of Service Operations using Excel

Explore the simulation of a service operation using Excel. Investigate how changes in demand, service time or resource availability may influence operational performance.

14. Capacity Planning and Resource Utilisation Models

Investigate capacity requirements in a selected operational setting. Examine the relationship between demand, available capacity and resource utilisation using appropriate quantitative models.

15. Waiting-Time Analysis and Service-System Improvement

Investigate waiting times in a service system using suitable observations or simulated data. Examine potential causes of delay and explore alternative approaches to improving service performance.

16. Workforce Scheduling using Excel Solver

Explore a workforce-scheduling problem, identify staffing requirements and constraints, and use Excel Solver to investigate feasible schedules.

17. Inventory Management and Reorder-Point Analysis ★

Investigate inventory-control problems using demand and replenishment information. Examine stock requirements, estimate reorder points under stated assumptions, and explore approaches to reducing stock-related inefficiencies.

18. Supply Chain and Distribution Modelling

Explore the structure of a selected supply chain or distribution system. Investigate product flows, identify constraints, and examine alternative arrangements using appropriate models.

19. Process Flow Analysis and Bottleneck Identification

Map a selected business process, examine its stages and dependencies, and investigate potential bottlenecks using operational data or a suitable model.

20. Simulation-Based Evaluation of Service-System Performance

Explore the simulation of a service system under different operating conditions. Compare selected performance measures and examine the implications of possible operational changes.

C. Statistics, Forecasting and Business Analytics

21. Statistical Methods for Management Decision-Making

Investigate a management question using appropriate statistical methods. Analyse relevant data, interpret findings, and examine their implications for managerial decisions.

22. Business Data Analysis using Microsoft Excel ★

Work with a relevant business dataset, organise and analyse data using Excel, develop appropriate visualisations, and interpret findings that may support managerial decisions.

23. Descriptive Statistics and Business Data Visualisation

Explore a business dataset using descriptive statistics and suitable visualisations. Identify patterns, compare groups, and communicate findings clearly.

24. Correlation and Regression for Business Analysis

Investigate relationships between selected business variables using correlation and regression. Interpret the results and examine the limitations of conclusions drawn from observational data.

25. Forecasting Methods for Business Planning ★

Investigate a business-planning problem using historical data. Explore suitable forecasting methods, compare forecast results, and examine how forecasts can support planning decisions.

26. Time-Series Analysis using Excel

Explore time-series data using Excel. Investigate trends and other relevant patterns, apply suitable analytical methods, and interpret their implications for business planning.

27. Probability and Risk Analysis for Managerial Decisions

Investigate uncertainty in a managerial decision using probability models. Identify possible outcomes, examine relevant risks, and compare alternatives under stated assumptions.

28. Sampling and Statistical Inference for Business Research

Explore sampling approaches for a business-research question. Investigate appropriate statistical methods and examine the limitations of conclusions drawn from sample data.

29. Quality Control and Statistical Process Analysis

Investigate a selected process using quality-related data. Apply suitable statistical methods, identify unusual patterns, and explore opportunities for process improvement.

30. Comparative Analysis of Business Performance Indicators

Select relevant business performance indicators, analyse data across periods or groups, and compare results to identify meaningful differences and possible explanations.

D. Graph Theory, Networks and Strategic Decision-Making

31. Graph Theory Applications in Business Management

Represent a business problem using a graph and investigate its structure. Explore how graph-theoretic concepts can support the analysis of relationships, dependencies or connectivity.

32. Network Analysis for Logistics and Distribution

Represent a logistics or distribution system as a network. Examine connectivity and routes, investigate relevant constraints, and compare alternative network arrangements.

33. Shortest-Path Models for Transportation Planning

Develop a graph-based transportation model and explore shortest-path methods. Compare alternative routes and interpret their practical implications.

34. Minimum Spanning Trees for Network Design

Investigate a network-design problem using minimum spanning trees. Compare alternative network structures and examine their implications for connectivity and total connection cost.

35. Graph-Based Scheduling and Project Planning

Represent tasks and dependencies using graph models. Investigate valid task sequences, scheduling constraints and their implications for project planning.

36. Matching and Allocation Models for Business Operations

Investigate an allocation problem involving workers, tasks, facilities or other resources. Explore matching models and compare feasible allocations.

37. Project Networks and Critical-Path Analysis ★

Investigate project scheduling through network models. Identify activity dependencies, analyse scheduling constraints, determine the critical path where applicable, and examine implications for project completion.

38. Game Theory for Competitive Business Decisions

Investigate a competitive decision problem using game-theoretic concepts. Identify the players, strategies and payoffs, and examine the implications of alternative strategic choices.

39. Decision Analysis under Uncertainty

Investigate a managerial decision involving uncertain outcomes. Define alternatives and relevant criteria, compare possible outcomes, and examine how assumptions influence the recommendation.

40. Network Models for Supply Chain and Service Operations

Develop a network representation of a supply chain or service operation. Investigate flows, dependencies and constraints, and explore opportunities for operational improvement.

E. VIIM AI-GUIDE, Quantitative Inquiry and Specialised Applications

41. AI-Assisted Quantitative Decision-Making using VIIM AI-GUIDE

Investigate a quantitative management problem using the VIIM AI-GUIDE framework. Formulate the problem, explore appropriate methods, evaluate alternatives, and independently verify important calculations.

42. Independent Evaluation of AI-Generated Business Recommendations ★

Examine business recommendations generated by AI, identify assumptions, verify quantitative claims, assess feasibility, and develop evidence-based interpretations of the recommendations and their limitations.

43. AI-Assisted Business Problem Structuring and Model Selection

Investigate how a business problem can be translated into a quantitative model. Use AI-assisted inquiry to explore alternatives, justify model selection, and examine the limitations of the chosen approach.

44. Mathematical Modelling for Business Decision Support

Develop a mathematical model for a selected business problem. Define variables and assumptions, analyse possible solutions, and interpret the implications for decision-making.

45. AI-Assisted Statistical Analysis with Independent Verification

Investigate a business dataset using AI-assisted statistical inquiry. Verify calculations, check interpretations, and document the strengths and limitations of the resulting analysis.

46. Simulation and Scenario Analysis for Business Planning

Explore a simulation or scenario model for a business-planning problem. Examine alternative assumptions and compare their implications for operational or managerial decisions.

47. Optimisation Models for Cost, Profit and Resource Allocation

Investigate a business problem involving cost, profit or limited resources. Explore an optimisation model, compare feasible alternatives, and interpret the resulting trade-offs.

48. Ancient Indian Mathematics and Quantitative Reasoning in Historical Context

Select a mathematical method from the history of ancient Indian mathematics and investigate its quantitative reasoning. Explain its historical context and examine an appropriate example.

49. Vedic Mathematics: Analysis and Verification of Selected Computational Techniques

Select a computational technique associated with Vedic Mathematics. Examine its procedure, test it against representative examples, and verify its results using conventional mathematical methods.

50. Integrated Business Modelling, Optimisation and Evaluation using VIIM AI-GUIDE ★

Investigate a management problem using the VIIM AI-GUIDE framework. Formulate the problem, develop a quantitative model, compare alternatives, independently verify important results, and present evidence-based recommendations.

Common 30-Hour Structure for Management Majors

Each program may follow this six-block structure:

• Block 1 — Problem orientation: 3 hours. Define the management problem, establish objectives, identify relevant variables and clarify the scope.

• Block 2 — Background and concepts: 5 hours. Investigate relevant management concepts, quantitative methods, data requirements and modelling approaches.

• Block 3 — Methodology and tool exploration: 5 hours. Explore the selected analytical method and relevant tools, identify data sources, and plan the investigation.

• Block 4 — Guided investigation and model development: 9 hours. Analyse data, construct a model, conduct calculations or simulations, and investigate alternative scenarios.

• Block 5 — Testing, interpretation and recommendations: 5 hours. Check calculations, examine assumptions, interpret results and develop evidence-based conclusions.

• Block 6 — Report and presentation: 3 hours. Document the problem, methodology, findings, limitations and recommendations.

Total: 30 hours.

Expected Output

A documented management investigation supported by relevant data analysis, a quantitative model, an optimisation solution, a simulation, a forecasting exercise or a decision-support framework. The report should explain the methodology, assumptions, findings, limitations and practical implications.

For AI-assisted programs, students should document the role of AI and independently verify significant calculations, statistical claims and recommendations.

VIIM Programmes for Artificial Intelligence Majors

Indicative 30-Hour Portfolio

VIIM Programmes for Artificial Intelligence (AI) Majors provide practical exposure to algorithm design, computational problem-solving, graph algorithms, automata, optimisation, simulation and the systematic evaluation of AI-assisted solutions.

Students investigate computational problems, explore mathematical and algorithmic foundations, implement or test computational models, and evaluate results through practical experimentation. The programmes emphasise independent reasoning, evidence-based conclusions and the ability to verify AI-generated outputs rather than accepting them without examination.

The portfolio incorporates the VIIM AI-GUIDE framework—Gather, Understand, Identify, Design and Evaluate—to encourage structured analytical inquiry and independent computational thinking.

The first 10 topics are designated as VIIM Signature Internships. The complete portfolio contains 50 topics organised into five classifications.

VIIM Signature programs— Top 10

1. AI-Assisted Algorithm Design and Analysis through Mathematical Problems (Topic 1) ★

Students investigate computational problems using mathematical reasoning and AI-assisted inquiry. They design or select appropriate algorithms, examine correctness and efficiency, and evaluate solutions through computational experiments.

2. Independent Verification of AI-Generated Algorithms and Computational Results (Topic 9) ★

Students examine AI-generated algorithms and computational outputs, develop test cases, compare results with independent methods, identify errors or limitations, and document their findings.

3. Graph Representation and Traversal Algorithms for AI Applications (Topic 12) ★

Students represent computational problems using graphs, implement graph-traversal algorithms, and investigate their behaviour through experiments relevant to AI applications.

4. AI-Based Shortest-Path Analysis and Intelligent Network Routing (Topic 13) ★

Students model routing problems using graphs, apply shortest-path algorithms, compare alternative routes, and investigate how network structure affects routing decisions.

5. Design, Testing and AI-Assisted Verification of Deterministic and Nondeterministic Finite Automata (Topic 24) ★

Students construct deterministic and nondeterministic finite automata, test their transitions and language-recognition behaviour, and verify their models using suitable computational tools.

6. Comparative Evaluation of Algorithms using AI-Guided Computational Experiments (Topic 35) ★

Students conduct computational experiments to compare algorithms, measure performance under different input conditions, analyse results, and evaluate the limitations of the experimental evidence.

7. Monte Carlo Simulation and AI-Assisted Computational Investigation (Topic 37) ★

Students investigate selected problems using Monte Carlo simulation, conduct randomised computational experiments, interpret the results, and examine uncertainty and limitations.

8. Testing, Debugging and Verification of AI-Generated Mathematical Code (Topic 42) ★

Students examine AI-generated mathematical code, develop systematic test cases, identify implementation errors, and verify computational outputs using independent calculations or suitable software.

9. AI-Assisted Computational Decision-Making using Graph Theory and Optimisation (Topic 49) ★

Students investigate a computational decision problem using graph theory and optimisation. They formulate the problem, compare feasible solutions, verify important results, and evaluate alternative decisions.

10. Integrated Algorithm Design, Simulation and Independent Verification using VIIM AI-GUIDE (Topic 50) ★

Students investigate a computational problem using the VIIM AI-GUIDE framework. They design or select an algorithm, conduct computational experiments, test results, and independently evaluate correctness, performance and limitations.

Complete Portfolio: 50 Topics

A. AI Algorithms, Computational Thinking and Mathematical Computation

1. AI-Assisted Algorithm Design and Analysis through Mathematical Problems ★

Investigate a computational problem using mathematical reasoning and AI-assisted inquiry. Design or select appropriate algorithms, analyse their correctness and efficiency, and evaluate the results through computational experiments.

2. Computational Problem-Solving with AI, SageMath and Python

Investigate mathematical and computational problems using AI-assisted inquiry, SageMath and Python. Compare alternative approaches, implement selected solutions, and independently verify the computational results.

3. AI-Based Numerical Algorithms and Computational Error Analysis

Explore numerical algorithms using AI-assisted inquiry. Implement selected methods, investigate approximation errors, compare computational results, and analyse accuracy and numerical limitations.

4. AI-Assisted Exploration of Sequences and Number Patterns

Investigate numerical sequences and patterns using computational experiments and AI-assisted inquiry. Formulate conjectures, test examples and counterexamples, and examine the mathematical validity of observations.

5. Combinatorial Algorithm Design and Evaluation using AI and SageMath

Investigate combinatorial problems using AI-assisted inquiry and SageMath. Apply or develop suitable algorithms, evaluate their outputs, and verify results against mathematical reasoning.

6. AI-Assisted Mathematical Logic and Computational Reasoning

Investigate selected problems in mathematical logic and computational reasoning. Explore alternative approaches, construct computational examples, and evaluate the validity of the resulting arguments.

7. Recurrence Relations, Algorithmic Growth and AI-Based Analysis

Investigate recurrence relations and algorithmic growth using mathematical analysis and AI-assisted inquiry. Compare theoretical expectations with computational observations and evaluate the limitations of the analysis.

8. AI-Assisted Computational Experiments for Testing Mathematical Conjectures

Formulate mathematical conjectures, design computational experiments, and investigate examples and counterexamples. Use AI-assisted inquiry to explore possible explanations while distinguishing experimental evidence from mathematical proof.

9. Independent Verification of AI-Generated Algorithms and Computational Results ★

Examine AI-generated algorithms and computational outputs, develop test cases, compare results with independent methods, identify errors or limitations, and document findings.

10. Analytical Inquiry into Algorithm Design using VIIM AI-GUIDE

Apply the VIIM AI-GUIDE framework—Gather, Understand, Identify, Design and Evaluate—to investigate a computational problem, select or design an algorithm, test its behaviour, and independently evaluate the results.

B. Graph Theory and Network Applications

11. AI-Assisted Graph-Theory Exploration using GRIN

Investigate graph-theoretic problems using AI-assisted inquiry and GRIN. Construct graph models, examine their properties, and interpret the results of computational exploration.

12. Graph Representation and Traversal Algorithms for AI Applications ★

Represent computational problems using graphs, implement graph-traversal algorithms, and investigate their behaviour through experiments relevant to AI applications.

13. AI-Based Shortest-Path Analysis and Intelligent Network Routing ★

Model routing problems using graphs, apply shortest-path algorithms, compare alternative routes, and investigate how network structure affects routing decisions.

14. Minimum Spanning Trees and AI-Assisted Network Connectivity Analysis

Investigate network connectivity using minimum spanning trees. Construct graph models, apply suitable algorithms, compare network structures, and examine their implications for network design.

15. AI-Assisted Graph Colouring for Scheduling and Resource Allocation

Investigate graph-colouring problems arising in scheduling and resource allocation. Develop graph models, apply suitable algorithms, and test whether the resulting colourings satisfy the specified constraints.

16. Matching Algorithms and AI-Assisted Allocation Problems

Investigate matching and allocation problems using graph models and AI-assisted inquiry. Apply suitable algorithms, compare feasible assignments, and independently verify the results.

17. Network Flow Models and AI-Assisted Algorithmic Optimisation

Formulate network-flow problems, investigate suitable flow algorithms, and examine how capacity constraints influence feasible solutions and computational results.

18. AI-Based Analysis of Communication and Information Networks

Represent selected communication or information systems as graphs. Investigate connectivity, paths and structural properties, and interpret findings in the context of network analysis.

19. AI-Assisted Graph Analysis of Dependency and Precedence Networks

Construct dependency and precedence graphs for selected computational problems. Analyse relationships and task ordering, and investigate how graph structures support computational planning.

20. Computational Network Analysis using Graph-Theory Software and AI

Investigate network structures using appropriate graph-theory software and AI-assisted inquiry. Apply selected graph algorithms, analyse results, and independently verify important findings.

C. Automata Theory and Formal Languages

21. AI-Assisted Exploration of Automata Theory using JFLAP

Investigate automata-theoretic problems using JFLAP and AI-assisted inquiry. Construct automata, examine state transitions, and explore language-recognition behaviour.

22. Finite Automata and AI-Based Regular Language Recognition

Construct finite automata for selected regular languages. Investigate their operation through computational experiments and examine the correctness of language-recognition results.

23. AI-Assisted Regular Expressions and Finite-State Modelling

Investigate regular expressions and corresponding finite-state models. Construct examples, test recognition behaviour, and examine the relationship between pattern descriptions and automata.

24. Design, Testing and AI-Assisted Verification of Deterministic and Nondeterministic Finite Automata ★

Construct deterministic and nondeterministic finite automata, test their transitions and language-recognition behaviour, and verify their models using suitable computational tools.

25. Context-Free Grammars, Pushdown Automata and AI-Assisted Analysis using JFLAP

Investigate context-free grammars and pushdown automata using JFLAP. Construct selected models, examine their behaviour, and analyse relevant language-recognition problems.

26. Turing Machines, Computational Models and AI-Assisted Exploration using JFLAP

Investigate Turing machines and selected computational models using JFLAP. Construct examples, examine state transitions, and analyse model behaviour.

27. AI-Assisted State-Transition Modelling and Formal Verification

Develop state-transition models for selected computational systems. Use AI-assisted inquiry to explore possible behaviours and independently verify specified properties.

28. Finite-State Modelling of Intelligent Digital and Information Systems

Investigate selected digital or information systems through finite-state modelling. Construct models, examine transitions, and evaluate their suitability for representing the specified behaviour.

29. AI-Assisted Formal Language Recognition and Computational Experiments

Investigate formal languages using computational models and AI-assisted inquiry. Conduct experiments, test recognition behaviour, and evaluate the limitations of the models.

30. Design and Independent Verification of AI-Assisted Finite-State Machines

Design finite-state machines for specified computational problems. Use AI-assisted inquiry where appropriate, test transitions and outputs, and independently verify the models against requirements.

D. Optimisation, Simulation and Statistical Computing

31. AI-Assisted Linear Programming for Computing and Resource Allocation

Investigate computational resource-allocation problems using linear programming. Formulate objective functions and constraints, explore computational solutions, and verify the results.

32. Graph-Based Network Optimisation with AI-Assisted Analysis

Develop graph-based models for network optimisation problems. Investigate alternative solutions using AI-assisted inquiry and appropriate algorithms, and compare results against specified objectives.

33. Combinatorial Optimisation using AI and SageMath

Investigate combinatorial optimisation problems using AI-assisted inquiry and SageMath. Apply suitable computational methods, compare solutions, and independently evaluate their validity.

34. AI-Assisted Scheduling Models using Excel Solver and OpenSolver

Investigate scheduling problems using Excel Solver or OpenSolver. Formulate constraints, evaluate feasible schedules, and analyse the implications of alternative solutions.

35. Comparative Evaluation of Algorithms using AI-Guided Computational Experiments ★

Conduct computational experiments to compare algorithms, measure performance under different input conditions, analyse results, and evaluate the limitations of the experimental evidence.

36. AI-Assisted Discrete-Event Modelling and System Simulation

Develop or investigate discrete-event models of selected systems. Conduct simulations, examine the effects of parameter changes, and interpret the resulting system behaviour.

37. Monte Carlo Simulation and AI-Assisted Computational Investigation ★

Investigate selected problems using Monte Carlo simulation, conduct randomised computational experiments, interpret the results, and examine uncertainty and limitations.

38. Probability Simulation and Randomised Experiments using AI and SageMath

Investigate probability problems using SageMath and AI-assisted inquiry. Conduct randomised experiments, compare empirical and theoretical outcomes, and examine the effects of repeated trials.

39. Statistical Analysis of Algorithmic Performance using Excel and AI

Collect or generate algorithmic performance data and analyse it using Excel and appropriate statistical methods. Compare results and interpret the limitations of the analysis.

40. AI-Assisted Queueing Models and Computer-System Performance Analysis

Investigate queuing models relevant to computer systems. Examine arrival and service processes, analyse waiting times and utilisation, and evaluate selected performance measures.

E. VIIM AI-GUIDE, Verification and Integrated Computational Applications

41. Analytical Inquiry into Computational Problems using VIIM AI-GUIDE

Apply the VIIM AI-GUIDE framework to formulate computational problems, investigate possible approaches, select appropriate methods, and independently evaluate proposed solutions.

42. Testing, Debugging and Verification of AI-Generated Mathematical Code ★

Examine AI-generated mathematical code, develop systematic test cases, identify implementation errors, and verify computational outputs using independent calculations or suitable software.

43. Independent Verification of AI-Generated Solutions using SageMath

Investigate AI-generated mathematical solutions by reproducing calculations using SageMath. Compare results, identify discrepancies, and document evidence supporting the conclusions.

44. AI-Assisted Mathematical Modelling, Simulation and Computational Testing

Develop mathematical models for selected computational problems, conduct simulations, and investigate model behaviour through testing and independent verification.

45. Evidence-Based Evaluation of AI-Generated Algorithms and Their Limitations

Investigate AI-generated algorithms, examine assumptions and edge cases, conduct systematic tests, and evaluate correctness, performance and limitations using evidence.

46. Design of AI-Assisted Computational Experiments for Algorithm Validation

Design computational experiments to investigate algorithmic behaviour. Define test conditions, compare observed and expected results, and document evidence supporting the validation conclusions.

47. AI-Assisted Analysis and Verification of Graph-Theory Problems

Investigate graph-theoretic problems using AI-assisted inquiry and suitable graph algorithms. Analyse the results and independently verify important mathematical and computational claims.

48. AI-Assisted Formal Modelling and Verification using Automata Theory

Develop formal models using automata theory, investigate their behaviour, and verify the models against specified computational requirements.

49. AI-Assisted Computational Decision-Making using Graph Theory and Optimisation ★

Investigate a computational decision problem using graph theory and optimisation. Formulate the problem, compare feasible solutions, verify important results, and evaluate alternative decisions.

50. Integrated Algorithm Design, Simulation and Independent Verification using VIIM AI-GUIDE ★

Investigate a computational problem using the VIIM AI-GUIDE framework. Design or select an algorithm, conduct computational experiments, test the results, and independently evaluate correctness, performance and limitations.

Common 30-Hour Structure for AI Majors

Each program may follow this six-block structure.

• Block 1 — Foundations and problem orientation: 4 hours. Define the computational problem, establish objectives, identify inputs and outputs, and clarify constraints.

• Block 2 — Concepts and methods: 5 hours. Investigate relevant algorithms, mathematical foundations, computational methods and AI-related concepts.

• Block 3 — Software-based exploration: 6 hours. Explore examples and conduct initial experiments using appropriate tools such as Python, SageMath, GRIN, JFLAP, Excel or OpenSolver.

• Block 4 — Guided investigation or model development: 7 hours. Implement or adapt the algorithm, construct the model, conduct experiments, and investigate alternative approaches.

• Block 5 — Testing, verification and interpretation: 5 hours. Test representative cases, verify important results independently, examine errors and limitations, and interpret the evidence.

• Block 6 — Report and presentation: 3 hours. Document the problem, methodology, implementation, experiments, findings and conclusions.

Total: 30 hours.

Expected Output

Depending on the topic, students should produce a documented computational investigation supported by one or more of the following:

• An implemented and tested algorithm.

• A graph model or network-analysis study.

• A finite-state machine or formal computational model.

• An optimisation model or simulation.

• A comparative algorithm-performance study.

• A mathematical-code verification report.

• An AI-assisted computational investigation with independent validation.

The report should explain the problem, methods, assumptions, computational evidence, findings and limitations. Where AI tools are used, students should document their role and independently verify significant mathematical claims, algorithms and computational results.