Register

Recent questions tagged array

0 votes
1 answer
151
Ace Test Series: Programming & DS - Array
According to me Option D. Because it should be an error because *("INDIA" + 2 ) = 'D' and we are doing 'D' = 'I' which is not valid so Error ??? But answer is C
According to me Option D.Because it should be an error because *("INDIA" + 2 ) = 'D' and we are doing 'D' = 'I' which is not valid so Error ???But answer is C
User Avatar
1 votes
1 answer
152
Multi-dimensional Array
Can anyone please verify whether I have calculated the addresses correctly or not?
Can anyone please verify whether I have calculated the addresses correctly or not?
User Avatar
0 votes
1 answer
154
#DataStructure Time Complexity in Sorted Array.
Given an sorted array in descending order, what will be the time complexity to delete the minimum element from this array?
Given an sorted array in descending order, what will be the time complexity to delete the minimum element from this array?
User Avatar
0 votes
1 answer
157
C Programming
What would be the equivalent pointer expression for referring the array element a[i][j][k][l]? A. ((((a+i)+j)+k)+l) B. *(*(*(*(a+i)+j)+k)+l) C. (((a+i)+j)+k+l) D. ((a+i)+j+k+l)
What would be the equivalent pointer expression for referring the array element a[i][j][k][l]?A. ((((a+i)+j)+k)+l)B. *(*(*(*(a+i)+j)+k)+l)C. (((a+i)+j)+k+l)D. ...
User Avatar
0 votes
3 answers
158
Ace Test Series: Algorithms - Time Complexity & Array
An array $'A'$ has $n$ distinct integers. What is the tightest time complexity to check $A[i]=i$ for some $i$. Consider all elements of array within range from $1$ to $n$. $O(n^2) $ $O(1)$ $O(n)$ $O(logn)$
An array $'A'$ has $n$ distinct integers. What is the tightest time complexity to check $A[i]=i$ for some $i$. Consider all elements of array within range from $1$ to $n$...
User Avatar
3 votes
2 answers
160
mock test
Given an array $A[-1:6,-2:10] $. The base address of array is $1000$. If every elements take $4$ Bytes for storage . Then compute the address of element $A[5,7]$. Assume row major storage. $1245$ $1348$ $2434$ $1384$
Given an array $A[-1:6,-2:10] $. The base address of array is $1000$. If every elements take $4$ Bytes for storage . Then compute the address of element $A[5,7]$. Assum...
User Avatar
3 votes
1 answer
161
From Geeksforgeeks
Given A, an array of size n, comprised of an increasing sequence of numbers followed immediately by a decreasing one. What is worst case time complexity of optimal algorithm to determine if a given number x is in the array?
Given A, an array of size n, comprised of an increasing sequence of numbers followed immediately by a decreasing one. What is worst case time complexity of optimal algori...
User Avatar
1 votes
0 answers
163
Test Series
User Avatar
3 votes
2 answers
164
3D array
Consider 3 dimensional Array A[90] [30] [40] stored in linear array. If the base address starts at 10, The location of A [20] [20] [30] in case of RMO and CMO are ________. (Assume the first element is stored at A[1][1][1] and each element take 1 memory location)
Consider 3 dimensional Array A[90] [30] [40] stored in linear array. If the base address starts at 10, The location of A [20] [20] [30] in case of RMO and CMO are _______...
User Avatar
3 votes
1 answer
165
arrays location find
User Avatar
3 votes
0 answers
166
array
User Avatar
2 votes
1 answer
167
what is the answer
User Avatar
2 votes
1 answer
168
made easy
Consider 3 dimensional Array A[90] [30] [40] stored in linear array in column major order. If the base address starts at 10, The location of A [20] [20] [30] is ________. (Assume the first element is stored at A[1][1][1] and each element take 1 memory location)
Consider 3 dimensional Array A[90] [30] [40] stored in linear array in column major order. If the base address starts at 10, The location of A [20] [20] [30] is ________....
User Avatar
2 votes
1 answer
172
Array 2D
Consider a lower triangular Matrix A[-25....+25, -25....+25], base address (BA)=0, size of element = 100 Byte. Find the location of a [-20][-21] (Ordering: Row Major)?
Consider a lower triangular Matrix A[-25....+25, -25....+25], base address (BA)=0, size of element = 100 Byte. Find the location of a [-20][-21] (Ordering: Row Major)?
User Avatar
1 votes
1 answer
173
MadeEasy Test Series: Programming & DS - Stack
Options are TI==(P/Q*i-1) Ti==(P/Q*i+1) Ti==(P/Q*(i-1)-1) Ti==(P/Q*(i+1)-1)
Options areTI==(P/Q*i-1)Ti==(P/Q*i+1)Ti==(P/Q*(i-1)-1)Ti==(P/Q*(i+1)-1)
User Avatar
4 votes
3 answers
175
3d array
#include<stdio.h> int main() { int arr[2][3][2]={{{2,4},{7,8},{3,4},},{{2,2},{2,3},{3,4},}}; print("\n%d",**(*arr+1)+2+7); return 0; } plz explain this program, internally how it's stored in memory & how to execute,(forget if any syntactic error in the program)
#include<stdio.h int main() { int arr [3] ={{{2,4},{7,8},{3,4},},{{2,2},{2,3},{3,4},}}; print("\n%d", (*arr+1)+2+7); return 0; } plz explain this program, internally how ...
User Avatar
0 votes
0 answers
177
test book test series
User Avatar
1 votes
0 answers
179
Array
Consider X[1...n] and Y[1...n] be two arrays, each containing n numbers both of which already sorted. What is the time complexity to find the median by combining two arrays? O(n) O(log n) O(nlogn) O(loglog n)
Consider X[1...n] and Y[1...n] be two arrays, each containing n numbers both of which already sorted. What is the time complexity to find the median by combining two arra...
User Avatar
0 votes
1 answer
180
Algo doubt
An array a of unknown size is filled with special symbol let's say # . Time required to find the size of a is: Please give proper explanation
An array a of unknown size is filled with special symbol let's say # . Time required to find the size of a is:Please give proper explanation
User Avatar
Page: