Array is A) Primary data type B) Pointer data type C) Heterogeneous data type D) Homogenous data type

Array is  
A) Primary data type
B) Pointer data type
C) Heterogeneous data type
D) Homogenous data type
by

1 Answer

Answer :

D) Homogenous data type
by

Related questions

What does the following declaration mean ? int (*ptr) [10]; (A) ptr is an array of pointers of 10 integers. (B) ptr is a pointer to an array of 10 integers. (C) ptr is an array of 10 integers. (D) none of the above.

Description : What does the following declaration mean ? int (*ptr) [10]; (A) ptr is an array of pointers of 10 integers. (B) ptr is a pointer to an array of 10 integers. (C) ptr is an array of 10 integers. (D) none of the above.

Last Answer : (B) ptr is a pointer to an array of 10 integers.

What does the following expression means ? char *(*(* a[N]) ( )) ( ); (A) a pointer to a function returning array of n pointers to function returning character pointers. (B) a function return array of N pointers to functions returning pointers to characters (C) an array of n pointers to function returning pointers to characters (D) an array of n pointers to function returning pointers to functions returning pointers to characters.

Description : What does the following expression means ? char *(*(* a[N]) ( )) ( ); (A) a pointer to a function returning array of n pointers to function returning character pointers. (B) a ... to characters (D) an array of n pointers to function returning pointers to functions returning pointers to characters.

Last Answer : Answer: A,B,C,D

what do you mean by homogenous and heterogeneous equilibrium?

Description : what do you mean by homogenous and heterogeneous equilibrium?

Last Answer : Ans. Homogenous;-It is that equilibrium reaction in which all the reactants and the products are in the same phase. Heterogeneous equilibrium: - It is that equilibrium reaction in which all the reactants and the products are in two or more phases

In chamber process of sulphuric acid manufacture in industry, the gas phase oxidation of SO2 to SO3 is accomplished by a __________ reaction. (A) Non-catalytic homogeneous (B) Non-catalytic heterogeneous (C) Catalytic homogenous (D) Catalytic heterogeneous

Description : In chamber process of sulphuric acid manufacture in industry, the gas phase oxidation of SO2 to SO3 is accomplished by a __________ reaction. (A) Non-catalytic homogeneous (B) Non-catalytic heterogeneous (C) Catalytic homogenous (D) Catalytic heterogeneous

Last Answer : (C) Catalytic homogenous

Is xylem (or phloem) homogenous tissue or heterogeneous tissue?

Description : Is xylem (or phloem) homogenous tissue or heterogeneous tissue?

Last Answer : Xylem and phloem both are heterogeneous tissue and are made up of different type of cellular elements.

Competition -oriented pricing is: A)used when costs and revenues are considered secondary to competitors' prices. B)not useful as a method of increasing or maintaining market share. C)of little use if the competing products are homogenous. D)most often used when competing products are heterogeneous.

Description : Competition-oriented pricing is: A)used when costs and revenues are considered secondary to competitors' prices. B)not useful as a method of increasing or maintaining market share. C)of little use if the competing products are homogenous. D)most often used when competing products are heterogeneous.

Last Answer : A)used when costs and revenues are considered secondary to competitors' prices.

In homogenous coordinate system (x, y, z) the points with z = 0 are called (A) Cartesian points (B) Parallel points (C) Origin point (D) Point at infinity

Description : In homogenous coordinate system (x, y, z) the points with z = 0 are called (A) Cartesian points (B) Parallel points (C) Origin point (D) Point at infinity

Last Answer : (D) Point at infinity

What type of data is: a=[(1,1),(2,4),(3,9)]? a) Array of tuples b) List of tuples c) Tuples of lists d) Invalid type

Description : What type of data is: a=[(1,1),(2,4),(3,9)]? a) Array of tuples b) List of tuples c) Tuples of lists d) Invalid type

Last Answer : b) List of tuples

Equivalence partitioning is a .................. method that divides the input domain of a program into classes of data from which test cases can be derived. (A) White-box testing (B) Black-box testing (C) Orthogonal array testing (D) Stress testing

Description : Equivalence partitioning is a .................. method that divides the input domain of a program into classes of data from which test cases can be derived. (A) White-box testing (B) Black-box testing (C) Orthogonal array testing (D) Stress testing

Last Answer : (B) Black-box testing

Write a program to search a number from an array using pointer to array.

Description : Write a program to search a number from an array using pointer to array.

Last Answer : #include<iostream.h> #include<conio.h> void main() { int a[5],i,*a1,no,flag=1; clrscr(); a1=&a[0]; cout<<"\nEnter array elements :"<<endl; for(i=0;i<5 ... =0) { cout<<"\n\t Number is not present.... "; } getch(); }

Write a program in C++ to search an element from an array using pointer.

Description : Write a program in C++ to search an element from an array using pointer.

Last Answer : #include<iostream.h> #include<conio.h> void main() { int a[10], n, i,*p, flag=0, x; clrscr(); cout<<"Enter no. of array elements \n"; cin>>n; cout<< ... } if(flag==0) cout<<x<<"is not found \n"; getch(); }

The dereferencing operator ……… is used when the object itself is used width in the member pointer. A) ->* B) .* C) Any of the above D) None of the above

Description : The dereferencing operator ……… is used when the object itself is used width in the member pointer. A) ->* B) .* C) Any of the above D) None of the above

Last Answer : B) .*

Match the following a) : : i) Pointer to member declarator b) : :* ii) Pointer to member operator c) ->* iii) Scope resolution operator A) a-ii, b-iii, c-i B) a-iii, b-i, c-ii C) a-i b-ii, c-iii D) a-iii, b-ii, c-i

Description : Match the following a) : : i) Pointer to member declarator b) : :* ii) Pointer to member operator c) ->* iii) Scope resolution operator A) a-ii, b-iii, c-i B) a-iii, b-i, c-ii C) a-i b-ii, c-iii D) a-iii, b-ii, c-i

Last Answer : B) a-iii, b-i, c-ii

A pointer can hold A) Single address at a time B) Two addresses at a time C) Number of addresses at a time D) No address

Description : A pointer can hold A) Single address at a time B) Two addresses at a time C) Number of addresses at a time D) No address

Last Answer : A) Single address at a time

Pointer holds A) Value of variable B) Address of variable C) Value and address of variable D) Always null

Description : Pointer holds A) Value of variable B) Address of variable C) Value and address of variable D) Always null

Last Answer : B) Address of variable

In a queue, the initial values of front pointer f rare pointer r should be ….. and …….. respectively. A) 0 and 1 B) 0 and -1 C) -1 and 0 D) 1 and 0

Description : In a queue, the initial values of front pointer f rare pointer r should be ….. and …….. respectively. A) 0 and 1 B) 0 and -1 C) -1 and 0 D) 1 and 0

Last Answer : B) 0 and -1

If the queue is implemented with a linked list, keeping track of a front pointer and a rear pointer, which of these pointers will change during an insertion into a non-empty queue? (A) Neither of the pointers change (B) Only front pointer changes (C) Only rear pointer changes (D) Both of the pointers changes

Description : If the queue is implemented with a linked list, keeping track of a front pointer and a rear pointer, which of these pointers will change during an insertion into a non-empty queue? (A) Neither of ... (B) Only front pointer changes (C) Only rear pointer changes (D) Both of the pointers changes

Last Answer : (C) Only rear pointer changes

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. 

The order of a leaf node in a B+ tree is the maximum number of children it can have. Suppose that block size is 1 kilobytes, the child pointer takes 7 bytes long and search field value takes 14 bytes long. The order of the leaf node is ............ (1) 16 (2) 63 (3) 64 (4) 65

Description : The order of a leaf node in a B+ tree is the maximum number of children it can have. Suppose that block size is 1 kilobytes, the child pointer takes 7 bytes long and search field value takes 14 bytes long. The order of the leaf node is ............ (1) 16 (2) 63 (3) 64 (4) 65

Last Answer : Answer: All

What is the drawback of an array?

Description : What is the drawback of an array?

Last Answer : A: Its size cannot be changed.

To accept 100 different values into the array we require A) Loop B) If condition C) Function D) Structure

Description : To accept 100 different values into the array we require A) Loop B) If condition C) Function D) Structure

Last Answer : A) Loop

Float a[15], what is the size of array? A) 17 B) 14 C) 15 D) 16

Description : Float a[15], what is the size of array? A) 17 B) 14 C) 15 D) 16

Last Answer : 16

State True or False. i) Binary search is used for searching in a sorted array. ii) The time complexity of binary search is O(logn). A) True, False B) False, True C) False, False D) True, True

Description : State True or False. i) Binary search is used for searching in a sorted array. ii) The time complexity of binary search is O(logn). A) True, False B) False, True C) False, False D) True, True

Last Answer : D) True, True

If the given input array is sorted or nearly sorted, which of the following algorithm gives the best performance? a) Insertion sort b) Selection sort c) Quick sort d) Merge sort

Description : If the given input array is sorted or nearly sorted, which of the following algorithm gives the best performance? a) Insertion sort b) Selection sort c) Quick sort d) Merge sort

Last Answer : a) Insertion sort

When an array is passed as a parameter to a function which of the following statements is correct? (A) The function can change values in the original array. (B) The function cannot change values in the original array. (C) Results in compilation error. (D) Results in runtime error.

Description : When an array is passed as a parameter to a function which of the following statements is correct? (A) The function can change values in the original array. (B) The function cannot change values in the original array. (C) Results in compilation error. (D) Results in runtime error.

Last Answer : (A) The function can change values in the original array.

How many values can be held by an array A(-1,m;1 ,m) ? (A) m (B) m2 (C) m(m+l) (D) m(m+2)

Description : How many values can be held by an array A(-1,m;1 ,m) ? (A) m (B) m2 (C) m(m+l) (D) m(m+2)

Last Answer : (D) m(m+2) Explanation: Total number of values =m(m+2). Because -1 to m, m+2 values and 1 to m, m values

Consider an array A[20, 10], assume 4 words per memory cell and the base address of array A is 100. What is the address of A[11, 5] ? Assume row major storage. (A) 560 (B) 565 (C) 570 (D) 575

Description : Consider an array A[20, 10], assume 4 words per memory cell and the base address of array A is 100. What is the address of A[11, 5] ? Assume row major storage. (A) 560 (B) 565 (C) 570 (D) 575

Last Answer : (A) 560

When an array is passed as parameter to a function, which of the following statements is correct ? (A) The function can change values in the original array. (B) In C, parameters are passed by value, the function cannot change the original value in the array. (C) It results in compilation error when the function tries to access the elements in the array. (D) Results in a run time error when the function tries to access the elements in the array.

Description : When an array is passed as parameter to a function, which of the following statements is correct ? (A) The function can change values in the original array. (B) In C, parameters are passed by value, ... . (D) Results in a run time error when the function tries to access the elements in the array.

Last Answer : (A) The function can change values in the original array.

The average case occurs in the Linear Search Algorithm when: (A) The item to be searched is in some where middle of the Array (B) The item to be searched is not in the array (C) The item to be searched is in the last of the array (D) The item to be searched is either in the last or not in the array

Description : The average case occurs in the Linear Search Algorithm when: (A) The item to be searched is in some where middle of the Array (B) The item to be searched is not in the array (C) The item to be searched is in the last of the array (D) The item to be searched is either in the last or not in the array

Last Answer : (A) The item to be searched is in some where middle of the Array

A three dimensional array in ‘C’ is declared as int A[x][y][z]. Here, the address of an item at the location A[p][q][r] can be computed as follows (where w is the word length of an integer): (A) &A[0][0][0]+w(y*z*q+z*p+r) (B) &A[0][0][0]+w(y*z*p+z*q+r) (C) &A[0][0][0]+w(x*y*p+z*q+r) (D) &A[0][0][0]+w(x*y*q+z*p+r)

Description : A three dimensional array in C' is declared as int A[x][y][z]. Here, the address of an item at the location A[p][q][r] can be computed as follows (where w is the word length of an integer): (A) &A[0][0][0]+w(y*z*q+z*p+r) (B) &A ... *q+r) (C) &A[0][0][0]+w(x*y*p+z*q+r) (D) &A[0][0][0]+w(x*y*q+z*p+r)

Last Answer : Answer: B

Which one of the following array represents a binary max-heap? (A) [26, 13, 17, 14, 11, 9, 15] (B) [26, 15, 14, 17, 11, 9, 13] (C) [26, 15, 17, 14, 11, 9, 13] (D) [26, 15, 13, 14, 11, 9, 17]

Description : Which one of the following array represents a binary max-heap? (A) [26, 13, 17, 14, 11, 9, 15] (B) [26, 15, 14, 17, 11, 9, 13] (C) [26, 15, 17, 14, 11, 9, 13] (D) [26, 15, 13, 14, 11, 9, 17]

Last Answer : (C) [26, 15, 17, 14, 11, 9, 13]

Which of the following is true for computation time in insertion, deletion and finding maximum and minimum element in a sorted array? (1) Insertion-O(1), Deletion-O(1), Maximum-O(1), Minimum-O(1) (2) Insertion-O(1), Deletion-O(1), Maximum-O(n), Minimum-O(n) (3) Insertion-O(n), Deletion-O(n), Maximum-O(1), Minimum-O(1) (4) Insertion-O(n), Deletion-O(n), Maximum-O(n), Minimum-O(n)

Description : Which of the following is true for computation time in insertion, deletion and finding maximum and minimum element in a sorted array? (1) Insertion-O(1), Deletion-O(1), Maximum-O(1), Minimum-O(1) (2) Insertion-O(1), ... (1), Minimum-O(1) (4) Insertion-O(n), Deletion-O(n), Maximum-O(n), Minimum-O(n)

Last Answer : Answer: 3

Which of the following cannot be passed to a function in C++? (1) Constant (2) Structure (3) Array (4) Header file

Description : Which of the following cannot be passed to a function in C++? (1) Constant (2) Structure (3) Array (4) Header file

Last Answer : Answer: 4

he primary goal of the ………………….. protocol is to provide a private channel between communicating application, which ensures privacy of data authentication of the partners, and integrity. A) SSL B) ESP C) TSL D) PSL

Description : he primary goal of the ………………….. protocol is to provide a private channel between communicating application, which ensures privacy of data authentication of the partners, and integrity. A) SSL B) ESP C) TSL D) PSL

Last Answer : A) SSL

In FDDI, data normally travel on .................. A) The primary ring B) The Secondary ring C) Both rings D) Neither ring

Description : In FDDI, data normally travel on .................. A) The primary ring B) The Secondary ring C) Both rings D) Neither ring

Last Answer : A) The primary ring

Which of the following statements is FALSE about weak entity set ? (A) Weak entities can be deleted automatically when their strong entity is deleted. (B) Weak entity set avoids the data duplication and consequent possible inconsistencies caused by duplicating the key of the strong entity. (C) A weak entity set has no primary keys unless attributes of the strong entity set on which it depends are included. (D) Tuples in a weak entity set are not partitioned according to their relationship with tuples in a strong entity set.

Description : Which of the following statements is FALSE about weak entity set ? (A) Weak entities can be deleted automatically when their strong entity is deleted. (B) Weak entity set avoids the data ... weak entity set are not partitioned according to their relationship with tuples in a strong entity set.

Last Answer : (D) Tuples in a weak entity set are not partitioned according to their relationship with tuples in a strong entity set.

Consider the following database table : Create table test( one integer, two integer, primary key(one), unique(two), check(one≥1 and ≤10), check(two≥1 and ≤5) ); How many data records/tuples atmost can this table contain ? (A) 5 (B) 10 (C) 15 (D) 50

Description : Consider the following database table : Create table test( one integer, two integer, primary key(one), unique(two), check(one≥1 and ≤10), check(two≥1 and ≤5) ); How many data records/tuples atmost can this table contain ?  (A) 5 (B) 10 (C) 15 (D) 50

Last Answer : (A) 5 

In a relational database model, NULL values can be used for all but which one of the following? (A) To allow duplicate tuples in the table by filling the primary key column(s) with NULL. (B) To avoid confusion with actual legitimate data values like 0 (zero) for integer columns and ‘’ (the empty string) for string columns. (C) To leave columns in a tuple marked as “unknown” when the actual value is unknown. (D) To fill a column in a tuple when that column does not really “exist” for that particular tuple.

Description : In a relational database model, NULL values can be used for all but which one of the following? (A) To allow duplicate tuples in the table by filling the primary key column(s) with NULL. (B) To ... D) To fill a column in a tuple when that column does not really exist for that particular tuple.

Last Answer : (A) To allow duplicate tuples in the table by filling the primary key column(s) with NULL.

What is the primary disadvantage of the pointer arrangement for indicating coil rotation?

Description : What is the primary disadvantage of the pointer arrangement for indicating coil rotation?

Last Answer : Coil balance.

What is the primary disadvantage of the pointer arrangement for indicating coil rotation?

Description : What is the primary disadvantage of the pointer arrangement for indicating coil rotation?

Last Answer : Coil balance.

The color model uses varying intensities of (R)ed, (G)reen, and (B)lue light are added together in to reproduce a broad array of colors. A. BGR Color B. Primary Color C. Analogous Color D. RGB Color

Description : The color model uses varying intensities of (R)ed, (G)reen, and (B)lue light are added together in to reproduce a broad array of colors. A. BGR Color B. Primary Color C. Analogous Color D. RGB Color

Last Answer : C. Analogous Color

Which co-ordinates allow common vector operations such as translation, rotation,scaling and perspective projection to be represented as a matrix by which the vector is multiplied? a.vector co-ordinates b.3D co-ordinates c.affine co-ordinates d.homogenous co-ordinates

Description : Which co-ordinates allow common vector operations such as translation, rotation,scaling and perspective projection to be represented as a matrix by which the vector is multiplied? a.vector co-ordinates b.3D co-ordinates c.affine co-ordinates d.homogenous co-ordinates

Last Answer : d.homogenous co-ordinates

WHAT IS A HOMOGENOUS SOCIETY ? -SST 10th

Description : WHAT IS A HOMOGENOUS SOCIETY ? -SST 10th

Last Answer : A society that has similar kinds of people, especially where there are no significant etnic difference.

What is a homogenous society ? -SST 10th

Description : What is a homogenous society ? -SST 10th

Last Answer : A society that has similar kinds of people, especially where there are no significant ethnic differences. For example, Germany and Sweden.

CH4 is a member of which homogenous class ?

Description : CH4 is a member of which homogenous class ?

Last Answer : CH4 is a member of the alkene family.

What is homogenous plant ?

Description : What is homogenous plant ?

Last Answer : All the plants which cannot be divided into roots , stems and leaves are homogenous plants.

What is homogenous class ?

Description : What is homogenous class ?

Last Answer : Organic compounds with the same functional and similar properties are collectively called homologous class.

Assertion: The antibodies separated from serum are homogenous. Reason : Monoclonal antibodies are homogenous immunological reagents.

Description : Assertion: The antibodies separated from serum are homogenous. Reason : Monoclonal antibodies are homogenous immunological reagents.

Last Answer : Assertion: The antibodies separated from serum are homogenous. Reason : Monoclonal antibodies are ... both the assertion and reason are false

Assertion :- A gas mixed with another gas forms a colloidal solution. Reason :- Mixture of gases is homogenous system.

Description : Assertion :- A gas mixed with another gas forms a colloidal solution. Reason :- Mixture of gases is homogenous system.

Last Answer : Assertion :- A gas mixed with another gas forms a colloidal solution. Reason :- Mixture of gases is ... . D. If both Assertion & Reason are False.