热门面试题与答案和在线测试
面向面试准备、在线测试、教程与实战练习的学习平台

通过聚焦学习路径、模拟测试和面试实战内容持续提升技能。

WithoutBook 将分主题面试题、在线练习测试、教程和对比指南整合到一个响应式学习空间中。

面试准备

Data Structures 面试题与答案

Test your skills through the online practice test: Data Structures Quiz Online Practice Test

问题 31. What is significance of  ? * ? ?

The symbol ?*? tells the computer that you are declaring a pointer.
Actually it depends on context.
In a statement like int *ptr; the ?*? tells that you are declaring a pointer.
In a statement like int i = *ptr; it tells that you want to assign value pointed to by ptr to variable i.

The symbol ?*? is also called as Indirection Operator/ Dereferencing Operator.

这有帮助吗? 添加评论 查看评论
 

问题 32. Why do we Use a Multidimensional Array?

A multidimensional array can be useful to organize subgroups of data within an array. In addition to organizing data stored in elements of an array, a multidimensional array can store memory addresses of data in a pointer array and an array of pointers.

Multidimensional arrays are used to store information in a matrix form.
e.g. a railway timetable, schedule cannot be stored as a single dimensional array.
One can use a 3-D array for storing height, width and length of each room on each floor of a building.

这有帮助吗? 添加评论 查看评论
 

问题 33. How do you assign an address to an element of a pointer array ?

We can assign a memory address to an element of a pointer array by using the address operator, which is the ampersand (&), in an assignment statement such as ptemployee[0] = &projects[2];

这有帮助吗? 添加评论 查看评论
 

问题 34. Run Time Memory Allocation is known as ?

Allocating memory at runtime is called a dynamically allocating memory. In this, you dynamically allocate memory by using the new operator when declaring the array, for example : int grades[] = new int[10];

这有帮助吗? 添加评论 查看评论
 

问题 35. What method is used to place a value onto the top of a stack?

push() method, Push is the direction that data is being added to the stack. push() member method places a value onto the top of a stack.

这有帮助吗? 添加评论 查看评论
 

用户评价最有帮助的内容:

版权所有 © 2026,WithoutBook。