CPDS Important Quetions Of ALL Units

Most Important Quetions In Linear and Digital Integrated Circuits

UNIT-1

1. Classification of ic’s (8)
2. Explain epitaxial growth, Photolithography process (8)
3. Fabrication of resistor, capacitor, diode, transistor(by giving sample circuits) (16)
4. Isolation techniques

---

Unit -2 1. Explain Block diagram of op-amp (8)
2. Explain ac characteristics of op-amp (8)
3. Explain application of op-amp as integrator and diffrentiator ( read all applications )(8)

---

Unit 3 1. Explain three op-amp instrumentation amplifier with diagram (16)
2. Explain op-amp as comparator (8)
3. Explain D/A convertors (8)
4. Explain A/D convertors using any two methods /(16)

---

Unit 4

1 .explain ic 565 with neat block diagram (16)
2. explain application of ic 555 timer (16)
3. explain functional block diagram of ic 555 timer.(8)

---

Unit -5

1. Explain ic voltage regulator with neat sketch (16)
2. Explain ic 8038 with neat block diagram (16)
3. 3. Explain switching regulators (16)

---

TIPS :
Be knowledgeable in all IC pin details .this will surely help u to get more marks in first unit study all base planar process. So that u can attend both part A and part B question.
In case of 4th unit , study both PLL and VCO question so that u can attend one part B question (99%). In 5^th unit ,study function generator and switching regulator (especially )..it may come surely ....

---

important quetions For Data Structures unit Wise

UNIT-I

• Algorithm analysis and complexities
• Design methodologies and implementation of recursion
• C programs using recursion( GCD,FACTORIAL,TOWERS OF HANOI)
• List Search( Binary and Linear)

UNIT-II

• Heap sort
• bubble sort
• quick sort
• merge sort.

UNIT-III

• Priority queue implementation
• applications of stack
•  representation of stack and queue using arrays and linked list
•  ADT operations of stack and queue

UNIT-V

• What is binary tree ? explain about representation of binary tree using arrays and linked list.
• Explain different operations of binary tree.
• Binary Tree travels( In-order,preorder,post order).

• Graph representation using adjacency matrix and linked list( adjacency list).
•  Depth first and Breadth first search algorithms and examples.
• Dijkstra's shortest path algorithm with an examples.Does the algorithm work for paths of negative values? explain.
• Prism algorithms for the following tree( following fig updated later)
• Warshall's algorithms and how do you find the minimum spanning tree for a tree    

Important Quetions for Data Structures

Principles of programming language important quetions unit wise

PPL IMPORTANT QUESTIONS

UNIT-I

1.Explain in detail about various language evaluation criteria and the characteristics that affect them.

2. Explain the process of compilation.

3 Explain about various programming domains.

4 What are the factors that influence the basic design of programming languages?

5 Explain in detail about various language implementation methods.

6. Explain the Language categories.

UNIT-II

1. Distinguish between language generators and language recognizers.

2 Give grammar for simple assignment statements.  Give an unambiguous grammar for if-then-else statement

3.Give BNF and EBNF versions of an expression grammar.

4. Explain about attribute grammars in detail

5.What do you mean by denotational semantic? Give denotational semantics of a simple logical loop.

6. What do you mean by axiomatic semantics? Give the weakest precondition for a sequence of statements

7.Compute the weakest precondition for each of the following assignment statements and post conditions:

a) a=2*(b-1)-1 {a>0}

b) b=(c+10)/3 {b>6}

c) a=a+2*b-1 {a>1}

d) x=2*y+x-1 {x>11}.

8. Distinguish between general language generator and general language recognizer.

9. Describe the basic concept of denotational semantics.

UNIT-III

1 Distinguish between static scoping and dynamic scoping with an example.

2. Explain about user defined ordinal types.

3.Explain about associative arrays.

4. What do you mean by type coercion? Define narrowing and widening conversions

5. Distinguish between name type compatibility and structure type compatibility.

6. Define static, fixed stack-dynamic, stack-dynamic, fixed heap-dynamic and heap-dynamic arrays. What are the advantages of each?

7. Explain about subscript bindings and various array categories

8. Explain the concept of pointers.

UNIT-IV

1. Explain about iteration based on data structures.

2.What are guarded commands?

3.What do you mean by a functional side-effect?

4. What are the design issues of multiple selection constructs?

5What is a mixed mode expression?

6 What are the design issues for logically controlled loop statements

7.What are the design issues for selection structures?

8.What is a short-circuit evaluation?

9. Define functional side effect. How does operand evaluation order interact with functional side effects?

                                                             Unit-5



Explain the basic

primitives of LISP. Give suitable examples

127



Explain the operations that can be performed on atoms & lists in LISP



Discuss basic elements of LISP. Give ex



Write a lisp fn which computes nth Fibonacci number



Explain ML inferencing process



Explain about the

datatypes and their values in python.



What is the importance of module library in python.



What is the difference between a tuple and a list ?



Explain the main features of Imperative Languages.



Write a detail note on functions in ML.

Bee Important Quetions For 2-1 CSE