101 Romantic ideas

1. Remember to say "I love you" and "I need you" often.

2. Walk hand in hand in the rain.

3. Write a love poem.

4. Call a radio station and dedicate a favorite song.

5. Write "I Love You" in lipstick or shaving cream on the mirror.

6. Hide love notes in a lunch box, briefcase or purse.

7. Make heart-shaped cinnamon toast for breakfast.

8. Place a love note in the personals section of the newspaper.

9. Take a carriage ride around the city.

10. Plan a surprise getaway.

11. Do your mate's household chores.

12. Write notes on future dates in their date book ("I love you," I miss you," etc.)

13. Make reservations at a favorite restaurant.

14. Let them choose the movie.

15. Give a foot massage.

16. Make a heart-shaped bookmark, and place it in their book.

17. Pop in a romantic music CD and slow dance.

18. Throw a just-because surprise party for two.

19. Buy a stuffed animal for your honey.

20. Read each other's horoscopes.

21. Make a list of the top 10 things you love about your partner.

22. Display it in a prominent place.

23. Tattoo your mate's name on your body.

24. Make an album or scrapbook of your favorite memories together.

25. Go camping together and only take one sleeping bag.

26. Send a mushy message in a bottle...a balloon...a sandwich...

27. Cut out a silly cartoon that you know they'd enjoy.

28. Shower together.

29. Dim the lights, and snuggle together on the couch.

30. Be the first to say "I'm sorry" and kiss and make up.

31. Give each other a full-body massage.

32. Kiss every hour on the hour all day long.

33. Send a gift basket of indulgent items.

34. Write "I'm hot for you" in the steam on the bathroom mirror.

35. Ribbon wrap your bed with a big bow.

36. Fill up the gas tank of your partner's car.

37. Act like teenagers. Maybe even pierce something!

38. Show up with a bouquet of flowers -- for no reason at all.

39. Play Scrabble® together, using as many "love" words as you can.

40. Run a warm bubble bath for your partner, with lots of lit candles.

41. Meet in the park for a picnic.

42. Hold hands.

43. Leave a trail of rose petals through the house, leading to a romantic candlelight dinner.

44. Make a donation in your mate's name to a special cause or charity.

45. Pick up their clothes from the floor -- without saying a word about it.

46. Watch an old black and white romantic movie and share a bowl of popcorn.

47. Reenact your first date.

48. Surprise your partner with tickets to a special event.

49. An unexpected hug can brighten any day.

50. Buy a silly, impromptu gift.

51. Send an email just to say "I'm thinking of you."

52. Bring home a balloon bouquet.

53. Serve breakfast in bed.

54. Make an ornament with a picture of both of you for the Christmas tree.

55. Play tag.

56. Wash and wax your partner's car, and leave a little note on the dashboard.

57. Plant a garden together.

58. Leave a mushy message on voicemail.

59. Stay at a hotel for the night, just because.

60. Make angels in the snow.

61. Every time you say "hello" or "goodbye", seal it with a hug and a kiss.

62. Take a drive in the country.

63. Spend the evening looking at the stars -- and make a wish together.

64. Cast a playful wink any time, anywhere.

65. Think up a list of silly little pet names for times when you're alone together.

66. Read poetry to each other.

67. Celebrate your half-birthdays together.

68. Put a picture of both of you in your wallet.

69. Buy that favorite book or CD for no reason at all.

70. Send a care package to work filled with treats like food, photos, candy, a love note, heart-shaped confetti, etc.

71. Go out for the evening and tell people you're on your honeymoon.

72. Take a hike together and carve your initials in a tree.

73. Write a thank you note for all the things you take for granted.

74. Make a fire in the fireplace and roast marshmallows.

75. Tape your favorite TV show and spend the evening talking.

76. Do the dishes together, then apply hand lotion to each other's hands.

77. Write a love letter to your partner and cut it into jigsaw puzzle pieces.

78. Decide on secret signals and use them to communicate with each other in large groups of people.

79. Schedule a regular mid-week "date night" for just the two of you.

80. Do the laundry together.

81. Romance Theater Weekend: reenact each other's favorite love scene - hers on Friday, his on Saturday.

82. Call your partner at work and ask for a date.

83. Pretend you haven't seen each other for a month. Act accordingly.

84. Send a written invitation to do something special.

85. Take turns reading to each other.

86. Stand outside the window and sing a romantic song.

87. Hide favorite candy in your partner's coat pockets.

88. Put a tape recording of your voice (saying anything) in the car stereo and turn it on so it plays when the car starts.

89. Go to a drive-in movie.

90. Get up to turn off the last light after you're both comfy-cozy in bed.

91. Hold each other tight during a thunderstorm.

92. Make a tape recording of favorite love songs.

93. Leave a bunch of bananas on the kitchen table with a note, "I go bananas over you!"

94. Hide love notes in a magazine.

95. Declare your undying love via a telegram.

96. Make a romantic dinner together, and serve it on your finest china.

97. Surprise your partner with a big kiss on the neck.

98. Give unexpected compliments.

99. Share an ice cream cone.

100. Have a picnic on the living room floor.

101. Draw a silly picture of the two of you. Frame it. http://ping.fm/neMYr
101 Romantic ideas

1. Remember to say "I love you" and "I need you" often.

2. Walk hand in hand in the rain.

3. Write a love poem.

4. Call a radio station and dedicate a favorite song.

5. Write "I Love You" in lipstick or shaving cream on the mirror.

6. Hide love notes in a lunch box, briefcase or purse.

7. Make heart-shaped cinnamon toast for breakfast.

8. Place a love note in the personals section of the newspaper.

9. Take a carriage ride around the city.

10. Plan a surprise getaway.

11. Do your mate's household chores.

12. Write notes on future dates in their date book ("I love you," I miss you," etc.)

13. Make reservations at a favorite restaurant.

14. Let them choose the movie.

15. Give a foot massage.

16. Make a heart-shaped bookmark, and place it in their book.

17. Pop in a romantic music CD and slow dance.

18. Throw a just-because surprise party for two.

19. Buy a stuffed animal for your honey.

20. Read each other's horoscopes.

21. Make a list of the top 10 things you love about your partner.

22. Display it in a prominent place.

23. Tattoo your mate's name on your body.

24. Make an album or scrapbook of your favorite memories together.

25. Go camping together and only take one sleeping bag.

26. Send a mushy message in a bottle...a balloon...a sandwich...

27. Cut out a silly cartoon that you know they'd enjoy.

28. Shower together.

29. Dim the lights, and snuggle together on the couch.

30. Be the first to say "I'm sorry" and kiss and make up.

31. Give each other a full-body massage.

32. Kiss every hour on the hour all day long.

33. Send a gift basket of indulgent items.

34. Write "I'm hot for you" in the steam on the bathroom mirror.

35. Ribbon wrap your bed with a big bow.

36. Fill up the gas tank of your partner's car.

37. Act like teenagers. Maybe even pierce something!

38. Show up with a bouquet of flowers -- for no reason at all.

39. Play Scrabble® together, using as many "love" words as you can.

40. Run a warm bubble bath for your partner, with lots of lit candles.

41. Meet in the park for a picnic.

42. Hold hands.

43. Leave a trail of rose petals through the house, leading to a romantic candlelight dinner.

44. Make a donation in your mate's name to a special cause or charity.

45. Pick up their clothes from the floor -- without saying a word about it.

46. Watch an old black and white romantic movie and share a bowl of popcorn.

47. Reenact your first date.

48. Surprise your partner with tickets to a special event.

49. An unexpected hug can brighten any day.

50. Buy a silly, impromptu gift.

51. Send an email just to say "I'm thinking of you."

52. Bring home a balloon bouquet.

53. Serve breakfast in bed.

54. Make an ornament with a picture of both of you for the Christmas tree.

55. Play tag.

56. Wash and wax your partner's car, and leave a little note on the dashboard.

57. Plant a garden together.

58. Leave a mushy message on voicemail.

59. Stay at a hotel for the night, just because.

60. Make angels in the snow.

61. Every time you say "hello" or "goodbye", seal it with a hug and a kiss.

62. Take a drive in the country.

63. Spend the evening looking at the stars -- and make a wish together.

64. Cast a playful wink any time, anywhere.

65. Think up a list of silly little pet names for times when you're alone together.

66. Read poetry to each other.

67. Celebrate your half-birthdays together.

68. Put a picture of both of you in your wallet.

69. Buy that favorite book or CD for no reason at all.

70. Send a care package to work filled with treats like food, photos, candy, a love note, heart-shaped confetti, etc.

71. Go out for the evening and tell people you're on your honeymoon.

72. Take a hike together and carve your initials in a tree.

73. Write a thank you note for all the things you take for granted.

74. Make a fire in the fireplace and roast marshmallows.

75. Tape your favorite TV show and spend the evening talking.

76. Do the dishes together, then apply hand lotion to each other's hands.

77. Write a love letter to your partner and cut it into jigsaw puzzle pieces.

78. Decide on secret signals and use them to communicate with each other in large groups of people.

79. Schedule a regular mid-week "date night" for just the two of you.

80. Do the laundry together.

81. Romance Theater Weekend: reenact each other's favorite love scene - hers on Friday, his on Saturday.

82. Call your partner at work and ask for a date.

83. Pretend you haven't seen each other for a month. Act accordingly.

84. Send a written invitation to do something special.

85. Take turns reading to each other.

86. Stand outside the window and sing a romantic song.

87. Hide favorite candy in your partner's coat pockets.

88. Put a tape recording of your voice (saying anything) in the car stereo and turn it on so it plays when the car starts.

89. Go to a drive-in movie.

90. Get up to turn off the last light after you're both comfy-cozy in bed.

91. Hold each other tight during a thunderstorm.

92. Make a tape recording of favorite love songs.

93. Leave a bunch of bananas on the kitchen table with a note, "I go bananas over you!"

94. Hide love notes in a magazine.

95. Declare your undying love via a telegram.

96. Make a romantic dinner together, and serve it on your finest china.

97. Surprise your partner with a big kiss on the neck.

98. Give unexpected compliments.

99. Share an ice cream cone.

100. Have a picnic on the living room floor.

101. Draw a silly picture of the two of you. Frame it. http://ping.fm/85uPe
101 Romantic ideas

1. Remember to say "I love you" and "I need you" often.

2. Walk hand in hand in the rain.

3. Write a love poem.

4. Call a radio station and dedicate a favorite song.

5. Write "I Love You" in lipstick or shaving cream on the mirror.

6. Hide love notes in a lunch box, briefcase or purse.

7. Make heart-shaped cinnamon toast for breakfast.

8. Place a love note in the personals section of the newspaper.

9. Take a carriage ride around the city.

10. Plan a surprise getaway.

11. Do your mate's household chores.

12. Write notes on future dates in their date book ("I love you," I miss you," etc.)

13. Make reservations at a favorite restaurant.

14. Let them choose the movie.

15. Give a foot massage.

16. Make a heart-shaped bookmark, and place it in their book.

17. Pop in a romantic music CD and slow dance.

18. Throw a just-because surprise party for two.

19. Buy a stuffed animal for your honey.

20. Read each other's horoscopes.

21. Make a list of the top 10 things you love about your partner.

22. Display it in a prominent place.

23. Tattoo your mate's name on your body.

24. Make an album or scrapbook of your favorite memories together.

25. Go camping together and only take one sleeping bag.

26. Send a mushy message in a bottle...a balloon...a sandwich...

27. Cut out a silly cartoon that you know they'd enjoy.

28. Shower together.

29. Dim the lights, and snuggle together on the couch.

30. Be the first to say "I'm sorry" and kiss and make up.

31. Give each other a full-body massage.

32. Kiss every hour on the hour all day long.

33. Send a gift basket of indulgent items.

34. Write "I'm hot for you" in the steam on the bathroom mirror.

35. Ribbon wrap your bed with a big bow.

36. Fill up the gas tank of your partner's car.

37. Act like teenagers. Maybe even pierce something!

38. Show up with a bouquet of flowers -- for no reason at all.

39. Play Scrabble® together, using as many "love" words as you can.

40. Run a warm bubble bath for your partner, with lots of lit candles.

41. Meet in the park for a picnic.

42. Hold hands.

43. Leave a trail of rose petals through the house, leading to a romantic candlelight dinner.

44. Make a donation in your mate's name to a special cause or charity.

45. Pick up their clothes from the floor -- without saying a word about it.

46. Watch an old black and white romantic movie and share a bowl of popcorn.

47. Reenact your first date.

48. Surprise your partner with tickets to a special event.

49. An unexpected hug can brighten any day.

50. Buy a silly, impromptu gift.

51. Send an email just to say "I'm thinking of you."

52. Bring home a balloon bouquet.

53. Serve breakfast in bed.

54. Make an ornament with a picture of both of you for the Christmas tree.

55. Play tag.

56. Wash and wax your partner's car, and leave a little note on the dashboard.

57. Plant a garden together.

58. Leave a mushy message on voicemail.

59. Stay at a hotel for the night, just because.

60. Make angels in the snow.

61. Every time you say "hello" or "goodbye", seal it with a hug and a kiss.

62. Take a drive in the country.

63. Spend the evening looking at the stars -- and make a wish together.

64. Cast a playful wink any time, anywhere.

65. Think up a list of silly little pet names for times when you're alone together.

66. Read poetry to each other.

67. Celebrate your half-birthdays together.

68. Put a picture of both of you in your wallet.

69. Buy that favorite book or CD for no reason at all.

70. Send a care package to work filled with treats like food, photos, candy, a love note, heart-shaped confetti, etc.

71. Go out for the evening and tell people you're on your honeymoon.

72. Take a hike together and carve your initials in a tree.

73. Write a thank you note for all the things you take for granted.

74. Make a fire in the fireplace and roast marshmallows.

75. Tape your favorite TV show and spend the evening talking.

76. Do the dishes together, then apply hand lotion to each other's hands.

77. Write a love letter to your partner and cut it into jigsaw puzzle pieces.

78. Decide on secret signals and use them to communicate with each other in large groups of people.

79. Schedule a regular mid-week "date night" for just the two of you.

80. Do the laundry together.

81. Romance Theater Weekend: reenact each other's favorite love scene - hers on Friday, his on Saturday.

82. Call your partner at work and ask for a date.

83. Pretend you haven't seen each other for a month. Act accordingly.

84. Send a written invitation to do something special.

85. Take turns reading to each other.

86. Stand outside the window and sing a romantic song.

87. Hide favorite candy in your partner's coat pockets.

88. Put a tape recording of your voice (saying anything) in the car stereo and turn it on so it plays when the car starts.

89. Go to a drive-in movie.

90. Get up to turn off the last light after you're both comfy-cozy in bed.

91. Hold each other tight during a thunderstorm.

92. Make a tape recording of favorite love songs.

93. Leave a bunch of bananas on the kitchen table with a note, "I go bananas over you!"

94. Hide love notes in a magazine.

95. Declare your undying love via a telegram.

96. Make a romantic dinner together, and serve it on your finest china.

97. Surprise your partner with a big kiss on the neck.

98. Give unexpected compliments.

99. Share an ice cream cone.

100. Have a picnic on the living room floor.

101. Draw a silly picture of the two of you. Frame it. http://ping.fm/wbeiF
101 Romantic ideas

1. Remember to say "I love you" and "I need you" often.

2. Walk hand in hand in the rain.

3. Write a love poem.

4. Call a radio station and dedicate a favorite song.

5. Write "I Love You" in lipstick or shaving cream on the mirror.

6. Hide love notes in a lunch box, briefcase or purse.

7. Make heart-shaped cinnamon toast for breakfast.

8. Place a love note in the personals section of the newspaper.

9. Take a carriage ride around the city.

10. Plan a surprise getaway.

11. Do your mate's household chores.

12. Write notes on future dates in their date book ("I love you," I miss you," etc.)

13. Make reservations at a favorite restaurant.

14. Let them choose the movie.

15. Give a foot massage.

16. Make a heart-shaped bookmark, and place it in their book.

17. Pop in a romantic music CD and slow dance.

18. Throw a just-because surprise party for two.

19. Buy a stuffed animal for your honey.

20. Read each other's horoscopes.

21. Make a list of the top 10 things you love about your partner.

22. Display it in a prominent place.

23. Tattoo your mate's name on your body.

24. Make an album or scrapbook of your favorite memories together.

25. Go camping together and only take one sleeping bag.

26. Send a mushy message in a bottle...a balloon...a sandwich...

27. Cut out a silly cartoon that you know they'd enjoy.

28. Shower together.

29. Dim the lights, and snuggle together on the couch.

30. Be the first to say "I'm sorry" and kiss and make up.

31. Give each other a full-body massage.

32. Kiss every hour on the hour all day long.

33. Send a gift basket of indulgent items.

34. Write "I'm hot for you" in the steam on the bathroom mirror.

35. Ribbon wrap your bed with a big bow.

36. Fill up the gas tank of your partner's car.

37. Act like teenagers. Maybe even pierce something!

38. Show up with a bouquet of flowers -- for no reason at all.

39. Play Scrabble® together, using as many "love" words as you can.

40. Run a warm bubble bath for your partner, with lots of lit candles.

41. Meet in the park for a picnic.

42. Hold hands.

43. Leave a trail of rose petals through the house, leading to a romantic candlelight dinner.

44. Make a donation in your mate's name to a special cause or charity.

45. Pick up their clothes from the floor -- without saying a word about it.

46. Watch an old black and white romantic movie and share a bowl of popcorn.

47. Reenact your first date.

48. Surprise your partner with tickets to a special event.

49. An unexpected hug can brighten any day.

50. Buy a silly, impromptu gift.

51. Send an email just to say "I'm thinking of you."

52. Bring home a balloon bouquet.

53. Serve breakfast in bed.

54. Make an ornament with a picture of both of you for the Christmas tree.

55. Play tag.

56. Wash and wax your partner's car, and leave a little note on the dashboard.

57. Plant a garden together.

58. Leave a mushy message on voicemail.

59. Stay at a hotel for the night, just because.

60. Make angels in the snow.

61. Every time you say "hello" or "goodbye", seal it with a hug and a kiss.

62. Take a drive in the country.

63. Spend the evening looking at the stars -- and make a wish together.

64. Cast a playful wink any time, anywhere.

65. Think up a list of silly little pet names for times when you're alone together.

66. Read poetry to each other.

67. Celebrate your half-birthdays together.

68. Put a picture of both of you in your wallet.

69. Buy that favorite book or CD for no reason at all.

70. Send a care package to work filled with treats like food, photos, candy, a love note, heart-shaped confetti, etc.

71. Go out for the evening and tell people you're on your honeymoon.

72. Take a hike together and carve your initials in a tree.

73. Write a thank you note for all the things you take for granted.

74. Make a fire in the fireplace and roast marshmallows.

75. Tape your favorite TV show and spend the evening talking.

76. Do the dishes together, then apply hand lotion to each other's hands.

77. Write a love letter to your partner and cut it into jigsaw puzzle pieces.

78. Decide on secret signals and use them to communicate with each other in large groups of people.

79. Schedule a regular mid-week "date night" for just the two of you.

80. Do the laundry together.

81. Romance Theater Weekend: reenact each other's favorite love scene - hers on Friday, his on Saturday.

82. Call your partner at work and ask for a date.

83. Pretend you haven't seen each other for a month. Act accordingly.

84. Send a written invitation to do something special.

85. Take turns reading to each other.

86. Stand outside the window and sing a romantic song.

87. Hide favorite candy in your partner's coat pockets.

88. Put a tape recording of your voice (saying anything) in the car stereo and turn it on so it plays when the car starts.

89. Go to a drive-in movie.

90. Get up to turn off the last light after you're both comfy-cozy in bed.

91. Hold each other tight during a thunderstorm.

92. Make a tape recording of favorite love songs.

93. Leave a bunch of bananas on the kitchen table with a note, "I go bananas over you!"

94. Hide love notes in a magazine.

95. Declare your undying love via a telegram.

96. Make a romantic dinner together, and serve it on your finest china.

97. Surprise your partner with a big kiss on the neck.

98. Give unexpected compliments.

99. Share an ice cream cone.

100. Have a picnic on the living room floor.

101. Draw a silly picture of the two of you. Frame it. http://ping.fm/fjnM4
101 Romantic ideas

1. Remember to say "I love you" and "I need you" often.

2. Walk hand in hand in the rain.

3. Write a love poem.

4. Call a radio station and dedicate a favorite song.

5. Write "I Love You" in lipstick or shaving cream on the mirror.

6. Hide love notes in a lunch box, briefcase or purse.

7. Make heart-shaped cinnamon toast for breakfast.

8. Place a love note in the personals section of the newspaper.

9. Take a carriage ride around the city.

10. Plan a surprise getaway.

11. Do your mate's household chores.

12. Write notes on future dates in their date book ("I love you," I miss you," etc.)

13. Make reservations at a favorite restaurant.

14. Let them choose the movie.

15. Give a foot massage.

16. Make a heart-shaped bookmark, and place it in their book.

17. Pop in a romantic music CD and slow dance.

18. Throw a just-because surprise party for two.

19. Buy a stuffed animal for your honey.

20. Read each other's horoscopes.

21. Make a list of the top 10 things you love about your partner.

22. Display it in a prominent place.

23. Tattoo your mate's name on your body.

24. Make an album or scrapbook of your favorite memories together.

25. Go camping together and only take one sleeping bag.

26. Send a mushy message in a bottle...a balloon...a sandwich...

27. Cut out a silly cartoon that you know they'd enjoy.

28. Shower together.

29. Dim the lights, and snuggle together on the couch.

30. Be the first to say "I'm sorry" and kiss and make up.

31. Give each other a full-body massage.

32. Kiss every hour on the hour all day long.

33. Send a gift basket of indulgent items.

34. Write "I'm hot for you" in the steam on the bathroom mirror.

35. Ribbon wrap your bed with a big bow.

36. Fill up the gas tank of your partner's car.

37. Act like teenagers. Maybe even pierce something!

38. Show up with a bouquet of flowers -- for no reason at all.

39. Play Scrabble® together, using as many "love" words as you can.

40. Run a warm bubble bath for your partner, with lots of lit candles.

41. Meet in the park for a picnic.

42. Hold hands.

43. Leave a trail of rose petals through the house, leading to a romantic candlelight dinner.

44. Make a donation in your mate's name to a special cause or charity.

45. Pick up their clothes from the floor -- without saying a word about it.

46. Watch an old black and white romantic movie and share a bowl of popcorn.

47. Reenact your first date.

48. Surprise your partner with tickets to a special event.

49. An unexpected hug can brighten any day.

50. Buy a silly, impromptu gift.

51. Send an email just to say "I'm thinking of you."

52. Bring home a balloon bouquet.

53. Serve breakfast in bed.

54. Make an ornament with a picture of both of you for the Christmas tree.

55. Play tag.

56. Wash and wax your partner's car, and leave a little note on the dashboard.

57. Plant a garden together.

58. Leave a mushy message on voicemail.

59. Stay at a hotel for the night, just because.

60. Make angels in the snow.

61. Every time you say "hello" or "goodbye", seal it with a hug and a kiss.

62. Take a drive in the country.

63. Spend the evening looking at the stars -- and make a wish together.

64. Cast a playful wink any time, anywhere.

65. Think up a list of silly little pet names for times when you're alone together.

66. Read poetry to each other.

67. Celebrate your half-birthdays together.

68. Put a picture of both of you in your wallet.

69. Buy that favorite book or CD for no reason at all.

70. Send a care package to work filled with treats like food, photos, candy, a love note, heart-shaped confetti, etc.

71. Go out for the evening and tell people you're on your honeymoon.

72. Take a hike together and carve your initials in a tree.

73. Write a thank you note for all the things you take for granted.

74. Make a fire in the fireplace and roast marshmallows.

75. Tape your favorite TV show and spend the evening talking.

76. Do the dishes together, then apply hand lotion to each other's hands.

77. Write a love letter to your partner and cut it into jigsaw puzzle pieces.

78. Decide on secret signals and use them to communicate with each other in large groups of people.

79. Schedule a regular mid-week "date night" for just the two of you.

80. Do the laundry together.

81. Romance Theater Weekend: reenact each other's favorite love scene - hers on Friday, his on Saturday.

82. Call your partner at work and ask for a date.

83. Pretend you haven't seen each other for a month. Act accordingly.

84. Send a written invitation to do something special.

85. Take turns reading to each other.

86. Stand outside the window and sing a romantic song.

87. Hide favorite candy in your partner's coat pockets.

88. Put a tape recording of your voice (saying anything) in the car stereo and turn it on so it plays when the car starts.

89. Go to a drive-in movie.

90. Get up to turn off the last light after you're both comfy-cozy in bed.

91. Hold each other tight during a thunderstorm.

92. Make a tape recording of favorite love songs.

93. Leave a bunch of bananas on the kitchen table with a note, "I go bananas over you!"

94. Hide love notes in a magazine.

95. Declare your undying love via a telegram.

96. Make a romantic dinner together, and serve it on your finest china.

97. Surprise your partner with a big kiss on the neck.

98. Give unexpected compliments.

99. Share an ice cream cone.

100. Have a picnic on the living room floor.

101. Draw a silly picture of the two of you. Frame it. http://ping.fm/pEqGK
Quiz Start Time: 06:56 PM
Time Left
84
sec(s)

Question # 1 of 10 ( Start time: 06:56:28 PM )
Total Marks: 1
What is the time complexity to extract a vertex from the priority queue in Prim’s algorithm?
Select correct option:














Quiz Start Time: 06:56 PM
Time Left
86
sec(s)

Question # 2 of 10 ( Start time: 06:56:41 PM )
Total Marks: 1
What algorithm technique is used in the implementation of Kruskal solution for the MST?
Select correct option:














Quiz Start Time: 06:56 PM
Time Left
85
sec(s)

Question # 3 of 10 ( Start time: 06:56:51 PM )
Total Marks: 1
Which is true statement in the following.
Select correct option:














Quiz Start Time: 06:56 PM
Time Left
85
sec(s)

Question # 4 of 10 ( Start time: 06:57:02 PM )
Total Marks: 1
What is the time complexity to extract a vertex from the priority queue in Prim’s algorithm?
Select correct option:














Quiz Start Time: 06:56 PM
Time Left
87
sec(s)

Question # 5 of 10 ( Start time: 06:57:14 PM )
Total Marks: 1
You have an adjacency list for G, what is the time complexity to compute Graph transpose G^T ?
Select correct option:














Quiz Start Time: 06:56 PM
Time Left
85
sec(s)

Question # 6 of 10 ( Start time: 06:57:26 PM )
Total Marks: 1
A digraph is strongly connected under what condition?
Select correct option:














Quiz Start Time: 06:56 PM
Time Left
86
sec(s)

Question # 7 of 10 ( Start time: 06:57:37 PM )
Total Marks: 1
The relationship between number of back edges and number of cycles in DFS is,
Select correct option:














Quiz Start Time: 06:56 PM
Time Left
86
sec(s)

Question # 8 of 10 ( Start time: 06:57:47 PM )
Total Marks: 1
You have an adjacency list for G, what is the time complexity to compute Graph transpose G^T.?
Select correct option:










MC080408597 : Muhammad Asif



Quiz Start Time: 06:56 PM
Time Left
39
sec(s)

Question # 9 of 10 ( Start time: 06:57:58 PM )
Total Marks: 1
Dijkstra’s algorithm :
Select correct option:














Quiz Start Time: 06:56 PM
Time Left
85
sec(s)

Question # 10 of 10 ( Start time: 06:58:57 PM )
Total Marks: 1
There is relationship between number of back edges and number of cycles in DFS
Select correct option:
Quiz Start Time: 06:51 PM
Time Left 88
sec(s)
Question # 1 of 10 ( Start time: 06:51:48 PM ) Total Marks: 1
There is relationship between number of back edges and number of cycles in DFS
Select correct option:
Both are equal.
Cycles are half of back edges.
Cycles are one fourth of back edges.
There is no relationship between back edges and number of cycles.
Quiz Start Time: 06:51 PM
Time Left 88
sec(s)
Question # 2 of 10 ( Start time: 06:53:14 PM ) Total Marks: 1
You have an adjacency list for G, what is the time complexity to compute Graph
transpose G^T ?
Select correct option:
(V+E)
V.E
V
E
Quiz Start Time: 06:51 PM
Time Left 89
sec(s)
Question # 3 of 10 ( Start time: 06:54:27 PM ) Total Marks: 1
You have an adjacency list for G, what is the time complexity to compute Graph
transpose G^T.?
Select correct option:
? (V + E)
? (V E) ? (V)
? (V^2)
Quiz Start Time: 06:51 PM
Time Left 86
sec(s)
Question # 4 of 10 ( Start time: 06:55:25 PM ) Total Marks: 1
What is the time complexity to extract a vertex from the priority queue in Prim’s
algorithm?
Select correct option:
log (V)
V.V
E.E
log (E)
Quiz Start Time: 06:51 PM
Time Left 89
sec(s)
Question # 5 of 10 ( Start time: 06:56:52 PM ) Total Marks: 1
Dijkstra’s algorithm :
Select correct option:
Has greedy approach to find all shortest paths
Has both greedy and Dynamic approach to find all shortest paths
Has greedy approach to compute single source shortest paths to all
other vertices
Has both greedy and dynamic approach to compute single source shortest paths to
all other vertices.
Quiz Start Time: 06:51 PM
Time Left 87
sec(s)
Question # 6 of 10 ( Start time: 06:58:05 PM ) Total Marks: 1
What algorithm technique is used in the implementation of Kruskal solution for the
MST?
Select correct option:
Greedy Technique Divide-and-Conquer Technique
Dynamic Programming Technique
The algorithm combines more than one of the above techniques
Quiz Start Time: 06:51 PM
Time Left 82
sec(s)
Question # 7 of 10 ( Start time: 06:59:34 PM ) Total Marks: 1
What is the time complexity to extract a vertex from the priority queue in Prim’s
algorithm?
Select correct option:
O (log E)
? (V)
? (V+E)
O (log V)
Quiz Start Time: 06:51 PM
Time Left 85
sec(s)
Question # 8 of 10 ( Start time: 07:00:32 PM ) Total Marks: 1
Which is true statement in the following.
Select correct option:
Kruskal algorithm is multiple source technique for finding MST.
Kruskal’s algorithm is used to find minimum spanning tree of a graph, time
complexity of this algorithm is O(EV)
Both of above
Kruskal's algorithm (choose best non-cycle edge) is better than Prim's
(choose best Tree edge) when the graph has relatively few edges.
Quiz Start Time: 06:51 PM
Time Left 89
sec(s)
Question # 9 of 10 ( Start time: 07:01:44 PM ) Total Marks: 1
The relationship between number of back edges and number of cycles in DFS is, Select correct option:
Both are equal
Back edges are half of cycles
Back edges are one quarter of cycles
There is no relationship between no. of edges and cycles
Quiz Start Time: 06:51 PM
Time Left 88
sec(s)
Question # 10 of 10 ( Start time: 07:03:04 PM ) Total Marks: 1
Kruskal's algorithm (choose best non-cycle edge) is better than Prim's (choose best tree
edge) when the graph has relatively few edges.
Select correct option:
True
False
Quiz Start Time: 07:07 PM
Time Left 88
sec(s)
Question # 4 of 10 ( Start time: 07:09:45 PM ) Total Marks: 1
What is the time complexity to extract a vertex from the priority queue in Prim’s
algorithm?
Select correct option:
log (V)
V.V
E.E
log (E) http://ping.fm/6Gp8q
Quiz Start Time: 06:51 PM
Time Left 88
sec(s)
Question # 1 of 10 ( Start time: 06:51:48 PM ) Total Marks: 1
There is relationship between number of back edges and number of cycles in DFS
Select correct option:
Both are equal.
Cycles are half of back edges.
Cycles are one fourth of back edges.
There is no relationship between back edges and number of cycles.
Quiz Start Time: 06:51 PM
Time Left 88
sec(s)
Question # 2 of 10 ( Start time: 06:53:14 PM ) Total Marks: 1
You have an adjacency list for G, what is the time complexity to compute Graph
transpose G^T ?
Select correct option:
(V+E)
V.E
V
E
Quiz Start Time: 06:51 PM
Time Left 89
sec(s)
Question # 3 of 10 ( Start time: 06:54:27 PM ) Total Marks: 1
You have an adjacency list for G, what is the time complexity to compute Graph
transpose G^T.?
Select correct option:
? (V + E)
? (V E) ? (V)
? (V^2)
Quiz Start Time: 06:51 PM
Time Left 86
sec(s)
Question # 4 of 10 ( Start time: 06:55:25 PM ) Total Marks: 1
What is the time complexity to extract a vertex from the priority queue in Prim’s
algorithm?
Select correct option:
log (V)
V.V
E.E
log (E)
Quiz Start Time: 06:51 PM
Time Left 89
sec(s)
Question # 5 of 10 ( Start time: 06:56:52 PM ) Total Marks: 1
Dijkstra’s algorithm :
Select correct option:
Has greedy approach to find all shortest paths
Has both greedy and Dynamic approach to find all shortest paths
Has greedy approach to compute single source shortest paths to all
other vertices
Has both greedy and dynamic approach to compute single source shortest paths to
all other vertices.
Quiz Start Time: 06:51 PM
Time Left 87
sec(s)
Question # 6 of 10 ( Start time: 06:58:05 PM ) Total Marks: 1
What algorithm technique is used in the implementation of Kruskal solution for the
MST?
Select correct option:
Greedy Technique Divide-and-Conquer Technique
Dynamic Programming Technique
The algorithm combines more than one of the above techniques
Quiz Start Time: 06:51 PM
Time Left 82
sec(s)
Question # 7 of 10 ( Start time: 06:59:34 PM ) Total Marks: 1
What is the time complexity to extract a vertex from the priority queue in Prim’s
algorithm?
Select correct option:
O (log E)
? (V)
? (V+E)
O (log V)
Quiz Start Time: 06:51 PM
Time Left 85
sec(s)
Question # 8 of 10 ( Start time: 07:00:32 PM ) Total Marks: 1
Which is true statement in the following.
Select correct option:
Kruskal algorithm is multiple source technique for finding MST.
Kruskal’s algorithm is used to find minimum spanning tree of a graph, time
complexity of this algorithm is O(EV)
Both of above
Kruskal's algorithm (choose best non-cycle edge) is better than Prim's
(choose best Tree edge) when the graph has relatively few edges.
Quiz Start Time: 06:51 PM
Time Left 89
sec(s)
Question # 9 of 10 ( Start time: 07:01:44 PM ) Total Marks: 1
The relationship between number of back edges and number of cycles in DFS is, Select correct option:
Both are equal
Back edges are half of cycles
Back edges are one quarter of cycles
There is no relationship between no. of edges and cycles
Quiz Start Time: 06:51 PM
Time Left 88
sec(s)
Question # 10 of 10 ( Start time: 07:03:04 PM ) Total Marks: 1
Kruskal's algorithm (choose best non-cycle edge) is better than Prim's (choose best tree
edge) when the graph has relatively few edges.
Select correct option:
True
False
Quiz Start Time: 07:07 PM
Time Left 88
sec(s)
Question # 4 of 10 ( Start time: 07:09:45 PM ) Total Marks: 1
What is the time complexity to extract a vertex from the priority queue in Prim’s
algorithm?
Select correct option:
log (V)
V.V
E.E
log (E) http://ping.fm/lkMFv
Quiz Start Time: 06:51 PM
Time Left 88
sec(s)
Question # 1 of 10 ( Start time: 06:51:48 PM ) Total Marks: 1
There is relationship between number of back edges and number of cycles in DFS
Select correct option:
Both are equal.
Cycles are half of back edges.
Cycles are one fourth of back edges.
There is no relationship between back edges and number of cycles.
Quiz Start Time: 06:51 PM
Time Left 88
sec(s)
Question # 2 of 10 ( Start time: 06:53:14 PM ) Total Marks: 1
You have an adjacency list for G, what is the time complexity to compute Graph
transpose G^T ?
Select correct option:
(V+E)
V.E
V
E
Quiz Start Time: 06:51 PM
Time Left 89
sec(s)
Question # 3 of 10 ( Start time: 06:54:27 PM ) Total Marks: 1
You have an adjacency list for G, what is the time complexity to compute Graph
transpose G^T.?
Select correct option:
? (V + E)
? (V E) ? (V)
? (V^2)
Quiz Start Time: 06:51 PM
Time Left 86
sec(s)
Question # 4 of 10 ( Start time: 06:55:25 PM ) Total Marks: 1
What is the time complexity to extract a vertex from the priority queue in Prim’s
algorithm?
Select correct option:
log (V)
V.V
E.E
log (E)
Quiz Start Time: 06:51 PM
Time Left 89
sec(s)
Question # 5 of 10 ( Start time: 06:56:52 PM ) Total Marks: 1
Dijkstra’s algorithm :
Select correct option:
Has greedy approach to find all shortest paths
Has both greedy and Dynamic approach to find all shortest paths
Has greedy approach to compute single source shortest paths to all
other vertices
Has both greedy and dynamic approach to compute single source shortest paths to
all other vertices.
Quiz Start Time: 06:51 PM
Time Left 87
sec(s)
Question # 6 of 10 ( Start time: 06:58:05 PM ) Total Marks: 1
What algorithm technique is used in the implementation of Kruskal solution for the
MST?
Select correct option:
Greedy Technique Divide-and-Conquer Technique
Dynamic Programming Technique
The algorithm combines more than one of the above techniques
Quiz Start Time: 06:51 PM
Time Left 82
sec(s)
Question # 7 of 10 ( Start time: 06:59:34 PM ) Total Marks: 1
What is the time complexity to extract a vertex from the priority queue in Prim’s
algorithm?
Select correct option:
O (log E)
? (V)
? (V+E)
O (log V)
Quiz Start Time: 06:51 PM
Time Left 85
sec(s)
Question # 8 of 10 ( Start time: 07:00:32 PM ) Total Marks: 1
Which is true statement in the following.
Select correct option:
Kruskal algorithm is multiple source technique for finding MST.
Kruskal’s algorithm is used to find minimum spanning tree of a graph, time
complexity of this algorithm is O(EV)
Both of above
Kruskal's algorithm (choose best non-cycle edge) is better than Prim's
(choose best Tree edge) when the graph has relatively few edges.
Quiz Start Time: 06:51 PM
Time Left 89
sec(s)
Question # 9 of 10 ( Start time: 07:01:44 PM ) Total Marks: 1
The relationship between number of back edges and number of cycles in DFS is, Select correct option:
Both are equal
Back edges are half of cycles
Back edges are one quarter of cycles
There is no relationship between no. of edges and cycles
Quiz Start Time: 06:51 PM
Time Left 88
sec(s)
Question # 10 of 10 ( Start time: 07:03:04 PM ) Total Marks: 1
Kruskal's algorithm (choose best non-cycle edge) is better than Prim's (choose best tree
edge) when the graph has relatively few edges.
Select correct option:
True
False
Quiz Start Time: 07:07 PM
Time Left 88
sec(s)
Question # 4 of 10 ( Start time: 07:09:45 PM ) Total Marks: 1
What is the time complexity to extract a vertex from the priority queue in Prim’s
algorithm?
Select correct option:
log (V)
V.V
E.E
log (E) http://ping.fm/IZ9Nq
Quiz Start Time: 06:51 PM
Time Left 88
sec(s)
Question # 1 of 10 ( Start time: 06:51:48 PM ) Total Marks: 1
There is relationship between number of back edges and number of cycles in DFS
Select correct option:
Both are equal.
Cycles are half of back edges.
Cycles are one fourth of back edges.
There is no relationship between back edges and number of cycles.
Quiz Start Time: 06:51 PM
Time Left 88
sec(s)
Question # 2 of 10 ( Start time: 06:53:14 PM ) Total Marks: 1
You have an adjacency list for G, what is the time complexity to compute Graph
transpose G^T ?
Select correct option:
(V+E)
V.E
V
E
Quiz Start Time: 06:51 PM
Time Left 89
sec(s)
Question # 3 of 10 ( Start time: 06:54:27 PM ) Total Marks: 1
You have an adjacency list for G, what is the time complexity to compute Graph
transpose G^T.?
Select correct option:
? (V + E)
? (V E) ? (V)
? (V^2)
Quiz Start Time: 06:51 PM
Time Left 86
sec(s)
Question # 4 of 10 ( Start time: 06:55:25 PM ) Total Marks: 1
What is the time complexity to extract a vertex from the priority queue in Prim’s
algorithm?
Select correct option:
log (V)
V.V
E.E
log (E)
Quiz Start Time: 06:51 PM
Time Left 89
sec(s)
Question # 5 of 10 ( Start time: 06:56:52 PM ) Total Marks: 1
Dijkstra’s algorithm :
Select correct option:
Has greedy approach to find all shortest paths
Has both greedy and Dynamic approach to find all shortest paths
Has greedy approach to compute single source shortest paths to all
other vertices
Has both greedy and dynamic approach to compute single source shortest paths to
all other vertices.
Quiz Start Time: 06:51 PM
Time Left 87
sec(s)
Question # 6 of 10 ( Start time: 06:58:05 PM ) Total Marks: 1
What algorithm technique is used in the implementation of Kruskal solution for the
MST?
Select correct option:
Greedy Technique Divide-and-Conquer Technique
Dynamic Programming Technique
The algorithm combines more than one of the above techniques
Quiz Start Time: 06:51 PM
Time Left 82
sec(s)
Question # 7 of 10 ( Start time: 06:59:34 PM ) Total Marks: 1
What is the time complexity to extract a vertex from the priority queue in Prim’s
algorithm?
Select correct option:
O (log E)
? (V)
? (V+E)
O (log V)
Quiz Start Time: 06:51 PM
Time Left 85
sec(s)
Question # 8 of 10 ( Start time: 07:00:32 PM ) Total Marks: 1
Which is true statement in the following.
Select correct option:
Kruskal algorithm is multiple source technique for finding MST.
Kruskal’s algorithm is used to find minimum spanning tree of a graph, time
complexity of this algorithm is O(EV)
Both of above
Kruskal's algorithm (choose best non-cycle edge) is better than Prim's
(choose best Tree edge) when the graph has relatively few edges.
Quiz Start Time: 06:51 PM
Time Left 89
sec(s)
Question # 9 of 10 ( Start time: 07:01:44 PM ) Total Marks: 1
The relationship between number of back edges and number of cycles in DFS is, Select correct option:
Both are equal
Back edges are half of cycles
Back edges are one quarter of cycles
There is no relationship between no. of edges and cycles
Quiz Start Time: 06:51 PM
Time Left 88
sec(s)
Question # 10 of 10 ( Start time: 07:03:04 PM ) Total Marks: 1
Kruskal's algorithm (choose best non-cycle edge) is better than Prim's (choose best tree
edge) when the graph has relatively few edges.
Select correct option:
True
False
Quiz Start Time: 07:07 PM
Time Left 88
sec(s)
Question # 4 of 10 ( Start time: 07:09:45 PM ) Total Marks: 1
What is the time complexity to extract a vertex from the priority queue in Prim’s
algorithm?
Select correct option:
log (V)
V.V
E.E
log (E) http://ping.fm/2NNYw
Quiz Start Time: 06:51 PM
Time Left 88
sec(s)
Question # 1 of 10 ( Start time: 06:51:48 PM ) Total Marks: 1
There is relationship between number of back edges and number of cycles in DFS
Select correct option:
Both are equal.
Cycles are half of back edges.
Cycles are one fourth of back edges.
There is no relationship between back edges and number of cycles.
Quiz Start Time: 06:51 PM
Time Left 88
sec(s)
Question # 2 of 10 ( Start time: 06:53:14 PM ) Total Marks: 1
You have an adjacency list for G, what is the time complexity to compute Graph
transpose G^T ?
Select correct option:
(V+E)
V.E
V
E
Quiz Start Time: 06:51 PM
Time Left 89
sec(s)
Question # 3 of 10 ( Start time: 06:54:27 PM ) Total Marks: 1
You have an adjacency list for G, what is the time complexity to compute Graph
transpose G^T.?
Select correct option:
? (V + E)
? (V E) ? (V)
? (V^2)
Quiz Start Time: 06:51 PM
Time Left 86
sec(s)
Question # 4 of 10 ( Start time: 06:55:25 PM ) Total Marks: 1
What is the time complexity to extract a vertex from the priority queue in Prim’s
algorithm?
Select correct option:
log (V)
V.V
E.E
log (E)
Quiz Start Time: 06:51 PM
Time Left 89
sec(s)
Question # 5 of 10 ( Start time: 06:56:52 PM ) Total Marks: 1
Dijkstra’s algorithm :
Select correct option:
Has greedy approach to find all shortest paths
Has both greedy and Dynamic approach to find all shortest paths
Has greedy approach to compute single source shortest paths to all
other vertices
Has both greedy and dynamic approach to compute single source shortest paths to
all other vertices.
Quiz Start Time: 06:51 PM
Time Left 87
sec(s)
Question # 6 of 10 ( Start time: 06:58:05 PM ) Total Marks: 1
What algorithm technique is used in the implementation of Kruskal solution for the
MST?
Select correct option:
Greedy Technique Divide-and-Conquer Technique
Dynamic Programming Technique
The algorithm combines more than one of the above techniques
Quiz Start Time: 06:51 PM
Time Left 82
sec(s)
Question # 7 of 10 ( Start time: 06:59:34 PM ) Total Marks: 1
What is the time complexity to extract a vertex from the priority queue in Prim’s
algorithm?
Select correct option:
O (log E)
? (V)
? (V+E)
O (log V)
Quiz Start Time: 06:51 PM
Time Left 85
sec(s)
Question # 8 of 10 ( Start time: 07:00:32 PM ) Total Marks: 1
Which is true statement in the following.
Select correct option:
Kruskal algorithm is multiple source technique for finding MST.
Kruskal’s algorithm is used to find minimum spanning tree of a graph, time
complexity of this algorithm is O(EV)
Both of above
Kruskal's algorithm (choose best non-cycle edge) is better than Prim's
(choose best Tree edge) when the graph has relatively few edges.
Quiz Start Time: 06:51 PM
Time Left 89
sec(s)
Question # 9 of 10 ( Start time: 07:01:44 PM ) Total Marks: 1
The relationship between number of back edges and number of cycles in DFS is, Select correct option:
Both are equal
Back edges are half of cycles
Back edges are one quarter of cycles
There is no relationship between no. of edges and cycles
Quiz Start Time: 06:51 PM
Time Left 88
sec(s)
Question # 10 of 10 ( Start time: 07:03:04 PM ) Total Marks: 1
Kruskal's algorithm (choose best non-cycle edge) is better than Prim's (choose best tree
edge) when the graph has relatively few edges.
Select correct option:
True
False
Quiz Start Time: 07:07 PM
Time Left 88
sec(s)
Question # 4 of 10 ( Start time: 07:09:45 PM ) Total Marks: 1
What is the time complexity to extract a vertex from the priority queue in Prim’s
algorithm?
Select correct option:
log (V)
V.V
E.E
log (E) http://ping.fm/RaXZ1
cs502 mcq's, mid term, final term, vu past mcq, quiz mcq of vu cs502, new mcq's
Question # 1 of 10 ( Start time: 11:09:54 AM ) Total Marks: 1
What is the time complexity to extract a vertex from the priority queue in Prim’s algorithm?
Select correct option:
log (V)
V.V
E.E
log (E)
Question # 2 of 10 ( Start time: 11:11:24 AM ) Total Marks: 1
A digraph is strongly connected under what condition?
Select correct option:
A digraph is strongly connected if for every pair of vertices u, v e V, u can reach v .
pair of vertices u, v e V, u can reach v and vice versa.
A digraph is strongly connected if for at least one pair of vertex u, v e V, u can reach v and vice versa.
pair of vertices u, v e V, u can reach v and vice versa.
Question # 3 of 10 ( Start time: 11:13:00 AM ) Total Marks: 1
What is the time complexity to extract a vertex from the priority queue in Prim’s algorithm?
Select correct option:
O (log E)
? (V)
? (V+E)
O (log V)
Question # 4 of 10 ( Start time: 11:14:35 AM ) Total Marks: 1
The relationship between number of back edges and number of cycles in DFS is,
Select correct option:
Both are equal
Back edges are half of cycles
Back edges are one quarter of cycles
There is no relationship between no. of edges and cycles
Question # 5 of 10 ( Start time: 11:16:10 AM ) Total Marks: 1
You have an adjacency list for G, what is the time complexity to compute Graph transpose G^T.?
Select correct option:
? (V + E)
? (V E)
? (V)
? (V^2)
Question # 6 of 10 ( Start time: 11:17:24 AM ) Total Marks: 1
What algorithm technique is used in the implementation of Kruskal solution for the MST?
Select correct option:
Greedy Technique
Divide-and-Conquer Technique
Dynamic Programming Technique
algorithm combines more than one of the above techniques
Question # 7 of 10 ( Start time: 11:18:17 AM ) Total Marks: 1
You have an adjacency list for G, what is the time complexity to compute Graph transpose G^T ?
Select correct option:
? (V)
? (V+E)
V
E
Question # 8 of 10 ( Start time: 11:18:44 AM ) Total Marks: 1
Which is true statement in the following.
Select correct option:
Kruskal algorithm is multiple source technique for finding MST.
of a graph, time complexity of this algorithm is O(EV)
Both of above
Question # 9 of 10 ( Start time: 11:20:18 AM ) Total Marks: 1
There is relationship between number of back edges and number of cycles in DFS
Select correct option:




Question # 10 of 10 ( Start time: 11:21:10 AM ) Total Marks: 1
Kruskal’s algorithm (choose best non-cycle edge) is better than Prim’s (choose best tree edge) when the graph has relatively few edges.
Select correct option:
http://ping.fm/SAuNZ
cs502 mcq's, mid term, final term, vu past mcq, quiz mcq of vu cs502, new mcq's
Question # 1 of 10 ( Start time: 11:09:54 AM ) Total Marks: 1
What is the time complexity to extract a vertex from the priority queue in Prim’s algorithm?
Select correct option:
log (V)
V.V
E.E
log (E)
Question # 2 of 10 ( Start time: 11:11:24 AM ) Total Marks: 1
A digraph is strongly connected under what condition?
Select correct option:
A digraph is strongly connected if for every pair of vertices u, v e V, u can reach v .
pair of vertices u, v e V, u can reach v and vice versa.
A digraph is strongly connected if for at least one pair of vertex u, v e V, u can reach v and vice versa.
pair of vertices u, v e V, u can reach v and vice versa.
Question # 3 of 10 ( Start time: 11:13:00 AM ) Total Marks: 1
What is the time complexity to extract a vertex from the priority queue in Prim’s algorithm?
Select correct option:
O (log E)
? (V)
? (V+E)
O (log V)
Question # 4 of 10 ( Start time: 11:14:35 AM ) Total Marks: 1
The relationship between number of back edges and number of cycles in DFS is,
Select correct option:
Both are equal
Back edges are half of cycles
Back edges are one quarter of cycles
There is no relationship between no. of edges and cycles
Question # 5 of 10 ( Start time: 11:16:10 AM ) Total Marks: 1
You have an adjacency list for G, what is the time complexity to compute Graph transpose G^T.?
Select correct option:
? (V + E)
? (V E)
? (V)
? (V^2)
Question # 6 of 10 ( Start time: 11:17:24 AM ) Total Marks: 1
What algorithm technique is used in the implementation of Kruskal solution for the MST?
Select correct option:
Greedy Technique
Divide-and-Conquer Technique
Dynamic Programming Technique
algorithm combines more than one of the above techniques
Question # 7 of 10 ( Start time: 11:18:17 AM ) Total Marks: 1
You have an adjacency list for G, what is the time complexity to compute Graph transpose G^T ?
Select correct option:
? (V)
? (V+E)
V
E
Question # 8 of 10 ( Start time: 11:18:44 AM ) Total Marks: 1
Which is true statement in the following.
Select correct option:
Kruskal algorithm is multiple source technique for finding MST.
of a graph, time complexity of this algorithm is O(EV)
Both of above
Question # 9 of 10 ( Start time: 11:20:18 AM ) Total Marks: 1
There is relationship between number of back edges and number of cycles in DFS
Select correct option:




Question # 10 of 10 ( Start time: 11:21:10 AM ) Total Marks: 1
Kruskal’s algorithm (choose best non-cycle edge) is better than Prim’s (choose best tree edge) when the graph has relatively few edges.
Select correct option:
http://ping.fm/0ot7c
cs502 mcq's, mid term, final term, vu past mcq, quiz mcq of vu cs502, new mcq's
Question # 1 of 10 ( Start time: 11:09:54 AM ) Total Marks: 1
What is the time complexity to extract a vertex from the priority queue in Prim’s algorithm?
Select correct option:
log (V)
V.V
E.E
log (E)
Question # 2 of 10 ( Start time: 11:11:24 AM ) Total Marks: 1
A digraph is strongly connected under what condition?
Select correct option:
A digraph is strongly connected if for every pair of vertices u, v e V, u can reach v .
pair of vertices u, v e V, u can reach v and vice versa.
A digraph is strongly connected if for at least one pair of vertex u, v e V, u can reach v and vice versa.
pair of vertices u, v e V, u can reach v and vice versa.
Question # 3 of 10 ( Start time: 11:13:00 AM ) Total Marks: 1
What is the time complexity to extract a vertex from the priority queue in Prim’s algorithm?
Select correct option:
O (log E)
? (V)
? (V+E)
O (log V)
Question # 4 of 10 ( Start time: 11:14:35 AM ) Total Marks: 1
The relationship between number of back edges and number of cycles in DFS is,
Select correct option:
Both are equal
Back edges are half of cycles
Back edges are one quarter of cycles
There is no relationship between no. of edges and cycles
Question # 5 of 10 ( Start time: 11:16:10 AM ) Total Marks: 1
You have an adjacency list for G, what is the time complexity to compute Graph transpose G^T.?
Select correct option:
? (V + E)
? (V E)
? (V)
? (V^2)
Question # 6 of 10 ( Start time: 11:17:24 AM ) Total Marks: 1
What algorithm technique is used in the implementation of Kruskal solution for the MST?
Select correct option:
Greedy Technique
Divide-and-Conquer Technique
Dynamic Programming Technique
algorithm combines more than one of the above techniques
Question # 7 of 10 ( Start time: 11:18:17 AM ) Total Marks: 1
You have an adjacency list for G, what is the time complexity to compute Graph transpose G^T ?
Select correct option:
? (V)
? (V+E)
V
E
Question # 8 of 10 ( Start time: 11:18:44 AM ) Total Marks: 1
Which is true statement in the following.
Select correct option:
Kruskal algorithm is multiple source technique for finding MST.
of a graph, time complexity of this algorithm is O(EV)
Both of above
Question # 9 of 10 ( Start time: 11:20:18 AM ) Total Marks: 1
There is relationship between number of back edges and number of cycles in DFS
Select correct option:




Question # 10 of 10 ( Start time: 11:21:10 AM ) Total Marks: 1
Kruskal’s algorithm (choose best non-cycle edge) is better than Prim’s (choose best tree edge) when the graph has relatively few edges.
Select correct option:
http://ping.fm/X0eFB
cs502 mcq's, mid term, final term, vu past mcq, quiz mcq of vu cs502, new mcq's
Question # 1 of 10 ( Start time: 11:09:54 AM ) Total Marks: 1
What is the time complexity to extract a vertex from the priority queue in Prim’s algorithm?
Select correct option:
log (V)
V.V
E.E
log (E)
Question # 2 of 10 ( Start time: 11:11:24 AM ) Total Marks: 1
A digraph is strongly connected under what condition?
Select correct option:
A digraph is strongly connected if for every pair of vertices u, v e V, u can reach v .
pair of vertices u, v e V, u can reach v and vice versa.
A digraph is strongly connected if for at least one pair of vertex u, v e V, u can reach v and vice versa.
pair of vertices u, v e V, u can reach v and vice versa.
Question # 3 of 10 ( Start time: 11:13:00 AM ) Total Marks: 1
What is the time complexity to extract a vertex from the priority queue in Prim’s algorithm?
Select correct option:
O (log E)
? (V)
? (V+E)
O (log V)
Question # 4 of 10 ( Start time: 11:14:35 AM ) Total Marks: 1
The relationship between number of back edges and number of cycles in DFS is,
Select correct option:
Both are equal
Back edges are half of cycles
Back edges are one quarter of cycles
There is no relationship between no. of edges and cycles
Question # 5 of 10 ( Start time: 11:16:10 AM ) Total Marks: 1
You have an adjacency list for G, what is the time complexity to compute Graph transpose G^T.?
Select correct option:
? (V + E)
? (V E)
? (V)
? (V^2)
Question # 6 of 10 ( Start time: 11:17:24 AM ) Total Marks: 1
What algorithm technique is used in the implementation of Kruskal solution for the MST?
Select correct option:
Greedy Technique
Divide-and-Conquer Technique
Dynamic Programming Technique
algorithm combines more than one of the above techniques
Question # 7 of 10 ( Start time: 11:18:17 AM ) Total Marks: 1
You have an adjacency list for G, what is the time complexity to compute Graph transpose G^T ?
Select correct option:
? (V)
? (V+E)
V
E
Question # 8 of 10 ( Start time: 11:18:44 AM ) Total Marks: 1
Which is true statement in the following.
Select correct option:
Kruskal algorithm is multiple source technique for finding MST.
of a graph, time complexity of this algorithm is O(EV)
Both of above
Question # 9 of 10 ( Start time: 11:20:18 AM ) Total Marks: 1
There is relationship between number of back edges and number of cycles in DFS
Select correct option:




Question # 10 of 10 ( Start time: 11:21:10 AM ) Total Marks: 1
Kruskal’s algorithm (choose best non-cycle edge) is better than Prim’s (choose best tree edge) when the graph has relatively few edges.
Select correct option:
http://ping.fm/wV7dP
cs502 mcq's, mid term, final term, vu past mcq, quiz mcq of vu cs502, new mcq's
Question # 1 of 10 ( Start time: 11:09:54 AM ) Total Marks: 1
What is the time complexity to extract a vertex from the priority queue in Prim’s algorithm?
Select correct option:
log (V)
V.V
E.E
log (E)
Question # 2 of 10 ( Start time: 11:11:24 AM ) Total Marks: 1
A digraph is strongly connected under what condition?
Select correct option:
A digraph is strongly connected if for every pair of vertices u, v e V, u can reach v .
pair of vertices u, v e V, u can reach v and vice versa.
A digraph is strongly connected if for at least one pair of vertex u, v e V, u can reach v and vice versa.
pair of vertices u, v e V, u can reach v and vice versa.
Question # 3 of 10 ( Start time: 11:13:00 AM ) Total Marks: 1
What is the time complexity to extract a vertex from the priority queue in Prim’s algorithm?
Select correct option:
O (log E)
? (V)
? (V+E)
O (log V)
Question # 4 of 10 ( Start time: 11:14:35 AM ) Total Marks: 1
The relationship between number of back edges and number of cycles in DFS is,
Select correct option:
Both are equal
Back edges are half of cycles
Back edges are one quarter of cycles
There is no relationship between no. of edges and cycles
Question # 5 of 10 ( Start time: 11:16:10 AM ) Total Marks: 1
You have an adjacency list for G, what is the time complexity to compute Graph transpose G^T.?
Select correct option:
? (V + E)
? (V E)
? (V)
? (V^2)
Question # 6 of 10 ( Start time: 11:17:24 AM ) Total Marks: 1
What algorithm technique is used in the implementation of Kruskal solution for the MST?
Select correct option:
Greedy Technique
Divide-and-Conquer Technique
Dynamic Programming Technique
algorithm combines more than one of the above techniques
Question # 7 of 10 ( Start time: 11:18:17 AM ) Total Marks: 1
You have an adjacency list for G, what is the time complexity to compute Graph transpose G^T ?
Select correct option:
? (V)
? (V+E)
V
E
Question # 8 of 10 ( Start time: 11:18:44 AM ) Total Marks: 1
Which is true statement in the following.
Select correct option:
Kruskal algorithm is multiple source technique for finding MST.
of a graph, time complexity of this algorithm is O(EV)
Both of above
Question # 9 of 10 ( Start time: 11:20:18 AM ) Total Marks: 1
There is relationship between number of back edges and number of cycles in DFS
Select correct option:




Question # 10 of 10 ( Start time: 11:21:10 AM ) Total Marks: 1
Kruskal’s algorithm (choose best non-cycle edge) is better than Prim’s (choose best tree edge) when the graph has relatively few edges.
Select correct option:
http://ping.fm/Wh2TY
mcq's of cs 502, final term k leay helping mcq, quiz or mid term k leay mcq
Quiz Start Time: 04:46 PM Time Left 87
sec(s)


Question # 1 of 10 ( Start time: 04:46:06 PM ) Total Marks: 1
A dense undirected graph is:
Select correct option:

A graph in which E = O(V^2)
A graph in which E = O(V)
A graph in which E = O(log V)
All items above may be used to characterize a dense undirected graph






Vu.ysapak



Quiz Start Time: 04:46 PM Time Left 42
sec(s)


Question # 2 of 10 ( Start time: 04:46:54 PM ) Total Marks: 1
What general property of the list indicates that the graph has an
isolated vertex?
Select correct option:

There is Null pointer at the end of list.
The Isolated vertex is not handled in list.
Only one value is entered in the list.
There is at least one null list.






Vu.ysapak



Quiz Start Time: 04:46 PM Time Left 11
sec(s)


Question # 3 of 10 ( Start time: 04:47:50 PM ) Total Marks: 1
Suppose that a graph G = (V,E) is implemented using adjacency lists.
What is the complexity of a breadth-first traversal of G?
Select correct option:

O(|V |^2)
O(|V | |E|)
O(|V |^2|E|)
O(|V | + |E|)


Saving...



Vu.ysapak



Quiz Start Time: 04:46 PM Time Left 72
sec(s)


Question # 4 of 10 ( Start time: 04:49:14 PM ) Total Marks: 1
Forward edge is:
Select correct option:

(u, v) where u is a proper descendent of v in the tree.
(u, v) where v is a proper descendent of u in the tree.
(u, v) where v is a proper ancesstor of u in the tree.
(u, v) where u is a proper ancesstor of v in the tree.






Vu.ysapak



Quiz Start Time: 04:46 PM Time Left 32
sec(s)


Question # 5 of 10 ( Start time: 04:49:40 PM ) Total Marks: 1
In digraph G=(V,E) ;G has cycle if and only if
Select correct option:

The DFS forest has forward edge.
The DFS forest has back edge
The DFS forest has both back and forward edge
BFS forest has forward edge






Vu.ysapak



Quiz Start Time: 04:46 PM Time Left 55
sec(s)


Question # 6 of 10 ( Start time: 04:51:05 PM ) Total Marks: 1
Which is true statement.
Select correct option:

Breadth first search is shortest path algorithm that works on
un-weighted graphs
Depth first search is shortest path algorithm that works on
un-weighted graphs.
Both of above are true.
None of above are true.






Vu.ysapak



Quiz Start Time: 04:46 PM Time Left 38
sec(s)


Question # 7 of 10 ( Start time: 04:51:49 PM ) Total Marks: 1
If you find yourself in maze the better traversel approach will be :
Select correct option:

BFS
BFS and DFS both are valid
Level order
DFS






Vu.ysapak



Quiz Start Time: 04:46 PM Time Left 67
sec(s)


Question # 8 of 10 ( Start time: 04:52:48 PM ) Total Marks: 1
Cross edge is :
Select correct option:

(u, v) where u and v are not ancestor of one another
(u, v) where u is ancesstor of v and v is not descendent of u.
(u, v) where u and v are not ancestor or descendent of one another
(u, v) where u and v are either ancestor or descendent of one another.






Vu.ysapak



Quiz Start Time: 04:46 PM Time Left 71
sec(s)


Question # 10 of 10 ( Start time: 04:54:21 PM ) Total Marks: 1
Back edge is:
Select correct option:

(u, v) where v is an ancestor of u in the tree.
(u,v) where u is an ancesstor of v in the tree.
(u, v) where v is an predcessor of u in the tree.
None of above





Vu.ysapak



Quiz Start Time: 04:56 PM Time Left 51
sec(s)


Question # 1 of 10 ( Start time: 04:56:46 PM ) Total Marks: 1
The ___________ suggests identifying goals and questions first before
selecting techniques for the study
Select correct option:

RVM model
DECIDE framework (answer)
Usability testing
Field study




Vu.ysapak



Quiz Start Time: 04:56 PM Time Left 61
sec(s)


Question # 2 of 10 ( Start time: 04:57:42 PM ) Total Marks: 1
____________ represent the user's expectations of the tangible
outcomes of using a specific product.
Select correct option:

Non-user goals
End goals (answer)
Experience goals
Life goals





Vu.ysapak



Quiz Start Time: 04:56 PM Time Left 29
sec(s)


Question # 3 of 10 ( Start time: 04:58:28 PM ) Total Marks: 1
________ represents the Early-phase of ethnographic interviews.
Select correct option:

Clarify user roles and behaviors.
Confirm patterns of use.
Clarifying questions.
Focused on domain knowledge.






Vu.ysapak



Quiz Start Time: 04:56 PM Time Left 29
sec(s)


Question # 4 of 10 ( Start time: 05:00:02 PM ) Total Marks: 1
What is the fourth step in defining the requirements with respect to
persona-based design?
Select correct option:

Creating problem and vision statement.
Brainstorming.
Identifying persona expectations.
Constructing the context scenario. (answer)



Vu.ysapak



Quiz Start Time: 04:56 PM Time Left 42
sec(s)


Question # 5 of 10 ( Start time: 05:01:17 PM ) Total Marks: 1
Recalling password is ____________ work.
Select correct option:

Logical
Mnemonic (answer)
Physical
Structural






Vu.ysapak



Quiz Start Time: 04:56 PM Time Left 13
sec(s)


Question # 6 of 10 ( Start time: 05:02:14 PM ) Total Marks: 1
This is not a characteristic of usability test
Select correct option:

The primary goal is to improve usability
The participants do not represent real users
Observe and record what participants do and say
None of the given






Vu.ysapak



Quiz Start Time: 04:56 PM Time Left 1
sec(s)


Question # 7 of 10 ( Start time: 05:03:39 PM ) Total Marks: 1
Goal-oriented context scenarios are _____________ task-oriented than
key path scenario
Select correct option:

Less
Alike
More (answer)
None of the given


Saving...



Vu.ysapak



Quiz Start Time: 04:56 PM Time Left 1
sec(s)


Question # 8 of 10 ( Start time: 05:05:16 PM ) Total Marks: 1
In DECIDE frame work _______________ comes just after choosing the
evaluation paradigm and techniques.
Select correct option:

Deciding about ethical issues (answer)
Exploring the questions
Identifying the practical issues
None of the given


Saving...



Vu.ysapak



Quiz Start Time: 04:56 PM Time Left 37
sec(s)


Question # 9 of 10 ( Start time: 05:06:52 PM ) Total Marks: 1
What do you enjoy most about your job (or lifestyle) is an example of
_________.
Select correct option:

Avoidance
Motivation (answer)
Exceptions
Attitude-oriented questions






Vu.ysapak



Quiz Start Time: 04:56 PM Time Left 55
sec(s)


Question # 10 of 10 ( Start time: 05:07:53 PM ) Total Marks: 1
Information sites with daily-updated information will naturally
attract ____________ users more than a monthly-updated site.
Select correct option:

Repeat (answer)
Infrequent
Nonuser
None of the given
http://ping.fm/GcFFm
mcq's of cs 502, final term k leay helping mcq, quiz or mid term k leay mcq
Quiz Start Time: 04:46 PM Time Left 87
sec(s)


Question # 1 of 10 ( Start time: 04:46:06 PM ) Total Marks: 1
A dense undirected graph is:
Select correct option:

A graph in which E = O(V^2)
A graph in which E = O(V)
A graph in which E = O(log V)
All items above may be used to characterize a dense undirected graph






Vu.ysapak



Quiz Start Time: 04:46 PM Time Left 42
sec(s)


Question # 2 of 10 ( Start time: 04:46:54 PM ) Total Marks: 1
What general property of the list indicates that the graph has an
isolated vertex?
Select correct option:

There is Null pointer at the end of list.
The Isolated vertex is not handled in list.
Only one value is entered in the list.
There is at least one null list.






Vu.ysapak



Quiz Start Time: 04:46 PM Time Left 11
sec(s)


Question # 3 of 10 ( Start time: 04:47:50 PM ) Total Marks: 1
Suppose that a graph G = (V,E) is implemented using adjacency lists.
What is the complexity of a breadth-first traversal of G?
Select correct option:

O(|V |^2)
O(|V | |E|)
O(|V |^2|E|)
O(|V | + |E|)


Saving...



Vu.ysapak



Quiz Start Time: 04:46 PM Time Left 72
sec(s)


Question # 4 of 10 ( Start time: 04:49:14 PM ) Total Marks: 1
Forward edge is:
Select correct option:

(u, v) where u is a proper descendent of v in the tree.
(u, v) where v is a proper descendent of u in the tree.
(u, v) where v is a proper ancesstor of u in the tree.
(u, v) where u is a proper ancesstor of v in the tree.






Vu.ysapak



Quiz Start Time: 04:46 PM Time Left 32
sec(s)


Question # 5 of 10 ( Start time: 04:49:40 PM ) Total Marks: 1
In digraph G=(V,E) ;G has cycle if and only if
Select correct option:

The DFS forest has forward edge.
The DFS forest has back edge
The DFS forest has both back and forward edge
BFS forest has forward edge






Vu.ysapak



Quiz Start Time: 04:46 PM Time Left 55
sec(s)


Question # 6 of 10 ( Start time: 04:51:05 PM ) Total Marks: 1
Which is true statement.
Select correct option:

Breadth first search is shortest path algorithm that works on
un-weighted graphs
Depth first search is shortest path algorithm that works on
un-weighted graphs.
Both of above are true.
None of above are true.






Vu.ysapak



Quiz Start Time: 04:46 PM Time Left 38
sec(s)


Question # 7 of 10 ( Start time: 04:51:49 PM ) Total Marks: 1
If you find yourself in maze the better traversel approach will be :
Select correct option:

BFS
BFS and DFS both are valid
Level order
DFS






Vu.ysapak



Quiz Start Time: 04:46 PM Time Left 67
sec(s)


Question # 8 of 10 ( Start time: 04:52:48 PM ) Total Marks: 1
Cross edge is :
Select correct option:

(u, v) where u and v are not ancestor of one another
(u, v) where u is ancesstor of v and v is not descendent of u.
(u, v) where u and v are not ancestor or descendent of one another
(u, v) where u and v are either ancestor or descendent of one another.






Vu.ysapak



Quiz Start Time: 04:46 PM Time Left 71
sec(s)


Question # 10 of 10 ( Start time: 04:54:21 PM ) Total Marks: 1
Back edge is:
Select correct option:

(u, v) where v is an ancestor of u in the tree.
(u,v) where u is an ancesstor of v in the tree.
(u, v) where v is an predcessor of u in the tree.
None of above





Vu.ysapak



Quiz Start Time: 04:56 PM Time Left 51
sec(s)


Question # 1 of 10 ( Start time: 04:56:46 PM ) Total Marks: 1
The ___________ suggests identifying goals and questions first before
selecting techniques for the study
Select correct option:

RVM model
DECIDE framework (answer)
Usability testing
Field study




Vu.ysapak



Quiz Start Time: 04:56 PM Time Left 61
sec(s)


Question # 2 of 10 ( Start time: 04:57:42 PM ) Total Marks: 1
____________ represent the user's expectations of the tangible
outcomes of using a specific product.
Select correct option:

Non-user goals
End goals (answer)
Experience goals
Life goals





Vu.ysapak



Quiz Start Time: 04:56 PM Time Left 29
sec(s)


Question # 3 of 10 ( Start time: 04:58:28 PM ) Total Marks: 1
________ represents the Early-phase of ethnographic interviews.
Select correct option:

Clarify user roles and behaviors.
Confirm patterns of use.
Clarifying questions.
Focused on domain knowledge.






Vu.ysapak



Quiz Start Time: 04:56 PM Time Left 29
sec(s)


Question # 4 of 10 ( Start time: 05:00:02 PM ) Total Marks: 1
What is the fourth step in defining the requirements with respect to
persona-based design?
Select correct option:

Creating problem and vision statement.
Brainstorming.
Identifying persona expectations.
Constructing the context scenario. (answer)



Vu.ysapak



Quiz Start Time: 04:56 PM Time Left 42
sec(s)


Question # 5 of 10 ( Start time: 05:01:17 PM ) Total Marks: 1
Recalling password is ____________ work.
Select correct option:

Logical
Mnemonic (answer)
Physical
Structural






Vu.ysapak



Quiz Start Time: 04:56 PM Time Left 13
sec(s)


Question # 6 of 10 ( Start time: 05:02:14 PM ) Total Marks: 1
This is not a characteristic of usability test
Select correct option:

The primary goal is to improve usability
The participants do not represent real users
Observe and record what participants do and say
None of the given






Vu.ysapak



Quiz Start Time: 04:56 PM Time Left 1
sec(s)


Question # 7 of 10 ( Start time: 05:03:39 PM ) Total Marks: 1
Goal-oriented context scenarios are _____________ task-oriented than
key path scenario
Select correct option:

Less
Alike
More (answer)
None of the given


Saving...



Vu.ysapak



Quiz Start Time: 04:56 PM Time Left 1
sec(s)


Question # 8 of 10 ( Start time: 05:05:16 PM ) Total Marks: 1
In DECIDE frame work _______________ comes just after choosing the
evaluation paradigm and techniques.
Select correct option:

Deciding about ethical issues (answer)
Exploring the questions
Identifying the practical issues
None of the given


Saving...



Vu.ysapak



Quiz Start Time: 04:56 PM Time Left 37
sec(s)


Question # 9 of 10 ( Start time: 05:06:52 PM ) Total Marks: 1
What do you enjoy most about your job (or lifestyle) is an example of
_________.
Select correct option:

Avoidance
Motivation (answer)
Exceptions
Attitude-oriented questions






Vu.ysapak



Quiz Start Time: 04:56 PM Time Left 55
sec(s)


Question # 10 of 10 ( Start time: 05:07:53 PM ) Total Marks: 1
Information sites with daily-updated information will naturally
attract ____________ users more than a monthly-updated site.
Select correct option:

Repeat (answer)
Infrequent
Nonuser
None of the given
http://ping.fm/lGNfO
mcq's of cs 502, final term k leay helping mcq, quiz or mid term k leay mcq
Quiz Start Time: 04:46 PM Time Left 87
sec(s)


Question # 1 of 10 ( Start time: 04:46:06 PM ) Total Marks: 1
A dense undirected graph is:
Select correct option:

A graph in which E = O(V^2)
A graph in which E = O(V)
A graph in which E = O(log V)
All items above may be used to characterize a dense undirected graph






Vu.ysapak



Quiz Start Time: 04:46 PM Time Left 42
sec(s)


Question # 2 of 10 ( Start time: 04:46:54 PM ) Total Marks: 1
What general property of the list indicates that the graph has an
isolated vertex?
Select correct option:

There is Null pointer at the end of list.
The Isolated vertex is not handled in list.
Only one value is entered in the list.
There is at least one null list.






Vu.ysapak



Quiz Start Time: 04:46 PM Time Left 11
sec(s)


Question # 3 of 10 ( Start time: 04:47:50 PM ) Total Marks: 1
Suppose that a graph G = (V,E) is implemented using adjacency lists.
What is the complexity of a breadth-first traversal of G?
Select correct option:

O(|V |^2)
O(|V | |E|)
O(|V |^2|E|)
O(|V | + |E|)


Saving...



Vu.ysapak



Quiz Start Time: 04:46 PM Time Left 72
sec(s)


Question # 4 of 10 ( Start time: 04:49:14 PM ) Total Marks: 1
Forward edge is:
Select correct option:

(u, v) where u is a proper descendent of v in the tree.
(u, v) where v is a proper descendent of u in the tree.
(u, v) where v is a proper ancesstor of u in the tree.
(u, v) where u is a proper ancesstor of v in the tree.






Vu.ysapak



Quiz Start Time: 04:46 PM Time Left 32
sec(s)


Question # 5 of 10 ( Start time: 04:49:40 PM ) Total Marks: 1
In digraph G=(V,E) ;G has cycle if and only if
Select correct option:

The DFS forest has forward edge.
The DFS forest has back edge
The DFS forest has both back and forward edge
BFS forest has forward edge






Vu.ysapak



Quiz Start Time: 04:46 PM Time Left 55
sec(s)


Question # 6 of 10 ( Start time: 04:51:05 PM ) Total Marks: 1
Which is true statement.
Select correct option:

Breadth first search is shortest path algorithm that works on
un-weighted graphs
Depth first search is shortest path algorithm that works on
un-weighted graphs.
Both of above are true.
None of above are true.






Vu.ysapak



Quiz Start Time: 04:46 PM Time Left 38
sec(s)


Question # 7 of 10 ( Start time: 04:51:49 PM ) Total Marks: 1
If you find yourself in maze the better traversel approach will be :
Select correct option:

BFS
BFS and DFS both are valid
Level order
DFS






Vu.ysapak



Quiz Start Time: 04:46 PM Time Left 67
sec(s)


Question # 8 of 10 ( Start time: 04:52:48 PM ) Total Marks: 1
Cross edge is :
Select correct option:

(u, v) where u and v are not ancestor of one another
(u, v) where u is ancesstor of v and v is not descendent of u.
(u, v) where u and v are not ancestor or descendent of one another
(u, v) where u and v are either ancestor or descendent of one another.






Vu.ysapak



Quiz Start Time: 04:46 PM Time Left 71
sec(s)


Question # 10 of 10 ( Start time: 04:54:21 PM ) Total Marks: 1
Back edge is:
Select correct option:

(u, v) where v is an ancestor of u in the tree.
(u,v) where u is an ancesstor of v in the tree.
(u, v) where v is an predcessor of u in the tree.
None of above





Vu.ysapak



Quiz Start Time: 04:56 PM Time Left 51
sec(s)


Question # 1 of 10 ( Start time: 04:56:46 PM ) Total Marks: 1
The ___________ suggests identifying goals and questions first before
selecting techniques for the study
Select correct option:

RVM model
DECIDE framework (answer)
Usability testing
Field study




Vu.ysapak



Quiz Start Time: 04:56 PM Time Left 61
sec(s)


Question # 2 of 10 ( Start time: 04:57:42 PM ) Total Marks: 1
____________ represent the user's expectations of the tangible
outcomes of using a specific product.
Select correct option:

Non-user goals
End goals (answer)
Experience goals
Life goals





Vu.ysapak



Quiz Start Time: 04:56 PM Time Left 29
sec(s)


Question # 3 of 10 ( Start time: 04:58:28 PM ) Total Marks: 1
________ represents the Early-phase of ethnographic interviews.
Select correct option:

Clarify user roles and behaviors.
Confirm patterns of use.
Clarifying questions.
Focused on domain knowledge.






Vu.ysapak



Quiz Start Time: 04:56 PM Time Left 29
sec(s)


Question # 4 of 10 ( Start time: 05:00:02 PM ) Total Marks: 1
What is the fourth step in defining the requirements with respect to
persona-based design?
Select correct option:

Creating problem and vision statement.
Brainstorming.
Identifying persona expectations.
Constructing the context scenario. (answer)



Vu.ysapak



Quiz Start Time: 04:56 PM Time Left 42
sec(s)


Question # 5 of 10 ( Start time: 05:01:17 PM ) Total Marks: 1
Recalling password is ____________ work.
Select correct option:

Logical
Mnemonic (answer)
Physical
Structural






Vu.ysapak



Quiz Start Time: 04:56 PM Time Left 13
sec(s)


Question # 6 of 10 ( Start time: 05:02:14 PM ) Total Marks: 1
This is not a characteristic of usability test
Select correct option:

The primary goal is to improve usability
The participants do not represent real users
Observe and record what participants do and say
None of the given






Vu.ysapak



Quiz Start Time: 04:56 PM Time Left 1
sec(s)


Question # 7 of 10 ( Start time: 05:03:39 PM ) Total Marks: 1
Goal-oriented context scenarios are _____________ task-oriented than
key path scenario
Select correct option:

Less
Alike
More (answer)
None of the given


Saving...



Vu.ysapak



Quiz Start Time: 04:56 PM Time Left 1
sec(s)


Question # 8 of 10 ( Start time: 05:05:16 PM ) Total Marks: 1
In DECIDE frame work _______________ comes just after choosing the
evaluation paradigm and techniques.
Select correct option:

Deciding about ethical issues (answer)
Exploring the questions
Identifying the practical issues
None of the given


Saving...



Vu.ysapak



Quiz Start Time: 04:56 PM Time Left 37
sec(s)


Question # 9 of 10 ( Start time: 05:06:52 PM ) Total Marks: 1
What do you enjoy most about your job (or lifestyle) is an example of
_________.
Select correct option:

Avoidance
Motivation (answer)
Exceptions
Attitude-oriented questions






Vu.ysapak



Quiz Start Time: 04:56 PM Time Left 55
sec(s)


Question # 10 of 10 ( Start time: 05:07:53 PM ) Total Marks: 1
Information sites with daily-updated information will naturally
attract ____________ users more than a monthly-updated site.
Select correct option:

Repeat (answer)
Infrequent
Nonuser
None of the given
http://ping.fm/RsTyX