Big - O estimate for f(x) = (x + 1) log(x2 + 1) + 3x2 is given as (A) O(xlogx) (B) O(x2) (C) O(x3) (D) O(x2logx)

Big - O estimate for f(x) = (x + 1) log(x2 + 1) + 3x2 is given as (A) O(xlogx) (B) O(x2) (C) O(x3) (D) O(x2logx)

by

1 Answer

Answer :

(B) O(x2)

by

Related questions

Consider the following LPP: Min. Z = x1+x2+x3

Description : Consider the following LPP: Min. Z = x1+x2+x3 Subject to 3x1 + 4x3 ≤ 5 5x1 + x2 + 6x3 =7 8x1 + 9x3 ≥ 2 x1, x2, x3 ≥ 0 The standard form of this LPP shall be: (1) Min. Z = x1 + x2 + x3 + 0x4 + 0x5 Subject ... + 4x3 + x4 = 5; 5x1 + x2 + 6x3 + x6 = 7; 8x1 + 9x3 - x5 + x7 = 2; x1 to x7 ≥ 0

Last Answer : Answer: 1

p(x)=x3+3x2+3x+1, g(x) = x+2 -Maths 9th

Description : p(x)=x3+3x2+3x+1, g(x) = x+2 -Maths 9th

Last Answer : p(x) = x3+3x2+3x+1, g(x) = x+2 g(x) = 0 ⇒ x+2 = 0 ⇒ x = −2 ∴ Zero of g(x) is -2. Now, p(−2) = (−2)3+3(−2)2+3(−2)+1 = −8+12−6+1 = −1 ≠ 0 ∴By factor theorem, g(x) is not a factor of p(x

The position vectors of three particles are given by  X1 = (5i + 5j)m, X2 = (5ti + 5tj)m, and X3 = (5ti + 10t^2tj)

Description : The position vectors of three particles are given by  X1 = (5i + 5j)m, X2 = (5ti + 5tj)m, and X3 = (5ti + 10t^2tj)

Last Answer : The position vectors of three particles are given by \(\overset\rightarrow{X}_1\) = (\(5\hat ... the velocity and acceleration for each, in SI units.

Check whether the following are quadratic equations: (i) (x+ 1)2=2(x-3) (ii) x – 2x = (- 2) (3-x) (iii) (x – 2) (x + 1) = (x – 1) (x + 3) (iv) (x – 3) (2x + 1) = x (x + 5) (v) (2x – 1) (x – 3) = (x + 5) (x – 1) (vi) x2 + 3x + 1 = (x – 2)2 (vii) (x + 2)3 = 2x(x2 – 1) (viii) x3 -4x2 -x + 1 = (x-2)3 -Maths 10th

Description : Check whether the following are quadratic equations: (i) (x+ 1)2=2(x-3) (ii) x - 2x = (- 2) (3-x) (iii) (x - 2) (x + 1) = (x - 1) (x + 3) (iv) (x - 3) (2x + 1) = x (x + 5) (v) (2x - 1) (x - 3) = (x ... vi) x2 + 3x + 1 = (x - 2)2 (vii) (x + 2)3 = 2x(x2 - 1) (viii) x3 -4x2 -x + 1 = (x-2)3 -Maths 10th

Last Answer : this is the correct answer!

Determine which of the following polynomials has (x + 1) a factor: (i) x3+x2+x+1 -Maths 9th

Description : Determine which of the following polynomials has (x + 1) a factor: (i) x3+x2+x+1 -Maths 9th

Last Answer : Solution: Let p(x) = x3+x2+x+1 The zero of x+1 is -1. [x+1 = 0 means x = -1] p(−1) = (−1)3+(−1)2+(−1)+1 = −1+1−1+1 = 0 ∴By factor theorem, x+1 is a factor of x3+x2+x+1

Show that, x + 3 is a factor of 69 + 11c – x2 + x3 -Maths 9th

Description : Show that, x + 3 is a factor of 69 + 11c – x2 + x3 -Maths 9th

Last Answer : This answer was deleted by our moderators...

Show that, x + 3 is a factor of 69 + 11c – x2 + x3 -Maths 9th

Description : Show that, x + 3 is a factor of 69 + 11c – x2 + x3 -Maths 9th

Last Answer : This answer was deleted by our moderators...

Find the value of x3 + y3 + z3 – 3xyz if x2 + y2 + z2 = 83 and x + y + z = 15 -Maths 9th

Description : Find the value of x3 + y3 + z3 – 3xyz if x2 + y2 + z2 = 83 and x + y + z = 15 -Maths 9th

Last Answer : Consider the equation x + y + z = 15 From algebraic identities, we know that (a + b + c)2 = a2 + b2 + c2 + 2(ab + bc + ca) So, (x + y + z)2 = x2 + y2 + z2 + 2(xy + yz + xz) From the question, x2 + y2 + z2 ... y3 + z3 - 3xyz = 15(83 - 71) => x3 + y3 + z3 - 3xyz = 15 12 Or, x3 + y3 + z3 - 3xyz = 180

The standard equation of a cubical spiral transition curve provided on roads, is (A) y = l²/6RL (B) y = x3 /6RL (C) y = x2 /6RL (D) y = x/6RL

Description : The standard equation of a cubical spiral transition curve provided on roads, is (A) y = l²/6RL (B) y = x3 /6RL (C) y = x2 /6RL (D) y = x/6RL

Last Answer : Answer: Option B

The asymptotic upper bound solution of the recurrence relation given by T(n)= 2T(n/2)+n/log n is: (1) O(n2) (2) O(n log n) (3) O(n log log n) (4) O(log log n)

Description : The asymptotic upper bound solution of the recurrence relation given by T(n)= 2T(n/2)+n/log n is: (1) O(n2) (2) O(n log n) (3) O(n log log n) (4) O(log log n)

Last Answer : (3) O(n log log n) 

Using factor theorem, factorise the polynomial x3 + x2 - 4x - 4. -Maths 9th

Description : Using factor theorem, factorise the polynomial x3 + x2 - 4x - 4. -Maths 9th

Last Answer : Solution :-

If x2 + 1/x2 = 34, find x3 + 1/x3 - 9. -Maths 9th

Description : If x2 + 1/x2 = 34, find x3 + 1/x3 - 9. -Maths 9th

Last Answer : Solution :-

The turns ratio of device 'B' shown in the illustration is two to one (total). If 220 volts were applied to terminals 'H1' & 'H2', what would be indicated across 'X1' & 'X4' with 'X2' & 'X3' connected and isolated? EL-0082 A. 55 volts B. 110 volts C. 220 volts D. 440 volts

Description : The turns ratio of device 'B' shown in the illustration is two to one (total). If 220 volts were applied to terminals 'H1' & 'H2', what would be indicated across 'X1' & 'X4' with 'X2' & 'X3' connected and isolated? EL-0082 A. 55 volts B. 110 volts C. 220 volts D. 440 volts

Last Answer : Answer: B

The turns ratio of device 'B' shown in the illustration is two to one (total). If 440 volts were applied to terminals 'H1' & 'H2', what would be indicated across 'X1' & 'X4' with 'X2' & 'X3' connected and isolated? EL-0082 A. 110 volts B. 220 volts C. 880 volts D. 1760 volts

Description : The turns ratio of device 'B' shown in the illustration is two to one (total). If 440 volts were applied to terminals 'H1' & 'H2', what would be indicated across 'X1' & 'X4' with 'X2' & 'X3' connected and isolated? EL-0082 A. 110 volts B. 220 volts C. 880 volts D. 1760 volts

Last Answer : Answer: B

Consider f(N) = g(N) + h(N) Where function g is a measure of the cost of getting from the start node to the current node N and h is an estimate of additional cost of getting from the current node N to the goal node. Then f(N) = h(N) is used in which one of the following algorithms ? (A) A* algorithm (B) AO* algorithm (C) Greedy best first search algorithm (D) Iterative A* algorithm

Description : Consider f(N) = g(N) + h(N) Where function g is a measure of the cost of getting from the start node to the current node N and h is an estimate of additional cost of getting from the current ... ? (A) A* algorithm (B) AO* algorithm (C) Greedy best first search algorithm (D) Iterative A* algorithm

Last Answer : (C) Greedy best first search algorithm

Consider the two class classification task that consists of the following points: Class C1: [1 1.5] [1 -1.5] Class C2: [-2 2.5] [-2 -2.5] The decision boundary between the two classes using single perceptron is given by: (A) x1+x2+1.5=0 (B) x1+x2-1.5=0 (C) x1+1.5=0 (D) x1-1.5=0

Description : Consider the two class classification task that consists of the following points: Class C1: [1 1.5] [1 -1.5] Class C2: [-2 2.5] [-2 -2.5] The decision boundary between the two classes using single perceptron is given by: (A) x1+x2+1.5=0 (B) x1+x2-1.5=0 (C) x1+1.5=0 (D) x1-1.5=0

Last Answer : (C) x1+1.5=0 

When f(x) = x4 - 2x3 + 3x2 - ax is divided by x + 1 and x - 1 , we get remainders as 19 and 5 respectively . -Maths 9th

Description : When f(x) = x4 - 2x3 + 3x2 - ax is divided by x + 1 and x - 1 , we get remainders as 19 and 5 respectively . -Maths 9th

Last Answer : When f(x) is divided by (x+1) and (x-1) , the remainders are 19 and 5 respectively . ∴ f(-1) = 19 and f(1) = 5 ⇒ (-1)4 - 2 (-1)3 + 3(-1)2 - a (-1) + b = 19 ⇒ 1 +2 + 3 + a + b = 19 ∴ a + b = 13 ------- ... + 3x2 - 5x + 8 ⇒ f(3) = 34 - 2 33 + 3 32 - 5 3 + 8 = 81 - 54 + 27 - 15 + 8 = 47

When f(x) = x4 - 2x3 + 3x2 - ax is divided by x + 1 and x - 1 , we get remainders as 19 and 5 respectively . -Maths 9th

Description : When f(x) = x4 - 2x3 + 3x2 - ax is divided by x + 1 and x - 1 , we get remainders as 19 and 5 respectively . -Maths 9th

Last Answer : When f(x) is divided by (x+1) and (x-1) , the remainders are 19 and 5 respectively . ∴ f(-1) = 19 and f(1) = 5 ⇒ (-1)4 - 2 (-1)3 + 3(-1)2 - a (-1) + b = 19 ⇒ 1 +2 + 3 + a + b = 19 ∴ a + b = 13 ------- ... + 3x2 - 5x + 8 ⇒ f(3) = 34 - 2 33 + 3 32 - 5 3 + 8 = 81 - 54 + 27 - 15 + 8 = 47

If f(x) 3x2 - x find f(-2).?

Description : If f(x) 3x2 - x find f(-2).?

Last Answer : Wherever there is an x substitute -2 and calculate the resultingsum:f(x) = 3x² - x→ f(-2) = 3 × (-2)² - (-2)= 3 × 4 + 2= 12 + 2= 14

The message 11001001 is to be transmitted using the CRC polynomial x3+1 to protect it from errors. The message that should be transmitted is (A) 110010011001 (B) 11001001 (C) 110010011001001 (D) 11001001011

Description : The message 11001001 is to be transmitted using the CRC polynomial x3+1 to protect it from errors. The message that should be transmitted is (A) 110010011001 (B) 11001001 (C) 110010011001001 (D) 11001001011

Last Answer : (D) 11001001011

The solution of recurrence relation, T(n) = 2T(floor (√n)) + logn is (A) O(n log log logn) (B) O(n log logn) (C) O(log logn) (D) O(logn log logn)

Description : The solution of recurrence relation, T(n) = 2T(floor (√n)) + logn is (A) O(n log log logn) (B) O(n log logn) (C) O(log logn) (D) O(logn log logn)

Last Answer : (D) O(logn log logn)

For a B-tree of height h and degree t, the total CPU time used to insert a node is (A) O(h log t) (B) O(t log h) (C) O(t2h) (D) O(th)

Description : For a B-tree of height h and degree t, the total CPU time used to insert a node is (A) O(h log t) (B) O(t log h) (C) O(t2h) (D) O(th)

Last Answer : (D) O(th)

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) 

Let G(x) be generator polynomial used for CRC checking. The condition that should be satisfied by G(x) to correct odd numbered error bits, will be: (1) (1+x) is factor of G(x) (2) (1-x) is factor of G(x) (3) (1+x2) is factor of G(x) (4) x is factor of G(x)

Description : Let G(x) be generator polynomial used for CRC checking. The condition that should be satisfied by G(x) to correct odd numbered error bits, will be: (1) (1+x) is factor of G(x) (2) (1-x) is factor of G(x) (3) (1+x2) is factor of G(x) (4) x is factor of G(x)

Last Answer : (1+x) is factor of G(x)

The number of function points of a proposed system is calculated as 500. Suppose that the system is planned to be developed in Java and the LOC/FP ratio of Java is 50. Estimate the effort (E) required to complete the project using the effort formula of basic COCOMO given below: E = a(KLOC)b Assume that the values of a and b are 2.5 and 1.0 respectively. (A) 25 person months (B) 75 person months (C) 62.5 person months (D) 72.5 person months

Description : The number of function points of a proposed system is calculated as 500. Suppose that the system is planned to be developed in Java and the LOC/FP ratio of Java is 50. Estimate the effort (E) required to ... ) 25 person months (B) 75 person months (C) 62.5 person months (D) 72.5 person months

Last Answer : (C) 62.5 person months 

A fuzzy set A on R is ................. iff A(λx1 + (1 – λ)x2) ≥ min [A(x1), A(x2)] for all x1, x2 ∈ R and all λ ∈ [0, 1], where min denotes the minimum operator. (A) Support (B) α-cut (C) Convex (D) Concave

Description : A fuzzy set A on R is ................. iff A(λx1 + (1 – λ)x2) ≥ min [A(x1), A(x2)] for all x1, x2 ∈ R and all λ ∈ [0, 1], where min denotes the minimum operator. (A) Support (B) α-cut (C) Convex (D) Concave 

Last Answer : (C) Convex 

An artificial neurons receives n inputs x1, x2,...,xn with weights w1,w2,...,wn attached to the input links. The weighted sum ............... is computed to be passed on to a non-linear filter ϕ called activation function to release the output. (A) Σ wi (B) Σ xi (C) Σ wi + Σ xi (D) Σ wi . Σ xi

Description : An artificial neurons receives n inputs x1, x2,...,xn with weights w1,w2,...,wn attached to the input links. The weighted sum ............... is computed to be passed on to a non-linear filter ϕ called activation function to release the output. (A) Σ wi (B) Σ xi (C) Σ wi + Σ xi (D) Σ wi . Σ xi

Last Answer : (D) Σ wi . Σ xi

A perceptron has input weights W1 = -3.9 and W2 = 1.1 with threshold value T = 0.3. What output does it give for the input x1 = 1.3 and x2 = 2.2? (A) -2.65 (B) -2.30 (B) 0 (D) 1

Description : A perceptron has input weights W1 = -3.9 and W2 = 1.1 with threshold value T = 0.3. What output does it give for the input x1 = 1.3 and x2 = 2.2? (A) -2.65 (B) -2.30 (B) 0 (D) 1

Last Answer : Answer: C

In under damped vibrating system, if x1 and x2 are the successive values of the amplitude on the same side of the mean position, then the logarithmic decrement is equal to a) x1/x2 b) log (x1/x2) c) ln (x1/x2) d) log (x1.x2)

Description : In under damped vibrating system, if x1 and x2 are the successive values of the amplitude on the same side of the mean position, then the logarithmic decrement is equal to a) x1/x2 b) log (x1/x2) c) ln (x1/x2) d) log (x1.x2)

Last Answer : c) ln (x1/x2)

Let f and g be the functions from the set of integers to the set integers defined by f(x) = 2x + 3 and g(x) = 3x + 2 Then the composition of f and g and g and f is given as (A) 6x + 7, 6x + 11 (B) 6x + 11, 6x + 7 (C) 5x + 5, 5x + 5 (D) None of the above

Description : Let f and g be the functions from the set of integers to the set integers defined by f(x) = 2x + 3 and g(x) = 3x + 2 Then the composition of f and g and g and f is given as (A) 6x + 7, 6x + 11 (B) 6x + 11, 6x + 7 (C) 5x + 5, 5x + 5 (D) None of the above

Last Answer : (A) 6x + 7, 6x + 11 Explanation: fog(x)=f(g(x))=f(3x+2)=2(3x+2)+3=6x+7 gof(x)=g(f(x))=g(2x+3)=3(2x+3)+2=6x+11

The sum of products expansion for the function F(x, y, z) = (x + y)z’ is given as (A) x’y’z + xyz’ + x’yz’ (B) xyz + xyz’ + xy’z’ (C) xy’z’ + x’y’z’ + xyz’ (D) xyz’ + xy’z’ + x’yz’

Description : The sum of products expansion for the function F(x, y, z) = (x + y)z’ is given as (A) x’y’z + xyz’ + x’yz’ (B) xyz + xyz’ + xy’z’ (C) xy’z’ + x’y’z’ + xyz’ (D) xyz’ + xy’z’ + x’yz’

Last Answer : (D) xyz’ + xy’z’ + x’yz’ Explanation: Use Boolean identities to expand the product and simplify. F(x, y, z)=(x + y)z’  =xz’+yz’ Distributive law  =x1z’+1yz’ Identity law  =x(y+y’)z’+(x+x’)yz’ Unit property =xyz’+xy’z’+xyz’+x’yz’ Distributive law  =xyz’+xy’z’+x’yz’ Idempotent law 

Suppose the function y and a fuzzy integer number around -4 for x are given as y=(x-3)2+2 Around -4={(2,0.3), (3,0.6), (4,1), (5,0.6), (6,0.3)} respectively. Then f(Around - 4) is given by: (A) {(2,0.6), (3,0.3), (6,1), (11,0.3)} (B) {(2,0.6), (3,1), (6,1), (11,0.3)} (C) {(2,0.6), (3,1), (6,0.6), (11,0.3)} (D) {(2,0.6), (3,0.3), (6,0.6), (11,0.3)}

Description : Suppose the function y and a fuzzy integer number around -4 for x are given as y=(x-3)2+2 Around -4={(2,0.3), (3,0.6), (4,1), (5,0.6), (6,0.3)} respectively. Then f(Around - 4) is given by: (A) {(2,0.6), (3,0.3), ... 6), (3,1), (6,0.6), (11,0.3)} (D) {(2,0.6), (3,0.3), (6,0.6), (11,0.3)}

Last Answer : (C) {(2,0.6), (3,1), (6,0.6), (11,0.3)}

If h* represents an estimate of the cost of getting from the current node N to the goal node and h represents actual cost of getting from current node to the goal node, then A* algorithm gives an optimal solution if (A) h* us equal to h (B) h* overestimates h (C) h* underestimates h (D) none of these

Description : If h* represents an estimate of the cost of getting from the current node N to the goal node and h represents actual cost of getting from current node to the goal node, then A* algorithm gives an optimal solution ... h* us equal to h (B) h* overestimates h (C) h* underestimates h (D) none of these

Last Answer : (C) h* underestimates h

If f(x) x2 plus x find f(-3)?

Description : If f(x) x2 plus x find f(-3)?

Last Answer : -1

F(x) = x2 - 1?

Description : F(x) = x2 - 1?

Last Answer : 1

The Servlet Response interface enables a servlet to formulate a response for a client using the method ............... (A) void log(Exception e, String s) (B) void destroy() (C) int getServerPort() (D) void setContextType(String Type)

Description : The Servlet Response interface enables a servlet to formulate a response for a client using the method ............... (A) void log(Exception e, String s) (B) void destroy() (C) int getServerPort() (D) void setContextType(String Type)

Last Answer : (D) void setContextType(String Type)

Any decision tree that sorts n elements has height .............. (1) Ω(log n) (2) Ω(n) (3) Ω(n log n) (4) Ω(n2)

Description : Any decision tree that sorts n elements has height .............. (1) Ω(log n) (2) Ω(n) (3) Ω(n log n) (4) Ω(n2)

Last Answer : (3) Ω(n log n) 

x4+3x3+3x2+x+1 -Maths 9th

Description : x4+3x3+3x2+x+1 -Maths 9th

Last Answer : Solution: Let p(x)= x4+3x3+3x2+x+1 The zero of x+1 is -1. p(−1)=(−1)4+3(−1)3+3(−1)2+(−1)+1 =1−3+3−1+1 =1 ≠ 0 ∴By factor theorem, x+1 is not a factor of x4+3x3+3x2+x+1

The polynomial p{x = x4 -2x3 + 3x2 -ax+3a-7 when divided by x+1 leaves the remainder 19. -Maths 9th

Description : The polynomial p{x = x4 -2x3 + 3x2 -ax+3a-7 when divided by x+1 leaves the remainder 19. -Maths 9th

Last Answer : p(x) is divided by x+ 2 =

The polynomial p{x = x4 -2x3 + 3x2 -ax+3a-7 when divided by x+1 leaves the remainder 19. -Maths 9th

Description : The polynomial p{x = x4 -2x3 + 3x2 -ax+3a-7 when divided by x+1 leaves the remainder 19. -Maths 9th

Last Answer : p(x) is divided by x+ 2 =

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

A relation R={A,B,C,D,E,F,G} is given with following set of functional dependencies: F={AD→E, BE→F, B→C, AF→G} Which of the following is a candidate key? (A) A (B) AB (C) ABC (D) ABD

Description : A relation R={A,B,C,D,E,F,G} is given with following set of functional dependencies: F={AD→E, BE→F, B→C, AF→G} Which of the following is a candidate key? (A) A (B) AB (C) ABC (D) ABD

Last Answer : Answer: D

Let R be the rectangular window against which the lines are to be clipped using 2D Sutherland-Cohen line clipping algorithm. The rectangular window has lower left-hand corner at (-5,1) and upper righthand corner at (3,7). Consider the following three lines for clipping with the given end point co-ordinates: Line AB: A(-6,2) and B(-1,8) Line CD: C(-1,5) and D(4,8) Line EF: E(-2,3) and F(1,2) Which of the following line(s) is/are candidate for clipping? (A) AB (B) CD (C) EF (D) AB and CD

Description : Let R be the rectangular window against which the lines are to be clipped using 2D Sutherland-Cohen line clipping algorithm. The rectangular window has lower left-hand corner at (-5,1) and upper righthand corner at (3,7). ... s) is/are candidate for clipping? (A) AB (B) CD (C) EF (D) AB and CD

Last Answer : (D) AB and CD

What is the value returned by the function f given below when n = 100 ? int f(int n) { if (n==0) then return n; else return n + f(n-2); } (A) 2550 (B) 2556 (C) 5220 (D) 5520

Description : What is the value returned by the function f given below when n = 100 ? int f(int n)  { if (n==0) then return n;  else return n + f(n-2);  } (A) 2550 (B) 2556 (C) 5220 (D) 5520

Last Answer : (A) 2550

For the reaction `2CI F_(3)(g) harr CI_(2)(g) +3F_(2)(g) log K_(eq) vs (1)/(T)` (where temperature is in K) curve is obtained as given. Which of the f

Description : For the reaction `2CI F_(3)(g) harr CI_(2)(g) +3F_(2)(g) log K_(eq) vs (1)/(T)` (where temperature is in K) curve is obtained as given. Which of the f

Last Answer : For the reaction `2CI F_(3)(g) harr CI_(2)(g) +3F_(2)(g) log K_(eq) vs (1)/(T)` ( ... catalyst at equilibrium D. Removal of `F_(2)(g)` at equilibrium

Consider an implementation of unsorted single linked list. Suppose it has its representation with a head and a tail pointer (i.e. pointers to the first and last nodes of the linked list). Given the representation, which of the following operation cannot be implemented in O(1) time ? (A) Insertion at the front of the linked list. (B) Insertion at the end of the linked list. (C) Deletion of the front node of the linked list. (D) Deletion of the last node of the linked list.

Description : Consider an implementation of unsorted single linked list. Suppose it has its representation with a head and a tail pointer (i.e. pointers to the first and last nodes of the linked list). Given the ... the front node of the linked list. (D) Deletion of the last node of the linked list.

Last Answer : (D) Deletion of the last node of the linked list. 

Which of the following commands is used to display the directory attributes rather than its contents? A. ls -l -d B. ls -l C. ls -x D. ls -F E. None of the above

Description : Which of the following commands is used to display the directory attributes rather than its contents? A. ls -l -d B. ls -l C. ls -x D. ls -F E. None of the above

Last Answer : A. ls -l -d

What is the output of the following? x = "abcdef" i = "i" while i in x: print(i, end=" ") a) no output b) i i i i i i … c) a b c d e f

Description : What is the output of the following? x = "abcdef" i = "i" while i in x: print(i, end=" ") a) no output b) i i i i i i … c) a b c d e f

Last Answer : a) no output