Shift-Reduce parsers perform the following : (A) Shift step that advances in the input stream by K(K>1) symbols and Reduce step that applies a completed grammar rule to some recent parse trees, joining them together as one tree with a new root symbol. (B) Shift step that advances in the input stream by one symbol and Reduce step that applies a completed grammar rule to some recent parse trees, joining them together as one tree with a new root symbol. (C) Shift step that advances in the input stream by K(K = 2) symbols and Reduce step that applies a completed grammar rule to form a single tree. (D) Shift step that does not advance in the input stream and Reduce step that applies a completed grammar rule to form a single tree.

Shift-Reduce parsers perform the following : (A) Shift step that advances in the input stream by K(K>1) symbols and Reduce step that applies a completed grammar rule to some recent parse trees, joining them together as one tree with a new root symbol. (B) Shift step that advances in the input stream by one symbol and Reduce step that applies a completed grammar rule to some recent parse trees, joining them together as one tree with a new root symbol. (C) Shift step that advances in the input stream by K(K = 2) symbols and Reduce step that applies a completed grammar rule to form a single tree. (D) Shift step that does not advance in the input stream and Reduce step that applies a completed grammar rule to form a single tree.
by

1 Answer

Answer :

(B) Shift step that advances in the input stream by one symbol and Reduce step that applies a completed grammar rule to some recent parse trees, joining them together as one tree with a new root symbol.
by

Related questions

Given the following statements : S1 : SLR uses follow information to guide reductions. In case of LR and LALR parsers, the look-aheads are associated with the items and they make use of the left context available to the parser. S2 : LR grammar is a larger sub-class of context free grammar as compared to that SLR and LALR grammars. Which of the following is true ? (A) S1 is not correct and S2 is not correct. (B) S1 is not correct and S2 is correct. (C) S1 is correct and S2 is not correct. (D) S1 is correct and S2 is correct.

Description : Given the following statements : S1 : SLR uses follow information to guide reductions. In case of LR and LALR parsers, the look-aheads are associated with the items and they make use of the left context available to ... (C) S1 is correct and S2 is not correct. (D) S1 is correct and S2 is correct.

Last Answer : (D) S1 is correct and S2 is correct.

Which of the following is true ? (A) Canonical LR parser is LR (1) parser with single look ahead terminal (B) All LR(K) parsers with K > 1 can be transformed into LR(1) parsers. (C) Both (A) and (B) (D) None of the above

Description : Which of the following is true ? (A) Canonical LR parser is LR (1) parser with single look ahead terminal (B) All LR(K) parsers with K > 1 can be transformed into LR(1) parsers. (C) Both (A) and (B) (D) None of the above

Last Answer : (C) Both (A) and (B)

If all the production rules have single non - terminal symbol on the left side, the grammar defined is : (A) context free grammar (B) context sensitive grammar (C) unrestricted grammar (D) phrase grammar

Description : If all the production rules have single non - terminal symbol on the left side, the grammar defined is : (A) context free grammar (B) context sensitive grammar (C) unrestricted grammar (D) phrase grammar

Last Answer : (A) context free grammar

Given the symbols A, B, C, D, E, F, G and H with the probabilities 1/30, 1/30, 1/30, 2/30, 3/30, 5/30, 5/30 and 12/30 respectively. The average Huffman code size in bits per symbol is: (A) 67/30 (B) 70/34 (C) 76/30 (D) 78/30

Description : Given the symbols A, B, C, D, E, F, G and H with the probabilities 1/30, 1/30, 1/30, 2/30, 3/30, 5/30, 5/30 and 12/30 respectively. The average Huffman code size in bits per symbol is: (A) 67/30 (B) 70/34 (C) 76/30 (D) 78/30

Last Answer : (C) 76/30

Consider a source with symbols A, B, C, D with probabilities 1/2, 1/4, 1/8, 1/8 respectively. What is the average number of bits per symbol for the Huffman code generated from above information? (A) 2 bits per symbol (B) 1.75 bits per symbol (C) 1.50 bits per symbol (D) 1.25 bits per symbol

Description : Consider a source with symbols A, B, C, D with probabilities 1/2, 1/4, 1/8, 1/8 respectively. What is the average number of bits per symbol for the Huffman code generated from above information? (A) 2 bits per symbol (B) 1.75 bits per symbol (C) 1.50 bits per symbol (D) 1.25 bits per symbol

Last Answer : (B) 1.75 bits per symbol

Which of the following is FALSE ? (A) The grammar S ⟶ aSb|bSa|SS|∈, where S is the only non-terminal symbol and ∈ is the null string, is ambiguous. (B) SLR is powerful than LALR. (C) An LL(1) parser is a top-down parser. (D) YACC tool is an LALR(1) parser generator.

Description : Which of the following is FALSE ? (A) The grammar S ⟶ aSb|bSa|SS|∈, where S is the only non-terminal symbol and ∈ is the null string, is ambiguous. (B) SLR is powerful than LALR. (C) An LL(1) parser is a top-down parser. (D) YACC tool is an LALR(1) parser generator.

Last Answer : (B) SLR is powerful than LALR.

GHCi Error : parse error on input `=' in Haskell -Web-Development

Description : GHCi Error : parse error on input `=' in Haskell -Web-Development

Last Answer : answer:

The language of all non-null strings of a’s can be defined by a context free grammar as follow : S→a S|S a| a The word a3 can be generated by ................ different trees. (A) Two (B) Three (C) Four (D) Five

Description : The language of all non-null strings of a’s can be defined by a context free grammar as follow : S→a S|S a| a The word a3 can be generated by ................ different trees. (A) Two (B) Three (C) Four (D) Five

Last Answer : (C) Four Explanation:

................ is used in game trees to reduce the number of branches of the search tree to be traversed without affecting the solution. (A) Best first search (B) Goal stack planning (C) Alpha-beta pruning procedure (D) Min-max search

Description : ................ is used in game trees to reduce the number of branches of the search tree to be traversed without affecting the solution. (A) Best first search (B) Goal stack planning (C) Alpha-beta pruning procedure (D) Min-max search

Last Answer : (C) Alpha-beta pruning procedure

Tom volunteered to be the chief organizer for the world's tether ball championships. There were 657 contestants from around the world. The tournament was set up whereby the winner would advance and the loser would be eliminated. Since there was an odd number of participants, the initial pairing leaves one player out. That player gets a bye and automatically advances to the next round. How many matches will Tom have to schedule to determine the tether ball champion? -Riddles

Description : Tom volunteered to be the chief organizer for the world's tether ball championships. There were 657 contestants from around the world. The tournament was set up whereby the winner would advance and ... round. How many matches will Tom have to schedule to determine the tether ball champion? -Riddles

Last Answer : 656 matches will be needed.

Mobilization advance up to 10% of the cost of work is given to a contractor (A) On commencement of work at site for payment of loan taken by him (B) For the purchase of construction materials (C) For the payment of advances to labour and other staff (D) For all activities required to start the work at site on finalization of the contract document

Description : Mobilization advance up to 10% of the cost of work is given to a contractor (A) On commencement of work at site for payment of loan taken by him (B) For the purchase of construction ... staff (D) For all activities required to start the work at site on finalization of the contract document

Last Answer : (D) For all activities required to start the work at site on finalization of the contract document

Consider a discrete memoryless channel and assume that H(x) is the amount of information per symbol at the input of the channel; H(y) is the amount of information per symbol at the output of the channel; H(x|y) is the amount of uncertainty remaining on x knowing y; and I(x;y) is the information transmission. Which of the following does not define the channel capacity of a discrete memoryless channel?

Description : Consider a discrete memoryless channel and assume that H(x) is the amount of information per symbol at the input of the channel; H(y) is the amount of information per symbol at the output of the channel; H(x|y) is the amount of uncertainty ... (H(x) - H(x|y))]  p(x) (D) max H(x|y)  p(x)

Last Answer : (D) max H(x|y)   p(x)

What recent medical advances will make the biggest impact when mainstreamed?

Description : What recent medical advances will make the biggest impact when mainstreamed?

Last Answer : I think its going to be Stem Cell Research!

What is the purpose of Ctrl + I shortcut key in MS - Word: a) It converts selected text into the next larger size of the same font. b) It applies the Italic formatting to the selected text. c) It makes the selected text bold d) It adds a line break to the document. e) None of The Above

Description : What is the purpose of Ctrl + I shortcut key in MS - Word: a) It converts selected text into the next larger size of the same font. b) It applies the Italic formatting to the selected text. c) It makes the selected text bold d) It adds a line break to the document. e) None of The Above

Last Answer : b) It applies the Italic formatting to the selected text.

The first calculator that can perform all four arithmetic operations(Addition, Subtraction, Multiplication, Division) was known as______ (A) Pascaline (B) Slide Rule (C) Step Reckoner (D) None of the Above

Description : The first calculator that can perform all four arithmetic operations(Addition, Subtraction, Multiplication, Division) was known as______ (A) Pascaline (B) Slide Rule (C) Step Reckoner (D) None of the Above

Last Answer : (C) Step Reckoner

How did the Egyptian form of writing advance beyond the use of symbols to represent objects and ideas?

Description : How did the Egyptian form of writing advance beyond the use of symbols to represent objects and ideas?

Last Answer : Need answer

For the purpose of Sec 3-C of these rule “sexual harassment” includes such unwelcome sexually determined behavior whether directly or otherwise as:- a) Physical contact as advances b) Demand or request for sexual favors c) Sexually colored remarks d) Showing any pornography; or any other unwelcome physical, verbal or non-verbal conduct of a sexual nature e) All the above

Description : For the purpose of Sec 3-C of these rule sexual harassment includes such unwelcome sexually determined behavior whether directly or otherwise as:- a) Physical contact as advances b) Demand or request ... other unwelcome physical, verbal or non-verbal conduct of a sexual nature e) All the above

Last Answer : c) Sexually colored remarks

The Stoke's stream function applies to the (A) Irrotational flow only (B) Ideal/non i viscous fluids only (C) Cases of axial symmetry (D) None of these

Description : The Stoke's stream function applies to the (A) Irrotational flow only (B) Ideal/non i viscous fluids only (C) Cases of axial symmetry (D) None of these

Last Answer : (C) Cases of axial symmetry

Which of the following is false for the programming language PROLOG? (A) A PROLOG variable can only be assigned to a value once (B) PROLOG is a Strongly Typed Language. (C) The scope of a variable in PROLOG is a single clause or rule. (D) the scope of a variable in PROLOG is a Single Query

Description : Which of the following is false for the programming language PROLOG? (A) A PROLOG variable can only be assigned to a value once (B) PROLOG is a Strongly Typed Language. (C) The scope of a variable in PROLOG is a single clause or rule. (D) the scope of a variable in PROLOG is a Single Query

Last Answer : (B) PROLOG is a Strongly Typed Language.

Given a grammar : S1→Sc, S→SA|A, A→aSb|ab, there is a rightmost derivation S1=>Sc =>SAC=>SaSbc. Thus, SaSbc is a right sentential form, and its handle is (A) SaS (B) be (C) Sbe (D) aSb

Description : Given a grammar : S1→Sc, S→SA|A, A→aSb|ab, there is a rightmost derivation S1=>Sc =>SAC=>SaSbc. Thus, SaSbc is a right sentential form, and its handle is (A) SaS (B) be (C) Sbe (D) aSb 

Last Answer : (D) aSb

The Greibach normal form grammar for the language L={an bn+1|n≥0} is (A) S→a SB, B→bB|λ (B) S→a SB, B→bB|b (C) S→a SB|b, B→b (D) S→a Sb|b

Description : The Greibach normal form grammar for the language L={an bn+1|n≥0} is (A) S→a SB, B→bB|λ (B) S→a SB, B→bB|b (C) S→a SB|b, B→b (D) S→a Sb|b

Last Answer : (C) S→a SB|b, B→b 

Is there a service to parse travel reservations out of emails?

Description : Is there a service to parse travel reservations out of emails?

Last Answer : I imagine that such things exist. I know that some company (Gmail, I think, but maybe something else) built some software that would scan incoming emails for certain tells' and based ... be considerably more difficult. Any company that builds this sort of software would be constantly updating it.

If mandarin is a tonal language, how can people parse meaning when the words are set to music?

Description : If mandarin is a tonal language, how can people parse meaning when the words are set to music?

Last Answer : answer:Two guesses (having learned a little mandarin, but not being a scholar of the language): 1. Context: I'd imagine it's similar to when listening to punk rock or heavy metal, it takes a ... lyrics without affecting the sound too much. Like rolling your r's or enunciating your t's while singing

In .............., the bodies of the two loops are merged together to form a single loop provided that they do not make any references to each other. (A) Loop unrolling (B) Strength reduction (C) Loop concatenation (D) Loop jamming

Description : In .............., the bodies of the two loops are merged together to form a single loop provided that they do not make any references to each other. (A) Loop unrolling (B) Strength reduction (C) Loop concatenation (D) Loop jamming

Last Answer : (D) Loop jamming

Please help me fix any grammar issues. Thx in advance.?

Description : Please help me fix any grammar issues. Thx in advance.?

Last Answer : Annotation Bachelor's thesis “ programmable microcontrollers in lab. Experimental device for measuring Light intensity dependence on distance” is based on modern programmable microcontrollers and ... about peculiarities of constructing the device for measuring Light intensity dependence on dist

The corresponding Existential Instantiation rule: for the existential quantifier is slightly more complicated. For any sentence a, variable v, and constant symbol k that does not appear elsewhere in the knowledge base. a) True b) False

Description : The corresponding Existential Instantiation rule: for the existential quantifier is slightly more complicated. For any sentence a, variable v, and constant symbol k that does not appear elsewhere in the knowledge base. a) True b) False

Last Answer : a) True

Consider the following binary search tree: Image If we remove the root node, which of the node from the left subtree will be the new root? (A) 11 (B) 12 (C) 13 (D) 16

Description : Consider the following binary search tree: If we remove the root node, which of the node from the left subtree will be the new root? (A) 11 (B) 12 (C) 13 (D) 16

Last Answer : (D) 16

Consider a window bounded by the lines : x = 0; y= 0; x = 5 and y = 3. The line segment joining (–1, 0) and (4, 5), if clipped against this window will connect the points (A) (0, 1) and (2, 3) (B) (0, 1) and (3, 3) (C) (0, 1) and (4, 3) (D) (0, 1) and (3, 2)

Description : Consider a window bounded by the lines : x = 0; y= 0; x = 5 and y = 3. The line segment joining (–1, 0) and (4, 5), if clipped against this window will connect the points (A) (0, 1) and (2, 3) (B) (0, 1) and (3, 3) (C) (0, 1) and (4, 3) (D) (0, 1) and (3, 2)

Last Answer : (A) (0, 1) and (2, 3)

In perspective projection, if a line segment joining a point which lies in front of the viewer to a point in back of the viewer is projected to a broken line of infinite extent. This is known as ................... (A) View confusion (B) Vanishing point (C) Topological distortion (D) Perspective foreshortening

Description : In perspective projection, if a line segment joining a point which lies in front of the viewer to a point in back of the viewer is projected to a broken line of infinite extent. This is known ... ....... (A) View confusion (B) Vanishing point (C) Topological distortion (D) Perspective foreshortening

Last Answer : (C) Topological distortion 

Semi-join strategies are techniques for query processing in distributed database system. Which of the following is a semi-join technique? (A) Only the joining attributes are sent from one site to another and then all of the rows are returned. (B) All of the attributes are sent from one site to another and then only the required rows are returned. (C) Only the joining attributes are sent from one site to another and then only the required rows are returned. (D) All of the attributes are sent from one site to another and then only the required rows are returned.

Description : Semi-join strategies are techniques for query processing in distributed database system. Which of the following is a semi-join technique? (A) Only the joining attributes are sent from one site to ... the attributes are sent from one site to another and then only the required rows are returned.

Last Answer : (C) Only the joining attributes are sent from one site to another and then only the required rows are returned.

For every context free grammar (G) there exists an algorithm that passes any w ∈ L(G) in number of steps proportional to (A) ln|w| (B) |w| (C) |w|2 (D) |w|3

Description : For every context free grammar (G) there exists an algorithm that passes any w ∈ L(G) in number of steps proportional to (A) ln|w| (B) |w| (C) |w|2 (D) |w|3

Last Answer : (D) |w|3

The grammar with production rules S → aSb |SS|λ generates language L given by: (A) L = {w∈{a, b}* | na(w) = nb(w) and na(v) ≥ nb(v) where v is any prefix of w} (B) L = {w∈{a, b}* | na(w) = nb(w) and na(v) ≤ nb(v) where v is any prefix of w} (C) L = {w∈{a, b}* | na(w) ≠ nb(w) and na(v) ≥ nb(v) where v is any prefix of w} (D) L = {w∈{a, b}* | na(w) ≠ nb(w) and na(v) ≤ nb(v) where v is any prefix of w}

Description : The grammar with production rules S → aSb |SS|λ generates language L given by: (A) L = {w∈{a, b}* | na(w) = nb(w) and na(v) ≥ nb(v) where v is any prefix of w} (B) L = {w∈{a, b}* | na(w) = nb(w) and na(v ... (D) L = {w∈{a, b}* | na(w) ≠ nb(w) and na(v) ≤ nb(v) where v is any prefix of w}

Last Answer : (A) L = {w∈{a, b}* | na(w) = nb(w) and na(v) ≥ nb(v) where v is any prefix of w} 

Given the production rules of a grammar G1 as S1→AB | aaB A→a | Aa B→b and the production rules of a grammar G2 as S2→aS2bS2 | bS2aS2 | λ Which of the following is correct statement? (A) G1 is ambiguous and G2 is not ambiguous. (B) G1 is ambiguous and G2 is ambiguous. (C) G1 is not ambiguous and G2 is ambiguous. (D) G1 is not ambiguous and G2 is not ambiguous.

Description : Given the production rules of a grammar G1 as S1→AB | aaB A→a | Aa B→b and the production rules of a grammar G2 as S2→aS2bS2 | bS2aS2 | λ Which of the following is correct statement? ( ... G1 is not ambiguous and G2 is ambiguous. (D) G1 is not ambiguous and G2 is not ambiguous.

Last Answer : (B) G1 is ambiguous and G2 is ambiguous.

The context free grammar for the language L = {an bm | n≤m+3, n≥0, m≥0} is (A) S→aaaA; A→aAb|B, B→Bb|λ (B) S→aaaA|λ, A→aAb|B, B→Bb|λ (C) S→aaaA|aaA|λ, A→aAb|B, B→Bb|λ (D) S→aaaA|aaA|aA|λ, A→aAb|B, B→Bb|λ

Description : The context free grammar for the language L = {an bm | n≤m+3, n≥0, m≥0} is (A) S→aaaA; A→aAb|B, B→Bb|λ (B) S→aaaA|λ, A→aAb|B, B→Bb|λ (C) S→aaaA|aaA|λ, A→aAb|B, B→Bb|λ (D) S→aaaA|aaA|aA|λ, A→aAb|B, B→Bb|λ

Last Answer : (D) S→aaaA|aaA|aA|λ, A→aAb|B, B→Bb|λ

A context free grammar for L={w|n0(w)>n1(w)} is given by: (A) S→0|0S|1SS (B) S→0S|1S|0SS|1SS|0|1 (C) S→0|0S|1SS|S1S|SS1 (D) S→0S|1S|0|1

Description : A context free grammar for L={w|n0(w)>n1(w)} is given by: (A) S→0|0S|1SS (B) S→0S|1S|0SS|1SS|0|1 (C) S→0|0S|1SS|S1S|SS1 (D) S→0S|1S|0|1

Last Answer : (C) S→0|0S|1SS|S1S|SS1 

In XML we can specify the frequency of an element by using the symbols: (A) + * ! (B) # * ! (C) + * ? (D) - * ?

Description : In XML we can specify the frequency of an element by using the symbols: (A) + * ! (B) # * ! (C) + * ? (D) - * ?

Last Answer : (C) + * ?

Consider the following database table having A, B, C and D as its four attributes and four possible candidate keys (I, II, III and IV) for this table: Image I: {B} II: {B, C} III: {A, D} IV: {C, D} If different symbols stand for different values in the table (e.g., d1 is definitely not equal to d2), then which of the above could not be the candidate key for the database table? (A) I and III only (B) III and IV only (C) II only (D) I only

Description : Consider the following database table having A, B, C and D as its four attributes and four possible candidate keys (I, II, III and IV) for this table: I: {B} II: {B, C} III: {A, D} IV: {C, D} If ... the database table? (A) I and III only (B) III and IV only (C) II only (D) I only

Last Answer : (C) II only

Consider the following Entity-Relationship (E-R) diagram and three possible relationship sets (I, II and III) for this E-R diagram: Image If different symbols stand for different values (e.g., t1 is definitely not equal to t2), then which of the above could not be the relationship set for the E-R diagram ? (A) I only (B) I and II only (C) II only (D) I, II and III

Description : Consider the following Entity-Relationship (E-R) diagram and three possible relationship sets (I, II and III) for this E-R diagram: If different symbols stand for different values (e.g., t1 is definitely not equal to t2 ... diagram ? (A) I only (B) I and II only (C) II only (D) I, II and III

Last Answer : (A) I only

Can I connect two gameboy advances together?

Description : Can I connect two gameboy advances together?

Last Answer : Yes -- certain games support multiplayer functions with a Game Link cable.

The short cut key to start a new line without starting a new paragraph is ...... A) Ctrl+Enter B) Shift+Enter C) Alt+Enter D) Ente

Description : The short cut key to start a new line without starting a new paragraph is ...... A) Ctrl+Enter B) Shift+Enter C) Alt+Enter D) Ente

Last Answer : B) Shift+Enter

A tree with n vertices is called graceful, if its vertices can be labelled with integers 1, 2, ...,n such that the absolute value of the difference of the labels of adjacent vertices are all different. Which of the following trees are graceful?

Description : A tree with n vertices is called graceful, if its vertices can be labelled with integers 1, 2, ...,n such that the absolute value of the difference of the labels of adjacent vertices are all different. Which of the following trees are ... (B) (b) and (c) (C) (a) and (c) (D) (a), (b) and (c)

Last Answer : Answer: D

Red-black trees are one of many Search tree schemes that are "balanced” in order to guarantee that basic dynamic-set operations take ............. time in the worst case. (1) O(1) (2) O(log n) (3) O(n) (4) O(n log n)

Description : Red-black trees are one of many Search tree schemes that are "balanced” in order to guarantee that basic dynamic-set operations take ............. time in the worst case. (1) O(1) (2) O(log n) (3) O(n) (4) O(n log n)

Last Answer : (2) O(log n) 

The property of binary tree is A) The first subset is called left subtree B) The second subtree is called right subtree C) The root cannot contain NULL D) The right subtree can be empty

Description : The property of binary tree is A) The first subset is called left subtree B) The second subtree is called right subtree C) The root cannot contain NULL D) The right subtree can be empty

Last Answer : D) The right subtree can be empty

For any B-tree of minimum degree t ≥2, every node other than the root must have atleast ............... keys and every node can have at most .............. keys. (A) t-1, 2t+1 (B) t+1, 2t+1 (C) t-1, 2t-1 (D) t+1, 2t-1

Description : For any B-tree of minimum degree t ≥2, every node other than the root must have atleast ............... keys and every node can have at most .............. keys. (A) t-1, 2t+1 (B) t+1, 2t+1 (C) t-1, 2t-1 (D) t+1, 2t-1

Last Answer : (C) t-1, 2t-1 

Level order Traversal of a rooted Tree can be done by starting from root and performing: (A) Breadth First Search (B) Depth first search (C) Root search (D) Deep search

Description : Level order Traversal of a rooted Tree can be done by starting from root and performing: (A) Breadth First Search (B) Depth first search (C) Root search (D) Deep search

Last Answer : (A) Breadth First Search

Consider the following game tree in which root is a maximizing node and children are visited left to right. What nodes will be pruned by the alphabeta pruning? (A) I (B) HI (C) CHI (D) GHI

Description : Consider the following game tree in which root is a maximizing node and children are visited left to right. What nodes will be pruned by the alphabeta pruning?  (A) I (B) HI (C) CHI (D) GHI

Last Answer : (B) HI

Which of the following statements about the Himalayan rivers is not correct? (a) They have very large basins (b) Many of them pass through giant gorges (c) They perform very little erosion activity (d) Over the plain they display a strong meandering tendency and often shift their beds

Description : Which of the following statements about the Himalayan rivers is not correct? (a) They have very large basins (b) Many of them pass through giant gorges (c) They perform very little erosion activity (d) Over the plain they display a strong meandering tendency and often shift their beds

Last Answer : Ans: (c)

In geography ‘Gulf Stream’ refers to - (1) a warm ocean current (2) strong air current (3) streams joining a gulf (4) the name of a stream

Description : In geography ‘Gulf Stream’ refers to - (1) a warm ocean current (2) strong air current (3) streams joining a gulf (4) the name of a stream

Last Answer : (1) a warm ocean current Explanation: The Gulf Stream, together with its northern extension towards Europe, the North Atlantic Drift, is a powerful, warm, and swift Atlantic ocean current that ... of the east coast of North America from Florida to Newfoundland, and the west coast of Europe

In geography ‘Gulf Stream’ refers to (1) a warm ocean current (2) strong air current (3) streams joining a gulf (4) the name of a stream

Description : In geography ‘Gulf Stream’ refers to (1) a warm ocean current (2) strong air current (3) streams joining a gulf (4) the name of a stream

Last Answer : a warm ocean current

Jarod is a recent graduate of a nursing program. Although he has completed a degree, most of his work experience has been in the food service industry. What should he do?

Description : Jarod is a recent graduate of a nursing program. Although he has completed a degree, most of his work experience has been in the food service industry. What should he do?

Last Answer : Emphasize his education and highlight work skills that apply to nursing.