IT प्रवेश – B.Sc. CSIT, BIT, BCA
IT प्रवेश – B.Sc. CSIT, BIT, BCA
IT Entrance – B.Sc. CSIT, BIT & BCA · २,६०७ प्रश्न
२,६०७ प्रश्न उपलब्ध। मोड छान्नुहोस्:
IT प्रवेश: प्रश्न र उत्तर
सही लागेको विकल्पमा थिच्नुहोस्। सही भए हरियो, गलत भए रातो देखिन्छ; ३ सेकेन्डपछि सही उत्तर र व्याख्या देखिन्छ।
सही: ० / ०
-
In an E-R diagram, an entity set is represented by a:
सही उत्तर: क) Rectangle
Rectangles represent entity sets, ellipses represent attributes, and diamonds represent relationships. Remembering this mapping is a frequent exam point.
💬 टिप्पणी / गल्ती रिपोर्ट (०)
-
Which SQL command is used to retrieve data from a table?
सही उत्तर: क) SELECT
SELECT queries and returns rows from one or more tables. INSERT adds new rows and UPDATE modifies existing ones.
💬 टिप्पणी / गल्ती रिपोर्ट (०)
-
In a relational database, a primary key:
सही उत्तर: ख) Uniquely identifies each record and cannot be NULL
A primary key must be unique and non-null for every row. A field that refers to the primary key of another table is a foreign key.
💬 टिप्पणी / गल्ती रिपोर्ट (०)
-
The OOP feature meaning 'one name, many forms' is:
सही उत्तर: ग) Polymorphism
Polymorphism lets the same function or operator name behave differently in different contexts, as in function overloading and overriding. Abstraction means showing only essential features.
💬 टिप्पणी / गल्ती रिपोर्ट (०)
-
In object-oriented programming, bundling data and the functions that operate on it into a single unit is called:
सही उत्तर: ग) Encapsulation
Encapsulation wraps data and methods together in a class and supports data hiding. Inheritance is acquiring properties of another class.
💬 टिप्पणी / गल्ती रिपोर्ट (०)
-
The worst-case time complexity of bubble sort is:
सही उत्तर: घ) O(n²)
Bubble sort uses nested passes over the list, giving O(n²) comparisons in the worst case. Merge sort achieves O(n log n).
💬 टिप्पणी / गल्ती रिपोर्ट (०)
-
Binary search can be applied only when the list is:
सही उत्तर: क) Sorted
Binary search repeatedly compares with the middle element and discards half the list, which works only if the list is sorted. Its time complexity is O(log n).
💬 टिप्पणी / गल्ती रिपोर्ट (०)
-
Which data structure follows the Last In First Out (LIFO) principle?
सही उत्तर: घ) Stack
In a stack, the last element pushed is the first one popped, like a pile of plates. A queue follows First In First Out (FIFO).
💬 टिप्पणी / गल्ती रिपोर्ट (०)
-
In C, which keyword is used to exit from a switch case so execution does not fall through to the next case?
सही उत्तर: ख) break
break ends the switch block; without it, control falls through to the following cases. continue is used only inside loops to skip to the next iteration.
💬 टिप्पणी / गल्ती रिपोर्ट (०)
-
In C, a pointer variable stores:
सही उत्तर: घ) The memory address of another variable
A pointer holds an address and is declared with *, for example int *p. The & operator gives the address of a variable, e.g. p = &x.
💬 टिप्पणी / गल्ती रिपोर्ट (०)
यी अभ्यास प्रश्न हुन्, आधिकारिक प्रश्न होइनन्। पाठ्यक्रम, विज्ञापन र नतिजाका लागि सम्बन्धित निकायको आधिकारिक वेबसाइट हेर्नुहोस्। उत्तरमा गल्ती भेटे प्रश्नमुनिको "टिप्पणी / गल्ती रिपोर्ट" मा लेख्नुहोस्।
नमस्ते! पाठ्यक्रम, सामान्य ज्ञान, भाषा परीक्षा वा कुनै प्रश्नको उत्तर बुझ्न सोध्नुहोस्।
AI ले गल्ती गर्न सक्छ। महत्वपूर्ण कुरा आधिकारिक स्रोतमा जाँच्नुहोस्।