### KALPATARU INSTITUTE OF TECHNOLOGY

(Affiliated to Visvesvaraya Technological University, Belagavi & Approved by AICTE, New Delhi)  ## Laboratory Programs for All Students

### First and Second Semester

#### Chemistry Laboratory

5. Determination of Viscosity co-efficient of the given liquid using Ostwald's viscometer. Download.
7. Estimation of Iron in haematite ore solution using standard K2Cr2O7 solution by External Indicator method. Download.

#### Computer Programming Laboratory

1. Develop a program to solve simple computational problems using arithmetic expressions and use of each operator leading to simulation of a Commercial calculator. (No built-in math function) Download
2. Develop a program to compute the roots of a quadratic equation by accepting the coefficients. Print appropriate messages. Download.
3. Develop a program to find the reverse of a positive integer and check for palindrome or not. Display appropriate messages. Download.
4. An electricity board charges the following rates for the use of electricity: for the first 200 units 80 paise per unit: for the next 100 units 90 paise per unit: beyond 300 units Rs 1 per unit. All users are charged a minimum of Rs. 100 as meter charge. If the total amount is more than Rs. 400, then an additional surcharge of 15% of total amount is charged. Write a program to read the name of the user, number of units consumed and print out the charges Download.
6. Implement using functions to check whether the given number is prime and display appropriate messages. (No built-in math function) Download.
7. Develop a program to introduce 2D Array manipulation and implement Matrix multiplication and ensure the rules of multiplication are checked. Download.
8. Develop a Program to compute Sin(x) using Taylor series approximation. Compare your result with the built-in Library function. Print both the results with appropriate messages. Download.
9. Write functions to implement string operations such as compare, concatenate, string length. Convince the parameter passing techniques. Download.
10. Develop a program to sort the given set of N numbers using Bubble sort. Download.
11. Develop a program to find the square root of a given number N and execute foe all possible inputs with appropriate messages. Note: Don’t use library function sqrt(n). Download.
12. Implement structures to read, write and compute average marks and the students scoring above and below the average marks for a class of N students. Download.
13. Develop a program using pointers to compute the sum, mean and standard deviation of all elements stored in an array of n real numbers Download.

### Sixth Semester

#### Computer Networks Laboratory-17ECL68

3. Implement a point to point network with four nodes and duplex links between them. Analyze the network performance by setting the queue size and varying the bandwidth. Download
4. Implement a four node point to point network with links n0-n2, n1-n2 and n2-n3. Apply TCP agent between n0-n3 and UDP between n1-n3. Apply relevant applications over TCP and UDP agents changing the parameter and determine the number of packets sent by TCP/UDP. Download
5. Implement Ethernet LAN using n (6-10) nodes. Compare the throughput by changing the error rate and data rate. Download
6. Implement Ethernet LAN using n nodes and assign multiple traffic to the nodes and obtain congestion window for different sources/ destinations. Download

#### EMBEDDED CONTROLLER LAB

2. Interface a Stepper motor and rotate it in clockwise and anti-clockwise direction Download

### Fourth Semester

#### Design and Analysis of Algorithms Laboratory

3. Program 1 ,2 and 3: Quick sort and Merge Sort Download
3. Program 4 and 5: Student details, Stack, Customer implementation etc. Download

### Fourth Semester

#### DESIGN AND ANALYSIS OF ALGORITHM LABORATORY - 18CSL47

1. a) Create a Java class called Student with the following details as variables within it. (i) USN (ii) Name (iii) Branch (iv) Phone Write a Java program to create n Student objects and print the USN, Name, Branch, and Phone of these objects with suitable headings.
1b.Write a Java program to implement the Stack using arrays. Write Push(), Pop(), and Display() methods to demonstrate its working.
2. a) Design a superclass called Staff with details as StaffId, Name, Phone, Salary. Extend this class by writing three subclasses namely Teaching (domain, publications), Technical (skills), and Contract (period). Write a Java program to read and display at least 3 staff objects of all three categories.
2. b) Write a Java class called Customer to store their name and date_of_birth. The date_of_birth format should be dd/mm/yyyy. Write methods to read customer data as <name, dd/mm/yyyy> and display as <name, dd, mm, yyyy> using StringTokenizer class considering the delimiter character as “/”.
3. a) Write a Java program to read two integers a and b. Compute a/b and print, when b is not zero. Raise an exception when b is equal to zero.
3. b) Write a Java program that implements a multi-thread application that has three threads. First thread generates a random integer for every 1 second; second thread computes the square of the number and prints; third thread will print the value of cube of the number.
4. Sort a given set of n integer elements using Quick Sort method and compute its time complexity. Run the program for varied values of n> 5000 and record the time taken to sort. Plot a graph of the time taken versus n on graph sheet. The elements can be read from a file or can be generated using the random number generator. Demonstrate using Java how the divide-and-conquer method works along with its time complexity analysis: worst case, average case and best case. Download
5. Sort a given set of n integer elements using Merge Sort method and compute its time complexity. Run the program for varied values of n> 5000, and record the time taken to sort. Plot a graph of the time taken versus n on graph sheet. The elements can be read from a file or can be generated using the random number generator. Demonstrate using Java how the divide-and-conquer method works along with its time complexity analysis: worst case, average case and best case. Download
6. Implement in Java, the 0/1 Knapsack problem using (a) Dynamic Programming method (b) Greedy method. Download
7. From a given vertex in a weighted connected graph, find shortest paths to other vertices using Dijkstra's algorithm. Write the program in Java. Download
8. Find Minimum Cost Spanning Tree of a given connected undirected graph using Kruskal'salgorithm. Use Union-Find algorithms in your program. Download
9. Find Minimum Cost Spanning Tree of a given connected undirected graph using Prim's algorithm. Download

#### Microprocessor Lab -18CSL48

3. Interface a Stepper motor and rotate it in clockwise and anti-clockwise direction. Download
4. Demonstrate the use of an external interrupt to toggle an LED On/Off. Download
5. Interface a 4x4 keyboard and display the key code on an LCD. Download
6. Display the Hex digits 0 to F on a 7-segment LED interface, with an appropriate delay in between Download
7. Write a program to multiply two 16 bit binary numbers. Download
8. Write a program to find the sum of first 10 integer numbers. Download
10. Write a program to add an array of 16 bit numbers and store the 32 bit result in internal RAM Download
11. Write a program to find the square of a number (1 to 10) using look-up table. Download
12. Write a program to find the largest/smallest number in an array of 32 numbers . Download
13. Write a program to arrange a series of 32 bit numbers in ascending/descending order. Download
14. Write a program to count the number of ones and zeros in two consecutive memory locations. Download

### Sixth Semester

#### Software Testing Lab - 17ISL67

1. Design and develop a program in a language of your choice to solve the triangle problem defined as follows: Accept three integers which are supposed to be the three sides of a triangle and determine if the three values represent an equilateral triangle, isosceles triangle, scalene triangle, or they do not form a triangle at all. Assume that the upper limit for the size of any side is 10. Derive test cases for your program based on boundary-value analysis, execute the test cases and discuss the results. Download
2. Design, develop, code and run the program in any suitable language to solve the commission problem. Analyze it from the perspective of boundary value testing, derive different test cases, execute these test cases and discuss the test results. Download
3. Design, develop, code and run the program in any suitable language to implement the NextDate function. Analyze it from the perspective of boundary value testing, derive different test cases, execute these test cases and discuss the test results. Download

#### File Structure Lab - 17ISL68

1. Write a program to read series of names, one per line, from standard input and write these names spelled in reverse order to the standard output using I/O redirection and pipes. Repeat the exercise using an input file specified by the user instead of the standard input and using an output file specified by the user instead of the standard output. Download
2. Write a program to read and write student objects with fixed-length records and the fields delimited by “|”. Implement pack ( ), unpack ( ), modify ( ) and search ( ) methods. Download
3. Write a program to read and write student objects with Variable - Length records using any suitable record structure. Implement pack ( ), unpack ( ), modify ( ) and search ( ) methods. Download

### Fourth Semester

#### Engineering Geology Laboratory- 18CVL48

1. Identification of rocks as mentioned in theory, their engineering properties and uses in construction and decorative purposes. Download
2. Bore hole problems: Determination of subsurface behavior of rocks, their attitude related to foundation, tunnels, reservoirs and mining. Triangular and Square Download