php hit counter

Thread Rating:
  • 0 Vote(s) - 0 Average
  • 1
  • 2
  • 3
  • 4
  • 5
cs502 current paper subjective type fall 2010 on 21-02-2011
VU Help • House Banner VU Help Virtual University Students - Assignments, Solved Papers, GDB & Exam Help Student Help Forum • Collaborative • Free Support
#1
[FONT=&quot]1.What are two steps generally involved while developing a dynamic programming algorithm?[/FONT]
[FONT=&quot]i. [/FONT][FONT=&quot]How Dijkstra’s algorithm operates?[/FONT]
[FONT=&quot]ii. [/FONT][FONT=&quot]What is the running time of the Dijkstra’s algorithm?[/FONT]
[FONT=&quot] [/FONT]
[FONT=&quot] [/FONT]
[FONT=&quot]3.Answer yes or no and give a brief explanation for your choice.[/FONT]
[FONT=&quot]If problem A reduces (is polynomial-time reducible) to problem B and B is NP-complete then A is NP-complete[/FONT]
[FONT=&quot] [/FONT]
[FONT=&quot]4.The following adjacency matrix represents a graph that consists of four vertices labeled 0, 1, 2 and 3. The entries in the matrix indicate edge weights.[/FONT]
[FONT=&quot] [/FONT]
[FONT=&quot]0[/FONT]
[FONT=&quot]1[/FONT]
[FONT=&quot]2[/FONT]
[FONT=&quot]3[/FONT]
[FONT=&quot]0[/FONT]
[FONT=&quot]0[/FONT]
[FONT=&quot]1[/FONT]
[FONT=&quot]0[/FONT]
[FONT=&quot]3[/FONT]
[FONT=&quot]1[/FONT]
[FONT=&quot]2[/FONT]
[FONT=&quot]0[/FONT]
[FONT=&quot]4[/FONT]
[FONT=&quot]0[/FONT]
[FONT=&quot]2[/FONT]
[FONT=&quot]0[/FONT]
[FONT=&quot]1[/FONT]
[FONT=&quot]0[/FONT]
[FONT=&quot]1[/FONT]
[FONT=&quot]3[/FONT]
[FONT=&quot]2[/FONT]
[FONT=&quot]0[/FONT]
[FONT=&quot]0[/FONT]
[FONT=&quot]0[/FONT]
[FONT=&quot]Answer the following question:[/FONT]
[FONT=&quot]Can an adjacency matrix for a directed graph ever not be square in shape? Why or why not?[/FONT]
[FONT=&quot] [/FONT]
[FONT=&quot]5. Consider the following two problems. In P1 we are given as input a set of n squares (specified by their corner points), and a number k. The problem is to determine whether there is any point in the plane that is covered by k or more squares.[/FONT]
[FONT=&quot]In P2 we are given as input an n–vertex graph, and a number k; the problem is to determine whether there is a set of k mutually adjacent vertices. (E.g. for k = 3 we are just looking for a triangle in the graph.). [/FONT]
[FONT=&quot]Obviously, the problems are both in NP. There exists a simple translation from P1 to P2: just make a graph vertex for each square, and add an edge between a pair of vertices if the corresponding two squares overlap.[/FONT]
[FONT=&quot]If P1 is NP-complete, would this translation imply that P2 is NP-complete?[/FONT]
[FONT=&quot](Give your Answer in Yes or No)[/FONT][FONT=&quot][/FONT]
[FONT=&quot]What is the application of edit distance technique?[/FONT]
[FONT=&quot]Formally describe Minimum Spanning Trees Problem.[/FONT]
[FONT=&quot] [/FONT]
[FONT=&quot]6. Let the adjacency list representation of an undirected graph is given below. Explain what general property of the list indicates that the graph has an isolated vertex.[/FONT]
[FONT=&quot] [/FONT]
[FONT=&quot] a [/FONT]à[FONT=&quot] b [/FONT]à[FONT=&quot] c [/FONT]à[FONT=&quot] e[/FONT]
[FONT=&quot] b [/FONT]à[FONT=&quot] a [/FONT]à[FONT=&quot] d [/FONT]
[FONT=&quot] c [/FONT]à[FONT=&quot] a [/FONT]à[FONT=&quot] d [/FONT]à[FONT=&quot] e [/FONT]à[FONT=&quot] f[/FONT]
[FONT=&quot] d [/FONT]à[FONT=&quot] b [/FONT]à[FONT=&quot] c [/FONT]à[FONT=&quot] f[/FONT]
[FONT=&quot] e [/FONT]à[FONT=&quot] a [/FONT]à[FONT=&quot] c [/FONT]à[FONT=&quot] f[/FONT]
[FONT=&quot] f [/FONT]à[FONT=&quot] c [/FONT]à[FONT=&quot] d [/FONT]à[FONT=&quot] e[/FONT]
[FONT=&quot] g[/FONT]
[FONT=&quot] [/FONT]
[FONT=&quot]7. What are the minimum and maximum numbers of elements in a heap of height h?[/FONT]
[FONT=&quot] [/FONT]
[FONT=&quot]1. [/FONT][FONT=&quot]Where clique cover problem arises?[/FONT]
[FONT=&quot]2. [/FONT][FONT=&quot]What is decision problem, also explain with example?[/FONT][FONT=&quot][/FONT]
[FONT=&quot]9. Show the strongly connected components of the following graph using DFS algorithm. Take node E as a starting node. [You can show final result in exam software and need not to show all intermediate steps].
[/FONT]


Please find the attachments for the diagrams.
[FONT=&quot][/FONT]
[FONT=&quot] [/FONT]


Attached Files
.doc   CS502 Final Paper 21 Feb 2011.doc (Size: 150.5 KB / Downloads: 273)
Reply


Possibly Related Threads…
Thread Author Replies Views Last Post
  Final Term Current Paper MKT501 Marketing Management 12 August 2010 viki 1 3,466 08-20-2020, 08:12 PM
Last Post: Johnnieaunders
  All Current Finalterm Papers Solved & Unsolved Held On 10 August 2010 viki 18 11,964 05-14-2012, 02:24 AM
Last Post: malik zani
  All Current Finalterm Papers Solved & Unsolved Held On 7 & 8 August 2010 viki 4 5,548 01-22-2012, 10:14 PM
Last Post: malika malik
  Final Term Current Paper CS101 Introduction to Computing 12 August 2010 viki 3 4,203 01-03-2012, 05:20 PM
Last Post: Muhammad Shahid hiraj
  Sta301 current paper 14 feb 2011 for fall 2010 Xpert 5 5,400 11-21-2011, 04:21 PM
Last Post: mahira
  current paperz of 9th class samia azhar 0 2,922 11-20-2011, 06:18 PM
Last Post: samia azhar
  Final Term Paper Current MTH101- Calculus And Analytical Geometry 10 August 2010 viki 6 6,489 11-03-2011, 10:59 PM
Last Post: rabeel
  mkt610 paper 18-7-2011 nisreenjodhpur 0 3,758 07-19-2011, 01:39 AM
Last Post: nisreenjodhpur
  Final Term Current CS401 Computer Architecture and Assembly Language 10 August 2010 viki 2 4,211 07-07-2011, 11:28 PM
Last Post: Xpert
  CS401 Final Paper kazim 1 3,235 06-09-2011, 02:47 AM
Last Post: sumaira kharal

Forum Jump:


Users browsing this thread: 1 Guest(s)
VU Help • House Banner VU Help Virtual University Students - Assignments, Solved Papers, GDB & Exam Help Student Help Forum • Collaborative • Free Support