B.Tech., Information Technology was started recently inorder the cater high caliber IT professions. The department has a well qualified dedicated and experienced faculty members in the field of image processing, networking, OOP, Operating systems, computer architecture, artificial intelligence, database system, Voice recognition, multimedia etc.,

List of Experiments

SEMESTER III

142351 DATA STRUCTURES AND ALGORITHMS LAB

1. Implement singly and doubly linked lists.

2. Represent a polynomial as a linked list and write functions for polynomial addition.

3. Implement stack and use it to convert infix to postfix expression

4. Implement array-based circular queue and use it to simulate a producer consumer problem.

5. Implement an expression tree. Produce its pre-order, in-order, and post-order traversals.

6. Implement binary search tree.

7. Implement priority queue using heaps

8. Implement hashing techniques.

9. Implement Dijkstra's algorithm using priority queues

10. Implement a backtracking algorithm for Knapsack problem

141353 OBJECT-ORIENTED PROGRAMMING LAB

1. Design C++ classes with static members, methods with default arguments, friend functions (For example, design matrix and vector classes with static allocation, and a friend function to do matrix-vector multiplication)

2. Implement complex number class with necessary operator overloadings and type conversions such as integer to complex, double to complex, complex to double etc.

3. Implement Matrix class with dynamic memory allocation and necessary methods. Give proper constructor, destructor, copy constructor, and overloading of assignment operator.

4. Overload the new and delete operators to provide custom dynamic allocation of memory.

5. Develop a template of linked-list class and its methods.

6. Develop templates of standard sorting algorithms such as bubble sort, insertion sort, merge sort, and quick sort.

7. Design stack and queue classes with necessary exception handling.

8. Define Point class and an Arc class. Define a Graph class which represents graph as a collection of Point objects and Arc objects. Write a method to find a minimum cost spanning     tree in a graph.

9. Develop with suitable hierarchy, classes for Point, Shape, Rectangle, Square, Circle, Ellipse, Triangle, Polygon, etc. Design a simple test application to demonstrate dynamic     polymorphism and RTTI.]

10. Write a C++ program that randomly generates complex numbers (use previously designed Complex class) and writes them two per line in a file along with an operator (+, -, *, or /). The numbers are written to file in the format (a + ib). Write another program to read one line at a time from this file, perform the corresponding operation on the two complex numbers read, and write the result to another file (one per line).

SEMESTER IV

141452 DBMS LAB

1. Data Definition, Table Creation, Constraints,

2. Insert, Select Commands, Update & Delete Commands.

3. Nested Queries & Join Queries

4. Views

5. High level programming language extensions (Control structures, Procedures and Functions).

6. Front end tools

7. Forms

8. Triggers

9. Menu Design

10. Reports.

11. Database Design and implementation (Mini Project).

SEMESTER IV

141451 OPERATING SYSTEMS LAB

1. Write programs using the following system calls of UNIX operating system fork, exec, getpid, exit, wait, close, stat, opendir,     readdir.

2. Write programs using the I/O system calls of UNIX operating system (open, read, write, etc)

3. Write C programs to simulate UNIX commands like ls, grep, etc.

4. Given the list of processes, their CPU burst times and arrival times, display/print the Gantt hart for FCFS and SJF. For each of the scheduling policies, compute and print the average waiting time and average turnaround time. (2 sessions)

5. Given the list of processes, their CPU burst times and arrival times, display/print the Gantt chart for Priority and Round robin. For each of the scheduling policies, compute and print the average waiting time and average turnaround time. (2 sessions)

6. Developing Application using Inter Process communication (using shared memory, pipes or message queues)

7. Implement the Producer – Consumer problem using semaphores (using UNIX system calls).

8. Implement some memory management schemes – I

9. Implement some memory management schemes – II

10. Implement any file allocation technique (Linked, Indexed or Contiguous)

SEMESTER V

CS2308 SYSTEM SOFTWARE LAB

1. Implement a symbol table with functions to create, insert, modify, search, and display.

2. Implement pass one of a two pass assembler.

3. Implement pass two of a two pass assembler.

4. Implement a single pass assembler.

5. Implement a two pass macro processor

6. Implement a single pass macro processor.

7. Implement an absolute loader.

8. Implement a relocating loader.

9. Implement pass one of a direct-linking loader.

10. Implement pass two of a direct-linking loader.

11. Implement a simple text editor with features like insertion / deletion of a character, word, and sentence.

12. Implement a symbol table with suitable hashing.

IT2305 JAVA PROGRAMMING LAB

1. Develop a Java package with simple Stack and Queue classes. Use JavaDoc comments for documentation.

2. Design a class for Complex numbers in Java. In addition to methods for basic operations on complex numbers, provide a     method to return the number of active objects created.

3. Design a Date class similar to the one provided in the java.util package.

4. Develop with suitable hierarchy, classes for Point, Shape, Rectangle, Square, Circle, Ellipse, Triangle, Polygon, etc. Design a simple test application to demonstrate dynamic polymorphism.

5. Design a Java interface for ADT Stack. Develop two different classes that implement this interface, one using array and the other using linked-list. Provide necessary exception handling in both the implementations.

6. Write a Java program to read a file that contains DNA sequences of arbitrary length one per line (note that each DNA sequence is just a String). Your program should sort the sequences in descending order with respect to the number of 'TATA' subsequences present. Finally write the sequences in sorted order into another file.

7. Develop a simple paint-like program that can draw basic graphical primitives in different dimensions and colors. Use appropriate menu and buttons.

8. Develop a scientific calculator using even-driven programming paradigm of Java.

9. Develop a template for linked-list class along with its methods in Java.

10. Design a thread-safe implementation of Queue class. Write a multi-threaded producer-consumer application that uses this Queue class.

11. Write a multi-threaded Java program to print all numbers below 100,000 that are both prime and fibonacci number (some examples are 2, 3, 5, 13, etc.). Design a thread that generates prime numbers below 100,000 and writes them into a pipe. Design another thread that generates fibonacci numbers and writes them to another pipe. The main thread should read both the pipes to identify numbers common to both.   

12. Develop a multi-threaded GUI application of your choice.

SEMESTER VI

IT2357 WEB TECHNOLOGY LAB

1. Create a web page with the following using HTML

i) To embed an image map in a web page

ii) To fix the hot spots

iii) Show all the related information when the hot spots are clicked.

2. Create a web page with all types of Cascading style sheets.

3. Client Side Scripts for Validating Web Form Controls using DHTML

4. Write programs in Java to create applets incorporating the following features:

1. Create a color palette with matrix of buttons

2. Set background and foreground of the control text area by selecting a color from color palette.

3. In order to select Foreground or background use check box control as radio buttons

4. To set background images

5. Write programs in Java using Servlets:

1. To invoke servlets from HTML forms

2. To invoke servlets from Applets

6. Write programs in Java to create three-tier applications using JSP and Databases

1. For conducting on-line examination.

2. For displaying student mark list. Assume that student information is available in database which has been stored in a database server.

7. Programs using XML – Schema – XSLT/XSL

8. Program using DOM / SAX

9. Programs using AJAX

10. Consider a case where we have two web Services- an airline service and a travel agent and the travel agent is searching for an airline. Implement this scenario using Web Services and Data base.