1- laboratoriya ishi konteynerlar (collections)

2.9. queue ва priority_queue sinflaridan foydalanib, amaliy dasturlar yaratish


Ishning maqsadi: C++ dasturlash tilida que ва priority_queue sinflari va uning metodlaridan foydalanish ko’nikmalarini egallsh.
Masalaning qo’yilishi:
queue ва priority_queue asosida yaratilgan to’plam elementlarini push(), top(), front(), back() va empty() iteratorlar yordamida qayta ishlash.
2.10. Standart algoritmlar va iteratorlardan foydalanib, amaliy dasturlar yaratish
Ishning maqsadi: C++ dasturlash tilida Standart algoritmlar va iteratorlar sinflari va uning qayta yuklangan turlaridan foydalanish ko’nikmalarini egallsh.
Masalaning qo’yilishi:
Standart algoritmlar va iteratorlar asosida yaratilgan to’plam elementlarini
copy(from, from_end, to),
copy_if(from, from_end, to, pred),
copy_n(from, count, to),
copy_backward(from, from_end, to_end),
move(from, from_end, to),
move_backward(from, from_end, to_end),
swap_ranges(a, a_end, b),
fill(to, to_end, value), fill_n(to, n, value),
generate(to, to_end, gen),
generate(v.begin(), v.end(), rand),
generate_n(to, n, gen), reverse(begin, end),
reverse_copy(from, from_end, to),
find(begin, end, value),
mismatch(a, a_end, b, b_end, eq),
max_element(begin, end, comp),
min_element(begin, end, comp),
for_each(begin, end, fun),
replace(begin, end, old_val,
new_val), remove(begin, end, value),
remove_if(begin, end, pred),
sort(begin, end, comp),
iteratorlar yordamida qayta ishlash.
Laboratoriya mashg’ulotini bajarish bo’yicha variantlar.
Ushbu jadvaldagi vazifalar standart algoritmlardan foydalanilgan holda bajariladi.
6- jadval

№