Which of the following concepts means adding new concepts to a program as it runs? (A) Data hiding (B) Dynamic loading (C) Dynamic typing (D) Dynamic binding

Which of the following concepts means adding new concepts to a program as it runs? (A) Data hiding (B) Dynamic loading (C) Dynamic typing (D) Dynamic binding
by

1 Answer

Answer :

(B) Dynamic loading
by

Related questions

The friend functions are used in situations where A) We want to exchange data between classes B) We want to have access to unrelated classes C) Dynamic binding is required D) We want to create versatile overloaded operators.

Description : The friend functions are used in situations where A) We want to exchange data between classes B) We want to have access to unrelated classes C) Dynamic binding is required D) We want to create versatile overloaded operators.

Last Answer : A) We want to exchange data between classes

Which of the following differentiates between overloaded functions and overridden functions ? (A) Overloading is a dynamic or runtime binding and overridden is a static or compile time binding. (B) Overloading is a static or compile time binding and overriding is dynamic or runtime binding. (C) Redefining a function in a friend class is called overloading, while redefining a function in a derived class is called as overridden function. (D) Redefining a function in a derived class is called function overloading, while redefining a function in a friend class is called function overriding.

Description : Which of the following differentiates between overloaded functions and overridden functions ? (A) Overloading is a dynamic or runtime binding and overridden is a static or compile time binding. ... function overloading, while redefining a function in a friend class is called function overriding.

Last Answer : (B) Overloading is a static or compile time binding and overriding is dynamic or runtime binding.

Which of the following statement(s) is/are TRUE with regard to software testing? I. Regression testing technique ensures that the software product runs correctly after the changes during maintenance. II. Equivalence partitioning is a white-box testing technique that divides the input domain of a program into classes of data from which test cases can be derived. (1) only I (2) only II (3) both I and II (4) neither I nor II

Description : Which of the following statement(s) is/are TRUE with regard to software testing? I. Regression testing technique ensures that the software product runs correctly after the changes during maintenance. II. Equivalence partitioning is a ... (1) only I (2) only II (3) both I and II (4) neither I nor II

Last Answer : (1) only I 

Which of the following is not typically a benefit of dynamic linking? I. Reduction in overall program execution time. II. Reduction in overall space consumption in memory. III. Reduction in overall space consumption on disk. IV. Reduction in the cost of software updates. (A) I and IV (B) I only (C) II and III (D) IV only

Description : Which of the following is not typically a benefit of dynamic linking? I. Reduction in overall program execution time. II. Reduction in overall space consumption in memory. III. Reduction in overall space consumption on disk. IV. ... updates. (A) I and IV (B) I only (C) II and III (D) IV only

Last Answer : (B) I only 

Cohesion is an extension of: (A) Abstraction concept (B) Refinement concept (C) Information hiding concept (D) Modularity

Description : Cohesion is an extension of: (A) Abstraction concept (B) Refinement concept (C) Information hiding concept (D) Modularity

Last Answer : (C) Information hiding concept 

Match the following. a) Java 1) is a tool for debugging java program b) Javah 2) is a tool for creating C-like header files c) Javap 3) runs java bytecode d) jdb 4) prints java code representation A) a-3, b-2,c-1 B) a-3, b-1, c-4, d-2 C) a-1, b-2, c-3, d-4 D) a-2, b-1, c-3, d-4

Description : Match the following. a) Java 1) is a tool for debugging java program b) Javah 2) is a tool for creating C-like header files c) Javap 3) runs java bytecode d) jdb 4) prints java code representation A) a-3, b-2,c-1 B) a-3, b-1, c-4, d-2 C) a-1, b-2, c-3, d-4 D) a-2, b-1, c-3, d-4

Last Answer : B) a-3, b-1, c-4, d-2

What is the function of following UNIX command? WC – l<a >b& (A) It runs the word count program to count the number of lines in its input, a, writing the result to b, as a foreground process. (B) It runs the word count program to count the number of lines in its input, a, writing the result to b, but does it in the background. (C) It counts the errors during the execution of a process, a, and puts the result in process b. (D) It copies the ‘ l ’ numbers of lines of program from file, a, and stores in file b.

Description : What is the function of following UNIX command? WC - lb& (A) It runs the word count program to count the number of lines in its input, a, writing the result to b, as a foreground process. (B) It runs ... (D) It copies the l ' numbers of lines of program from file, a, and stores in file b.

Last Answer : (B) It runs the word count program to count the number of lines in its input, a, writing the result to b, but does it in the background.

The DBMS utility, ...................... allows to reconstruct the correct state of database from the backup and history of transactions. A) Backup B) Recovery C) Monitoring D) Data loading

Description : The DBMS utility, ...................... allows to reconstruct the correct state of database from the backup and history of transactions. A) Backup B) Recovery C) Monitoring D) Data loading

Last Answer : B) Recovery

The full form of DDL is (A Dynamic Data Language (B) Detailed Data Language (C) Data Definition Language (D) Data Derivation Language

Description : The full form of DDL is (A Dynamic Data Language (B) Detailed Data Language (C) Data Definition Language (D) Data Derivation Language

Last Answer : C) Data Definition Language

Describe following terms: Inheritance, data abstraction, data encapsulation, dynamic binding.

Description : Describe following terms: Inheritance, data abstraction, data encapsulation, dynamic binding.

Last Answer : Inheritance: 1. Inheritance is the process by which objects of one class acquire the properties of objects of another class. 2. It supports the concept of hierarchical classification. It also provides the ... with a given procedure call is not known until the time of the call at run-time.

Define the following terms: (i) Data abstraction (ii) Class (iii) Dynamic binding (iv) Polymorphism

Description : Define the following terms: (i) Data abstraction (ii) Class (iii) Dynamic binding (iv) Polymorphism

Last Answer : (i) Data abstraction: Abstraction refers to the act of representing essential features without including the background details or explanation. Data abstraction is the process of defining a data type, often ... more than one form at different instances depending on the type or number of arguments. 

Name some other concepts related to Scanner/StringTokenizer

Description : Name some other concepts related to Scanner/StringTokenizer

Last Answer : A: Scanner class, StringTokenizer class, split() function.

Which of the following statement(s) is/are correct with reference to curve generation? I. Hermite curves are generated using the concepts of interpolation. II. Bezier curves are generated using the concepts of approximation. III. The Bezier curves lies entirely within the convex hull of its control points. IV. The degree of Bezier curve does not depend on the number of control points. (A) I, II and IV only (B) II and III only (C) I and II only (D) I, II and III only

Description : Which of the following statement(s) is/are correct with reference to curve generation? I. Hermite curves are generated using the concepts of interpolation. II. Bezier curves are generated using the concepts of approximation. III. The ... (B) II and III only (C) I and II only (D) I, II and III only

Last Answer : (D) I, II and III only

ome of the utilities of DBMS are ............. i) Loading ii) Backup iii) File organization iv) Process Organization A) i, ii, and iv only B) i, ii and iii only C) ii, iii and iv only D) All i, ii, iii, and iv

Description : ome of the utilities of DBMS are ............. i) Loading ii) Backup iii) File organization iv) Process Organization A) i, ii, and iv only B) i, ii and iii only C) ii, iii and iv only D) All i, ii, iii, and iv

Last Answer : B) i, ii and iii only

The positive inotropic action of digoxin takes several hours to develop because: A. Binding of digoxin to Na+K+ATPase is slow B. After Na+K+ATPase inhibition by digoxin, Ca2+ loading of myocardial fibres occurs progressively with each contraction C. Digoxin inhibits Na+K+ATPase through modification of gene function which takes time D. Both ‘A’ and ‘B’ are correc

Description : The positive inotropic action of digoxin takes several hours to develop because: A. Binding of digoxin to Na+K+ATPase is slow B. After Na+K+ATPase inhibition by digoxin, Ca2+ loading of myocardial ... +ATPase through modification of gene function which takes time D. Both A' and B' are correc

Last Answer : D. Both ‘A’ and ‘B’ are correct

__________ means sharing a program with someone who is not authorized by the license agreement to use it. A. Softloading B. Hard Disk loading C. Internet Downloading D. Renting

Description : __________ means sharing a program with someone who is not authorized by the license agreement to use it. A. Softloading B. Hard Disk loading C. Internet Downloading D. Renting

Last Answer : D. All of the above

“Booting the System” means (1) loading the operating system (2) dismissing the computer (3) running an application program called “Booting”. (4) physically kicking the computer

Description : “Booting the System” means (1) loading the operating system (2) dismissing the computer (3) running an application program called “Booting”. (4) physically kicking the computer

Last Answer : loading the operating system

One of the following makes an antenna physically long but electrically short A. Adding L in series B. Adding C in series C. Top loading D. Both A and C

Description : One of the following makes an antenna physically long but electrically short A. Adding L in series B. Adding C in series C. Top loading D. Both A and C

Last Answer : B. Adding C in series

Known as the technique for adding a series inductor at or near the center of an antenna element in order to cancel the capacitive reactance of an antenna. A. Dipole B. Center loading C. Reflector D. loading coil

Description : Known as the technique for adding a series inductor at or near the center of an antenna element in order to cancel the capacitive reactance of an antenna. A. Dipole B. Center loading C. Reflector D. loading coil

Last Answer : D. loading coil

What makes an antenna physically long but electrically short? A. Top loading B. Adding C in series C. Adding L in series D. All of these

Description : What makes an antenna physically long but electrically short? A. Top loading B. Adding C in series C. Adding L in series D. All of these

Last Answer : B. Adding C in series

Which of the following is/ are the drawbacks of Ring Topology? A) Failure of one computer, can affect the whole network B) Adding or removing the computers disturbs the network activity. C) If the central hub fails, the whole network fails to operate. D) Both of A and B

Description : Which of the following is/ are the drawbacks of Ring Topology? A) Failure of one computer, can affect the whole network B) Adding or removing the computers disturbs the network activity. C) If the central hub fails, the whole network fails to operate. D) Both of A and B

Last Answer : D) Both of A and B

The given maximization assignment problem can be converted into a minimization problem by (A) subtracting each entry in a column from the maximum value in that column. (B) subtracting each entry in the table from the maximum value in that table. (C) adding each entry in a column from the maximum value in that column. (D) adding maximum value of the table to each entry in the table.

Description : The given maximization assignment problem can be converted into a minimization problem by (A) subtracting each entry in a column from the maximum value in that column. (B) subtracting each entry in the table ... value in that column. (D) adding maximum value of the table to each entry in the table.

Last Answer : (B) subtracting each entry in the table from the maximum value in that table.

What kind of mechanism is to be taken into account for converting a weak entity set into strong entity set in entity-relationship diagram ? (A) Generalization (B) Aggregation (C) Specialization (D) Adding suitable attributes

Description : What kind of mechanism is to be taken into account for converting a weak entity set into strong entity set in entity-relationship diagram ? (A) Generalization (B) Aggregation (C) Specialization (D) Adding suitable attributes

Last Answer : (D) Adding suitable attributes

Compute the value of adding the following two fuzzy integers: A = {(0.3,1), (0.6,2), (1,3), (0.7,4), (0.2,5)} B = {(0.5,11), (1,12), (0.5,13)} Where fuzzy addition is defined as μA+B(z) = maxx+y=z (min(μA(x), μB(x))) Then, f(A+B) is equal to (A) {(0.5,12), (0.6,13), (1,14), (0.7,15), (0.7,16), (1,17), (1,18)} (B) {(0.5,12), (0.6,13), (1,14), (1,15), (1,16), (1,17), (1,18)} (C) {(0.3,12), (0.5,13), (0.5,14), (1,15), (0.7,16), (0.5,17), (0.2,18)} (D) {(0.3,12), (0.5,13), (0.6,14), (1,15), (0.7,16), (0.5,17), (0.2,18)}

Description : Compute the value of adding the following two fuzzy integers: A = {(0.3,1), (0.6,2), (1,3), (0.7,4), (0.2,5)} B = {(0.5,11), (1,12), (0.5,13)} Where fuzzy addition is defined as μA+B(z) = maxx+y=z (min(μA(x), μB( ... ,18)} (D) {(0.3,12), (0.5,13), (0.6,14), (1,15), (0.7,16), (0.5,17), (0.2,18)}

Last Answer : (D) {(0.3,12), (0.5,13), (0.6,14), (1,15), (0.7,16), (0.5,17), (0.2,18)} 

Which one of the following statements regarding enzyme inhibition is correct? (a) Competitive inhibition is seen when a substrate competes with an enzyme for binding to an inhibitor protein. (b) Competitive inhibition is seen when the substrate and the inhibitor compete for the active site on the enzyme. (c) Non-competitive inhibition of an enzyme can be overcome by adding large amount of substrate. (d) Non-competitive inhibitors often bind to the enzyme irreversibly.

Description : Which one of the following statements regarding enzyme inhibition is correct? (a) Competitive inhibition is seen when a substrate competes with an enzyme for binding to an inhibitor protein. (b ... large amount of substrate. (d) Non-competitive inhibitors often bind to the enzyme irreversibly.

Last Answer : (b) Competitive inhibition is seen when the substrate and the inhibitor compete for the active site on the enzyme

Java servlets are an efficient and powerful solution for creating ………….. for the web. A) Dynamic content B) Static content C) Hardware D) Both a and b

Description : Java servlets are an efficient and powerful solution for creating ………….. for the web. A) Dynamic content B) Static content C) Hardware D) Both a and b

Last Answer : A) Dynamic content

Which of the following is not a mechanism that DHCP supports for IP address allocation? A) Automatic allocation B) Static allocation C) Dynamic allocation D) Manual allocation

Description : Which of the following is not a mechanism that DHCP supports for IP address allocation? A) Automatic allocation B) Static allocation C) Dynamic allocation D) Manual allocation

Last Answer : B) Static allocation

The most important and common protocols associated TCP/IP internetwork layer are. i) Internet protocol(IP) ii) Internet control Message Protocol(ICMP) iii) Bootstrap Protocol (BooTP) iv) Dynamic Host Configuration Protocol (DHCP) v) Address Resolution Protocol (ARP) A) i, ii, iii and iv only B) i, iii, iv and v only C) ii, iii, iv and v only D) All i, ii, iii, iv and v

Description : The most important and common protocols associated TCP/IP internetwork layer are. i) Internet protocol(IP) ii) Internet control Message Protocol(ICMP) iii) Bootstrap Protocol (BooTP) iv) Dynamic Host Configuration Protocol (DHCP) v) ... C) ii, iii, iv and v only D) All i, ii, iii, iv and v

Last Answer : D) All i, ii, iii, iv and v

………………….. implies that all subnets obtained from the same subnet mask. A) Static subnetting B) Dynamic subnetting C) Variable length subnetting D) Both B and C

Description : ………………….. implies that all subnets obtained from the same subnet mask. A) Static subnetting B) Dynamic subnetting C) Variable length subnetting D) Both B and C

Last Answer : A) Static subnetting

Which of the following is not a mechanism that DHCP supports for IP address allocation? A) Automatic allocation B) Static allocation C) Dynamic allocation D) Manual allocation

Description : Which of the following is not a mechanism that DHCP supports for IP address allocation? A) Automatic allocation B) Static allocation C) Dynamic allocation D) Manual allocation

Last Answer : A) Automatic allocation

The most important and common protocols associated TCP/IP internetwork layer are. i) Internet Protocol (IP) ii) Internet Control Message Protocol (ICMP) iii) Bootstrap Protocol (BOOTP) iv) Dynamic Host Configuration Protocol (DHCP) V) Address Resolution Protocol (ARP) A) i, ii, iii, and iv only B) ii, iii, iv and v only C) i, iii, iv and v only D) All i, ii, iii, iv and v only

Description : The most important and common protocols associated TCP/IP internetwork layer are. i) Internet Protocol (IP) ii) Internet Control Message Protocol (ICMP) iii) Bootstrap Protocol (BOOTP) iv) Dynamic Host Configuration Protocol (DHCP) V) ... C) i, iii, iv and v only D) All i, ii, iii, iv and v only

Last Answer : D) All i, ii, iii, iv and v only

........ implies that all subnets obtained from the same network use the subnet mask. A) Static subnetting B) Dynamic Subnetting C) Variable length subnetting D) Both B and C

Description : ........ implies that all subnets obtained from the same network use the subnet mask. A) Static subnetting B) Dynamic Subnetting C) Variable length subnetting D) Both B and C

Last Answer : A) Static subnetting

Which of the following algorithm design technique is used in the quick sort algorithm? a) Dynamic programming b) Backtracking c) Divide-and-conquer d) Greedy method

Description : Which of the following algorithm design technique is used in the quick sort algorithm? a) Dynamic programming b) Backtracking c) Divide-and-conquer d) Greedy method

Last Answer : Which of the following algorithm design technique is used in the quick sort algorithm? a) Dynamic programming b) Backtracking c) Divide-and-conquer d) Greedy method

In windows 2000 operating system all the processor-dependent code is isolated in a dynamic link library called (A) NTFS file system (B) Hardware abstraction layer (C) Microkernel (D) Process Manager

Description : In windows 2000 operating system all the processor-dependent code is isolated in a dynamic link library called (A) NTFS file system (B) Hardware abstraction layer (C) Microkernel (D) Process Manager

Last Answer : (B) Hardware abstraction layer

C++ actually supports the following two complete dynamic allocation systems: (A) One defined by C++ and the other not defined by C. (B) One defined by C and one specific to C++. (C) Both are specific to C++ (D) Both of them are improvements of C.

Description : C++ actually supports the following two complete dynamic allocation systems: (A) One defined by C++ and the other not defined by C. (B) One defined by C and one specific to C++. (C) Both are specific to C++ (D) Both of them are improvements of C.

Last Answer : (B) One defined by C and one specific to C++. 

Which of the following statements is true for Branch-and-Bound search? (A) Underestimates of remaining distance may cause deviation from optimal path. (B) Overestimates can’t cause right path to be overlooked. (C) Dynamic programming principle can be used to discard redundant partial paths. (D) All of the above

Description : Which of the following statements is true for Branch-and-Bound search? (A) Underestimates of remaining distance may cause deviation from optimal path. (B) Overestimates can't cause right path to be ... Dynamic programming principle can be used to discard redundant partial paths. (D) All of the above

Last Answer : (C) Dynamic programming principle can be used to discard redundant partial paths.

What is the most appropriate function of Memory Management Unit (MMU) ? (A) It is an associative memory to store TLB (B) It is a technique of supporting multiprogramming by creating dynamic partitions (C) It is a chip to map virtual address to physical address (D) It is an algorithm to allocate and deallocate main memory to a process

Description : What is the most appropriate function of Memory Management Unit (MMU) ? (A) It is an associative memory to store TLB (B) It is a technique of supporting multiprogramming by creating dynamic partitions ... to physical address (D) It is an algorithm to allocate and deallocate main memory to a process 

Last Answer : (C) It is a chip to map virtual address to physical address

The travelling salesman problem can be solved in: (A) Polynomial time using dynamic programming algorithm (B) Polynomial time using branch-and-bound algorithm (C) Exponential time using dynamic programming algorithm or branch-andbound algorithm. (D) Polynomial time using backtracking algorithm.

Description : The travelling salesman problem can be solved in: (A) Polynomial time using dynamic programming algorithm (B) Polynomial time using branch-and-bound algorithm (C) Exponential time using dynamic programming algorithm or branch-andbound algorithm. (D) Polynomial time using backtracking algorithm.

Last Answer : (C) Exponential time using dynamic programming algorithm or branch-andbound algorithm.

The translator which performs macro calls expansion is called : (A) Macro processor (B) Micro pre-processor (C) Macro pre-processor (D) Dynamic linker

Description : The translator which performs macro calls expansion is called : (A) Macro processor (B) Micro pre-processor (C) Macro pre-processor (D) Dynamic linker

Last Answer : (C) Macro pre-processor 

A dynamic RAM has refresh cycle of 32 times per msec. Each refresh operation requires 100 nsec and a memory cycle requires 250 nsec. What percentage of memory’s total operating time is required for refreshes? (A) 0.64 (B) 0.96 (C) 2.00 (D) 0.32

Description : A dynamic RAM has refresh cycle of 32 times per msec. Each refresh operation requires 100 nsec and a memory cycle requires 250 nsec. What percentage of memory’s total operating time is required for refreshes? (A) 0.64 (B) 0.96 (C) 2.00 (D) 0.32

Last Answer : Answer: D Explanation: in 1ms : refresh = 32 times Memory cycle = 1ms/250ns = 106ns/250ns = 4000 times Therefore, % of refresh time = (32 x 100ns)/(4000 x 250ns) = 3200ns/1000000 x 100% = 0.32%

Match the following types of variables with the corresponding programming languages: (a) Static variables (i) Local variables in Pascal (b) Stack dynamic (ii) All variables in APL (c) Explicit heap dynamic (iii) Fortran 77 (d) Implicit heap dynamic (iv) All objects in JAVA Codes: (a) (b) (c) (d) (A) (i) (iii) (iv) (ii) (B) (iv) (i) (iii) (ii) (C) (iii) (i) (iv) (ii) (D) (ii) (i) (iii) (iv)

Description : Match the following types of variables with the corresponding programming languages: (a) Static variables (i) Local variables in Pascal (b) Stack dynamic (ii) All variables in APL (c) Explicit heap dynamic (iii) Fortran 77 (d) Implicit ... (ii) (C) (iii) (i) (iv) (ii) (D) (ii) (i) (iii) (iv)

Last Answer : (C) (iii) (i) (iv) (ii) 

Dijkstra’s algorithm is based on (1) Divide and conquer paradigm (2) Dynamic Programming (3) Greedy Approach (4) Backtracking paradigm

Description : Dijkstra’s algorithm is based on (1) Divide and conquer paradigm (2) Dynamic Programming (3) Greedy Approach (4) Backtracking paradigm

Last Answer : 3

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) 

Distance vector routing algorithm is a dynamic routing algorithm. The routing tables in distance vector routing algorithm are updated ........... (1) automatically (2) by server (3) by exchanging information with neighbour nodes. (4) with back up database

Description : Distance vector routing algorithm is a dynamic routing algorithm. The routing tables in distance vector routing algorithm are updated ........... (1) automatically (2) by server (3) by exchanging information with neighbour nodes. (4) with back up database

Last Answer : Answer: 3

Which of the following statements is false? (A) Optimal binary search tree construction can be performed efficiently using dynamic programming. (B) Breadth-first search cannot be used to find connected components of a graph. (C) Given the prefix and postfix walks of a binary tree, the tree cannot be reconstructed uniquely. (D) Depth-first-search can be used to find the components of a graph. (1) A (2) B (3) C (4) D

Description : Which of the following statements is false? (A) Optimal binary search tree construction can be performed efficiently using dynamic programming. (B) Breadth-first search cannot be used to find connected components of a graph. (C) ... used to find the components of a graph. (1) A (2) B (3) C (4) D 

Last Answer : Answer: 2

Differentiate between static binding and dynamic binding.

Description : Differentiate between static binding and dynamic binding.

Last Answer : Sr. No. Static binding Dynamic binding 1 The linking of function call to function definition at compile time is known as static binding The linking of function call ... 5 Implemented with Function overloading and operator overloading Implemented with virtual function

Suggest the energy conservation techniques in following cases : (i) Motor is running with 70% loaded condition. (ii) Motor is continuously loaded at 50%. (iii) Motor runs with 30% loaded condition but sometimes rises to 50% loading condition. (iv) Motor runs continuously under no-load condition.

Description : Suggest the energy conservation techniques in following cases : (i) Motor is running with 70% loaded condition. (ii) Motor is continuously loaded at 50%. (iii) Motor runs with 30% loaded condition but sometimes rises to 50% loading condition. (iv) Motor runs continuously under no-load condition.

Last Answer : Following are the suggestion the energy conservation techniques in following cases :  (i) Motor is running with 70% loaded condition: Use APFC or IPFC for better power factor improvement. Use ... If possible use low capacity motor for above condition. If possible switch off the motor.

Java Servlet i) is key component of server side java development ii) is a small pluggable extension to a server that enhances functionality iii) runs only in Windows Operating System iv) allows developers to customize any java enabled server A) i, ii & iii are ture B) i, iii & iv are true C) ii, iii & iv are true D) i, ii & iv are true

Description : Java Servlet i) is key component of server side java development ii) is a small pluggable extension to a server that enhances functionality iii) runs only in Windows Operating System iv) allows developers to customize any java ... & iv are true C) ii, iii & iv are true D) i, ii & iv are true

Last Answer : D) i, ii & iv are true