လိုက္စုထား သေလာက္ Tutorial ေမးခြန္းေလးေတြ တင္ေပးမယ္ေနာ္.............  အေျဖေတာ ့မေသခ်ာမွာ စိုးလို ့မတင္ေပးေသးဘူး.................  ဆရာ မဆီက ရမွ တင္ေပးမယ္ေနာ္ 203 ကပို အေရးၾကီးပါတယ္ ေမးခြန္းေဟာင္းလဲ မရွိဘူး tutorial  ေမးခြန္းေလးေတြ ၾကည့္ၿပီး ေမးခြန္းပံုစံနဲ ့ၾကည့္ရမွာပါ  အေျဖကို ဆက္ဆက္တင္ေပးပါမယ္ေနာ္ အခု ့မေသခ်ာမွ စိုးလုိ ့ပါ ပထမႏွစ္ဝက္တုန္းက OS အေျခ အေန မေကာင္းတဲ ့သူေတြ ဆို ပိုၾကိဳးစားသင့္တယ္
                                        Tutorial
                                          203
1:Two sorted arrays A={7,23,39,81} and B={14,47,55,62,74,95} will be merged into an array C.Decribe the comparisons necessary to determine which element will be copied in merging operation.


2:Write the status of the list a =22,55,44,66 at the end pass at insertion sort


3:Write True or False
(a)In the selection sort,the largest keys accumulate on the left
(b)In the selection sort,items with indices less than or equal to outer are sorted
(c)In Priority queue,the front of the queue is always at the top of the array at items.