<?xml version="1.0" encoding="UTF-8"?><!-- generator="WordPress/2.5" -->
<rss version="0.92">
<channel>
	<title>KyaPoocha.com</title>
	<link>http://kyapoocha.com</link>
	<description>Huge Collection of Interview Questions</description>
	<lastBuildDate>Mon, 06 Oct 2008 08:13:01 +0000</lastBuildDate>
	<docs>http://backend.userland.com/rss092</docs>
	<language>en</language>
	
	<item>
		<title>What is pipelining?</title>
		<description><![CDATA[A technique used in advanced microprocessors where the microprocessor begins executing a second instuction before the first has been completed. That is, several instructions are in the pipeline simultaneously, each at a different processing stage.
]]></description>
		<link>http://kyapoocha.com/computer-architecture-interview-questions/what-is-pipelining-2/</link>
			</item>
	<item>
		<title>What are the five stages in a DLX pipeline?</title>
		<description><![CDATA[The instruction sets can be differentiated by
* Operand storage in the CPU
* Number of explicit operands per instruction
* Operand location
* Operations
* Type and size of operands
]]></description>
		<link>http://kyapoocha.com/computer-architecture-interview-questions/what-are-the-five-stages-in-a-dlx-pipeline-2/</link>
			</item>
	<item>
		<title>What are the different hazards? How do you avoid them?</title>
		<description><![CDATA[There are situations, called hazards, that prevent the next instruction in the instruction stream from executing during its designated clock cycle. Hazards reduce the performance from the ideal speedup gained by pipelining. There are three classes of Hazards:
1. Structural Hazards: It arise from resource conflicts when the hardware cannot support all possible combinations of instructions [...]]]></description>
		<link>http://kyapoocha.com/computer-architecture-interview-questions/what-are-the-different-hazards-how-do-you-avoid-them/</link>
			</item>
	<item>
		<title>How do you handle precise exceptions or interrupts?</title>
		<description><![CDATA[Like java have a feature for handling exception handling &#8220;prime catch&#8221;.the exception like divide by zero,out of bound.
]]></description>
		<link>http://kyapoocha.com/computer-architecture-interview-questions/how-do-you-handle-precise-exceptions-or-interrupts/</link>
			</item>
	<item>
		<title>What is a cache?</title>
		<description><![CDATA[It turns out that caching is an important computer-science process that appears on every computer in a variety of forms. There are memory caches, hardware and software disk caches, page caches and more. Virtual memory is even a form of caching.
Caching is a technology based on the memory subsystem of your computer. The main purpose [...]]]></description>
		<link>http://kyapoocha.com/computer-architecture-interview-questions/what-is-a-cache-2/</link>
			</item>
	<item>
		<title>What is Virtual Memory?</title>
		<description><![CDATA[Virtual memory is a concept that, when implemented by a computer and its operating system, allows programmers to use a very large range of memory or storage addresses for stored data. The computing system maps the programmer&#8217;s virtual addresses to real hardware storage addresses. Usually, the programmer is freed from having to be concerned about [...]]]></description>
		<link>http://kyapoocha.com/computer-architecture-interview-questions/what-is-virtual-memory-2/</link>
			</item>
	<item>
		<title>What is Cache Coherency?</title>
		<description><![CDATA[Cache coherence refers to the integrity of data stored in local caches of a shared resource. Cache coherence is a special case of memory coherence. When clients in a system, particularly CPUs in a multiprocessing system cache occurs.
]]></description>
		<link>http://kyapoocha.com/computer-architecture-interview-questions/what-is-cache-coherency/</link>
			</item>
	<item>
		<title>Convert 65(Hex) to Binary ?</title>
		<description><![CDATA[65 to decimal
65/16=4
remainder=1
==41 decimal
decimal to binary
101001
]]></description>
		<link>http://kyapoocha.com/computer-architecture-interview-questions/convert-65hex-to-binary-2/</link>
			</item>
	<item>
		<title>Convert a number to its two?s compliment and back?</title>
		<description><![CDATA[First convert a number into binary format. Then keep last binary number as it is &#038; complement all others.
Eg:- 1101001
2&#8217;s Compl:0010111
]]></description>
		<link>http://kyapoocha.com/computer-architecture-interview-questions/convert-a-number-to-its-twos-compliment-and-back-2/</link>
			</item>
	<item>
		<title>The CPU is busy but you want to stop and do some other task. How do you do it?</title>
		<description><![CDATA[Arise a non maskable interrupt.
Then give jump instruction to required subroutine.
]]></description>
		<link>http://kyapoocha.com/computer-architecture-interview-questions/the-cpu-is-busy-but-you-want-to-stop-and-do-some-other-task-how-do-you-do-it/</link>
			</item>
	<item>
		<title>What is the difference between interrupt service routine and subroutine ?</title>
		<description><![CDATA[Subroutine are the part of executing processes(like any process can call a subroutine for achieve task),while the interrupt subroutine never be the part.interrupt subroutine are subroutine that are external to a process.
]]></description>
		<link>http://kyapoocha.com/computer-architecture-interview-questions/what-is-the-difference-between-interrupt-service-routine-and-subroutine-2/</link>
			</item>
	<item>
		<title>What is the difference between declaration and definition?</title>
		<description><![CDATA[DECLARATION : declaration only creates the variable name and nothing exists against it. i.e no memory space is consumed.
eg. extern a;
DEFINITION : definition declares as well as assigns some value to the variable.
eg.  int a;
even though we are not mentioning any value default value is provided by the C compiler.
eg. int a=10;
]]></description>
		<link>http://kyapoocha.com/data-structure-interview-questions/what-is-the-difference-between-declaration-and-definition/</link>
			</item>
	<item>
		<title>What is the use of fflush() function?</title>
		<description><![CDATA[Suppose we read a sentence using scanf e.g. &#8220;My name is ABC&#8221; in a string.
Printing this string using a printf statement prints &#8220;My&#8221;.
Go for another successive scanf.
It reads from the input stream&#8230; which still is having &#8220;name is ABC&#8221;.
Hence pritning the string this time shows &#8220;name&#8221;.
Solution to this is a fflush statement after first printf.
This [...]]]></description>
		<link>http://kyapoocha.com/data-structure-interview-questions/what-is-the-use-of-fflush-function/</link>
			</item>
	<item>
		<title>Without using /,% and * operators. write a function to divide a number by 3?</title>
		<description><![CDATA[#include
#include
void main()
{
int i,n;
float j=0;
clrscr();
printf(&#8221;enter the no&#8221;);
scanf(&#8221;%d&#8221;,&#038;n);
for(i=n;i>2;i=i-3)
{
j=j+1;
if(i==4)
{
j=j+1.333333;
}
if(i==5)
{
j=j+1.666666;
}
}
printf(&#8221;%f&#8221;,j);
getch();
}
]]></description>
		<link>http://kyapoocha.com/data-structure-interview-questions/without-using-and-operators-write-a-function-to-divide-a-number-by-3/</link>
			</item>
	<item>
		<title>What does it mean when a data structure is declared volatile? What does it mean when a data structure is declared Const?</title>
		<description><![CDATA[Volatile - you are asking compiler to not to optimise the data structure as well as to reload to CPU registers whenever it is in use. Not a good idea for Data structure, will waste lot of CPU time in loading long data structures.
]]></description>
		<link>http://kyapoocha.com/data-structure-interview-questions/what-does-it-mean-when-a-data-structure-is-declared-volatile-what-does-it-mean-when-a-data-structure-is-declared-const/</link>
			</item>
	<item>
		<title>Explain how performance of algorithm is analysed?</title>
		<description><![CDATA[The performance of an algorithm is analysed by the time complexity as well as its space complexity though both the complexities are trafe-offs between them. If time complexity increases then space complexity decreases &#038; vice-versa. Also the best &#038; worst cases of the time complexities are considered while determining the efficiency of the algorithm
]]></description>
		<link>http://kyapoocha.com/data-structure-interview-questions/explain-how-performance-of-algorithm-is-analysed/</link>
			</item>
	<item>
		<title>Is it possible to implement trees using arrays ? If yes, how?</title>
		<description><![CDATA[Yes, it is possible.
Here is an example of implementing a binary tree:
Consider an attay : a[n];
Place the root in first position.
and let the current position to be i = 0;
place left node at the position: 2i+1
place right node at the position: 2i+2.
Repeat these steps.
]]></description>
		<link>http://kyapoocha.com/data-structure-interview-questions/is-it-possible-to-implement-trees-using-arrays-if-yes-how/</link>
			</item>
	<item>
		<title>What is a void pointer?</title>
		<description><![CDATA[a pointer with no return type is called a null pointer.It may be any kind of datatype.It takes the data type according to the requirement in the program.
for eg:
 #include 
using namespace std;
void increase (void* data, int psize)
{
  if ( psize == sizeof(char) )
  { char* pchar; pchar=(char*)data; ++(*pchar); }
  else if [...]]]></description>
		<link>http://kyapoocha.com/data-structure-interview-questions/what-is-a-void-pointer/</link>
			</item>
	<item>
		<title>What is the difference between function templates and function overloading?</title>
		<description><![CDATA[Function templates involve telling a function that it will be receiving a specified data type and then it will work with that at compile time.
The difference with this and function overloading is that function overloading can define multiple behaviors of function with the same name and multiple/various inputs.
eg:
Function Template
template
void print(T var)
{
 cout ]]></description>
		<link>http://kyapoocha.com/data-structure-interview-questions/what-is-the-difference-between-function-templates-and-function-overloading/</link>
			</item>
	<item>
		<title>Explain what are linear data structure &#038; non-linear data structure?</title>
		<description><![CDATA[A data structure is classified into two categories: Linear and Non-Linear data structures. A data structure is said to be linear if the elements form a sequence, for example Array, Linked list, queue etc. Elements in a nonlinear data structure do not form a sequence, for example Tree, Hash tree, Binary tree, etc. There are [...]]]></description>
		<link>http://kyapoocha.com/data-structure-interview-questions/explain-what-are-linear-data-structure-non-linear-data-structure/</link>
			</item>
</channel>
</rss>
