Monday, November 21, 2011

8086 interview questions

8086 interview questions 
  1. What are the flags in 8086? - In 8086 Carry flag, Parity flag, Auxiliary carry flag, Zero flag, Overflow flag, Trace flag, Interrupt flag, Direction flag, and Sign flag.
  2. What are the various interrupts in 8086? - Maskable interrupts, Non-Maskable interrupts.
  3. What is meant by Maskable interrupts? - An interrupt that can be turned off by the programmer is known as Maskable interrupt.
  4. What is Non-Maskable interrupts? - An interrupt which can be never be turned off (ie.disabled) is known as Non-Maskable interrupt.
  5. Which interrupts are generally used for critical events? - Non-Maskable interrupts are used in critical events. Such as Power failure, Emergency, Shut off etc.,
  6. Give examples for Maskable interrupts? - RST 7.5, RST6.5, RST5.5 are Maskable interrupts
  7. Give example for Non-Maskable interrupts? - Trap is known as Non-Maskable interrupts, which is used in emergency condition.
  8. What is the Maximum clock frequency in 8086? - 5 Mhz is the Maximum clock frequency in 8086.
  9. What are the various segment registers in 8086? - Code, Data, Stack, Extra Segment registers in 8086.

Sunday, November 20, 2011

Convert Visual Studio 2010 Project into Visual Studio 2008

To Convert Visual Studio 2010 Project into Visual Studio 2008, download the following file and install it (after unzipping it). Then open your project with the installed program and then just convert it.

Tuesday, November 15, 2011

Saturday, November 12, 2011

Wednesday, October 26, 2011

Modern Operating System by Andrew S. Tanenbaum Free Download.

Modern Operating System by Andrew S. Tanenbaum Free Download.

Introduction to automata theory, languages & computation 2nd edition by John E. Hopcroft, Rajeev Motwani, Jefrey D. Ullman Free Download

Introduction to automata theory, languages & computation 2nd edition by John E. Hopcroft, Rajeev Motwani, Jefrey D. Ullman Free Download.

Free Download Software Engineering by Roger S. Pressman

Free Download Software Engineering by  Roger S. Pressman

Computing with C# and the .NET Framework by Art Gittleman Free Download

Free Download Computing with C# and the .NET Framework by Art Gittleman.

Free Download Introduction to Languages and The Theory of Computation by John C. Martin

Free Download Introduction to Languages and The Theory of Computation by John C. Martin

Sunday, September 18, 2011

Download Visual Studio 2006 Free

Download Visual Studio 2006 Free and Install Using Custom Settings.

click here to download

Wednesday, July 13, 2011

Difference between BFS and DFS

Breadth-first search (BFS) and depth-first search (DFS) are the two algorithms used for traversing and searching a node in a graph. They can also be used to find out whether a node is reachable from given node or not.
In depth-first search traversal  we try to go far from the root node.  Nodes are visited by going through the depth of the tree from starting node. When we reach at the node which does not have any children then we backtrack and visit the child nodes on another branch.
The depth-first search traversal of above graph will be:

A  B  E  F  C  D

Tuesday, June 14, 2011

An Introduction to Programming Contest (Various Input\Output Systems)

If you are a beginner, you will find it very unusual sometime regarding taking inputs. Some problems will say, "The Program will continue till the END OF FILE:, some will say "Stop taking input if N=0" etc etc. Some important ways to take input will be described here:

1. If you are said to take an integer number (n) as input till the End Of File/ (EOF):
int main(){
    int n;
    while(scanf("%d", &n)!=EOF){
    return 0;

Sunday, June 5, 2011

File Input/Output

There are various ways to take input from file and show the result in another file. 

We can use fopen() for taking input from a file or to show output in a file. It is the easiest way to do so. First, we have to open the files and at the end we just need to close the file. An example is given below:

Suppose we want to take input from the "input.txt" file and want to store the results in the "output.txt" file. The code for this is given below:

int main(){
    int T, ans;
    int cm, y, ssu, ssa, f;
    int b, gs, gc, w;
    freopen("input.txt","r", stdin);
    freopen ("output.txt","w",stdout);
    scanf("%d", &T);
               scanf("%d%d%d%d%d", &cm, &y, &ssu, &ssa, &f);
               scanf("%d%d%d%d", &b, &gs, &gc, &w);
               ans = b + (gs/30) + (gc/25) + (w/10);
               printf("%d\n", ans);
    return 0;

Wednesday, June 1, 2011

memset (cstring (string.h))

memset is such a library function which is rarely used in practical. Suppose, in an array, for some certain values you have to make that true. And for any other values that will be false. In this case you have to change all the elements of the array to false first, and then you can make that true for those specific values. memset is the easiest way to do this. An example of it is given below:

bool row [10000 + 5];
bool col [10000 + 5];
memset (row, false, 10005);
memset (col, false, 10005);

void * memset ( void * ptr, int value, size_t num );

Fill block of memory Sets the first num bytes of the block of memory pointed by ptr to the specified value (interpreted as an unsigned char).

Pointer to the block of memory to fill.
Value to be set. The value is passed as an int, but the function fills the block of memory using the unsigned char conversion of this value.
Number of bytes to be set to the value.

Return Valueptr is returned.


/* memset example */
#include <stdio.h>
#include <string.h>

int main ()
  char str[] = "almost every programmer should know memset!";
  memset (str,'-',6);
  puts (str);
  return 0;

------ every programmer should know memset!

UVA Problem#11760



1. Take 2 Boolean array (e.g bool row[10000 + 5]; bool col[10000 + 5]; )
2. Let all the elements of the above two array be false. The easiest way to do this is by using memset(...,...,)
3. Then start taking the inputs as "r" and "c"and turn the row[r] and col[c] into true from false.
4. Then check the 4 places of Arif where he can move. 
5. Print your result.
Pseudo code is given below:

Friday, April 29, 2011

Database System Concepts 5th ed. by Silberschatz, Korth, Sudarshan

Database System Concepts 5th ed. by Silberschatz, Korth, Sudarshan free download

Monday, April 11, 2011

UVA Problem#11900



1. take all the necessary inputs.
2. let count be the variable of the counter. you have to check so that count<P and count<N,then add the weight and recheck. Pseudo code is given below:

int main(){
            for(W=count=0; count<P && count<N;){

        printf("Case %d: %d\n", c++, count);

    return 0;

Wednesday, April 6, 2011

Tuesday, March 29, 2011

Complete C++ Guide

The Complete C++ Guide

What is C++?
C++ (pronounced "See plus plus") is a statically typed, free-form, multi-paradigm, compiled, general-purpose programming language. It is regarded as a middle-level language, as it comprises a combination of both high-level and low-level language features.

What is C++ used for?
For big software projects that require high performances. Most major applications and games are made in C++.
Photoshop, Firefox, Winamp, Counter Strike...

Short list of C++ compilers:
For Windows:
Microsoft Visual C++ Express
Borland C++ 5.5
For Linux:
G++(contained in GCC which comes preinstalled in most distros)
Intel C++ (free for noncommercial use only)

For Mac OS X:
Apple C++

How to install animated label cloud in your blog

How to install Blogumus in your Blogger layout
Installing Blogumus in your Blogger layout is surprisingly simple! You should only need to copy and paste a section of code to your Blogger template, though any tweaks for the style of display will require some manual editing. Here are the steps required to install Blogumus in your Blogger layout: Go to Layout>Edit HTML in your Blogger dashboard, and search for the following line (or similar):

<b:section class='sidebar' id='sidebar' preferred='yes'>

Immediatly after this line, paste the following section of code:

Sunday, March 20, 2011

Manipulating MySQL with PHP

Manipulating MySQL with PHP
Beginners Tutorial

If you do not know what MySQL is, then I suggest reading the spoiler below.

MySQL is a widely used program that allows anyone to easily create and host their own database. MySQL is free and can be set up in a matter of minutes. When you create your own database, you will need to remember your host, your username, and your password. Many website hosting sites have included MySQL database support, which means you can use the MySQL database they provide for you and edit it within the host site's Control Panel without having to download MySQL onto your hard-drive. For simple needs, and for safety reasons, using provided MySQL service from a website hosting sites may be the best choice for you.

Sunday, January 30, 2011

Free CRICKET WORLD CUP 2011 Fixture download

download the file from any of the following links. exclusive fixture made on Microsoft Excel. 



Wednesday, January 26, 2011

Saturday, January 8, 2011

Sieve Algorithm Implimentation

Sieve is a popular algorithm. It is used to detect the prime numbers between two numbers.  

#define max 10000000
char p[max];
void sieve()
long i,j,c=0,x=0;
for(i=2;i<max;i++) p[i]=1;
for(i=2;i<=sqrt(max); )

for( ;!p[i];i++);
for(i=0;i<=max;i++)if(p[i])x++; /*This 2 lines for checking the number of primes between 0 & 10000000.*/

int main()
return 0;

Wednesday, January 5, 2011

Bloodshed Dev C++ compiler

Bloodshed Dev C++ compiler download.

Adobe Photoshop CS4 Extended Edition

Adobe Photoshop CS4 Extended Edition with serial key and crack.

Matrix Multiplication

Download the following file if you have problem regarding Matrix Multiplication or Matrix Chain Multiplication or to find the optimal parenthesize of MCM.


Sunday, January 2, 2011

Find Info's of Any People

There are few websites where you can find at least some information regarding any one. Here are some links.