This is the current draft:
It is expected that the project list will gradually grow
up to, and maybe after, the start of semester-2.
Also, if a student wants to propose a project
will try to find a supervisor for it,
Project selection will happen early in [semester-2].
About CSE1370/CSE2370: [click].
Emails: change NOSP@M ---> @ in the addresses.
Who knows, this could be the start of google-2?
There is plenty of scope within `complexity': Implement a new model under `Vlab', and do some experiments with it:
Different sets of tiles can be used to construct a range of
interesting patterns. Certain sets of tiles produce fractal patterns,
while others are capable of representing computations!
See [www(click)] for some examples. The "Ghost Diagrams" program assembles tiles based on hexagons or squares, where the edges of the tiles are shaped such that some edges will only connect to certain other edges (somewhat like a jigsaw puzzle). Also, some edges can be "empty", and don't need another tile placed next to them.
Extend this concept to three dimensions. Write a program that when given specifications of the six faces of a set of cubes will assemble those cubes into a structure such that the faces all fit together correctly. Your program should also be able to display the resulting structure, perhaps using OpenGL.
Challenges: - Assembly can become arbitrarily difficult, depending on the set of shapes. Make the assembly algorithm as smart as you can, so that it can assemble as many different sets of shapes as possible. For example, you might make the assembler able to backtrack if it has "painted itself into a corner".
- Make the display look nifty. For example, draw the "empty" faces using smoothly curved surfaces to give an organic look.
- Add support for shapes based on hexagonal prisms or truncated octahedra.
- Find some shapes that produce interesting structures.
-- [www] [email] [icq 298231643]
A.N. tells me that this is legit. research and not a dodgy gambling scam, honest!-)
This is a two-player game which can be done using two computers connected to each other. There are two teams with 6 players and one ball in the game. Each user manages one team by using the mouse. A client program handles the display of the game status and user commands for a team, such as moving a player and throwing the ball. The client program does not implement strategies but relies on user input to determine where players should move and where the ball is thrown. The server program runs either on of the clients' computers or on a third computer. The server implements the rule of the game and the dynamics of ball and player movement. In the basic implementation, one server and two clients are required to play the game. The objective of this project is implementing the server which must coordinate between players, keep track the ball and handle the commands received from clients. The server must also provide a status message and send it periodically to each client to refresh its displays. The client program would be provided. The clients and server communicate with each other via TCP/IP protocol sockets by sending messages with specific format. High-level functions would also be provided to establish the communication between the server and the clients.
This is an interactive card playing game between computer and a user. At the beginning a player (computer or the user) is determined randomly to choose the trump suit (clubs, diamonds, spades or hearts). Then, five cards are handed to players. Then two of the first five cards must be put aside. Afterwards, each player must choose 10 cards among the remaining cards in such a way that the player who has chosen the trump suit must start first and in each turn, the player who is his turn, must pick up one card and watch it. If he likes the card he can choose it and watch the second card and put it aside. If he doesn't choose the first one, he must put it aside and pick up the second one. After choosing 10 cards (in addition to the first 3 cards) the player who has chosen the trump suit begins the play. Each time, each player must put one card in the middle. The player with stronger card wins both cards in the middle. The ranking of cards is the trump suit first then: A,K,Q,J,10,9,8,7,6,5,4,3,2. The players who gets 14 cards wins this round and the player who wins 7 rounds will be the winner of the whole game.
Should take input as CSV (extension: .ods
and/or .xls) and preferably also by manual input, and be able to calculate
total marks, facility, discrimination, mean and standard deviation for
individual questions and for subsets of questions. I would like it to be able
to display marks histograms and scatterplots, and calculate correlation
coefficients for individual questions and also for subsets of questions (e.g.
how well do questions 1-4 correlate with questions 5-8).
Advanced second years can also look up the CS Ed literature to see the kind of information researchers in the area are interested in, and think up some original ways to display it.
The `ideal gas' simulation [www(click)] is a Java applet which simulates the behaviour of gas particles. Energy is conserved; the applet guarantees that there is zero loss, or gain, of energy from arithmetic approximations: No rounding errors. The `entropy' (randomness) of the state of the gas is plotted. The present physics are deterministic and time-reversible.
The project is to add more features to the simulation, e.g.,
B-trees are very important data structures,
particularly for large collections of data, e.g., data bases.
The project is to create a demonstration of B-trees in
You might get some ideas from this demo
of binary search trees, and AVL trees.