ࡱ> [ Kbjbj ΐΐ|B5ORRXdE$$hii333ǻɻɻɻɻɻɻ.Rɻ33^333ɻ޻"B"B"B3@ǻ"B3ǻ"B"B&`i87v Gd0$jA33"B33333ɻɻ"B333$3333333333333R [: aData Structure Problems The variable which can be accessed by all the models is known as ______________ Local Variable Global Variable Internal variable External variable Which of the following ADT can represent a many to many relationship? Tree only Graph only Plex only Both (b) and (c) Data structure means Organizing data Processing data Searching data Both (a) and (b) Which of the following data structure gives overflow even though a current n element in it is less than its size? Stack Circular queue Linked List Simple queue Which of the following is not required for recursive function? Base case Recursive case Both (a) and (b) None of above As a data structure, a stack is most analogous to a super market a small family of weebles a cafeteria tray dispenser All of above A queue is an example of a ________________ data structure. FIFO LILO LIFO Both (a) and (b) Which of the following is consider to be recursive data structure? Linked list Tree Both None of above The recursive function fact(6) is 120 720 24 1024 A solution to a 64 disk Tower of Hanoi problems requires how may disk to be moved? 64 2^64-1 64^2 -1 64^64-1 None of the above We can have float value cases in switch statement. True False Array elements are stored Contiguously Random Cant say What is the output of following program? #include main() { int a=300,b,c; If(a>=400) b=300; c=200; printf(\n%d %d,b,c); } b will contain some garbage value and c will be equal to 200 c will contain some garbage value and b will be equal to 300 c will contain some garbage value and b will be equal to 200 none of above An array is a collection of Different data types scattered throughout memory The same data type scattered throughout memory The same data type placed next to each other in memory Different data typed placed next to each other in memory For the direct initialization of the 2D array, the which one of following is valid? int a[][]={1,2,3,4}; int a[2][]={1,2,3,4}; int a[][2]={1,2,3,4}; none OBJECTIVE QUESTIONS The array index starts from . 0 1 100 A In a matrix declared by int A[2][3], how many rows and columns are there ? a. 2 rows and 2 columns b single row and single column c. 2 rows and 3 columns d. 6 rows and 3 columns Pointer points to the . Address of a variable Value of a variable Value and address of variable None Which is the correct way of declaring the integer pointer ? float *b; int *b; int &b; int b; void main() { int num = 6; *p, *q, s; p=# q=# s = *p + *q; } Which one of the given answers is correct ? num = 3, s = 3; num = 3, s = 9; num = 3, s = 6; num =3, s = 12; Which of the data type is used for declaring a string ? float ; int char double What does the given code display ? printf(%d,&num); Value stored in num Value and memory address of num Memory address of num Does not display anything How many arguments does the give function takes ? int func1(int, char, int); 3 2 1 0 We access structure member through pointer using .. & operator (.) operator -> operator * operator When pointer is not been used, we access structure member with & operator (.) operator -> operator * operator The operations of stack are based on LIFO FIFO FILO LILO Insertion and deletion in Stack is called . operations. Enque and dequeue Insert and cut Push and Pop Give and take Insertion and deletion operation in Stack is done from the same end. True False Stack can be implemented using Linked List. True False If the items 10, 20, 30 and 40 are inserted in the stack in the given ascending order, and then afterwards POP operation is performed, which item is deleted first ? a. 10 b 20 c. 30 d. 40 When we insert the item we execute the statement a. top ++; b top ; c. top+top; d. top top; In the given function to display the stack elements what does int top gives ? a. stack size b position of top item c. value of stack items d. none The given expression is in the form of +AB a. infix b postfix c. prefix d. none Which one is the application of Stack ? a. implementation of BFT b Function call c. printing jobs d. none A linked-list is a collection of records, called .. a. vertices b leafs c. branches d. nodes In a dynamic list, isFull operation returns a. true b false A singly linked list contains a. two parts, data, and pointer to another data b three parts, data, two pointers to adjacent nodes c. 5 parts, d. none Which function of C is used for memory allocation ? a. malloc b alloc c. strcmp d. getch The basic singly-linked list contains .. at the last node pointer a. null b pointer to the adjacent node c. pointer to the first node d. none In an ordinary queue we can insert items from .. a. front end b rear end c. front and rear end d. from the middle In a deque (double ended queue) we can insert items from a. front end b rear end c. front and rear end d. from the middle A node in a doubly linked list has . parts a. 1 b 2 c. 3 d. 4 The middle part of the doubly linked list holds the data. a. true b false A tree is a linear data structure. a. true b. false In a tree the indegree of the root is a. 0 b 1 c. 2 d. 3 If a complete binary tree has height = 3, what is the degree of the root node ? a. 0 b 1 c. 2 d. 3 The unique predecessor of a node is called the . a. mother b parent c. teacher d. daughter Each node in the binary tree can have degree more than 3 ? a. true b false What is the degree of the leaf nodes in the tree ? a. 0 b 1 c. 2 d. 3 A tree is also a graph. a. true b false Links between the pair vertices in the graph is called as : a. line b edge c. corner d. node In an directed graph the edges have directions. a. true b. false To form a cycle in a graph, there must be at least .. vertices that starts and ends with the same vertex. a. 1 b 2 c. 3 d. 4 If a graph has only four vertices, how many edges is formed by a spanning tree ? a. 1 b 2 c. 3 d. 4 Which one means the fastest ? a. O(n) b O(1) c. O(log n) d. O(n log n) What type of sorting technique is applied in the given code ? int num[] = { 3, 4, 6, 7, 8 }; int i, j, temp; for(i=0; inum[j+1] { temp = num[j]; num[j]=num[j+1]; num[j+1]=temp; }} Selection sort Bubble sort Insertion sort Merge sort Which of the following is not the characteristic of an array ? homogeneous ordered finite different name for different elements in the single array If int num[]= {2, 4, 6, 8, 10, 12, 14} and num[i] = 8, what is the value of num[i+2] ? 6 8 10 12 Statements against true or false: (i) Searching is faster than sorting the elements. (ii) Binary search takes less time than linear search. (iii) Insertion sort takes more than O(n2). All the statements are true (i) and (ii) are only true (ii) and (iii) are only true All the statements are false If the items to be inserted in a BST tree are 4, 7, 3, 2, 9 and 8 respectively, how many nodes will be at the left and right of the root node ? a. left 2, right 3 b. left 3, right 2 c. left 1, right 4 d. left 4, right 1 Maintain the hierarchy from top to bottom concerning the tree. a. leaf nodes, internal nodes, root b. internal nodes, root, leaf nodes c. root, internal nodes, leaf nodes d. root, leaf nodes, internal nodes Represent the given binary tree in figure 1 in an array: a. A, B, C, D b. A, B, C, NULL, D c. A, B, C, NULL, NULL, D d. A, B, C, NULL, NULL, NULL, D In a almost complete binary tree all the leaf nodes are at the same label. a. True b. False The postfix expression for the given infix expression is : (a + b) * (c d) a. abcd+* b. +*abcd c. ab + cd * d. abc + d * Which is not the type of queue ? a. Ordinary queue b. Double ended queue c. Circular queue d. Private queue Which of the following data structure may give overflow error, even though the current number of elements in it is less than its size ? a. Stack b. circular queue c. double ended queue d. simple queue Queue can be represented by : a. Array b. Link list c. Tree d. Only (a) and (b) The access of Queue element is a. Sequential b. Random c. Direct d. Indexed In Circular Link list a. Head node contains the address of tail node. b. Tail node contains the address of the head. c. Internal node contains the address of the head node. d. Tail node contains the address of the middle node. Which of the given sort takes the pivot value in every steps ? a. Quick Sort b. Selection Sort c. Bubble sort Which searching technique is faster ? a. Sequential search b. Binary search Which tree traversal gives the data in ascending order ? a. Preorder b. Inorder c. Post-order What is the running time of Binary Tree Search ? a. O(n) b. O(log n) on average and O(n) in the worst case c. O(n2) d. o(1) Which notation is used to state the bottom limit considering the running time of the algorithm ? a. O b. ( c. o d. ( Which notation is used to define the given expression ? f(n) = O(g(n)), but f(n) ( ((g(n)) a. O b. ( c. o d. ( Section C [4*15=60] The following statements are about array: Subscript range must be +ve integer constant. Selection of array name is similar to selecting a variable name or identifier in C. An array can hold different types of data type. Matrix is represented by double dimensional array. The true statements are: a. I, II and III b. I, II, III and IV c. I, II and IV d. none What is the result in ascending order against the given numbers in the first step when i = 0 considering the bubble sort ? int num[] = {5, 2,7, 3, 30, 13, 10, 25, 78} ; a. 2, 3,5, 7, 10, 13, 25, 30, 78 b. 2, 5, 3, 7, 13, 10, 25, 30, 78 c. 2, 7, 3, 5, 30, 13, 10, 25, 78 d. none What is the result after postorder traversal in the given tree in fig. 2.  a. EBAFCD b. EBFDCA c. ABECFD d. EFDBCA What is the result after preorder traversal in the given tree in fig. 2. a. EBAFCD b. EBFDCA c. ABECFD d. EFDBCA What is the number of nodes in the level 3 in the complete binary tree ? a. 1 b. 2 c. 4 d. 8 In a undirected graph G, V={A, B, C, D} and E = {(A,B),(A,C),(A,D),(B,C), (B,D), (CD)}. How many edges are there ? a. 4 b. 5 c. 6 d. 7 An adjacency matrix representation of a graph cannot contain information of a. Nodes b. Edges c. Direction of edges d. parallel edges Which of the following sorting method follow the strategy Divide and Conquer ? a. Bubble sort b. Selection sort c. Insertion sort d. Merge sort Give the breath first traversal for the following tree in fig. 3.  a. PQSWRTUV b. WSQTVURP c. PQRSTUWV d. SWQPTRUV Which of the following sorting method needs more memory space ? a. Bubble sort b. Selection sort c. Insertion sort d. None Which of the following sorting method uses the partition technique ? a. Bubble sort b. Selection sort c. Insertion sort d. Quick sort In the given list what time does the linear search take to find 7 ? int num[]= {7, 14, 15, 20, 67, 85, 94 } a. O(n) b. O(1) c. O(n2) d. O(n log n) How many sub trees are there in the fig. 3. a. 4 b. 5 c. 6 d. 7 In the binary tree in fig. 3, list out the successors of the node R. a. T and U b. P only c. T U and V d. S and W Which one is also known as the Gready algorithm ? a. Prims Algorithm b. Dijkstra Algorithm c. Kruskals algorithm d. Bellman-Ford Algorithm Data in the databases are independent of the application. True False .. are the rules applied in a Splay Tree. a. Zig b. Zig-zag c. Zig-zig d. All A simple graph contains self-loop. True False Find true statements about a spanning tree: A spanning tree is a subgraph. It is also a tree. There are maximum number of edges in a spanning tree. A graph may have many spanning trees. The true statements are: a. I, II and III b. I, II, III and IV c. I, II and IV d. none Find true statements about a minimum spanning tree: A minimum spanning tree is a subgraph. It is also a tree. Minimum spanning tree is built from a weighted graph. The problem in a minimum spanning tree is to find the minimum length spanning tree. The true statements are: a. I, II and III b. I, II, III and IV c. I, II and IV d. All .. algorithm solves the problem of finding the shortest path from a point (the source) to a destination. a. Dijkstra b. Prim c. Kruskal d. none is a single-source shortest path algorithm which can find the shortest path in a graph with negative weighted edges. a. Dijkstra b. Bellman-Ford c. Prims d. Kruskal .. are the different types of Floyd Warshall, single-source shortest paths algorithm used in DAG (Directed Acyclic Graph). a. Transitive Hull b. MiniMax Distance c. MaxiMin Distance d. All .. is a process that updates the cost of all the vertices, v, connected to a vertex u, if we could improve the best estimate of the shortest path to v by including (u,v) in the path v. a. Relaxation b. Analysis c. Count d. Search Which the given notation means the slowest ? a. n! b. n log n c. n+lg d. n Which the given notation means the fastest ? n! n log n n+lg N Find true statements about a Red-Black Tree: Every node is either red or black The root is black Every leaf(NIL) is red. If a node is red, then both its children are black. The true statements are: a. I, II and III b. I, II, III and IV c. I, II and IV d. All Which of the given operations of BST are performed in Log2 n time. Search Insert Delete Inorder Traversal The true statements are: a. I, II and III b. I, II, III and IV c. I, II and IV d. All A red-black tree with n internal nodes has height at most 2lg(n+1) 2n n n2 A complete binary tree has . number of nodes at the level d. 2d 2+d d 2d Tower of Hanoi takes times to move the number of disks to a tower of size n. O(2n) O(n) O(n+2) O(n2) Every leaf (NIL) in a Red-Black Tree is black. True False The balance factor in an AVL tree are lh rh eh All Which of the given are examples of Graph problems ? Telecommunication Riding The Fences Knight moves Overfencing The true statements are: a. I, II and III b. I, II, III and IV c. I, II and IV d. All Which of the given are examples of Uninformed Search ? Breadth-first search Uniform-cost search Depth-first search Depth-limited search The true statements are: a. I, II and III b. I, II, III and IV c. I, II and IV d. All Which of the given are examples of Infromed Search ? Iterative deepening search Bidirectional search Best First Search A* Search The true statements are: a. I, II and III b. I, II, III and IV c. III and IV d. none Which one is the more advanced form of file structure ? Inverted file Multi-lists Cellular multilist All If a tree is implemented to represent a file system, where are the files located ? at the root at the internal nodes at the leaf nodes All Subjective questions Define data structure and also mention its importance. Explain the types of structured data types. What is abstract data type (ADT)? What is stack? Give the codes of Push and Pop operation in stack. What is queue? Differentiate between simple queue and circular queue. Write only the insert into and display the items from a circular queue. Write only the insert into and display the items from a dequeue. What is sorting? Write the algorithm of quick sort. Write a program to sort the data in ascending order using selection sort. Write the algorithm for bubble and radix sorts. What is recursion? Write a recursive program to find GCD. Give the difference between Recursion and Iteration. Write the codes to display the reversing the string. What is data searching? Write a program to search the data using binary search? Discuss different type of notation. Why do we need postfix notation? Convert the following infix notation to postfix notation. (A + B) * C /D (A + B) * C / D + E ^ F / G Define pointer. Give an example to access structure members using pointer. What is a Stack ? Write C function to push item into the stack. List out different types of queues and give and illustration example to insert and delete items in a circular queue. Why do we need linked list? Give a difference between singly and doubly linked list. What is a Binary Tree ? List out the traversal methods in a Binary Tree with illustration examples. Give the difference between the insert and bubble sort. Define array? Write a program to store 10 salesmens amount in an array and find out total sale & best sales amount. What do you mean by a Graph? How graphs are represented? Explain Explain the following Strictly binary tree Complete binary tree Explain the Prims Algorithm to find minimum spanning tree with suitable example Write the algorithm and C program for sorting the numbers in ascending order using quick.      PAGE \* MERGEFORMAT 3 A B C D Fig. 1 A B C D Fig. 2 E F P Q R U Fig. 3 S T V W ij * . p w x     ^_wy +,mnwx2Bz{Ƽhsh w5hHh w5 hSIh wh w h w5>*h Nxh w5>*hRG h>kh;2jhUPh&hV-ehZG`hhhn*hA0hn5>*B*CJ,OJQJ\ph<jy  # 8 H X g x  W  & Fgdh & Fgdh & Fgdh & Fgdh & FgdhgdhW a p   P V [ ` q    & F gd& & F gd& & Fgd& & Fgd& & Fgd& & Fgdh & Fgdh ^ a h p x ) ; B D S ^ e l gdRG  & FgdRG  & F gd4 & F gd4 & Fgd>k & F gd4 & FgdUP & F gd&l <Jf6   & F 0d`0gd4 & F 80d`0gd4$a$gd w & Fgd4 & Fgd4 & FgdRG  & Fgd4gdRG   _w,12nx & F 80d`0gd4 h^`hgd w & F 8d^gd4^gd w & F 0d`0gd4"2BC{8^8gd wgd w & F 80d`0gd4^gd w & F 0d`0gd4{{|~+,67DOP_vUZ_`;?ADFKMNT59MQ h :h w ht=hh whV-ehsh w5 hSIh wh wV./a|~,7DP[8^8gd w & F 80d`0gd4gd w & F 0d`0gd4UZ`} & F @ d^gd4 & F pd^gd4 & F pd^gd4 & F pd`gd4 & F 80d`0gd4 & F 0d`0gd4<BGNT5NVp^pgd w h^`hgd w & F 8d^gd4 & F d^gd4VbjwLZb & F 8d^gd4 h^`hgd wUYadinvwKPY]  ',EI .1ostwxy./467<=Ah)I'h w5hsh w5 hSIh wh wZ (FN .Apuy h^`hgd w & F 8d^gd4/48>C GOW pM h^`hgd w & F 8d^gd4 h^`hgd wFJNOW  ST\8<=@ABHKjnrsz~| } !L!M!!!!a" h81h w h0h w h w5h)I'h w5 hSIh wh wV $T\f9>BHMksz & F 8d^gd4 h^`hgd wz  - E V j y | 8^8`gd w ^`gd w^gd w & F 8d^gd4 ^`gd w $^a$gd wgd w h^`hgd w| } ! !!L!!xxxx & F p8d^8gd4 & F 8d^gd4 ^gd w & F 0d`0gd4 & F 80d`0gd4 & F 8@0d`0gd4p^pgd w !!!!!!"9"e"f"""""g#h#{### T^T`gd w d^gdn & F pd^gd48^8gd w & F 8d^gd4 & F pd^gd4a"b"e"f"""g#h#{###=$a$$$$% %!%l%p%t%u%~%%%%%(&)&c&t&&&-'='Z'['y''''''' (O((( )Q)R)g)x))))) * **D*J*K*****h\h wH* hFh wjh wUmHnHuhnhe"h w5 h0hnhA<h w5 h0h wh wh!Ih wH*C####$=$a$$$$$$$$$$% %!%"%m%u%~%%^gd w & F 8d^gd4 T^T`gd w%%%%%&)&;&Q&c&t&&''-'='['d'q'y'''''' & F 8d^gd4 T^T`gd w`gd w''' (O((((( )),)R)g)x)))))))) **D* *^*`gd w & F 8d^gd4 T^T`gd wD*M*U******+%+*+/+4+9+:+O+z++,2, & Fdgd4 & Fdgd4 $^a$gd w T^T`gd w & F 8d^gd4 *^*`gd w*****++++++-+.+/+4+7+8+:+M+O+z++++,d,i,,,,,,,,,,,,,----..N.O.U.W.a.k..³襝hlh w5jh wUmHnHuhnhsgh w5 hd h w hs\Ch whE<h wB*\aJphhE<h w5aJ jWh w jh w h0h w jQh wh whe"h w5 jWhe"h w532,i,,,,,,c-----...N.R.S.T.U.W.a. T^T`gd wv^vgd w & Fdgd4`gd wgd w^gd w & Fdgd4a.k.u.........;/@/E/J/O///////(010:0P0 8d^8gdn & Fdgd4 T^T`gd w....J/O///P0b00000;1<1Z1f1r1s111h2v22222F3K3334044444445 595;5Y5]5o5p5555566!6"6<6󺲭hsgh w5 hd h w hs\Ch wh th w5 h w5h'th w5 h'th wh}:Xh w5h"h wH*h gmh w5jh wUmHnHuh#Ah w5hnh whlh w58P0b000000000;1=1>1?1@1A1B1N1Z1f1r1s111111gd w & Fdgd4 T^T`gd w152D2V2h2v222222 373<3A3F3K33333334404^gd w T^T`gd w & Fdgd404J44444444455 55;5]5p5555^gd w & Fdgd48^8gd w & Fdgd4 & Fdgd4 & Fdgd4 T^T`gd w56"6<6N66666M7f7777768C8K8V8^8888 T^T`gd w^gd w & Fdgd4 & Fdgd4`gd wgd w<6F6G6I6M6N6666666I7M7e7s777777777776898B8C88888899:::::::';(;*;+;4;i;k;;;;;;; <<$<2<C<D<h|h w5 h|h w h6 h wh6 h w5h:hh w5hWCh w5 hWCh w h w5h gmh w5hGh w5 h,h w hs\Ch wh w hd h w>88999999::::::::::';+;4;:;=;k; & Fdgd4 & Fdgd4 T^T`gd wk;;;;; <%<D<^<n<o<<<<<<<=2=L=\== & Fdgd4 & Fdgd4`gd wgd w^gd w & Fdgd4D<^<n<<<<<<<<<<<<<<<= =1=2=L=\=============D>G>H>I>J>Y>Z>[>\>>>>>>>º첫죙º첈º hph w hUh whd]h w5H*h=~ h w5H*h=~ h w5 hh wh|Jh wH*h}:Xh w5 h w5 h $ h wh $ h w5 hd h wh;h wH* hs\Ch wh w h ^h wh ^h w51==========D>J>O>V>\>>>>>>> & F$dgd4 & F#dgd4 & F"dgd4 & F!dgd4 & Fdgd4 & F dgd4>>>??'?4?B?[?v?????@"@5@L@e@@@ & F&dgd4`gd wgd w^gd w & F%dgd4 & Fdgd4 & F$dgd4>>>???&?'???B?Z?[?v???????? @@!@"@I@L@d@e@@@@@@@@@AA-A.AIALAdAeAAAAAAA BBB-B1BBBBBBh(&h w5 h(&h w h9Xh wh9Xh w5 hph w h*h wh*h w5hsth w5 h $ h w hsth w hd h w hs\Ch wh whph w5;@@@@A.A@ALAeAAAAABBB-B1BBBB & F)dgd4 & F(dgd4^gd w & F'dgd4 & Fdgd4`gd wgd wBBBBBBBZC|CCDLDDD E;EuEE0FuFFFF & F/gdn & F/gd4 & F.gd4 & F.gd4gd w & F)dgd4BBBBBBBB CYCZCLDD E;EEEFFGGHHHHDIEIIIIIIIIο}qcXch}OJQJ\^Jhv h}OJQJ\^Jh}B*OJQJphhu1h}B*OJQJph$hh}B*OJQJ\^Jph!h7Knh}B*OJQJ^Jphh}h}B*OJQJphh-F h}B*OJQJphh!Vh}OJQJh+KfhtOJQJh*htOJQJhN8hah whn!F'GgGG3HHHEIIIIIJvJwJ{gd w & F.gdn & F. h0dhx`0gdn$ & F-*dh^*a$gd4$ & F.dha$gdn & F.hdh1$^hgdn$ & F.dhxa$gdn & F.dgdn & F.gdnIIJJtJuJxJyJzJ{J|J}JJJJJJJJJJJJJJJJJKKüÝhV-emHnHujhHGUhHGhMfjhMfU hUPhUPh;2jh>k hd h wh whn!hoWFh}B*OJQJ^Jphhv h}5OJQJhv h}OJQJhv h}OJQJ^JwJxJyJzJ{J|J~JJJJJJJJJJJJJJJJJ$a$dgdUPgd;2j^gd>k hh^h`hgd w^gd wJJJJJJJJJJJJJJJJJJJJJJJJJJJJgd w$a$gd wJJJJJJJJJJJJJJJJJJJJJKKgdUPgd w$a$gd w21h:p w/ =!"#$% 9 01h:pn/ =!"#$% P 9 01h:pn/ =!"#$% P 9 01h:pn/ =!"#$% P 9 01h:pn/ =!"#$@% P 5 01h:pHG/ =!"#$@% 9 01h:pn/ =!"#$@% P 21h:pZG`/ =!"#$% 5 01h:pn/ =!"#$% 9 01h:pn/ =!"#$% P 5 01h:pn/ =!"#$% 9 01h:pn/ =!"#$% P 5 01h:pn/ =!"#$% j 666666666vvvvvvvvv666666>6666666666666666666666666666666666666666666666666hH6666666666666666666666666666666666666666666666666666666666666666662 0@P`p2( 0@P`p 0@P`p 0@P`p 0@P`p 0@P`p 0@P`p8XV~ OJPJQJ_HamH nH sH tH J`J ZG`Normal dCJ_HaJmH sH tH DA`D Default Paragraph FontRiR 0 Table Normal4 l4a (k ( 0No List D@D h List Paragraph ^m$H`H UP No SpacingCJ_HaJmH sH tH R @R  w0Footer !dCJOJPJQJaJB!B  w0 Footer CharCJOJPJQJaJR@2R  w0Header H$dCJOJPJQJaJBAB  w0 Header CharCJOJPJQJaJPK![Content_Types].xmlj0Eжr(΢Iw},-j4 wP-t#bΙ{UTU^hd}㨫)*1P' ^W0)T9<l#$yi};~@(Hu* Dנz/0ǰ $ X3aZ,D0j~3߶b~i>3\`?/[G\!-Rk.sԻ..a濭?PK!֧6 _rels/.relsj0 }Q%v/C/}(h"O = C?hv=Ʌ%[xp{۵_Pѣ<1H0ORBdJE4b$q_6LR7`0̞O,En7Lib/SeеPK!kytheme/theme/themeManager.xml M @}w7c(EbˮCAǠҟ7՛K Y, e.|,H,lxɴIsQ}#Ր ֵ+!,^$j=GW)E+& 8PK!Ptheme/theme/theme1.xmlYOo6w toc'vuر-MniP@I}úama[إ4:lЯGRX^6؊>$ !)O^rC$y@/yH*񄴽)޵߻UDb`}"qۋJחX^)I`nEp)liV[]1M<OP6r=zgbIguSebORD۫qu gZo~ٺlAplxpT0+[}`jzAV2Fi@qv֬5\|ʜ̭NleXdsjcs7f W+Ն7`g ȘJj|h(KD- dXiJ؇(x$( :;˹! I_TS 1?E??ZBΪmU/?~xY'y5g&΋/ɋ>GMGeD3Vq%'#q$8K)fw9:ĵ x}rxwr:\TZaG*y8IjbRc|XŻǿI u3KGnD1NIBs RuK>V.EL+M2#'fi ~V vl{u8zH *:(W☕ ~JTe\O*tHGHY}KNP*ݾ˦TѼ9/#A7qZ$*c?qUnwN%Oi4 =3ڗP 1Pm \\9Mؓ2aD];Yt\[x]}Wr|]g- eW )6-rCSj id DЇAΜIqbJ#x꺃 6k#ASh&ʌt(Q%p%m&]caSl=X\P1Mh9MVdDAaVB[݈fJíP|8 քAV^f Hn- "d>znNJ ة>b&2vKyϼD:,AGm\nziÙ.uχYC6OMf3or$5NHT[XF64T,ќM0E)`#5XY`פ;%1U٥m;R>QD DcpU'&LE/pm%]8firS4d 7y\`JnίI R3U~7+׸#m qBiDi*L69mY&iHE=(K&N!V.KeLDĕ{D vEꦚdeNƟe(MN9ߜR6&3(a/DUz<{ˊYȳV)9Z[4^n5!J?Q3eBoCM m<.vpIYfZY_p[=al-Y}Nc͙ŋ4vfavl'SA8|*u{-ߟ0%M07%<ҍPK! ѐ'theme/theme/_rels/themeManager.xml.relsM 0wooӺ&݈Э5 6?$Q ,.aic21h:qm@RN;d`o7gK(M&$R(.1r'JЊT8V"AȻHu}|$b{P8g/]QAsم(#L[PK-![Content_Types].xmlPK-!֧6 +_rels/.relsPK-!kytheme/theme/themeManager.xmlPK-!Ptheme/theme/theme1.xmlPK-! ѐ' theme/theme/_rels/themeManager.xml.relsPK]   (+.147:BEHKNC  "#%')  (+.147:BEHKNQ !&&&(s):C 4 o W ƭ 8 o  0244444444444444444444444444444444444444444444444444444444444444444444444447{a"*.<6D<>BIK&-25:?BGJMPRW  l z| !#%'D*2,a.P010458k;=>@BFwJJJK'()*+,./01346789;<=>@ACDEFHIKLNOQSTU*,7!8*+@**r(  nb l(  #" ?n <D%  #" lt"Tt2  S "`X !, t2  S "`< t2  S "`t"# t2  S "`#D%   fB,CDEF,@!"   fB,CDEF,@#" (#T$   f̟B,CDEF,@#" , Xh   3 "`$( zb x`!   #" ?z2   c $ "`  z2  c $"`t z2  c $"`t4 z2  c $ "`4     fB,CDEF,@  fB,CDEF,@#"   f̟B,CDEF,@#" H 8n  C  "`D`!  z2  c $ "`xD     f̟B,CDEF,@#" ,l2  c $ D     `̟@AB,CDEF,@#" d5B b 4,&@  #" ?Z 4,&@  4,&@z2  c $ "`l,  z2  c $"`Pc z2  c $"`c z2  c $"`X o   fB,CDEF,@H   fB,CDEF,@#" <ch4 ! f̟B,CDEF,@#" n " C ""`t"& z2 # c $#"`43  $ f̟B,CDEF,@#" cl2 % c $%l3  & `̟@AB,CDEF,@#"  cz2 ' c $'"` )"@  ( fB,CDEF,@#"  49!l2 ) c $)P$  * R@AB,CEF,@#" QB S  ?N&;)C8t tvg{ t29DGlruxz,/x { a d k n v y   OR{|!!##?%@%c%f%&&&**++,,,%,,,,,,,P-X-..90A0N0U0000011.1611111n2q222539344666647?788#:,:<<|B|B~B~BBBBBBBBBBBC;ADGSVlsen02wxd m  r z Y ` a d 4;BC56NOVWbcjkwxZ[  ()FG  ./uv45CFGHOP  ')TU\]28>?ajnpst~ .3EKY]jnSW^``fhi{|=>ab%&!(-. I!Q!!!" " """"G"I"M"N""""""""""###*#+#/#0#4#5#$$\%b%c%k%%%%%K&M&&&4':'''P(Q((())(*3***********++4+6+++,,,,v--E.M.//V0W0 11111122222222223&3(3)33344666677889999z:::;<<1?8?,@0@D@J@|B|B~B~BBBBBBBBBBBC33333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333*._ v @@AABB{B|B|B~B~BBBBBBBBBBBC/+xP7 b?+fC.fCQKH_wGwG^:h!2tdkGV'pqn'h:Mm'q p?*y&\+*}-q&Qn.fCj0&3fC8w8 O,9`:~ 0:^)P;h:^u>^?~ X@" 7C44+Fθ BF`[H(q ID0CKfCY+LfC\R;VV"ZfC3\~ j ]h:Uq]ufvawmcZNMn~ yn\ܻ yq8n[3Fr"{wh:Z;]yd04hW}fC+~>^`o(. ^`hH. pL^p`LhH. @ ^@ `hH. ^`hH. L^`LhH. ^`hH. ^`hH. PL^P`LhH.h pp^p`hH.h @ @ ^@ `hH.h L^`LhH.h ^`hH.h ^`hH.h L^`LhH.h PP^P`hH.h   ^ `hH.h L^`LhH.^`o(.  ^ `hH.  L^ `LhH. x^x`hH. H^H`hH. L^`LhH. ^`hH. ^`hH. L^`LhH.^`o(.  ^ `hH.  L^ `LhH. x^x`hH. H^H`hH. L^`LhH. ^`hH. ^`hH. L^`LhH.^`5o(hH. ^`hH. pL^p`LhH. @ ^@ `hH. ^`hH. L^`LhH. ^`hH. ^`hH. PL^P`LhH.8^8`OJPJQJ^J)^`. L^ `L. ^ `.x^x`.HL^H`L.^`.^`.L^`L.8^8`o() ^`hH.  L^ `LhH.  ^ `hH. x^x`hH. HL^H`LhH. ^`hH. ^`hH. L^`LhH.h 88^8`hH.h ^`hH.h  L ^ `LhH.h   ^ `hH.h xx^x`hH.h HLH^H`LhH.h ^`hH.h ^`hH.h L^`LhH.8^8`OJPJQJ^J)^`. L^ `L. ^ `.x^x`.HL^H`L.^`.^`.L^`L.h L^`Lo(hH.h pp^p`hH.h @ L@ ^@ `LhH.h ^`hH.h ^`hH.h L^`LhH.h ^`hH.h PP^P`hH.h  L ^ `LhH.8^8`o() ^`hH.  L^ `LhH.  ^ `hH. x^x`hH. HL^H`LhH. ^`hH. ^`hH. L^`LhH.8^8`o() ^`hH.  L^ `LhH.  ^ `hH. x^x`hH. HL^H`LhH. ^`hH. ^`hH. L^`LhH.8^8`o() ^`hH.  L^ `LhH.  ^ `hH. x^x`hH. HL^H`LhH. ^`hH. ^`hH. L^`LhH.h ^`hH.h ^`hH.h pL^p`LhH.h @ ^@ `hH.h ^`hH.h L^`LhH.h ^`hH.h ^`hH.h PL^P`LhH.^`o(.  ^ `hH.  L^ `LhH. x^x`hH. H^H`hH. L^`LhH. ^`hH. ^`hH. L^`LhH.L 88^8`o(hH. ^`hH. pLp^p`LhH. @ @ ^@ `hH. ^`hH. L^`LhH. ^`hH. ^`hH. PLP^P`LhH.^`o(.  ^ `hH.  L^ `LhH. x^x`hH. H^H`hH. L^`LhH. ^`hH. ^`hH. L^`LhH.^`o() ^`hH. pL^p`LhH. @ ^@ `hH. ^`hH. L^`LhH. ^`hH. ^`hH. PL^P`LhH.h L^`Lo(hH.h pp^p`hH.h @ L@ ^@ `LhH.h ^`hH.h ^`hH.h L^`LhH.h ^`hH.h PP^P`hH.h  L ^ `LhH.h pp^p`hH.h @ @ ^@ `hH.h L^`LhH.h ^`hH.h ^`hH.h L^`LhH.h PP^P`hH.h   ^ `hH.h L^`LhH.h L^`Lo(hH.h pp^p`hH.h @ L@ ^@ `LhH.h ^`hH.h ^`hH.h L^`LhH.h ^`hH.h PP^P`hH.h  L ^ `LhH.h ^`o(hH.h   ^ `hH.h  L ^ `LhH.h xx^x`hH.h HH^H`hH.h L^`LhH.h ^`hH.h ^`hH.h L^`LhH.h L^`Lo(hH.h pp^p`hH.h @ L@ ^@ `LhH.h ^`hH.h ^`hH.h L^`LhH.h ^`hH.h PP^P`hH.h  L ^ `LhH.h pp^p`hH.h @ @ ^@ `hH.h L^`LhH.h ^`hH.h ^`hH.h L^`LhH.h PP^P`hH.h   ^ `hH.h L^`LhH.8^8`OJPJQJ^J)^`. L^ `L. ^ `.x^x`.HL^H`L.^`.^`.L^`L.h @ @ ^@ `hH.h ^`hH.h L^`LhH.h ^`hH.h ^`hH.h PLP^P`LhH.h   ^ `hH.h ^`hH.h !L!^!`LhH.8^8`o() ^`hH.  L^ `LhH.  ^ `hH. x^x`hH. HL^H`LhH. ^`hH. ^`hH. L^`LhH.= 88^8`o(hH. ^`hH. pLp^p`LhH. @ @ ^@ `hH. ^`hH. L^`LhH. ^`hH. ^`hH. PLP^P`LhH.8^8`OJPJQJ^J)^`. L^ `L. ^ `.x^x`.HL^H`L.^`.^`.L^`L.^`o(.  ^ `hH.  L^ `LhH. x^x`hH. H^H`hH. L^`LhH. ^`hH. ^`hH. L^`LhH.^`o(.  ^ `hH.  L^ `LhH. x^x`hH. H^H`hH. L^`LhH. ^`hH. ^`hH. L^`LhH.^`o() ^`hH. pL^p`LhH. @ ^@ `hH. ^`hH. L^`LhH. ^`hH. ^`hH. PL^P`LhH.h pp^p`hH.h @ @ ^@ `hH.h L^`LhH.h ^`hH.h ^`hH.h L^`LhH.h PP^P`hH.h   ^ `hH.h L^`LhH.^`o(.  ^ `hH.  L^ `LhH. x^x`hH. H^H`hH. L^`LhH. ^`hH. ^`hH. L^`LhH.h L^`Lo(hH.h pp^p`hH.h @ L@ ^@ `LhH.h ^`hH.h ^`hH.h L^`LhH.h ^`hH.h PP^P`hH.h  L ^ `LhH.h L^`Lo(hH.h pp^p`hH.h @ L@ ^@ `LhH.h ^`hH.h ^`hH.h L^`LhH.h ^`hH.h PP^P`hH.h  L ^ `LhH.8^8`o() ^`hH.  L^ `LhH.  ^ `hH. x^x`hH. HL^H`LhH. ^`hH. ^`hH. L^`LhH.   ^ `hH. pp^p`hH. @ L@ ^@ `LhH. ^`hH. ^`hH. L^`LhH. ^`hH. PP^P`hH.  L ^ `LhH.8^8`o() ^`hH.  L^ `LhH.  ^ `hH. x^x`hH. HL^H`LhH. ^`hH. ^`hH. L^`LhH.h L^`Lo(hH.h pp^p`hH.h @ L@ ^@ `LhH.h ^`hH.h ^`hH.h L^`LhH.h ^`hH.h PP^P`hH.h  L ^ `LhH.8^8`o() ^`hH.  L^ `LhH.  ^ `hH. x^x`hH. HL^H`LhH. ^`hH. ^`hH. L^`LhH.8^8`o() ^`hH.  L^ `LhH.  ^ `hH. x^x`hH. HL^H`LhH. ^`hH. ^`hH. L^`LhH.8^8`o() ^`hH.  L^ `LhH.  ^ `hH. x^x`hH. HL^H`LhH. ^`hH. ^`hH. L^`LhH.h L^`Lo(hH.h pp^p`hH.h @ L@ ^@ `LhH.h ^`hH.h ^`hH.h L^`LhH.h ^`hH.h PP^P`hH.h  L ^ `LhH.8^8`OJPJQJ^J)^`. L^ `L. ^ `.x^x`.HL^H`L.^`.^`.L^`L.^`o(.  ^ `hH.  L^ `LhH. x^x`hH. H^H`hH. L^`LhH. ^`hH. ^`hH. L^`LhH.8^8`o() ^`hH.  L^ `LhH.  ^ `hH. x^x`hH. HL^H`LhH. ^`hH. ^`hH. L^`LhH./+ynp?* yqUq]G^&\+mc[3FrMm'+~q IGV'wGZ;]y7Ch!va^?^u>VP7 X@+F0:HhW}3\,9`:NMn{wCK&3?+n.Y+L)P;qn'j ].V"Zj0}-QK\R8w8BF//                  f        f        T        B^E                         M@                          2έ        p >                 f        V        f                                            \Kz                          z                 >        7R        FA        f        f                          f                          ) @                 B|4o                                  zί                 B        f                wVm|T/72  RG [  '[XkA00@S] -!z\!"g"uk#8$1+~3-/w-u70w3bt4f5N8Jd89zs9 :2?AB1BXBpB"C,G!LHLqiMePYQlQ l }(]')Y;f|>kp r227^]%>(Zv URkMSz\(S&DR%e.{|E,fg$'Mflnq9O\bUP^+}z ;ht_bh,|B~B@CH@UnknownG*Cx Times New Roman5Symbol3. *Cx Arial7Century7.@CalibriA$BCambria Math"1hΩf-T '\ 8!x 8"y!0[BB2qHP $Ph2/!xx regbhandari Ganesh-PC/                           ! " # $ % & ' ( ) * + , - . Oh+'0p   , 8 DPX`h regbhandariNormal Ganesh-PC17Microsoft Office Word@(- @qx@ҿ8 8՜.+,0 hp  Time Computer Systemx![B  Title  !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~Root Entry FWw81TableXHWordDocumentSummaryInformation(DocumentSummaryInformation8CompObjy  F'Microsoft Office Word 97-2003 Document MSWordDocWord.Document.89q