COMPUTER
Download PDF Click here
فری تیاری کیلے Whatsapp جوائن کریں Click
here
Show Answers
چار آپشن میں سے کسی ایک پر کلک کرنے سے جواب سرخ ہو جائے گا۔
مندرجہ ذیل میں سے کون سا مائیکرو کنٹرولر کم از کم ہونا چاہیے؟
CPU, ROM, I/O ports, and timers
RAM, ROM, I/O ports, and timers
CPU, RAM, I/O ports, and timers
CPU, RAM, ROM, I/O ports, and timers
اس سوال کو وضاحت کے ساتھ پڑھیں
Explanation
A microcontroller at least consists of a processor as its CPU with RAM, ROM, I/O ports and timers. It may contain some additional peripherals like ADC, PWM, etc.
مندرجہ ذیل میں سے کون سی ڈی بی ایم ایس کی مثال نہیں ہے؟
MySQL
Microsoft Access
IBM DB2
Google
اس سوال کو وضاحت کے ساتھ پڑھیں
Explanation
MySQL, Microsoft Access, IBM DB2 are database management systems while Google is a search engine.
مصنوعی ذہانت میں دستیاب مقدار کی کل تعداد کتنی ہے؟
4
2
1
3
اس سوال کو وضاحت کے ساتھ پڑھیں
Explanation
There are two ( universal and existential ) types of quantification available in Artificial intelligence.
40
26
18
16
اس سوال کو وضاحت کے ساتھ پڑھیں
Explanation
DOS uses letters of the alphabet (A-Z) to designate disk drives, and it can address up to 26 disk drives . This means that DOS can recognize and assign drive letters from A to Z , allowing for a maximum of 26 disk drives to be connected to a system.
The number of colors required for proper edge coloring of graph
The maximum number of colors required for proper vertex coloring of graph
The minimum number of colors required for proper vertex coloring of graph
The minimum number of colors required for proper edge coloring of graph
اس سوال کو وضاحت کے ساتھ پڑھیں
Explanation
The minimum number of colors required for proper vertex coloring of graph is called chromatic number whereas the minimum number of colors required for proper edge coloring of graph is called chromatic index of a graph.
مندرجہ ذیل میں سے کون سا ڈیٹا گودام کا سب سیٹ ہے جو ایک مخصوص فنکشنل ایریا پر مرکوز ہے؟
Data mart
Association rules
Flat files
Database
اس سوال کو وضاحت کے ساتھ پڑھیں
Explanation
A data mart is a subset of a data warehouse that is focused on a specific functional area or department, such as marketing, sales, or finance. It contains a subset of the data warehouse's data , but is designed to be more accessible and user-friendly for a specific group of users.
ہر بار جب آپ اپنے کمپیوٹر کو آن کریں گے، یہ کنٹرول فائل کو چیک کرے گا۔ آپشن کا انتخاب کریں؟
Command.com, io.sys
Command.com, date.com, dir.com
Chkdsk.exe
Command.com, io.sys, msdos.sys
اس سوال کو وضاحت کے ساتھ پڑھیں
Explanation
When you turn on your computer, it will check the control files:
(Command.com) (Command Interpreter) io.sys (Input/Output System file) msdos.sys (MS-DOS System file)
گراف کا عمودی رنگ کیا ہے؟
A condition where any two vertices having a common edge should not have same color
A condition where any two vertices having a common edge should always have same color
A condition where all vertices should have a different color
A condition where all vertices should have same color
اس سوال کو وضاحت کے ساتھ پڑھیں
Explanation
Vertex coloring is a way of assigning colors to the vertices of a graph such that:
Any two adjacent vertices (connected by an edge) have different colors. The minimum number of colors is used. This is also known as " proper vertex coloring" or "graph coloring ".
It's a fundamental concept in graph theory, used to solve various problems in computer science, networking, and other fields.
یونکس شیل ______ اور______ دونوں زبان ہے۔
Scripting, interpreter
High level, low level
Interactive, responsive
Interpreter, executing
اس سوال کو وضاحت کے ساتھ پڑھیں
Explanation
The Unix shell is a:
Scripting language : It can execute scripts containing multiple commands. Interpreter language : It interprets commands one at a time, without the need for compilation.
رابن اور کارپ الگورتھم کا پری پروسیسنگ کا وقت کیا ہے؟
Theta(m2)
Theta(mlogn)
Theta(m)
Big-Oh(n)
اس سوال کو وضاحت کے ساتھ پڑھیں
Explanation
The pre-processing time of Rabin and Karp Algorithm is Theta(m) . The for loop in the pre-processing algorithm runs for m (the length of the pattern) times, hence the pre-processing time is Theta(m). This is the time complexity of the pre-processing phase of the Karp-Rabin algorithm.
