Padeepz

CCS356 Object Oriented Software Engineering Important Questions

Part A

1. What is Software Engineering?
2. State few differences between traditional and agile software development.
3. How do you differentiate Functional Requirements and Non-Functional Requirements?
4. What is the use of Data Flow Diagrams?
5. List any 4 Software Design Patterns.
6. What is a Publish Subscribe model in Software Design?
7. Write the steps for debugging.
8. Define Regression Testing.
9. List any tools for Quality control in Project Management.
10. What are the testing tools available in DevOps software practice?

Part B

1. Explain in brief about the Extreme Programming process with a neat diagram.

2.  Illustrate an overview of Object-oriented Software Engineering Development Activities and their products.

3.  Summarize on Petrinets with a suitable use case of your choice,

4.  Illustrate the Interaction diagrams for Online Electric Vehicle Purchase System.

5.  Distinguish between Coupling and Cohesion using a suitable scenario.

6.  Summarize on the various Architectural styles in Software Design.

7. Explain in detail about the criterion for completion of software testing.

8. Compare Black box testing and White box testing with a Banking Application.

9. Summarize the motivation behind adopting DevOps in Software Engineering.

10.  Demonstrate the application of Cloud as a platform in Project Management through an appropriate illustration.

CS3451 Introduction to Operating Systems Important Questions

Unit 1

1. What is the main difficulty that a programmer must overcome in writing an operating system for a real-time Environment?
2. Describe three general methods for passing parameters to the operating system.
3. Consider a computing cluster consisting of two nodes running a database. Describe two ways in which the cluster software can manage access to the data on the disk. Discuss the benefits and disadvantages of each.
4. List five services provided by an operating system, and explain how each creates convenience for users. In which cases would it be impossible for user-level programs to provide these services? Explain your answer.
5. List down the objectives and functions of Operating Systems.
6. Detail the various types of user interfaces supported by Operating Systems.
7. Explain various structures of Operating System.
8. Explain the purpose and importance of system calls in detail with examples.

Unit 2

1. Describe how processes are created and terminated in an operating system.
2. Give an example of a situation in which ordinary pipes are more suitable than named pipes and an example of a situation in which named pipes are more suitable than ordinary pipes.
3. Consider the following set of processes, with the length of the CPU burst time given in milliseconds. 
   

    i) Draw Gantt’s Chart illustrating the execution of these processes using FCFS, SJF and Round Robin (with quantum = 1) scheduling techniques.
   (ii) Find the Turnaround time and waiting time of each process using the above technique.

4. Describe how deadlock is possible with the dining-philosopher’s problem.
5. What are semaphores? How do they implement mutual exclusion?
6.  Explain the techniques used to prevent deadlocks.

Unit 3 

1. Explain the difference between internal and external fragmentation.
2. On a system with paging, a process cannot access memory that it does not own. Why? How could the operating system allow access to additional memory? Why should it or should it not?
3. Illustrate how pages are loaded into memory using demand paging.
4. Under what circumstances do page faults occur? Describe the actions taken by the operating system when a page fault occurs.
5. Explain the need and concept of paging technique in memory management.
6.  Consider the page reference string: 1 2 3 4 1 3 0 124 1 and 3 page frames. Find the page faults, hit ratio and miss ratio using FIFO, optimal page replacement and LRU schemes.

Unit 4

1. Write detailed notes on file system interface and file system structure.
2. 
   

   

3. Is disk scheduling, other than FCFS scheduling, useful in a single-user environment? Explain your answer.
4. Describe three circumstances under which blocking I/O should be used. Describe three circumstances under which nonblocking I/O should be used.
5. Consider a file system in which a file can be deleted and its disk space reclaimed while links to that file still exist. What problems may occur if a new file is created in the same storage area or with the same absolute path name? How can these problems be avoided?
6. Contrast the performance of the three techniques for allocating disk blocks (contiguous, linked, and indexed) for both sequential and random file access.

Unit 5

1. Describe four virtualization-like execution environments, and explain how they differ from “true” virtualization.
2. Why are VMMs unable to implement trap-and-emulate-based virtualization on some CPUs? Lacking the ability to trap and emulate, what method can a VMM use to implement virtualization?
3. Describe the three types of traditional hypervisors.
4.  Discuss about the mobile operating system with suitable example.
5. Explain various types of virtual nachines and their implementations in detail.
6. Explain the architecture of Android OS.
7. Compare iOS with Android OS.

CS3401 Algorithms Important Questions

Unit 1

1. Explain in detail about various asymptotic notations and it’s properties.
2. Use substitution method to show that T(n)=2T(n/2)+n is O(nlog(n)).
3. With a suitable example, illustrate the time and space complexity analysis of binary search and linear search.
4. Explain the working of naïve string matching algorithm with ABCCDDAEFG as the text input and CDD as the search string.
5. Write the asymptotic notations used for best case, average case and worst case analysis of algorithms. Also write an algorithm of finding maximum element of an array and perform best, worst and average case complexity with appropriate order notations.
6. Write and explain naïve string mating algorithm.
7. Suppose T=1011101110 and p=111. Find all valid ships.
8. Write an algorithm to perform linear search on an array of ‘N’ numbers. Illustrate the best case, average case and worst case complexity of the linear search algorithm with an example.
9. What is pattern searching? Outline the steps in the Rabin-Karp algorithm for pattern searching with an example.

Unit 2

1. Write the pseudocode for BFS and DFS traversals on the graph given below in fig. 12 (a) (i) and compare the time and space complexity of the two traversals. 
   

   

2. Find the Minimum Spanning Tree of the following graph in fig. 12 (a) (ii) using Kruskal’s algorithm.  
   

   

3. Given a graph and a source vertex in the graph, find the shortest paths from the source vertex 0 to all vertices in the given graph 12 (b) (i). 
   

   

4. Using Ford-Fulkerson algorithm find the maximum possible flow in (5) the network given below Fig 12 (b) (ii).
   

   

5. Write and explain the pseudo code for breadth first search and discuss its time complexity.
6. Write and explain the pseudo code for Floyd Warshall algorithm and write its time complexity.
7.  Outline the breadth first search graph traversal algorithm and depth first search graph traversal algorithm with an example.
8.  Explain the Dijkstra’s shortest path algorithm with an example.

Unit 3

1.  Demonstrate divide and conquer approach by Performing quick sort on the following values. 44, 33, 11, 55, 77, 90, 40, 60, 99, 22, 88
2. Using Dynamic programming, Solve matrix chain multiplication problem.
3. Solve the following problem using Greedy algorithm. Given activities with their start and finish times, select the maximum number of activities that can be performed by a single person, assuming that a person can only work on a single activity at a time.
4. Explain in detail about merge sort. Illustrate the algorithm with a numeric example and provide complete analysis of merge sort algorithm.
5. Explain the dynamic programming approach of matrix multiplication with an example.
6.  Outline the merge sort algorithm with an example.
7. What is a Huffman tree? Outline the steps to build a Huffman tree using greedy algorithm design paradigm with an example.

Unit 4

1. Explain the steps in solving n-queens problem using backtracking approach.
2. Solve the following subset sum problem using back tracking. Let S (3,7,9,13,26,41); d(sum)=51.
3. Discuss briefly about the general method of branch and Bound approach and state how it differs from backtracking.
4. Write down the steps to solve subset sum problem using backtracking approach explain with an example.
5. Write down the steps to solve Travelling Salesperson problem using branch and bound approach. Explain with an example.
6. State the Hamiltonian circuit problem. Outline the steps to find the Hamiltonian circuit using backtracking algorithm design paradigm with an example.
7. State the Knapsack problem. Outline how Knapsack problem can be solved using branch and bound algorithm design paradigm with an example.

Unit 5

1. Show that if an algorithm makes atmost a constant number of calls to polynomial time subroutines and performs an additional amount of work that also takes polynomial time, then it runs in polynomial time.
2. Show that the satisfiability of Boolean formulas in 3-conjunctive normal form (3- CNF) is NP-complete.
3. Illustrate polynomial-time approximation scheme for the sum of subsets problem.
4.  Illustrate the working of Miller-Rabin randomized primality test.
5.  Write short notes on the following:
   (i) NP algorithms
   (ii) NP Hardness
   (iii) NP-Completeness
6.  Elaborate NP-complete problem and NP-hard problem with an example.
7. Outline the randomized quick sort algorithm with an example.

CS3492 Database Management Systems

Important Questions

Unit 1

1. What is datamodel? List its different types. Explain with suitable example.
2. Discuss about domain integrity. Give an example.
3.  Discuss the main categories of data models. What are the basic differences between the relational model, the object model, and the XML model?
4. Describe the three-schema architecture. Why do we need mappings between schema levels? How do different schema definition languages. support this architecture?
5. Explain the database management system architecture with a neat sketch.
6. Outline select and project operations in relational algebra with an example.
7. What is embedded SQL? Explain with an example.

Unit 2

1. What is normalizations? List its benefits and explain briefly about 3NF, 4NF and BCNF with suitable example.
2. Illustrate functional dependency with an example.
3. Discuss about dependency preservation.
4. Consider the following schemas. The primary key for each relation is denoted by the underlined attribute.
   LIVES (person-name, street, city)
   WORKS (person-name, company-name, salary)
   LOCATED-IN (company-name, city)
   MANAGES (person-name, manager-name)
   Write relational algebra expressions for the following queries:
   (i) Find the name of all employees (i.e., persons) who work for the City Bank company (which is a specific company in the database).
   (ii) Find the name and city of all employees who work for City Bank.
   (iii) Find the name, Street and city of all employees who work for City Bank and earn more than $10,000.
   (iv) Find all employees who live in the same city as the company they work for.
   (v) Find all persons who do not work for City Bank.
   (vi) Find the second largest salary earned by the employee.
5. Elaborate on first normal form, second normal form and third normal form with examples.
6. Explain Boyce Codd normal form, fourth normal form and fifth normal form with examples.
7. Consider the relation for car dealership given below.
   Dealership (Uniqueid, Customer-name, Purchase, Address, Newsfeed, Supplier, Price)
   Normalize the table so that all resulting tables are in 3NF stating the definitions of various normal forms.

Unit 3

1. Demonstrate conflict serializability and view serializability.
2. Discuss in detail about Multiple Granularity.
3. Explain different types of locks.
4. Explain the concepts of serial, non-serial and conflict-serializable schedules with examples.
5. What is the two-phase locking protocol? How does it guarantee serializability? Explain with an example.
6. What is a transaction? List and explain ACID properties with an example.
7. Outline the two phase locking protocol with an example.
8. What is recovery? Outline the steps in the Algorithm for Recovery and Isolation Exploiting Semantics (ARIES) algorithm with an example.

Unit 4 

1. Explain B+ trees. Discuss about this Dynamic Index Structure.
2. Compare I/O costs for all File Organizations.
3. Construct a B+- tree for the following set of key values:
   (2,3,5,7,11, 17, 19, 23, 29, 31)
   (i) Assume that the tree is initially empty and values are added in ascending order, Construct B+ trees for the cases where the number of pointers that will fit in one node is as follows:
   (1) Four
   (2) Six
   (3) Eight
   (ii ) Show the form of the tree after each of the following series of operations
   (1) Insert 9
   (2) Insert 10
   (3) Delete 23
   (4) Delete 19
4. Brief on Static and Dynamic Hashing.
5. Suppose that we are using extendable hashing on a file that contains records with the following search-key values:
   (2,3,5,7,11,17,19,23,29,31)
   Show the extendable hash structure for this file if the hash function. is h(x) = x mod 8 and buckets can hold three records.
6. Outline B tree index and B+ tree index with an example.
7. Explain static hashing with an example.

Unit 5 

1. Explain distributed database architecture in detail.
2. Explain in detail about key value stores and role based access control in advanced database management systems.
3. Describe in detail Query Processing and Optimization.
4. Discuss on the following.
   (i) Access control based on privileges
   (ii) Role Based access control
5. What is a distributed transaction? Explain distributed query processing with an example.
6. What is NoSQL? Outline the features of NoSQL databases.
7. Discuss role based access control with an example.

CS3491 Artificial Intelligence and Machine Learning Important Questions

Unit 1 Part B

1. Differentiate Blind Search and Heuristic Search.
2. Explain characteristics of intelligent agents.
3. Explain iterative deepening search algorithm with an example.
4. Discuss in detail about hill climbing algorithm by using 8-queens problem.
5. Outline the uniformed search strategies like breadth-first search and depth-first search with examples.
6. State the constraint satisfaction problem. Outline local search for constraint satisfaction problem with an example.

Unit 2 Part B

1. Consider the following set of propositions:
   Patient has spots
   Patient has measles
   Patient has high fever
   Patient has Rocky mountain spotted fever.
   Patient has previously been inoculated against measles.
   Patient was recently bitten by a tick
   Patient has an allergy.
2. Create a network that defines the casual connections among these nodes.
3. Make it a Bayesian network by constructing the necessary conditional probability matrix.
4. Demonstrate the use of Bayes’ rule with an example in a doctor finding the probability P (disease / symptoms) before and after the decease becomes epidemic.
5. Briefly explain about how the sustainability of enumeration algorithm can be improved.
6. Elaborate on unconditional probability and conditional probability with an example.
7. What is a Bayesian network? Explain the steps followed to Neonloutant ausconstruct a Bayesian network with an example.
8. What do you mean by inference in Bayesian networks? Outline inference by enumeration with an example.
9. Construct a Bayesian Network and define the necessary CPTs for the given scenario. We have a bag of three biased coins a, b and c with probabilities of coming up heads of 20%, 60% and 80% respectively. One coin is drawn randomly from the bag (with equal likelihood of drawing each of the three coins) and then the coin is flipped three times to generate the outcomes X1, X2 and X3.
   (i) Draw a Bayesian network corresponding to this setup and define the relevant CPTs.
   (ii) Calculate which coin is most likely to have been drawn if the flips come up HHT.

Unit 3 Part B

1. State when and why you would use random forests vs SVM?
2. Explain the principle of the gradient descent algorithm. Accompany your explanation with a diagram.
3. Describe the general procedure of random forest algorithm.
4. With a suitable example explain knowledge extraction in detail.
5. Elaborate on logistics regression with an example. Explain the process of computing coefficients.
6. What is a classification tree? Explain the steps to construct a classification tree. List and explain about the different procedures used.

Unit 4 Part B

1. Explain various learning techniques involved in unsupervised learning.
2. List the applications of clustering and identify advantages and disadvantages of clustering algorithms.
3. Assume an image has pixel size 240 x 180. Elaborate how K means clustering can be used to achieve lossy data compression of that image.
4. Explain in detail about combining multiple classifiers by voting.
5. What is bagging and boosting? Give example.
6. Outline the steps in the AdaBoost algorithm with an example.
7. Elaborate on the steps in expectation-maximization algorithm.

Unit 5 Part B

1. Draw the architecture of a single layer perceptron (SLP) and explain its operation. Mention its advantages and disadvantages.
2. How do you tune hyperparameters for better neural network performance? Explain in detail.
3. Elaborate the process of training hidden layers by ReLU in deep networks.
4. Briefly explain hints and the different ways it can be used.
5.  Explain the steps in the back propagation learning algorithm. What is the importance of it in designing neural networks?
6. Explain a deep feedforward network with a neat sketch.

CS3452 Theory of Computation

Important Questions

Unit 1 Part B

1. Prove that the statement “if n ≥ 5, then n can be written as a sum of 2’s and 3’s” by inductive principle.
2. Construct a DFA that accepts the string over an alphabet (0,1}, number of O’s is multiples of 3.
3. Prove that the language L is accepted by NFA with 6-transition, then there exist DFA also accept the same language L. 
   

   

4. Construct a DFA for the following Language and check whether w=^ prime 1101′ is a valid string or NOT.
   L(G)=\ w| w \in (0, 1) and w starts with 0 and has odd length or it starts with 1 and has even length).
5. Explain the DFA minimization algorithm with an example.
6. Construct NFA accepting the set of strings Sigma = \{0, 1\} such that two O’s are separated by a string whose length is 4i, for some i >= 0
7. Prove that for every L recognized by an NFA, there exists an equivalent DFA accepting the same language L.

Unit 2 Part B

1. From Fig. 12(a), find the regular expression for the following DFA. 
   

   

2. Construct an NFA for the regular expression (01+10)* 10*.
3. Show that the language L = {0*12 | n > 0} is not regular.
4. Prove if L and M are regular language, then so is L-M.
5. Prove that the set of regular languages is closed under complementation. (i.e., If L a regular language then L’ is also a regular language). Give an example.
6. How to determine in two Regular Expressions are equivalent or NOT? Are (a*) and (c + aa*) equivalent wrt. ∑ = {a,b}?
7. Prove that regular expressions are closed under union, concatenation, Kleene closure, complement.
8. Prove that any language accepted by a DFA can be represented by a regular expression and also construct a finite automata for the regular expression 10+(0+11)0*1.

Unit 3 Part B

1. Construct a PDA that accept the L = abcd / n, m ≥ 1) by empty stack.
2. Prove that if PDA P is constructed from CFG G, then L(P) L(G).
3. Grammar G / S →S1S|0 Is this grammar G is ambiguous? Justify.
4. Construct a CFG for the language given below.
   L(G) = {w\we (a,b) and w is an odd length palindrome). Also check whether w ‘babab’ is a valid string or not.
5. Construct an empty store Push Down Automata (PDA) for the below mentioned language:
   L(G) = {wiwe (a,b)} and w is of the form a”b” and n≥1). Also mention the state transitions of this PDA while parsing the string w = ‘aaabbb’.
6. Design a PDA that will accepts strings (a+b)* in which the number of a’s is greater than the number of b’s given the alphabet Σ={a,b}.
7. Convert the above PDA to its equivalent CFG.

Unit 4 Part B

1. Prove that L=\ a ^ n | n is perfect square) is not context free.
2. Design a Turing Machine to compute
   f(m, n) = m – n, ifm >= n
   = 0 , if m < n
3. Explain the programming techniques for Turing Machine
4. Demonstrate the working model of to perform proper subtraction.
5. Construct a Turing machine to accept the following language.
   L(G) = {w/we (0,1) and wis of the form 0″1″ where n≥1}
6. Convert the following grammar to CNF (7)
   S → ASB |ε             A→aAS |a
   B→SbS| A|bb
7. Design a Turing machine to compute proper subtraction.

Unit 5 Part B

1. Show that 3-CNF SAT is NP complete.
2. Find the following languages are recursively enumerable.
   (i) Union of recursively enumerable languages.
   (ii) L and complement of L are recursively enumerable.
3. Give short notes on Recursive and Recursive Enumerable languages.
4. Explain the philosophy behind Travelling salesman problem (TSP). Analyze the computational complexity for the same. Show how the decision version of the TSP belongs to the class of NP-Complete problem.
5. Prove that Post Correspondence Problem is undecidable.
6. Write short notes on P and NP completeness.
7. Explain about Universal Turing Machine.
8. Discuss Travelling Salesman Problem in terms of P and NP completeness.

CS3251 Programming in C

Important Questions

Unit 1 Part B

1. Discuss the structure of C program in detail and explain with simple hello world program.
2. Explain the terms variables and constants. How many types of variables are supported by C.
3. What is purpose of Decision Control Statements in C? Explain any two of such types with the general form of simple statements.
4. What are the functionalities of Preprocessor and Compiler? Explain with a simple example.
5. Elaborate the various Data types in C with suitable examples
6. Find the output of the following C code. Discuss the steps of execution.  for(i=1,j=1; i<=10; ++i, ++j) {
   if ( i ==3 { continue;}
   else {
   if ( j ==4) {break;} tree.
   else {
   printf(“\ I am in loop, the values of I and J are: %d, %d”, i,j);
   }
   }
   }
7. Write a C program to get age and vaccination detail as input. Print “Senior Citizen and Eligible for Booster” if age > 60 and vaccination input as ‘2’. Otherwise print “Below 60, and Eligible for Vaccination”. Use Conditional Operator.
8. Is it possible to convert ‘if-else’ ladder to ‘switch…..case’ statement? If yes, illustrate with an example. If no, justify the reason
9. Explain the various data types being supported by C language.
10. Explain about the various looping statements available in ‘C’ with appropriate sample programs.

Unit 2 Part B

1. Compare one dimensional and two dimensional array. Explain the use of multi-dimensional arrays with syntax and example.
2. Explain the four string functions with suitable examples.
3. Write an algorithm to sort an array of integers in ascending order using selection sort and find its time complexity.
4. Write a simple binary search program using an iterative method.
5. Write the string handling function used to do the following.
   If first name, last name and middle name are given as input, display it as full name.
   Display the number of characters in full name.
   Convert the first name into capital letters and last name into small letters.
   Print the full name in reverse order.
6. In a restaurant, the tables are arranged in a room row-wise order. A waiter is assigned to serve food for each row. Write a C program to find the highest bill served by each waiter.

Unit 3 Part B

1. Write different types of functions with respect to return type arguments and explain all types with syntax and example.
2. Explain the header file that contains various methods for performing mathematical operations.
3. Discuss call by value and call by reference with some simple program.
4. What is a recursive function? Write a simple binary search algorithm using recursive functions.
5. Write a C program to create two 2D arrays using array of pointers. First 2D array consists of a list of employee names and the second 2D array consists of their designation. Your code should display the designation when name is entered.
6. Give an example for a function that receives parameters and returns no value.
7. Create an array of lucky ticket numbers announced for prize bonanza. Get a ticket number and check it for prize and display the result. Use pointer to array concept.
8. Differentiate between ‘Pass by value’ and ‘Pass by reference’ with an example.

Unit 4 Part B

1. Give an example for the following:
   (1)Nested structure
   (2) Self-referential structure
2. List the operations on Linked list. Explain insertion at end and deletion at beginning of a Singly linked list.
3. Distinguish between calloc() and malloc() functions.
4. Explain in detail about the dynamic memory allocation process and list memory allocation/deallocation functions.
5. Discuss the concepts, advantages of self-referential structures and its types and explain with an example program.
6. Explain the need for nested structures with appropriate example program.
7. Can a linked list grow dynamically? Justify your answer with example C program.
8. With suitable diagram, explain the concept of singly linked list.
9. Enumerate the difference between structure and union with example.

Unit 5 Part B

1. How does random accessing of files are done in C language? Explain in detail.
2. What is the purpose of the variables arge and argv of command line arguments in C language? Explain with a sample program.
3. Write a C program to create a binary file in C named “application.txt” that has the data such as citizen name, aadhar number, pan number, employment, gender and age. Filter the application by analyzing the gender and employment and move all the male applicants who are self-employed into another file called “reject.txt”. Assume minimum 10 candidates.
4. What is File Organization? Explain its types with pros and cons.
5. What is a File and list any five operations that can be performed on a file.
6. What are command line arguments in C? Explain with a suitable program.
7. When to use fread() and fwrite() functions in file processing?
8. List down the modes in which a C file can be opened. Specify the purpose of each mode.

BE3251 Basic Electrical and Electronics Engineering

Important Questions

Unit 1 Part B

1. State and explain Kirchhoff’s voltage law.
2. Calculate the loop currents I_{1} and I_{2} for the circuit shown in Fig.11(a)(i) using mesh analysis. 
   

   

3. Derive the expression for RMS value of an alternating quantity.
4. A series circuit has R = 10Omega L = 50mH and C = 100mu*F and is supplied with 200 V, 50 Hz. Find
   (1) impedance
   (2) current
   (3) power
   (4) power factor
   (5) voltage drop across the each element.
5. Find the current in the 30 resistor in the network shown in fig. 11(a)(i) 
   

   

6. A sinusoidal voltage V = 200 sin 814t is applied to a 10 resistor. Find (1) frequency (2) rms voltage, (3) rms current and (4) power dissipated as heat.
7. Using mesh analysis, determine the current and potential difference across each resistor in the given circuit. The battery has 90 V and the current source 5A. 
   

   

8. Discuss about the working of RLC series circuit and derive the relationships. Give the necessary phasor Diagrams.
   

Unit 2 Part B

1. Derive the E.M.F equation of DC generator.
2. Describe the working principle of DC motor with neat sketch.
3. Explain the construction and principle of operation of three phase induction motor.
4. Assuming necessary parameters, derive the induced E.M.F. equation of a DC generator.
5. Explain the armature resistance speed control of DC shunt motor with a diagram.
6. A transformer has 600 turns of the primary winding and 20 turns of the secondary winding. Determine (1) the secondary voltage if the primary voltage is 140 V with the secondary open. (2) the primary current if the secondary current is 90 A.
7. Compare squirrel cage and slip ring induction motors in detail.
8. Describe the principle of working of DC motor.
9. Describe about the construction of core type and shell type single phase transformers.

Unit 3 Part B

1. Describe the working of a PN junction diode with neat diagram. Also explain its V-I characteristics.
2. Explain with a neat sketch the construction and working characteristics of IGBT.
3. Design a circuit to convert an AC voltage into a DC voltage with a diode full wave bridge circuit and draw the resultant rectified wave form.
4. Explain the operation of BJT in common emitter mode with its characteristics.
5. Describe the working of bridge rectifier. Derive its ripple factor.

Unit 4 Part B

1. Design and explain the working of Gray to BCD converter.
2. Convert 95.062510 binary.
3. Express the function Y=A+B’C in
   (i) canonical SOP and
   (ii) canonical POS form.
4. Explain different error detection technique and error correction codes in detail.
5. Differentiate SOP and POS in Digital Logic.
6. Minimize the expression
   YAB’C+A’B’C + A’ BC + AB’C’+A’ B’C’ Using K-Map
7. Explain about the error detection and correction codes.
8. Simplify the Boolean function, f(W,X,Y,Z)=WX’Y’+WY+W’YZ’ using K-map.

Unit 5 Part B

1. Explain the construction and operation of moving iron attraction type instrument.
2. Describe with the help of block diagram the working of a typical
   DSO.
3. Explain the two wattmeter method of three phase power measurement with a sketch.
4. Describe working of a PMMC meter and its use in measurements.
5. Describe the functional components of DSO with a block
   diagram.
6. Compare current transformer with potential transformers.
7. Describe the construction, working principle of PMMC instruments. Also derive the torque equation.
8. Describe the method to measure three phase power by two wattmeter method.

PH3256 Physics for Information Science

Important Questions

Unit 1 Part B

1. What are the postulates of free electron theory? Derive an expression for electrical conductivity based on free electron theory.
2. What is meant by effective mass of an electron? Derive an expression for the effective mass of an electron?
3. Write a short note on Fermi dirac distribution.
4. Derive an expression for energy eigen value and eigen function for a particle moving in the potential V(x)=0 for 0<x<a and V(x)=∞ for 0>x>a.
5. Extend the above eigen value and eigen function for a particle in three dimensional rectangular box and discuss the degenerate states of the particle.
6. Derive an expression for the density of states.
7. Describe the classical free electron theory to obtain an expression for electrical and thermal conductivity and deduce Lorentz number.

Unit 2 Part B

1. Derive an expression for density of electrons in the conduction band of an N-type and density of holes in the valence of P-type extrinsic semiconductor.
2. Derive an expression for Hall coefficient and describe the experimental setup for the measurement of Hall coefficient.
3. Derive an expression of electron concentration in the conduction band of an n-type extrinsic semiconductor.
4. Explain with a neat sketch, the variation of Fermi level with temperature in an n-type semiconductor.
5. Explain in detail
   (i) Schottky diode
   (ii) Ohmic contacts.
6. Derive an expression for the number of density of holes in an intrinsic semiconductor.
7. Explain direct and indirect bandgap semiconductors.
8. What is a hall effect? Derive an expression for hall coefficient. Describe an experiment for the measurement of the hall coefficient.
9. Find the hall voltage in a Si dopedwith 10²³ phosphor atoms m^-3. The Si sample is 100 µm thick with a current flow of 1 mA for a magnetic field of 10-5 Wb cm

Unit 3 Part B

1. Distinguish between Ferro, antiferro and ferrimagnetism materials. Give some examples for each type.
2. Explain the different contributions for the formation of domains in a ferro magnetic material and show how the hysteresis curve is explained on the basis of the domain theory.
3. Explain the magnetic principle in computer data storage
4. Differentiate between hard and soft magnetic materials.
5. Explain in detail about the domain theory of ferromagnetism.
6. Discuss in detail about the classification of magnetic materials.

Unit 4 Part B

1. Explain with a neat sketch the construction, working and V-I characteristics of solar cell.
2. Mention the applications of solar cells.
3. Explain with a neat sketch the basic principle, working and the advantage of LED.
4. Calculate the wavelength of light emitted by an LED with band gap of energy 1.8 eV.
5. Explain carrier generation and recombination in semiconductor.
6. Describe the construction and working of a photo diode.
7. Describe the construction and working of a solar cell.
8. Explain the absorption and emission of light in metal, insulator and semiconductor.
9. Describe the construction and working of a LED with energy band diagram.

Unit 5 Part B

• Explain Quantum confinement in quantum wells, wires and dots.
• Explain the principle and working of single electron transistor.
• Explain the importance of quantum system for information processing.
• Explain the advantage of quantum computing over classical computing.
• Explain quantum confinement and quantum structures in nano materials.
• Explain in detail about Bloch sphere.
• Distinguish between Classical and quantum computing.
• Explain coulomb blockade effect and single electron phenomena.

AG3601 Engineering Geology

Important Questions

Part B

1. Classify the internal structures of the earth and its composition
2. Discuss in detail about the movement and role of ground water in the civil engineering constructions.
3. Describe the various physical properties of the minerals with suitable examples.
4. Elucidate the physical properties, chemical composition and uses of feldspar family of minerals.
5. Describe with the help of neat sketches, the various parts of fold and its types.
6. Discuss in detail about the geological strength index and its importance.
7. Explain in detail the working principles of ground penetrating radar (GPR) and its applications.
8. Give an elaborate account on geophysical investigation of electrical resistivity method. And how to identify the subsurface stratum?
9. Discuss the various causes, classification and mitigation of landslides.
10. Describe the geological investigation pertaining to the construction of tunnels.