Jaypee Institute of Information Technology (JIIT) 2007 B.Tech Computer Science and Engineering data structures - university paper
Tuesday, 02 April 2013 01:30Web
Exercise 1. obtain the maximum element in a uni-modal array.
Exercise 2. Simulate a lift
a. Requirement Analysis
b. Function design
c. Interface design
Exercise 3. Implement an AVL tree with subsequent functionality
a. Insertion
b. Deletion
c. Search
d. Display
Exercise 4. Simulate a game with subsequent attributes. The game consists of a board which can be of any dimensions. There are n (0
The board can be moved in 4 directions, up, down, left and right, there by moving all the coins 1 block in that direction. There are n holes in the board which are again with the corresponding number on them. The aim of the game is to successfully drop all the coins in the corresponding hole of the board.
Initial position of the coins is the left most column of the corresponding numbered row.
Input of the program should be :
1. Dimensions of the board.
2. Number of coins.
Note:
* Generate the position of the holes randomly. Such that, they do not overlap, they are within the co-ordinates of the board.
* Once 1 coin has entered its corresponding hole then a different coin can move on top of it also.
* The coins can not move out of the board as the corners of the board are raised. Hence if a move is making a coin move out of the board then the coin would simply not move further there by preventing any adjacent coin to move also.
* Do proper fault checking in the program.
| Earning: Approval pending. |
