Technical Interview Questions

RSS Feed Homepage

C Interview Questions For Hardware Engineer
2008-04-23 15:39:00
What are the total number of lines written in C/C++? What is the most complicated/valuable program written in C/C++? What compiler was used? Have you studied buses? What types?Have you studied pipelining? List the 5 stages of a 5 stage pipeline. Assuming 1 clock per stage, what is the latency of an instruction in a 5 stage machine? What is the throughput of this machine ?How many bit combinations are there in a byte?What is the difference between = and == in C?Are you familiar with VHDL and/or Verilog?TOP ECE Interview Questions ,
More About: Hardware , Engineer

TOP ECE Interview Questions
2008-04-23 15:30:00
Digital Questions Digital Electronics QuestionsHardware Interview QuestionsJob Hunting Guide for Analog/Mixed Signal Circuit DesignElectrical Engineering Technical Interview Questions/ReviewMicro Processor Interview QuestionsVLSI Design Interview QuestionsIntel Interview QuestionsECE Frequently Asked Interview QuestionsC Interview Questions For Hardware EngineerMicro Processor QuestionsSome Interesting and Confusing Questions in VLSI

Some Interesting and Confusing Questions in VLSI
2008-04-23 15:27:00
what are the differences between SIMULATION and SYNTHESISSimulation synthesis Simulation is used to verify the functionality of the circuit..a)Functional Simulation:study of ckt's operation independent of timing parameters and gate delays.b) Timing Simulation :study including estimated delays, verify setup,hold and other timing requirements of devices like flip flops are met.Synthesis:One of the foremost in back end steps where by synthesizing is nothing but converting VHDL or VERILOG description to a set of primitives(equations as in CPLD) or components(as in FPGA'S)to fit into the target technology.Basically the synthesis tools convert the design description into equations or componentsWhat are the differences between latches & flipflops?There are 2 types of circuits:1. Combinational2. SequentialLatches and flipflops both come under the category of "sequential circuits".Difference: Latches are level-sensitive, whereas, FF are edge sensitive. By edge sensitive, I mean O/p ch...
More About: Interesting , Questions

Micro Processor Questions
2008-04-23 15:26:00
What are the various registers in 8085? - Accumulator register, Temporary register, Instruction register, Stack Pointer, Program Counter are the various registers in 8085 . In 8085 name the 16 bit registers? - Stack pointer and Program counter all have 16 bits.What are the various flags used in 8085? - Sign flag, Zero flag, Auxillary flag, Parity flag, Carry flag.What is Stack Pointer? - Stack pointer is a special purpose 16-bit register in the Micro processor, which holds the address of the top of the stack.What is Program counter? - Program counter holds the address of either the first byte of the next instruction to be fetched for execution or the address of the next byte of a multi byte instruction, which has not been completely fetched. In both the cases it gets incremented automatically one by one as the instruction bytes get fetched. Also Program register keeps the address of the next instruction.Which Stack is used in 8085? - LIFO (Last In First Out) stack is used in 80...
More About: Questions , Processor

C Interview Questions For Hardware Engineer
2008-04-23 15:25:00
What are the total number of lines written in C/C++? What is the most complicated/valuable program written in C/C++? What compiler was used? Have you studied buses? What types?Have you studied pipelining? List the 5 stages of a 5 stage pipeline. Assuming 1 clock per stage, what is the latency of an instruction in a 5 stage machine? What is the throughput of this machine ?How many bit combinations are there in a byte?What is the difference between = and == in C?Are you familiar with VHDL and/or Verilog?
More About: Hardware , Questions , Interview , Engineer

ECE Frequently Asked Interview Questions
2008-04-23 15:25:00
What is the difference between a latch and a flip flop. For the same input, how would the output look for a latch and for a flip-flop.2. Finite state machines:(2.1)Design a state-machine (or draw a state-diagram) to give an output '1' when the # of A's are even and # of B's are odd. The input is in the form of a serial-stream (one-bit per clock cycle). The inputs could be of the type A, B or C. At any given clock cycle, the output is a '1', provided the # of A's are even and # of B's are odd. At any given clock cycle, the output is a '0', if the above condition is not satisfied. (2.2). To detect the sequence "abca" when the inputs can be a b c d.3. minimize a boolean expression.4. Draw transistor level nand gate.5. Draw the cross-section of a CMOS inverter.6. Deriving the vectors for the stuck at 0 and stuck at 1 faults.7. Given a boolean expression he asked me to implement just with muxes but nothing else.8. Draw Id Vds curves for mosfets and explain different regions.9...
More About: Questions , Interview

Intel Interview Questions
2008-04-23 15:24:00
COMPUTER ARCHITECTURE QUESTIONS1. For a single computer processor computer system, what is the purpose of a processor cache and describe its operation?2. Explain the operation considering a two processor computer system with a cache for each processor. What are the main issues associated with multiprocessor caches and how might you solve it?3. Explain the difference between write through and write back cache.4. Are you familiar with the term MESI?5. Are you familiar with the term snooping? STATE MACHINE QUESTIONS1. Describe a finite state machine that will detect three consecutive coin tosses (of one coin) that results in heads.2. In what cases do you need to double clock a signal before presenting it to a synchronous state machine? SIGNAL LINE QUESTIONS1. You have a driver that drives a long signal & connects to an input device. At the input device there is either overshoot, undershoot or signal threshold violations, what can be done to correct this problem? VALIDATION QUE...
More About: Questions , Intel , Interview

VLSI Design Interview Questions
2008-04-23 15:23:00
VLSI Design Interview Questions Explain why & how a MOSFET works Draw Vds-Ids curve for a MOSFET. Now, show how this curve changes (a) with increasing Vgs (b) with increasing transistor width (c) considering Channel Length Modulation Explain the various MOSFET Capacitances & their significance Draw a CMOS Inverter. Explain its transfer characteristics Explain sizing of the inverter How do you size NMOS and PMOS transistors to increase the threshold voltage? What is Noise Margin? Explain the procedure to determine Noise Margin Give the expression for CMOS switching power dissipation What is Body Effect? Describe the various effects of scaling Give the expression for calculating Delay in CMOS circuit What happens to delay if you increase load capacitance? What happens to delay if we include a resistance at the output of a CMOS circuit? What are the limitations in increasing the power supply to reduce delay? How does Resistance of the metal lines vary with increasing thickness ...

Micro Processor Interview Questions
2008-04-23 15:22:00
Micro Processor Questions Which type of architecture 8085 has?How many memory locations can be addressed by a microprocessor with 14 address lines?8085 is how many bit microprocessor?Why is data bus bi-directional?What is the function of accumulator?What is flag, bus?What are tri-state devices and why they are essential in a bus oriented system?Why are program counter and stack pointer 16-bit registers?What does it mean by embedded system?What are the different addressing modes in 8085?What is the difference between MOV and MVI?What are the functions of RIM, SIM, IN?What is the immediate addressing mode?What are the different flags in 8085?What happens during DMA transfer?What do you mean by wait state? What is its need?What is PSW?What is ALE? Explain the functions of ALE in 8085.What is a program counter? What is its use?What is an interrupt?
More About: Interview , Micro

C-program to count the leaves in a tree
2008-04-23 15:19:00
C++ Interview Questions and Answers12. Write a C program to count the number of leaves in a treeSolution:#includestruct binarysearchtree{ int data; struct binarysearchtree* left; struct binarysearchtree* right;};typedef struct binarysearchtree* tree;int count_leaves(tree T){ if(T==NULL) return 0; else if(T->left==NULL && T->right==NULL) { return 1; } else return count_leaves(T->left)+count_leaves(T->rig ht);}
More About: Tree , Program , Count , Leaves

Search On a Binary Search Tree
2008-04-23 15:14:00
11. Write a C program to search for a value in a binary search tree (BST).Solution:#include#includestruct binarysearchtree{ int data; struct binarysearchtree* left; struct binarysearchtree* right;};typedef struct binarysearchtree* tree;tree search_node(tree T,int num){ if(T==NULL) { return NULL; } else { if(T->data>num) search_node(T->left,num); else if(T->data search_node(T->right,num);return T; }}C++ Interview Questions and Answers
More About: Search , Tree

C-program to delete a node from a tree
2008-04-23 15:13:00
10. Write a C program to delete a node from a Binary Search Tree ?Solution:#includestruct binarysearchtree{ int data; struct binarysearchtree* left; struct binarysearchtree* right;};typedef struct binarysearchtree* tree;tree delete_node(tree T,int num){ tree temp; if (T==NULL) exit(0); //return NULL; else if(numdata) T->left=delete_node(T->left,num); else if(num>T->data) T->right=delete_node(T->right,num); else { if(T->left!=NULL&&T->right!=NULL) { temp=min(T->right); T->data=temp->data; T->right=delete_node(T->right,T->data); } else if(T->left==NULL) { temp=T; T=T->right; } else if(T->right==NULL) { temp=T; T=T->left; } free(temp...
More About: Program , Delete

C-program to check whether a binary tree is a Binary search tree
2008-04-23 15:11:00
Write a C program to check if a given binary tree is a binary search tree or not?Solution:If the given binary tree is a Binary search tree,then the inorder traversal should output the elements in increasing order.We make use of this property of inorder traversal to check whether the given binary tree is a BST or not.We make note of the latest element that could have been printed and compare it with the current element.Given below is a C function to check it.bool flag=true;void inorder(tree T,int *lastprinted){if(T==NULL){printf("the tree is empty .Hence, it is a BST ");}else{if(T->left!=NULL){ inorder(T->left,lastprinted);}if(T->data > *lastprinted){ *lastprinted=T->data;}else{ printf("the given binary tree is not a BST "); flag=false; exit(0);}inorder(T->right,lastprinted);}} Now check the value of flag to say whether it is a BST or not.If it is not then it is already taken care by the code. C++ Interview Questions and Answers
More About: Search , Check , Tree , Program

Solution1
2008-04-23 15:10:00
There is an array A[N] of N numbers. You have to compose an array Output[N] such that Output[i] will be equal to multiplication of all the elements of A[N] except A[i]. For example Output[0] will be multiplication of A[1] to A[N-1] and Output[1] will be multiplication of A[0] and from A[2] to A[N-1].Solve it without division operator and in O(n).Solution:At each position i,we need to assign A[i], the product of all the elements in the array except A[i].This amounts to same as putting A[i]=a*b,where a=cumulative product of all those elements to the left of A[i] and b=cumulative product of all those elements to the right of A[i].We can put this simply by storing the result in a separate array and by traversing the input array twice.In the first iteration, we traverse the input array left to right and assign Output[i]=a (where a is the product of all the numbers preceding A[i]).Now we traverse the input array again ,but in reverse direction and this time we findb(here b is the produc...

Solutions to problems in recursion analysis
2008-04-23 15:02:00
Using the substitution method, we substitute the function recursively till we arrive at T(1).i.e T(n)=T(n/2) + 1 = T(n/4) + 1 + 1 = ....We get a total of lg(n) iterationsi.e T(n)=T(1) +lg(n)Thus the complexity is O(lg n).Similar to the 1st problem, it takes lg(n) iterations to reach T(1).After final iteration:T(n)=(2^lg(n))*(T(1) + lg(n)*17)Thus the complexity is (2^lg(n))*(lg n) = n*lg(n)Recursion Analysis Let n=2^m,then T(2^m)=2*T(2^m/2) + 1Now let S(m)=T(2^m).=>S(m)=2*S(m/2) +1This is the same as 2nd problem.Thus the complexity is O(m*lg(m)),but m=lg(n)Thus the final complexity is O(lg(n)*lg(lg(n)))
More About: Problems , Solutions

Solutions to Amazon Intern Interview Questions
2008-04-23 14:59:00
1)Place a red ball in a urn and all the further balls in the other urn.The probability for picking out the red ball is now greater than 0.5.2)If vAmazon
More About: Questions , Interview , Solutions , Intern

C program to create mirror copy of a tree
2008-04-23 14:58:00
Question:Write a C program to create a mirror copy of a tree left nodes become right and right nodes become left)Solution:#includestruct binarysearchtree{ int data; struct binarysearchtree* left; struct binarysearchtree* right;};typedef struct binarysearchtree* tree;tree mirror_copy(tree T){if(T==NULL)return T;else{ tree temp1=mirror_copy(T->left); tree temp2=mirror_copy(T->right); T->left=temp2; T->right=temp1; return T;}}
More About: Mirror , Tree , Program , Copy , Create

Solutions to Questions on recursion
2008-04-23 14:57:00
1)int Fibinocci(int n){ if(n==1) return 1; else n+Fibinocci(n-1);}2)void reverse(char*str){ if(*str != '') reverse(str+1);}3)int Factorial(int n){ if(n==1) return 1; else return(n*Factorial(n-1);}4)void MoveTower(int disk, int source, int dest, int spare):{ if(disk == 1) printf("Move top disc from %d to %d ",source,desc); else { MoveTower(disk - 1, source, spare, dest); printf("Move top disc from %d to %d ",source,desc); // Step 2 MoveTower(disk - 1, spare, dest, source); }}5)int gcd(int a,int b){ if(b==0) return(a); else return(gcd(b,a(mod)b);}6)arr is an array containing N integers.You can also change the program by keeping characters.k is initially 0.void permutation(int *arr, int N, int k){ static level = -1; level = level+1; arr[k] = level; if (level == N) { if(arr!=0) for(int i=0; i printf("%d",arr[i]); } else for (int i = 0; i if (arr[i] == 0) permutation...
More About: Questions , Solutions

Minimum Value of a Binary Search Tree
2008-04-23 14:56:00
Question:Write a C program to find the minimum value in a binary search tree.Solution:#includestruct binarysearchtree{ int data; struct binarysearchtree* left; struct binarysearchtree* right;};typedef struct binarysearchtree* tree;tree min(tree T){if (T==NULL) return NULL;else{ if(T->left==NULL) return T; else return min(T->left);}}
More About: Search , Tree , Minimum

C program to delete a tree
2008-04-23 14:55:00
Write a C program to delete a tree(i.e, free up its nodes)#includestruct binarysearchtree{ int data; struct binarysearchtree* left; struct binarysearchtree* right;};typedef struct binarysearchtree* tree;void tree_free(tree T){if (T==NULL) return;else{ tree_free(T->left); tree_free(T->right); free(T);}}
More About: Tree , Program , Delete

Cisco - Specific Network Questions
2008-04-22 11:38:00
What is a wildcard mask, and how is it different from a netmask?How do you configure a Cisco switch or router? What are the steps needed?How would I place an interface into trunking mode?How do you shutdown an interface on a router or switch?What is VTP?What is VMPS?What is SPAN/RSPAN?What is flow/netflow?What is TACACS? Radius?
More About: Questions , Network , Specific

C++ Interview Questions and Answers
2008-04-22 11:27:00
C++ Object Oriented Interview Questions Some Good C++ Job Interview QuestionsAdvanced C++ and STL QuestionsC++ Coding Interview QuestionsBasic C++ Interview QuestionsAlgorithm Specific C++ Interview QuestionsC++ Networking QuestionsC++ OOP Interview QuestionsC++ Job Interview QuestionsC++ Object Oriented Interviews QuestionsCPP InterviewsC++ Questions to test the basicsC++ Code ExamplesFrequently asked C++ Interview Questions and Answe...Frequently asked C++ Interview Questions and Answe...Frequently asked C++ Interview Questions and Answe...Frequently asked C++ Interview Questions and Answe...Frequently asked C++ Interview Questions and Answe...Frequently asked C++ Interview Questions and Answe...
More About: Answers , Questions and Answers

CPP Interviews
2008-04-22 11:22:00
We have some good preparation material for CPP.Just go through the following links. By the end you will be comfortable with CPP. at least for the interview point of view.C++ Questions to test the basicsC++ Code ExamplesFrequently asked C++ Interview Questions and Answe...Frequently asked C++ Interview Questions and Answe...Frequently asked C++ Interview Questions and Answe...Frequently asked C++ Interview Questions and Answe...Frequently asked C++ Interview Questions and Answe...Frequently asked C++ Interview Questions and Answe...
More About: Interviews

Frequently asked C++ Interview Questions and Answers -6
2008-04-22 11:16:00
In C++, what is the difference between method overloading and method overriding? Overloading a method (or function) in C++ is the ability for functions of the same name to be defined as long as these methods have different signatures (different set of parameters). Method overriding is the ability of the inherited class rewriting the virtual method of the base class. What methods can be overridden in Java? In C++ terminology, all public methods in java are virtual. Therefore, all Java methods can be overwritten in subclasses except those that are declared final, static, and private. What are the defining traits of an object-oriented language? The defining traits of an object-oriented langauge are: * encapsulation * inheritance * polymorphism Write a program that ask for user input from 5 to 9 then calculate the average int main(){int MAX=4;int total =0;int average=0;int numb;coutcin>>numb;if((numb 9))coutelsefor(i=0;i{total = tota...
More About: Questions , Interview , Answers , Questions and Answers

Frequently asked C++ Interview Questions and Answers -5
2008-04-22 11:16:00
What is the difference between char a[] = ?string?; and char *p = ?string?;? In the first case 6 bytes are allocated to the variable a which is fixed, where as in the second case if *p is assigned to some other value the allocate memory can change. What?s the auto keyword good for? Answer1Not much. It declares an object with automatic storage duration. Which means the object will be destroyed at the end of the objects scope. All variables in functions that are not declared as static and not dynamically allocated have automatic storage duration by default.For exampleint main(){int a; //this is the same as writing ?auto int a;?}Answer2Local variables occur within a scope; they are ?local? to a function. They are often called automatic variables because they automatically come into being when the scope is entered and automatically go away when the scope closes. The keyword auto makes this explicit, but local variables default to auto auto auto auto so it is never necessary ...
More About: Questions , Interview , Answers , Questions and Answers