papers
Showing posts with label papers. Show all posts
Showing posts with label papers. Show all posts

Most Important Quetions In Linear and Digital Integrated Circuits

04:55:00

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 5th unit ,study function generator and switching regulator (especially )..it may come surely ....

Btech StuFFs
important quetions For Data Structures unit Wise

important quetions For Data Structures unit Wise

03:25:00
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    



Principles of programming language important quetions unit wise

Principles of programming language important quetions unit wise

05:12:00
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.

Important Questions For Control systems ECE 3-1

Important Questions For Control systems ECE 3-1

08:56:00
UNIT 1
1. Explain the TF of armature and field controlled DC motor. 
2. Problem from mechanical translational system(analogy of force- voltage and force- current) 
3. Problem from signal flow graph + block diagram 
Unit 2
1. Explain servomotors and its types 
2. Derive the time response of underdamped and critically damped second order system for unit step input 
3. Derive the expression for time domain specifications 
Unit 3
1. Derive the frequency domain specifications of second order system 
2. Problem from bode plot determining phase margin,gain margin ,determination of k value,gain and phase cross over frequency( any 2 ) 
3. Problem from polar plot (same as bode plot )
4. Explain frequency domain specifications 
Unit-4
1. Explain the locatiuon of poles on s-plane for stability 
2. Problems from routh Hurwitz criterion 
3. Problems to determine gain and phase cross over frequency, gain and phase margin from given TF 
4. Problems from root locus 
Unit – 5
1. Derive the realisation of electrical network, frequency response, determination of maximum phase lag and max. Lag angle for
a) lag compensator 
b) lead compensator  (separate questions)
2. problems from lag compensator or lead compensator
Operating Systems Important Quetions 3-1

Operating Systems Important Quetions 3-1

05:54:00

Image result for operating system important questions jntu


  1.      Explain the various types of computer systems.
  2.    Explain how protection is provided for the hardware resources by the operating system.
  3.    What are the system components of an operating system and explain them?
  4.    What are the various process scheduling concepts?
  5.    Explain about inter process communication.
  6.    List five services provided by an operating system. Explain how each provides convenience to the users. Explain also in which cases it would be impossible for user level programs to provide these services.
  7.    Explain the types of system structure in detail.
  8.    Explain in detail about virtual machines.
9.      Difference between Hard –Real time systems and Soft-RTS.
10.  Describe the functions of OS and its services.
11.  Explain in detail about Operating System Structures.
12.  Explain the Types of System Calls in detail.
13.  Explain System Programs in detail.
14.  Give an overview about threads.
15.  Explain in detail about the threading issues.

Unit-2


1.      Write about the various CPU scheduling algorithms.
2.      What is critical section problem and explain two process solutions and multiple process solutions?
3.      Explain what semaphores are, their usage, implementation given to avoid busy waiting and binary semaphores.
4.      Explain about critical regions and monitors
5.      Consider the following set of processes, with the length of the CPU-burst time given in milliseconds:
Process                 Burst Time     Priority
P1                                10                    3
P2                                1                      1
P3                                2                      3
P4                                1                      4
P5                                5                      2
The processes are assumed to have arrived in the order P1, P2, P3, P4, P5, all at time 0.
a.       Draw four Gantt charts illustrating the execution of these processes using FCFS, SJF, A non preemptive priority
(a smaller priority number implies a higher priority), and RR (quantum = 1) scheduling.
b.      What is the turnaround time of each process for each of the scheduling algorithms in part a?
c.       What is the waiting time of each process for each of the scheduling algorithms in Part a?
d.      Which of the schedules in part a results in the minimal average waiting time (over all processes)?
6.      Explain briefly about Readers/Writers problem in classical synchronization implement using critical section.
7.      What is the use of monitors for resource allocation?
8.      What is the advantage of having different time-quantum sizes at different levels in MFQ-Multilevel Feedback Queue based scheduling.
9.      Consider the following snapshot of a system:
Process           Allocation                   Max                 Available
AB C D                        A B C D           AB C D
P0        0 0 1 2                        0 0 1 2            15 2 0
P1        1 0 0 0                        1 7 5 0
P2        1 3 5 4                        2 3 5 6
P3        0 6 3 2                        0 6 5 2
P4        0 0 1 4                        0 6 5 6
Answer the following questions using the banker’s algorithm:
a.       What is the content of the matrix Need? Is the system in a safe state?
b.      If a request from process P1 arrives for (0, 4, 2, 0), can the request be granted immediately?

10.  Write detailed explanation about Multiprocessor scheduling and Real time scheduling.
11.  Give a detailed description about deadlocks and its
characterization.
12.  Explain about the methods used to prevent deadlocks.
13.  Discuss the methods of Deadlock detection and Recovery.

Unit-3


1.      Explain about contiguous memory allocation.
2.      Give the basic concepts about paging.
3.      Explain about the techniques for structuring the page table.
4.      Explain the basic concepts of segmentation
5.      Given memory partitions of 100KB, 500KB, 200KB, 300KB, and 600KB (in order),how would each of the first-fit, best –fit, worst fit algorithms place processes of 212KB,417KB,112KB, and 426KB(in order). Which algorithm makes the most efficient use of memory?
6.      Explain the various page replacement strategies.
7.      Consider the following page reference string:
1, 2, 3, 4, 2, 1, 5, 6, 2, 1, 2, 3, 7, 6, 3, 2, 1, 2, 3, 6.
Ø  How many page faults would occur for the following replacement algorithms, assuming one, two, three, four, five, six, or seven frames? Remember all frames are initially empty, so your first unique pages will all cost one fault each.
•         LRU replacement
•         FIFO replacement
•         Optimal replacement
8.      How many page faults occur for your algorithm for the following reference string, for four page frames?
1, 2, 3, 4, 5, 3, 4, 1, 6, 7, 8, 7, 8, 9, 7, 8, 9, 5, 4, 5, 4, 2.
a.       What is the minimum number of page faults for an optimal page-replacement strategy for the reference string with four page frames?
9.      What is meant by Virtual memory. Give some major benefits which are make applicable.
10.  Discuss briefly about Paging with Segmentation in 32-bit architecture Intel80x86 Structure analysis.
11.  Discuss about
a) Swapping b) Paging c) Segmentation d) TLB hit/miss


Unit-4



1.      What are files and explain the access methods for files?
2.      Explain the schemes for defining the logical structure of a directory.
3.      Write notes about the protection strategies provided for files
4.      Explain in detail about Linked allocation.
5.      Explain in detail about Indexed allocation.
6.      Write notes about Log-Structured file system.
7.      What are the directory implementation techniques available? Explain in detail.
8.      Explain in detail about various ways of free space management.
9.      Explain in detail about Continuous allocation.
10.  Write notes about file system implementation.
11.  Explain in detail about file system mounting.



Unit-5


1.      Write about the kernel I/O subsystem.
2.      Explain the various disk scheduling techniques
3.      Write notes about disk management.
4.      Suppose that a disk drive has 5000 cylinders, numbered 0 to 4999. The drive is currently serving a request at cylinder 143, and the previous request was at cylinder 125. The queue of pending requests, in FIFO order, is
86, 1470, 913, 1774, 948, 1509, 1022, 1750, 130
Starting from the current head position, what is the total distance ((in cylinders) that the disk arm moves to satisfy all the pending requests, for each of the following disk scheduling
a. FCFS
b. SSTF
c. SCAN
d. LOOK
e. C-SCAN

5.      What is meant by RAID levels? Which level is used for what purpose?
6.      Analyze Disk arm movement reduced when/which one is effective for given
Queue=87, 170, 40, 150, 36, 72, 66, 15
Starting point of current head is 60.

7.      Explain in detail about stable storage and tertiary storage implementation.
8.      Write notes on disk attachment.
9.      Explain about swap-space management.
10.  How does DMA increase system concurrency? How does it complicate the hardware design?
11.  Write notes on STREAMS.

Subscribe to: Posts (Atom)