كاتوديمي
Catodemy
Home
Courses
Log in
هياكل البيانات في بايثون للذكاء الاصطناعي
الأسئلة التدريبية
الأسئلة
1
أساسيات بايثون
Start quiz
2
كائنية بايثون
Start quiz
3
تحليل الخوارزميات
Start quiz
4
لينكد ليست
Start quiz
5
Stack, queue, deque (array based)
Start quiz
6
Hash Tables
Start quiz
7
Trees
Start quiz
8
Recursion
Start quiz
9
Sorting algorithms
Start quiz
10
Graphs
Start quiz
Toggle Sidebar
هياكل البيانات في بايثون للذكاء الاصطناعي
الأسئلة التدريبية
لينكد ليست
1
/
35
Insertion at the beginning is expensive.
The memory usage is always less than an array.
It has a fixed size.
Efficient access to an element by a numeric index is not possible.
Show explanation
Solved
Flag for review
1 correct answer left
Reveal remaining answers
Previous
Next
Previous
Next
This quiz has 35 questions. This question has a single correct answer. Good luck!
