what is smart pointer & use of the smart pointer ???
- 2 Answers
- 6708 Views
- I also Faced
- E-Mail Answers
Answers were Sorted based on User's Feedback
Answer / satya
Smart pointers are objects which store pointers to
dynamically allocated (heap) objects. They behave much like
built-in C++ pointers except that they automatically delete
the object pointed to at the appropriate time. Smart
pointers are particularly useful in the face of exceptions
as they ensure proper destruction of dynamically allocated
objects. They can also be used to keep track of dynamically
allocated objects shared by multiple owners.
| Is This Answer Correct ? | 16 Yes | 0 No |
Answer / swarna sekhar dhar
Smart pointers have been the subject of hecatombs of code
written and rivers of ink consumed by programmers and
writers around the world. Perhaps the most popular,
intricate, and powerful C++ idiom, smart pointers are
interesting in that they combine many syntactic and semantic
issues. This chapter discusses smart pointers, from their
simplest aspects to their most complex ones and from the
most obvious errors in implementing them to the subtlest
ones—some of which also happen to be the most gruesome.
In brief, smart pointers are C++ objects that simulate
simple pointers by implementing operator-> and the unary
operator*. In addition to sporting pointer syntax and
semantics, smart pointers often perform useful tasks—such as
memory management or locking—under the covers, thus freeing
the application from carefully managing the lifetime of
pointed-to objects
| Is This Answer Correct ? | 2 Yes | 1 No |
Explain the use of vtable.
What does ios :: app do in c++?
Define a constructor - what it is and how it might be called (2 methods)?
What is the difference between the functions rand(), random(), srand() and randomize()?
When must you use a pointer rather than a reference?
What it is and how it might be called (2 methods).
What is a static member?
What is c strings syntax?
What is encapsulation in c++ with example?
Mention the storage classes in c++.
Can a built-in function be recursive?
How can you quickly find the number of elements stored in a static array?
STL 
