hi all,
I am looking for a project idea to work on. If there is any such idea please let me know. Thank you.
hi all,
I am looking for a project idea to work on. If there is any such idea please let me know. Thank you.
Be more specific.I am looking for a project idea to work on. If there is any such idea please let me know
Depends on which area you are looking for projects. Let us know if you are interested in Graphics Programming or Low-Level programming (Systems programming) or Database programming or general logical programming etc.
Help everyone you can
that's not a bad idea.. I'm learning c myself.. I needed to use it for an assignment, but I would like to work with it more. Maybe someone can post project ideas? Nothing too complicated to start.. maybe start with working with files and processing info, and then go from there?
Incidentally, my project for the class involved the use of pipes.. I figured somewhat how to work with them, but I'm still stuck on the assignment (see my other post on working with wait() ).
hi again,
Well...I will like any type of project.(Intersting ones). Be it Graphics, Networking....any Intersting Project Idea. Thanx
Ok, create a program for me that displays a bitmap picture in console mode using straight C.
Last edited by Shadow; 04-26-2002 at 02:17 PM.
The world is waiting. I must leave you now.
create a huffman encoder in pure C
huffman compression:
create a node for each character in a text file.
have it include the frequency of the character.
sort the nodes into order from lowest frequency upward
organize the nodes into a tree: each node has two possible branches. while there are still more than 1 node left, take the lowest two nodes, create a parent node and link the nodes to it. ie: a and b are the two lowest frequency nodes
make p's frequency value the sum of the frequencys of the two child nodes. then place than node into the right order by frequency. repeat until all nodes organized into the tree.Code:p / \ a b
create a lookup table of the values of the tree. (each terminating node, the leaves of the tree, should represent a letter). write a binary stream of 0's and 1's where 0 is one branch of the tree, and 1 is the other. eg:
finally, write a couple of functions to encode, decode, etc..Code:a is 010 because starting with the trunk of the tree (the top node) you follow branch zero, then branch one, then branch zero to find the letter node
or maybe you would be satisfied with a pig-latin program...
a more efficient operating system then windows 2000
sample output would be:
"Hello World"
that would suffice
Fix the bug that allowed Windows to monopolize the market!
Asking the right question is sometimes more important than knowing the answer.
Please read the FAQ
C Reference Card (A MUST!)
Pointers and Memory
The Essentials
CString lib