CSCI 340 EXAM 1 CORRECT 100%
What Kind of container is a vector - ANSWERA vector is a sequence container
how do you add an int 10 to the back of a vector v1? - ANSWERv1.push_back(10);
declare a iterator to a vector - ANSWERvector<int>::interator it;
insert 25 at the end of a vector v1 - ANSWERit=v1.end();
v1.insert(it,25);
True of false. Lists have direct access? - ANSWERfalse
Compare vectors and a list. - ANSWERList are store, linked, allow fast insertions
and deletions, but slower access
how do you create a list with four ints with values of 100? - ANSWERlist<int> lst
(4,100);
how to declare a map with a char and an int? - ANSWERmap<char, int> mp1;
What is an arc? - ANSWERone node to the next closest one
what is a path? - ANSWERa unique sequence of ars to connect the node from the
root
how to get mac number of nodes with height - ANSWER2^h -1
how to get the mac number of leave nodes - ANSWER2^(h-1)
get max tree height with N nodes - ANSWERN
what are the properties of a search tree? - ANSWER1. all keys in left subtree are
smaller than root's key
2.all keys in right subtree larger than root key
List is a ____ container - ANSWERsequence
map is a ___conatiner that container __ pairs - ANSWERassociative container.
key pairs.
does map have direct access operator? ([ ]) - ANSWERyes
What type of container is a stack and how is it? (first in what out?) -
ANSWERadaptor and first in last out
What Kind of container is a vector - ANSWERA vector is a sequence container
how do you add an int 10 to the back of a vector v1? - ANSWERv1.push_back(10);
declare a iterator to a vector - ANSWERvector<int>::interator it;
insert 25 at the end of a vector v1 - ANSWERit=v1.end();
v1.insert(it,25);
True of false. Lists have direct access? - ANSWERfalse
Compare vectors and a list. - ANSWERList are store, linked, allow fast insertions
and deletions, but slower access
how do you create a list with four ints with values of 100? - ANSWERlist<int> lst
(4,100);
how to declare a map with a char and an int? - ANSWERmap<char, int> mp1;
What is an arc? - ANSWERone node to the next closest one
what is a path? - ANSWERa unique sequence of ars to connect the node from the
root
how to get mac number of nodes with height - ANSWER2^h -1
how to get the mac number of leave nodes - ANSWER2^(h-1)
get max tree height with N nodes - ANSWERN
what are the properties of a search tree? - ANSWER1. all keys in left subtree are
smaller than root's key
2.all keys in right subtree larger than root key
List is a ____ container - ANSWERsequence
map is a ___conatiner that container __ pairs - ANSWERassociative container.
key pairs.
does map have direct access operator? ([ ]) - ANSWERyes
What type of container is a stack and how is it? (first in what out?) -
ANSWERadaptor and first in last out
