New privacy settings for Search services and Google Play

mc1002066215@gmail.com Hello assad, We’re updating our settings to give you even more control over saved history and personalized recommendations across Google Search services and Google Play. Search services include Search, Maps, Shopping, Hotels, Flights, Translate, and News. You’ll see this change in your Google Account in the next few days. What’s changing Previously, saving history and personalization were managed by Web & App Activity. Going forward, you can better tailor your Search services experience using your new Search Services History and Personalized Recommendations settings. These settings let you revisit your past searches and decide if you want your experience to be personalized. As people increasingly search in new ways, like searching a photo with Lens, Search Services History now includes media from your interactions, which you can stop saving at any time. For Google Play, you'll have new Play History and Personalization in Play settings, even if you’ve never used this service. You can turn these settings on or off at any time. How this affects your account New history and personalization settings: Your new settings for Search services and Google Play will reflect your most recent choices for Web & App Activity and Search Personalization settings. If Web & App Activity is currently off, these new settings will stay off. After the transition, the Web & App Activity setting will be separate from Search services’ and Play’s personalization and history settings. Changes to one setting won’t affect the others. Auto-delete: Your prior choice from Web & App Activity for how long your history is saved will also apply to Search Services History and Play History. As always, you can change how long history is saved, choose an auto-delete period, and review or delete history manually at any time. Your media is saved when Search Services History is on: Saved media includes your images, files, audio and video from your interactions with Search services to help improve your experience. For example, this lets you revisit your past visual searches with Lens or continue a Search Live conversation about a song you heard. To support these types of interactive product experiences, Google will now save your media to your Search Services History, applying robust privacy and security protections. Like your Search Services History, your saved media is also used to develop and improve Google services and technologies, including AI models and safety measures. With this transition, if your Web & App Activity setting is currently turned on, this new Save Media subsetting will also be turned on along with your Search Services History. You can turn off your Save Media subsetting at any time, and you can also delete individual pieces of media from your history. You can manage these preferences by visiting My Activity and your Personalization settings pages. Learn more about your Search services settings and Google Play settings.    © 2026 Google LLC 1600 Amphitheatre Parkway, Mountain View, CA 94043    You received this email to let you know about important changes to your Google Account and services.

Learn more about our updated Terms of Service

mc1002066215@gmail.com  Every couple of years, we update our Terms of Service. We wanted to let you know ahead of time that the next update will be on July 30, 2026. These changes won’t affect the way you use our services, but they should help make it easier for you to understand what to expect from Google — and what we expect from you — as you use our services. You can review the new terms here. If you’re based in the European Economic Area (EEA) or Switzerland, we’ve also provided a summary of the key changes to the EEA version of our terms. At a glance, here’s what this update means for you: In general: We added a section to help you better understand why our services may access the internet when not actively engaged, to encourage you to check your Internet service plan and your device and network settings, as each of those may affect your costs. We updated and clarified our Settling disputes, governing law, and courts section. We make it clearer how various sections in our terms relate to each other. If you’re based in the EEA: In addition to the changes in the In general section, we updated various sections to reflect the latest EEA laws and regulations that apply to our services, including: Google’s obligation to make legally-required updates to our digital content, services, and goods. A new, online “withdrawal button” in the EEA instructions on withdrawal section. We also removed the Handling requests for your data section, because we’re centralizing our data disclosure language on our main data disclosure policy page. If you’re based outside the EEA:  In addition to the changes in the In general section, we added new disclosures and disclaimers, including ones about AI outputs. If you’re based in India, we also added new reporting language about our obligations if you violate applicable law. If you’re a parent or guardian, and you allow your child to use the services, please review the updates to our terms with your child and help them decide whether they need to make any changes to their account. Please remember that these terms apply to you and you’re responsible for your child’s activity on the services. If you don’t agree to the new terms, you should remove your content and stop using the services. You can also end your relationship with us at any time, without penalty, by closing your Google Account. Thank you for using Google services!  © 2026 Google LLC 1600 Amphitheatre Parkway, Mountain View, CA 94043  You have received this email to update you about important changes to Google’s Terms of Service.

Re: ::::::||VU_Askari(MIT)||:::::: CS502 Quiz No.1 Dated 12-11-2012

Same here

On Thu, 21 May 2026, 12:10 am khushii naz, <khushiinaz@gmail.com> wrote:

After how many years i can unfreeze my m.it

no expectation

no hurting

On Wed, Nov 5, 2025, 11:06 AM LUQMAN SHAH <maxihopelucky@gmail.com> wrote:

Ap batyii I am Banker 

On Mon, Sep 16, 2024, 11:08 AM Smile <smileyasir@gmail.com> wrote:

Kabi student thi aur ajkal kon c job hai apki

On Sat, Sep 7, 2024, 7:19 AM khushii naz <khushiinaz@gmail.com> wrote:

Kbi student thi

On Sat, Sep 7, 2024, 12:33 AM Waheed amir <aioudamir@gmail.com> wrote:

hello kon ho ap ?

On Fri, 6 Sept 2024, 9:24 pm khushii naz, <khushiinaz@gmail.com> wrote:

How i can leave this vu group

On Mon, Nov 12, 2012, 10:20 PM muhammad ashfaq <ashfaq.muhammad133@gmail.com> wrote:

Please send me solved mid term papers of cs 604 cs 614

On 11/12/12, Umair Saulat <saulat.umair@gmail.com> wrote:
> *CS502 - Fundamentals of Algorithms*
>
> *Quiz No.1 12-11-2012*
>
>
>
>
> Question # 1 of 10 ( Start time: 06:18:58 PM ) Total Marks: 1
> We do sorting to,
> Select correct option:
>
> keep elements in random positions
> keep the algorithm run in linear order
> keep the algorithm run in (log n) order
> *keep elements in increasing or decreasing order*
>
> Question # 2 of 10 ( Start time: 06:19:38 PM ) Total Marks: 1
> Heaps can be stored in arrays without using any pointers; this is due to
> the ____________ nature of the binary tree,
> Select correct option:
>
> *left-complete*
> right-complete
> tree nodes
> tree leaves
>
> Question # 3 of 10 ( Start time: 06:20:18 PM ) Total Marks: 1
> Sieve Technique can be applied to selection problem?
> Select correct option:
>
> *True*
> False
>
> Question # 4 of 10 ( Start time: 06:21:10 PM ) Total Marks: 1
> A heap is a left-complete binary tree that conforms to the ___________
> Select correct option:
>
> increasing order only
> decreasing order only
> *heap order*
> (log n) order
>
> Question # 5 of 10 ( Start time: 06:21:39 PM ) Total Marks: 1
> A (an) _________ is a left-complete binary tree that conforms to the heap
> order
> Select correct option:
>
> *heap*
> binary tree
> binary search tree
> array
>
> Question # 6 of 10 ( Start time: 06:22:04 PM ) Total Marks: 1
> Divide-and-conquer as breaking the problem into a small number of
> Select correct option:
>
> pivot
> Sieve
> *smaller sub problems*
> Selection
>
> Question # 7 of 10 ( Start time: 06:22:40 PM ) Total Marks: 1
> In Sieve Technique we do not know which item is of interest
> Select correct option:
>
> *True*
> False
>
> Question # 8 of 10 ( Start time: 06:23:26 PM ) Total Marks: 1
> The recurrence relation of Tower of Hanoi is given below T(n)={1 if n=1 and
> 2T(n-1) if n >1 In order to move a tower of 5 rings from one peg to
> another, how many ring moves are required?
> Select correct option:
>
> 16
> 10
> *32
> *31
>
> Question # 9 of 10 ( Start time: 06:24:44 PM ) Total Marks: 1
> In the analysis of Selection algorithm, we eliminate a constant fraction of
> the array with each phase; we get the convergent _______________ series in
> the analysis,
> Select correct option:
>
> linear
> arithmetic
> *geometric *
> exponent
>
>
> Question # 10 of 10 ( Start time: 06:25:43 PM ) Total Marks: 1
> For the heap sort, access to nodes involves simple _______________
> operations.
> Select correct option:
> *arithmetic*
> binary
> algebraic
> logarithmic
>
> For the sieve technique we solve the problem,
> Select correct option:
> *recursively
> *mathematically
> precisely
> accurately
> The sieve technique works in ___________ as follows
> Select correct option:
> *phases
> *numbers
> integers
> routines
> Slow sorting algorithms run in,
> Select correct option:
> *T(n^2)
> *T(n)
> T( log n)
> A (an) _________ is a left-complete binary tree that conforms to the heap
> order
> Select correct option:
> *heap*
> binary tree
> binary search tree
> array
>
> In the analysis of Selection algorithm, we eliminate a constant fraction of
> the array with each phase; we get the convergent _______________ series in
> the analysis,
> Select correct option:
> linear
> arithmetic
> *geometric*
> exponent
>
> In the analysis of Selection algorithm, we make a number of passes, in fact
> it could be as many as,
> Select correct option:
> T(n)
> *T(n / 2)*
> log n
> n / 2 + n / 4
>
> The sieve technique is a special case, where the number of sub problems is
> just
> Select correct option:
> 5
> many
> *1*
> few
>
> In which order we can sort?
> Select correct option:
> increasing order only
> decreasing order only
> *increasing order or decreasing order*
> both at the same time
>
> The recurrence relation of Tower of Hanoi is given below T(n)={1 if n=1 and
> 2T(n-1) if n >1 In order to move a tower of 5 rings from one peg to
> another, how many ring moves are required?
> Select correct option:
> 16
> 10
> *32*
> 31
>
> Analysis of Selection algorithm ends up with,
> Select correct option:
> T(n)
> T(1 / 1 + n)
> T(n / 2)
> *T((n / 2) + n)*
>
>
> We do sorting to,
> Select correct option:
>
> keep elements in random positions
> keep the algorithm run in linear order
> keep the algorithm run in (log n) order
> *keep elements in increasing or decreasing order *
>
>
>
>
> Divide-and-conquer as breaking the problem into a small number of
> Select correct option:
>
> pivot
> Sieve
> *smaller sub problems
> *Selection
>
>
> The analysis of Selection algorithm shows the total running time is indeed
> ________in n,
> Select correct option:
>
> arithmetic
> geometric
> *linear
> *orthogonal
>
>
>
>
> How many elements do we eliminate in each time for the Analysis of
> Selection algorithm?
> Select correct option:
>
> *n / 2 elements
> *(n / 2) + n elements
> n / 4 elements
> 2 n elements
>
>
> Sieve Technique can be applied to selection problem?
> Select correct option:
>
> *True
> *false
>
>
> For the heap sort we store the tree nodes in
> Select correct option:
>
> *level-order traversal*
> in-order traversal
> pre-order traversal
> post-order traversal
>
>
>
> * *
>
> One of the clever aspects of heaps is that they can be stored in arrays
> without using any _______________.
> Select correct option:
> *pointers
> *constants
> variables
> functions
>
>
>
> A (an) _________ is a left-complete binary tree that conforms to the heap
> order
> Select correct option:
> *heap*
> binary tree
> binary search tree
> array
>
>
>
> Divide-and-conquer as breaking the problem into a small number of
> Select correct option:
> pivot
> Sieve
> *smaller sub problems
> *Selection
>
>
> Heaps can be stored in arrays without using any pointers; this is due to
> the ____________ nature of the binary tree,
> Select correct option:
> *left-complete*
> right-complete
> tree nodes
> tree leaves
>
> For the sieve technique we solve the problem,
> Select correct option:
> *recursively
> *mathematically
> precisely
> accurately
>
> A heap is a left-complete binary tree that conforms to the ___________
> Select correct option:
> increasing order only
> decreasing order only
> *heap order*
> (log n) order
>
>
> We do sorting to,
> Select correct option:
> keep elements in random positions
> keep the algorithm run in linear order
> keep the algorithm run in (log n) order
> *keep elements in increasing or decreasing order*
>
>
> How many elements do we eliminate in each time for the Analysis of
> Selection algorithm?
> Select correct option:
> *n / 2 elements*
> (n / 2) + n elements
> n / 4 elements
> 2 n elements
>
>
> How much time merge sort takes for an array of numbers?
> Select correct option:
> T(n^2)
> T(n)
> T( log n)
> *T(n log n)*
>
>
> The reason for introducing Sieve Technique algorithm is that it illustrates
> a very important special case of,
> Select correct option:
> *divide-and-conquer
> *decrease and conquer
> greedy nature
> 2-dimension Maxima
>
>
>
> Question # 1 of 10 ( Start time: 08:17:23 AM ) Total M a r k s: 1
> The number of nodes in a complete binary tree of height h is
> Select correct option:
> *2^(h+1) – 1*
> 2 * (h+1) – 1
> 2 * (h+1)
> ((h+1) ^ 2) – 1
>
> Question # 2 of 10 ( Start time: 08:18:46 AM ) Total M a r k s: 1
> A (an) _________ is a left-complete binary tree that conforms to the heap
> order
> Select correct option:
> *heap*
> binary tree
> binary search tree
> array
>
> Question # 3 of 10 ( Start time: 08:19:38 AM ) Total M a r k s: 1
> In Sieve Technique we do not know which item is of interest
> Select correct option:
> *True*
> False
>
> Question # 4 of 10 ( Start time: 08:20:33 AM ) Total M a r k s: 1
> Heaps can be stored in arrays without using any pointers; this is due to
> the
> ____________ nature of the binary tree,
> Select correct option:
> *left-complete*
> right-complete
> tree nodes
> tree leaves
>
> Question # 5 of 10 ( Start time: 08:21:59 AM ) Total M a r k s: 1
> In the analysis of Selection algorithm, we make a number of passes, in fact
> it could be as
> many as,
> Select correct option:
> T(n)
> *T(n / 2)*
> log n
> n / 2 + n / 4
>
> Question # 6 of 10 ( Start time: 08:23:01 AM ) Total M a r k s: 1
> For the sieve technique we solve the problem,
> Select correct option:
> *recursively*
> mathematically
> precisely
> accurately
> Theta asymptotic notation for T (n) :
> Select correct option:
> Set of functions described by: c1g(n)Set of functions described by
> c1g(n)>=f(n) for c1 s
> Theta for T(n)is actually upper and worst case comp
> Set of functions described by:
> c1g(n)
>
>
> Question # 8 of 10 ( Start time: 08:24:39 AM ) Total M a r k s: 1
> The sieve technique is a special case, where the number of sub problems is
> just
> Select correct option:
> 5
> many
> *1*
> few
>
> Question # 9 of 10 ( Start time: 08:25:54 AM ) Total M a r k s: 1
> Sieve Technique applies to problems where we are interested in finding a
> single item from a larger set of _____________
> Select correct option:
> *n items*
> phases
> pointers
> constant
>
> Question # 10 of 10 ( Start time: 08:26:44 AM ) Total M a r k s: 1
> The sieve technique works in ___________ as follows
> Select correct option:
> *phases
> *numbers
> integers
> routines
>
>
>
> Memorization is?
>
> To store previous results for future use
>
> *To avoid this unnecessary repetitions by writing down the results of
> recursive calls and looking them up again if we need them later*
>
> To make the process accurate
>
> None of the above
>
>
>
> Question # 2 of 10 Total M a r k s: 1
>
> Which sorting algorithm is faster
>
> O (n log n)
>
> O n^2
>
> *O (n+k)*
>
> O n^3
>
>
>
> Quick sort is
>
> Stable & in place
>
> *Not stable but in place*
>
> Stable but not in place
>
> Some time stable & some times in place
>
>
>
> One example of in place but not stable algorithm is
>
> Merger Sort
>
> *Quick Sort*
>
> Continuation Sort
>
> Bubble Sort
>
>
>
> In Quick Sort Constants hidden in T(n log n) are
>
> Large
>
> Medium
>
> *Small*
>
> Not Known
>
>
>
> Continuation sort is suitable to sort the elements in range 1 to k
>
> K is Large
>
> K is not known
>
> K may be small or large
>
> *K is small*
>
>
>
> In stable sorting algorithm.
>
> *If duplicate elements remain in the same relative position after sorting*
>
> One array is used
>
> More than one arrays are required
>
> Duplicating elements not handled
>
>
>
> Which may be a stable sort?
>
> Merger
>
> Insertion
>
>  Both above
>
> *None of the above*
>
>
>
> An in place sorting algorithm is one that uses ___ arrays for storage
>
> Two dimensional arrays
>
> More than one array
>
> *No Additional Array*
>
> None of the above
>
>
>
> Continuing sort has time complexity of ?
>
> *O(n)*
>
> O(n+k)
>
> O(nlogn)
>
> O(k)
>
>
>
> We do sorting to,
>
> keep elements in random positions
>
> keep the algorithm run in linear order
>
> keep the algorithm run in (log n) order
>
> *keep elements in increasing or decreasing order *
>
>
>
>
>
> In Sieve Technique we donot know which item is of interest
>
>
>
> *True *
>
> False
>
> A (an) _________ is a left-complete binary tree that conforms to the
>
> heap order
>
> *heap*
>
> binary tree
>
> binary search tree
>
> array
>
> 27. The sieve technique works in ___________ as follows
>
> *phases*
>
> numbers
>
> integers
>
> routines
>
>
>
> For the sieve technique we solve the problem,
>
> *recursively*
>
> mathematically
>
> precisely
>
> accurately
>
> 29. For the heap sort, access to nodes involves simple _______________
>
> operations.
>
> *arithmetic*
>
> binary
>
> algebraic
>
> logarithmic
>
>
>
>
>
>
>
> The analysis of Selection algorithm shows the total running time is
>
> indeed ________in n,\
>
> arithmetic
>
> geometric
>
> *linear*
>
> orthogonal
>
>
>
> For the heap sort, access to nodes involves simple _______________
>
> operations.
>
> Select correct option:
>
> *arithmetic*
>
> binary
>
> algebraic
>
> logarithmic
>
>
>
> Sieve Technique applies to problems where we are interested in finding a
>
> single item from a larger set of _____________
>
> Select correct option:
>
> *n items*
>
> phases
>
> pointers
>
> constant
>
>
>
> Question # 9 of 10 ( Start time: 07:45:36 AM ) Total Marks: 1
>
> In Sieve Technique we do not know which item is of interest
>
> Select correct option:
>
> *True*
>
> False
>
>
>
> How much time merge sort takes for an array of numbers?
>
> Select correct option:
>
> T(n^2)
>
> T(n)
>
> T( log n)
>
> *T(n log n)*
>
>
>
> For the heap sort we store the tree nodes in
>
> Select correct option:
>
> *level-order traversal*
>
> in-order traversal
>
> pre-order traversal
>
> post-order traversal
>
>
>
>
>
> Sorting is one of the few problems where provable ________ bonds exits on
>
> how fast we can sort,
>
> Select correct option:
>
> upper
>
> *lower*
>
> average
>
> log n
>
>
>
> single item from a larger set of _____________
>
> Select correct option:
>
> *n items*
>
> phases
>
> pointers
>
> constant
>
>
>
> A heap is a left-complete binary tree that conforms to the ___________
>
> Select correct option:
>
> increasing order only
>
> decreasing order only
>
> *heap order*
>
> (log n) order
>
>
>
> In the analysis of Selection algorithm, we make a number of passes, in fact
> it could be as many as,
>
> Select correct option:
>
> T(n)
>
> T(n / 2)
>
> *log n*
>
> n / 2 + n / 4
>
>
>
> The reason for introducing Sieve Technique algorithm is that it illustrates
> a
>
> very important special case of,
>
> Select correct option:
>
> *divide-and-conquer*
>
> decrease and conquer
>
> greedy nature
>
> 2-dimension Maxima
>
>
>
> The sieve technique works in ___________ as follows
>
> Select correct option:
>
> *phases*
>
> numbers
>
> integers
>
> routines
>
> For the Sieve Technique we take time
>
> Select correct option:
>
> *T(nk)*
>
> T(n / 3)
>
> n^2
>
> n/3
>
>
>
> In the analysis of Selection algorithm, we eliminate a constant fraction of
> the
>
> array with each phase; we get the convergent _______________ series in the
>
> analysis,
>
> linear
>
> arithmetic
>
> *geometric*
>
> exponent
>
>
>
> Analysis of Selection algorithm ends up with,
>
> Select correct option:
>
> *T(n)*
>
> T(1 / 1 + n)
>
> T(n / 2)
>
> T((n / 2) + n)
>
>
>
> Quiz Start Time: 07:23 PM
> Time Left 90
> sec(s)
> Question # 1 of 10 ( Start time: 07:24:03 PM ) Total M a r k s: 1
> In in-place sorting algorithm is one that uses arrays for storage :
> Select correct option:
> An additional array
> *No additioanal array*
> Both of above may be true according to algorithm
> More than 3 arrays of one dimension.
>
>  *
>
> *Time Left 89
> sec(s)
> Question # 2 of 10 ( Start time: 07:25:20 PM ) Total M a r k s: 1
> Which sorting algorithn is faster :
> Select correct option:
> O(n^2)
> *O(nlogn)*
> O(n+k)
> O(n^3)
>
> In stable sorting algorithm:
> Select correct option:
> One array is used
> In whcih duplicating elements are not handled.
> More then one arrays are required.
> *Duplicating elements remain in same relative posistion after sorting.*
>
>  *
> *Counting sort has time complexity:
> Select correct option:
> *O(n)*
> O(n+k)
> O(k)
> O(nlogn)
>
>
>
>
> Counting sort is suitable to sort the elements in range 1 to k:
> Select correct option:
> K is large
> *K is small
> *K may be large or small
> None
>
>  *
>
> *
>
>
> Memorization is :
> Select correct option:
> To store previous results for further use.
> *To avoid unnecessary repetitions by writing down the results of recursive
> calls and looking them again if needed later*
> To make the process accurate.
> None of the above
>
>
>
> The running time of quick sort depends heavily on the selection of
> Select correct option:
> No of inputs
> Arrangement of elements in array
> Size o elements
> *Pivot elements**
>
> *Which may be stable sort:
> Select correct option:
> Bubble sort
> Insertion sort
> *Both of above**
>
>
> *In Quick sort algorithm, constants hidden in T(n lg n) are
> Select correct option:
> Large
> Medium
> Not known
> *small*
>
>
>
> Quick sort is
> Select correct option:
> Stable and In place
> *Not stable but in place*
> Stable and not in place
> Some time in place and send some time stable
>
>
>
>
>
> For the Sieve Technique we take time
>
> *T(nk)*
>
> T(n / 3)
>
> n^2
>
> n/3
>
>
>
> The sieve technique is a special case, where the number of sub problems is
> just
>
> Select correct option:
>
> 5
>
> Many
>
> *1*
>
> Few
>
>
>
> The reason for introducing Sieve Technique algorithm is that it illustrates
> a very important special case of,
>
> Select correct option:
>
> *divide-and-conquer*
>
> decrease and conquer
>
> greedy nature
>
> 2-dimension Maxima
>
>
>
> Which may be stable sort:
> Select correct option:
> Bubble sort
> Insertion sort
> Both of above
> Selection sort
>
> In the analysis of Selection algorithm, we eliminate a constant fraction of
> the array with each phase; we get the convergent _______________ series in
> the analysis,
> Select correct option:
> linear
> arithmetic
> geometric
> exponent
>
>  In Quick sort algorithm, constants hidden in T(n lg n) are
> Select correct option:
>
> Large
> Medium
> Not known
> small
>
>  How much time merge sort takes for an array of numbers?
> Select correct option:
>
> T(n^2)
> T(n)
> T( log n)
> T(n log n)
>
>  Counting sort has time complexity:
> Select correct option:
>
> O(n)
> O(n+k)
> O(k)
> O(nlogn)
>
>  In which order we can sort?
> Select correct option:
>
> increasing order only
> decreasing order only
> increasing order or decreasing order
> both at the same time
>
>  A (an) _________ is a left-complete binary tree that conforms to the heap
> order
> Select correct option:
>
> heap
> binary tree
> binary search tree
> array
>
>  The analysis of Selection algorithm shows the total running time is indeed
> ________in n,
> Select correct option:
>
> arithmetic
> geometric
> linear
> orthogonal
>
>  Quick sort is based on divide and conquer paradigm; we divide the problem
> on base of pivot element and:
> Select correct option:
>
> There is explicit combine process as well to conquer the solution.
> No work is needed to combine the sub-arrays, the array is already sorted
> Merging the sub arrays
> None of above.
>
>  Sorting is one of the few problems where provable ________ bonds exits on
> how fast we can sort,
> Select correct option:
>
> upper
> lower
> average
> log n
>
> In the analysis of Selection algorithm, we make a number of passes, in fact
> it could be as many as,
>
> T(n)
>
> T(n / 2)
>
> log n
>
> n / 2 + n / 4
>
>
>
> Quick sort is based on divide and conquer paradigm; we divide the problem
> on base of
>
> pivot element and:
>
> There is explicit combine process as w ell to conquer
>
> No w ork is needed to combine the sub-arrays, the a
>
> Merging the subarrays
>
> None of above
>
>
>
>
>
> The number of nodes in a complete binary tree of height h is
>
> 2^(h+1) – 1
>
> 2 * (h+1) – 1
>
> 2 * (h+1)
>
> ((h+1) ^ 2) – 1
>
>
>
> How many elements do we eliminate in each time for the Analysis of
> Selection
>
> algorithm?
>
> n / 2 elements
>
> (n / 2) + n elements
>
> n / 4 elements
>
> 2 n elements
>
>
>
> Which sorting algorithn is faster :
>
> O(n^2)
>
> O(nlogn)
>
> O(n+k)
>
> O(n^3)
>
>
>
> We do sorting to,
>
> keep elements in random positions
>
> keep the algorithm run in linear order
>
> keep the algorithm run in (log n) order
>
> keep elements in increasing or decreasing order
>
>
>
> Slow sorting algorithms run in,
>
> T(n^2)
>
> T(n)
>
> T( log n)
>
> T(n log n)
>
>
>
> One of the clever aspects of heaps is that they can be stored in arrays
> without using any
>
> _______________.
>
> Pointers
>
> Constants
>
> Variables
>
> Functions
>
>
>
> Counting sort is suitable to sort the elements in range 1 to k:
>
> K is large
>
> K is small
>
> K may be large or small
>
> None
>
>
>
> We do sorting to,
> Select correct option:
>
> keep elements in random positions
> keep the algorithm run in linear order
> keep the algorithm run in (log n) order
> keep elements in increasing or decreasing order
>
> Question # 2 of 10 ( Start time: 06:19:38 PM ) Total Marks: 1
> Heaps can be stored in arrays without using any pointers; this is due to
> the ____________ nature of the binary tree,
> Select correct option:
>
> left-complete
> right-complete
> tree nodes
> tree leaves
>
> Question # 3 of 10 ( Start time: 06:20:18 PM ) Total Marks: 1
> Sieve Technique can be applied to selection problem?
> Select correct option:
>
> True
> False
>
> Question # 4 of 10 ( Start time: 06:21:10 PM ) Total Marks: 1
> A heap is a left-complete binary tree that conforms to the ___________
> Select correct option:
>
> increasing order only
> decreasing order only
> heap order
> (log n) order
>
> Question # 5 of 10 ( Start time: 06:21:39 PM ) Total Marks: 1
> A (an) _________ is a left-complete binary tree that conforms to the heap
> order
> Select correct option:
>
> heap
> binary tree
> binary search tree
> array
>
> Question # 6 of 10 ( Start time: 06:22:04 PM ) Total Marks: 1
> Divide-and-conquer as breaking the problem into a small number of
> Select correct option:
>
> pivot
> Sieve
> smaller sub problems
> Selection
>
> Question # 7 of 10 ( Start time: 06:22:40 PM ) Total Marks: 1
> In Sieve Technique we do not know which item is of interest
> Select correct option:
>
> True
> False
>
> Question # 8 of 10 ( Start time: 06:23:26 PM ) Total Marks: 1
> The recurrence relation of Tower of Hanoi is given below T(n)={1 if n=1 and
> 2T(n-1) if n >1 In order to move a tower of 5 rings from one peg to
> another, how many ring moves are required?
> Select correct option:
>
> 16
> 10
> 32
> 31
>
> Question # 9 of 10 ( Start time: 06:24:44 PM ) Total Marks: 1
> In the analysis of Selection algorithm, we eliminate a constant fraction of
> the array with each phase; we get the convergent _______________ series in
> the analysis,
> Select correct option:
>
> linear
> arithmetic
> geometric
> exponent
>
>
> Question # 10 of 10 ( Start time: 06:25:43 PM ) Total Marks: 1
> For the heap sort, access to nodes involves simple _______________
> operations.
> Select correct option:
> arithmetic
> binary
> algebraic
> logarithmic
>
> For the sieve technique we solve the problem,
> Select correct option:
> recursively
> mathematically
> precisely
> accurately
> The sieve technique works in ___________ as follows
> Select correct option:
> phases
> numbers
> integers
> routines
> Slow sorting algorithms run in,
> Select correct option:
> T(n^2)
> T(n)
> T( log n)
> A (an) _________ is a left-complete binary tree that conforms to the heap
> order
> Select correct option:
> heap
> binary tree
> binary search tree
> array
>
> In the analysis of Selection algorithm, we eliminate a constant fraction of
> the array with each phase; we get the convergent _______________ series in
> the analysis,
> Select correct option:
> linear
> arithmetic
> geometric
> exponent
>
> In the analysis of Selection algorithm, we make a number of passes, in fact
> it could be as many as,
> Select correct option:
> T(n)
> T(n / 2)
> log n
> n / 2 + n / 4
>
> The sieve technique is a special case, where the number of sub problems is
> just
> Select correct option:
> 5
> many
> 1
> few
>
> In which order we can sort?
> Select correct option:
> increasing order only
> decreasing order only
> increasing order or decreasing order
> both at the same time
>
> The recurrence relation of Tower of Hanoi is given below T(n)={1 if n=1 and
> 2T(n-1) if n >1 In order to move a tower of 5 rings from one peg to
> another, how many ring moves are required?
> Select correct option:
> 16
> 10
> 32
> 31
>
> Analysis of Selection algorithm ends up with,
> Select correct option:
> T(n)
> T(1 / 1 + n)
> T(n / 2)
> T((n / 2) + n)
>
>
> We do sorting to,
> Select correct option:
>
> keep elements in random positions
> keep the algorithm run in linear order
> keep the algorithm run in (log n) order
> keep elements in increasing or decreasing order
>
> Divide-and-conquer as breaking the problem into a small number of
> Select correct option:
>
> pivot
> Sieve
> smaller sub problems
> Selection
>
>
> The analysis of Selection algorithm shows the total running time is indeed
> ________in n,
> Select correct option:
>
> arithmetic
> geometric
> linear
> orthogonal
>
>
>
>
> How many elements do we eliminate in each time for the Analysis of
> Selection algorithm?
> Select correct option:
>
> n / 2 elements
> (n / 2) + n elements
> n / 4 elements
> 2 n elements
>
>
> Sieve Technique can be applied to selection problem?
> Select correct option:
>
> True
> false
>
>
> For the heap sort we store the tree nodes in
> Select correct option:
>
> level-order traversal
> in-order traversal
> pre-order traversal
> post-order traversal
>
>
>
>
>
> One of the clever aspects of heaps is that they can be stored in arrays
> without using any _______________.
> Select correct option:
> pointers
> constants
> variables
> functions
>
>
>
> A (an) _________ is a left-complete binary tree that conforms to the heap
> order
> Select correct option:
> heap
> binary tree
> binary search tree
> array
>
>
>
> Divide-and-conquer as breaking the problem into a small number of
> Select correct option:
> pivot
> Sieve
> smaller sub problems
> Selection
>
>
> Heaps can be stored in arrays without using any pointers; this is due to
> the ____________ nature of the binary tree,
> Select correct option:
> left-complete
> right-complete
> tree nodes
> tree leaves
>
> For the sieve technique we solve the problem,
> Select correct option:
> recursively
> mathematically
> precisely
> accurately
>
> A heap is a left-complete binary tree that conforms to the ___________
> Select correct option:
> increasing order only
> decreasing order only
> heap order
> (log n) order
>
>
> We do sorting to,
> Select correct option:
> keep elements in random positions
> keep the algorithm run in linear order
> keep the algorithm run in (log n) order
> keep elements in increasing or decreasing order
>
>
> How many elements do we eliminate in each time for the Analysis of
> Selection algorithm?
> Select correct option:
> n / 2 elements
> (n / 2) + n elements
> n / 4 elements
> 2 n elements
>
>
> How much time merge sort takes for an array of numbers?
> Select correct option:
> T(n^2)
> T(n)
> T( log n)
> T(n log n)
>
>
> The reason for introducing Sieve Technique algorithm is that it illustrates
> a very important special case of,
> Select correct option:
> divide-and-conquer
> decrease and conquer
> greedy nature
> 2-dimension Maxima
>
>
>
> Question # 1 of 10 ( Start time: 08:17:23 AM ) Total M a r k s: 1
> The number of nodes in a complete binary tree of height h is
> Select correct option:
> 2^(h+1) – 1
> 2 * (h+1) – 1
> 2 * (h+1)
> ((h+1) ^ 2) – 1
>
> Question # 2 of 10 ( Start time: 08:18:46 AM ) Total M a r k s: 1
> A (an) _________ is a left-complete binary tree that conforms to the heap
> order
> Select correct option:
> heap
> binary tree
> binary search tree
> array
>
> Question # 3 of 10 ( Start time: 08:19:38 AM ) Total M a r k s: 1
> In Sieve Technique we do not know which item is of interest
> Select correct option:
> True
> False
>
> Question # 4 of 10 ( Start time: 08:20:33 AM ) Total M a r k s: 1
> Heaps can be stored in arrays without using any pointers; this is due to
> the
> ____________ nature of the binary tree,
> Select correct option:
> left-complete
> right-complete
> tree nodes
> tree leaves
>
> Question # 5 of 10 ( Start time: 08:21:59 AM ) Total M a r k s: 1
> In the analysis of Selection algorithm, we make a number of passes, in fact
> it could be as
> many as,
> Select correct option:
> T(n)
> T(n / 2)
> log n
> n / 2 + n / 4
>
> Question # 6 of 10 ( Start time: 08:23:01 AM ) Total M a r k s: 1
> For the sieve technique we solve the problem,
> Select correct option:
> recursively
> mathematically
> precisely
> accurately
> Theta asymptotic notation for T (n) :
> Select correct option:
> Set of functions described by: c1g(n)Set of functions described by
> c1g(n)>=f(n) for c1 s
> Theta for T(n)is actually upper and worst case comp
> Set of functions described by:
> c1g(n)
>
>
> Question # 8 of 10 ( Start time: 08:24:39 AM ) Total M a r k s: 1
> The sieve technique is a special case, where the number of sub problems is
> just
> Select correct option:
> 5
> many
> 1
> few
>
> Question # 9 of 10 ( Start time: 08:25:54 AM ) Total M a r k s: 1
> Sieve Technique applies to problems where we are interested in finding a
> single item from a larger set of _____________
> Select correct option:
> n items
> phases
> pointers
> constant
>
> Question # 10 of 10 ( Start time: 08:26:44 AM ) Total M a r k s: 1
> The sieve technique works in ___________ as follows
> Select correct option:
> phases
> numbers
> integers
> routines
>
>
>
> Memorization is?
>
> To store previous results for future use
>
> To avoid this unnecessary repetitions by writing down the results of
> recursive calls and looking them up again if we need them later
>
> To make the process accurate
>
> None of the above
>
>
>
> Question # 2 of 10 Total M a r k s: 1
>
> Which sorting algorithm is faster
>
> O (n log n)
>
> O n^2
>
> O (n+k)
>
> O n^3
>
>
>
> Quick sort is
>
> Stable & in place
>
> Not stable but in place
>
> Stable but not in place
>
> Some time stable & some times in place
>
>
>
> One example of in place but not stable algorithm is
>
> Merger Sort
>
> Quick Sort
>
> Continuation Sort
>
> Bubble Sort
>
>
>
> In Quick Sort Constants hidden in T(n log n) are
>
> Large
>
> Medium
>
> Small
>
> Not Known
>
>
>
> Continuation sort is suitable to sort the elements in range 1 to k
>
> K is Large
>
> K is not known
>
> K may be small or large
>
> K is small
>
>
>
> In stable sorting algorithm.
>
> If duplicate elements remain in the same relative position after sorting
>
> One array is used
>
> More than one arrays are required
>
> Duplicating elements not handled
>
>
>
> Which may be a stable sort?
>
> Merger
>
> Insertion
>
>  Both above
>
> None of the above
>
>
>
> An in place sorting algorithm is one that uses ___ arrays for storage
>
> Two dimensional arrays
>
> More than one array
>
> No Additional Array
>
> None of the above
>
>
>
> Continuing sort has time complexity of ?
>
> O(n)
>
> O(n+k)
>
> O(nlogn)
>
> O(k)
>
>
>
> We do sorting to,
>
> keep elements in random positions
>
> keep the algorithm run in linear order
>
> keep the algorithm run in (log n) order
>
> keep elements in increasing or decreasing order
>
>
>
>
>
> In Sieve Technique we donot know which item is of interest
>
>
>
> True
>
> False
>
> A (an) _________ is a left-complete binary tree that conforms to the
>
> heap order
>
> heap
>
> binary tree
>
> binary search tree
>
> array
>
> 27. The sieve technique works in ___________ as follows
>
> phases
>
> numbers
>
> integers
>
> routines
>
>
>
> For the sieve technique we solve the problem,
>
> recursively
>
> mathematically
>
> precisely
>
> accurately
>
> 29. For the heap sort, access to nodes involves simple _______________
>
> operations.
>
> arithmetic
>
> binary
>
> algebraic
>
> logarithmic
>
>
>
>
>
>
>
> The analysis of Selection algorithm shows the total running time is
>
> indeed ________in n,\
>
> arithmetic
>
> geometric
>
> linear
>
> orthogonal
>
>
>
> For the heap sort, access to nodes involves simple _______________
>
> operations.
>
> Select correct option:
>
> arithmetic
>
> binary
>
> algebraic
>
> logarithmic
>
>
>
> Sieve Technique applies to problems where we are interested in finding a
>
> single item from a larger set of _____________
>
> Select correct option:
>
> n items
>
> phases
>
> pointers
>
> constant
>
>
>
> Question # 9 of 10 ( Start time: 07:45:36 AM ) Total Marks: 1
>
> In Sieve Technique we do not know which item is of interest
>
> Select correct option:
>
> True
>
> False
>
>
>
> How much time merge sort takes for an array of numbers?
>
> Select correct option:
>
> T(n^2)
>
> T(n)
>
> T( log n)
>
> T(n log n)
>
>
>
> For the heap sort we store the tree nodes in
>
> Select correct option:
>
> level-order traversal
>
> in-order traversal
>
> pre-order traversal
>
> post-order traversal
>
>
>
>
>
> Sorting is one of the few problems where provable ________ bonds exits on
>
> how fast we can sort,
>
> Select correct option:
>
> upper
>
> lower
>
> average
>
> log n
>
>
>
> single item from a larger set of _____________
>
> Select correct option:
>
> n items
>
> phases
>
> pointers
>
> constant
>
>
>
> A heap is a left-complete binary tree that conforms to the ___________
>
> Select correct option:
>
> increasing order only
>
> decreasing order only
>
> heap order
>
> (log n) order
>
>
>
> In the analysis of Selection algorithm, we make a number of passes, in fact
> it could be as many as,
>
> Select correct option:
>
> T(n)
>
> T(n / 2)
>
> log n
>
> n / 2 + n / 4
>
>
>
> The reason for introducing Sieve Technique algorithm is that it illustrates
> a
>
> very important special case of,
>
> Select correct option:
>
> divide-and-conquer
>
> decrease and conquer
>
> greedy nature
>
> 2-dimension Maxima
>
>
>
> The sieve technique works in ___________ as follows
>
> Select correct option:
>
> phases
>
> numbers
>
> integers
>
> routines
>
> For the Sieve Technique we take time
>
> Select correct option:
>
> T(nk)
>
> T(n / 3)
>
> n^2
>
> n/3
>
>
>
> In the analysis of Selection algorithm, we eliminate a constant fraction of
> the
>
> array with each phase; we get the convergent _______________ series in the
>
> analysis,
>
> linear
>
> arithmetic
>
> geometric
>
> exponent
>
>
>
> Analysis of Selection algorithm ends up with,
>
> Select correct option:
>
> T(n)
>
> T(1 / 1 + n)
>
> T(n / 2)
>
> T((n / 2) + n)
>
>
>
> Quiz Start Time: 07:23 PM
> Time Left 90
> sec(s)
> Question # 1 of 10 ( Start time: 07:24:03 PM ) Total M a r k s: 1
> In in-place sorting algorithm is one that uses arrays for storage :
> Select correct option:
> An additional array
> No additional array
> Both of above may be true according to algorithm
> More than 3 arrays of one dimension.
>
>
>
> Time Left 89
> sec(s)
> Question # 2 of 10 ( Start time: 07:25:20 PM ) Total M a r k s: 1
> Which sorting algorithn is faster :
> Select correct option:
> O(n^2)
> O(nlogn)
> O(n+k)
> O(n^3)
>
> In stable sorting algorithm:
> Select correct option:
> One array is used
> In which duplicating elements are not handled.
> More then one arrays are required.
> Duplicating elements remain in same relative posistion after sorting.
>
>
> Counting sort has time complexity:
> Select correct option:
> O(n)
> O(n+k)
> O(k)
> O(nlogn)
>
>
>
>
> Counting sort is suitable to sort the elements in range 1 to k:
> Select correct option:
> K is large
> K is small
> K may be large or small
> None
>
>
>
>
> Memorization is :
> Select correct option:
> To store previous results for further use.
> To avoid unnecessary repetitions by writing down the results of recursive
> calls and looking them again if needed later
> To make the process accurate.
> None of the above
>
>
>
> The running time of quick sort depends heavily on the selection of
> Select correct option:
> No of inputs
> Arrangement of elements in array
> Size o elements
> Pivot elements
>
> Which may be stable sort:
> Select correct option:
> Bubble sort
> Insertion sort
> Both of above
>
>
> In Quick sort algorithm, constants hidden in T(n lg n) are
> Select correct option:
> Large
> Medium
> Not known
> small
>
>
>
> Quick sort is
> Select correct option:
> Stable and In place
> Not stable but in place
> Stable and not in place
> Some time in place and send some time stable
>
>
>
>
>
> For the Sieve Technique we take time
>
> T(nk)
>
> T(n / 3)
>
> n^2
>
> n/3
>
>
>
> The sieve technique is a special case, where the number of sub problems is
> just
>
> Select correct option:
>
> 5
>
> Many
>
> 1
>
> Few
>
>
>
> The reason for introducing Sieve Technique algorithm is that it illustrates
> a very important special case of,
>
> Select correct option:
>
> divide-and-conquer
>
> decrease and conquer
>
> greedy nature
>
> 2-dimension Maxima
>
>
>
>
>
>
>
>
>
>
>
> Quick sort is
>
> Select correct option:
>
> Stable and In place
>
> Not stable but in place
>
> Stable and not in place
>
> Some time in place and send some time stable
>
>
>
> Memoization is :
>
> Select correct option:
>
> To store previous results for further use.
>
> To avoid unnecessary repetitions by writing down the results of
>
> recursive calls and looking them again if needed later
>
> To make the process accurate.
>
> None of the above
>
>
>
> One Example of in place but not stable sort is
>
> Quick
>
> Heap
>
> Merge
>
> Bubble
>
>
>
> The running time of quick sort depends heavily on the selection of
>
> Select correct option:
>
> No of inputs
>
> Arrangement of elements in array
>
> Size o elements
>
> Pivot elements
>
> * *
>
> Question # 9 of 10 ( Start time: 07:39:07 PM ) Total M a r k s: 1
>
> In Quick sort algorithm,constants hidden in T(n lg n) are
>
> Select correct option:
>
> Large
>
> Medium
>
> Not known
>
> Small
>
> * *
>
> --
> You received this message because you are subscribed to the Google
> Groups "VU_Askari(MIT)" group.
> To post to this group, send email to vu_askarimit@googlegroups.com
> Visit these groups:
> This (Main) Group:http://groups.google.com/group/vuaskari_com?hl=en?hl=en
> MIT/MCS Group:   http://groups.google.com/group/vu_askarimit?hl=en?hl=en
> HRM Group:         http://groups.google.com/group/askari_hrm?hl=en?hl=en
> Banking Group:    http://groups.google.com/group/askari_banking?hl=en?hl=en
> Management:       https://groups.google.com/group/vuaskari_mgt?hl=en
> Marketing:           https://groups.google.com/group/vuaskari_mkt?hl=en
> MIS Group:          http://groups.google.com/group/askari_mis?hl=en
>


--
asdfff

--
You received this message because you are subscribed to the Google
Groups "VU_Askari(MIT)" group.
To post to this group, send email to vu_askarimit@googlegroups.com
Visit these groups:
This (Main) Group:http://groups.google.com/group/vuaskari_com?hl=en?hl=en
MIT/MCS Group:   http://groups.google.com/group/vu_askarimit?hl=en?hl=en
HRM Group:         http://groups.google.com/group/askari_hrm?hl=en?hl=en
Banking Group:    http://groups.google.com/group/askari_banking?hl=en?hl=en
Management:       https://groups.google.com/group/vuaskari_mgt?hl=en
Marketing:           https://groups.google.com/group/vuaskari_mkt?hl=en
MIS Group:          http://groups.google.com/group/askari_mis?hl=en

--
You received this message because you are subscribed to the Google
Groups "VU_Askari(MIT)" group.
To post to this group, send email to vu_askarimit@googlegroups.com
Visit these groups:
This (Main) Group:http://groups.google.com/group/vuaskari_com?hl=en?hl=en
MIT/MCS Group: http://groups.google.com/group/vu_askarimit?hl=en?hl=en
HRM Group: http://groups.google.com/group/askari_hrm?hl=en?hl=en
Banking Group: http://groups.google.com/group/askari_banking?hl=en?hl=en
Management: https://groups.google.com/group/vuaskari_mgt?hl=en
Marketing: https://groups.google.com/group/vuaskari_mkt?hl=en
MIS Group: http://groups.google.com/group/askari_mis?hl=en

---
You received this message because you are subscribed to the Google Groups "::: vuaskari.com ::: MIT/MCS" group.
To unsubscribe from this group and stop receiving emails from it, send an email to vu_askarimit+unsubscribe@googlegroups.com.
To view this discussion on the web visit https://groups.google.com/d/msgid/vu_askarimit/CAG_r9Juo%2Bnw1VXaA_Jd%3D6rx_Lw4HA%2Bd%2B8scytuAJ7_uDo%3DhbLQ%40mail.gmail.com.

--
You received this message because you are subscribed to the Google
Groups "VU_Askari(MIT)" group.
To post to this group, send email to vu_askarimit@googlegroups.com
Visit these groups:
This (Main) Group:http://groups.google.com/group/vuaskari_com?hl=en?hl=en
MIT/MCS Group: http://groups.google.com/group/vu_askarimit?hl=en?hl=en
HRM Group: http://groups.google.com/group/askari_hrm?hl=en?hl=en
Banking Group: http://groups.google.com/group/askari_banking?hl=en?hl=en
Management: https://groups.google.com/group/vuaskari_mgt?hl=en
Marketing: https://groups.google.com/group/vuaskari_mkt?hl=en
MIS Group: http://groups.google.com/group/askari_mis?hl=en

---
You received this message because you are subscribed to the Google Groups "::: vuaskari.com ::: MIT/MCS" group.
To unsubscribe from this group and stop receiving emails from it, send an email to vu_askarimit+unsubscribe@googlegroups.com.
To view this discussion on the web visit https://groups.google.com/d/msgid/vu_askarimit/CAM63RqTH4GWz%3DH%2BXZX36_nBAz7vNAX42Bq_6ydFyoW8wjt_TsQ%40mail.gmail.com.

--
You received this message because you are subscribed to the Google
Groups "VU_Askari(MIT)" group.
To post to this group, send email to vu_askarimit@googlegroups.com
Visit these groups:
This (Main) Group:http://groups.google.com/group/vuaskari_com?hl=en?hl=en
MIT/MCS Group: http://groups.google.com/group/vu_askarimit?hl=en?hl=en
HRM Group: http://groups.google.com/group/askari_hrm?hl=en?hl=en
Banking Group: http://groups.google.com/group/askari_banking?hl=en?hl=en
Management: https://groups.google.com/group/vuaskari_mgt?hl=en
Marketing: https://groups.google.com/group/vuaskari_mkt?hl=en
MIS Group: http://groups.google.com/group/askari_mis?hl=en

---
You received this message because you are subscribed to the Google Groups "::: vuaskari.com ::: MIT/MCS" group.
To unsubscribe from this group and stop receiving emails from it, send an email to vu_askarimit+unsubscribe@googlegroups.com.
To view this discussion on the web visit https://groups.google.com/d/msgid/vu_askarimit/CAG_r9JvxzsO9t1OqFZBQp9%3DHycGTTtYSUjXkXaXsENv6xJ%2BecA%40mail.gmail.com.

--
You received this message because you are subscribed to the Google
Groups "VU_Askari(MIT)" group.
To post to this group, send email to vu_askarimit@googlegroups.com
Visit these groups:
This (Main) Group:http://groups.google.com/group/vuaskari_com?hl=en?hl=en
MIT/MCS Group: http://groups.google.com/group/vu_askarimit?hl=en?hl=en
HRM Group: http://groups.google.com/group/askari_hrm?hl=en?hl=en
Banking Group: http://groups.google.com/group/askari_banking?hl=en?hl=en
Management: https://groups.google.com/group/vuaskari_mgt?hl=en
Marketing: https://groups.google.com/group/vuaskari_mkt?hl=en
MIS Group: http://groups.google.com/group/askari_mis?hl=en

---
You received this message because you are subscribed to the Google Groups "::: vuaskari.com ::: MIT/MCS" group.
To unsubscribe from this group and stop receiving emails from it, send an email to vu_askarimit+unsubscribe@googlegroups.com.
To view this discussion on the web visit https://groups.google.com/d/msgid/vu_askarimit/CAD_EU9-LrKWF3kA3JRN%3DqFJJu4ehEF-xkAb7B5tgbm8%3D2bsrXw%40mail.gmail.com.

--
You received this message because you are subscribed to the Google
Groups "VU_Askari(MIT)" group.
To post to this group, send email to vu_askarimit@googlegroups.com
Visit these groups:
This (Main) Group:http://groups.google.com/group/vuaskari_com?hl=en?hl=en
MIT/MCS Group: http://groups.google.com/group/vu_askarimit?hl=en?hl=en
HRM Group: http://groups.google.com/group/askari_hrm?hl=en?hl=en
Banking Group: http://groups.google.com/group/askari_banking?hl=en?hl=en
Management: https://groups.google.com/group/vuaskari_mgt?hl=en
Marketing: https://groups.google.com/group/vuaskari_mkt?hl=en
MIS Group: http://groups.google.com/group/askari_mis?hl=en

---
You received this message because you are subscribed to the Google Groups "::: vuaskari.com ::: MIT/MCS" group.
To unsubscribe from this group and stop receiving emails from it, send an email to vu_askarimit+unsubscribe@googlegroups.com.
To view this discussion visit https://groups.google.com/d/msgid/vu_askarimit/CANqye-wfGHE78yYwZ8Zeu4C5U%2BPNj7PbGjiYd_8xUrFyP_4%3DGQ%40mail.gmail.com.

--
You received this message because you are subscribed to the Google
Groups "VU_Askari(MIT)" group.
To post to this group, send email to vu_askarimit@googlegroups.com
Visit these groups:
This (Main) Group:http://groups.google.com/group/vuaskari_com?hl=en?hl=en
MIT/MCS Group: http://groups.google.com/group/vu_askarimit?hl=en?hl=en
HRM Group: http://groups.google.com/group/askari_hrm?hl=en?hl=en
Banking Group: http://groups.google.com/group/askari_banking?hl=en?hl=en
Management: https://groups.google.com/group/vuaskari_mgt?hl=en
Marketing: https://groups.google.com/group/vuaskari_mkt?hl=en
MIS Group: http://groups.google.com/group/askari_mis?hl=en

---
You received this message because you are subscribed to the Google Groups "::: vuaskari.com ::: MIT/MCS" group.
To unsubscribe from this group and stop receiving emails from it, send an email to vu_askarimit+unsubscribe@googlegroups.com.
To view this discussion visit https://groups.google.com/d/msgid/vu_askarimit/CAG_r9JsoCpe3wmU_FwBh_Jyb5AN2VGUSjFpFqZcWkQsVtOdGyw%40mail.gmail.com.

--
You received this message because you are subscribed to the Google
Groups "VU_Askari(MIT)" group.
To post to this group, send email to vu_askarimit@googlegroups.com
Visit these groups:
This (Main) Group:http://groups.google.com/group/vuaskari_com?hl=en?hl=en
MIT/MCS Group: http://groups.google.com/group/vu_askarimit?hl=en?hl=en
HRM Group: http://groups.google.com/group/askari_hrm?hl=en?hl=en
Banking Group: http://groups.google.com/group/askari_banking?hl=en?hl=en
Management: https://groups.google.com/group/vuaskari_mgt?hl=en
Marketing: https://groups.google.com/group/vuaskari_mkt?hl=en
MIS Group: http://groups.google.com/group/askari_mis?hl=en

---
You received this message because you are subscribed to the Google Groups "::: vuaskari.com ::: MIT/MCS" group.
To unsubscribe from this group and stop receiving emails from it, send an email to vu_askarimit+unsubscribe@googlegroups.com.
To view this discussion visit https://groups.google.com/d/msgid/vu_askarimit/CAKAJWa%3Dfg_AzHARcgb9zTGsZqULL19OMuFh5XBGTZtwMBO2UdA%40mail.gmail.com.