Question 9 Which XXX will avoid a memory leak? class MyClass { public: MyClass(); int value; private: int *ptr; }; MyClass::MyClass () { ptr = new int; *ptr = 0; delete ptr; } int main() { int value = 100; int *ptr1= new int; //XXX ptr1 = &value; O delete value O delete MyClass O delete ptr1 O delete ptr

Question 9 Which XXX will avoid a memory leak? class MyClass { public: MyClass(); int value; private: int ptr; }; MyClass::MyClass () { ptr = new int; ptr = 0; delete ptr; } int main() { int value = 100; int *ptr1= new int; //XXX ptr1 = &value; O delete value O delete MyClass O delete ptr1 O delete ptr

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

I cannot deallocate memory in c++ classes association. class Pages{private:char* pageID;char* pageName; class Users{private:int totalFriends;int totalPages;char* userID;char* userName;char* friendsID;Users** userFriends;Pages** userPages; class SocialNetworkApp{ private:int totalUsers;int totalPages;Users* CurrentUser;Users** usersList;Pages** pagesList; The destructor of the user class cannot be called after the destructor of social network app is called
Consider the following class code segment: class aNewClass { public: ……. private: string name; int *q; int length; }; // constructor aNewClass::aNewClass() { q = new int[10]; // dynamic data …. } Name at least ONE thing you should add/code for the dynamic data in this class. (HINT: Look at the member variables).
Insert coding that make the seat cannot be book by other people if already reserved // create a CLASS public class DemoClass { public static void main(String [] args) { // create a OBJECT DemoClass dc = new DemoClass(); int isle= count['2B','5B','8B','11B','14B','5B','17B','20B','23B','26B','29B']; int window= count['3C','6B','9C','12C','15C','18C','21C','24C','27C','30']; int isle= count['1A','4A','7A','10A','13A','16A','19A','22A','25A','28A',]; stdout.writen("type of seat (Double/single)?:"); String?types-stdin.readLinesync(); if(types--'single') { System.out.println("single"); } else { else if(types--'Double') { stdout.wrilwln("chere(isle/window)?:"); String?hc-stdin.reixli inesysnc(); if(hc--'isle') { system.out.pritln("isle"); stdout.writeln("choose your seat?:"); String ? IsleSeat - stdin.readLineSync(); if(isleSeat -- isle) { isle.remove(IsleSeat); System.out.println("isle"); } } else if(BC -- 'window') { System.out.println("window"); } } } } } OUTPUT:
class A {protected int x1,y1,z; public: A(a, b,c):x1(a+2),y1(b-1),z(c+2) { for(i=0; i<5;i++) x1++;y1++;z++;}}; class B {protected: int x,y; public: B(a,b):x(a+1),y(b+2) { for(i=0; i<5;i++) x+=2; y+=1;}}; class D:public B, virtual public A { private: int a,b; public: D(k,m,n): a(k+n), B(k,m),b(n+2),A(k,m,n) { a=a+1;b=b+1;}}; int main() (Dob(4,2,5);} what the values of x1,y1 and z
**Students.java code** // A Java program to demonstrate use of Comparableimport java.util.*; // A class 'Student' that implements Comparableclass Student implements Comparable<Student>{ private String FirstName; private String LastName; private int StudentID; // Used to sort movies by year public int compareTo(Student a) { return this.StudentID - a.StudentID; } // Constructor public Student(String fm, String ls, int id) { this.FirstName = fm; this.LastName = ls; this.StudentID = id; } // Getter methods for accessing private data public String getFirstName() { return FirstName; } public String getLastName() { return LastName; } public int getStudentID() { return StudentID; }} // Driver classclass Students{ public static void main(String[] args) { ArrayList<Student> list = new ArrayList<Student>(); list.add(new Student("Amir", "Alao", 123456)); list.add(new…
SECTION C(JAVA)Look at the class definitions below and answer the questions based on it:class Node{// attributesint ID;String name; Node left; // left child Node right; // right child}class BinarySearchTree{// attributesNode root;// methodssearch(int key, Node root);void insert(int key, Node root);void delete(int key, Node root);}Write code for a method split(int key, Node root) that divides a binary searchtree into two parts. The split should occur at key and create two new binary searchtrees. Return the root of each resulting tree.Test your code with the input in the worked exampleBELOW IS THE INPUT:// id, name41, notes11, personal61, work30, shopping5, recipes55, proposal70, thesis10, muffins43, draft
class implementation file -- Rectangle.cpp class Rectangle { #include #include "Rectangle.h" using namespace std; private: double width; double length; public: void setWidth (double); void setLength (double) ; double getWidth() const; double getLength() const; double getArea () const; } ; // set the width of the rectangle void Rectangle::setWidth (double w) { width = w; } // set the length of the rectangle void Rectangle::setLength (double l) { length l; //get the width of the rectangle double Rectangle::getWidth() const { return width; // more member functions here
Software Requirements: • Latest version of NetBeans IDE • Java Development Kit (JDK) 8 Procedure: 1. our progras from rhFactor non-static and private. Remove the constructor with two (2) parameters. 2o upply uncapsutation Make bloodType and 2. The names of the public setter and getter methods should be: • setBloodType() • setRhFactor() getBlood Type() getRhFactor() 3. Use the setter methods to accept user input. 4. Display the values by calling the getter methods. Sample Output: Enter blood type of patient: Enter the Rhesus factor (+ or -): O+ is added to the blood bank. Enter blood type of patient: B Enter the Rhesus factor (+ or -): B- is added to the blood bank.
Pick the incorrect statement: O A class can implement more than one interface O A class can extend more than one classes O An interface can extend more than one interfaces O An interface cannot extend a class
Create a class ATM with the following data members and methods: • int totalCash • default parameterized constructor • void setCash(int) • int getCash() In Java
Draw a UML class diagram for the following code: public class ArrayQueue<T> { private Object[] array; private int front; private int rear; private int size; public ArrayQueue(int capacity) { array = new Object[capacity]; front = 0; rear = -1; size = 0; } public boolean isEmpty() { return size == 0; } public void enqueue(T item) { if (size == array.length) { throw new IllegalStateException("Queue is full"); } rear = (rear + 1) % array.length; array[rear] = item; size++; } public T dequeue() { if (isEmpty()) { throw new IllegalStateException("Queue is empty"); } T item = (T) array[front]; array[front] = null; front = (front + 1) % array.length; size--; return item; } public void dequeueAll() { while (!isEmpty()) { dequeue(); } }…
1 2 3 4 5 package polynomials 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 // Scala 3 (DO NOT EDIT OR REMOVE THIS LINE!!!) /* * Your tasks (indicated with 'Task X' below): * * Task 1: * Implement mutable internal state (=current value) for Variables. Complete the 'set' and 'value' methods in class Variable, * and the 'value' method in class Constant. * Task 2: * Implement polynomial value computation using structural recursion. * Complete the 'value methods in all the classes extending Polynomial. * Hint: you may want to take a look at how the method 'asString' * is implemented. * Task 3: * Implement programmer-defined operators to ease working with Polynomial * objects. That is, complete the methods '*' and '+' in class Polynomial * so that you may use the operators '*' and '+' to construct Product and * Sum objects from Polynomial objects. For more on operators in Scala, see here * * http://docs.scala-lang.org/tutorials/tour/operators.html */ /**…