India · R22
Jawaharlal Nehru Technological University Hyderabad
31 lab practicals for the JNTUH syllabus.
JNTU Hyderabad’s R22 B.Tech CSE, from Programming for Problem Solving to the data structures and Java labs, I-I to IV-I. 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: R22 (AY 2022-23 batch onwards). Open a course to see its practical units and the lab lesson GroutCode ships for each.
I-I
2 courses6 lab lessonsC- CS103ESC
Programming for Problem Solving
5
lessons
- First C programs — primes, roots, bits, branches and loops
- Strings, matrices, structures and lists — C's data building blocks
- 1First C programs — primes, roots, bits, branches and loopsUnit I · Introduction to Programming
- 2Strings, matrices, structures and lists — C's data building blocksUnit II · Arrays, Strings, Structures and Pointers
- 3Macros and files — preprocessor directives, text files and binary recordsUnit III · Preprocessor and File handling in C
- 4Functions, recursion and the heap — from factorial to a dynamic matrixUnit IV · Function and Dynamic Memory Allocation
- 5Searching and sorting — linear and binary search, bubble, selection and insertion sortUnit V · Searching and Sorting
- CS108ESC
Programming for Problem Solving Laboratory
1
lesson
- The PPS lab in C: numbers, recursion, Roman numerals, strings and searching
- 1The PPS lab in C: numbers, recursion, Roman numerals, strings and searchingUnit LAB · List of Experiments
I-II
1 course1 lab lessonPython- CS206ESPython
Python Programming Laboratory
1
lesson
- The JNTUH Python lab: strings, lists, dictionaries, regex and logic gates
- 1The JNTUH Python lab: strings, lists, dictionaries, regex and logic gatesUnit LAB · List of Experiments
II-I
4 courses12 lab lessonsCJava- CS302PCC
Data Structures
5
lessons
- Linked lists, stacks and queues in C, array and linked representations
- Dictionaries in C: sorted lists, hash tables, skip lists and extendible hashing
- 1Linked lists, stacks and queues in C, array and linked representationsUnit I · Introduction to Data Structures
- 2Dictionaries in C: sorted lists, hash tables, skip lists and extendible hashingUnit II · Dictionaries
- 3Search trees in C: BST operations, AVL rotations, red-black rules and splayingUnit III · Search Trees
- 4Graphs on an adjacency matrix, then the sorts behind external sortingUnit IV · Graphs
- 5Brute force, Boyer-Moore, KMP, and standard, compressed and suffix triesUnit V · Pattern Matching and Tries
- CS305PCJava
Object Oriented Programming through Java
5
lessons
- Java basics to classes: arrays, casting, constructors, overloading, recursion, strings, inner classes
- A shape hierarchy: inheritance, polymorphism, interfaces and java.io
- 1Java basics to classes: arrays, casting, constructors, overloading, recursion, strings, inner classesUnit I · Object Oriented Thinking and Java Basics
- 2A shape hierarchy: inheritance, polymorphism, interfaces and java.ioUnit II · Inheritance
- 3Exceptions, java.util, enums, generics and synchronized threadsUnit III · Exception Handling and Multithreading
- 4The delegation event model and AWT layout managers, without a screenUnit IV · Event Handling
- 5Applet life cycle, applet parameters and Swing's MVC modelsUnit V · Applets and Swing
- CS306PCC
Data Structures Lab
1
lesson
- Data Structures Lab — lists, stacks, queues, sorts, trees, graphs and KMP
- 1Data Structures Lab — lists, stacks, queues, sorts, trees, graphs and KMPUnit LAB · List of Experiments
- CS307PCJava
Object Oriented Programming through Java Lab
1
lesson
- OOP through Java Lab — the experiments' logic, tested without a window
- 1OOP through Java Lab — the experiments' logic, tested without a windowUnit LAB · List of Experiments
II-II
3 courses7 lab lessonsCSQL- CS403PCC
Operating Systems
5
lessons
- A toy kernel — process states, scheduling queues, the process tree and system calls
- CPU schedulers, fork/exec and the banker's algorithm
- 1A toy kernel — process states, scheduling queues, the process tree and system callsUnit I · Operating System - Introduction
- 2CPU schedulers, fork/exec and the banker's algorithmUnit II · CPU Scheduling - Scheduling Criteria
- 3Semaphores, the bounded buffer and Unix IPC from scratchUnit III · Process Management and Synchronization
- 4An MMU, a hole allocator and three page-replacement policiesUnit IV · Memory Management and Virtual Memory
- 5Block allocation, permissions and the Unix file system callsUnit V · File System Interface and Operations
- CS406PCC
Operating Systems Lab
1
lesson
- OS lab: schedulers, system calls, banker's, IPC and paging
- 1OS lab: schedulers, system calls, banker's, IPC and pagingUnit LAB · List of Experiments
- CS407PCSQL
Database Management Systems Lab
1
lesson
- A college database in SQL: DDL, DML, subqueries, views and triggers
- 1A college database in SQL: DDL, DML, subqueries, views and triggersUnit LAB · List of Experiments
III-I
1 course1 lab lessonC- CS504PCC
Computer Networks Lab
1
lesson
- Networks lab in C: framing, CRC, Go-Back-N, routing and congestion control
- 1Networks lab in C: framing, CRC, Go-Back-N, routing and congestion controlUnit LAB · List of Experiments
III-II
2 courses2 lab lessonsPython- CS604PCPython
Machine Learning Lab
1
lesson
- Machine learning from scratch: statistics, regression, trees, KNN, logistic regression and k-means
- 1Machine learning from scratch: statistics, regression, trees, KNN, logistic regression and k-meansUnit LAB · List of Experiments
- CS605PCPython
Artificial Intelligence Lab
1
lesson
- Classic AI search in Python: BFS, DFS, minimax, puzzles and alpha-beta
- 1Classic AI search in Python: BFS, DFS, minimax, puzzles and alpha-betaUnit LAB · List of Experiments
IV-I
2 courses2 lab lessonsJavaC- CS703PCJava
Cryptography and Network Security Lab
1
lesson
- Crypto lab in Java: classical ciphers, DES and AES by hand, RC4, RSA, Diffie-Hellman and digests
- 1Crypto lab in Java: classical ciphers, DES and AES by hand, RC4, RSA, Diffie-Hellman and digestsUnit LAB · List of Experiments
- CS704PCC
Compiler Design Lab
1
lesson
- A compiler front end in C — symbol table, lexer, parsers, FIRST sets and type checker
- 1A compiler front end in C — symbol table, lexer, parsers, FIRST sets and type checkerUnit LAB · List of Experiments
The full 71-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 Jawaharlal Nehru Technological University Hyderabad. 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 JNTUH R22?
Yes. GroutCode ships the transcribed JNTUH R22 for B.Tech. Computer Science and Engineering — 71 courses — with 31 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 JNTUH practicals use?
C (20 lessons), Java (7 lessons), Python (3 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 JNTUH lab work with the checks built in
GroutCode is included in every Grout Suite license. Free download for Windows and macOS.
Download GroutCode