›Menene tsarin bayani kuma menene ciki tsarin bayanai (ADT)?Junior#Data Structures#RikitarwaBayanai →
›Menene jerin aiki (array) kuma menene rikitattun ayyukansa?Junior#Data Structures#RikitarwaBayanai →
›Menene jerin da aka damje a kai daya kuma yaushe za ka yi amfani da ɗaya?Junior#Data StructuresBayanai →
›Menene jirgin_sadarwa/taswira kuma yaya yake bambanta da jeri?Junior#Data Structures#HashingBayanai →
›Menene cikin mazzani tsakanin jerin da lissafin da aka haɗa?Junior#Data Structures#RikitarwaBayanai →
›Menene nau'in data na gaje (ADT) kuma me ya sa aka kewarewa shi daga iyaka sa?Junior#Data StructuresBayanai →
›Menene bishiyar tanadit tana tanaditawa (BST) kuma menene hadaddun aikinsa ?Middle#Trees#RikitarwaBayanai →
›Menene balanced BSTs (AVL da red-black trees) kuma me ya sa suke mahimmanci?Middle#Trees#RikitarwaBayanai →
›Menene buffer na zagaɗe (ring buffer) kuma yaushe za ka yi amfani da ɗaya?Middle#Data StructuresBayanai →
›Yaushe ya kamata ku yi amfani da stack gida da queue? Bada ainihin misalai.Middle#Data StructuresBayanai →
›Menene amortized analysis, ta amfani da misalin keɓaɓɓun gida a cikin sarrafi?Middle#Rikitarwa#Data StructuresBayanai →
›Menene B-trees da B+ trees kuma me ya sa databases suke amfani da su?Senior#Trees#RikitarwaBayanai →
›Menene gida'a ma'auni da gida'a masu nauyi, kuma menene matsalolin da suke ginawa?Senior#Graphs#RikitarwaBayanai →
›Menene tsarin disjoint-set (union-find) tare da damje jiya da haɗa ta matsala?Senior#Graphs#RikitarwaBayanai →
›Segment trees da Fenwick trees (BIT) suna goyan aiki ga mabilis na queries na kadan?Senior#Trees#RikitarwaBayanai →
›Yaya za ka ƙera tsarin data mai cikakken O(1)/O(log n) buƙatun?Senior#Data Structures#RikitarwaBayanai →
