Hardware questions

1. Draw the state transition diagram for sequence detector for the sequence 011. if the first bit detected is zero then SCRH should be asserted when the second bit is 1 the SCRH should remain asserted when the third bit is 1 the FOUND should be asserted and the SCRH should be de-asserted. No bits should be left.

ts=0.5 and Th=0.7 (for the this is the setup time required and hold time required)
buffer has the delay of 1nsec
what is the setup time _________ns
what is the hold time ___________ns

a. For each gate the delay time is 0.5 ns when will the glitch occur draw the glitch waveform.

b. How the circuit should be modified to avoid glitch.

2. Describe the driving inverter? What inverter is weak and which has more strength? why?

3. Using 2:1 Mux make a transparent latch (D f/f)

4. Design a ckt such that f (clk_out)=2 f (CLK_in) that is frequency doubling circuit is needed

5. Using 2:1 Mux and one inverter make XOR gate

Software questions:
Totally 20 questions were asked
* Most of them from C and data structures (in equal nos)
* few from c++

1. Numbers sequential search has to compare ______ elements on worst and _______numbers on an average

2. Which of the following algorithm is not applicable for  list representation of numbers
1. Binary search  2. Sequential search  3. Selection sort

3. Program to reverse a linked list all the variables 3 left pair of statements they give, we have to write the logic part
i.e. live
typedef struct link
{
int element;
struct link *next;
}code;
struct link rev(node *p)
{
node *t;
node *r=0;
while(p!=___)
{
t=____;
p=_____;
r=______;
}
return=______

4. Exactly same type of question to check whether the given string is palindrome or not.

5. They gave one program and asked what it is (it is fibonacci series)

6. Int i=7;
printf(d,i++*i++); what is the answer

7. Int i=7;
printf(%d,i++*i++); what is the answer

8. Struct code
{ int I;
int t;
}
/* some code */
main()
{

}
What is wrong ?
Answer: semicolon is missing after structure declaration

9. Selection sort for N elements the no of comparisons needed and no of swapping

10. One question from heap sort

11. One question about breadth search

12. What is a language
* set of alphabet
* combination of alphabet
* strings of some alphabet