Minor project: Cyber Management System using C

C.yber is a program which interconnects different computers which allows users to communicate over the computer network and provide security from unauthorized users by login system in client server.The project aims at managing the cyber cafe with multiple clients and give the clients access of services that the cyber is providing when it log in. The clients can log in as members or guests and use the services that the cyber is providing. The client can request services of cafe like tea, coffee or any others. The above program uses file handling as database. The various features of C like Multithreading, Socket (Networking) are used. It is very useful for the student or beginner in the programming field. It also helps in building...

Read more »

Mini Project Student Record System in C

Mini project student record system is another project based on programming language C. It also uses files as database. This project is similar to another mini projects of this blog but every project in Programming Techniques has unique style of coding and presentation so that reader get clear about all aspects of programming. In this project, a console window is virtually splited into two parts, one is static which doesn’t change and another is dynamic which changes time to time. The text are written using various colors to make them static. The program is not complete, reader can download the code and make improvement and also make it complete. There are many places for further enhancement. I think this project becomes milestone...

Read more »

C Mini Project Ideas with a Sample Calculator Project

Do you want to build a simple application in C but you don’t know how and where to start? Or you know how to build a C application but don’t know any project ideas? then do not worry you are at the right place. If you finished learning  C and became familiar with its programming paradigm then I encourage you to build some applications (weather it is application software or system software) to actually sharpen your skills in C. If you do projects, then you will know how to apply those programming constructs accurately in building a projects. So here I will explain how to start a new C projects for completely beginner and give some projects ideas about what type of application you can build using C language I have some suggestions for people who are about to write their first...

Read more »

Drawing a Circle with Mid – Point Circle Algorithm in C/C++

As in the previous line drawing algorithm, we sample at unit intervals and determine the closest pixel position to the specified circle path at each step. For a given radius r and screen center position (xc, yc), we can first set up our algorithm to calculate pixel positions around a circle path centered at the coordinate origin (0, 0). Then each calculated  position (x, y) is moved to its proper screen position by adding xc to x and yc to y. Along the circle section from x = 0 to x = y in the first quadrant, the slope of the curve varies from 0 to –1.  Therefore, we can take unit steps in the positive x direction over this octant and use a decision parameter to determine which of the two possible y positions is closer...

Read more »

Implementing Bresenham’s Line Drawing Algorithm in C/C++

Bresenham’s Line Drawing Algorithm is an accurate and efficient raster line-generating algorithm developed by Bresenham. In this algorithm, we first consider the scan – conversion process for lines with positive slope less than 1. Pixel positions along a line path are then determined by sampling at unit x intervals. Starting from the left end point (x0, y0) of a given line, we step to each successive column (x position) and plot the pixel whose scan – line y values is closet to the line path. Assuming we have determined that the pixel at (x(k), y(k)) is to be displayed, we next need to decide which pixel to plot in column x(k+1). Our choices are the pixels at positions (x(k) + 1, y(k)) and (x(k) + 1, y(k) + 1). The following section...

Read more »

Drawing Straight Line using DDA Algorithm in C/C++

The digital differentia analyzer (DDA) is a scan-conversion line algorithm. In this algorithm, we sample the line at unit intervals in one coordinate and determine corresponding integer values nearest the line path of the other coordinate and plot those coordinate (pixel) in computer screen. Consider first a line with positive slope. If the slope is less than or equal to 1, we sample at unit x intervals (dx = 1) and computer each successive y value as y(k+1) = y(k) + m. Subscript k takes integer values starting from 1, for the first point, and increases by 1 until the final endpoint is reached. For lines with a positive slope greater than 1, we reverse the roles of x and y.That is, we sample at unit y intervals (dy = 1) and calculate...

Read more »

Conversion of infix string to postfix and evaluation of postfix string to make a simple calculator application in C++.

(A) Algorithm for converting an infix expression into postfix operation 1. Add “(“ at the beginning and “)” at the end of an  infix expression Q. 2. Scan Q from left to right and repeat  step 3 to step 6. 3 If an operand is encountered, add it into postfix P. 4. If a left parenthesis is encountered,  push it onto the stack S 5. If and operator op is encountered then, (a) Repeatedly pop from stack S and add  it to postfix each operator which has same precedence as or higher precedence than op. (b) Add op to Stack S. 6. If a right parenthesis is encountered, then (a) Repeatedly pop from stack S and add  it to postfix each operator until left parenthesis is encountered on stacks. (b) Remove the left parenthesis. (B) Algorithm for evaluation of postfix string 1....

Read more »