بالنسبة
للاسئلة ال جاتنا
Data structure
The best case for inserting n element in initially empty binary search tree
O(n)
O(n^2)
O(N^3)
none
Inserting the following element in binary search tree in this order 10,5,4,3,2,1,5
The height of the tree is ------
Do the preorder for the above tree
Inserting element in already full memory produce…….
Overflow
Underflow
none
The solution for this equation is (post-order equation and asked for its result)
Homogenous data structure is
Array
Pointer
Record
none
Code in liked list and ask for what is the mistake
[B]The code was not printing the final value[/B]
The best-case for merge sort algorithm is
O(n)
O(nlogn)
O(1)
none
The best case of QuickSelect algorithm is
O(n)
O(sqr(n))
O(1)
none
∑_10^2n▒i is equal to ----
I did not remember the choices
DATABASE
The ellipse shape represent ----- in ER diagram
Attribute
Entity
Key
none
Student and course is example of
M:N relationship
1:M relationship
1:1 relationship
None
Alternate key is :
a candidate key but not primary key
a candidate key and a primary key
none
If y is strong entity, x is weak entity…which is incorrect
The role is removing the strong will remove the weak also and remove the weak will not affect the strong entity
Weak entity is represented by
1:M relationship
M:N relationship
1:1 relationship
none
Row is ------- in formal word
Tuple
Record
Attribute
none
the set of primitted value for each attribute is called
domain
attribute set
none
Redundancy is dangerous as it is a potential threat to ---- data
Integrity
Sufficient
Referential
All of the above
Data model is for describing…
Data, data relationship, semantic and consistence constrain
باقي سؤال في الداتا بيز مو فاكرته لو احد من البنات يفتكره ياريت يحطه
النتوورك كله جا من التست بانك تبع الكتاب اظن ما عدا سؤال واحد او سؤالين
اسئلة النظم بجمعها وانزلكم هي ان شاء الله
بالتوفيق للجميع والله يجعلنا من المقبولين جميعا