Computer Architecture

1. P1 - 1a,1c
2. VM(language) - 2a
3. Arithmetic - 3b
4. Moore - 4a,4b,4c
5. Data path-buses 5c
6.register hold address 6b
7. microinstructions-7b
8. microporgraming-8a,8b,8c
9. registers -9a,9b
10. fetch decode-10c
11. superscalar parallel-11a
12. 12b,12c
13. RAID-13b,13c
14. demultiplexer-14b
15. program log array-15c
16. 16c
17. JVM-17a
18. cache memories-18a,18b
19. 19b
20. 20b
21. RISC register win.-21a
22. 22a,22c,22d,22e
23.address RISC-23b
24. 24a,24c
25. segmentation-25a,25c
26. preemptive-26a
27. 11101110-27a
28. 0.625-28a
29. EAB58B:A82-29d
30. interpretation-30b
Operating Systems
1. OS-1a,1b,1c
2. 2a,2b,2c
3. 3a,3b,3c
4. 4a,4b,4c
5. microkernel-5a
6.spooling- 6a,6b,6c
7. threads-7a,7b,7c
8.process managem-8a,8b
9. 9a,9b
10. 10c,10d
11. 11a,11b,11c,11d
12. 12a,12b,12c
13. 13a,13b,13c
14. 14a,14b
15. 15a,15b,15c,15d
16. 16a,16b
17. 17a,17b,17c
18. deadlock18a,18b,18c,18d
19. 19a,19b
20. 20a,20b
21. 21a,21c
22. 22a,22b
23. 23a,23b
24. 24a,24b
25. 25a,25b,25c
26. 26a,26b,26c
27. Max(..25,30)27a,27d,27e
28. Max)..27,24)28a,28c,28f
29. 29a,29b,29c
30. 30a,30b,30c
Databases
1. DBMS-1a,1c
2. design-2a,2b,2c,2d,2e
3.3lvl architecture-3c,3d,3e
4. stoge details-4d
5. items relation-5a,5b,5c
6. candidate key-6a,6b
7. alg operat.-7a,7b,7c,7d,7e
8. join operat-8a,8b,8c,8d,8e
9. composite key-9c
10. cardinality-10a,10b,10c
11. funct dependency-11b
12. 3NF-12a
13. conceptual lvl relation13a
14.intern lvl-14a,14b,14c,14d
15. Data model-15a,15b,15c
16.DBMS auth-16c
17. Sys catalog-17a
18. Tuple-18d
19. Relation schema-19a
20. Superkey-20a
21. Primary key-21b,21c
22. Primary key not null-22c
23.Views- 23a,23b,23b
24. entity type-24a
25. enitity rel model25a,25b,25c
26. Chasm-26a
27. normaliz27a,27b,27c,27d
28. 28a,28b,28c,28d,28e
29. FROM-29c
30. Aggregate30a,30b,30c,30e

Computer Networks
1. Protocol-a
2. Ring-2b
3. Disadv ring-3a,3b
4. Star network-4a,4d
5. Checksum-5d
6. Connectionless-6a
7. Packet-7c
8. Presentation-8b
9. data,seg,packet,frame.b9c
10. flow control, sequenc-10c
11. Transport-11d
12. Checksum field-12c
13. TCP-13b,13d
14. RARP-14c
15. coaxial-15d
16. 255.255.255.255-16d
17. loopback-17a
18. repeater,hub1-18b,18e
19. bridge,switch2-19a,19d
20. router3-20c
21. half duplex-21a,21d
22. ARP-22b
23. Segmenting-23a,23e
24. Layer 2 switch-24a,24d
25. 2 sef router-25b
26. fiber cabling-26a,26c
27. TCP-27c
28. checksum-28a
29.255.255.255.128-29b
30.CIDR no 32 last-30b,30d
Algorithms
1. any nat power of 2-1c
2. h larger or equal 1-2d
3. Large digit a in base q-3d
4. b[0..n];b[i]=0-4c,4d
5. 5a
6. any nonzero nat value-6c
7. All nat divis prime no-7c
8. n DIV 2-8b
9. x[k1]<=x[k2]-9a,9d
10.Neg elem before pos-10d
11. a[1..n,1..n]-11b,11e
12. n(n + 1)/2-2d
13. aux:=x[i],O(n)-13b
14. s:=1,d:=n,r:=014c,14d,14e
15. i:=i+k+1,O(n)-15b
16. imax,jmax-16b,16c
17. alg1,alg2,alg3-17a,17d
18. i:=2*i,O(lg n)-18c
19. m:=2*m, O(2n)-19d
20.fact1=fact2-20c
21. binary most signif-21b
22.n MOD 2+alg(n DIV 2)-b,c
23. reverse x[1..n]-23b
24. x[j]>aux-24b,24d
25. alg(x[1..n],v)-25a,25b,25d
26. decrease,quad-26b,26e
27. p*p*x-27d,27f
28. a*b for any a-28d
29. alg(n DIV 10)+n MOD
10- 29b,29d,29f
30. O(n!)-30b
Logic for Computer Science
1. finish *0,+1-1c,1d
2. Exista, oricare ar fi-2a,2c
3. inductive domain-3a,3c,3d
4. wffs propositional-4a,4b
5. [P,notQ]-5b,5c
6.satisf- 6a,6c
7. 7a,7b,7c
8. P<->Q-8b
9. disj-9a,9b,9c,9d
10. disj p->10c,10d
11. [P;:P;R;S]-11b
12. F1Fn-12c,12d
13. | NAND-3a,13c,13d
14. reasoning-14b,14c,14d
15. ternary boolean-5b
16. 16a
17. satisfiable-17b
18. Davis Putnam-8b,18c
19. splitting rule-19c
20. Disjunct A or B-20a
Data Structures
1. elementary data-1b
2. component d.s-2b, 2c, 2e
3. basic operat-3a,3c,3d,3e
4. void initializare-4b
5. l.last=-1-5c
6. simply linked lin list-6a,6c
7. input key, info-7b,7d
8. avoid dereferecing-8b

9. 6-9d
10. 1-10b
11. r->next=q-11d
12. p->next->next->info-12a
13. common elements-3c
14. p=NULL-14c
15. s=p-15a
16. void func(void)-16a
17. circular s linked-17b, 17e
18. remove node r-18a
19. nod *ant-19c,19d
20. succ-20a, 20b, 20c
21.s,s,pred,r-21b
22. p=p->next-22a
23. LIFO-23b, 23d
24. (*s).top=(*s).top-1-24c
25. FIFA-25c, 25d
26.QUEUE-26b, 26d
27. typical op link list27d, 27e
28.empty(c)-28b
29.queue using array-29a
30. *left,*right-30b, 30c
Graph Theory
1. 100 _ 99 _ 98-1b
2. 6!-2d
3. 83160-3a
4. prime1-100-4c
5. socks-5b
6. 840-6a
7. 6 elements-7c
8. (1+3n-2n^2)-8d
9. n+16-9c
10. a1=2,a2=3-10a
11. max flow in G-11d
12. T4-12d
13. 7; 5; 2; 2; 5-13a
14. 229-14a
15. spanning trees-15b
16. G1-16a
17. C2-17b
18. perfect matchin-18a
19. distinct rep-19c
20.people- 20a
21. G graph n nodes-21c
Formal Languages and
Automata Theory
1. 0S0,1S1,2S2-1b,1d
2. aSb,ab-2d
3. bSb, bAb-3b,3d
4. aSb, aAb-4a,4d
5. abc,aAbc, Bbcc-5d
6. aS,bS,cS-6d
7. ion ana-7a
8. aS,bS,a-8b,8c
9. aS,bS,cS,abbaX-9a,9d
10. UDMR-10a,10b,10c,10d
11. context indep type2-11b
12. aAbc,type0-12d
13. aSb, type 2&0-13b,13d
14. aS|bsY-14a,14b,14d
15. string 0&1-15a,15c,15d
16. string 0&1 at lst1-16b,16d
17. string 0&1 at lst1sym-17d
18. ana,ani,ina,ini-18a,18b
19. regular express-19a,19c
20. (a|i)n(a|i)-20a
21. (0|1)(0|1) 21a,21b
22. 01|1-22d
23. (11)*1 23c,23d
24. 1|0)*0(0|1-24b,24d
C Language
1. !b||(a&&b)-1b
2. c=getchar!=EOF-2d
3. square(a)-3a,3c,3d
4. addition pointers-4a
5. none-5d
6. pi-scanf,pc-strcpy--6a,6b
7. p1,p2-7b,7c
8. built-in,scalar-8c, 8d
9. sharing data-9c, 9d, 9e
10. static,auto-10a,10b
11. different-11a
12. eventually,global var12c
13. precedence of op-13a
14. is 1-14a
15. n=10,m=4-15b, 15c
16. x=2.5-16b, 16c
17. rep address-17a
18. infinite cycle-18c
19. illegal op-19b,19c
20. 0X30,48-20c, 20d
21.0X0,0- 21b, 21c, 21e

22. structure member-22b

23. predef-23a, 23c, 23d, 23f
24. real operand-24c, 24d
25. pointer structure-25a
26.0, of type char-26c, 26d
27. (a<='a') | ('z'<= a)-27c
28. (a < 'a') && ('z' < a)-28a
29. space struct-29b
30. 19-30a
C++ Language
1. constructor-1a,1c,1e,1g
2. features C+-2a,2c,2d,2e,2f
3. overloading-3b,3c,3f,3g
4. remarks true-4a,4b,4d,4e
5. remarks false-5a,5c,5d,5e
6. valid code lines-6a,6c
7. Person class-7e
8. class X contain-8d,8e,8g
9. + op overloading-9a,9d,9e
10. app dev-10b,10c,10e,10f
11. order des constr-11c
12. 100 200 300-12b,12e,12g
13. correct termplate C+-13d
14. not compile-14c
15. mem dealoc multiple-15b
16. B::B,A::A..-16c
17. Employee(s,d) []-17a
18. 5-18e
19. A *p =new B-19d
20.non-static member- 20b
21. Foo::counter-21d
22. f2 init-22c
23. LSP-23c
24. 205 200-24a
25. Employee class-25b
26. Exceptions-26c,26e
27. OCP principle-27d
28. template X-28b,28d,28e
29. virtual class diamond-29a
30. polymorfism-30b,30c
Java Language
1. Class A wont compile-1d
2. interface I1, I2-2a,2d
3. interface, C1-3a,3b,3d,3e
4. encapsulation-4b
5. false Java-5a,5b,5c,5d
6. visibility m1-6c
7. m1 method-7b,7d
8. computeSum-8b,8c,8e
9. depends compiler-9c
10.immutable cls A-10a,10e
11. ConcurrentModif-11c
12. equals not corr-12b,12e
13. Java true-13a,13c,13e
14. Java True-14a,14c,14d
15. Assertions-15b,15c
16. x.i,y.i=3,16d
17. wrong declar-17b,17d
18. compilation fail-18a
19. try/catch block-19b
20. method signature-20d
21.constr- 21a,21b,21c,21d
22. exception 4-22d
23. no modifier spec-23a
24.false JV- 24a,24b,24c,24d
25. s1,s2 = 2013year-25d
26.Java Thread- 26a,26c
27. String class Java-27a,27c
28. Java abstract cls-28a,28c
29. 2 public classes file-29c
30. new Thread(a).start()-30d
Software Engineering
1. Use case-1a,1b
2. medical analysis-2a,2c,2g
3. client-server-3c
4. Software Verif-4a,4d,4e
5. CASE categ5b,5c,5e,5f,5h
6. state mach diagram-6b,6c
7. code debugging-7b,7c,7e
8. Agile methods-8a,8b,8d
9. load steadily increased-9a
10. collection of abstract-10d
11. mainten-11b,11d,11e,11i
12. COTS integrat-12a,12d
13. Version manage-13c,b
14. system reliabiliity-14c,14f
15. Student-15b,15c,15d,15f
16. private materie preda-16b
17. prof,test,curs17a,17d,17e
18. new vector-18c
19. unidirectand curs-19d
20. 20a,20c,20d,20e,20f
21. getCursuri()-21a,21c
22. instantiat22a,22b,22e,22f
23. boundary ob-23a,23d,23g
24. robust-24a,24c,24d,24e

25. testare state-25a,25c,25h

26. revista-26b,26e,26g,26i
27. void Calculplata();-27b
28. Angajat-28a,28b,28e
29. rezervare-29c,29d,29e
30. student,proiect-30c,30e