;
!"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~Root Entry
!"#$%&()+
FMicrosoft Word-Dokument
MSWordDocWord.Document.89q
[\\Default1$*$3B*OJQJCJmH sH KHPJnH^JaJ_HtHBA@BAbsatz-Standardschriftart22Numbering SymbolsFFHeading
x$OJQJCJPJ^JaJ.B. Text body
x /" List^J@2@Caption
xx$CJ6^JaJ]&B&Index$^J7K"p)d@VfeҕnNOPQRSTUV
PL.\ #&(*X.157:=@DPHLN8QTVYhZ\_**f0jnsvy~LNDD$nWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~7K7KPGTimes New Roman5Symbol3&ArialUTimesNewRomanPS-BoldMTKTimesNewRomanPSMTOLucida Sans Unicode5Tahoma5TahomaBhF
QH11
QH11'0Oh+'0|8 @
LXd
p0@@@?E@՜.+,D՜.+,\M 0nCaolan80 $"7KN W:l4PLpX|pHughes Technical Paper 1
HUGHES PAPER ON 7th AUGUST 2008
There were two papers one was aptitude ( 36 questions) and other was technical(20 questions)
1: given an expression tree and asked us to write the in fix of that expression four choices
2: global variables in different files are
a)at compiletime
b) loading time
c) linking time
d)execution time
3)size of(int)
a) always 2 bytes
b) depends on compiler that is being used
c) always 32 bits
d) can't tell
4)which one will over flow given two programs 2
prog 1: prog2:
main() main()
{ {
int fact; int fact=0
long int x; for(i=1;i<=n;i++)
fact=factoral(x); fact=fact*i;
} }
int factorial(long int x)
{
if(x>1) return(x*factorial(x-1);
} a) program 1;
b) program 2;
c) both 1 &2
d) none
}
5) variables of fuction call are allocated in
a) registers and stack
b) registers and heap
c) stack and heap
d)
6) avg and worst case time of sorted binary tree
7) data structure used for proority queue
a) linked list
b) double linkedd list
c)array
d) tree
8)
main(){
char str[5]="hello";
if(str==NULL) printf("string null");
else printf("string not null");
}
what is out put of the program?
a) string is null
b) string is not null
c) error in program
d) it executes but p rint nothing
9)there are 0ne 5 pipe line and another 12 pipe line sates are there and flushed time taken to execute
five instructions
a) 10,17
b) 9,16
c)25,144
d)
10) for hashing which is best on terms of buckets
a)100
b)50
c)21
d)32
Ans 32
11)
void f(int value){
for (i=0;i<16;i++){
if(value &0x8000>>1) printf("1")
else printf("0");
}}
what is printed?
a) bineray value of argument b)bcd value c) hex value d) octal value
12)
void f(int *p){
static val=100;
val=&p;
}
main(){
int a=10;
printf("%d ",a);
f(&a);
printf("%d ",a);
}
what will be out put?
a)10,10
13)
struck a{
int x;
float y;
char c[10];
}
union b{
int x;
float y;
char c[10];
}
which is true?
a) size of(a)!=sizeof(b);
b)
c)
d)
14)
# define f(a,b) a+b
#defiune g(c,d) c*d
find valueof f(4,g(5,6))
a)26
b)51
c)
d)
15)
find avg access time of cache
a)tc*h+(1-h)*tm
b)tcH+tmH
c)
d) tc is time to access cache tm is time to access when miss occur
16)
main()
{ char a[10]="hello";
strcpy(a,'\0');
printf("%s",a);
}
out put of the program?
a) string is null b) string is not null c) program error d)
17)
simplify k map
1 x x 0
1 x 0 1
18)
int f(int a)
{ a=+b;
//some stuff
}
main()
{
x=fn(a);
y=&fn;
what are x & y types
a) x is int y is pointer to a function which takes integer value
19)
char a[5][15];
int b[5][15];
address of a 0x1000 and b is 0x2000 find address of a[3][4] and b[3][4]
assume char is 8 bits and int is 32 bits
a) b) c) d)
There are 20 questions all in technical paper and 36 questions in aptitude test in aptitude that have
given all diagrams and asked to find what comes next thay are quite easy and i hope if u practice r.s
aggarval u can do it easily for technical that have given 1 hr for 20 questions and for not technical that
have given only 40 min and 36 questions,
This is the paper i have right now:
1. main()
{
fork();
fork();
fork();
printf("\n hello");
}
How many times print command is executed?
2. main()
{ int i,*j;
i=5;
j=&i;
printf("\ni= %d",i);
f(j);
printf("\n i= %d",i);
}
void f(int*j)
{ int k=10;
j= &k;
}
output is
a 5 10
b 10 5
c 5 5
d none
3. some question on pipeline like you have to findout the total time by which execution is completed
for a pipeline of 5 stages.
4.
main()
{ int *
s
=
"\0";
if(strcmp(s,NULL)== 0)
printf("\n s is null")p
else
printf("\n s is not null");
}
5. some syntax which returns a pointer to function
6. size of integer is
a. 2 bytes
b 4 bytes
c. machine dependant
d compiler dependent.
7.max and avg. height of sorted binary tree
a. logn n
b n logn
8. some question. like the number was shifted everytime by one and bitwise and with 10000000. one
was supposed to find what the code was doing. I feel the answer was most probably finding decimal
value.
9. int a[5][4]
int is 2 bytes base address for array is 4000(Hexa)
what will be addr for a[3][4]?
int is 4 bytes same question.
10. implementation of priority queue
a. tree
b linked list
c doubly linked list.
Hughes Technical Paper 3
section A 30m (Compulsory)
section B or C 20 m(changed )m
Attempt either B or C sec B contains CST C E&C
Better to attempt Electronics paper (Those who are having electronics background)
Section A
1. Which of the following is not correct
a. (x+y)'=x'.y' b. (x'+y')'=x.y
c. (x'.y')'=x+y d. (x'+y')'=x'.y' [d]
2. Question on logic ckt. U have to find the output ans. AB'+CD'+EF'
3. Output of MUX
_________
c-----| |
c'----| |-------Y
c'----| | ans. A xor B xor C
c-----| |---------
| |
A B (select lines)
4. If X and Y are two sets. |X| and |Y| are corresponding coordinates and exact no.of functions
from X to Y is
97 then
a. |X|=97 |Y|=1 b. |X|=1 |Y|=97
c. |X|=97 |Y|=97 d. .....
5. If two dies are thrown simultaneously what is the prob. of one of the dice getting face 6 ?
a. 11/36 b. 1/3 c. 12/35 d. 1/36 [a]
6. The relation ,<,on reals is a. a partial order because of symmetric and reflexive
b. ... antisymmetric and ....
c. not ...... .. asymmetric and non reflexive
d. ... .... not anti-symm and non reflexive
7. In C language the parameters are passed by a. values b. name c. reference d....
8. Advantage of SRAM over DRAM ans. faster
9. Diasy chaining related question (refer Z80)
a. uniform interrupt priority
b. non .... ....
c. interfacing slower peripherals
d.....
10.RAM chips arranged in 4X6 array and of 8kX4bit capacity each. How many address lines reqd.
to access
each byte
a. 12 b. 16 c.15 d. 17
11.Question related to AVL trees regarding how many no. of nodes to be changed to become
balanced after
addition of a leaf node to a particular node. ans . 3
12.When following sequence is inserted in the binary search tree no.of nodes in left and right
subtrees 52 86 64 20
3 25 14 9 85
13.Method used for Disk searching.. a.l inked list b. AVL c. B-tree d. binary tree
14.Which of the following is correct statement.
a. 1's complement can have two zero re[representation
b. 2's ... ... represent an extra neg. number
c. 2's & 1's have no difference in representing 16-bit no.
d.......
15.AX=B where A is mXn ,b&X are column matrices of order m a. if m<n, X has infinite
solutions
b.if m=n, rank of A <n then X has trivial solutions c.... d....
16.The option available in C++, not C:
a. dynamic scoping
b. declaration in the middle of code block
c. separate compiled and linked units
d. ....
17. int a[4]={1,2,3,4};
int *ptr;
ptr=a;
*(a+3)=*(++ptr)+(*ptr++);
A part of code is shown. The elements in A after the execution of this code.
a.1 2 3 4 b. 1 2 3 6
c. compilation error d.1 2 2 4 [a]
18.Critical section program segment is
a. enclosed by semaphores with P & V operations
b. deadlock avoidance
c. where shared resources are accessed
d. ...
19.when head is moving back and forth, the disk scheduling algorithm is _____
a) scan b) sstf c) fcfs d)....
20.how many times the loop will execute
LOOP LXI B,1526H
DCX B
JNZ LOOP
a) 1526H times b) 31 c) 21 d) 38
21.the addressing mode in which the address of the operand is expressed explicitly within the
instruction
a) index addressing b) absolute c) indirect d) immediate
22.(A - B) U (B - A) U (A ^ C) = ? where A,B are two sets A' , B' are compliments of A and B
a) A U B b) A ^ B c).... d)....
23. The network that does not use virtual circuit
a) IP b) X.25 c).... d)..
24.source routing bridge
a) source will route the frame
b) frame will routed with info in header
c).... d)..
25. cache access time 100 msec. main memory access time 800 msec if the hit ratio is 95% , what
is mean access
time ...
26.The module that should be always reside in main memory is
a) loader b) link module c)... d)....
.... and some questions related to
1. addressing mode 2.assembler passes 3.linking and loading
4. file directory search 5. turning machine
6. finite state machine 7. daisy wheel
27.The order of algorithm to merge the two sorted lists of lengths m and n is
a. O(m) b. O(n) c. O(m+n) d. O(log(m)+log(n))
28.A chocolate block is of 4 X 4 size. How many cuts are needed to make 1 X 1 size blocks. No
simultaneous vert. & horz. cuts.
29.Which among the following is not correct
a. O(n) > O(log n) .. likewise
Section C
1. One question of Set Theory Like there Are two sets A and B and (A-B)union(B-A)union(A
intersection B)is equivalent to Ans. A union B
2. Union and intersection are in there sign conventions.
3. One question of probability Like between 100 and 999 how many no have the prob that they
does not contain 7
Ans. 16/25 (not sure u can check by own)
4. Of Newton Rapson method...
5. Of power set A set contains {(fi),a,{a,b}} what is the powerset of it Ans. 8
6. A question of logic gates Ans. U can got the answer very easily
7. A question on the Booths algo
Ans. The sequence is 1010101010101010
8. Relative addressing mode is used for Ans. Don't know.
9. For how many numbers there is no difference between little endian and big endian
Ans. 256
10.For the multiplication of two 8 bit numbers how much ROM will be used
Ans. 64k*16 ROM(Check it)
11.Why direct mapping is not good for the mapping of Cache Memory.
Ans. Don't know
12.What is the main property of Desiy I/O Sytem Ans.
13.A question on the nyquist theorem
Ans. 18000 bps
14.What is the shannon theorem...
Ans. Refer to data communication(Stalling) book
15.CSMA/CD protocol is used in
Ans. Ethernet
16.What is the limitation of the Pulse Code Modulation
Ans. Refer to data communication book
17.In CSMA/CD
Ans. The Access to the channel is probabilistic.
18.For an IP Router how many IP addresses
Ans. Check it i think Answer is Only One.
19.Which protocol u used when you want to know the IP address corresponding to a MAC Address
Ans. RARP
20.Which part of the IP header is used for the time limit of the packet.
Ans. TTL
21.Which PageReplacement algo will give the best result
Ans. By replacing that page which has the next reference after a long time.(optimal algo)
22.What the code will be said when it is called by another part and it is not completed yet
Ans. Reentrant Code.
23. three questions on the simple programs
24.There is a sequence of no and prepare a binary tree and tell how many nodes are in the left and
right sub tree.
Ans. Check it Ans (4,7)
25.hat is the rank of the graph
Ans. e-n+k
26.One question on the multithreading
27.Which traversal of the tree gives the node in the ascending order.
Ans. Inorder
28.Which traversal of the tree gives the node in the ascending order.
Ans. Inorder
29.What is garbage collector.
Hughes Technical Paper 4
1. a processor has two level cache. Their access time (level1 and level2) is 100ns and 300ns
respect. Memory access time is 1000ns$ ans is 140 (b)
2. disk less server uses
a rarp
b arp
c ftp
d.telnet
Ans rarp
3. which one of them is not a client server
a. e-mail
b. telephone
c. webserver
d.
Ans is e-mail or telephone.
4. Which one is used to represent operations
a. infix
b. postfix
c. binarytree
d.
Ans binary tree
5. One question was on private key and public key. The quest. was
f a wants to send a message to b that no one other that b should $
A private key
A public key
B private key
B public key
6.compliers maintain
Ans is symbol table From Diwaka
7. what a java interface not have ?
Ans - instance variables
8. what is done with java code on a web-page
Ans - downloaded and executed on ur pc
9. what is the order of deleting a node from a linked list given a ptr
to it
Ans O(n) ( since u have to traverse the list to reach the prev.
node)
10. what is RSA
11.how can A send a message to B so that B knows its from A
Ans A uses his private key so that B can use A's public key
12.what is the best sort in worst case
Ans heap sort
13.what can access protected members of a class
Ans other classes of that program
14.what protocol is used by a machine to map an ip to hardware address
Ans arp
15.hat is the size of ipv6
Ans 128 bits
16.how many keys are needed in symmetric and asymmetric crptography?
Ans - i dont know
17.how many keys are needed in symmetric and asymmetric crptography?
Ans - i dont know
18.one on a right threaded tree
19.very easy k-map
Ans i think its b)
20.very easy ckt
ans choice which has option : a&c are equivalent
21.what in unix doesnt have a fd
Ans process ( this was the first ques ).
Other Technical Questions:
Technical Questions
10.Which one is called family tree
11.virtual function and overloading
12.DHCP protocol
13.order of insertion and Heap sort
14.left recursion
15. find output: for(l=1;a<=l;a++)
cout<<++a; cout <<a;
16.DEBUG trigger (oracle)
17.In unrestricted session which system privilege mode is used (oracle)
18.NEXTVAL and CURRENTVAL in sequence (Oracle)
19.Unix system call & & like Var( )
20.OS 384 support which memory management
21. Complexity to access name from the given double link list
22.Which WAN network is suitable for the 100Km or m. distance network
23.If duplicate segments , file are there in hardisk which is best for management
a) FAT
b) SAT
24.stop n wait protocol is associated with which layer
25.find errors from the c and c++ codes.
26.3 qns on operating systems. I qn on dijkestra algorithm
27.Using which pin it's possible to address 16 bit addresses even though there re only 8 address
bits in 8085? Ans: ALE
28.Voltage gain for an amplifier is 100 while it is operating at 10 volts. What is the O/P voltage
wen i/p is 1 volt
29.Quality factor indicates a) Quality of inductor b) quality of capacitor c) both
30.Qns related to bridges, routers and generators, which OSI layer they corresspond to. (Refer to
stevens 4th chapter)
31.OPAmp's I/P ciurrent, O/p current and CMRR is given, what is the voltage gain
32.2-3 qns on scope of static variables in C. Qn to view o/p odf a C static var
33.Qn to print a value of a pointer
34.OPAmp's I/P ciurrent, O/p current and CMRR is given, what is the voltage gain
35.A qn to find the physical address from a given virtual address, virtual to physical address table
was provided
36.6 bit mantissa and 8 bit exponent can present what maximum value?
37.4 bit window size in sliding window protocol, how many acknowledements can be held?
38.Security functionality is provided by which layer of OSI
39.Frequency spectrums for AM, FM and PM (figure given, u'veto tell which Kind of modulation
it belongs to)
40.Among AM and FM which is better and why?
41.LASt stage of TTL NAND gate is called: Ans: Totem Pole Amplifie
42.SR to JK flip flop conversion. Ans: S=JQ', R=KQ
43.LSB of a shift register is connected to its MSB, what is formed: Ans: RING Counter
44.2-3 Qns based on Demorgan's laws (identiies: (A+b)' = A'b', etc)
45.2 qns on Logic gates (O/p of logic gates)
46.Diff in IRET and RET statements of 8086
47.How many address bytes are required to address an array of memory chips (4 * 6), each chip
having 4 memory bits and 8k registers.
48.Diff. in memory mapped and I/P O/P mapped Input/Output (Refer a book on Microprocessor)
49.Qn on pipeline architecture
50.QN on LAPB protocol
Hughes Technical Paper 5
1. Given a digital ckt with nand gates. what is o/p Ans. nor gate
2. Given an logical expr. x,y,z. simplify ans. xz
3. It is recommended to use which type of variables in a recursive module. Ans. static variables.
4. which one of following is not memory management model?given buddy system, monitors,
paging, swapping Ans. monitors
5. What m/c is used to recognize context free grammar ? Ans. pushdown automata
6. Which type of grammar can be recognized by finite state m/c Ans. right linear grammar.
7. proc() {
static i=10;
printf("%d",i);
}
If this proc() is called second time, what is the o/p Ans. 11
8. int arr[] = {1,2,3,4}
int *ptr=arr;
*(arr+3) = *++ptr + *ptr++;
Final contents of arr[] Ans. {1,2,3,4}
9. CSMA/Cd is used in which lan Ans. ethernet
10.8085 pgm : LXI sp, 2021,
LXI b, 1234 (??)
push b
contents of stack after pushing ?
11.One question on synchronous transmission : ans. Timing info is embedded in data itself
12.What for start bit is used in RS232 transmission.
13.One solution for deadlock prevention for dining philosopher's problem
Ans. Allow one person to take first left stick and then right stick and remaining persons in
reverse order.
14.4bit seq no in sliding window protocol with selective repeat.what is the max no. of acks that can
be held at transmitter ans. 8
15.given a height balanced tree. If we add one more node , how
many nodes gets unbalanced ? Ans. 3
16.Given a arbitrary pointer to an element in a singly linked list?
what is the time complexity for its deletion . Ans. O(n)
17.what is the diff b/n c and c++
a. dynamic scoping
b. nested switching
c. declaration of variables in any code block
d. separation of compilation and linking
Ans. c (??)
18.which one is false ?
a. 0<x<y, n power x = O(n power y)
b. root of log(n) = O(log logn)
c. O(logn/100) = O(100 logn)
d. 2n not = O(n power k);
Ans. b or a. (??
19. S->S+S; s->s*s; s->a how many parse trees possible : a+a*a+a Ans. 5
20.4-1 demultiplexer is to be implemented using a memory chip. how many address lines and word
length required Ans. 4, 1
21.Vector intr mechanism. in 8085. Ans. fixed locations in memory when an intr comes.
22.ARP is used for : Ans. IP to MAC addr conversion.
23. given 100 to 999 nos. Probability of picking a no. with out digit 7. Ans. 18/25.
24.Ten film rolls. 3 defective, prob. of picking up 2 defective rolls with out replacement Ans. 6/90
25.Ten film rolls. 3 defective, prob. of picking up 2 defective rolls with out replacement Ans. 6/90
26.Given adjacency matrix for a directed graph with n vertices and e edges. How much time will it
take to find out in degree of a vertex Ans. O(n)
27.No. of nodes of degree 2 in a binary tree with n leaf nodes. Ans. n-1
Technical
1. CSMA/Cd protocol used in Ans : Ethernet
2. Checksum in IP packet is Ans : Sum of the bits and 9's complement of sum
3. Inselective repeat Max Seq is given find window size Ans : (15+1)/2 = 8
4. Main memory cache direct mapping Ans : 64
5. Address lines and data lines for 4K x 16 Ans : Addr 12, Data 16
6. Infix to postsize commission uses Ans : operator stack
7. Printing of static variable Ans : 11
8. Ans : 1,2,3,4 ( Program is given
array[0] = 1;
array[1] = 2;
array[2] = 3
array[3] = 4
ptr = array[0]
*(arr+3) = *(++array ) + *(array-1)++))
There may me some mystique in writing the program. Check it out.
Answer is correct
9. One Question on Scheduling Preemptive
10.Which of the following is not memory model (1) buddy system (2) monitor (3) virtual ... etc.
11.Hight balancing AVC time Ans : 3
12.Virtual to physical address mapping page table given
13. regular expression of identifier L(LUD)*
14.Simplification in boolean Algebra Ans : xz
15. Logical gate is given we have to find what is that Ans : NOR
16.Solution for Diriving philofphing Ans : d
17.The feature C++ have and c donot have Ans : Variables can be declared inside also.
18.Number of nodes with degree two in a binary tree of n leaves Ans : n-1
19.Solution for Diriving philofphing Ans : d
20.The question on RS232 (Use of sfart bit in Rs 232 protocal)
21. Floating point representation Ans : 2's complement
24t.0Bd
^:Bl" & h 0
^
nf
:
b
v:FPZdrt|06X!B*phCJPJ^JaJOJQJ'B*
phCJ 5PJ^JaJ \OJQJV,<@Pd"4LPbp4\(.8<l,.6P`z~\^f0h4
\np!B*phCJPJ^JaJOJQJ^p4LZ^rtDN 6 J t ! !"!!""""@#~###$$2$^$h$$$%l%&&&&(&z&&'''''''(<(b(j(((R)p)))'B*
phCJ 5PJ^JaJ \OJQJ!B*phCJPJ^JaJOJQJV)))**+++B,,,B-D----6.X....h/|////r0000112222
3v33H4Z4\4555556f6666677J778T8V88909~999*:h:j:::::<;>;;<<<@====>>N>>>>>????d@!B*phCJPJ^JaJOJQJ^d@@@nAABBBCCCDDhDDDDDpEEEBFDFF"GtGGPHHIIfIIJJJ&KZK\KKLLnLpLLLLM~MMMMMJNNNNOOlOOO|PPP$Q6Q8QQ\R^RS@SBSSS`TTTTTU
UVUXUUUVVVVVV!B*phCJPJ^JaJOJQJ\VWWWBXDXvXXXXXXXY.YHYbYhYYYYZ$Z@ZFZfZhZZr[[[[[[
\J\L\\\\"]p]r]^^^^^^^4____``z```Na^a`aaaa****ffffrgghhhhpij"j0j2jjjhk*lXlmBmDmmnnn|opdpqqqqvrxr&ssXtvtxtttXuZuuunvpvvvTwVwwwjxxxpyryyyyyzzz{{t|||R}T}~
~"~<~\~`~~~'B*
phCJ 5PJ^JaJ \OJQJ!B*phCJPJ^JaJOJQJV,dJlztvt.LNTVԄ^Zrtv,fNPBD\^
ԌfȎʎ\^rtʏ̏dfXZVX*D^|̓NrtƔȔҕ!B*phCJPJ^JaJOJQJ^ҕԕDFޗ"$~n!B*phCJPJ^JaJOJQJ24t.0Bd}
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
^:Bl}
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
" & h 0
^
}
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
n}
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
f
:
b
v}
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
:FPZdrt|}
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
06X,<@P}
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
Pd"4L}
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
LPbp}
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
4\(.}
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
.8<l}
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
,.6P`z~}
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
\^f0h4
\}
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
\np}
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
4LZ^r}
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
t}
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
DN 6 J t }
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
! !"!!""""@#~###}
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
#$$2$^$`$b$d$f$h$$$%l%&|
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F7$
&F7$
&F7$
&F7$
&F7$
&F7$$d%d&d'd
&F7$
&F$a$7$
&F$a$7$
&F$a$7$&&&&(&z&&'''''''(}
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
(<(b(j(((R)p)))))**}
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
*+++B,,,B-D----6.X.}
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
X....h/|////r00001}
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
112222
3v33H4Z4\455}
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
55556f6666677J77}
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
78T8V88909~999*:h:j::}
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
::::<;>;;<<<@====}
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
=>>N>>>>>????d@@}
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
@@nAABBBCCCDDhDD}
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
DDDDpEEEBFDFF"GtGGPHw
&Fdh$a$7$
&Fdh$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
PHHIfIIJJJ&KZK\KKLL{q
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&Fdh$a$7$
&Fdh$a$7$
&Fdh$a$7$
&Fdh$a$7$
LnLpLLLLM~MMMMMJNN}
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
NNNOOlOOO|PPP$Q6Q8Q}
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
8QQ\R^RS@SBSSS`TTTTT}
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
TU
UVUXUUUVVVVVVV}
&F7$
&F7$$d%d&d'd
&F7$
&F7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
VWWWBXDXvXXXXXXXY
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F7$
&F7$
Y.YHYbYhYYYYZ$Z@ZFZfZhZ}
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
hZZr[[[[[[
\J\L\\\\}
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
\"]p]r]^^^^^^^4___}
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
__``z```Na^a`aaaa****f~q
&Fdh$a$7$
&Fdh$a$7$
&Fdh$a$7$
&Fdh$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
>ffffrgghhhhpij"j0j|r
&F$a$7$
&F$a$7$
&F$a$7$
&Fdh$a$7$
&Fdh$a$7$
&Fdh$a$7$
&Fdh$a$7$
&Fdh$a$7$
&Fdh$a$7$
&Fdh$a$7$
&F$a$7$
&F$a$7$0j2jjjhk*lXlmBmDmmnnvl
&F$a$7$
&F$a$7$
&Fdh$a$7$
&Fdd$a$7$
&Fdd$a$7$
&Fdd$a$7$
&Fdh$a$7$
&Fdd$a$7$
&Fdh$a$7$
&Fdh$a$7$
&Fdh$a$7$
&F$a$7$nn|opdpqqqqvrxr&ssx
&Fdh$a$7$
&Fdh$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&Fdh$a$7$
&Fdh$a$7$
&Fdh$a$7$
&F$a$7$
&F$a$7$sXtvtxtttXuZuuunvpvvv}
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
vTwVwwwjxxxpyryyyyyw
&F7$$d%d&d'd
&F7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
yyyzzz{{t|||R}T}~t
&Fdd$a$7$
&Fdd$a$7$
&Fdd$a$7$
&Fdd$a$7$
&F$a$7$
&F$a$7$
&Fdh$a$7$
&Fdh$a$7$
&Fdh$a$7$
&F7$
&F7$
&F7$
&F7$
~
~"~<~\~`~~~,d}
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
Jlztvt.L}
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
LNTVԄ^}
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
Zrtv,fN}
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
NPBD\^
Ԍ}
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
fȎʎ\^rtʏ̏df}
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
XZVX*D}
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
D^|̓NrtƔȔҕԕD}
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
DFޗ"$}
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$
$~n
&F7$
&F$a$7$
&F$a$7$
&F$a$7$
&F$a$7$"/ =!n"n#n$n3P(20Root Entry FCompObjjOle
1TableSummaryInformation('WordDocument $"DocumentSummaryInformation8*t**