III B.Tech(CSE & IT) I SEMSTER I MID EXAMINATION SEP-2010 DATA COMMUNICATION SYSTEMS

1.     Explain the different types of network topologies

2.     Explain briefly about OSI model

3.     Explain the terms Information capacity, bit rate, baud & M-ary encoding

4.     Explain analog and digital modulation schemes

5.     Explain different types of  metallic transmission lines

6.     Write a short notes on optical fiber cable losses

7.     Briefly explain about optical fiber modes

8.     Explain about light sources and light detectors

9.     Write short notes on pulse modulation and dynamic range.

10.Define companding and explain digital companding with encoding and decoding tables.

11.Define multiplexing and briefly explain about T1 digital carrier system.

12.Explain about AT&T’S FDM Hierarchy.

13.Explain the given below a).Refraction b).Reflection c).Diffraction d). Interference

14.Explain about the given propagation techniques a).Ground wave propagation b).Space wave propagation c).Sky wave propagation

15.Explain the different types of satellite multiple access techniques.

16.Define a).Attenuation b).Absorption c).Skip distance

Read more »

III B.Tech(CSE & IT) I SEMSTER I MID EXAMINATION SEP-2010 SOFTWARE TESTING METHODOLOGIES

1. Discuss how software testing will ensure the quality of a developed software.
2. Discuss in detail how the consequences of bugs are measured?

      4 .  Discuss the following terms in detail

(a) Predicates

(b) Path predicates

(c) Achievable paths

5. What is meant by path sensitization? Discuss clearly the heuristic             

       procedure for sensitizing paths.

       6.  Discuss the integration testing issue on path testing for Multi-Entry /                             

       Multi-Exit routines.

  7 .  Explain with a suitable example how to convert a Multi-Entry routine to an

                 equivalent single entry routine.

      8    What are the transaction flows? Discuss their complications.

      9    What is meant by Data-flow testing? Discuss its significance.

10      What is meant by domain testing? Discuss various applications of  domain      

Testing

11      With a neat diagram, explain the schematic representation of domain

            testing.

      12   Discuss the following strategies of data flow testing with suitable

       examples:

        i. All-predicate-uses(APU) strategy

       ii. All-computational (ACU) strategy

13     What is meant by statement testing and branch testing? Give suitable

examples.

14    State and explain various path selection rules for path testing.

15    What are the different kinds of loops?

16     Define testing and explain the purpose of testing.

Read more »

III B.Tech(CSE & IT) I SEMSTER I MID EXAMINATION SEP-2010 MICROPROCESSOR AND INTERFACING

1)      What are the different control signals necessary for I/O read and write cycles? Show how these control signals are generated in minimum and maximum modes of 8086.

2)      Why 8086 microprocessor is mapped into 2 byte wide banks? What logic levels are found with BHE and A₀ when 8086 writes a byte into address 0F0410H?

3)      What are the control flags in 8086? Discuss their use.

4)      What is the difference between physical address,effective address and offset address? Explain with example how physical address is generated.

5)      What is the purpose of ALE,BHE,DT/R and DEN pins of 8086? Show their timing in the system bus cycle of 8086?

6)      What are the segmentation registers in 8086? Discuss the purpose of extra segment.

7)      Compare flag registers of 8086 and 8085.

8)      Draw and explain the registers organization of 8086.

9)      Write an ALP to sort the set of given no.’s in Descending order

10)  Write an ALP to find the average of two numbers.

11)  Write an ALP to multiply 16 bit unsigned no. by an 8 bit unsigned no.

12)  Write an ALP to find the sum of given 10 no.s’

13)  Explain the pin configuration of 8255 and also explain the I/O modes of operation of 8255.

14)  Explain the priorities of DMA requests and explain the interfacing of 8257 with 8086.

15)  Discuss in detail the mode control word format of 8257. Explain about each bit representation.

16)  Discuss about the following control words of 8255. a) Mode set control word. b) BSR mode.

Read more »

FORMAL LANGUAGE AUTOMATA THEORY

1. Write the steps for construction of minimization of automaton?
2.  Show that L = { WW / W є { a ,b}*} is not regular?
3. Construct   FA  which can accept strings over an alphabet a,b…….containing       either cat  or rat?
4. Show that there exist no FA accepts all palindromes over { a , b }?
5. Define DFA & NFA with example?
6. Construct FA the set of all strings containing substring 101?
7. Write the steps to convert NFA to DFA?
8. Explain about FA with output?
9. Construct FA the set of all strings contains even no of 0’s & 1’s over {0,1}?
10. Construct NFA for (11+0)*(00+1)*?
11.  Construct DFA for ternary number is divisible by 5?
12.  Construct FA from the given grammar

       S -> aS / bS / aA

             A -> bB

       B -> aC

             C -> A

13. Design a DFA for the following language L={0ª1^b / a>=0 & b>=1}?
14. Design a Moore machine to determine the residue mod 4 for each binary string treated as integer
15. Design a mealy machine that uses its state to remember the last symbol read and emits output y whenever current input matches to previous one, and emits n otherwise?
16. For the following NFA with є moves to without є moves?

Read more »

DESIGN ANALAYSIS OF ALOGRITHMS

1. What do you mean by Algorithm? List some of the properties of it.
2. Describe the performance analysis in detail.
3. Define time complexity and describe different notations used to represent their complexities.
4. Define theta notation. Explain the terms involved in it.Give an Example.
5. Explain DFS algorithm with an example.
6. Write an algorithm of biconnected components.
7. Explain the inorder traversal of a tree with an example.
8. Define biconnected components and Articulation point with an example
9. Write and explain the divide-and-conquer merge sort algorithm and also compute its time complexity.
10. Explain the strassen’s matrix multiplication concept with an example.
11. Write and explain the quick-sort algorithm with an example.
12. Write and explain the binary search with an example.

13. What is spanning tree? Explain the prim’s algorithm.

14. What is spanning tree? Explain the kruskal’s algorithm.

15. Write and explain the control abstraction for greedy method.

16. Write greedy algorithm to generate the shortest path.

Read more »

III B.Tech(CSE & IT) I SEMSTER I MID EXAMINATION SEP-2010 COMPUTER GRAPHICS

1. Explain about CRT device? Explain the role in graphical display?
2. What is the working of plasma panel and LCD?
3. Describe all input devices?
4. What is Computer Graphics? Explain the users and applications of CG?
5. Bresenham’s line drawing algorithm?
6. Explain scan Line algorithm?
7.  Mid point circle drawing algorithm?
8. What is inside test? Explain flood fill algorithm?
9. Explain translation and scaling?
10. Explain rotation and shear transformation?
11. Give a brief on composite transformation?
12. What is mean by homogeneous co-ordination? What is it’s significant?
13. Explain Cohen Sutherland line clipping algorithm?
14. Describe Hodgeman polygon clipping algorithm?
15. Give a brief on mid point sub division algorithm?
16. What is clipping? Describe point clipping and line clipping?

Read more »