Scribd
Upload
85 views5 pages

CS702 Current Papersfrom 27 Feb 1 Marchupdated

Uploaded by

MAK CS
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
85 views5 pages

CS702 Current Papersfrom 27 Feb 1 Marchupdated

Uploaded by

MAK CS
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 5

CS702 Current Papers from 27 Feb – 5 March.

My Paper (5 March 2016) at 2:00 Pm


Question 1: (Marks: 5)
Find an explicit formula to compute number of edges in complete graph on n vertices.

Question 2: (Marks: 5)
Give a counterexample to the conjecture that if there is a path from u to v in a directed graph G, then any
depth-first search must result in d[v]  f[u]?

Question 3: (Marks: 5)
Prove that if a|b, a|c then a | (b - c)  a, b, c  Z.

Question 4: (Marks: 5)
Write the pseudocode of Naive String Matching Algorithm.

Question 5: (Marks: 10)


Prove that (p.q) = (p-1).(q-1), where p and q are prime numbers.

Question 6: (Marks: 10)


We are given a set S of 10 activities. Each activity required using a resource which can be used by only
one activity at a time. Each activity has starting time s i and finishing time fi, as below, where, 0 ≤ si < fi <
∞. Determine a maximum-size subset of mutually compatible activities. Write the pseudo code of greedy
algorithm of activity selection problem.

i 1 2 3 4 5 6 7 8 9 10
si 2 4 1 6 4 6 7 9 9 3
fi 5 6 7 8 9 10 11 12 13 14

Question 7: (Marks: 10)


Write the pseudocode of breadth first search algorithm.

Question 8: (Marks: 10)


Prove that If a > b ≥ 1 and the invocation EUCLID(a, b) takes k ≥ 1 recursive calls, then a ≥ Fk+2 and b ≥
Fk+1.

mine paper of cs702 29/02/2016


1. fractional knapsak psuedo code 5marks
2. strongly connected component algo 5marks
3. prove if a|b ... then a|(-b) somthing like that 5marks
4. not remember 5 marks
5. prive 1f n is devisble by 7. n square also devisible by 7. 10marks
6. hufman code and binery tree 10 marks
7. prims algorithem for minimum spaning tree 10marks
8. prove CLIQUE is NP-complete 10 marks

1.Use the Backtracking algorithm for the 0-1 Knapsack problem to maximize the profit for the following
problem instance. Show actions step by steps.
Maximum Capacity = 8
I =1,2,3,4
vi=3,5,6,10
wi=2,3,4,5
2.Prove that for all integers n, if n2 is even then n is also even.
3.Write down the pseudo code of Huffman algorithm.
4.Decrypt 0981 0461 if encrypted using RSA Public key = (e, n) = (13, 43.59 = 2537)
5.Algorithm for print screen BFS
6. Prove that if a|b, b|c then a|c, a, b, c Z
7.Huffman optimal coding given frequencies and we find the solution by drawing tree

My today cs702 paper, time 2:PM


1. BFS algo
2. Steps Designing Greedy Algorithms
3. SAT is NP Complete
4. CLIQUE ka question tha
5. Huffman Codes ka question tha given frequencies k sath tree bnana tha
6. Prove that if a|b, b|c then a|c, a, b, c Z
7. relatively prime ka ek prove tha

my cs702 final paper


1.prove that binary tree which is not ful can not have optimal prefix code.
2.write dag-shortest-path algo
3.write bfs shortest path algo
4.write code of transition function.
5.frequencies was given we have to calculate huffman codes.
6. solve 0-1 knapsack problem by backtracting same as in slides.
7.if a and b are shortest integers then prove that gcd(a,b) (ax+bz) will also shortest.theorem 1 in lecture 39
8. prove that *(pq)=(q-1)(p-1) last Q in lecture 40

CS-702 My Paper of today 10:30 AM


Q1 Prove that for all integers n, if n2is divisible by 7 then n is divisible by 7
Q2Write down pseudo code of optimal BST?
Q3Prims algorithm
Q4:DFS algortihm
Q5: Compute (a1=1, a2=2)m1=3 m2=4
Q6: extended shortest path algo
Q7: 1: Prove that a binary tree that is not full cannot correspond to an optimal prefix code.
and one was from Chinese remainder theorem
>>>My today’s paper of CS702 – 28-Feb-16 : 4:30 Pm – Total marks 60
Total 8 questions – 4 questions of 5 Marks, 4 Question of 10 marks<<<
1. Prove that in graph there are even number of vertices of odd degree. 5
2. Give a counter example of conjucture that if there is a path from u to v in a directed graph g then any
depth first search must result d[u]< f[u] 5
3. Pove if a|b,b|c then a|c . 5
4. Encrypt message STOP using RSA cryptosystem with p = 43, q = 59 and e = 13, n = pq = 2537, from
lecture 41 5marks
5. Write down pseudo code of longest common subsequence? 10
6. Prim’s algorithm for minimum spanning tree. 10
7. Prove that Z (+, *) ( the set of integers) is a ring. 10
8. Show that CIRCUIT-SAT is NP complete. 10

From Email:
CS702 - Current Most Important Questions
1. How to print path in BFS algorithm
2. Write down pseudo code of longest common subsequence?
3. Write down pseudo code of Naive String Matching problem?
4. Write down pseudo code of optimal BST?
5. Write down pseudo code of transition function?

CS702 - Advanced Algorithm Analysis and Design


Today Paper - [27-02-2016] - Incomplete
1. Kruskal’s Algorithm
2. Prove that for all integers n, if n2is divisible by 7 then n is divisible by
3. Prove that Z (+, *) ( the set of integers) is a ring.
4. Naive String Matching Algorithm

mine frind's papers of c702 28/02/2016


Naive String Matching Algorithm pge 312
BFS(G, s) page number 198
Prim’s Algorithm 236
The Rabin-Karp Algorithm
For any integer n and any prime number p, if p divides n then p does not divide n + 1 page29

MY PAPER 702
CS-702 FINAL TERM (28-02-2016) Total Marks:60 Time : 2 hrs.
1. Prove that in a graph there are even number of vertices of odd degree.(5)
2. Prove that every connected graph has a spanning tree (5)
3. Write the pseudo code of DIJKSTRA’S algorithm. (5)
4. Write the pseudo code of Naïve String Matching Algorithm. (5)
5. Write the pseudo code of Optimal Binary Search Tree (10)
6. Write the Prim’s algorithm of minimum spanning tree.(10)
7. Prove that for all prime p and all integers a,b if p|ab then p|a or p|b (or provides both a and b).(10)
8. Write the pseudo code of Fast Fourier Transform (FFT) recursive algorithm.(10)

CS-702
Today Paper 1-03-2016 8am to 10am

1. Write down the pseudo code of Huffman algorithm.


2. Suppose that the graph G(V,E) is represented as an adjacent matrix. Give simple implementation of
prime’s algorithm for this case that in o(Vpower2)
3. Write pseudo code of the floyed Warshal algorithm.
4. Prove that if a and n relatively prime
Then
5. Write down pseudo code of the Road Trip Problem.
6. Write the primes algorithm of the Minimum Spanning Tree
7. Prove that for all integer a & b and any nonnegative integer n, gcd(an , bn) = ngcd(a,b)
8. Prove that the CLIQUE problem is NP-Complete.

AoA guyz..!!!!
today's cs702 final term paper
CS-702 FINAL TERM (03-03-2016) Total Marks:60 Time : 2 hrs.
Q1: Prove that if a|b and a|c then a|(b-c) for all integers . 5 marks
Q2: Prove that for all integers n, if n2 is divisible by 7 then n is divisible by 7. 10 marks
Q3: Write down pseudo code of longest common subsequence? 5 marks
Q4: Write down pseudo code of Naive String Matching problem? 5 marks
Q5: Use the Backtracking algorithm for the 0-1 Knapsack problem to maximize the profit for the
following problem instance. Show actions step by steps. 10 marks
Maximum Capacity = 8
i1234
vi 3 5 6 10
wi 2 3 4 5
Q6: Write down pseudo code of Rabin-Karp Algorithm? 10 marks
Q7: Show that If k is a positive integer and T is a full binary tree with k internal vertices, the T has a total
of 2k + 1 vertices and has k + 1 terminal vertices. 10 marks
Q8: What is running time of implementing BFS using adjacency matrix and the algorithm is adjusted for
that? 5 marks

Q. NO. 1 Explict Formula to compute no of edges in complete graph of n-vertices?


Q.No 2 We are given a set S of 10 activities, each activity required using a resource which can be used
one activity at a time. Each activity has Starting Time Si, finishing Time Fi, as below where 0≤Fi≤∞
determine a maximum size subset of mutually compatible activities. Write pseuo code of greedy
algorithm of activity select in problem?
SOME PAST PAPERS QUESTIONS.
(Final, 2015, Fall, Marks = 5, Lesson No. 24)
Explain situation and example in which greedy algorithm does not work.

QUESTION
(Final, 2015, Fall, Marks = 10, Lesson No. 41)
Prove that if p is prime, a is positive integer not divisible by p,
ap-1 = 1 mod p OR ap = a mod p

QUESTION
(Final, 2015, Fall, Marks = 5, Lesson No. 41)
Decrypt 0981 0461 if encrypted using RSA
public key = (e, n) = (13, 43.59 = 2537)

QUESTION
(Final, 2015, Fall, Marks = 5, Lesson No. 40)
Prove taht if gcd(a, m) = 1 and m > 1, then a has a unique inverse a' (modulo m).

QUESTION
(Final, 2015, Fall, Marks = 10, Lesson No. 39)
If a and b are integers, not both zero then gcd(a,b) is the smallest positive element of the set {ax + by : x,
y ε Z} of linear combination of a nad b.

QUESTION
(Final, 2015, Fall, Marks = 5, Lesson No. 38)
Prove that if a|b, a|c then a|(b + c) ∀ a, b, c ε Z

You might also like