India · 2026-27 session
Dr. A.P.J. Abdul Kalam Technical University, Lucknow
28 lab practicals for the AKTU syllabus.
AKTU Lucknow’s B.Tech CSE for the 2026-27 session: C programming, data structures, Java OOP and the operating system lab. Every lesson is stepped, compiled and checked by a real toolchain on your own machine — the model reviews your code afterwards, it does not decide whether you passed.
Updated
Semester by semester
Programme: B.Tech. Computer Science and Engineering. Scheme: 2026-27 session (Yr 1 NEP 2026 scheme; Yrs 2–4 B-series scheme). Open a course to see its practical units and the lab lesson GroutCode ships for each.
Semester 1
1 course5 lab lessonsCPython- ACS101CPython
Programming Languages
5
lessons
- C basics — types, operators, conversions and formatted I/O
- Control flow in C — branches, loops, functions and recursion
- 1C basics — types, operators, conversions and formatted I/OUnit I · Programming Basics (C)
- 2Control flow in C — branches, loops, functions and recursionUnit II · Decision Making and Control Flow (C)
- 3Student records in C — arrays, strings, pointers, structs and filesUnit III · Advanced Programming Concepts (C)
- 4Python basics — values, operators, control flow and functionsUnit IV · Python Introduction
- 5Python data structures, files and an IoT sensor simulationUnit V · Python Data Structures and Emerging Applications
Semester 2
1 course5 lab lessonsCPython- ACS201CPython
Essentials of Data Structures
5
lessons
- Array operations and matrices in C
- Singly linked list in C, with doubly and circular variants
- 1Array operations and matrices in CUnit I · Introduction and Arrays
- 2Singly linked list in C, with doubly and circular variantsUnit II · Linked List
- 3Array stack and circular queue in C, with their applicationsUnit III · Stack and Queue
- 4Searching and sorting in C, measured as you write themUnit IV · Searching and Sorting
- 5Binary search tree and graph traversal in PythonUnit V · Trees and Graphs (Concept Level)
Semester 3
2 courses6 lab lessonsC- BCS301C
Data Structure
5
lessons
- Array address formulae, sparse matrices, linked lists and polynomials in C
- Stacks, expression conversion, recursion and queues in C
- 1Array address formulae, sparse matrices, linked lists and polynomials in CUnit I · Introduction
- 2Stacks, expression conversion, recursion and queues in CUnit II · Stacks
- 3Searching, hashing and seven sorts in CUnit III · Searching
- 4Binary search trees, threaded trees, heaps, Huffman coding and AVL trees in CUnit IV · Trees
- 5Graphs in C: representations, DFS and BFS, spanning trees, Warshall and DijkstraUnit V · Graphs
- BCS351C
Data Structure Lab
1
lesson
- Data Structure Lab — sorts, hashing, stacks, queues, lists, trees and graphs
- 1Data Structure Lab — sorts, hashing, stacks, queues, lists, trees and graphsUnit LAB · List of Experiments
Semester 4
3 courses7 lab lessonsJavaC- BCS403Java
Object Oriented Programming with Java
5
lessons
- Payroll and shapes — classes, inheritance, interfaces and abstract classes in Java
- Exceptions, streams and threads — a robust Java toolkit
- 1Payroll and shapes — classes, inheritance, interfaces and abstract classes in JavaUnit I · Introduction
- 2Exceptions, streams and threads — a robust Java toolkitUnit II · Exception Handling
- 3Modern Java — lambdas, streams, records, sealed types and switch expressionsUnit III · Java New Features
- 4Choosing the right collection — lists, queues, sets, maps and ordering in JavaUnit IV · Java Collections Framework
- 5Build a mini Spring: IoC container, bean scopes, lifecycle, AOP proxy and a REST routerUnit V · Spring Framework
- BCS451C
Operating System Lab
1
lesson
- OS lab in C: schedulers, memory fits, compaction, Banker's algorithm, wait-for graphs and semaphores
- 1OS lab in C: schedulers, memory fits, compaction, Banker's algorithm, wait-for graphs and semaphoresUnit LAB · List of Experiments
- BCS452Java
Object Oriented Programming with Java
1
lesson
- Java OOP lab: a bank account system with shapes, exceptions, threads and stream I/O
- 1Java OOP lab: a bank account system with shapes, exceptions, threads and stream I/OUnit LAB · List of Experiments
Semester 5
2 courses2 lab lessonsSQLC- BCS551SQL
Database Management Systems Lab
1
lesson
- DBMS lab in SQLite: queries, DML, constraints, normalisation, triggers and three information systems
- 1DBMS lab in SQLite: queries, DML, constraints, normalisation, triggers and three information systemsUnit LAB · List of Experiments
- BCS553C
Design and Analysis of Algorithm Lab
1
lesson
- The DAA lab list, written end to end: search, sort, greedy, DP, graphs and backtracking
- 1The DAA lab list, written end to end: search, sort, greedy, DP, graphs and backtrackingUnit LAB · List of Experiments
Semester 6
2 courses2 lab lessonsC- BCS652C
Compiler Design Lab
1
lesson
- A compiler front to back — lexer, NFA to minimal DFA, parser and three-address code
- 1A compiler front to back — lexer, NFA to minimal DFA, parser and three-address codeUnit LAB · List of Experiments
- BCS653C
Computer Networks Lab
1
lesson
- Network protocols, simulated — subnetting, framing, CRC, Go-Back-N and routing
- 1Network protocols, simulated — subnetting, framing, CRC, Go-Back-N and routingUnit LAB · List of Experiments
Semester 7
1 course1 lab lessonPython- BCS751Python
Artificial Intelligence Lab
1
lesson
- AI lab in plain Python — search, inference and game trees
- 1AI lab in plain Python — search, inference and game treesUnit LAB · List of Experiments
The full 45-course syllabus is transcribed in the app, including the theory courses. Lessons are authored against the course codes that have practical work, and the list grows with each release.
GroutCode is not affiliated with or endorsed by Dr. A.P.J. Abdul Kalam Technical University, Lucknow. Course codes and titles are transcribed from the institution’s published scheme documents.
How a practical runs
The same five steps for every lesson, in every language.
- 1
Pick your syllabus
Choose your university or board and the semester or class you are in. The course list is the transcribed official scheme, not an approximation.
- 2
Open a lab lesson
Each lesson is a stepped practical for a specific course, with a starter file you edit and a test file you do not.
- 3
Write the code yourself
The starter has the signatures and the TODOs. You implement them in the editor, in the language your course actually uses.
- 4
Run the checks
The toolchain compiles and runs the tests — 8 to 15 of them across the lesson, one per step, so you find out which change broke what.
- 5
Get the review
Once the tests pass, the model reads your implementation and tells you the input that breaks it. It never reports the pass or fail itself.
Why the compiler grades, not the model
The obvious way to build an AI lab tool is to let the model read the student’s code and say whether it is correct. It is also the way that produces a tool nobody can trust. A model will tell you your code works when the compiler says otherwise, and it will fail you for a style it happens to dislike.
So the two jobs are split:
- The model designs the lesson, writes the starter and the tests, and — after the tests pass — reads what you actually wrote and tells you the input that breaks it.
- The toolchain decides whether it compiles and whether each step passes. That verdict is not negotiable and the model never issues it.
And why steps instead of one big task
A 40-to-60 minute practical with a single Run at the end gives a beginner one bit of feedback an hour, and it arrives after every decision has already been made. Each lesson here is 8 to 15 steps, each with its own instruction and its own check, so you find out which change broke what while you still remember making it.
Frequently asked questions
Does GroutCode cover the AKTU 2026-27 session?
Yes. GroutCode ships the transcribed AKTU 2026-27 session for B.Tech. Computer Science and Engineering — 45 courses — with 28 authored lab lessons mapped to specific course codes. The syllabus was transcribed from the official documents, and the source and checksum of each one is recorded in the app.
Which languages do the AKTU practicals use?
C (17 lessons), Java (6 lessons), Python (4 lessons), SQL (1 lessons). The language is set per course code rather than guessed from the title, because the same subject is taught in different languages at different institutions.
Does the AI just write the practical for me?
No. The starter file has the signatures and the TODOs; you implement them. The toolchain — not the model — decides whether your code compiles and whether each step passes, so the AI cannot tell you your code works when the compiler disagrees. What it does afterwards is read your implementation and point out the input that breaks it.
Do the practicals work offline?
The lessons, the syllabus and the test runner are bundled in the app and run locally, so the compile-and-check loop works with no connection. The review step at the end uses a model, which can be a local one or a cloud one with your own key.
What do I need installed?
GroutCode detects which toolchains are present on your machine and tells you what is missing and what would fix it. You need the compiler or interpreter for the language your course uses — a C compiler, a JDK, Python, Node or SQLite.
Other syllabuses
KTU
APJ Abdul Kalam Technological University
The 2024 scheme for Kerala’s technological university, covering CSE, IT, AI & DS and ECE from semester three onwards.
85
lab lessons
VTU
Visvesvaraya Technological University
Karnataka’s 2022 scheme across CSE, ISE, AI-ML, AI-DS and ECE, including the dedicated lab courses.
123
lab lessons
Anna University
Anna University, Chennai
Anna University’s Regulations 2021 B.E. CSE, from Python and C programming to the data structures and OOP laboratories.
31
lab lessons
Do your AKTU lab work with the checks built in
GroutCode is included in every Grout Suite license. Free download for Windows and macOS.
Download GroutCode