Now You can search anything in sharecodepoint using your voice. Click on mic button.

Sharecodepoint popular queries
Search results for Class Test
Showing posts with label Class Test. Show all posts

CSE205 : Data Structure CA Test 1 | Class Test | Continuous Assessment (CA) | SET 1,2,3 | Academic Task 1 | LPU

SET-1 Q1: Transform the following infix expression to their equivalent postfix expressions using stack . ( Note: show each st...

SET-1

Q1: Transform the following infix expression to their equivalent postfix expressions using stack. (Note: show each step while transforming)   (A-B)/C*((C-D/C+D))       (5)
Q2: Write an algorithm to insert an item in to the Queue, where Queue is implemented using array.             (5)

Q3: Explain in detail about LL rotation by taking a suitable example.        (10)

Q4: Write a non-recursive algorithm of preorder traversal of  Binary Tree. Write preorder traversal for given tree atlast.  (10)

SET-2

Q1: Show each step to Evaluate the postfix expression:   7, 5, 2, +, *, 4, 1, 5, -, -, 1, -,/  (5)

Q2: Write an algorithm to insert an item in to the Queue, where Queue is implemented using Linked List.       (5)

Q3: Explain in detail about RR rotation by taking a suitable example.       (10)

Q4: Write a non-recursive algorithm of inorder traversal of Binary Tree. Write inorder traversal for given tree atlast.  (10)

SET-3

Q1: Show each step to sort the given list using quick sort, list is:  41, 65, 35, 21, 48, 59, 87, 28.  (5)

Q2: Write an algorithm to delete an item in to the Queue, where Queue is implemented using array.  (5)

Q3: Explain in detail about R0 rotation by taking a suitable example.      (10)

Q4: Write a non-recursive algorithm of postorder traversal of Binary Tree. Write postorder traversal for given tree atlast. (10)

CSE408 : Design And Analysis of Algorithms CA Test 2 | Class Test | Continuous Assessment (CA) | Academic Task 2 | LPU

SET A Q1. What is Knapsack problem, explain solution using brute force approach and using same, solve for the given data set.   Co...

SET A

Q1. What is Knapsack problem, explain solution using brute force approach and using same, solve for the given data set.  Consider knapsack capacity as 9.

 Item Weight Value 1 5 50 2 3 60 3 7 90 4 6 70

Q2. Write and Explain Quick sort Algorithm.

Q3. Given an array of 6 elements: 15, 19, 10, 7, 17, 16, sort it in ascending order using heap sort and analyse heap sort.

SET B

Q1. Write and Explain Merge sort algorithm.

Q2. Using Count Sort, sort the following array

Q3. Write equations for large integer multiplication method, and using same Multiply 1543 and 1621.

CSE408 : Design And Analysis of Algorithms CA Test 1 | Class Test | Continuous Assessment (CA) | Academic Task 1 | LPU

Set: A                                                                                                                              ...

Set: A

Time Allowed: 45 Min                                                                                                                      M.M. 30

Q1. What are asymptotic notations? Explain Big-Oh notation in detail. Prove that n2/2-3n= Q(n2)    (10)

Q2. Using Rabin karp string matching algorithm match the given pattern P with given string S.
P = 745
S = 745727457                                                                            (10)

Q3. Write KMP algorithm (both Prefix and Matching functions)                           (10)

Set: B

Time Allowed: 45 Min                                                                                                                      M.M. 30

Q1. What do you mean by analysis of algorithms.  Explain Big Omega notation in detail. Show that 2 n^2 - n + 17 = Omega(n^2).                                                                                                             (10)

Q2. Write and explain Rabin Karp string matching algorithm                         (10)

Q3. Using KMP string matching algorithm, find the occurrence of the given patter P in the given text T.
T ß ABABACAB
P ß ABAB                                                                                                                 (10)