exam pattern,question paper,notification

Wednesday, April 10, 2013

FOUR TUT ION ON CSE B.TECH SUBJECT CALL ME ON 9654020104

For TUT ION on any subject of computer science call me no 9654020104. i prepared for gate 2013 and got 99.35 %tile, and AIR 1376. my favorite subject are following :

ADA
programming ( C & C++)
data-structure
TAC
compiler design.
DATABASE
OS
CN

No doubt you will get good marks on university exam by following standard book but their are some concept which are very difficult without a proper guide like complexity in ADA, and TAC m/c design and many more concept on programming language.

B.E. 6th SEMENSTER (CSE) Examination - May, 2012 ANALYSIS AND DESIGN OF ALGORITHMS

B.E. 6^th SEMENSTER (CSE)

Examination - May, 2012

ANALYSIS AND DESIGN OF ALGORITHMS

Paper : CSE-306-F

Note : Question No. 1 is compulsory. Attempt any five questions, selecting at least one question from each part.

1. (a) A symptotic notations. 3

(b) Difference in Greedy and Dynamic approaches. 3

(d) General backtracking method. 3

(e) Hamiltonian Cycles with examples. 4

(f) Recursive Relations. 3

Section-A

2. (a) Explain the following : Union and fund operations in terms of set and Disjoint set. 10

(b) Which sorting algorithm is most efficient ? Explain various pros and cons. 10

3. (a)Explain quick sort algorithm. 10

(b) Explain strassen’s matrix multiplication. 10

Section-B

4. (a) Generate the minimum spanning tree of the following connected graph using Kruskal’s algorithm. 10

(b) Explain single source shortest path problem along with the algorithm, example and its complexity.

1. Explain the problem of solving optional binary search trees using dynamic programming. 20

Section –C

2. Suggest the solution to the following problem using backtracking :

(a) 8-queen problem

(b) Graph – Coloring. 20

3. (a) Differentiate between backtracking and branch and bound. 10

(b)Explain LC branch and bound with example. 10

Section – D

4. (a) show that Clique decision problem is NP Hard. 10

(b) Discuss Node cover decision problem. 10

5. State and prove cook’s theorem. 20

B.E. 5th SEMENSTER (CSE) Examination - December, 2011 ANALYSIS AND DESIGN OF ALGORITHMS

B.E. 5^th SEMENSTER (CSE)

Examination - December, 2011

ANALYSIS AND DESIGN OF ALGORITHMS

Paper : CSE-306-E

Note : Attempt any five questions. All questions carry equal marks.

1. (a) What is the recurrence relation ? Solve the following relation by recursive method :

P(n) = 2T(n/2 + 10 ) + n 10

(b) What are priority queues and explain their application with algorithm Suitable examples. 10

2. (a) Explain Strassen’s matrix multiplication. Can you change the same technique to get lower time complexity algorithm. 10

(b) Explain the algorithm of merge sort and compare time complexity with heap sort. 10

3. (a) Explain the greedy approach for the algorithm design ? Devise a solution for fractional knapsack using greedy approach ? Give its time complexity. 10

(b)Explain the job sequencing with deadlines problem using suitable example. 10

4. Explain the concept of optimal Binary Search trees with suitable example showing its applications. 20

5. (a) What is graph coloring? Write the algorithm to find chromatic number of a graph. 10

(b)Discuss N-Queens problem and analyze the time complexity of the same. 10

6. Discuss branch and bound strategy by solving any instance of 0/1 Knapsack problem and analyze the time complexity for the same. 20

7. (a) Explain deterministic and non deterministic algorithm with suitable examples.

(b) Explain the following :

(i) NP-Hard

(ii) NP-Complete

8. Explain the following :

(i) LC – search

(ii) Huffman codes

(iii) TSP is NP-Complete

B.E. 5th SEMENSTER (CSE) Examination - December, 2010 ANALYSIS AND DESIGN OF ALGORITHMS

B.E. 5^th SEMENSTER (CSE)

Examination - December, 2010

ANALYSIS AND DESIGN OF ALGORITHMS

Paper : CSE-305-E

Note : Attempt any five questions. All questions carry equal marks.

1. (a) What is bi-connected component of graph ? Give example of the bi-connected component. Write an algorithm to find the bi-connected components. 10

(b) Write algorithm for merge sort and find its complexity. 10

2. (a) Explain strassen’s matrix multiplication with suitable examples 10

(b)Explain the procedure of quick sort with an example. Also analyse it in best ,average and worst cases. 10

3. (a) What are minimum spanning trees? Give any one method to generate minimum spanning trees. 10

(b)Prove that the fractional knapsack problem has a greedy-choice property 10

4. (a) What is the principle of optimality that is used Dynamic programming paradigm? Discuss how this principle can be applied to shortest path problem. 10

(b) Consider three items along with their respective weights and profits :

W_i = (18, 15, 10)

P_i = (25, 24, 15)

The knapsack has capacity, m=20, find out the solution to the fractional knapsack problem using Greedy Method. 10

5. (a) Write back- tracking procedure to determine all Hamiltonian cycle in a graph. 10

(b) Give an algorithm for graph colouring problem using Backtracking and analyze the time complexity of the same. 10

6. Discuss all branch and bound strategies with the help of example. 20

7. (a) Explain what do you mean by saying a problem

₁ reduces to

_2.How is it useful in proving problems NP-Complete ? 10

(b) Prove that Subset-sum Problem is in NP-Complete. 10

8. Write short notes on :

(a) Union find algorithm

(b) Transitive closure of a graph

B.E. 5th SEMENSTER (CSE) Examination - December, 2009 ANALYSIS AND DESIGN OF ALGORITHMS

B.E. 5^th SEMENSTER (CSE)

Examination - December, 2009

ANALYSIS AND DESIGN OF ALGORITHMS

Paper : CSE-305-E

Note : Attempt any five questions. All questions carry equal marks.

1. (a) What is recurrence relation ? Explain master method for solving recurrences. 10

(b) Explain Union algorithm with weighted rule 10

2. (a) Explain the algorithm which runs in O(n) time when the list is already sorted. Derive average and worst case complexity for the same. 10

(b) Explain heap sort algorithm and compute its complexity. 10

3. (a) Find the solution for following fractional Knapsack problem using greedy method : 10

n = 3 m=50

wi = (10, 20, 30) pi = ( 60, 100, 120)

(b) Explain Kruskal’s algorithm to find the minimum spanning tree from a graph with example and derive its time complexity 10

4. (a) Explain job sequencing with deadlines. 10

(b) Find the minimum spanning tree using Prim’s algorithm for following graph: 10

1. (a) Explain backtracking . Write algorithm for n queens problem and analyze the time complexity of the same. 10

(b) Consider the knapsack instance :

n =4, Wi = (2, 4, 6, 9 ) Pi = ( 10, 10, 12, 18 ) m =15.

Using dynamic approach find the solution for this instance of 0-1 knapsack problem. 10

2. (a) Differentiate Greedy and dynamic approach hence differentiate fractional and 0-1 Knapsack problem. 10

(b) Explain shortest path algorithm. 10

3. Explain LC branch and bound technique. Find the reduced cost matrix and draw the state space tree for travelling salesperson problem having the following cost matrix. 20

∞ 20 30 10 11

15 ∞ 16 04 02

03 05 ∞ 02 04

19 06 18 ∞ 03

16 04 07 16 ∞

4. Write short notes on :

(i) Strassen’s matrix multiplication 10

(ii) Cook’s theorem. 10

B.E. 1st SEMENSTER (COMMON TO ALL BRANCHES) Examination - B.E, Dec, 2012 FUNDAMENATAL OF COMPUTER & PROGRAMMING IN C

B.E. 1^st SEMENSTER (COMMON TO ALL BRANCHES)

Examination - B.E, Dec, 2012

FUNDAMENATAL OF COMPUTER & PROGRAMMING IN C

Paper : CSE-101-F

Note : Attempt any five questions. Question No. 1 is compulsory and select one question from each section. All question carry equal marks.

1. (a) Differentiate between RAM and ROM.

(b) Differentiate between Real time operating system and Distributed operating system.

(d)what is difference between compiler and interpreter ?

(e) Explain conditional operator with the help of example.

(f) What are actual parameters and formal parameters ? Explain with the help of an example.

(g) What is the meaning of LVALUE and RVALUE of a variable ?

Section – A

2. (a) Differentiate between warm Booting and Cold Booting. 10

(b) Explain the concept of multiprocessing operating system. 10

3. (a) What are the various components of central processing unit? 8

(b) Explain digitizers. 6

Section – B

4. (a) How Machine Language is different from the assembly language ? 10

(b) What is HTTP? Why it is used?

5. Explain the OSI reference model in detail 20

Section – C

6. (a)Write the program in ‘C’ to find square of a program . 10

(b) Write a program in ‘C’ to find out the second smallest and second largest number in the list. 10

7. (a) Write a program in ‘C’ to print the first 10 multiple of a given number using the ‘Do- while’ loop. 10

(b) Explain the call by value and call by reference method in detail. 10

Section – D

8. (a) What are the various file operations ? Explain them. 10

(b) Write a program to read the data from the keyboard. 10

9. Write short notes on the following :

(a) Calloc and malloc functions 5

(b) Declaring pointer variable 5

(d) Command line argument 5

B.E. 1st SEMENSTER (COMMON TO ALL BRANCHES) Examination - B.E, Dec, 2011 FUNDAMENATAL OF COMPUTER & PROGRAMMING IN C

B.E. 1^st SEMENSTER (COMMON TO ALL BRANCHES)

Examination - B.E, Dec, 2011

FUNDAMENATAL OF COMPUTER & PROGRAMMING IN C

Paper : CSE-101-F

Note : Attempt any five questions. Question No. 1 is compulsory and select one question from each section. All question carry equal marks.

1. (a) Differentiate primary & secondary memory. 2.5

(b)Differentiate between multiprogramming and multiprocessing operating system. 2.5

(d) Describe Hypertext and its usability. 2.5

(e) How an array of structure initialized ? 2.5

(f) Declare a pointer to a function that accept three integer arguments and return a floating point quantity. 2.5

(g) Explain break and continue statement. 2.5

(h) Compare the statements by providing suitable example : i++ and i++. 2.5

Section – A

2. (a) What do you mean by computer ? Discuss briefly various characteristics of computer. 8

(b) Differentiate between windows and linux. 8

3. (a) Explain the Various input/ output ports and connectors. 10

(b) Classification of operating systems. 5

4. (a) Explain different types of programming language. How we can execute a programme written in these languages ? 10

(b) Explain TCP/IP reference model. 10

5. (a) Explain OSI reference model. 10

(b) Describe relationship between complier, assembler, loader and linker. 10

Section-c

6. (a) Write a programme in ‘C’ which generate every 3^rd integer between 2 and 100 and calculate the sum of those integers that are evenly divisible by 5 10

(b) WAP in ‘C’ to print the total count of all the prime numbers between 100 and 500 10

7. (a) WAP in ‘C’ to find the second smallest and second largest number in the list. 12

(b) How structure within structures are implemented ? How we can acess the member of these structure ? 8

Section-D

8. Explain the following

(a) Array of pointers.

(b) Pointer of functions

(d) Command line argument

9. (a) WAP to count the number of words, character and lines in a file. 10

(b) WAP using to clarify the concept of the two parameter passing methods : call by value and call by reference. 10