Structured subject laboratories, practical experiments, and sandboxed programming assessments for JNTU-GV students and faculty.
Laboratory practice covering foundational linear and non-linear data structures, searching, sorting, and algorithmic complexity in C, C++, and Java.
| Exp No | Experiment Title & Objective | Syllabus Unit | Rubric Marks Breakdown | Status & Score | Action |
|---|---|---|---|---|---|
| Exp 1 |
Exp 01: Array Operations & Missing Number Analysis
To implement array scanning and mathematical aggregation to discover a single missing integer from an unsorted sequence in O(N) time and O(1) space.
|
UNIT-I |
Auto Code: 10m
Viva Voce: 5m | Record:
5m
|
Not Attempted | Start Lab |
| Exp 2 |
Exp 02: Valid Balanced Parentheses & Stack Applications
To design and implement a stack-based validator to evaluate balanced nested delimiters and syntax tokens.
|
UNIT-II |
Auto Code: 10m
Viva Voce: 5m | Record:
5m
|
Not Attempted | Start Lab |
| Exp 3 |
Exp 03: Binary Search & Target Frequency Analysis
To apply logarithmic binary search techniques to identify target boundaries and calculate occurrences in sorted data structures.
|
UNIT-III |
Auto Code: 10m
Viva Voce: 5m | Record:
5m
|
Not Attempted | Start Lab |
Practical experiments covering Hadoop MapReduce fundamentals, text sentiment analysis, opinion mining, and distributed data processing.
| Exp No | Experiment Title & Objective | Syllabus Unit | Rubric Marks Breakdown | Status & Score | Action |
|---|---|---|---|---|---|
| Exp 1 |
Exp 01: MapReduce Inverted Index & Token Frequency
To implement the core Map and Reduce aggregation logic for tokenization and word counting across large text datasets.
|
UNIT-II |
Auto Code: 10m
Viva Voce: 5m | Record:
5m
|
Not Attempted | Start Lab |
| Exp 2 |
Exp 02: Social Media Sentiment & Opinion Mining
To perform sentiment lexicon classification on social media feedback and compute polarity scores.
|
UNIT-V |
Auto Code: 10m
Viva Voce: 5m | Record:
5m
|
Not Attempted | Start Lab |
Client-side and full-stack web development laboratory covering semantic HTML5, modern CSS3 Flexbox/Grid layouts, DOM manipulation, asynchronous JavaScript, and interactive web application state.
| Exp No | Experiment Title & Objective | Syllabus Unit | Rubric Marks Breakdown | Status & Score | Action |
|---|---|---|---|---|---|
| Exp 1 |
Exp 01: Responsive Registration Form with Client-Side Regex Validation
Design accessible responsive form layout using HTML5/CSS and execute robust client-side validation logic.
|
UNIT-I |
Auto Code: 15m
Viva Voce: 5m | Record:
5m
|
Not Attempted | Start Lab |
Relational database design and SQL laboratory covering DDL/DML integrity constraints, complex multi-table relational JOINs, aggregations with GROUP BY and HAVING, and nested correlated subqueries.
| Exp No | Experiment Title & Objective | Syllabus Unit | Rubric Marks Breakdown | Status & Score | Action |
|---|---|---|---|---|---|
| Exp 1 |
Exp 01: Department & Employee Relational Analytics (Multi-Table JOINs)
Perform multi-table relational joins, data aggregation, and conditional ordering across relational tables.
|
UNIT-II |
Auto Code: 10m
Viva Voce: 5m | Record:
5m
|
Not Attempted | Start Lab |
| Exp 2 |
Exp 02: High-Earner Department Analytics (Correlated Subqueries)
Construct correlated subqueries to analyze variance against dynamically computed departmental aggregate statistics.
|
UNIT-III |
Auto Code: 15m
Viva Voce: 5m | Record:
5m
|
Not Attempted | Start Lab |
| # | Problem Title & Module | Difficulty | Supported Languages | Limits | Marks | Action |
|---|---|---|---|---|---|---|
| 1 |
Find Missing Number in Sequence
Data Structures & Algorithms Laboratory
Given an array containing N distinct numbers taken from the sequence 1 to N+1, exactly one integer is missing. Your task is to identify and print the single missing integer.
Example:
If N = 5 and the sequence is [1, 2, 4, 5, 6], the missing number is 3.
|
EASY | C C++ Java Python | 2000 ms 256 MB | 10 pts | Solve |
| 2 |
Valid Balanced Parentheses Check
Data Structures & Algorithms Laboratory
Given a string containing only brackets: '(', ')', '{', '}', '[', and ']', determine if the input string is valid.
An input string is valid if:
1. Open brackets are closed by the same type of brackets.
2. Open brackets are closed in the correct order.
3. Every close bracket has a corresponding open bracket of the same type.
|
MEDIUM | C C++ Java Python | 2000 ms 256 MB | 15 pts | Solve |
| 3 |
Binary Search with Target Count
Data Structures & Algorithms Laboratory
Given a sorted array of N integers in non-decreasing order, count the total occurrences of a target integer K using an efficient O(log N) algorithm.
Print the total frequency of K in the array, or 0 if K is not present.
|
MEDIUM | C C++ Java Python | 2000 ms 256 MB | 15 pts | Solve |
| 4 |
MapReduce Word Frequency Tokenizer
Big Data Analytics & Text Mining Laboratory
Implement the Mapper and Reducer aggregation logic for a simulated Hadoop MapReduce task. Given a stream of input lines, your program should normalize all words to lowercase, remove punctuation, and print each distinct word followed by its overall occurrence count in alphabetical order.
This experiment simulates Phase 1 of Hadoop MapReduce: Mapping tokens into key-value pairs (word, 1) and Shuffling/Reducing them into aggregate counts (word, total).
|
EASY | C C++ Java Python | 2000 ms 256 MB | 10 pts | Solve |
| 5 |
Social Media Sentiment Lexicon Classifier
Big Data Analytics & Text Mining Laboratory
In social media analytics (JNTU-GV MCA UNIT-V), sentiment analysis classifies customer feedback into POSITIVE, NEGATIVE, or NEUTRAL opinions based on opinion mining lexicon weights.
You are given:
1. A list of known positive sentiment terms.
2. A list of known negative sentiment terms.
3. A student or customer social media post.
Calculate the net sentiment score: (Count of Positive Words - Count of Negative Words).
- If Net Score > 0 -> Print "POSITIVE"
- If Net Score < 0 -> Print "NEGATIVE"
- If Net Score == 0 -> Print "NEUTRAL"
|
EASY | C C++ Java Python | 2000 ms 256 MB | 10 pts | Solve |
| 6 |
Responsive Student Registration & Validation Portal
Web Technologies Laboratory
Design a responsive, accessible student registration portal adhering to modern HTML5, CSS Flexbox/Grid, and client-side JavaScript validation standards.
Key Requirements:
1. Form structure containing: Full Name (`#fullname`), Roll Number (`#rollno`), Email Address (`#email`), Password (`#password`), and Semester dropdown (`#semester`).
2. Real-time JavaScript validation:
- Email validation verifying presence of @ and valid domain format.
- Password minimum length (>= 8 characters with at least one uppercase letter and one digit).
- Error message feedback elements (`#emailError`, `#passwordError`).
3. Modern CSS styling with card elevation, fluid responsive inputs, and interactive button hover effects.
|
MEDIUM | HTML5 CSS3 JS | 2000 ms 256 MB | 15 pts | Solve |
| 7 |
Department & Employee Relational Analytics (Multi-Table JOINs)
Database Management Systems Laboratory
Write an SQL query using an `INNER JOIN` (or `LEFT JOIN`) between `departments` and `employees` to retrieve each department's name, total employee count, and the maximum salary earned in that department.
Query Requirements:
1. Select columns: `dept_name`, `total_employees`, `max_salary`.
2. Group records by department name.
3. Filter for departments that have at least 1 employee.
4. Order results by `max_salary` descending.
|
EASY | SQL | 2000 ms 256 MB | 10 pts | Solve |
| 8 |
High-Earner Department Analytics (Correlated Subqueries)
Database Management Systems Laboratory
Write an SQL query using a correlated subquery to identify all employees whose salary strictly exceeds the average salary of their respective department.
Query Requirements:
1. Select columns: `emp_id`, `name`, `salary`, `dept_id`.
2. Filter condition: `salary > (SELECT AVG(salary) FROM employees WHERE dept_id = outer.dept_id)`.
3. Order results by `emp_id` ascending.
|
MEDIUM | SQL | 2000 ms 256 MB | 15 pts | Solve |