KTU Online Placement Cell Registration
register now
Showing posts with label S6 QUESTION CS. Show all posts
Showing posts with label S6 QUESTION CS. Show all posts

Friday, April 20, 2018

KTU B.Tech S6 Model Questions Mobile Computing[Elective] Computer Science

Model question paper

Seventh Semester B Tech Degree Examination

13.705.3 MOBILE COMPUTING (Elective I) (F)

Time : 3 Hours Marks : 100


Answer all questions. Each question carries 4 marks

1. List and explain GSM services.
2. What are the benefits of Spread Spectrum Systems?
3. Compare between IEEE 801.11 and HiperLAN2.
4. Explain agent advertisement in Mobile IP.
5. Why has a scripting language been added to WML? How can this language
help saving bandwidth and reducing delay ?


Answer any one question from each module. Each question carries 20 marks.

Module 1

6 a) Explain differences between GSM, GPRS and UMTS. (10)
b) Draw a neat diagram of GSM architecture and explain with details of
various types of interfaces. (10)

7 a) Explain various types of antennas and their radiation pattern. (8)
b) What are the main problems faced in signal propagation? (12)

Module 2

8 a) Explain Bluetooth protocol stack with neat diagram (12)

b) Explain in detail about digital video broadcasting. (8)


9 a) Explain how the power management is done in IEE 802.11 infrastructure
and adhoc networks. (10)
b) Describe the mobile satellite systems (LEO,GEO and MEO). (10)

Module 3

10 a) What is the basic purpose of DHCP? Name the entities of DHCP. (10)
b) Explain standard routing protocols for mobile communication. (10)


11 a) List the various entities of mobile IP and describe data transfer from a
mobile node to a fixed node and vice versa. (10)
b) Explain the various encapsulation methods used in Mobile IP. (10)

Module 4

12 a) Draw a neat diagram of WAP architecture and explain in detail. (10)
b) Explain how mobile TCP improves the TCP performance in wireless and
mobile environment. (10)


13 Explain
a) WAP 2.0 (5)
b) WML Script (5)
c) WDP (5)
d) WTLS (5)
Read more

KTU B.Tech S6 Model Questions Computer Networks Computer Science

Model Question Paper



Time : 3 Hours Max. Marks : 100

Part A ( Answer all questions)

1. Give the differences between Computer Networks and Distributed Systems.
2. A bit string 0111101111101111110, needs to be transmitted at the data link layer.
What is the string actually transmitted after bit stuffing?
3. What is the relevance of Duration field in an 802.11 frame?
4. A network on the internet has a subnet mask of What is the maximum
number of hosts it can handle?
5. DNS uses UDP instead of TCP. If a DNS packet is lost, there is no automatic
recovery. Does this cause a problem, and if so, how it is solved?

(5 x 4 = 20)

Part B (Answer one full question from each module)

Module I

I. (a) Discuss the functions of data link layer in a computer network. (10)
(b) Describe the role of network layer and transport layer in TCP/IP model. (10)

II. (a) Identify the layers in OSI reference model and illustrate their functions. (10)
(b) Discuss about the design issues of computer networks. (10)

Module II

III. (a)The following character encoding is used in a data link protocol:
A: 01000111; B: 11100011; FLAG: 01111110; ESC: 11100000

Show the bit sequence transmitted (in binary) for the four-character frame: A
B ESC FLAG when each of the following framing methods are used:
i. Character Count
ii. Flag bytes with byte stuffing
iii. Starting and ending flag bytes, with bit stuffing. (12)
(b) Discuss about the structure and working of Switched Ethernet. (8)
IV. Describe CSMA/CD protocol in Ethernet. (20)

Module III

V. (a) Discuss about the techniques to improve QoS in internetworking. (10)
(b) Illustrate the routing procedure in mobile networks. (10)
VI. Illustrate the working of OSPF and BGP. (20)

Module IV

VII. (a). Give the format of TCP header and discuss the relevance of various fields (12)
(b). How transport layer connection is established in TCP? Illustrate with state
diagrams. (8)
VIII. (a) Explain the features of H.323 and SIP (12)
(b) How name servers are managed in DNS? (8)
Read more

KTU B.Tech S6 Model Questions Compiler Design CS

Model Question Paper

Sixth Semester B.Tech Degree Examination


Time: 3 hours Max.Marks:100

(Answer all questions)

1. Symbol table is necessary for compiler construction. Justify your statement with example.
2. For ∑={a,b}, build a Finite Automata that accepts only those words that do not end with ba.
3. Explain ambiguity in grammars. Consider the grammar

Show that the grammar is ambiguous by constructing two different leftmost derivations for the sentence
4. Explain the pros and cons of operator precedence parsing.
5. Write the syntax directed translation for “do-while” statement in C.

(5*4=20 marks)


(Answer any one full question from each module)


6. a) Explain the output for each phase of compiler for the following character streams.
i) T1=T2*3+2*6.3+2*T2, where T1 and T2 are integers
ii) if (a
b) Consider the grammar
S → (L) | a
L → L, S | S
i)What are the terminals, non-terminals and start symbol in the given grammar?
ii)Find parse tree for the following sentences:
i) (a,a)
ii) (a, ((a,a),(a,a))) (4)
c) Explain the concept of compiler writing tools. (4)


7. a) List any four issues in compilation. (4)
b) Consider the context free grammar
S→ SS+|SS*|a
And the strings i) aa+a*

I) Give the leftmost derivation of the strings
II) Give the rightmost derivation of the strings
III) Give a parse tree for the strings
IV) Is the grammar ambiguous or not? Justify your answer. (8)
c) Explain the front end of a compiler with a neat diagram. Show the output of different phases in front
end for the following input: a[index]=b*2.0 (8)


8. a) Consider a language that consists of a single email address. An email id is a USERNAME followed by
@ character followed by a HOSTNAME. A USERNAME is the combination of one or more alphanumeric
characters and a HOSTNAME is composed of two or more DOMAINS separated by the character dot (.). A
DOMAIN is a sequence of one or more characters.
i) Draw a DFA for this language.
ii) Write a regular expression to recognize the language.
iii) Recast your language as a CFG using the non terminal EMAIL as the start symbol. (12)
b) Write an algorithm for finding the ɛ-closure of all states of a ɛ-NFA. (8)


9. a) Draw a Finite Automata for a language which consists of the following lexemes:
<,<=, ==, >, >=, != ,( , ), +,-,*,/,=,semicolon, identifier and digits. Comments, which begins in /* and end
with a */ and blanks should be ignored by the scanner. (12)
b) Write the algorithm to minimize the number of states in a DFA. Apply this algorithm to
minimize the states of the following DFA: (8)
State Inputs

Start A B C
Accept E B C

10. a)Construct a predictive parsing table for the following grammar.


Check whether the grammar is LL(1) or not. Justify your answer. (12)
b) State the error recovery methods in operator precedence parser. (8)

11. a) Construct SLR parsing table for the following grammar

F→(E)|id (10)
b) Construct the operator precedence parse table for the following grammar and show its action for the
input string ccbab. (10)


12. a)Explain the syntax directed translation scheme for array references (12)
b)Write the three address code for the following statements (8)


13. a) Write quadruples, triples and indirect triples for the expression
-(a+b)*(c+d)-(a+b+c) (8)
b) Explain the concept of backpatching and write the syntax directed translation scheme for Boolean
expressions with and without back patching
Read more

KTU B.Tech S6 Model Questions Design and Analysis of Algorithms CS

B.Tech Degree Examination

Model Quesion Paper


Time: 3 Hrs                                                             Marks: 100

Answer all questions
1. Why is more emphasis given to minimize the execution time of an algorithm rather than
the space requirement of an algorithm or computer program most of the time.
2. Demonstrate using a suitable example as to why raw computational power alone cannot
be a substitute for efficient algorithm design.
3. Explain master method for solving recurrence relations.
4. Why are height balanced trees used instead of ordinary binary search trees?
5. What sorting algorithm would you prefer to use if you know that most of your input are
already sorted? Why?(5X4=20 Marks)


Answer any one full question from each module.

Module 1

6. a. Explain with an example how recurrence trees can be used to solve a recurrence
relation. 5 Marks
b. Solve the recurrence 2 / 4 T n( ) + n using methods based on
(i) Substitution (ii) Recursion tree (iii) Master theorem 15 Marks


7. a. Is a randomized algorithm for quicksort more efficient? Explain. 5 Marks
b. Write an algorithm to sort an array in decreasing order using Quicksort. Derive the
worst case running time for his algorithm. 15 Marks

8        9
12     15

4      12
6     11

Module 2

8. a. With examples of your own show how union by rank and path compression heuristics
improve the running time to perform operations on Disjoint Set data structures. 10
b. Why are rotations performed on a Red-Black Tree? Write the Pseudocode to perform a
right rotate operation. Show the running time for the algorithm. 10 Marks


9. a. Why is a minimum degree of 1 disallowed in a B-Tree. Without any formal
pseudocode explain how a new node can added to a B-Tree. Use suitable examples for
clarity wherever necessary. 10 Marks
b. Explain how a node can be added to an AVL-Tree. 10 Marks

Module 3

10. Explain how Prims algorithm successfully finds the minimum spanning tree. Illustrate it’s
working using a suitable example. How does the Prim’s algorithm for minimum spanning
tree differ from Dijkstra’s shortest path algorithm?
20 Marks


11. a. Demonstrate how Strassen’s matrix multiplication method works by finding the
product of the given matrices:- 10 Marks

b. Does Merge Sort have a best case or worst case? Show the running the time for Merge
Sort. 10 Marks

Module 4

12. a. What does the term “reducibility” mean? When do you say one language is polynomial
time reducible? 4 Marks
b. Explain the 8 Queen Problem. 10 Marks

c. What is the difference between the Travelling Salesperson Problem and Shortest Path Problem?
6 Marks


13. a. Use Dynamic Programming to solve the Matrix Chain Multiplication Problem.
10 Marks
b. What is greedy choice property? Write a solution for fractional knapsack problem
using greedy approach. 10 Marks
Read more
Follow us on Facebook
Powered by: KTU Online