CS702 Current FinalTerm Paper 22 February 2018 | FALL 2017 |

CS702 Current FinalTerm Paper 22 February 2018 | FALL 2017 |

Cs702 Today my Paper 22-2-2018

Q1: Prove that Clique is Np-Complete

Q2: If k is a positive integer and T is a full binary tree with k number of internal vertices, then prove that T has a total of 2k + 1 vertices and has k + 1 terminal vertices.

Q3: Prove that Z (+, *) (the set of integers) is a ring.

Q4: Find the shortest paths by running the Bellman Ford Algorithm, from source node z

Q5: : Find Longest Common sequence. values of X and Y was given

Q6: Floyd Warshal question Graph was given


Cs 702 22-2-2018

Encrypt message using RSA cryptosystem 10 marks

‎Fast Fourier Transform algo 10 marks

‎ Activity Selection Problem an example and Iterative Greedy Algorithm(5+5marks)

‎ The Floyd Warshall / a graph with 5 vertices 10 marks

‎ Huffman Code 10 marks 

‎Kruskal’s Algorithm example 10 marks