If you are coding in assembly language in linux and not using any IDE then this post worth reading.
We have stared a new semester in our computer science and engineering graduation. Most of this semester’s courses very important for a computer engineer and should be added another adjective bit difficult. One of those is assembly. Course instructor’s recommendation is to compile and run the code in linux using nasm.
Using no IDE, it is very boring to code. As each time any edition in source file, have to type command to compile and link and finally execute the code. if error occurred then again type command for debugger. Have to waste time for typing commands. In time of programming this is not any programmer willing to do.
Then the universal scripting theory Continue reading
I developed this game as my term assignment in Level-1 and Term-2 (February – March 2007) in C Programming course. This is my first huge project in C, technically last one (as already have learned C++ and Java).
This is a typical Pacman game. where player plays as a Pacman who’s object is to eat all the seeds in the board or better I say it maze. In the maze player is not alone. There are enemies, four of them, to catch u. If they catch player loses life. Right now there is four levels. Hope I could increase level in recent future. Continue reading
It’s been long time. sorry to them those who want some explanation from me. was bit busy can’t give enough time for blogging. but now i have sorted out that “i will always be busy”. so if i want to continue blogging then i have to write something on the fly.
For them who have got some help “Prefix to Postfix using Binary Teer”. Here same code is implemented using stack. But keep in mind that if case of implementation using stack binary tree is not used at all.
Here is a pdf file discribing the algorithm. Prefix to Postfix using Stack Algorithm
Here is the code written in C++ Continue reading
Recently we have given a online assignment to convert a prefix expression to postfix using binary tree. but it is very odd to say that we had learn tree only a day before. as a result only three or four of us among 30 could complete the code in 2 hours limited time. fortunately i was one of them. and for all of my friends who are struggling with it could see the following code.
This section is Updated later:
I wanted to explain a lot but i can’t because of time. have lots of thing to share. firstly i have made a power point slide that actually simulates how a binary expression tree is made from a prefix expression. hope this will at least help to understand the logic behind the conversion. click this link Prefix to Expression Tree Simulation
Updated section ends here
Here is the code of prefix to binary tree(arrayed implementation).
This is my first post. Love the idea of Blogging. This is the best idea of shearing over the net.