![]() CATEGORIES: BiologyChemistryConstructionCultureEcologyEconomyElectronicsFinanceGeographyHistoryInformaticsLawMathematicsMechanicsMedicineOtherPedagogyPhilosophyPhysicsPolicyPsychologySociologySportTourism |
H I S T O R Y O F M E D I C I N E I N U K R A I N E .
class Main { public static void main( String args[] ) { String mesg = "Answer is "; int sum = 1 + 2; System.out.println( mesg + sum ); } } · Prints mesg + sum · Prints “mesg+sum” · Prints 3 · Prints Answer is 3 · Prints Answer is 1 + 2
String river = new String(“Columbia”); System.out.println(river.length()); What is printed? · 8 · Columbia · 6 · 7 · river
String s; int a; s = "Foolish boy."; a = s.indexOf("fool"); · -1 · random value · 0 · 4 · fool
· A loop that functions infinitely well · A loop that will never function · An incorrect loop · A loop that runs forever · A loop that never starts
· Makes a link · Starts a new line · Finishes text · Prints a backslash followed by a n · Adds 5 spaces
int A[]; int i = 0; A = new int A[4]; while (i < 4) { A[i] = 10; i = i + 1; } What is the value of A[3]? · 10 (if A = new int[4];) · 4 · 0 · 3 · Integer.MAX_VALUE
String a1, a2, a3; a1 = “45”; a2 = ”31”; a3 = a2 + a1; · “4531” · “3145” · 45 · 31 · 76
· 0 · A syntax error as this is syntactically invalid · A run-time error because this is a division by 0 · 12 · 16
x = num / 2; · 2.5 · 5.0 · a compile-time error occurs · 2 · 2.0
if (item > 5) item = item + 5; if (item < 10) item = item + 10; else if (item < 20) item = item + 10; · 15 · 25 · 0 · 5 · 10
switch (x) { case 3 : y = x + 1; case 4 : x = x + 2; y = ++x; case 5 : x = y + 3; y = x++; break; case 6 : x++; y = x; } If x is currently equal to 4, what will the value of y be after the switch statement executes? · 8 · 10 · 6 · 7 · 11
while (x < 100) x = x*2; · 100 · 128 · 2 · 64 · this is an infinite loop
for (int i = 0; i < 3; i++) x = x + i; · 3 · 5 · 0 · 1 · 10
· the do–while loop will continue to loop while condition in the while statement is false and the while loop will continue to loop while the condition in the while statement is true · the while loop will continue to loop while condition in the while statement is false and the do–while loop will continue to loop while the condition in the while statement is true · the while loop will always execute the body of the loop at least once · the do–while loop will always execute the body of the loop at least once · none of the above, there is absolutely no difference between the two types of loops
someInt = 3; for (k = 0; k < 3; k++) someInt = someInt * k; · 5 · 6 · 0 · 2 · 7
(i.e. is rewrite the statement using && instead of ||) ( c!='n' && z+2<=5 ) · !(c=='n' || z+2>5) · !(c=='n' || z+2<5) · !(c!='n' || z+2<=5) · !(c=='n' || z+2>=5) · !(c!='n' || z+2<=5)
Integer i = new Integer(5); Integer j = new Integer(5); if (i==j) System.out.println(“Equal”); else System.out.println(“Not equal”); · The program doesn't compile because == can't be used with references · The program doesn’t execute because i and j are not correctly initialized · Equal · Not equal · Equal Not equal
public void printloop() { int i; for (i=1; i<9; i++) if (i%2 == 0) System.out.print(i + " "); System.out.println(); } · 2 4 6 8 · 9 · 2 4 6 · 8 · 1 3 5 7
public int mystery(int n) { int m = 0; while (n > 0) { m = 10*m + n%10; n = n/10; } return m; } · .123 · .0321 · 0321 · 321 · 0
double height = 5.5; if(height-- >= 5.0) System.out.print("tall "); if(--height >= 4.0) System.out.print("average "); if(height-- >= 3.0) System.out.print("short "); else System.out.print("very short "); · short · tall · very short · average short · tall short
public void loop(int n) { for (int i=0; i<n; i++) { System.out.print(i*(i-1)/2); System.out.print(" "); } System.out.println(); } · 0 3 4 10 12 21 24 36 · 0 0 3 4 10 12 21 24 · 0 0 0 3 4 10 12 21 · 0 1 3 6 10 15 21 28 · 0 0 1 3 6 10 15 21
· partially filled array · one dimensional array · there are no such arrays · multidimensional array · bidirectional array
public int max1(int[] a) { int maxPos = 0; for (int i=1; i<a.length; i++) { if (a[i] > a[maxPos]) { . maxPos = i; } } return maxPos; } public int max2(int[] a) { int max = a[0]; for (int i=0; i<a.length; i++) { if (a[i] > max) { . max = a[i]; } } return max; } public int max3(int[] a) { for (int i=1; i<a.length; i++) { a[i] = Math.max(a[i],a[i-1]); } return a[a.length-1]; } · max1 and max2 only · max2 and max3 only · max1 and max3 only · None of them · All of them
public class MyClass{ public MyClass(){/*code*/} // more code... } To instantiate MyClass, you would write? · MyClass mc = new MyClass(); · MyClass mc = new MyClass; · It can't be done. The constructor of MyClass should be defined as public void MyClass(){/*code*/} · MyClass mc = MyClass(); · MyClass mc = MyClass;
· public void isSpeeding(double speed) · public isSpeeding() · public boolean isSpeeding(speed,SPEED_LIMIT) · public boolean isSpeeding() · public boolean isSpeeding(double speed,double SPEED_LIMIT)
public int foo(int a, String s) { s = "Yellow"; a=a+2; return a; } public void bar() { int a=3; String s = "Blue"; a = foo(a,s); System.out.println("a="+a+" s="+s); } What is printed if method bar() is called? · a=3 s=Yellow · a=5 s=Blue · a=3 s=Blue · a=5 s=Yellow · The code doesn't compile
public class MyClass{ private int value; public void setValue(int i){ /* code */ } // Other methods... } The method setValue assigns the value of i to the instance field value. What could you write for the implementation of setValue? · value == i; · both “value = i;” and “this.value = i;” are correct · value = i; · this.value = i; · All of the answers are correct
· visibility modifiers · methods · classes · instance data · constructor
· public or private, either could be used · import · new · class · public
· uses buttons, menus, and icons · uses buttons, menus, and icons for user and computer interaction · for user and computer interaction · stands for Graphic Use Interaction · all of the above
· Interior Development Environment · Interior Design Environment · Integrated Development Environment · Integrated Design Environment · Infrared Digital Environment
public class Doubler { public void doubleIt(int n) { n = 2*n; } public void doubleIt(int [] n) { n[n.length-1] = 2*n[n.length-1]; } } What happens when the class is compiled, and the following sequence of statements (which is part of a method of another class) is compiled and executed? int x = 20; int [] y = {1, 5, 10}; Doubler d = new Doubler(); d.doubleIt(x); d.doubleIt(y); System.out.println(x + " " + y[y.length-1]); · The values 40 20 will be printed to the terminal window. · The values 20 10 will be printed to the terminal window. · The values 20 2 10 20 will be printed to the terminal window. · The values 40 10 will be printed to the terminal window. · The values 20 20 will be printed to the terminal window.
Rectangle r1 = new Rectangle(); r1.setColor(Color.blue); Rectangle r2 = r1; r2.setColor(Color.red); After the above piece of code is executed, what are the colors of r1and r2 (in this order)? · Color.blue and Color.red · Color.red and Color.blue · Color.blue and Color.blue · Color.red and Color.red · Not enough information
· 25 · 17 · 30 · 14 · 10
· long · double · int · real · string
· An entity that receives inputs and outputs · An output · A way of storing values · A sequence of characters enclosed by quotes · A kind of computer
· 20 · 24 · 32 · 64 · 6
· 2.0 · 2.5 · 0.25 · 0 · 2
· int · char · String · boolean · double
-4 + 1/2 + 2*-3 + 5.0 · int; -4 · double; -5.0 · int; -5 · double; -4.5 · not correct expression
· (int)(Math.random()*6)+1 · (int)(Math.random()+6) · (int)(Math.random()*6) · Math.random()*6 · ((int)Math.random())*6+1
int x = 73/5%3; · 2 · 36 · 0 · 1 · 35
public int fib(int n) { int[] a = new int[n]; a[0] = 1; a[1] = 1; for (int i=2; i<n; i++) { a[i] = a[i-1] + a[i-2]; } return a[n-1]; } · 13 · 21 · 6 · 8 · 55
· (a && !b) && (!a && b) · (a || b) && (!a || !b) · (a || b) || (!a || !b) · a || b · a && b
boolean a = true; boolean b = false; boolean c = (a || b) && !(a && b); boolean d = c || (a && b || !(a && b || (a && !b))); · false, true · false, false · true, 0 · true, true · true, false
int x = 4; int y = (int)Math.ceil(x % 5 + x / 5.0); · 4 · 3 · 1 · 6 · 5
int r = (int)(Math.floor(Math.random() * 8)) + 2; · 2 <= r <= 9 · 3 <= r <= 8 · 3 <= r <= 10 · 3 <= r <= 9 · 2 <= r <= 10
· Ability to store objects of Subclass in references of Superclass. · Technique to execute method with object’s implementation instead of reference’s. · Ability to change form of appearance. · The way to define relative and absolute position in object pool. · Ability to change form of appearance and the way to define relative and absolute position in object pool.
· Ability to connect to multiple programs and download great amount of data at same time. · Very powerful technology of programming to create programs that run fast. · Very thick string with multiple tiny threads. · Ability to execute multiple code segments simultaneously. · None of above.
· Ability to inherit multiple interfaces to provide powerful functionality of objects. · Using GUI to interact with user when some input data is needed. · Using private fields to protect data and supplying safe methods to manipulate them · Creating capsules to store data. · Separate data to small fragments, so that they easily accessed from memory.
· 1,2,2,3 · 2,3,2,2 · 1,2,3,2 · 1,3,2,2 · 1,1,1,1
· n2 · n * (n-1) / 2 · n * log(n) · n * (n+1) / 2 · n - 1
· 25 · 4 · 8 · 12 · 6
· non-regular graph · regular graph · single graph · complete graph · multi graph
· 2 · 1 · log n · n - 1 · n / 2
· n2 · n-1 · n · n+1 · none of these
· 3 · 2 · 1 · n – 2*[n/2] + 2 · n / 2
· sub graphs isomorpic to k5 or k(3,3) · sub graphs isomorpic to k3 or k(3,3) · sub graphs homomorpic to k3 or k(3,3) · a sub graph homomorpic to k3 or k(3,3) · any of these
· degree · path · walk · trial · euler
· false · true · false but not for all cases · true but not for all cases · true for some cases and false for the rest cases
· 68 · 86 · 48 · 64 · none of the above
· (3, 2, 3, 2, 2) · (1, 2, 3, 2, 3) · (2, 2, 3, 3, 4) · (0, 1, 1, 2, 0) · (0, 0, 1, 1, 2)
· 1, 7, 3, 4, 2, 5, 6 · 3, 7, 1, 4, 2, 5, 6 · 2, 3, 4, 5, 6, 7 · 3, 7, 4, 1, 5, 2, 6 · 1, 7, 4, 3, 5, 2, 6
· Quick sort · Bubble sort · Merge sort · Insertion sort · All of the above
· Merge sort · Selection sort · Insertion sort · Quick sort · All above have the same time
· Quick sort · Insertion sort · Bubble sort · Heap sort · All of the above
· O( N log N) · O( N ^ 2 ) · O( 1 ) · O( log N ) · O( N )
· O( N ) · O( N log N) · O( 1 ) · O( log N ) · O( N ^ 2 )
· It is a comparison-based sorting algorithm · Its average case performance is O( N log N ) · It has a better worst-case runtime than that of Quick sort · It is a stable sort · It is an in-place algorithm
· 2, 3, 10, 12, 63, 70, 114 · 2, 3, 114, 10, 63, 70, 12 · 10, 70, 2, 12, 3, 63, 114 · 2, 3, 10, 12, 114, 63, 70 · 3, 2, 70, 10, 63, 12, 114
· Middle element · Median of the first, middle, and last elements · Random element · The minimum element in the partition (this causes worst-case behavior on already sorted arrays, which is a rather common use-case) · All choices are good
· Bubble sort · Selection sort · Shell sort · Merge sort · Insertion sort
I – Bubble sort II – Selection sort III – Quick sort IV – Merge sort V – Heap sort · III and IV (merge sort can be either recursive or non-recursive) · III, IV, V · I and II · III only · All of the above
· Recursion works very fast. · Call to same function too many times, results to stack overflow. · There are no disadvantages, it is cool feature. · Recurrent functions such as Fibonacci are hardly implemented. · Recursion is function that calls itself.
· Recursion has cached variables for each call instance, so it can be used like stack. · Recursion works very fast. · Recurrent functions are easily implemented and have cached variables, so they can be used like stack · Recursion is function that calls itself. · Recurrent functions such as Fibonacci is easily implemented.
· Stack of variables are stored in recursion. · Recursion is some type of cycle. · Recursive function is something because of which computers works slowly. · Recursion is solution of Fibonacci series. · Recursion is function that calls itself.
· 155 · 125 · 625 · 243 · None of above
· Create recursion with argument x that will output x, and call itself with x+1 argument, and stops when x reaches 6. · In one cycle count from 1 till 6 and output 6 times counter value. · Count till 6^10 and output each value. · Create 6 nested cycles which counts from 0 to 9 inclusive, and output six counters in a row. · None of these
· 1024 · 0 · 512 · 2048 · 10
· They work too long. · We can calculate number of operations needed to check all combinations. · There are no disadvantages. · They work very fast. · None of these
· To solve a given problem, we need to solve subproblems, then combine the solutions of the subproblems to reach an overall solution. · To solve problem by using dynamic allocation data structures. · Dynamic algorithms uses less memory that other algorithms. · Using graphs in process of solution, presenting data as list of vertexes connected by edges, represented as relation of each data unit to each other. · Creating two dimensional arrays to store data.
· Check all possible routes from top to bottom and select maximum result. · Sum all numbers and divide by number of levels in tree. · Take three maximum values and sum them. · At each node store maximum possible amount of bananas collected by the route to reach this node · Each step select largest amount and move there.
· HeapSort algorithm · Dejkstra’s algorithm · Recursive algorithms · Dynamic programming algorithms · None of them.
· Linked lists allow insertion and removal of nodes at any point in the list and arrays don’t. · Difference depends on the application. · There is no difference. · Arrays allow insertion and removal of nodes at any point in the list and linked list don’t. · All of these are differences
· sentinel list · null list · zero list · empty list · a sentinel list
· linked list · string · array · dynamic array · sentinel list
· depth-order · depth-first order · breadth-first order · none of above · all of the above
· three · four · five · one · two
· using the number of its vertices it has · using the number of its edges it has · using the number of its nodes it has · none of above · all of the above
· (log n) · (log 2n) · O(n) · O(log n) · O(2 log n)
· binary sort · linear sort · quick sort · bubble sort · all of the above is correct
· indexing · none of these · stacking · sorting · hashing
· pop( ) · lspop( ) · delete( ) · push( ) · remove( )
· LILO · FILO · FIFO · None of above · All of the above
· LILO · FILO · FIFO · None of above · All of the above
· O(2n) · O(log 2n) · (log 2n) · O(n) · O(log n)
· Graphs · None of these · Arrays · Binary trees · Stacks
· Heaps · Hash tables · None of these · Skip list · All of the above is correct
· Root · Leaf · First node of right sub tree · Null · First node of left sub tree
· 10 · 2 · 7 · 3 · none of the above
H I S T O R Y O F M E D I C I N E I N U K R A I N E .
PRE-TEXT ASSINGMENT:
Exercise 1. Practice the pronunciation:
Church [ t∫ə:t∫ ], attach [ ə'tæt∫ ], aid [ eid ], inadequate [ in'ædikwit ], succeed [ sək'si:d ], science [ 'saiəns ], valuable [ 'væljuəbl ], create [ kri:'eit ], concern [ kən'sə:n ], initiative [ i'ni∫iətiv' ], tissue [ 'tisju:, 'ti∫u ], doctrine [ 'doktrin].
Exercise 2.Topic vocabulary:
Exercise 3. Give the Infinitive of the following verbs:
did, got, became, meant, knew, told, was, had, went, made, took, were, came, began, gave, found, told, taught, stood, spoke, led.
Exercise 4. Form new words and translate them.
the nouns by adding the suffix –er: to examine, to lead, to teach, to organize, to help, to write; the verbs by adding the prefix re-: to join, to operate, to group, to make, to build, to form, to move.
Exercise 5. Translate into Russian. Pay attention to Passive Voice. 1. In the first term students are taught basic theoretical subjects. 2. The name of great surgeon Pirogov is known not only in our country. 3. The tissues, blood vessels and nerves were studied by many scientists. 4. The student was asked on the structure of the bones. 5. The changed condition of the patient was seen by the doctor. 6. The administrations were changed to restore the patient’s health rapidly. 7. We will be delivered a lecture in Anatomy next Monday. 8. Sedatives are taken by the patient. 9. The great surgeons were often referred to in scientific papers. 10. Donors are given light breakfast before blood taking.
Exercise 6. Change from Active Voice into Passive.
The nurse sponges the patient’s skin. 2. A poisonous remedy causes death. 3. This drug causes skin irritation. 4. The doctor administered laxatives. 5. The X-ray examination revealed lung trouble. 6. The doctor checked up my kidneys. 7. He handed the prescription for cough mixture. 8. The surgeon rinses his hands before the operation. 9. The students will study Pharmacology in two years. 10. Prof. Smirnov will deliver a lecture in Histology tomorrow.
Exercise 7. Translate into English.
Exercise 8. Read and translate the text:
HISTORY OF MEDICINE IN UKRAINE The history of medicine in Ukraine begins with the history of folk medicine. The first medical hospitals in Kyiv Rus were founded in the 11 th century and were mostly in the form of alms houses attached to churches. In the 14th and 15th centuries new hospitals were built and many physicians gave the first aid to the inhabitants of Ukraine and the soldiers of Bogdan Khmelnytsky's troops. As the number of physicians was inadequate some medical schools which trained specialists were opened. The first higher educational establishment was Kyiv-Mogylyansk Academy which was founded in 1632. It played a prominent role in the development of the Ukrainian medicine. Many graduates of the Academy continued to enrich their knowledge abroad and received their doctors' degrees there. Many former students of this Academy have become the well-known scientists. They are the epidemiologist D. S. Samoilovych, the obstetrician N, M. Ambodyk-Maximovych, the pediatrician S. F. Chotovytsky, the anatomist 0. M. Shumlyansky and many others. At the end of the I8th and during the 19th centuries the medical departments were formed at the Universities of Kharkiv, Kyiv, Lviv and Odesa. Since then the total number of physicians has increased in Ukraine. During the Crimean War (1854-1856), on own Pirogov's initiative the first detachment of nurses was trained and sent to Sevastopol to help its defenders. It gave the beginning of the organization "Red Cross". In 1886 the first bacteriological station was organized in Odesa. It was of great importance in the development of microbiology and epidemiology. The great scientists I. I. Mechnikov and M. F. Gamaliya worked at this station and succeeded much in their investigations. I.I.Mechnikov (1845 – 1916) is a world famous biologist, bacteriologist, immunologist and pathologist. He is one of the founders of evolutionary embriology and microbiology.He created the phagocyte theory of immunity for which he got Nobel prize in 1908.Despite of favorable conditions for the successful development of natural sciences in Russia many outstanding scientists worked in Ukraine. It is known that the brilliant scientist M. I. Pirogov and his followers, such as V. O. Karavayev, O. F. Shimanovsky, M. V. Sklifosovsky and others made valuable contribution to the Ukrainian medicine. The first president of Medical Academy in Ukraine was Daniil Kyrylovych Zabolotny (1866-1929), a prominent Ukrainian epidemiologist and microbiologist. He was the first in the world to create the department of epidemiology and was the first rector of Odesa Medical Academy (1920). Scientific interests of Zabolotny concerned different problems of epidemiology. His follower academician O.Bogomolets (1881 – 1946) was the founder of the Institute of Experimental Biology and Physiology of Ukrainian Academy of Sciences. He created a doctrine about physiological system of connective tissue and paid great attention to gerontology.The famous scientists V. P. Obraztsov and M. D. Strazhesko were founders of Kyiv therapeutic school. They made a huge progress in the field of cardiology. A great deal was done in the treatment of many eye diseases by the prominent scientist, ophthalmologist academician V. P. Filatov (1875 – 1956) who founded the Institute of Eye diseases in Odesa. . Many other outstanding scientists whose names are well known in the world worked in Ukraine. Date: 2015-01-02; view: 1396
|