Microprocessor Lab

Microprocessor Lab

ASSEMBLY LANGUAGE PROGRAMMING 1. Write a program for 32-bit binary division and multiplication 2. Write a program for 32-bit BCD addition and subtraction 3. Write a program for Linear search and binary search. 4. Write a program to add and subtract two arrays 5. Write a program for binary to ascii conversion 6. Write a program for ascii to binary conversion

Computer Graphics Lab

1. Write a program to implement Bresenham‘s line drawing algorithm. 2. Write a program to implement mid-point circle drawing algorithm. 3. Write a program to clip a line using Cohen and Sutherland line clipping algorithm. 4. Write a program to clip a polygon using Sutherland Hodgeman algorithm. 5. Write a program to apply various 2D transformations on a 2D object (use homogenous coordinates). 6. Write a program to apply various 3D transformations on a 3D object and then apply parallel and perspective projection on it. 7. Write a program to draw Hermite/Bezier curve.

Artificial Intelligence Lab

1	Write a prolog program to calculate the sum of two numbers.	LINK
2	Write a prolog program to find the maximum of two numbers.	LINK
3	Write a prolog program to calculate the factorial of a given number.	LINK
4	Write a prolog program to calculate the nth Fibonacci number.	LINK
5	Write a prolog program, insert_nth(item, n, into_list, result) that asserts that result is the list into_list with item inserted as the n‘th element into every list at all levels.	LINK
6	Write a Prolog program to remove the Nth item from a list.	LINK
7	Write a Prolog program, remove-nth(Before, After) that asserts the After list is the Before list with the removal of every n‘th item from every list at all levels.	LINK
8	Write a Prolog program to implement append for two lists.	LINK
9	Write a Prolog program to implement palindrome (List).	LINK
10	Write a Prolog program to implement max(X,Y,Max) so that Max is the greater of two numbers X and Y.	LINK
11	Write a Prolog program to implement maxlist(List,Max) so that Max is the greatest number in the list of numbers List.	LINK
12	Write a Prolog program to implement sumlist(List,Sum) so that Sum is the sum of a given list of numbers List.	LINK
13	Write a Prolog program to implement two predicates evenlength(List) and oddlength(List) so that they are true if their argument is a list of even or odd length respectively.	LINK
14	Write a Prolog program to implement reverse(List,ReversedList) that reverses lists.	LINK
15	Write a Prolog program to implement maxlist(List,Max) so that Max is the greatest number in the list of numbers List using cut predicate.	LINK
16	Write a Prolog program to implement GCD of two numbers.	LINK
17	Write a prolog program that implements Semantic Networks/Frame Structures.

Internet Technologies

Internet Technologies

Create event driven program for following: 1. Print a table of numbers from 5 to 15 and their squares and cubes using alert. 2. Print the largest of three numbers. 3. Find the factorial of a number n. 4. Enter a list of positive numbers terminated by Zero. Find the sum and average of these numbers. 5. A person deposits Rs 1000 in a fixed account yielding 5% interest. Compute the amount in the account at the end of each year for n years. 6. Read n numbers. Count the number of negative numbers, positive numbers and zeros in the list.

Database Management SystemsLab

Database Management SystemsLab

Query List 1. Query to display Employee Name, Job, Hire Date, Employee Number; for each employee with the Employee Number appearing first. 2. Query to display unique Jobs from the Employee Table.
3. Query to display the Employee Name concatenated by a Job separated by a comma. 4. Query to display all the data from the Employee Table. Separate each Column by a comma and name the said column as THE_OUTPUT. 5. Query to display the Employee Name and Salary of all the employees earning more than $2850. 6. Query to display Employee Name and Department Number for the Employee No= 7900. 7. Query to display Employee Name and Salary for all employees whose salary is not in the range of $1500 and $2850. 8. Query to display Employee Name and Department No. of all the employees in Dept 10 and Dept 30 in the alphabetical order by name. 9. Query to display Name and Hire Date of every Employee who was hired in 1981. 10. Query to display Name and Job of all employees who don‘t have a current Manager. 11. Query to display the Name, Salary and Commission for all the employees who earn commission. 12. Sort the data in descending order of Salary and Commission. 13. Query to display Name of all the employees where the third letter of their name is ‗A‘. 14. Query to display Name of all employees either have two ‗R‘s or have two ‗A‘s in their name and are either in Dept No = 30 or their Manger‘s Employee No = 7788. 15. Query to display Name, Salary and Commission for all employees whose Commission Amount is 14 greater than their Salary increased by 5%. 16. Query to display the Current Date. 17. Query to display Name, Hire Date and Salary Review Date which is the 1st Monday after six months of employment. 18. Query to display Name and calculate the number of months between today and the date each employee was hired. 19. Query to display the following for each employee <E-Name> earns < Salary> monthly but wants < 3 * Current Salary >. Label the Column as Dream Salary. 20. Query to display Name with the 1st letter capitalized and all other letter lower case and length of their name of all the employees whose name starts with ‗J‘, ‘A‘ and ‗M‘. 21. Query to display Name, Hire Date and Day of the week on which the employee started. 22. Query to display Name, Department Name and Department No for all the employees. 23. Query to display Unique Listing of all Jobs that are in Department # 30. 24. Query to display Name, Dept Name of all employees who have an ‗A‘ in their name. 25. Query to display Name, Job, Department No. And Department Name for all the employees working at the Dallas location. 26. Query to display Name and Employee no. Along with their Manger‘s Name and the Manager‘s employee no; along with the Employees‘ Name who do not have a Manager. 27. Query to display Name, Dept No. And Salary of any employee whose department No. and salary matches both the department no. And the salary of any employee who earns a commission. 28. Query to display Name and Salaries represented by asterisks, where each asterisk (*) signifies $100. 29. Query to display the Highest, Lowest, Sum and Average Salaries of all the employees 30. Query to display the number of employees performing the same Job type functions. 31. Query to display the no. of managers without listing their names. 32. Query to display the Department Name, Location Name, No. of Employees and the average salary for all employees in that department. 33. Query to display Name and Hire Date for all employees in the same dept. as Blake. 34. Query to display the Employee No. And Name for all employees who earn more than the average salary. 35. Query to display Employee Number and Name for all employees who work in a department with any employee whose name contains a ‗T‘. 36. Query to display the names and salaries of all employees who report to King.
37. Query to display the department no, name and job for all employees in the Sales department.

Software Engineering Lab

Sample Projects: 1. Criminal Record Management: Implement a criminal record management system forjailers, police officers and CBI officers 2. DTC Route Information: Online information about the bus routes and their frequency andfares 3. Car Pooling: To maintain a web based intranet application that enables the corporateemployees within an organization to avail the facility of carpooling effectively. 4. Patient Appointment and Prescription Management System 5. Organized Retail Shopping Management Software 6. Online Hotel Reservation Service System 7. Examination and Result computation system 8. Automatic Internal Assessment System 9. Parking Allocation System 10. Wholesale Management System

Design and Analysis of Algorithms Lab

CMSACOR08P::

1.

 i. Implement Insertion Sort : 

    a )THEORY -   VIDEO LINK    b ) C CODE -- CLICK

 (The program should report the number of comparisons) 

 ii.Implement Merge Sort:

       a) THEORY -  VIDEO LINK       b) C++ CODE - CLICK NONRECURSIVE

                                                                                        RECURSIVE MERGE SORT

(The program should report the number of comparisons) 

                                         

2. Implement Heap Sort :

    a) THEORY - VIDEO LINK      b) C++ CODE - CLICK

(The program should report the number of comparisons) 

3. Implement Randomized Quick sort :

   a) THEORY - VIDEO LINK        b) C++ CODE - CLICK

(The program should report the number of comparisons) 

4. Implement Radix Sort:  

   a) THEORY - VIDEO LINK        b)  C++ CODE -CLICK

5. Create a Red-Black Tree and perform following operations on it:

 i. Insert a node  ii. Delete a node  iii. Search for a number & also report the color of the node containing this number. 

a) THEORY - INSERTION VIDEO LINK b) C++ CODE - CLICK FOR HELP(www.sanfoundry.com)

6. Write a program to determine the LCS of two given sequences :

a) THEORY -         b)  C++ CODE - CLICK

7. Implement Breadth-First Search in a graph : 

a) THEORY -  VIDEO LINK     b)  C CODE - CLICK

8. Implement Depth-First Search in a graph :

a) THEORY - VIDEO LINK      b)  C++ CODE - CLICK

9. Write a program to determine the minimum spanning tree of a graph : 

a) THEORY -  i) PRIMS VIDEO LINK  ii) KRUSKAL VIDEO LINK    

b)  C++ CODE   prims in c++ click  kruskal in c

For the algorithms at S.No 1 to 3 test run the algorithm on 100 different inputs of sizes varying from 30 to 1000. Count the number of comparisons and draw the graph. Compare it with a graph of nlogn.

Computer Networks Lab

1. Simulate Cyclic Redundancy Check (CRC) error detection algorithm for noisy channel. 2. Simulate and implement stop and wait protocol for noisy channel. 3. Simulate and implement go back n sliding window protocol. 4. Simulate and implement selective repeat sliding window protocol. 5. Simulate and implement distance vector routing algorithm 6. Simulate and implement Dijkstra algorithm for shortest path routing.

Operating Systems Lab

CMSACOR06P: Operating Systems Lab Practical: 60 Lectures
C/ C++ programs 1. WRITE A PROGRAM (using fork() and/or exec() commands) where parent and child execute: a. same program, same code. b. same program, different code. c. before terminating, the parent waits for the child to finish its task. 2. WRITE A PROGRAM to report behaviour of Linux kernel including kernel version, CPU type and model. (CPU information) 3. WRITE A PROGRAM to report behaviour of Linux kernel including information on configured memory, amount of free and used memory. (memory information) 4. WRITE A PROGRAM to print file details including owner access permissions, file access time, where file name is given as argument. 5. WRITE A PROGRAM to copy files using system calls. 6. Write program to implement FCFS scheduling algorithm. 7. Write program to implement Round Robin scheduling algorithm. 8. Write program to implement SJF scheduling algorithm. 9. Write program to implement non-preemptive priority based scheduling algorithm. 10. Write program to implement preemptive priority based scheduling algorithm. 11. Write program to implement SRJF scheduling algorithm. 12. Write program to calculate sum of n numbers using thread library. 13. Write a program to implement first-fit, best-fit and worst-fit allocation strategies.

CBCS DATA STRUCTURE PRACTICAL ASSIGNMENT

CMSACOR05P: Data Structures Lab Practical: 60 Lectures 

1. Write a program to search an element from a list. Give user the option to perform Linear or Binary search. Use Template functions. 

2. WAP using templates to sort a list of elements. Give user the option to perform sorting using Insertion sort, Bubble sort or Selection sort. 

3. Implement Linked List using templates. Include functions for insertion, deletion and search of a number, reverse the list and concatenate two linked lists (include a function and also overload operator +). CLICK HERE

 4. Implement Doubly Linked List using templates. Include functions for insertion, deletion and search of a number, reverse the list.  CLICK HERE

5. Implement Circular Linked List using templates. Include functions for insertion, deletion and search of a number, reverse the list. CLICK HERE

6. Perform Stack operations using Linked List implementation.  CLICK HERE

7. Perform Stack operations using Array implementation. Use Templates.

8. Perform Queues operations using Circular Array implementation. Use Templates. 

9. Create and perform different operations on Double-ended Queues using Linked List implementation.CLICK HERE

 10. WAP to scan a polynomial using linked list and add two polynomial. CLICK HERE

11. WAP to calculate factorial and to compute the factors of a given no. (i)using recursion, (ii) using iteration CLICK HERE

12. (ii) WAP to display Fibonacci series (i)using recursion, (ii) using iteration  CLICK HERE

 13. WAP to calculate GCD of 2 number (i) with recursion (ii) without recursion  CLICK HERE

 

 14. WAP to create a Binary Search Tree and include following operations in tree:

 i. Insertion (Recursive and Iterative Implementation) 

ii. Deletion by copying

 iii. Deletion by Merging

 iv. Search a no. in BST 

v. Display its preorder, postorder and inorder traversals Recursively

 vi. Display its preorder, postorder and inorder traversals Iteratively 

vii. Display its level-by-level traversals 

viii. Count the non-leaf nodes and leaf nodes

 ix. Display height of tree

 x. Create a mirror image of tree xi. Check whether two BSTs are equal or not 

15. WAP to convert the Sparse Matrix into non-zero form and vice-versa. 

16. WAP to reverse the order of the elements in the stack using additional stack. CLICK

17. WAP to reverse the order of the elements in the stack using additional Queue.  CLICK

18. WAP to implement Diagonal Matrix using one-dimensional array. CLICK

19. WAP to implement Lower Triangular Matrix using one-dimensional array. 

20. WAP to implement Upper Triangular Matrix using one-dimensional array. 

21. WAP to implement Symmetric Matrix using one-dimensional array.

22. WAP to create a Threaded Binary Tree as per inorder traversal, and implement operations like finding the successor / predecessor of an element, insert an element, inorder traversal.

 23. WAP to implement various operations on AVL Tree.