Save
Upgrade to remove ads
Busy. Please wait.
Log in with Clever
or
show password
Forgot Password?
Don't have an account?  Sign up 
Sign up using Clever
or
Username is available taken
show password


Make sure to remember your password. If you forget it there is no way for StudyStack to send you a reset link. You would need to create a new account. Your email address is only used to allow you to reset your password. See our Privacy Policy and Terms of Service.

Already a StudyStack user? Log In

Reset Password
Enter the associated with your account, and we'll email you a link to reset your password.
focusNode
Didn't know it?
click below
 
Knew it?
click below
Don't Know
Remaining cards (0)
Know
0:00
edit
Embed Code - If you would like this activity on your web page, copy the script below and paste it into your web page.

  Normal Size     Small Size show me how

M1 - CCS0015

DATA STRUCTURES AND ALGORITHMS

QuestionAnswer
It is the representation of the logical relationship existing between individual elements of data. data structure
[T/F] Array is an example of homogenous data structures. true
[T/F] Abstract data type (ADT) stores data and allows various operations on the data to access and change it. true
[T/F] Pointer Variable is the content that is stored in the memory address. true
[T/F] Stack is a special area of memory that is reserved for dynamically allocated variables. false
[T/F] Pointers can be used as parameter to accept an array from outside. true
Supply the code in Blank #5. *p1
[T/F] A Tree is unordered lists which use a ‘hash function’ to insert and search. false; hash tables
[T/F] Queue adds anywhere, removes the highest priority. false; priority queue
[T/F] The new operator eliminates a dynamic variable and returns the memory that the dynamic variable occupied to the freestore manager so that the memory can be reused. false; delete
The address of operator is a unary operator that returns the address of its operand. &
[T/F] Given: int *p; int x; x = 10; p = x is a valid statement. false
It is a memory address of a variable. pointer
[T/F] Typedef is declared within the main program. false
[T/F] You can assign a name definition and then use the type name to declare variables using typedef keyword. true
[T/F] The new operator creates a new dynamic variable of a specified type and returns a pointer that points to this new variable. true
It is is a step by step procedure to solve a particular function. algorithm
[T/F] Program = Algorithms + Data Structures true
[T/F] ADTs support abstraction, encapsulation, and information binding. false
[T/F] There is a name associated with a pointer data type in C++. false
Heap is a special area of memory that is reserved for dynamically allocated variables. true
The following are examples of non-linear list, except: stack
[T/F] Dynamic Array is an array whose size is not specified when you write the program, but is determined while the program is running. true
[T/F] In the declaration, int *p, q, only p is a pointer variable. true
[T/F] When you apply delete to a pointer variable, the dynamic variable to which it is pointing is destroyed. true
[T/F] Pointer is a non-primitive data structure. true
[T/F] The & in front of an ordinary variable produces the address of that variable; that is, it produces a pointer that points to the variable. true
It is is representation of the logical relationship existing between individual elements of data. data structure
[T/F] Pointer Variable is the content that is stored in the memory address. true
Which of the following is the proper way of declaring a pointer variables of type char? char *p, *q;
[T/F] Graphs & Trees are non-linear lists. true
[T/F] Pointers can be used as parameter to accept an array from outside. true
[T/F] Heap is a special area of memory that is reserved for dynamically allocated variables. true
[T/F] Pointers can be used as parameter to accept an array from outside. true
[T/F] If pointer variable pointing to the dynamic variable that was destroyed and becomes undefined is called dangling pointers. true
[T/F] char &ch is valid pointer declaration false
[T/F] Any new dynamic variable created by a program consumes some of the memory in the freespace false
Refer to ADT: What is the data type of the elements that the ADT may accommodate? int
The following are examples of primitive data structures, except. array
[T/F] Abstraction means separating the logical properties from the implementation details. true
[T/F] If there is insufficient available memory to create the new variable, then new returned a special value named NIL. false
[T/F] Primitive data structures are derived from non-primitive data structures. false
Created by: ruskainas
 

 



Voices

Use these flashcards to help memorize information. Look at the large card and try to recall what is on the other side. Then click the card to flip it. If you knew the answer, click the green Know box. Otherwise, click the red Don't know box.

When you've placed seven or more cards in the Don't know box, click "retry" to try those cards again.

If you've accidentally put the card in the wrong box, just click on the card to take it out of the box.

You can also use your keyboard to move the cards as follows:

If you are logged in to your account, this website will remember which cards you know and don't know so that they are in the same box the next time you log in.

When you need a break, try one of the other activities listed below the flashcards like Matching, Snowman, or Hungry Bug. Although it may feel like you're playing a game, your brain is still making more connections with the information to help you out.

To see how well you know the information, try the Quiz or Test activity.

Pass complete!
"Know" box contains:
Time elapsed:
Retries:
restart all cards