Computer Science Projects

Latest 2013-2014 final year Computer Science projects, Mini projects, IEEE Project Topics, Project Ideas for CSE, I.T Engineering , MCA, MSc students with Abstract, Source Code, Reports in C, Java, .Net, PHP and Android. Project reports are provided at the end of each article.

Real Time Distributed Control System

Real time distributed control system for information security in instrumentation networks. A distributed system can be defined as a set of homogeneous or heterogeneous nodes communicating through a LAN or WAN network. We need distributed systems because it can deliver High performance due to load balancing. Due to its unique architecture, system offer High availability since there is no single point of failure. Due to it's distributed architecture, managing resources at multiple node is bit tedious. Clocks of all the nodes should be synchronized. System should handle communication related errors arising due to out of order delivery of packets and packet loss. Tasks allotted to each node is independent of other nodes. To manage workload locally, each node have a resource manager. It also helps to migrate workload to remote nodes. Cooperation between the nodes, helps the system to meet the deadlines for a task.

Simple Game in Panda3D

Panda3D is a game engine which includes graphics, Audio, I/O, Collision detection, And other abilities relevant to the creation of 3D games. Panda 3D's intended game-development language is Python. The engine itself is written in C++, And utilizes an automatic wrapper-generator to expose the complete functionality of the engine in a Python interface. This approach gives a developer the advantages of Python development, Such as rapid development and advanced memory management, But keeps the performance of a compiled language in the engine core. For instance, The engine is integrated with Python's garbage collector, And engine structures are automatically managed. This project creates a simple game using Panda 3D game engine. The game is of role playing genre. That is it will follow a solid story line. This game contains some Real world characters whose movements and appearance are controlled and enhanced by using the libraries and modules of Panda3D. The game contains a human character as its hero and a panda as his protector. The human will start from a starting point and his aim is to reach a target position. While his movement lots of enemies will come in his path and panda must protect him from the enemies. This game is a simple one which is user friendly. It contains simple movement and strategies. It can be enjoyed by people of any age.

Software agent for Softwares

Software agent is a computer program that is capable of intelligently and autonomously executing a given task based on the instructions provided by the user. In our project we make use of software agent to obtain the details of software specified by the client. The promise of software agents - software that acts on your behalf. We employ the match template functions of OpenCV to match a particular template with a screenshot. This method will return the coordinates of the location of the region that is compared. Finally, to click the respective region, Xaut is devised. Using the mouse functions of Xaut, it is possible to move the cursor to the specific location and click buttons to obtain the details of the desired software. A software agent is a piece of software that acts for a user or other program in a relationship of agency, an agreement to act on one's behalf. The idea is that agents are not strictly invoked for a task, but activate themselves. Software agent is actually a software that acts on your behalf. Here we employs opencv technology, xaut library. Opencv is free for use. The library is cross platform. It focuses mainly on real time image processing. Xaut is actually Xautomation, which input output function.

Speed calculation using Image differences

Speed of the moving object can be calculated from the images taken from it. The most important phase in this is the detection of the repeating object in the subsequent images. Object tracking is done by Lucas-Kanade Algorithm, which is widely used differential method. By combining information from several nearby pixels, the Lucas-Kanade Algorithm can often resolve the ambiguities of the optical flow. The Lucas-Kanade Algorithm is implemented in the using OpenCV, a library of programming functions mainly aimed at real time computer vision. From the tracked object from the subsequent images the pixel difference is calculated. This measurement converted into meter. With the known value of the time interval between the subsequent images the velocity is calculated.


A Robot is an electronic device intended to perform a desired function. Robotics is one of the trendy branches of engineering which involves or deals with the design manufacture, application, and structural disposition of robots. We are witnessing stunning advancements in Robotics in every moment of this technological era. As a result of these advancements in Robotics, many interesting robotic forms have evolved. The word "Robot" originates from the Czech word for forced labor. They are designed with a primary motive of making human life simpler by solving critical problems, by working in risky environment or by performing a difficult task which require high speed and high degree of accuracy etc. Robots found their place in variety of applications-from manufacturing industries to defense and even critical space explorations. This shows the influence of Robotics and Robots in this modern world.

Study And Simulation of a Data Link Layer Protocol

The Data Link Layer is the protocol layer which transfers data between adjacent networks. The Data Link Layer provides the functional and procedural means to transfer data between network entities and might provide the means to detect and possibly correct errors that may occur in the Physical Layer. Study and simulate protocol to analyze and find the advantages and disadvantages and to improve the quality of the protocol such that it handles the network data transmission properly. The protocol is studied so that the details of the protocols are revealed and the limitations of the protocol can be overcome later. During simulation process a protocol is taken and it is examined properly. The frame is designed and the input frames from the physical layer is taken and is combined together to obtain segments. And the output from the network layer as segments are divided into frames and are sent to the physical layer. Thus it performs dual function from top to bottom and from bottom to top.


This project aims to solve Sudoku puzzles . This is a console-based Linux program, written in C language, that solves Sudoku puzzles (aka Sudoku, Number Place, etc., see figure 1) using deductive logic. It will only resort to trial-and-error and backtracking approaches upon exhausting its deductive moves. Puzzles must be of the standard 9 x  9 variety using the (ASCII) characters 1 through 9 for the puzzle symbols. Puzzles should be submitted as 81 character strings which, when read left-to-right will fill a 9 x 9 Sudoku grid from left-to-right and top-to-bottom. In the puzzle specification, the characters 1 - 9 represent the puzzle "givens" or clues. Any other non-blank character represents an unsolved cell.

Targeted Object Tracking In a Live Video

Video tracking is the process of locating a single or multiple moving object in time using a camera. An algorithm analyses the video frames and outputs the location of moving targets within the video frame. The main difficulty in video tracking is to associate target locations in consecutive video frames, especially when the objects are moving fast relative to the frame rate. Here, video tracking systems usually employ a motion model which describes how the image of the target might change for different possible motions of the object to track. Examples of simple motion models are

  • To track planar objects, the motion model is a 2D transformation of an image of the object (e.g. the initial frame)
  • When the target is a rigid 3D object, the motion model defines its aspect depending on its 3D position and orientation
  • For video compression, key frames are divided into macro blocks. The motion model is a disruption of a key frame, where each macro block is translated by a motion vector given by the motion parameters
  • The image of deformable objects can be covered with a mesh, the motion of the object is defined by the position of the nodes of the mesh.
  • The role of the tracking algorithm is to analyze the video frames in order to estimate the motion parameters. These parameters characterize the location of the target.

Augmented Reality with the help of a real wall

Augmented Reality has begun to get more widely noticed and for good reason. It’s potential as an advertising tool is almost limitless. The numbers of applications that have been developed and are out there for the public, like the ones listed earlier, make have got people interested in the technology. It is making our life easier already and is allowing us to do things that, only 60 years ago, were considered Science Fiction. Part science fiction, part a reaction to today’s increasingly overwhelming constant barrage of digital content, one thing is for certain, though Augmented reality is an important step on the road to making technology more understandable and useful. This project aims at implementing augmented reality with the help of a real wall. The wall holds the virtual images and videos projected as 3D photo frames over multiple markers. These multiple markers are detected by the system simultaneously and the virtual objects corresponding to each of them are augmented upon them in the scene.

Traveling salesman problem using MapReduce

The traveling salesman problem (TSP) is a well known and important combinatorial optimization problem. The goal is to find the shortest tour that visits each city in a given list exactly once and then returns to the starting city. Despite this simple problem statement, solving the TSP is difficult since it belongs to the class of NP hard problems in combinatorial optimization There is no know polynomial time solution for a TSP. Monte Carlo methods (or Monte Carlo experiments) are a class of computational algorithms that rely on repeated random sampling to compute their results. These algorithms never guarantee a 100% optimal solution. We are using the Monte Carlo algorithm to find a solution that is guaranteed to be close to the optimal solution. Sine the computation of a TSP is beyond the capability of a day-to-day use system we distribute the work of finding the optimal path using the MapReduce technology from Google. We run the TSP on a cluster using Apache Hadoop, a framework from Apache implemented in java which helps in performing MapReduce tasks.

Popular Videos


How to improve your Interview, Salary Negotiation, Communication & Presentation Skills.

Got a tip or Question?
Let us know