اللجنة العلمية مستوى ثالث كهرباء

اسئلة كتبوهن طلاب السنة السابقة

Let P: I am in Bangalore.; Q: I love cricket.; then q -> p(q implies p) is? a) If I love cricket then I am in Bangalore b) If I am in Bangalore then I love cricket c) I am not in Bangalore d) I love cricket Let P: If Sahil bowls, Saurabh hits a century.; Q: If Raju bowls, Sahil gets out on first ball. Now if P is true and Q is false then which of the following can be true? a) Raju bowled and Sahil got out on first ball b) Raju did not bowled c) Sahil bowled and Saurabh hits a century d) Sahil bowled and Saurabh got out Let P: This is a great website, Q: You should not come back here. Then ‘This is a great website and you should come back here.’ is best represented by? a) ~P V ~Q b) P ∧ ~Q c) P V Q d) P ∧ Q In ____ search each element is compared with x till not found. a) Binary b) Sequential c) Merge d) None of the mentioned To sort a list with n elements, the insertion sort begins with the __ element. a) First b) Second c) Third d) Fourth The Worst case occurs in linear search algorithm when ____ a) Item is somewhere in the middle of the array b) Item is not in the array at all c) Item is the last element in the array d) Item is the last element in the array or is not there at all List obtained in third pass of selection sort for list 3, 5, 4, 1, 2 is ___ a) 1, 2, 4, 3, 5 b) 1, 2, 3, 4, 5 c) 1, 5, 4, 3, 2 d) 3, 5, 4, 1, 2 The operation of processing each element in the list is known as _____ a) Sorting b) Merging c) Inserting d) Traversal An Algorithm is ___ a) A procedure for solving a problem b) A problem c) A real life mathematical problem d) None of the mentioned The tree elements are called __ a) vertices b) nodes c) points d) edges If G is a simple graph with n-vertices and n>=3, the condition for G has a Hamiltonian circuit is __ a) the degree of each vertex is at most n/2 b) the degree of each vertex is equal to n c) the degree of every vertex is at least n+1/2 d) the degree of every vertex in G is at least n/2 How many edges are there in a complete graph of order 9? a) 35 b) 36 c) 45 d) 19 How many cycles are there in a wheel graph of order 5? a) 6 b) 10 c) 25 d) 7 What is the minimum height for a binary search tree with 60 nodes? a) 1 b) 3 c) 4 d) 2 Evaluation of expression a/b+c*d-e in postfix notation. a) ab+cd/*-e b) ab/cd*+e- c) abc/+d*-e d) abcd/+*-e Evaluation of 4*5+3/2-9 in prefix notation. a) *45-/32+9 b) *+453/-29 c) -+*45/329 d) *+/45932 What is the postfix expression of (A+B)-C*(D/E))+F? a) A B + C D E / * – F + b) A B C D E + / * F – + c) A B C + * D E / F + – d) A B + C – * D E / F +

هذي المواضيع اللي تم اخذها ب ماده مدخل الى نظريه الحوسبه #نظرية_حوسبة_نظري

نموذج لأختبار المهندسه احلام #نظرية_الحوسبة_تمارين

#نظرية_الحوسبة_تمارين نموذج اختبار نصفي للعام السابق مع المعيدة احلام ضروة

هذول الكتب ارسلهم الدكتور فاروق الفهيدي " حاسبات و تحكم" #نظرية_حوسبة_نظري