| CARVIEW |
Select Language
HTTP/2 200
content-type: text/html; charset=utf-8
date: Wed, 30 Jul 2025 19:05:50 GMT
permissions-policy: interest-cohort=()
strict-transport-security: max-age=31536000; includeSubDomains
server: nginx
cache-control: s-maxage=57384, max-age=0
x-powered-by: Next.js
etag: "mkmh1ee6f6am23"
content-encoding: gzip
x-xss-protection: 1; mode=block
x-content-type-options: nosniff
referrer-policy: no-referrer-when-downgrade
content-security-policy: default-src 'self' http: https: ws: wss: data: blob: 'unsafe-eval' 'unsafe-inline'; frame-ancestors 'self';
vary: Accept-Encoding
x-cache: Miss from cloudfront
via: 1.1 f034286b88541486f791a00fca47970e.cloudfront.net (CloudFront)
x-amz-cf-pop: BOM78-P9
x-amz-cf-id: VJBTtfJS59rdE_Dn3ASp19jTzeyzWR19FVXTHFW36uusf2BCM-qJJQ==
UGC-NET | UGC NET CS 2015 Dec - II | Question 16 
- Courses
- Tutorials
- Practice
- Jobs
Data Structure
Java
Python
HTML
Interview Preparation
Interview Preparation
- Interview Preparation For Software Developers
- Must Coding Questions - Company-wise
- Must Do Coding Questions - Topic-wise
- Company-wise Practice Problems
- Company Preparation
- Competitive Programming
- Software Design-Patterns
- Company-wise Interview Experience
- Experienced - Interview Experiences
- Internship - Interview Experiences
UGC-NET | UGC NET CS 2015 Dec - II | Question 16
Last Updated :
Discuss
Comments
A three dimensional array in ‘C++’ is declared as int A[x][y][z]. Consider that array elements are stored in row major order and indexing begins from 0. 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[0][0][0] + w(y * z * q + z * p + r)
&A[0][0][0] + w(y * z * p + z*q + r)
&A[0][0][0] + w(x * y * p + z * q+ r)
&A[0][0][0] + w(x * y * q + z * p + r)
This question is part of this quiz :
Top MCQs on Array Data Structure with Answers,UGC NET CS 2015 Dec - II,Top 50 Data Structures MCQs with AnswersShare your thoughts in the comments
GeeksforGeeks
We use cookies to ensure you have the best browsing experience on our website. By using our site, you acknowledge that you have read and understood our Cookie Policy & Privacy Policy