Register

Recent questions tagged array

6 votes
5 answers
95
ISRO2020-61
What is the output of the code given below? # include<stdio.h> int main() { char name[]="satellites"; int len; int size; len= strlen(name); size = sizeof(name); printf("%d",len*size); return 0; } $100$ $110$ $40$ $44$
What is the output of the code given below?# include<stdio.h int main() { char name[]="satellites"; int len; int size; len= strlen(name); size = sizeof(name); printf("%d"...
User Avatar
1 votes
1 answer
96
IIIT BLR TEST 1 : ALGORITHMS 3
Given an array of ( both positive and negative ) integers, $a_0,a_1,….a_{n-1}$ and $l, 1<l<n$. Design a linear time algorithm to compute the maximum product subarray, whose length is atmost $l$.
Given an array of ( both positive and negative ) integers, $a_0,a_1,….a_{n-1}$ and $l, 1<l<n$.Design a linear time algorithm to compute the maximum product subarray, wh...
User Avatar
2 votes
1 answer
97
Vani Qs Bank Algorithms
.Given an array of distinct integers A[1, 2,…n]. Find the tightest upper bound to check the existence of any index i for which A[i]=i. Ans should be O(log n) right by doing binary search ??
.Given an array of distinct integers A[1, 2,…n]. Find the tightest upper bound to check the existence of any index i for which A[i]=i.Ans should be O(log n) right by do...
User Avatar
0 votes
1 answer
99
Self-doubt
How to improve cache hit rate in case of transfer of element from 2-D array to matrix.? (Consider the column major order in 2D array)
How to improve cache hit rate in case of transfer of element from 2-D array to matrix.? (Consider the column major order in 2D array)
User Avatar
0 votes
0 answers
100
Cache Memory and Arrays
Can someone please provide a link to an article or a video explaining cache and arrays concept. Im having a hard time understanding that concept.
Can someone please provide a link to an article or a video explaining cache and arrays concept. Im having a hard time understanding that concept.
User Avatar
1 votes
0 answers
101
Locality of Rference(OS+DS) (ACE)
An OS uses virtual memory with paging technique for memory allocation. Which of the following searching technique on given data structure use locality of reference? Linear search on linked list Binary search on array Linear search on array Binary search on linked list
An OS uses virtual memory with paging technique for memory allocation. Which of the following searching technique on given data structure use locality of reference?Linear...
User Avatar
0 votes
1 answer
102
ARRAY
A Sorted array of n elements contains 0 and 1 to find out majority of 0 and 1.How much time it will take??? and please explain Meaning -majority of 0 and 1??
A Sorted array of n elements contains 0 and 1 to find out majority of 0 and 1.How much time it will take???and please explain Meaning -majority of 0 and 1??
User Avatar
1 votes
2 answers
103
Array
Tell me the difference : &(arr+1) and &arr+1
Tell me the difference :&(arr+1) and &arr+1
User Avatar
14 votes
6 answers
104
GATE CSE 2019 | Question: 24
Consider the following C program: #include <stdio.h> int main() { int arr[]={1, 2, 3, 4, 5, 6, 7, 8, 9, 0, 1, 2, 5}, *ip=arr+4; printf(“%d\n”, ip[1]); return 0; } The number that will be displayed on execution of the program is _______
Consider the following C program:#include <stdio.h int main() { int arr[]={1, 2, 3, 4, 5, 6, 7, 8, 9, 0, 1, 2, 5}, *ip=arr+4; printf(“%d\n”, ip ); return 0; }The numb...
User Avatar
1 votes
1 answer
105
self doubt
Main memory=512 words. block size=8 words. cache size =32 words There is an array A[100] and each element is 4 words then what is the hit ratio for the following loop. for(i=0;i<=9;i++) { for(j=0;j<=9;j=j+2) { A[i][j]=A[i][j]+20; } }
Main memory=512 words.block size=8 words.cache size =32 wordsThere is an array A[100] and each element is 4 words then what is the hit ratio for the following loop.for...
User Avatar
0 votes
1 answer
108
UPPCL AE 2018:15
Match all items in $\text{Group 1}$ with the $\textbf{best}$ match from the options given in $\text{Group 2}.$ ... $\text{P-4, Q-3, R-2, S-1}$ $\text{P-3, Q-4, R-1, S-2}$
Match all items in $\text{Group 1}$ with the $\textbf{best}$ match from the options given in $\text{Group 2}.$$$\begin{array}{|l|l|} \hline \qquad \quad \textbf{Group 1} ...
User Avatar
5 votes
1 answer
109
MadeEasy Subject Test 2019: Programming & DS - Programming In C
someone please explain this: how does a+1 differs from &a+1 in above code? detailed explanation would be of great help as they incremented &a by 6 and NOT 1
someone please explain this:how does a+1 differs from &a+1 in above code?detailed explanation would be of great help as they incremented &a by 6 and NOT 1
User Avatar
0 votes
0 answers
112
MADE EASY
Consider an array A[100] and each element occupies 4 word a 32-word cache is used and divided into an 8-word block What is the hit ratio for for(i=0;i<100;i++) x=A[i]+100; No of time block 0 is modified.
Consider an array A[100] and each element occupies 4 word a 32-word cache is used and divided into an 8-word blockWhat is the hit ratio for for(i=0;i<100;i++...
User Avatar
0 votes
1 answer
114
Self Doubt
if array declared size is larger than values initialised. Then what value rest memory elements have , 0 or garbage?
if array declared size is larger than values initialised. Then what value rest memory elements have , 0 or garbage?
User Avatar
1 votes
2 answers
116
MadeEasy Test Series 2019: Programming & DS - Arrays
Given a 2D array A[40….95, 40...95] in lower triangular representation, size of each element is 1 Byte Array implemented in row major order, base address is 1000 Address of A[66][50] ?
Given a 2D array A[40….95, 40...95] in lower triangular representation, size of each element is 1 ByteArray implemented in row major order, base address is 1000Address ...
User Avatar
0 votes
0 answers
119
ME- OTS 2
Better than O(n) exists ?
Better than O(n) exists ?
User Avatar
0 votes
1 answer
120
Interview Question
Given an Unsorted array, Find maximum in less than O(n) time? How can we do this?
Given an Unsorted array, Find maximum in less than O(n) time?How can we do this?
User Avatar
Page: