#Rikitarwa

16 tambayoyi

• Menene tsarin bayani kuma menene ciki tsarin bayanai (ADT)?Data Structures#data-structuresJunior›
• Menene jerin aiki (array) kuma menene rikitattun ayyukansa?Data Structures#data-structuresJunior›
• Menene cikin mazzani tsakanin jerin da lissafin da aka haɗa?Data Structures#data-structuresJunior›
• Menene bishiyar tanadit tana tanaditawa (BST) kuma menene hadaddun aikinsa ?Data Structures#treesMiddle›
• Yadda tebur hash ke sarrafa watsiya, halin jiya, da sake girma?Data Structures#hashingMiddle›
• Yaya za ka wakilta jadwal: jerin gida vs matrix gida?Data Structures#graphsMiddle›
• Menene balanced BSTs (AVL da red-black trees) kuma me ya sa suke mahimmanci?Data Structures#treesMiddle›
• Zane ka zaɓar tsarin data daidai don matsala?Data Structures#data-structuresMiddle›
• Menene amortized analysis, ta amfani da misalin keɓaɓɓun gida a cikin sarrafi?Data Structures#complexityMiddle›
• Menene B-trees da B+ trees kuma me ya sa databases suke amfani da su?Data Structures#treesSenior›
• Menene gida'a ma'auni da gida'a masu nauyi, kuma menene matsalolin da suke ginawa?Data Structures#graphsSenior›
• Menene tsarin disjoint-set (union-find) tare da damje jiya da haɗa ta matsala?Data Structures#graphsSenior›
• Menene skip list kuma ta ga aiki na O(log n) neman?Data Structures#data-structuresSenior›
• Segment trees da Fenwick trees (BIT) suna goyan aiki ga mabilis na queries na kadan?Data Structures#treesSenior›
• Yaya za ka ƙera tsarin data mai cikakken O(1)/O(log n) buƙatun?Data Structures#data-structuresSenior›
• Big-O notation nima ne?Algorithms#complexityJunior›