In C you can define a pointer to any data type, except another pointer.TrueFalseQUESTION 6If p is defined as int *p, and we use malloc () to allocate memory for *p, where are p and *p allocated?O both p and *p are allocated in stackO both p and *p are allocated in heapp is allocated in stack and *p is allocated in heapO p is allocated in heap and *p is allocated in stack

[as per guidelines we are supposed to answer only 1st question] In c you can define a pointer to any…

Answered: In C you can define a pointer to any…

Engineering

Computer Science

In C you can define a pointer to any data type, except another pointer. True False

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

// the language is c++, please code with common for better understanding, and after your code finished take a screenshot of the execution. Write a C++ program to simulate a stack using an array. You should create an index (the stack pointer) to point into the stack. Initialize it to 0. The stack should grow to location [1], [2], [3], etc. Write a "push (int)" function to push an int onto the top of the stack. Also, write an "int pop" instruction to pop the data that is stored on the top of the stack. The pop instruction must return the popped data. The push and pop instructions should increment and decrement the stack pointer appropriately. Your source should contain calls to your functions demonstrating that it works. Note, that you should do several pushes and several pops to show that data is correctly stored on the stack. You can do this by showing sample runs. Cut and paste the results of the runs into a separate document
A dequeue is a list from which elements can be inserted or deleted at either end a. Develop an array based implementation for dequeue. b. Develop a pointer based implementation dequeue.
Stacks 1- Write a Python function that takes a user input of a word and returns True if it is a Palindrome and returns False otherwise (Your function should use a Stack data structure). A palindrome is a word that can be read the same backward as forward. Some examples of palindromic words are noon, civic, radar, level, rotor, kayak, reviver, racecar, redder, madam, and refer. 2- Write a Python function that takes a stack of integer numbers and returns the maximum value of the numbers in the stack. The stack should have the same numbers before and after calling the function. 3- Write a main function that tests the functions you wrote in 1 and 2 above and make sure that your code is well documented.
String Implement a custom type for representing strings in C++. Allow following operations as well as operators, considering dynamic memory allocation: Operations: • length: determine the length of string upper: convert the string to upper case • lower: convert the string to lower case • at: return character at a given index • substring: extract a substring given start and end • index: find starting index of a substring • compare: compare two strings concat: concatenate/append the argument after current string. Cater cases for different data types such as String, C-string, char, int, float prepend: concatenate/append the argument before current string. Cater cases for different data types such as String, char, int, float Operators: + : for concatenation and prepend operations taking into account different data types and order of argumets = : for assignment • =, !=, : for comparison operations ] : for access to character at a given index >> and << : for output and input a string
WRITE A PROGRAM IN JAVA FOR THE FOLLOWING QUESTION You are to design a simple calculator using the stack data structure to perform additions, subtractions, multiplications and divisions. The user may enter ANY* arithmetic expression in infix using numbers, parentheses and arithmetic operations (+, -, *, /). After an expression is entered, its postfix or prefix notation is displayed and then the result of the expression.
6. Write three functions in C or C++: one that declares a large array stati- cally, one that declares the same large array on the stack, and one that creates a the same large array from the heap. Call each of the subpro- grams a large number of times (at least 100,000) and output the time required by each. Explain the results.
IntroductionWrite a program that simulates managing jobs sent to a printer. The jobs are stored in a linked-list of pointers. Print jobs arrive at time specified by month/day/year plus hour/minute. The jobs are printed on a first come first serve basis. Here is the rest of the specification.Your solutionWrite a C++ program that has the following and does the following:• Write a struct that will represent a node in the linked list (This struct should be declared outside the LinkedLisst class). The data members of the struct should be:a) sequence number: type integerb) document_name: type stringc) month: type integerd) day: type integere) year: type integerf) hour: type integerg) minute: type integerh) owner: type stringi) service_required: type stringj) next: pointer to a node • Write a class whose data members are a head pointer to a node and a pointer to the last node. DO NOT USE C++11 STL containers such as list, dequeuer, queue, stack. The head will represent the start of a linked…
QUESTION: NOTE: This assignment is needed to be done in OOP(c++/java), the assignment is a part of course named data structures and algorithm. A singly linked circular list is a linked list where the last node in the list points to the first node in the list. A circular list does not contain NULL pointers. A good example of an application where circular linked list should be used is a items in the shopping cart In online shopping cart, the system must maintain a list of items and must calculate total bill by adding amount of all the items in the cart, Implement the above scenario using Circular Link List. Do Following: First create a class Item having id, name, price and quantity provide appropriate methods and then Create Cart/List class which holds an items object to represent total items in cart and next pointer Implement the method to add items in the array, remove an item and display all items. Now in the main do the following Insert Items in list Display all items. Traverse…
C plus plus language : We need to have a generic module which reads in file and gives the output in the format which would facilitate other programs to do comparison like the one we saw above to carry out analysis and comparison. Response Required: Write a program that reads a given text, outputs the text as is, and also prints the number of lines and the number of times each letter appears in the text. An uppercase letter and a lowercase letter are treated as being the same; that is, they are tallied together. Since there are 26 letters, we use an array of 26 components to perform the letter count. We also need a variable to store the line count. The text is stored in a file, which we will call textin.txt. The output will be stored in a file, which we will call textout.txt Input: A file containing the text to be processed. Output: A file containing the text, number of lines, and the number of times a letter appears in the text
Write three functions in C or C++: one that declares a large arraystatically, one that declares the same large array on the stack, and onethat creates the same large array from the heap. Call each of thesubprograms a large number of times (at least 100,000) and output thetime required by each. Explain the results.
struct Faculty { int id; char name[30]; char status[10]; //status permanent or visiting Faculty next; }; Assume we have three stacks S, V and P. S is a stack having mix data of visiting and permanent faculty members, V is empty and for visiting faculty memebrs and P is also empty for permanent faculty members. Using primitive functions of stack write a C++ code which reads entire data from S and write on respective stack V or P.
swap_nums seems to work, but not swap_pointers. Fix it. #include <stdio.h>void swap_nums(int *x, int *y) { int tmp; tmp = *x; *x = *y; *y = tmp; } void swap_pointers(char *x, char *y) { char *tmp; tmp = x; x = y; y = tmp; } int main() { int a,b; char *s1,*s2; a = 3; b=4; swap_nums(&a,&b); printf("a is %d\n", a); printf("b is %d\n", b); s1 = "I should print second"; s2 = "I should print first"; swap_pointers(s1,s2); printf("s1 is %s\n", s1); printf("s2 is %s\n", s2); return 0; }