NCS-455

FUNCTIONAL AND LOGICAL PROGRAMMING LAB

Program SML-NJ
1) To Implement Linear Search.
2) To Implement Binary Search.
3) To Implement Bubble sorting.
4) To Implement Selection Sort.
5) To Implement Insertion Sort.
Implement Using LISP
1) Write a function that compute the factorial of a number (factorial of 0 is 1, and factorial of n is
n*(n-1)..1. Factorial is defined only for equal to 0.)
2) Write a function that evaluate a fully parenthesized infix arithmetic expression. For examples,
( infix ( 1 + ( 2 * 3) ) ) should return 7.
3) Write a function that perform a depth first traversal of binary tree. The function should return
a list containing the tree nodes in the order they were visited. 9. Write a LISP program for water
jug problem.
4) Write a LISP program that determines whether an integer is prime.
5) Write a PROLOG program that answers questions about family members and relationships
includes predicates and rules which define sister, brother, father, mother, grandchild, grandfather
and uncle. The program should be able to answer queries such as the following :
father(x,Amit)
grandson(x,y)
uncle(sumit,puneet)
mother ( anita x)
Note: The instructor may add/delete/modify/tune experiments, wherever h/she feels in a justified
manner.

(Marutesh Chandra Sharma)

NCS-451: OPERATING SYSTEM LAB

1. To implement CPU Scheduling Algorithms

FCFS
SJF
SRTF
PRIORITY
ROUND ROBIN
2. Simulate all Page Replacement Algorithms
FIFO
LRU
3. Simulate Paging Technique of Memory Management

Note: The Instructor may add/delete/modify/tune experiments, wherever

he/shefeels in a justified manner.

NIT-451: MULTIMEDIA AND ANIMATION LAB

1) Procedure to create an animation to represent the growing moon.
2) Procedure to create an animation to indicate a ball bouncing on steps.
3) Procedure to simulate movement of a cloud.
4) Procedure to draw the fan blades and to give proper animation.
5) Procedure to display the background given (filename: tulip.jpg) through your
name.
6) Procedure to display the background given (filename: garden.jpg) through your
naming using mask.
7) Procedure to create an animation with the following features.
WELCOME (Letters should appear one by one .The fill color of the text should
change to a different colour after the display of the full word.)
8) Procedure to simulate a ball hitting another ball.
9) Procedure to design a visiting card containing at least one graphic and text
information.
10) Procedure to take a photographic image. Give a title for the image. Put the
border. Write your names. Write the name of institution and place.
11) Procedure to prepare a cover page for the book in your subject area. Plan your
own design.
12) Procedure to extract the flower only from given photographic image and
organize it on a background. Selecting your own background for organization.
13) Procedure to change a circle into a square using flash.
14) Procedure to display the background given (FILENAME: GARDEN.JPG)
through your name using mask.
(Ravi Sharma)

NCS-353: NUMERICAL TECHNIQUES LAB

Write Programs in 'C' Language:

1. To deduce error involved in polynomial equation.
2. To Find out the root of the Algebraic and Transcendental equations using
Bisection,
Regula-falsi , Newton Raphson and Iterative Methods. Also give the rate of
convergence of roots in tabular form for each of these methods.
3. To implement Newton's Forward and Backward Interpolation formula.
4. To implement Gauss Forward and Backward, Bessel's, Sterling's and Evertt's
Interpolation formula
5. To implement Newton's Divided Difference and Langranges Interpolation
formula.
6. To implement Numerical Differentiations.
7. To implement Numerical Integration using Trapezoidal, Simpson 1/3 and
Simpson 3/8 rule. 8. To implement Least Square Method for curve fitting.
9. To draw frequency chart like histogram, frequency curve and pie-chart etc.
10. To estimate regression equation from sampled data and evaluate values of
standard deviation, t-statistics, regression coefficient, value of R2 for atleast two
independent variables.

NCS-453: COMPUTER GRAPHICS LAB

1. To implement DDA algorithms for line and circle.

2. To implement Bresenham's algorithms for line, circle and ellipse drawing
3. To implement Mid Point Circle algorithm using C .
4. To implement Mid Point Ellipse algorithm using C .
5. To perform 2D Transformations such as translation, rotation, scaling, reflection
and sharing.
6.To implement Cohen-Sutherland 2D clipping and window-viewport mapping.
7.To implement Liang Barksy Line Clipping Algorithm.
8.To perform 3D Transformations such as translation, rotation and scaling.
9.To convert between color models.
10.To perform animation using any Animation software
11.To perform basic operations on image using any image editing software
12.To draw different shapes such as hut,face ,kite ,fish etc.

Note: The Instructor may add/delete/modify/tune experiments, wherever

he/shefeels in a justified manner.

(Marutesh Chandra Sharma)

(EIT-851) DISTRIBUTED SYSTEMS LAB

1) Simulate the functioning of Lamport's Logical Clock in 'C'.

2) Simulate the Distributed Mutual Exclusion in 'C'.
3) Implement a Distributed Chat Server using TCP Sockets in 'C'.
4) Implement RPC mechanism for a file transfer across a network in 'C'
5) Implement 'Java RMI' mechanism for accessing methods of remote systems.
6) Simulate Balanced Sliding Window Protocol in 'C'.
7) Implement CORBA mechanism by using 'C++' program at one end and 'Java'
program on the other.

( AMIT MISHRA )

NCS 651 Computer Networks Lab

1. Programs using TCP Sockets (like date and time server & client, echo server &
client, etc.)
2. Programs using UDP Sockets (like simple DNS)
3. Programs using Raw sockets (like packet capturing and filtering)
4. Programs using RPC
5. Simulation of sliding window protocols

NCS 652 Software Engineering Lab

For any given case/ problem statement do the following;

1. Prepare a SRS document in line with the IEEE recommended standards.
2. Draw the use case diagram and specify the role of each of the actors. Also state
the
Precondition, post condition and function of each use case.
3. Draw the activity diagram.
4. Identify the classes. Classify them as weak and strong classes and draw the class
diagram.
5. Draw the sequence diagram for any two scenarios.
6. Draw the collaboration diagram.
7. Draw the state chart diagram.
8. Draw the component diagram.
9. Perform forward engineering in java.(Model to code conversion)
10. Perform reverse engineering in java.(Code to Model conversion)
11. Draw the deployment diagram.

( AMIT VIKAS )

NCS 653 Compiler Design Lab

1) Implementation of LEXICAL ANALYZER for IF STATEMENT.

2) Implementation of LEXICAL ANALYZER for ARITHMETIC EXPRESSION.
3) Construction of NFA from REGULAR EXPRESSION.
4) Construction of DFA from NFA.
5) Implementation of SHIFT REDUCE PARSING ALGORITHM
6) Implementation of OPERATOR PRECEDENCE PARSER.
7) Implementation of RECURSIVE DESCENT PARSER.
8) Implementation of CODE OPTIMIZATION TECHNIQUES.
9) Implementation of CODE GENERATOR.

( Kuldeep Singh)

NCS 651 Computer Networks Lab

1) Write a program for Bit Stuffing .

2) Write a program for Byte Stuffing in c.
3) Write a program to implement pure aloha/slotted aloha.
4) Write a program using TCP Sockets implement like date and time server and
client.
5) Write a program using UDP Sockets implement like simple dns.
6) Write a program for dijsktra algorithm implementation in c.
7) Write a program for Chat Client.
8) Write a program for Chat Server.
9) Write a program for Sliding Window Protocol.
10) Write a program to Implement RPC mechanism for a file transfer across
network in C.

( Dr. Pankaj Sharma )

Professor
HOD ( CS / IT )

NCS-451: OPERATING SYSTEM LAB

1.
2.
3.
4.
5.
6.
7.
8.
9.

Write a program for first come first serve (FCFS) CPU scheduling algorithm.
Write a program for shortest job First (SJF) CPU Scheduling algorithm.
Write a program for Priority Based CPU Scheduling algorithm.
Write a program for Round Robin (RR) CPU Scheduling algorithm.
Write a program to implement Bankers algorithm.
Write a program for FCFS disk scheduling.
Write a program for Shortest seek time first disk scheduling.
Write a program for SCAN disk scheduling.
Write a program for First-Fit memory block allocation.

10. Write a program for Best-Fit memory block allocation.

11. Write a program for Worst-Fit memory block allocation.

( Dr. Pankaj Sharma )

Professor
HOD ( CS / IT )

NCE-455: NUMERICAL TECHNIQUES LAB

1.
2.
3.
4.
5.
6.
7.
8.
9.

W A P to implement Bisection Method.

W A P to implement Regula Falsi method.
W A P to implement Iteration method.
W A P to implement Newton Raphson method.
W A P to implement Lagrangian method of interpolation.
W A P to implement Gregory forward interpolation formula.
W A P to implement Newtons divided differential formula.
W A P to implement Simpsons 1/3 rd rule.
W A P to implement Simpsons 3/8 rd rule.
10. WA P to implement Newtons Backward Interpolation formula.