efyenej efJeÅeeueÙe hejer#ee meefceefle

ceeOÙeefcekeâ efMe#ekeâ hee$elee hejer#ee

BIHAR STET
keâchÙetšj
GÛÛe ceeOÙeefcekeâ mlej (keâ#ee XI mes XII) efMe#ekeâ nsleg

mee@uJ[ hesheme& Øewefkeäšme yegkeâ SJeb

ØeOeeve mecheeokeâ
Deevevo kegâceej cenepeve
uesKeve menÙeesie
hejer#ee efJeMes<e%e meefceefle
keâchÙetšj «eeefHeâkeäme
yeeuekeâ=<Ce ef$ehee"er, DeeMeer<e efieefj
mecheeokeâerÙe keâeÙee&ueÙe
12, ÛeÛe& uesve, ØeÙeeiejepe-211002
cees. : 9415650134
Email : [email protected]
website : www.yctbooks.com/www.yctfastbook.com
 All rights reserved with Publisher
ØekeâeMeve Iees<eCee
ØeOeeve mecheeokeâ SJeb ØekeâeMekeâ Deevevo kegâceej cenepeve ves E:Book by APP Youth Prime BOOKS, mes cegefõle keâjJeekeâj,
JeeF&.meer.šer. heefyuekesâMevme Øee. efue., 12, ÛeÛe& uesve, ØeÙeeiejepe-211002 kesâ efueS ØekeâeefMele efkeâÙee~
Fme hegmlekeâ keâes ØekeâeefMele keâjves ceW mecheeokeâ SJeb ØekeâeMekeâ Éeje hetCe& meeJeOeeveer yejleer ieF& nw
efHeâj Yeer efkeâmeer $egefš kesâ efueS Deehekeâe megPeeJe Deewj menÙeesie meeoj Dehesef#ele nw~
efkeâmeer Yeer efJeJeeo keâer efmLeefle ceW vÙeeefÙekeâ #es$e ØeÙeeiejepe nesiee~

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
 efJe<eÙe-metÛeer
SOLVED PAPER
 efyenej efJeÅeeueÙe hejer#ee meefceefle (ceeOÙeefcekeâ efMe#ekeâ hee$elee hejer#ee) ............................................. 7-19
keâchÙetšj [Exam. Date - 12.06.2024 (Shift-I)]

 efyenej efJeÅeeueÙe hejer#ee meefceefle (ceeOÙeefcekeâ efMe#ekeâ hee$elee hejer#ee) ........................................... 20-32
keâchÙetšj [Exam. Date - 12.06.2024 (Shift-II)]

 efyenej efJeÅeeueÙe hejer#ee meefceefle (ceeOÙeefcekeâ efMe#ekeâ hee$elee hejer#ee) ........................................... 33-47
keâchÙetšj [Exam. Date - 12.09.2023 (Shift-I)]

 efyenej efJeÅeeueÙe hejer#ee meefceefle (ceeOÙeefcekeâ efMe#ekeâ hee$elee hejer#ee) ........................................... 48-61
keâchÙetšj [Exam. Date - 12.09.2023 (Shift-II)]

 efyenej efJeÅeeueÙe hejer#ee meefceefle (ceeOÙeefcekeâ efMe#ekeâ hee$elee hejer#ee) ........................................... 62-73
keâchÙetšj [Exam. Date - 18.09.2020 (Shift-I)]

 efyenej efJeÅeeueÙe hejer#ee meefceefle (ceeOÙeefcekeâ efMe#ekeâ hee$elee hejer#ee) ........................................... 74-87
keâchÙetšj [Exam. Date - 2020]

 efyenej efJeÅeeueÙe hejer#ee meefceefle (ceeOÙeefcekeâ efMe#ekeâ hee$elee hejer#ee) ......................................... 88-101
keâchÙetšj [Exam. Date - 2019 (Shift-II)]

PRACTICE SET
 PRACTICE SET - 1 .................................................................................................... 102-117

 PRACTICE SET - 2 .................................................................................................... 118-133

 PRACTICE SET - 3 .................................................................................................... 134-149

 PRACTICE SET - 4 .................................................................................................... 150-164

 PRACTICE SET - 5 .................................................................................................... 165-179

 PRACTICE SET - 6 .................................................................................................... 180-194

 PRACTICE SET - 7 .................................................................................................... 195-209

 PRACTICE SET - 8 .................................................................................................... 210-224

 PRACTICE SET - 9 .................................................................................................... 225-240

 PRACTICE SET - 10 .................................................................................................. 241-256

2

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
 Syllabus for Uchcha Madhyamic STET 2023
UNIT I
Subject - Computer Science 100 Marks
Unit - 1 : Digital Logic ∎ Universal Gates (Only for Logic Conversion), K-
Map Simplifications, Pair, Quad, Octet (up to 4
∎ Data and number systems; Binary, Octal and Hexa variables) Don’t Care Condition, Arithmetic Logic
decimal representation and their conversions Unit: Half Adder, Full Adder, Binary Adder,2’s
;BCD,ASCII, EBDIC, Gray codes and their Complement Adder Subtractor
conversions; Signed binary number representation
with 1’s and 2’s complement methods, Binary Unit - 3 : Programming and data Structure
arithmetic. Venn diagram, Boolean algebra; Various ∎ Data, Entity, Information, Difference between Data
Logic gates-their truth tables and circuits; and Information, Data type , Build in data type,
Representation in SOP and POS forms; Abstract data type, Definition of data structures,
Minimization of logic expressions by algebraic Types of Data Structures: Linear and Non-Linear
method, K-map method Data Structure, Introduction to Algorithms:
∎ Combinational circuits-Adder and Subtractor Definition of Algorithms, Difference between
circuits; Applications and circuits of Encoder algorithm and programs, properties of algorithm,
,Decoder, Comparator ,Multiplexer, De-Multiplexe Algorithm Design Techniques, Performance
rand Parity Generator. Memory Systems: RAM Analysis of Algorithms, Complexity of various code
,ROM, EPROM, EEROM, Design of combinational structures, Order of Growth, Asymptotic Notations.
circuits-using ROM, Programming logic devices and ∎ Definition, Single and Multidimensional Arrays,
gate arrays. (PLAs and PLDs) Representation of Arrays: Row Major Order, and
∎ Sequential Circuits-Basic memory element-S-R, J- Column Major Order, Derivation of Index Formulae
K,D and T Flip Flops, various types of Registers and for 1-D,2-D Array Application of arrays, Sparse
counters and their design, Irregular counter, State Matrices and their representations. Recursion:
table and state transition diagram, sequential circuits recursion in C, example of recursion, Tower of
design methodology. Hanoi Problem, simulating recursion, Backtracking,,
∎ Different types of A/D and D/A conversion recursive algorithms, principles of recursion.
techniques. Logic families- TTL,ECL,MOS and ∎ Array Implementation and Pointer Implementation
CMOS, their operation and specifications. of Singly Linked Lists, Doubly Linked List,
Circularly Linked List, Operations on a Linked List.
Unit - 2 : Computer Organization and Insertion, Deletion, Traversal, Polynomial
Architecture Representation and Addition Subtraction &
∎ Introduction to Data Representation and Number Multiplications of Single variable.
System: Introduction to Decimal, Binary, Octal, ∎ Abstract Data Type, Primitive Stack operations:
Hexadecimal number system, Conversation of Push & Pop, Array and Linked Implementation of
number from one number system to another number Stack in C, Application of stack: Prefix and Postfix
system (like Decimal to Binary etc.), Binary
Expressions, Evaluation of postfix expression,
Arithmetic: - Addition (Simple Method, Using 1’s
Iteration and Recursion- Principles of recursion, Tail
Complement, Using 2’sComplement method),
Subtraction (Simple Method), Multiplication recursion, Removal of recursion Problem
(Simple Method), Division (Simple Method) ∎ Solving using iteration and recursion with examples
∎ Different Codes Representation of Error Detection such as binary search, Fibonacci numbers, and
Codes: Parity Bit Method, Checksum Method, Hanoi towers.
Representation of Error Correction Code: Hamming ∎ Operations on Queue: Create, Add, Delete, Full and
Code, Alphanumeric Codes: ASCII, EBCDIC, Empty, Circular queues, Array and linked
Excess – 3 Code, BCD Addition Method, Gray implementation of queues in C, Dequeue and
Code: Gray to Binary Conversion, Binary to Gray Priority Queue.
Conversion
∎ Concept of Searching, Sequential search, Index
∎ Introduction to Ideal Microcomputer, An Actual
Sequential Search, Binary Search. Concept of
Microcomputer: CPU, Address Bus, Data Bus, Hashing & Collision resolution Techniques used in
Control Bus, Memory: RAM - SRAM, DRAM,
Hashing.
ROM - PROM, EPROM, UVEPROM, EEPROM,
History of Microprocessor, Microcontroller ∎ Insertion Sort, Selection Sort, Bubble Sort, Heap
(Application Only), Addressing Techniques, Sort, Comparison of Sorting Algorithms, Sorting in
Introduction To Digital Electronics, Logic Gates: Linear Time: Counting Sort and Bucket Sort.
Inverter, OR Gate, AND Gate, NOR Gate, NAND ∎ Terminology used with Graph, Data Structure for
Gate, EX-OR Gate, EX-NOR Gate, De’ Morgan’s Graph Representations: Adjacency Matrices,
Theorems Adjacency List, Adjacency. Graph Traversal: Depth
3

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
 First Search and Breadth First Search, Connected Programmed I/O, DMA, Interrupt driven I/O,
Component. Recovery procedures. Protection and Security:
∎ Basic terminology used with Tree, Binary Trees, Safeguards, Penetration, Access and Information
Binary Tree Representation: Array Representation flow control, Protection problems, Formal models of
and Pointer (Linked List) Representation, Binary protection.
Search Tree, Complete Binary Tree, A Extended Unit - 6 : Database Management System
Binary Trees, Tree Traversal algorithms: Inorder, ∎ Introduction to Database, components and structure
Preorder and Postorder, Constructing Binary Tree of DBMS – logical structure – the 3 level
from given Tree Traversal, Operation of Insertion, architecture and mapping among them. Comparison
Deletion, Searching & Modification of data in between traditional file based system and DBMS.
Binary Search Tree. Threaded Binary trees, Advantages and drawbacks of DBMS.
Huffman coding using Binary Tree, AVL Tree and
B Tree ∎ Relational Model - What is relational model,
Relational key constraints – candidate key, primary
Unit - 4 : Algorithms key, foreign key.ER Model – entities, attributes,
∎ Algorithm Analysis, Time Space Tradeoff, relationship, and cardinality. Entity types, Entity sets
Asymptotic Notations, Conditional Asymptotic Attributes and Keys Relationship types, Relationship
notation, Removing condition from the conditional Sets, converting ER diagram to relational tables.
asymptotic notation, Properties of big-Oh notation. Database Schema
∎ Recurrence equations, Solving recurrence equations, ∎ Database Anomalies, CODD Rules and
Analysis of linear search, divide Normalization theory, 1 NF, 2 NF, 3 NF and BCNF.
∎ And Conquer: General Method, Binary Search, ∎ Introduction to transaction and concept of
Finding Maximum and Minimum, Merge Sort. concurrency control. Transaction and system
∎ General Method, Multistage Graphs, All-Pair concepts, desirable properties of transactions,
shortest paths, Optimal binary search trees. transaction support in SQL. Concurrency control
∎ General Method, 8-Queens problem, Hamiltonian
techniques, the locking protocol, serializable
problem. schedules, locks, 2 phase commit. Techniques,
concurrency control based on timestamp ordering
∎ Connected Components, Spanning Trees,
Biconnected components, Introduction to NP Hard Unit - 7 : Computer Network
and NP-Completeness. ∎ Introduction to Data Communication and Computer
Unit - 5 : Operating System Network, Network Topologies, classification of
computer network, Parallel & Serial Transmission,
∎ Introduction to OS – its functional behavior and Transmission Models, Transmission Channel, Data
responsibilities, Need for some of monitor / Rate, Bandwidth Signal Encoding Schemes, Data
command interpreter, Types of operating systems, Compression, Transmission Impairments, Layering
System structure, Hierarchical and layered and Design Issues, OSI Model and TCP/ IP model.
organization of OS, I/O methods and interrupt
∎ Data Link Layer: Need for Data Link Control,
structure.
Frame Design Consideration, Flow Control & Error
∎ Process definition, Process states and state Control. MAC sublayer, contention based and
transitions, Parallel processes and constructs, polling based MAC protocols.
Process interaction, Operating system kernel, Data
∎ Network Layer: Routing, Congestion control,
structures for processes and resources, Context
switching, Process control primitives, Process Internetworking principles, Internet Protocols (IPv4,
scheduling. packet format, Hierarchal addressing sub netting,
ARP, PPP), Bridges, Routers. Classless IP address.
∎ The determinacy problem, Mutual exclusion,
∎ Datalink Layer: Process to process communication.
Semaphores, Process synchronization,
Socket meaning and socket address. Upward and
∎ Conditional critical regions and monitors, Inter- downwards multiplexing. UDP and TPDU.
process communication, Deadlock problem and its
∎ Application Layer: HTTP, FTP, Telnet, SMTP,
solutions.
SNMP
∎ Memory management concepts, Relocation,
Linking, Multiprogramming with fixed Unit - 8 : Software Engineering
∎ Partitions, Swapping, Variables partitions, Overlays, ∎ Introduction to Software Engineering:
Virtual memory, Segmentation, Paging, Storage Characteristics, Emergence of Software
allocation strategies, Load control and thrashing Engineering, Software Metrics & Models, Process &
Product Metrics. Software Life Cycle Models:
∎ Organization of file and I/O subsystems, Directory Waterfall, Prototype and Spiral Models and their
management, Basic file system, file descriptors, File Comparison.
manipulation, File organization methods,
∎ Software Project Management: Size Estimation-
Management of auxiliary storage space, Command
language and file system utilities, I/O subsystems, LOC and FP Metrics, Cost Estimation-Delphi and
Basic COCOMO, Introduction to Halstead’s
4

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
 Software Science, Staffing Level Estimation- Minimization of Finite Automata, Distinguishing
Putnam’s Model. Software Requirements one string from other.
Specification: SRS Documents, their Characteristics ∎ Regular expression (RE) , Definition, Operators of
and Organization. regular expression and their precedence, Algebraic
∎ Software Design: Classification, Software Design laws for Regular expressions, Kleen’s Theorem,
Approaches, Function Oriented Software Design, Regular expression to FA, DFA to Regular
Structured Analysis- Data flow Diagrams and expression, Arden Theorem, Non Regular
Structured Design, Introduction to Object Oriented Languages, Pumping Lemma for regular Languages
Design. . Application of Pumping Lemma, Closure
∎ Coding and Testing of Software: Unit Testing, properties of Regular Languages, Decision
Block Box Testing, White Box Testing, Debugging, properties of Regular Languages, FA with output:
Program Analysis Tools, System Testing. Software Moore and Mealy machine, Equivalence of Moore
Reliability and Quality Assurance: Reliability and Mealy Machine, Applications and Limitation of
Metric- Musa’s Basic Model. FA.
∎ Software Quality Assurance: ISO 9000 and SEI ∎ Context free grammar (CFG) and Context Free
CMM and their Comparison. Software Maintenance: Languages (CFL): Definition, Examples, Derivation,
Maintenance Process Models and Reverse Derivation trees, Ambiguity in Grammar, Inherent
Engineering, Estimation of Maintenance Costs. ambiguity, Ambiguous to Unambiguous CFG,
Useless symbols, Simplification of CFGs, Normal
Unit - 9 : Object Oriented Programming forms for CFGs: CNF and GNF, Closure properties
∎ Review of Fundamentals of Procedural of CFLs, Decision Properties of CFLs: Emptiness,
Programming, Finiteness and Membership, Pumping lemma for
∎ Class and Objects, CFLs.
∎ Data Abstraction, ∎ Push Down Automata (PDA): Description and
∎ Information Hiding & Encapsulation, definition, Instantaneous Description, Language of
PDA, Acceptance by Final state, Acceptance by
∎ Constructors, destructors, and object creation,
empty stack, Deterministic PDA, Equivalence of
∎ Name space and references , PDA and CFG, CFG to PDA and PDA to CFG, Two
∎ Class Methods , Methods Overloading , stack PDA
∎ Inheritance , ∎ Turing machines (TM): Basic model, definition and
∎ Polymorphism , representation, Instantaneous Description, Language
∎ Abstract Classes, acceptance by TM, Variants of Turing Machine, TM
as Computer of Integer functions, Universal TM,
∎ Abstract Methods , Church’s Thesis, Recursive and recursively
∎ Exceptions , Exception Handling. enumerable languages, Halting problem,
Unit - 10 : Web-Based Application Introduction to Undecidability, Undecidable
Development problems about TMs. Post correspondence problem
(PCP), Modified PCP, Introduction to recursive
∎ Internet Basics, function theory
∎ Introduction to Web Development,
Unit - 12 : Internet of Things
∎ Node.js and Git,
∎ Definitions and Functional Requirements -
∎ HTML, CSS, JQuery,
Motivation - Architecture - Web 3.0 View of IoT -
∎ JavaScript and HTTP (forms), Ubiquitous IoT Applications - Four Pillars of IoT -
∎ Sessions and HTTP, DNA of IoT -The Toolkit Approach for End-user
∎ JavaScript & Document Object Model – DOM, Participation in the Internet of Things. Middleware
∎ Extensible Markup Language – XML, for IoT: Overview -Communication middleware for
∎ Document Type Definition - DTD Dreamweaver,
IoT - IoT Information Security.
∎ Protocol Standardization for IoT - Efforts - M2M
∎ PHP Hyper Text Preprocessor - PHP SQL &
MySQL, and WSN Protocols - SCADA and RFID Protocols-
Issues with IoT Standardization - Unified Data
∎ Integrating PHP and MySQL, Database Interaction
Standards -Protocols -IEEE 802.15.4 - BACNet
Unit - 11 : Theory of Computation Protocol Modbus - KNX - Zigbee- Network layer -
∎ Introduction; Alphabets, Strings and Languages; APS layer –Security.
Automata and Grammars, Deterministic finite ∎ Web of Things versus Internet of Things - Two
Automata (DFA)-Formal Definition, Simplified Pillars of the Web - Architecture standardization for
notation: State transition graph, Transition table, WoT Platform Middleware for WoT - Unified
Language of DFA, Non-deterministic finite Multitier WoT Architecture - WoT Portals and
Automata (NFA), NFA with epsilon transition, Business Intelligence. Cloud of Things: Grid/SOA
Language of NFA, Equivalence of NFA and DFA, and Cloud Computing - Cloud Middleware - Cloud
5

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
 Standards - Cloud Providers and Systems - Mobile ∎ The Network for Electronic Commerce: Need of
cloud Computing - The Cloud of Things network, market forces influencing the I-way,
Architecture. components of I-way, network access equipment,
∎ Industrial Internet of Things - Introduction to and global information distribution network.
Industrial Internet of Things - Industrie 4.0 - ∎ The Internet as a Network Infrastructure:
Industrial Internet of Things (IIoT) - IIoT Introduction, the Internet terminology, NSFNET:
Architecture - Basic Technologies - Applications Architecture and Components, Internet governance:
and Challenges - Security and Safety - Introduction The Internet Society.
to Security and Safety -Systems Security - Network ∎ Network Security & Firewalls: Client-Server
Security - Generic Application Security - network security, security threats in client-server,
Application Process Security and Safety - Reliable- firewalls and network security, data & message
and-Secure-by-Design IoT Applications - Run-Time security, encrypted documents and electronic mail.
Monitoring - The ARMET Approach - Privacy and ∎ Electronic Commerce & World Wide Web:
Dependability Introduction, architectural framework for electronic
∎ The Role of the Internet of Things for Increased commerce, WWW as an architecture, security in the
Autonomy and Agility in Collaborative Production web.
Environments -Resource Management in the ∎ Consumer Oriented Electronic Commerce:
Internet of Things: Clustering, Synchronization and Introduction, consumer oriented application,
Software Agents. Applications - Smart Grid - mercantile process models, mercantile models from
Electrical Vehicle charging. the consumer’s perspective, mercantile models from
Unit - 13 : Artificial Intelligence the merchant’s perspective.
∎ INTRODUCTION TO Al AND PRODUCTION ∎ Electronic Payment Systems: Introduction, types of
SYSTEMS: Introduction to AI-Problem electronic payment system, digital token based
formulation, Problem Definition -Production electronic payment systems, smart cards and
systems, Control strategies, Search strategies. electronic payment systems, credit cards systems,
Problem characteristics, Production system Threat on electronic payment system.
characteristics - Specialized productions system- ∎ Inter-organizational Commerce & Electronic Data
Problem solving methods – Problem graphs, Interchange: Introduction, EDI application in
Matching, Indexing and Heuristic functions -Hill business, EDI: legal, security, and privacy issues,
Climbing- Depth first and Breath first, Constraints EDI and electronic commerce.
satisfaction – Related algorithms, Measure of
∎ The Corporate Digital Library: Introduction,
performance and analysis of search algorithms.
dimensions of electronic commerce systems, types
∎ REPRESENTATION OF KNOWLEDGE: Game of digital documents, Issues behind document
playing – Knowledge representation, Knowledge infrastructure, corporate data warehouses.
representation using Predicate logic, Introduction to
predicate calculus, Resolution, Use of predicate Unit - 15 : Multimedia
calculus, Knowledge representation using other ∎ Definition - Classification - Multimedia application -
logic-Structured representation of knowledge. Multimedia Hardware - Multimedia software -
∎ KNOWLEDGE INFERENCE: Knowledge CDROM - DVD.
representation -Production based system, Frame ∎ Multimedia Audio: Digital medium - Digital audio
based system. Inference – Backward chaining, technology - sound cards - recording - editing - MP3
Forward chaining, Rule value approach, Fuzzy - MIDI fundamentals - Working with MIDI - audio
reasoning – Certainty factors, Bayesian Theory- file formats - adding sound to Multimedia project.
Bayesian Network-Dumpster – Shafer theory. ∎ Multimedia Text: Text in Multimedia -Multimedia
∎ PLANNING AND MACHINE LEARNING: Basic graphics: coloring - digital imaging fundamentals -
plan generation systems – Strips -Advanced plan development and editing - file formats - scanning
generation systems – K strips - Strategic and digital photography.
explanations - Why, Why not and how explanations. ∎ Multimedia Animation: Computer animation
Learning- Machine learning, adaptive Learning. fundamentals - Kinematics - morphing - animation
∎ EXPERT SYSTEMS: Expert systems – Architecture s/w tools and techniques. Multimedia Video: How
of expert systems, Roles of expert systems – video works - broadcast video standards - digital
Knowledge Acquisition – Meta knowledge, video fundamentals – digital video production and
Heuristics. Typical expert systems – MYCIN, editing techniques - file formats.
DART, XOON, Expert systems shells. ∎ Multimedia Project: stages of project - Multimedia
Unit - 14 : Fundamental of E-Commerce skills - design concept - authoring - planning and
∎ Introduction to Electronic Commerce: Introduction costing –Multimedia Team. Multimedia-looking
of commerce, Electronic commerce framework, towards Future: Digital Communication and New
electronic commerce and media convergence, the Media, Interactive Television, Digital Broadcasting,
anatomy of e-commerce application. Digital Radio, Multimedia Conferencing.
6

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
 efyenej efJeÅeeueÙe hejer#ee meefceefle
ceeOÙeefcekeâ efMe#ekeâ hee$elee hejer#ee Bihar STET
keâchÙetšj
[Exam. Date - 12.06.2024 (Shift-I)]
1. yetefueÙeve HebâkeäMeve F(A, B, C) = (2 , 4 , 5 , 6 ) keâes EPROM-EPROM keâes efceševes kesâ efueS UV ØekeâeMe keâer
Deheves mejueerke=âle SOP ¤he ceW yeouesb~ DeeJeMÙekeâlee nesleer nw~ Fmes efceševes kesâ efueS Skeâ efJeMes<e UV ueQhe keâe
(a) A + B + C (b) A' B + AC GheÙees ie efkeâÙee peelee nw~ pees efÛehe hej heÌ[ves Jeeues ØekeâeMe kesâ ceeOÙece
(c) AC' + AB' + BC' (d) A' B' C mes [s še keâes efceše oslee nw~
Ans. (c) : nceejs heeme yetefueÙeve hebâkeäMeve nw:- EPROM keâe hetâue heâece& Sjs]pesyeue Øees«eecesyeue jer[ - Deesveueer cesceesjer
neslee nw~]
F (A, B, C) = (2, 4, 5, 6)
EEPROM (Fueskeäš^erkeâueer Sjs]pesyeue Øees«eecesyeue jer[ Deesveueer cesceesjer
Ùen efcevešce& ™he (sum of products) ceW efoÙee ieÙee nw~
) keâes efJeIegle mebkesâleeW kesâ ceeOÙece mes efcešeÙee Deewj hegveŠ Øees«eece efkeâÙee
pee mekeâlee nw, efyevee UV ØekeâeMe keâer DeeJeMÙekeâlee kesâ Ùen Fmes
DeeefOekeâ ueÛeeruee Je GheÙeesie ceW Deemeeve yevee oslee nw~
3. efkeâme efheäuehe-heäuee@he Øekeâej keâes efveef<eæ efmLeefle kesâ efueS peevee
peelee nw, peneB oesveeW Fvehegš ‘1’ hej mesš nw?
lees efcevešcme&:-
(a) Sme.Deej. efheäuehe-efheäuee@he
2 A' B C'
(b) pes.kesâ. efheäuehe-efheäuee@he
4 A B' C'
(c) [er. efheäuehe-efheäuee@he
5 A B' C
(d) šer. efheäuehe-efheäuee@he
6 A B C'
ÛeejeW kesâ peesÌ[ves hej (SOP), Ans. (a) : Sme0 Deej0 efheäuehe-heäueeBhe ceW, peye oesveeW Fvehegš ‘1’ hej
F = A'BC' + AB'C' + AB'C + ABC' mesš nesles nQ, lees Ùen Skeâ DeefveOee&efjle Ùee efveef<eæ efmLeefle ceW Ûeuee
«egefhebie keâjves hej - ueelee nw~ Fme efmLeefle ceW oesveeW DeeGš hegš 0 hej mess nes peeles nQ, pees
AB'C' + AB'C = AB' ef k eâ Skeâ meceevÙe efheäuehe-heäueeBhe kesâ mebÛeeueve kesâ efJehejerle nw~
A'BC' + ABC' = BC' 4. pee@vemeve keâeGbšj cebs, efkeâleves mebYeeefJele DeJemLeeDeeW keâes
F = AB' + BC' ‘Sve. efheäuehe-efheäuee@he’ Éeje ØeefleefveefOelJe efkeâÙee pee
Fmekesâ DeueeJee (A'BC' + AB'C') Deewj (AB'C + ABC') keâes Yeer mekeâlee nw?
«eghe efkeâÙee pee mekeâlee nw efpememes AC' Deewj AB' heo Øeehle nes mekeâles (a) n (b) 2n
nQ~ efoS ieS efJekeâuheeW ceW mes AC' + AB' + BC' Yeer Skeâ JewOe (c) 2n (d) 2(n-1)
mejueerke=âle ™he nes mekeâlee nw Ùeefo efJeefYeVe «egefhebie keâer ieF& nes~ Ans. (b) : pee@vemeve keâeGšj ceW, ‘Sve0 efheäuehe heäuee@he Éeje
2. [sše efceševes Deewj efjØeesieÇeefcebie kesâ meboYe& cebs EPROM hej ØeefleefveefOelJe keâer pee mekeâves Jeeueer mebYeeefJele DeJemLeeDeeW keâer mebKÙee 2n
EEPROM keâe GheÙeesie keâjves keâe cenlJehetCe& ueeYe keäÙee nw? nesleer nw~
(a) EEPROM EPROM keâer leguevee ceW lespe nw~ 5. keâewve-mee uee@efpekeâ heefjJeej Deheves mebÛeeueve kesâ efueS
(b) EEPROM keâes efceševes kesâ efueS UV ØekeâeMe keâer efjòeâerkeâjCe Deewj Je=efæ cees[ MOSFETs oesveeW keâe
DeeJeMÙekeâlee veneR nw~ GheÙeesie keâjlee nw?
(c) EEPROM ceW EPROM keâer leguevee ceW DeefOekeâ #ecelee (a) šer.šer.Sue. (b) F&.meer.Sue.
nw~ (c) heerÛe.Sce.Dees.Sme. (d) meer.Sce.Dees.Sme.
(d) EEPROM Jee<heMeerue nw, peyeefkeâ EPROM iewj- Ans. (d) : CMOS (Complementry Metal-oxide
Jee<heMeerue nw~ Semiconductor) ueeefpekeâ heefjJeej Deheves mebÛeeueve kesâ efueS oesveeW
Ans. (b) : [sše efceševes Deewj efjØees«eeefcebie kesâ mevoYe& ceW EPROM Øekeâej keâe MOSFET, GheÙeesie keâjlee nw~
Deewj EEPROM keâe GheÙeesie keâjves keâe cenlJehetCe& ueeYe Ùen nw efkeâ Sve-Ûewveue MOSFET (Je=efæ cees[)
EEPROM keâes efceševes kesâ efueS UV ØekeâeMe keâer DeeJeMÙekeâlee veneR heer-Ûewveue MOSFET (Je=efæ cees[ Yeer, uesefkeâve efJeheefjle OeÇgJelee keâes
nw~ meeLe )

Bihar STET 7 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
6. «es keâes[ Deeceleewj hej efkeâme SefhuekesâMeve ceW GheÙeesie efkeâÙee 10. Skeâ DeeoMe& ceeF›eâes kebâhÙetšj keâe keâewve-mee Ieškeâ
peelee nw? ØemebmkeâejCe kesâ oewjeve DemLeeÙeer ™he mes [sše Deewj efveoxMeeW
(a) ef[efpešue mebÛeej keâes OeejCe keâjves kesâ efueS efpeccesoej nw?
(b) [sše Sefv›eâhMeve (a) meer.heer.Ùet. (b) S.Sue.Ùet.
(c) Sveeuee@ie-št-ef[efpešue ™heeblejCe (c) cesceesjer (d) DeeGšhegš ef[JeeFme
(d) $egefš keâe helee ueieevee Ans. (c) : cesceesjer mes leelheÙe& Gme keâeÙe& mLeeve mes nw efpemekeâe GheÙeesie
CPU Éeje ieCevee kesâ oewjeve DemLeeÙeer ™he mes [sše meb«enerle keâjves kesâ
Ans. (c) : «es keâes[ keâe GheÙeesie Dekeämej Sveeuee@ie-št-ef[efpešue
efueS efkeâÙee peelee nw
®heeblejCe (ADC) Deewj DevÙe DevegØeÙeesieeW ceW efkeâÙee peelee nw pene@ Skeâ
cesceesjer keâe GheÙeesie efvecveefueefKele GösMÙeeW kesâ efueS efkeâÙee peelee nwŠ-
Sveeueeie mebkesâle keâes ef[efpešue ™he ceW heefjJeeefle&le keâjves keâer
[sše meb«enCe- ØemebmkeâjCe kesâ oewjeve DemLeeÙeer ™he mes [sše keâes
DeeJeMÙekeâlee nesleer nw pewmes efkeâ jesšjer Sve keâes[me& Deewj SymeesuÙegš
meb«eefnle keâjvee~
heesefpeMeve mesmebj ceW~
efveoxMe meb«enCe- Øees«eece kesâ efveoxMeeW keâes meb«eefnle keâjvee pees Jele&ceeve
7. Skeâ yeeFvejer-št-iesÇ keâes[ keâvJeš&j keâe Skeâ GoenjCe nw- ces Ûeue jns nw~
(a) Svekeâes[j (b) ef[keâes[j 11. ceeF›eâes kebâhÙetšj Meyo Deeceleewj hej kebâhÙetefšbie kesâ meboYe& ceW
(c) legueefve$e (d) ceušerhueskeäme keäÙee meboefYe&le keâjlee nw?
Ans. (a) : Skeâ yeeFvejer-št-«es keâes[ keâvJeš&j Skeâ Øekeâej keâe (a) Skeâ kebâhÙetšj efmemšce pees cesveøesâce mes yeÌ[er nesleer nw~
Svekeâes[j nw pees yeeFvejer št «es keâes[ ceW heefjJele&ve keâjlee nw~ Svekeâes[me& (b) Skeâ kebâhÙetšj efmemšce pees Úesše neslee nw Deeceleewj hej Skeâ
Deeceleewj hej Skeâ Øekeâej kesâ keâes[ keâes ogmejs Øekeâej kesâ keâes[ ceW JÙeefòeâ Éeje GheÙeesie efkeâÙee peelee nw~
heefjJeeefle&ve keâjves kesâ efueS GheÙeesie efkeâÙes peeles nw~ (c) Skeâ kebâhÙetšj efmemšce pees efJeMes<e ™he mes yeÌ[s efveieceeW Éeje
8. mejue efJeefOe keâe GheÙeesie keâjkesâ yeeFvejer iegCeve cebs, DebkeâeW GheÙeesie efkeâÙee peelee nw~
keâes mebjsefKele keâjves Deewj iegCeve keâer lewÙeejer kesâ yeeo henuee (d) Skeâ kebâhÙetšj efmemšce pees Skeâ vesšJeke&â keâe efnmmee nw~
keâoce keäÙee nw? Ans. (b) : ceeF›eâes kebâhÙetšj :- Jen kebâhÙetšj neslee nw efpemeceW
(a) iegCekeâ Éeje keâce-mes-keâce cenlJehetCe& efyeš (Sue.Sme.yeer.) ceeF›eâesØeesmesmej cegKÙe Øeesmesefmebie Ùetefveš (C.P.U.) kesâ ™he ceW neslee nw~
keâes iegCee keâjW~ Ùen Deekeâej ceW Úesše Deewj efkeâheâeÙeleer neslee nw~ leLee Fmes Deeceleewj hej
(b) iegCekeâ Éeje meyemes cenlJehetCe& efyeš (Sce.Sme.yeer.) keâes
JÙeefòeâiele GheÙeesie kesâ efueS ef[peeFve efkeâÙee ieÙee nw~ GoenjCe -
[smkeâše@he, uewheše@he, šsyeuesš Deeefo~
iegCee keâjW~
12. ceeF›eâesØeesmesmej efpemeves henues ceeF›eâes kebâhÙetšj efkeâš,
(c) ceušerefhuekeQâ[ Éeje keâce-mes-keâce cenlJehetCe& efyeš
Altair 8800 keâes mebÛeeefuele efkeâÙee, Jen Fbšsue 8080 Lee~
(Sue.Sme.yeer.) keâes iegCee keâjW~
Altair 8800 keâye hesMe efkeâÙee ieÙee Lee ?
(d) ceušerefhuekeQâ[ Éeje meyemes cenlJehetCe& efyeš (Sce.Sme.yeer.)
(a) 1965 (b) 1975
keâes iegCee keâjW~ (c) 1985 (d) 1995
Ans. (a) : yeeFvejer iegCeve ceW, mejue efJeefOe keâe GheÙeesie keâjkesâ iegCeve Ans. (b) : Altair 8800 keâes peveJejer 1975 ceW "Popular
keâjves kesâ efueS, henuee keâoce iegCeve kesâ keâce-mes-keâce cenlJehegCe& efJele Electronics" heef$ekeâe ceW ØeoefMe&le efkeâÙee ieÙee Lee~ Fmes Dekeämej henuee
(Sue0 Sme0 yeer0 ) keâes ceušerefhuekeQâ[ mes iegCee keâjvee neslee nw Fmekesâ meheâue ceeF›eâes keâchÙetšj ceevee peelee nw~ Deewj Fmeves JÙeefòeâiele kebâhÙetšj
yeeo iegCee kesâ Deieues efyešdme keâes ceušerefhuekeQâ[ mes iegCee efkeâÙee peelee nw Ùegie keâer Meg™Deele keâer~
Deewj heefjCeeceeW keâes GefÛele mLeeve hej efMeheäš keâjkesâ peesÌ[e peelee nw~ 13. yeeFvejer vebyej 1101 kesâ yejeyej «es keâes[ keäÙee nw?
9. nwefcebie keâes[ ceW, Skeâ [sše Ùetefveš kesâ Yeerlej mecelee efyešdme (a) 1110 (b) 1011
kewâmes lewveele nwb? (c) 1010 (d) 1001
Ans. (b) : : «es keâes[ Øeehle keâjves keâe efveÙece:-
(a) [sše Ùetefveš keâer Meg®Deele ceW
*henues efyeš keâes Jewmes keâe Jewmee efueKees
(b) [sše Ùetefveš kesâ Deble ceW
*efheâj nj Deieuee efyeš Jele&ceeve efyeš × OR efheÚues efyeš
(c) 2 keâer MeefòeâÙeebs kesâ DeeOeej hej efJeefMe° heoeW hej
Binary:- 1101
(d) [sše FkeâeF& kesâ Yeerlej Ùee ÂefÛÚkeâ heoeW hej * henuee efyeš = 1
Ans. (c) : nsefcebie keâes[ ces, mecelee efyešdme (hewefjšer efyešdme) keâes [sše * otmeje efyeš = 1 × OR 1 = 0
Ùetefveš kesâ Yeerlej efJeefMe° heoeW hej jKee peelee nw~ pees 2 keâer MeefòeâÙeeW * leermeje efyeš = 0 × OR 1 = 0
kesâ DeeOeej hej efveOee&efjle efkeâÙes peeles nw DeLee&led mecelee efyeóme keâes * ÛeewLee efyeš = 1 × OR 0 = 1
1,2,4,8,16 Deeefo heoeW hej jKee peelee nw~ pees 20,21,22,23 Gray Code = 1011
Bihar STET 8 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
14. meMele& mheMeexvcegKe mebkesâleve efJeefMe° heefjefmLeefleÙeeW ceW 17. hegvejeJe=efòe meceerkeâjCe t(n) = 2T(n/2) + n Gme
SuieesefjLce JÙeJenej kesâ DeefOekeâ yeejerkeâ efJeMues<eCe kesâ SuieesefjLce Øeefle ceeve keâer meceÙe peefšuelee keâe
efueS Devegceefle oslee nw~ Ùen efJeMes<e ™he mes GheÙeesieer nw ØeefleefveefOelJe keâjlee nw? ceemšj ØecesÙe keâe GheÙeesie keâjles
peye- ngS, ØecesÙe ceW " S0", "yeer0"Deewj "SHeâ0 (Sve0)"
(a) efvejblej meceÙe peefšuelee kesâ meeLe SuieesefjLce keâe efJeMues<eCe keâe cetuÙe keäÙee nesiee?
(b) Fvehegš Deekeâej leÙe efkeâÙee ieÙee nw~ (a) efJeYeeefpele Deewj efJepeÙe; a = 2, b = 2, f(n) = n
(b) ueeueÛeer SuieesefjLce; a = 2, b = 2, f(n) = n
(c) Fvehegš [sše ÙeeÂefÛÚkeâ nw~
(c) ieefleMeerue Øees«eeefcebie; a = 2, b = 2, f(n) = n
(d) SuieesefjLce JÙeJenej kegâÚ Fvehegš efJeMes<eleeDeeW kesâ DeeOeej
(d) yeÇtš Heâesme&; a = 2, b = 2, f(n) = n
hej efYeVe neslee nw~
Ans. (a) : hegvejeJe=efòe meceerkeâjCe t(n ) = 2 T n / 2 + n keâes ceemšj
Ans. (d) : meMele& mheMeexvcegKe mebkesâleve keâe GheÙeesie leye efkeâÙee peelee
nw, peye SuieesefjLce keâe ØeoMe&ve (Performance) kesâJeue Fvehegš ØecesÙe keâe GheÙeesie keâjkesâ nue efkeâÙee pee mekeâlee nw pees efJeYeeefpele Deewj
efJepeÙe SuieesefjLce keâer meceÙe peefšuelee keâe efJeMues<eCe keâjves kesâ efueS
meeFpe hej ner veneR, yeefukeâ Fvehegš keâer Øeeke=âeflekeâ efJeMes<eleeDeeW hej Yeer
GheÙegòeâ nw~
efveYe&j keâjlee nw~
ceemšj ØecesÙe ceW, hegvejeJe=efòe meceerkeâjCe keâes Fme Øekeâej heefjYeeef<ele efkeâÙee
GoenjCe:- peelee nw~
* Skeâ mee@efšbie SuieesefjLce pees henues mes kegâÚ no lekeâ meš& efkeâS ieÙes peneB:-
[sše hej lespe Ûeuelee nw, uesefkeâve DeJÙeJeefmLele [sše hej Oeercee~ a = hegvejeJe=efòe keâer mebKÙee
* Ssmee JÙeJenej Fvehegš keâer mebjÛevee, efJelejCe hej DevÙe efJeMes<eleeDeeW b = mecemÙee kesâ Deekeâej keâes keâce keâjves keâe keâejkeâ (reduction
hej efveYe&j keâjlee nw~ factor)
15. efJeefMe° heefjefmLeefleÙeeW ceW Skeâ SuieesefjLce kesâ JÙeJenej keâe f(n) = hegvejeJe=efòe kesâ yeenj efkeâÙes ieÙes keâeÙee&s keâer ueeiele efoÙes ieÙes
efJeMues<eCe keâjves kesâ efueS meMele& mheMeexvcegKe mebkesâleve keâe hegvejeJe=efòe meceer0 :- t n 2 T ( n / 2 ) n ceW

GheÙeesie efkeâÙee peelee nw~ ''O (f(n)) mes efmLeefle keâes nšeles a = 2 (hegvejeJe=efòe keâer mebKÙee 2 nw)
meceÙe Ùeefo g(n)", lees keäÙee mebkeâsleve Øeehle neslee nw? b = 2 (mecemÙee kesâ Deekeâej DeeOee nes peelee nw)
(a) Dees0 (SHeâ0 (Sve0)) f(n) = n (hegvejeJe=efòe kesâ yeenj efkeâÙes ieÙes keâeÙee&s keâer ueeiele n nw~
(b) Dees0 (peer0 (Sve0)) FmeefueS mener Gòej (a) efJeYeeefpele Deewj efJepeÙe a = 2, b = 2,
(c) Dees0 (SHeâ0 (Sve0) + peer0 (Sve0)) f(n) = n nw~
18. Deekeâej ‘‘Sve0’’ kesâ Skeâ mejCeer kesâ efueS jwefKekeâ Keespe
(d) Dees0 (SHeâ0 (Sve0* peer (Sve0))
SuieesefjLce keâer meyemes Kejeye efmLeefle keâer peefšuelee keäÙee
Ans. (a) : meMele& mheMeexvcegKe mebkesâleve ceW, Ùeefo nceW "O(f(n)) Ùeefo
nw?
g(n)" pewmeer efmLeefle oer peeleer nw, lees Fmekeâe DeLe& nw efkeâ SuieesefjLce keâe
(a) O (lo g n ) (b) O n
JÙeJenej meeceevÙe ™he mes O(f(n)) neslee nw uesefkeâve Ùen JÙeJenej kegâÚ
efJeefMe° heefjefmLeefleÙeeW ceW g(n) kesâ DeeOeej hej efveOee&efjle efkeâÙee peelee nw, (c) O n
2
(d) O 1

peye nce ‘‘Ùeefo g(n)" pewmeer efmLeefle keâes nšeles nw, lees nceW Ans. (b) : jwefKekeâ Keespe SuieesefjLce Skeâ mejCeer ceW Skeâ efJeefMe°
SuieesefjLce kesâ meeceevÙe JÙeJenej keâe mebkesâleve efceuelee nw peeW efkeâ lelJe keâes Keespe keâjves kesâ efueS GheÙeesie efkeâÙee peelee nw~ meyemes Kejeye
O(f(n)) nw~ FmeefueS, efmLeefle keâes nševes kesâ yeeo, mebkesâleve O(f(n)) efmLeefle ceW, SuieesefjLce keâes mejCeer kesâ meYeer lelJeeW keâer peeBÛe keâjveer heÌ[leer
ner jnlee nw~ nw pees leye neslee nQ peye Keespee peeves Jeeuee lelJe mejCeer ceW veneR neslee
16. efyeie-Dees veesšsMeve keâe GheÙeesie keâjkesâ Skeâ SuieesefjLce keâer nw~ Ùee Deefvlece lelJe neslee nw~ FmeefueS, jwefKekeâ Keespe SuieesefjLce keâer
meceÙe peefšuelee keâe efJeMues<eCe keâjles meceÙe, keäÙee mebheefòe meyemes Kejeye efmLeefle keâer peefšuelee O(n) neslee nw~ peneB n mejCeer kesâ
nceW efvecve -›eâce MeyoeW keâes DeveosKee keâjves keâer Devegceefle Deekeâej keâes oMee&lee nw~
osleer nw? 19. Sve0 heer0-hetCe& meeefyele nesves Jeeueer henueer mecemÙee Leer-
(a) efjHeäuesefkeämešer (b) Fmekesâ DeueeJee (a) Ùee$ee mesumecewve mecemÙee
(c) iegCee (d) efmLejebkeâ keâer De%eevelee (b) nwefceušefveÙeve meeFefkeâue mecemÙee
Ans. (b) : peye nce efyeie-Dees veesšsMeve ceW efkeâmeer SuieesefjLce keâer (c) yetefueÙeve meblees<epevekeâ mecemÙee
peefšuelee efueKeles nw lees nce kesâJeue meyemes yeÌ[s ›eâce keâes jKeles nw (d) Knapsack mecemÙee
Fmekeâe keâejCe Ùen nw efkeâ Ùeesieelcekeâlee kesâ efmeæeble kesâ Devegmeej, Ùeefo Ans. (c) : yetefueÙeve meblees<epevekeâ mecemÙee, efpemes SAT Ùee
Deehekesâ heeme Skeâ mes DeefOekeâ heo nw, lees efJeie-Dees ceW meyemes SATISFIABILITY keâne peelee nw Jen henueer mecemÙee Leer efpemes
ØeYeeJeMeeueer (dominant) heo ceeheves jKelee nw~ Sve] heer] hetCe& (NP-Complete) kesâ ™he ceW efmeæ efkeâÙee ieÙee~
Bihar STET 9 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
* Ùen ØeceeCe Stephen cook ves 1971 ceW Deheves Øeefmeæ heshej heLe – heLe Meer<eeX keâe Skeâ ›eâce neslee nw peneB ØelÙeskeâ ›eâefcekeâ Meer<e&
"The complexity of Theorem proving Procedures" ceWs Skeâ efkeâveejs mes pegÌ[e neslee nw~
efoÙee Lee~ Fmes Cook's Theorem keâne peelee nw~ 24. efJejue jsKeebkeâve kesâ efueS keâewve-mee «eeheâ ØeefleefveefOelJe
20. Skeâ yeeFmesvšs[ «eeheâ ceW, yeeFmesvšs[ IeškeâeW keâer mebKÙee DeefOekeâ cesceesjer-kegâMeue nw?
yejeyej nw- (a) DeemeVe cewefš^keäme
(a) keâesves keâer mebKÙee (b) DeemeVe metÛeer
(b) efkeâveejeW keâer mebKÙee (c) Spe efuemš
(c) keâš Jeefš&me keâer mebKÙee (d) Iešvee cewefš^keäme
(d) Jeefš&me keâer mebKÙee mes keâce Skeâ
Ans. (b) : efJejue jsKeebkeâve kesâ efueS DeemeVe metÛeer «eeHeâ ØeefleefveefOelJe
Ans. (c) : Biconnected Component (Bicomponent)= DeefOekeâ cesceesjer kegâMeue nw ~ Ùen Skeâ [sše mebjÛevee nw pees «eeHeâ keâes
Skeâ Ssmee DeefOekeâlece Ghe«eeheâ efpemeceW keâesF& Yeer Skeâ Ješxkeäme nševes hej oMee&ves kesâ efueS GheÙeesie keâer peeleer nw, efJeMes<e ¤he mes Ssmes «eeHeâ kesâ
Yeer «eeheâ keâveskeäšs[ jnlee nw~ efueS efpeveceW yengle keâce efkeâveejs nesles nQ~
* Cut Vertex :- Ssmee Ješxkeäme efpemes nševes mes «eeheâ kesâ keâveskeäšs[
25. hegvejeJe=efòe keâes nševes keâer Øeef›eâÙee ceW hegvejeJeleea hebâkeäMeve
IeškeâeW keâer mebKÙee yeÌ{ peeleer nw~
keâe@ue keâer peien Meeefceue nw-
mebheefòe:- Ùeefo efkeâmeer «eeheâ ceW k keâj Jeefš&me nw lees yeeFmesvšs[ Ieškeâes
(a) DeefOekeâ hegvejeJe=efòe
keâer mebKÙee DeJemej Gvemes mebyebefvOele nesleer nw~ Skeâ «eeheâ ceW
(b) uethme
bioconnected components Deewj cut vertices Skeâ block-cut
tree yeveeles nw~ (c) Deefleefjòeâ cesceesjer DeeJebšve
* «eeheâ kesâ nj bioconnected components ceW Ùee lees keâesF& keâš (d) iewj-hegvejeJe=efòe hebâkeäMeve keâe@ue
Ješxkeäme neslee nw Ùee veneR~ Ans. (b) : hegvejeJe=efòe keâes nševes keâer Øeef›eâÙee ceWb hegvejeJe=efòe HebâkeäMeve
21. Skeâ efJemleeefjle yeeFvejer hesÌ[ ceW, Deebleefjkeâ vees[dme keâeue keâer peien uethme Meeefceue nesles nQ~ uethme Skeâ Øees«eeefcebie mebjÛevee
ØeefleefveefOelJe keâjles nQ- nw pees Skeâ efveef§ele keâes[ keâes yeej-yeej efve<heeefole keâjves keâer Devegceefle
(a) ueerheâ vees[dme (b) DebkeâieefCeleerÙe Dee@hejsšj
oslee nw~ peye lekeâ keâer Skeâ efJeMes<e efmLeefle hetjer ve nes peeÙes~
(c) Dee@hejW[ (d) mebKÙeeSB 26. efvecveefueefKele ceW mes keâewve Skeâ mecemÙee keâe Skeâ GoenjCe
nw efpemes yewkeâšw^ekf ebâie keâe GheÙeesie keâjkesâ nue efkeâÙee pee
Ans. (b) : Skeâ efJemleeefjle yeeFvejer hesÌ[ ceW Deeblejefkeâ vees[dme
DebkeâieefCeleerÙe Dee@hejsšjeW keâe ØeefleefveefOelJe keâjles nQ ~ Skeâ yeeFvejer hesÌ[ mekeâlee nw?
ceW 0, 1 Ùee 2 nes mekeâleer nQ 0 ef[«eer vees[dme keâes ueerHeâ vees[dme keâne (a) Skeâ mebKÙee kesâ leLÙeelcekeâ keâer ieCevee~
peelee nw~ peyeefkeâ iewj ueerHeâ vees[dme keâes Deebleefjkeâ vees[dme Ùee yeÇebÛe keâne (b) Skeâ mejCeer ceW meyemes yeÌ[e lelJe Keespeves kesâ efueS~
peelee nw~ (c) meg[eskegâ hensueer keâes nue keâjvee~
22. Skeâ yeeFvejer š^er kesâ mejCeer Øeefle efveefOelJe ceW, Ùeefo (d) efkeäJekeâmee@š& keâe GheÙeesie keâjkesâ Skeâ mejCeer keâes ÚeBšvee~
metÛekeâebkeâ ceW vees[ "i" MetvÙe veneR nw, lees Fmekeâe yeeÙeeB Ans. (c) : yewkeâ š^weEkeâie keâe GheÙeesie keâjkesâ meg[esketâ hensueer keâes nue
ÛeeFu[ metÛekeâebkeâ ceW nesiee- efkeâÙee pee mekeâlee nw~ Fmekeâe GheÙeesie keâjkesâ ›eâemeJe[&, ceewwefKekeâ,
(a) 2i (b) 2i + 1 DebkeâieefCele, vewhemeskeâ mecemÙee, mebÙeespeve Devegketâueve mecemÙeeDeeW keâes nue
(c) 2i –1 (d) i + 1 keâjves ceW Yeer GheÙeesie efkeâÙee pee mekeâlee nw~
Ans. (b) : yeeFvejer š^er kesâ Ssjs efjefØepeWšsMeve ceW Ùeefo Fb[skeäme ceW vees[ 27. ØelÙeskeâ hebefòeâ Deewj mlebYe ceW iewj-MetvÙe lelJeeW keâer Skeâ
''i'' iewj MetvÙe nw lees Fmekeâe yeeÙeeb ÛeeFu[ Fb[skeäme 2i +1 nesiee ~ Úesšer mebKÙee kesâ meeLe cewefš^me kesâ efueS keâewve-mee
yeeFvejer š^er keâes Ssjs kesâ ¤he ceW oMee&ves kesâ efueS nceW Ssmes ceW meYeer ØeefleefveefOelJe meyemes GheÙegòeâ nw?
vees[dme keâes uesJeue kesâ Devegmeej mšesj keâjles nQ~ (a) efš^heue ØeefleefveefOelJe
23. Skeâ DeØelÙe#e «eeheâ ceW Skeâ pegÌ[e ngDee Ieškeâ Jeefš&me keâe (b) mebheerefÌ[le efJejue hebefòeâ Øee™he
Skeâ meyemesš nw pees Éeje pegÌ[s ngS nQ- (c) mebheerefÌ[le efJejue mlebYe Øee™he
(a) Ûe›eâ (b) heLe (d) mejCeer ØeefleefveefOelJe
(c) efkeâveejeW (d) Yeej Ans. (b) : cewefš^keäme kesâ efueS meyemes GheÙegòeâ ØeefleefveefOelJe, efpemeceW
Ans. (b) : Skeâ DeØelÙe#e «eeHeâ ceW Skeâ pegÌ[e ngDee Ieškeâ Jeefš&me keâe ØelÙeskeâ hebefòeâ Deewj mlebYe ceW iewj MetvÙe lelJeeW keâer Úesšer mebKÙee nessleer nw
Skeâ meyemesš nw pees efkeâveejeW Éeje pegÌ[s nesles nQ~ mebheeref[le efJejue hebefòeâ Øee¤he nw~ Ùen Øee¤he kesâJeue iewj MetvÙe lelJeeW keâes
Ûe›eâ – Skeâ Ûe›eâ Skeâ yebOe heLe neslee nw peneB henuee Deewj Deefvlece Gvekesâ hebefòeâ Deewj mlebYe metÛekeâebkeâes kesâ meeLe meb«enerle keâjlee nw, efpememes
Meer<e& Skeâ ner nesles nQb~ cesceesjer keâe GheÙeesie keâce nes peelee nw~
Bihar STET 10 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
28. Skeâ Dee@hejsefšbie efmemšce ceW Skeâ heâeÙejJee@ue keâe GösMÙe nw- Ans. (c): jeskeâLeece-
(a) Øeef›eâÙeeDeeW kesâ yeerÛe metÛevee kesâ ØeJeen keâes efveÙebef$ele keâjW~ JÙeeKÙee:- jeskeâLeece ieeflejesOe mecemÙee kesâ meceeOeeve kesâ efueS Skeâ
(b) Øeef›eâÙeeDeeW kesâ efueS meer0heer0Ùet0 kesâ meceÙe kesâ DeeJebšve jCeveerefle nw efpemeceW Ùen megefveef§ele efkeâÙee peelee nw efkeâ Øeef›eâÙee keâes
keâe ØeyebOeve keâjW~ efve<heeefole keâjves mes henues meYeer DeeJeMÙekeâ mebmeeOeve GheueyOe nes~
(c) Fvekeâefcebie Deewj DeeGšieesFbie šw^efheâkeâ keâes efheâušj keâjkesâ 32. ØeeLeefcekeâlee Mes[Ÿetefuebie ceW ØelÙeskeâ Øeef›eâÙee kesâ efueS Skeâ
Skeâ vesšJeke&â keâer j#ee keâjW~ ØeeLeefcekeâlee keâes Øeoeve keâjvee Meeefceue nw~ keâewve-mee
(d) cesceesjer ØeyebOeve SuieesefjLce keâe Devegketâueve keâjW~ Mes[Ÿetefuebie SuieesefjLce Fme DeJeOeejCee mes efvekeâšlee mes
Ans. (c) : heâeÙejJee@ue:- Ùen Skeâ Deehejsefšbie efmemšce nw efpemekeâe
mebyebefOele nw?
(a) FCFS
GösMÙe Fvekeâefcebie Deewj DeeGšieesFbie vesšJeke&â š^wefheâkeâ keâes efheâušj keâjkesâ
(b) SJN
Skeâ vesšJeke&â keâer megj#ee keâjvee nw~ heâeÙejJee@ue vesšJeke&â Deewj kebâhÙetšjeW (c) ceušeruesJeue keâleej Mes[Ÿetefuebie
keâes cewueJesÙej Deewj [sše Ûeesjer mes yeÛeeves ceW ceoo keâjles nw~ (d) henuee-DeeDees, ØeLece-meJe& efkeâÙee ieÙee (Sheâ0 meer0 Sheâ0
heâeÙejJee@ue keâe keâeÙe&- Sme0)
1. šw^efheâkeâ efheâušefjbie:- heâeÙejJeeue vesšJeke&â ceW Deeves Deewj peeves Ans. (c) : ceušeruesJeue keâleej Mes[Ÿetefuebie
Jeeues šwefhebâie keâer efveiejeveer keâj GvnW efheâušj keâjlee nw~ JÙeeKÙee:- ceušeruesJeue keâleej Mes[Ÿetefuebie ØeeLeefcekeâlee Mes[Ÿetefuebie kesâ
2. megj#ee:- Ùen yeenjer vesšJeke&â mes Kelejs mes Deebleefjkeâ vesšJeke&â keâer meeLe efvekeâšlee mes mebyebefOele nw keäÙeeWefkeâ FmeceW Øeef›eâÙeeDeeW keâes Gvekeâer
megj#ee Øeoeve keâjlee nw pewmes- JeeÙejme, nwkeâj ØeeLeefcekeâlee kesâ DeeOeej hej efJeefYeVe keâleejeW ceW efJeYeeefpele efkeâÙee peelee nw
3. DeJejesOe:- heâeÙejJeeue Skeâ efvepeer Deebleefjkeâ Deewj meeJe&peefvekeâ Deewj ØelÙeskeâ keâleej kesâ efueS Deueie-Deueie Mes[Ÿetefuebie SuieesefjLce keâe
Fbšjvesš kesâ yeerÛe Skeâ DeJejesOe kesâ ™he ceW keâeÙe& keâjlee nw~ GheÙeesie efkeâÙee peelee nw~
4. efveÙeb$eCe:- heâeÙejJeeue Ùen efveÙebef$ele keâjlee nw efkeâ keâewve meer 33. meceeveeblej Øees«eeefcebie ceW ‘‘jsme kebâ[erMeve’’ Meyo keâes
peevekeâejer vesšJeke&â ceW ØeJesMe Deewj yeenj efvekeâue mekeâleer nw~ meboefYe&le keâjlee nw-
(a) henues yeer0 keâes meceehle keâjves kesâ efueS Øeef›eâÙeeDeeW kesâ yeerÛe
29. heâeFue mebie"ve efJeefOe; pees Yeeweflekeâ yuee@keâ heles kesâ efueS
ØeefleÙeesefielee
leeefke&âkeâ heleeW keâes cewhe keâjves kesâ efueS Skeâ leeefuekeâe keâe
(b) meePee mebmeeOeveeW lekeâ hengBÛeves kesâ efueS Øeef›eâÙeeDeeW kesâ yeerÛe
GheÙeesie keâjleer nw, kesâ ™he ceW peevee peelee nw-
ØeefleÙeesefielee
(a) meefVeefnle DeeJebšve (b) efuebkeä[ DeeJebšve
(c) Ssmeer efmLeefle peneB Skeâ Øeef›eâÙee Skeâ uethe ceW Deškeâ peeleer
(c) Deveg›eâefcele DeeJebšve (d) Ûej DeeJebšve nw
Ans. (c) : Deveg›eâefcele DeeJebšve ceW ØelÙeskeâ heâeFue kesâ efueS Skeâ (d) Skeâ Ssmeer efmLeefle peneB Øeef›eâÙeeSB ›eâefcekeâ ™he mes Ûeue jner
Fb[skeäme yueekeâ ceW heâeFue kesâ meYeer Yeeweflekeâ yueekeâ kesâ heles nesles nw~ peye nw
heâeFue keâes Skeämesme efkeâÙee peelee nw lees Deehejsefšbie efmemšce Fb[skeäme Ans. (b) : meePee mebmeeOeveeW lekeâ hengBÛeves kesâ efueS Øeef›eâÙeeDeeW
yuee@keâ keâes heÌ{lee nw Deewj efheâj heâeFue kesâ Yeeweflekeâ yuee@keâ lekeâ hengbÛeelee kesâ yeerÛe ØeefleÙeesefielee
nw~ jsme kebâ[erMeve meceeveeblej Ùee yengØeef›eâÙee Øees«eeefcebie Skeâ Ssmeer efmLeefle
30. keâewve-meer mšesjspe DeeJebšve jCeveerefle keâF& Øeef›eâÙeeDeeW keâes nesleer nw peye oes Ùee DeefOekeâ Øeef›eâÙeeSB meePee mebmeeOeve keâes Skeâ meeLe
meefVeefnle cesceesjer keâer DeeJeMÙekeâlee kesâ efyevee Skeâ meeLe efyevee GefÛele mecevJeÙe (Synchronization) kesâ Skeämesme keâjves
mce=efle ceW efveJeeme keâjves keâer Devegceefle oslee nw- keâer keâesefMeMe keâjleer nw~ FmeceW DeeGšhegš Deefveef§ele Ùee ieuele nes mekeâlee
(a) meyemes DeÛÚe efheâš (b) meyemes Kejeye efheâš nw~
(c) henues efheâš (d) hesefpebie 34. RDBMS ceW keäÙee Meeefceue nw?
Ans. (d) : hesefpebie veecekeâ mšesjspe DeeJebšve jCeveerefle Øeefleef›eâÙeeDeeW keâes (a) DeefYeuesKeeW keâe meb«en
meefVeefnle efkeâS efyevee Skeâ meeLe cesceesjer ces jnves keâer Devegceefle osleer nw~ (b) kegbâefpeÙeeW keâe meb«en
Ùen iegCe cesceejer (ram) Deewj meskeWâ[jer mšesjspe (pewmes ne[& [^eFJe) kesâ (c) leeefuekeâeDeeW keâe meb«en
yeerÛe [sše keâes mLeeveebleefjle keâjves keâer Skeâ efJeefOe nw~ (d) #es$eeW keâe meb«en
31. efvecveefueefKele ceW mes keâewve-mee ieeflejesOe mecemÙee keâe Skeâ
Ans. (c) : leeefuekeâeDeeW keâe meb«en
meceeOeeve nw efpemeceW megefveef§ele keâjvee Meeefceue nw efkeâ
RDBMS (Relational Database Management System) Skeâ
efve<heeove Meg™ keâjves mes henues meYeer DeeJeMÙekeâ mebmeeOeve
Ssmee [sšeyesme ØeyebOeve leb$e nw pees leeefuekeâeDeeW (Tables) kesâ ™he ceW
nQ? [sše keâes meb«enerle keâjlee nw~ ØelÙeskeâ leeefuekeâe ceW hebefòeâÙeeB
(a) heefjnej (b) keâe helee ueieevee (Records) Deewj mlebbYe (Fields) nesles nw~ leeefuekeâeDeeW kesâ yeerÛe mebyebOe
(c) jeskeâLeece (d) meceeefhle (Relations) kegbâefpeÙeeW (keys) kesâ ceeOÙece mes yeveeS peeles nw~
Bihar STET 11 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
35. Skeâ mebyebOe keâer hebefòeâÙeeW keâes.......kesâ ™he ceW peevee Ans. (c) : Ùen Skeâ Øekeâej keâe efmemšce mee@heäšJesÙej nw~
peelee nw- JÙeeKÙee:- [sšeyesme ØeyebOeve ØeCeeueer (DBMS) Skeâ Øekeâej keâe
(a) ef[«eer (b) šŸetheume efmemšce mee@heäšJesÙej nw pees [sšeyesme keâes ØeyebefOele Deewj mebÛeeefuele keâjves
(c) FkeâeF& (d) Ùes meYeer kesâ efueS ef[]peeFve efkeâÙee ieÙee nw~ Ùen [sše kesâ Yeb[ejCe, hegveØee&efhle
Ans. (b) : šŸetheume Deewj DeÅeleve keâes efveÙebef$ele keâjlee nw~
JÙeeKÙee:- efjuesMeveue [sšeyesme ceW, Skeâ leeefuekeâe (table) keâer hebefòeâÙeeW 40. efvecveefueefKele ceW mes keâewve-mee [sše cewefveheguesMeve keâceeb[
(rows) keâes šŸetheume (Tuples) keâne peelee nw~ ØelÙeskeâ šŸetheue efkeâmeer keâe Skeâ Øekeâej nw?
efJeMes<e Sbš^er (record) Ùee [sše keâer Skeâ FkeâeF& keâe ØeefleefveefOelJe (a) efceševee (b) yeouevee
keâjlee nw~ (c) yeveevee (d) Ùes meYeer
36. [sše yesme keâes Debeflece Øeefleyeæ efmLeefle ceW hegvemLee&efhele Ans. (d) : Ùes meYeer JÙeeKÙee:- [sše cewefveheguesMeve keâceeb[dme keâe
keâjves kesâ efueS efvecveefueefKele ceW mes efkeâme Skeâ keâceeb[ keâe GheÙeesie [sšeyesme ceW [sše keâes mebMeesefOele keâjves Ùee nsjhesâj keâjves kesâ efueS
GheÙeesie efkeâÙee peelee nw? efkeâÙee peelee nw~ efceševee (DELETE), yeouevee (UPDATE) Deewj
(a) mesJehee@Fbš yeveevee (INSERT) meYeer [sše cewefveheguesMeve keâceeb[dme kesâ GoenjCe nw~
(b) jesueyewkeâ 41. vesšJeke&â hejle ceW ™efšbie keâe ØeeLeefcekeâ keâeÙe& keäÙee nw?
(c) Øeefleyeæ (a) [sše øesâefcebie
(d) ‘‘mesJehee@Fbš’’ Deewj ‘‘jesueyewkeâ’’ oesveeW (b) $egefš megOeej
Ans. (b) : jesueyewkeâ- (c) [sše kesâ efueS meyemes DeÛÚe jemlee Keespevee
JÙeeKÙee:- jesueyewkeâ keâceeb[ keâe GheÙeesie [sšeyesme keâes Gmekesâ Debeflece (d) ØeJeen efveÙeb$eCe
Øeefleyeæ efmLeefle ceW hegve:mLeeefhele keâjves kesâ efueS efkeâÙee peelee nw, efpememes Ans. (c) : vesšJeke&â hejle ceW ™efšbie keâe ØeeLeefcekeâ keâeÙe& [sše kesâ efueS
efheÚues keâefceš kesâ yeeo efkeâS ieS meYeer yeoueeJeeW keâes hetJe&Jele efkeâÙee pee meyemes DeÛÚe jemlee Keespevee nw~ Ùen vesšJeke&â hejle keâe Œeesle mes iebleJÙe
mekesâ~ lekeâ hengBÛeves kesâ efueS meyemes DeÛÚe ceeie& efveOee&efjle keâjlee nw~
37. keâF& Deueie-Deueie œeesleeW mes mebefÛele peevekeâejer Ùee [sše 42. Øeef›eâÙee-mes-Øeef›eâÙee mebÛeej kesâ meboYe& ceW mee@kesâš keäÙee nw?
keâe Skeâ efvecveefueefKele .... kesâ ™he ceW peevee peelee nw~
(a) [sše š^ebmeefceMeve kesâ efueS Skeâ ne[&JesÙej ef[JeeFme
(a) [sše ØeyebOeve
(b) vesšJeke&â mebÛeej kesâ efueS Skeâ mee@heäšJesÙej Fbšjhesâme
(b) [sše ceeFefvebie
(c) Skeâ Øekeâej keâe kesâyeue efpemekeâe GheÙeesie GÛÛe ieefle [sše
(c) [sše JesÙejneGme mebÛejCe kesâ efueS efkeâÙee peelee nw~
(d) ‘‘[sše ceeFefvebie’’ Deewj ‘‘[sše JesÙejneGme’’ oesveeW (d) vesšJeke&â šesheesuee@peer keâe Skeâ Øekeâej
Ans. (c) : [sše JesÙejneGme
Ans. (b) : Øeef›eâÙee mes Øeef›eâÙee mebÛeej kesâ meboYe& ceW, meefke&âš Deeceleewj
JÙeeKÙee:- [sše JesÙejneGme Skeâ keWâõerÙe Yeb[ej nw efpemeceW efJeefYeVe œeesleeW hej Skeâ JeÛe&gDeue Ùee leke&âmebiele keâveskeäMeve keâes meboefYe&le keâjlee nw pees oes
mes Skeâef$ele [sše meb«enerle efkeâÙee peelee nw, efpememes [sše keâe efJeMues<eCe Øeef›eâÙeeDeeW kesâ yeerÛe [sše kesâ Deeoeve-Øeoeve keâes me#ece keâjlee nw~ Ùen
Deewj GheÙeesie keâjvee Deemeeve nes peelee nw~ keâveskeäMeve Skeâ efJeefMe° mebÛeej me$e kesâ efueS mLeeefhele efkeâÙee peelee nw
38. SQL [sše yesme kesâ mebyebOe keâes nševes (Ùee nševes) kesâ Deewj FmeceW [sše š^ebmeefceMeve kesâ efueS DeeJeMÙekeâ mebmeeOeveeW keâe DeeJebnve
efueS efvecveefueefKele ceW mes efkeâme DeeosMe keâe GheÙeesie efkeâÙee Meeefceue nw~
peelee nw? 43. Sme0Sve0Sce0heer0 (mejue vesšJeke&â ØeyebOeve Øeesšeskeâe@ue)
(a) efceševee keâe ØeeLeefcekeâ keâeÙe& keäÙee nw?
(b) efiejevee (a) heâeFue mLeeveeblejCe
(c) nševee (b) otjmLe šefce&veue hengBÛe
(d) Ùes meYeer (c) vesšJeke&â ØeyebOeve Deewj efveiejeveer
Ans. (b) : efiejevee (DROP)~ (d) Jesye yeÇeGefpebie
JÙeeKÙee:- SQL ceW, “DROP” keâceeb[ keâe GheÙeesie Skeâ mebyebOe (Ùee Ans. (c) : Sme Sve Sce heer (mejue vesšJeke&â ØeyebOeve Øeesšeskeâe@ue) keâe
leeefuekeâe) keâes [sšeyesme mes hetjer lejn mes nševes kesâ efueS efkeâÙee peelee nw~ ØeeLeefcekeâ keâeÙe& vesšJeke&â ØeyebOeve Deewj efveiejeveer nw~ Ùen Øeesšeskeâeue
39. [sše yesme ØeyebOeve ØeCeeueer Skeâ Øekeâej keâer - vesšJeke&â ef[JeeFmeeW pewmes jeGšj, efmJeÛe Deewj meJe&j keâer efveiejeveer Deewj
(a) Ùen Skeâ Øekeâej keâe SefhuekesâMeve mee@heäšJesÙej nw~ ØeyebOeve kesâ efueS GheÙeesie efkeâÙee peelee nw~ Sme Sve Sce heer kesâ ceeOÙece
(b) Ùen Skeâ Øekeâej keâe meeceevÙe mee@heäšJesÙej nw~ mes, vesšJeke&â ØeMeemekeâ vesšJeke&â ef[JeeFmeeW keâer efmLeefle keâer efveiejeveer keâj
(c) Ùen Skeâ Øekeâej keâe efmemšce mee@heäšJesÙej nw~ mekeâles nw, mecemÙeeDeeW keâe helee ueiee mekeâles nw Deewj GvnW nue keâj
(d) Ghejesòeâ ceW mes keâesF& veneR mekeâles nw~
Bihar STET 12 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
44. Skeâ meeLe keâF& ceeieeX keâe GheÙeesie keâjkesâ [sše š^ebmeefceMeve (c) keâ"esj Øeef›eâÙee, cee$eelcekeâ Âef° keâesCe, JÙeJeefmLle ØeuesKeve
keâes efkeâme ™he ceW peevee peelee nw? (d) lespeer mes efJekeâeme, JÙeefòeâhejkeâ efveCe&Ùe uesves, DeveewheÛeeefjkeâ
(a) meceeveeblej mebÛejCe mebÛeej
(b) meerefjÙeue š^ebmeefceMeve Ans. (a) : mee@heäšJesÙej FbpeerefveÙeefjbie ceW Skeâ JÙeJeefmLele Deewj mebjefÛele
(c) [ghueskeäme š^ebmeefceMeve Âef°keâesCe DeheveeÙee peelee nw, efpemeceW mee@heäšJesÙej efJekeâeme kesâ efueS Skeâ
(d) neheâ-[ghueskeäme š^ebmeefceMeve keâ"esj Øeef›eâÙee keâe heeueve efkeâÙee peelee nw efpemeceW cee$eelcekeâ lejerkesâ mes
Ans. (a) : Skeâ meeLe keâF& ceeieeW& keâe GheÙeesie keâjkesâ [sše š^ebmeefceMeve mee@heäšJesÙej keâer iegCeJeòee Deewj ØeoMe&ve keâe cetuÙeebkeâve efkeâÙee peelee nw~
keâes ceušerhuesefkeämebie Ùee efJeMes<e ™he mes hewjueue š^ebmeefceMeve kesâ ™he ceW 49. efvecveefueefKele ceW mes keâewve-mee mee@heäšJesÙej ceerefšk^ eâ veneR
peevee pee mekeâlee nw uesefkeâve DeefOekeâ mešerkeâ ™he mes Ùen hewjueue nw?
š^ebmeefceMeve ner nw~ (a) keâes[ keâer ueeFveW (Sue0Dees0meer0)
hewjsueue š^ebmeefceMeve ces [sše keâes Skeâ ner meceÙe ceW keâF& ceeieeX Ùee ÛewveueeW (b) oes<eeW keâer mebKÙee
hej Yespee peelee nw, efpememes [sše š^ebmeheâj keâer ieefle yeÌ{ peeleer nw~ (c) Øeesmesmej keâer ieefle
45. ØeJeen efveÙeb$eCe keâe GheÙeesie efvecve kesâ efueS efkeâÙee peelee (d) hebâkeäMeve hee@Fbš (Sheâ0heer0)
nw- Ans. (c) : mee@heäšJesÙej ceerefš^keâ mee@heäšJesÙej keâer efJeMes<eleeDeeW Deewj
(a) š^ebmeefceMeve kesâ oewjeve [sše neefve keâes jeskeWâ~ iegCeJeòee keâes ceeheves kesâ efueS GheÙeesie efkeâS peeves Jeeues ceeheoC[ nw~
(b) š^ebmeefceMeve keâer [sše oj yeÌ{eSB ~ Øeesmesmej keâer ieefle Skeâ ne[&JesÙej ceerefš^keâ nw, ve efkeâ mee@heäšJesÙej
(c) oesveeW efoMeeDeeW ceW Skeâ meeLe mebÛejCe me#ece keâjW~ ceerefš^keâ~
(d) $egefš megOeej #eceleeDeeW ceW megOeej keâjW~ 50. keâewve-mee mee@heäšJesÙej ef[peeFve Âef° keâesCe cee@[Ùetuej,
Ans. (a) : ØeJeen efveÙeb$eCe keâe GheÙeesie cegKÙe ™he mes š^ebmeefceMeve kesâ keâeÙee&lcekeâ Ieškeâ yeveeves hej DeeOeeefjle nw?
oewjeve [sše neefve kesâ jeskeâves kesâ efueS efkeâÙee peelee nw~ Ùen megefveef§ele (a) Dee@ypeskeäš-DeesefjSbšs[ ef[peeFve
keâjlee nw efkeâ [sše Yespeves Jeeuee ef[JeeFme Øeehlekeâlee& ef[JeeFme keâer #ecelee (b) hebâkeäMeve-DeesefjSbšs[ ef[peeFve
mes DeefOekeâ [sše ve Yespes, efpememes [sše DeesJejheäuees Ùee neefve ve nes~ (c) ØeesšesšeFhe ef[peeFve
46. uesÙej keâer keâewve-meer Ghehejle meePee mebÛeej ceeOÙece lekeâ (d) Pejvee ef[peeFve
hengBÛe keâe ØeyebOeve keâjleer nw? Ans. (b) : mee@heäšJesÙej ef[peeFve Âef°keâesCe pees cee@[Ÿetuej, keâeÙee&lcekeâ
(a) leeefke&âkeâ efuebkeâ efveÙeb$eCe IeškeâeW hej DeeOeeefjle nw Jen nw:
(b) ceeref[Ùee hengBÛe efveÙeb$eCe hebâkeäMeve DeesefjSbšs[ ef[peeFve-hebâkeäMeve DeesefjSbšs[ ef[peeFve ceW
(c) ØeJeen efveÙeb$eCe meyeuesÙej mee@heäšJesÙej keâes efJeefYeVe keâeÙeeX Ùee cee[Ÿetume ceW efJeYeeefpele efkeâÙee peelee
(d) $egefš efveÙeb$eCe meyeuesÙej nw, pees efJeefMe° keâeÙe& keâjles nQ~ Ùen Â=ef°keâesCe mee@heäšJesÙej keâes DeefOekeâ
Ans. (b) : uesÙej keâer pees Ghehejle meeFve mebÛeej ceeOÙece lekeâ hengBÛe cee@[Ÿetuej Deewj ØeyebOeveerÙe yeveelee nw~
keâe ØeyevOeve keâjleer nw, Jen ceeref[Ùee Skeämesme kebâš^esue (MAC) nw~ 51. JneFš yee@keäme hejer#eCe kesâ ™he ceW Yeer peevee peelee nw-
ceeref[Ùee Skeämesme kebâš^esue (MAC) [sše efuebkeâ uesÙej keâer Skeâ Ghehejle (a) keâeÙee&lcekeâ hejer#eCe
nw pees vesšJeke&â ceW ef[JeeFmeeW kesâ yeerÛe [sše kesâ Deeoeve-Øeoeve kesâ efueS (b) yuewkeâ yee@keäme hejer#eCe
ceeOÙece lekeâ hengBÛe keâe ØeyevOeve keâjleer nw~ (c) iueeme yee@keäme hejer#eCe
47. ™efšbie ceW Meeefceue nQ- (d) Ùetefveš hejer#eCe
(a) [sše keâes øesâce ceW efJeYeeefpele keâjvee~ Ans. (c) : JneFš yee@keäme hejer#eCe keâes iueeme yee@keäme hejer#eCe Ùee
(b) ØeJeen efveÙeb$eCe keâe ØeyebOeve mš^keäÛejue hejer#eCe Yeer keâne peelee nw~ Ùen hejer#eCe lekeâveerkeâ
(c) [sše hewkesâš kesâ efueS meyemes DeÛÚe heLe efveOee&efjle keâjvee~ mee@HeäšJesÙej kesâ Deevleefjkeâ keâes[ mebjÛevee Deewj leke&â keâer peebÛe hej kesâefvõle
(d) [sše š^ebmeefceMeve ceW $egefšÙeeW keâes "erkeâ keâjvee~ nesleer nw~
Ans. (c) : ™efšbie ceW cegKÙe ™he mes [sše hewkesâš kesâ efueS meyemes 52. efmemšce hejer#eCe keâe cegKÙe ue#Ùe keäÙee nw?
DeÛÚe heLe efveOee&efjle keâjvee Meeefceue nw~ Ùen vesšJeke&â hejle keâe Skeâ (a) DeueieeJe ceW JÙeefòeâiele IeškeâeW keâe hejer#eCe
cenlJehetCe& keâeÙe&, pees [sše hewkesâšdme keâes Œeesle mes iebleJÙe lekeâ hengBÛeeves (b) efJeefYeVe mee@heäšJesÙej IeškeâeW kesâ yeerÛe SkeâerkeâjCe keâe
kesâ efueS meyemes DeÛÚe ceeie& efveOee&efjle keâjlee nw~ hejer#eCe
48. mee@heäšJesÙej FbpeerefveÙeefjbie keâer ØecegKe efJeMes<eleeSB keäÙee nQ? (c) GheÙeesiekeâlee& kesâ Âef°keâesCe mes mee@heäšJesÙej keâeÙe& #ecelee keâe
(a) hegveŠ ØeÙeespÙelee, DevegketâueveMeeruelee Deewj heefjJele&veerÙelee~ hejer#eCe
(b) ne[&JesÙej keWâefõle, Skeâ yeej efJekeâeme, JÙeefòeâiele ØeÙeeme (d) œeesle keâes[ ceW oes<eeW keâer henÛeeve keâjvee

Bihar STET 13 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
Ans. (c): efmemšce hejer#eCe (System Testing) keâe GoosMdÙe hetjs mekeâleer nw~ Fmekeâe celeueye nw efkeâ Deehe Skeâ ner Fbšjhesâme keâe GheÙeesie
mee@HeäšJesÙej keâes Skeâ mebhetCe& FkeâeF& kesâ ¤he ceW hejKevee neslee nw~ Ùen keâjkesâ efJeefYeVe [sše ØekeâejeW keâes mebMeesefOele keâj mekeâles nQ~ Ùen OOP kesâ
Ùetpej heme&hesefkeäšJe mes osKee peelee nw efkeâ mee@HeäšJesÙej meYeer cegKÙe mlebcYees ceW mes Skeâ nw, pees keâes[ keâes DeefOekeâ ueÛeeruee, mkesâuesyeue
DeeJeMÙekeâleeDeeW keâes mener lejerkesâ mes hetje keâj jne nw Ùee veneR~ Deewj hegve: ØeÙeesie yeveelee nw~
53. mee@heäšJesÙej jKejKeeJe keâes meboefYe&le keâjlee nw- 57. Decetle& efJeefOeÙeeB keäÙee nQ?
(a) m›ewâÛe mes veS mee@heäšJesÙej efJekeâefmele keâjvee~ (a) efJeefOeÙeeB pees yeenjer ogefveÙee kesâ efueS ogie&ce nQ~
(b) efJeefOeÙeeB efpeveceW keâeÙee&vJeÙeve efJeJejCe nQ~
(b) mee@heäšJesÙej kesâ ØeoMe&ve keâes yeÌ{evee~
(c) Mejerj kesâ efyevee efJeefOeÙeeB, Skeâ Decetle& Jeie& ceW heefjYeeef<ele
(c) oes<eeW keâes "erkeâ keâjvee Deewj ceewpetoe mee@heäšJesÙej keâes
(d) efJeefOeÙeeB pees efJejemele ceW veneR efceue mekeâleer nQ~
Dehe[sš keâjvee~
Ans. (c) :
(d) efjueerpe mes henues mee@heäšJesÙej keâe hejer#ee~
Decetle& efJeefOeÙeeB Jes nesleer nQ efpevekeâe efmehe&â veece neslee nw, uesefkeâve keâesF&
Ans. (c) : mee@HeäšJesÙej jKejKeeJe (Software Maitanance) keâe keâeÙee&vJeÙeve (implementation) vener neslee~
DeLe& nw henues mes yeves mee@HeäšJesÙej ceW yeime megOeejvee Fvns kesâJeue (abstract class)Ùee interface kesâ Devoj heefjYeeef<ele
veF& DeeJeeMÙekeâleeDeeW kesâ Devegmeej GmeceW yeoueeJe keâjvee Deewj ØeoMe&ve efkeâÙee ieÙee nw~
Ùee megj#ee megOeejvee~ Fvekeâe body veneR nesiee, Deewj subclass keâes Fvns override
54. efkeâme jKejKeeJe Øeef›eâÙee ceW mee@heäšJesÙej keâer mebjÛevee Deewj keâjkesâ (implement) keâjvee heÌ[lee nw~
keâeÙe&#ecelee keâe omleeJespeerkeâjCe Meeefceue nw? 58. š^eF&-kewâÛe yuee@keâ ceW DeheJeeoeW keâes hekeâÌ[ves Deewj mebYeeueves
(a) efjJeme& FbpeerefveÙeefjbie kesâ efueS efkeâme keâerJe[& keâe GheÙeesie efkeâÙee peelee nw?
(b) efveJeejkeâ jKejKeeJe (a) LeÇe@ve-DeJes (b) kewâÛe
(c) heefjhetCe& jKejKeeJe (c) DeheJeeo (d) nQ[ue
(d) Devegketâueer jKejKeeJe Ans. (b) :
Ans. (a) : efjJeme& FbpeerefveÙeefjbie keâe GösMÙe ceewpetoe mee@HeäšJesÙej keâes try-catch yueekeâ keâe GheÙeesie DeheJeeoeW keâes mebYeeueves kesâ efueS
efyevee Œeesle omleeJespe kesâ mecePevee Deewj Gmekeâer mebjÛevee (Structure) efkeâÙee peelee nw~
Je keâeÙe& #ecelee (functionality) keâes omleeJespe (document) keâjvee try yuee@keâ ceW mebosnemheo keâes[ (efpemeces exception Dee mekeâlee nw)
neslee nw~ efueKee peelee nw~
Ùen efJeMes<e ¤he mes hegjeves, efyevee [ekeäÙetcesšWMeve Jeeues mee@HeäšJesÙej kesâ Ùeefo exception Deelee nw lees Gmes catch yuee@keâ ceW hekeâÌ[e Deewj
efueS efkeâÙee peelee nw~ mebYeeuee peelee nw~
55. peeJee Deewj DevÙe meceeve Yee<eeDeeW ceW ‘‘meghej’’ keâerJe[& 59. Skeâ veÙee Jeie& yeveeves kesâ efueS keäÙee Meyo nw pees ceewpetoe
keâe GösMÙe keäÙee nw? Jeie& mes iegCeeW Deewj JÙeJenejeW keâes efJejemele ceW ueslee nw?
(a) Ùen JebMeeveg›eâce ceW meghejkeäueeme keâes meboefYe&le keâjlee nw~ (a) yeng™helee
(b) Ùen Skeâ veÙee Dee@ypeskeäš FbmšWme yeveelee nw~ (b) SvekewâhmeguesMeve
(c) Ùen Skeâ veS Jeie& keâes heefjYeeef<ele keâjlee nw~ (c) Decetle&lee
(d) Ùen DeheJeeoeW keâes mebYeeuelee nw~ (d) JÙeglheefòe
Ans. (d) : JÙeglheefòe (interitance) Dee@ypeskeäš DeesefjSbšs[ Øeesieeefcebie
Ans. (a) : peye keâesF& keäueeme efkeâmeer otmejer keäueeme mes efJejemele
(inherit) uesleer nw, lees GmeceW Gmeer veece keâer (method) Ùee
(OOP) keâer Skeâ efJeMes<elee nw efpemeceW Skeâ veÙee Jeie&
(subclass/child) Skeâ ceewpetoe Jeie& (subclass/parent) kesâ iegCe
(variable) nes mekeâles nQ~
(Properties) Deewj JÙeJenej (Method) keâes efJejemele ces ueslee nw~
Ssmes ceW, Ùeefo nces (parent class) keâer (method) Ùee
60. Dees0 Dees0 heer0 ceW ‘‘efJeefOe DeesJejjeFef[bie ’’ Meyo keäÙee
constractor keâes (specifically) keâe@ue keâjvee nes, lees nce super
oMee&lee nw?
keâerJe[& keâe ØeÙeesie keâjles nwb~
(a) Skeâ keâ#ee ceW Skeâ ner veece kesâ meeLe keâF& efJeefOeÙeeB yeveevee~
56. Dees0Dees0heer0 ceW yeng™helee keäÙee nw?
(b) Skeâ JÙeglheVe Jeie& ceW Skeâ efJeefOe keâes Gmeer veece kesâ meeLe
(a) kesâJeue Decetle&& keâ#eeDeeW keâe GheÙeesie keâjvee~ heefjYeeef<ele keâjvee pewmee efkeâ DeeOeej Jeie& ceW nw~
(b) JemlegDeeW keâer keâF& ™heeW keâes uesves keâer #ecelee~ (c) Jeie& heoeveg›eâce ceW meYeer efJeefOeÙeeW keâes hegveŠ ueeiet keâjvee~
(c) JebMeeveg›eâce keâe Skeâ Øekeâej~ (d) Skeâ Jeie& ceW efvepeer lejerkeâeW keâes heefjYeeef<ele keâjvee~
(d) efyevee efkeâmeer keâeÙee&vJeÙeve kesâ Skeâ efJeefOe~ Ans. (b) : Method overriding leye neslee nw peye keâesF&
Ans. (b): Dee@ypeskeäš-DeesefjSšs[ Øeesieeefcebie (OOP) ceW, yeng™helee subclass (child class) Deheves subclass (parent class) keâer
(Polynorphism) Gme #ecelee keâes meboefYe&le keâjleer nw peneB Skeâ Jemleg efkeâmeer efJeefOe method keâes Gmeer veece, efjšve& šeFhe, Deewj hewjeceeršj kesâ
efJeefYeVe ™heeW ceW Øekeâš nes mekeâleer nw Ùee efJeefYeVe lejerkeâeW mes keâeÙe& keâj meeLe hegve: heefjYeeef<ele keâjlee nw~
Bihar STET 14 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
61. DNS (Domain Name System)keâe keâeÙe& keäÙee nw? Ans. (a) : SQL ceW [sšeyesme ceW [sše hegveØee&hle keâjves kesâ efueS
(a) F&cesue Yespevee~ SELECT keâLeve keâe GheÙeesie efkeâÙee peelee nw~ Ùen keâLeve Deehekeâes
(b) [escesve veeceeW keâes IP heles ceW DevegJeeo keâjvee~ efJeefMe° keâe@uece Deewj hebefòeâÙeeW keâe ÛeÙeve keâjves keâer Devegceefle oslee nw pees
(c) [sšeyesme ØeyebeOf ele keâjvee~ Deehekeâer DeeJeMÙekeâleeDeeW keâe hetje keâjves nw~
(d) JesyemeeFš megj#ee Øeoeve keâjvee~ 66. Deehe Deheves PHP keâes[ ceW SQL FbpeskeäMeve keâcepeesefjÙeesW
Ans. (b) : [er0Sve0Sme0 (D.N.S. Domain Name System) keâes kewâmes jeskeâ mekeâles nQ?
Skeâ veecekeâjCe [sšeyesme nw efpemeceW Fbšjvesš [escesve veece efmLele nesles nw (a) ueIeg Deewj mejue SQL keäJesjerpe keâe GheÙeesie keâjkesâ~
SJeb Fbšjvesš Øeesšeskeâeue (IP) heleeW ceW DevegJeeefole nesles nw~ Ùen DNS (b) keäJesjerpe ceW GheÙeesiekeâlee& Fvehegš keâe GheÙeesie ve keâjkesâ~
Øeesšeskeâe@ue megefveef§ele keâjlee nw efkeâ Deehekesâ ef[efpešue DevegjesOe Fbšjvesš (c) keâes[ mes $egefš nQ[efuebie keâes nšekeâj~
kesâ ™he ceW %eele efJeMeeue vesšJeke&â hej Deheves mener iebleJÙe lekeâ hengBÛes~ (d) [sše yesme efJeMes<eeefOekeâejeW keâes De#ece keâjkesâ~
62. XML keâe ØeeLeefcekeâ GösMÙe keäÙee nw? Ans. (b) : SQL Injection Skeâ Øekeâej keâer megj#ee keâcepeesjer nw
(a) peefšue SefvecesMeve yeveevee~ efpememes GheÙeesiekeâlee& (Usre) Éeje efoÙee ieÙee Fvehegš SQL keäJesjer ceW
(b) Jesye he=‰eW keâes mšeFue keâjvee~ efyevee efkeâmeer peeBÛe kesâ pegÌ[ peelee nw efpememes nwkeâj [sšeyesme lekeâ hengBÛe
(c) mebjefÛele [sše keâes meb«enerle Deewj heefjJenve~ mekeâles nw Ùee Gmes vegkeâmeeve hengBÛee mekeâles nw~
(d) ÚefJeÙeeW keâes ØeoefMe&le keâjvee~ PHP ceW SQL Injection mes yeÛeves kesâ efueS, keâYeer Yeer GheÙeesie
Ans. (c) : XML keâe ØeeLeefcekeâ GösMÙe mebjefÛele [sše keâes meb«enerle keâlee& kesâ Fvehegš keâes meerOes SQL keäJesjer ceW vener peesÌ[vee ÛeeefnS~ Fmekesâ
Deewj heefjJenve keâjvee nw~ XML keâes heÌ{ves Deewj efueKeves kesâ efueS yepeeÙe Prepared statement Ùee Parameterized Queries keâe
efveef§ele efveÙece nQ pees XML [sše keâes efkeâmeer kesâ Éeje Yeer heÌ{ves keâer GheÙeesie keâjvee ÛeeefnS
Devegceefle osles nQ~ Fmekeâe hetCe& ™he ‘‘SkeämešWefmeyeue ceeke&âDehe ueQiJespe’’ 67. [sšeyesme ceW [sše keâes Dehe[sš keâjves kesâ efueS efkeâme SQL
nw~ keâLeve keâe GheÙeesie efkeâÙee peelee nw?
63. DTD ceW Skeâ FkeâeF& keäÙee nw? (a) yeouevee
(a) efkeâmeer yee¢e mebmeeOeve keâe meboYe& (b) heefjJele&ve
(b) Skeâ ieefCeleerÙe meceerkeâjCe (c) DeÅeleve
(c) Skeâ efJeMes<e XML šwie (d) megOeejvee
(d) peeJee efm›eâhš ceW Skeâ hebâkeäMeve Ans. (c) : SQL (Structured Query Language) ceW, peye nceW
Ans. (a) : Skeâ DTD (Document Type Definition) ceW Skeâ [sšeyesme ceW henues mes ceewpeto [sše keâes yeouevee Ùee Dehe[sš keâjvee neslee
FkeâeF& (Entity) Skeâ veeefcele FkeâeF& nesleer nw pees efkeâmeer Jee¢e mebmeeOeve nw~ lees nce Update keâceeb[ keâe GheÙeesie nw~
Ùee efJeefMe° hee" kesâ šgkeâÌ[s keâe meboYe& osleer nw~ FkeâeF&ÙeeB DTD ceW Ùen keâceeb[ [sšeyesme keâer efkeâmeer šsyeue ceW henues mes ceewpeto efjkeâe[& ceW
heefjYeeef<ele keâer peeleer nw Deewj DML ceW omleeJespe ceW GheÙeesie keâer peeleer yeoueeJe keâjves kesâ efueS neslee nw~
nw leeefkeâ hee" kesâ hegvejeJe=efòe keâes keâce efkeâÙee pee mekesâ Deewj omleeJespe keâer
68. Skeâ Yee<ee efpemekesâ efueS DFA ceewpeto nw Jen Skeâ ..........
mebjÛevee ceW megOeej efkeâÙee pee mekesâ~
nw~
efkeâmeer yee¢e mebmeeOeve keâe meboYe&: Ùen efJekeâuhe FkeâeF& keâer
(a) efveÙeefcele Yee<ee
heefjYee<ee keâes mešerkeâ ™he mes oMee&lee nw~ FkeâeF&ÙeeB Jee¢e mebmeeOeveeW keâe
(b) iewj-efveÙeefcele Yee<ee
meboYe& os mekeâleer nw~ pewmes efkeâ heâeFueW Ùee URL Ùee Jes Deebleefjkeâ hee"
kesâ šgkeâÌ[s nes mekeâles nw~ (c) keâesF& Yeer Yee<ee
(d) veneR keâne pee mekeâlee
64. SQL keâe hetCe& ™he keäÙee nw?
(a) Structured Query Language Ans. (a) : DFA keâe hetje veece nw: Deterministic Finite
(b) Simple Query Language Automation
(c) Systematic Query Logic Ùen Skeâ Deešescesše cee@[ue nw pees keâchÙetšj efJe%eeve ceW GheÙeesie neslee
(d) Standard Query Level nw~ Keemekeâj heâece&ue ueQiJespe Deewj Deešescesše LÙeesjer ceW~
Ans. (a) : SQLkeâe hetCe& ™he Structured Query Language Ùeefo keâesF& Yee<ee efveÙeefcele Yee<ee (Regular Laguage) keânueeleer nw~
nw~ Ùen [sšeyesme efvecee&Ce Deewj nsj-hesâj kesâ efueS Skeâ ceevekeâ Yee<ee nw~ 69. Skeâ DFA kesâ efueS efÉDeeOeejer mebKÙee mJeerkeâej keâjves kesâ
65. SQL ces [sšeyesme mes [sše hegveØee&hle keâjves kesâ efueS efkeâme efueS efpevekeâer oMeceueJe meceleguÙe 3mes efJeYeepÙe nw, meYeer
keâLeve keâe GheÙeesie efkeâÙee peelee nw? mebYeeefJele DeJeMes<e keäÙee nw?
(a) SELECT (b) UPDATE (a) 0 (b) 0, 2
(c) DELETE (d) INSERT (c) 0, 1, 2 (d) 0, 1, 2, 3

Bihar STET 15 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
Ans. (c) : Skeâ (Deterministic finite Automation) nw~ Gmes Ans. (d) : heer0[er0S0 keâes efJeefYeVe lejerkeâeW mes ØeefleefveefOelJe efkeâÙee pee
Ssmeer mebKÙeeSB mJeerkeâej keâjveer nw pees 3 mes efJeYeepÙe (Divisible by mekeâlee nw~
3) nes~ leelkeâeefuekeâ efJeJejCe- Ùen PDA efkeâ efkeâmeer Yeer meceÙe keâer Jele&ceeve
Ùeeveer nceW Ssmeer mebKÙeeDeebs keâes henÛeevevee nw pees Gmes hetjer lejn efmLeefle, Fvehegš Mes<e, Deewj mšwkeâ keâer efmLeefle keâes oMee&lee nw~
efJeYeeefpele nes peeleer nw~ meb›eâceCe leeefuekeâe - Ùen Skeâ meejCeer kesâ ™he ceW neslee nw, efpemeceW
peye keâesF& mebKÙee 3 mes Yeeie oer peeleerr nw lees Gmekesâ Mes<eheâue ØelÙeskeâ efmLeefle Deewj Fvehegš/mšwkeâ ØeleerkeâeW kesâ efueS mebYeeefJele meb›eâceCe
(Remainder) 0, 1, Ùee 2 ceW mes kegâÚ Yeer nes mekeâlee nw~ efoÙes peeles nw~
70. meYeer efmš^bime kesâ efueS efveÙeefcele DeefYeJÙeefòeâ b kesâ meeLe meb›eâceeCe DeejsKe- Ùen Skeâ «eeefheâkeâue ØeefleefveefOelJe neslee nw, efpemeceW
Meg™ nesleer nw Deewj bba kesâ meeLe meceehle nesleer nw~ jepÙeeW keâes Je=òeebs Éeje Deewj meb›eâceCeeW keâes leerjeW Éeje oMee&Ùee peelee nw~
(a) aba*b*bba (b) ab(ab)*bba FmeefueS PDA keâe ØeefleefveefOelJe Fve meYeer lejerkeâeW mes efkeâÙee pee mekeâlee
(c) b(a+b)*bba (d) GuuesefKele meYeer nw~
Ans. (c) : nces Skeâ Ssmeer Regular Expression (RE) ÛeeefnS 74. šŸetefjbie ceMeerve keâe GheÙeesie keâjkesâ ØeefleefveefOelJe efkeâÙee pee
pees mekeâlee nw -
(1) 'b' mes Meg™ nes ; (a) meb›eâceCe leeefuekeâe
(b) meb›eâceCe DeejsKe
(2) 'bba' hej meceehle nes ;
(c) leelkeâeefuekeâ efJeJejCe
(3) Deewj yeerÛe ceW kegâÚ Yeer nes mekeâlee nes~ Ûeens 'a' nes Ùee 'b'~
(d) Ùes meYeer
71. Ùeefo ØeejbefYekeâ DeJemLee keâes ÚesÌ[keâj 5 DeJemLeeDeeW keâe
Ans. (d) : šÙetefjbie ceMeerve keâes efveefcveefueefKele meYeer lejerkeâeW mes
NFA DFA ceW heefjJeefle&le nes peelee nw, lees DFA kesâ
ØeefveefOeefvelJe efkeâÙee pee mekeâlee nw:
efueS DeefOekeâlece mebYeJe mebKÙee ceW DeJemLeeDeeW keâer mebKÙee
meb›eâceCe leeefuekeâe- Ùen šÙetefjbie ceMeerve kesâ meYeer DeJemLeeDeeW Deewj
nw? Fvehegš ØeleerkeâeW kesâ efueS meb›eâceCe efveÙeceeW keâes leeefuekeâe kesâ ™he ceW
(a) 64 (b) 32 oMee&leer nw~
(c) 128 (d) 187
meb›eâceCe DeejsKe- Ùen Skeâ «eeefheâkeâue ØeefleefveefOelJe neslee nw, efpemeceW
Ans. (b) : Ùeefo NFA ceW n DeJemLeeSB nes, lees DFA ceW DeefOekeâlece DeJemLeeDeeW keâes Je=òeeW kesâ ™he ceW Deewj meb›eâceCeeW keâes leerjeW kesâ ™he ceW
mebYeJe DeJemLeeDeeW keâer mebKÙee 2n nesleer nw~ efoKeeÙee peelee nw~
5 DeJemLeeDeeW kesâ efueS DFA = 25 = 32 leelkeâeefuekeâ efJeJejCe- Ùen šÙetefjbie keâer Jele&ceeve efmLeefle, šshe keâer
hejvleg ØeMve ceW 1 (ØeejefcYekeâ DeJemLee) + 5 keâne nw Dele: kegâue 6 efmLeefle,Deewj ns[ keâer efmLeefle keâes Skeâ meeLe JeefCe&le keâjlee nww~ FmeefueS,
DeJemLee šÙetefjbie ceMeerve keâes Fve meYeer lejerkeâeW mes oMee&Ùee pee mekeâlee nw~
DFA = 26 = 64 75. “lot” cegªer Meyo keâe Fmlesceeue efkeâmeves efkeâÙee?
veesš: DeeÙeesie ves Gòej (b) 32 ceevee nw~ (a) mšerJe pee@yme (b) efyeue efmechemeve
72. CFG keâer keâ#ee kesâ lenle yebo veneR nw - (c) kesâefJeve Smšve (d) FveceW mes keâesF& veneR
(a) mebÙeespeve Ans. (c) : kesâefJeve Smšve (Kevin Ashton) ves 1999 ceW
"Internet Of Things" (IOT) Meyo keâe ØeÙeesie henueer yeej efkeâÙee
(b) ØeefleÛÚsove
Lee~
(c) mebIe
kesâefJeve Smšve ves 'IOT' Meyo keâe GheÙeesie Fme efJeÛeej keâes JÙeòeâ keâjves
(d) oesnjeÙee ieÙee mebÙeespeve
kesâ efueS efkeâÙee efkeâ Yeeweflekeâ JemlegSb (pewmes efkeâ GhekeâjCe, meWmej, JemlegSb)
Ans. (b) : Context - Free Grammars (CFGs) efvecve Fbšjvesš kesâ ceeOÙece mes [sše meePee keâj mekeâleer nw~
Dee@hejsMeveeW kesâ efueS yebo nesleer nw: 76. efvece>efueefKele ceW mes keâewve IJT kesâ yeejs ceW mener veneR nw?
mebIe (Union) (a) IOT ceeF›eâeskebâš^esuej keâe GheÙeesie keâjlee nw~
mebÙeespeve (Concatenation) (b) IOT hetjer lejn mes megjef#ele nw~
oesnjeÙee ieÙee mebÙeespeve (Kleere star) (c) IOT meWmej Deewj SkeäšÙetSšme& keâe GheÙeesie keâjlee nw~
CFGs meeceevÙele: ØeefleÛÚsove kesâ efueS yebo veneR nesleer~ (d) IOT JeeÙejuesme lekeâveerkeâ keâe GheÙeesie keâjlee nQ~
73. heer◦[er◦S◦ keâer ceoo mes ØeefleefveefOelJe efkeâÙee pee mekeâlee Ans. (b) : (A) IOT ceeF›eâeskebâš^esuej keâe GheÙeesie keâjlee nw- mener
nw- IOT ef[JeeFmespe ceW [sše Øeesmesefmebie Deewj kebâš^esue kesâ efueS
(a) leelkeâeefuekeâ efJeJejCe (b) meb›eâceCe DeejsKe ceeF›eâeskebâš^esuej keâe GheÙeesie efkeâÙee peelee nw~
(c) me›eâceCe leeefuekeâe (d) Ùes meYeer (B) IOT hetjerrlejn mes megjef#ele nw- ieuele
Bihar STET 16 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
keâesF& Yeer lekeâveerkeâ hetjer lejn mes megjef#ele veneR nesleer, Deewj IOT Ùen Deeceleewj hej 0 mes Meg™ neslee nw,Deewj nj veÙes DevegjesOe hej
ef[JeeFmespe megj#ee KelejeW kesâ Øeefle mebJesoveMeerue nesles nQ pewmes [sše Ûeesjer, keäueeFbš Éeje yeÌ{eÙee pee mekeâlee nw, (0, 1, 2, 3 ----Deeefo)
DeveefOeke=âle Skeämesme Deeefo~ veesš:-DeÙeesie ves Fme ØeMve keâe Gòej (b) 1ceevee nw~
(C) IOT meWmej Deewj SkeäšÙetSšme& keâe GheÙeesie keâjlee nw- mener 81. Ieškeâ efJeMes<e%e ØeCeeueer nw/nQ–
IOT ef[JeeFmespe meWmej mes [sše Øeehle keâjles nw, Deewj SkeäšÙetSšme& mes (a) %eeve DeeOeej
keâeÙe& keâjles nw~ (b) Devegceeve Fbpeve
(D) IOT JeeÙejuesme lekeâveerkeâ keâe GheÙeesie keâjlee nw – mener (c) Ùetpej FbšjHesâme
IOT ceW Deeceleewj hej JeeÙejuesme keâcÙetefvekesâMeve lekeâveerkeâ pewmes wifi, (d) Ùes meYeer
Blutooth, zigbee Deeefo keâe GheÙeesie neslee nw~
Ans. (d) : efJeMes<e%e ØeCeeueer Skeâ keâchÙetšjerke=âle ØeCeeueer nw pees
FmeefueS (B) ieuele keâLeve nw~ efJeMes<e%e keâer lejn keâeÙe& keâjleer nw~ Fmekesâ cegKÙe Ieškeâ nQ - %eeve
77. …. … Skeâ nukesâ Jepeve IOT Øeesšeskeâe@ue nw~ DeeOeej, efpemeceW efJe<eÙe mebyebOeer peevekeâejer nesleer nw~ Devegceeve Fbpeve pees
(a) IP (b) CoAP leke&â keâjkesâ efveCe&Ùe ueslee nw ; Deewj Ùetpej FbšjHesâme pees GheÙeesiekeâlee& mes
(c) HTTP (d) MQTT mebJeeo keâjlee nw~ Ùes meYeer efJeMes<e%e ØeCeeueer yeveeles nQ~
Ans. (d) : MQTT (Message Queuing Telemetry 82. peerle/nej kesâ efveCe&Ùe uesves kesâ efueS iesce š^er ceW Fmlesceeue
Paroport) Skeâ nukeâe, (Publish/sybscribe) DeeOeeefjle cewmesefpebie
efkeâÙee ieÙee SuieesefjLce …… nw?
Øeesšeskeâeue nw~
(a) nsÙegefjefmškeâ Keespe SuieesefjLce
Fmes Keemekeâj IOT ef[JeeFmespe kesâ efueS ef[peeFve efkeâÙee ieÙee nw- peneB
(b) DFS/BFL SuieesefjLce
vesšJeke&â yeQ[efJe[dLe keâce nesleer nw Deewj ef[JeeFmespe keâer Øeesmesefmebie heeJej
meerefcele nesleer nw~ (c) ueeueÛeer Keespe SuieesefjLce
Ùen keâce [sše DeesJejns[ kesâ meeLe lespe Deewj efJeÕemeveerÙe mebÛeej Øeoeve (d) vÙetvlece/DeefOekeâlece SuieesefjLce
keâjlee nw~ Ans. (d) : iesce š^er ceW peerle Ùee nele keâe efveCe&Ùe uesves kesâ efueS
78. WSN kesâ efueS Meyo – minimax SuieesefjLce keâe GheÙeesie efkeâÙee peelee nw~ Ùen oes
efKeueeefÌ[ÙeeW kesâ yeerÛe šve& yesm[ KesueeW (pewmes efškeâ-šwkeâ-šes,Ûesme Deeefo)
(a) JeeÙejuesme ceevekeâ vesšJeke&â
ceW GheÙeesie neslee nw,peneB Skeâ efKeueeÌ[er peerlevee Ûeenlee nw~
(b) JeeÙejuesme meWmej vesšJeke&â
(Maximizer) Deewj otmeje njevee (Minimizer)
(c) JeeÙejuesme meerefjÙeue vesšJeke&â Ùen SuieessefjLce nj mebYeJe Ûeeue keâe cetuÙeebkeâve keâjkesâ meyemes DeÛÚe
(d) JeeÙejuesme efmebieue vesšJeke&â efveCe&Ùe ueslee nw~
Ans. (b) : WSN keâe hetCe&™he JeeÙejuesme meWmej vesšJeke&â nw~ 83. Heâe@jJe[& Ûesefvebie efmemšce ….. nw peneB efheÚÌ[s Ûesefvebie
79. IIOT kesâ efueS Meyo nw? efmemšce …… nw?
(a) DeewÅeesefiekeâ Fbšjvesš Dee@Heâ efLebime (a) ue#Ùe-mebÛeeefuele, ue#Ùe-mebÛeeefuele
(b) FbšsefuepeWš Fbšjvesš Dee@Heâ efLebime (b) ue#Ùe-mebÛeeefuele, [sše-mebÛeeefuele
(c) Deebleefjkeâ Fbšjvesš Dee@Heâ efLebime (c) [sše-mebÛeeefuele, ue#Ùe-mebÛeeefuele
(d) mebmLeeiele Fbšjvesš Dee@Heâ efLebime (d) [sše-mebÛeeefuele, [sše-mebÛeeefuele
Ans. (a) : IIOT keâe hetje ™he- DeewÅeesefiekeâ Fbšjvesš Dee@heâ efLebime Ans. (c) : HeâejJe[& Ûesefvebie (Forward Chaining) Skeâ [sše
(Industriasl Internet of Things) mebÛeeefuele heæefle nw,peneB efveÙeceeW keâes leye lekeâ ueeiet efkeâÙee peelee nw peye
**80. Skeâ cees[yeme šer0 meer0 heer0 hewkesâš ceW uesve-osve lekeâ efve<keâ<e& veneR efvekeâuelee~ Ùen leLÙeeW mes Meg¤ neskeâj efve<keâ<e& lekeâ
henÛeevekeâlee& keâe ef[Heâe@uš ceeve nw? hengBÛeleer nw~
(a) 0 (b) 1 yewkeâJee[& Ûesefvebie (Backward Chaining) Skeâ ue#Ùe mebÛeeefuele
(c) 2 (d) 3 (Goal Driven) heæefle nw, peneB henues ue#Ùe leÙe efkeâÙee peelee nw
Ans. (a) : Modbus TCP hewkesâš kesâ MBAP ns[j ceW pees henuee Deewj efHeâj osKee peelee nw efkeâ Gmes efmeæ keâjves kesâ efueS keâewve-keâewve mes
heâeru[ neslee nw Jen nw: leLÙe DeeJeMÙekeâ nw~
Transaction Identifies (2 bytes): Fmekeâe ØeÙeesie keäueeFbš Éeje FmeefueS –
Yespes ieS DevegjesOe Deewj meJe&j Éeje Yespes ieS Gòej keâes Skeâ-otmejs mes HeâejJe[& Ûesefvebie · [sše mebÛeeefuele
efceueeves (match) kesâ efueS efkeâÙee peelee nw~ yewkeâJee[& Ûesefvebie · ue#Ùe mebÛeeefuele
peye keâesF& TCP keâveskeäMeve Ùee mebosMe Meg™ neslee nw, lees Fmekeâe 84. S0 DeeF&0 Øees«eeefcebie kesâ Fvehegš mesieceWš ceW Meeefceue nQ-
ef[heâe@uš Ùee ØeejbefcYekeâ ceeve 0 neslee nw~ (a) OJeefve (b) iebOe
(c) mheMe& (d) FveceW mes keâesF& veneR

Bihar STET 17 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
Ans. (a) : S0DeeF&0 Øees«eeeEceie kesâ Fvehegš mesieceWš ceW Jes metÛeveeSb 88. efkeâme Øekeâej keâe F&0-keâe@ceme& Skeâ-otmejs mes efvehešves Jeeues
Deeleer nQ efpevns efmemšce mebmeeefOele keâjlee nw~ OJeefve (Sound) Skeâ GheYeesòeâeDeeW hej OÙeeve keWâefõle keâjlee nw?
meceevÙe Fvehegš ceeOÙece nw, pewmes –JeeFme efjkeâefie>Meve efmemšce ceW~ (a) B2B
iebOe Deewj mheMe& pewmes Fvehegš yengle keâce Ùee efJeMes<e efmLeefleÙeeW ceW ØeÙeesie (b) B2C
(c) C2C
nesles nQ, Deewj Deye lekeâ S0DeeF&0 ceW Ùes meceevÙe Fvehegš veneR nw~ (d) C2B
85. efvecveefueefKele ceW mes keâewve efJeMes<e%e ØeCeeefueÙeeW keâer #ecelee
Ans. (c) : C2C (Consumer to Consumer)F& - keâeceme& Jen
veneR nw? Øekeâej nw peneB GheYeesòeâe DevÙe GheYeesòeâeDeeW kesâ meeLe meerOes uesve-osve
(a) meueen osvee keâjles nQ~
(b) ØeoMe&ve GoenjCe : OLX, eBay, Suikr pewmeer JesyemeeFš peneB Skeâ JÙeefòeâ
(c) JÙeeKÙee keâjvee Dehevee GheÙeesie efkeâÙee ngDee meeceeve efkeâmeer DevÙe JÙeefòeâ keâess yesÛelee nw~
(d) efJemleej 89. JÙeJemeeÙe keâer jCeveerelf e Deewj DeeF&0šer0 hej efJeÛeej keâjles
Ans. (d) : efJeMes<e%e ØeCeeueer keâer cegKÙe efJeMes<eleeDeeW ceW Meeefceue nw – meceÙe efvecveefueefKele ceW mes keâewve Skeâ GheÙeesieer megj#ee leb$e nw?
meueen osvee (a) Sefv›eâhMeve
(b) ef[ef›eâhMeve
ØeoMe&ve keâjvee
(c) heâeÙejJee@ue
JÙeeKÙee keâjvee (d) Ùes meYeer
uesefkeâve efJemleej efJeMes<e%e ØeCeeueer keâer keâesF& meceevÙe #ecelee veneR nw~ Ùen Ans. (d) peye JÙeJemeeÙe keâer jCeveerefle Deewj DeeF& šer (metÛevee
veF& peevekeâejer Kego mes peesÌ[ves Ùee meerKeves keâer Øeef›eâÙee keâes oMee&lee nw, ØeewÅeesefiekeâer) keâer megj#ee keâer yeele Deeleer nw lees efvece>efueefKele meYeer leb$e
pees meceevÙeleŠ ceMeerve ueefveËie keâer efJeMes<elee nesleer nw, ve efkeâ heejbheefjkeâ GheÙeesieer nesles nQ :
efJeMes<e%e ØeCeeefueÙeeW keâer~ Sefv›eâÙesMeve
86. efvecveefueefKele ceW mes keâewve-mee efJeMes<e%e ØeCeeefueÙeeW keâer ef[efm›eâhMeve
#eceleeSB nQ? HeâeÙejJee@ue
(a) ceeveJeerÙe #eceleeDeeW keâe nesvee~ 90. F&0-keâe@ceme& uesveosve kesâ oewjeve nceW......megefveef§ele keâjvee
(b) efkeâmeer mecemÙee kesâ efueS Jewkeâefuhekeâ efJekeâuheeW keâe megPeeJe ÛeeefnS~
osvee~ (a) DeKeb[lee
(c) Deheves %eeve keâes heefj<ke=âle keâjvee~ (b) ieesheveerÙelee
(d) ceeveJe efveCe&Ùe efvecee&leeDeeW keâes ØeeflemLeeefhele keâjvee~ (c) megj#ee
Ans. (b) : efJeMes<e%e ØeCeeueer keâer #ecelee nesleer nw, efkeâ Ùen efkeâmeer (d) Ùes meYeer
mecemÙee keâe efJeMues<eCe keâjkesâ Jewkeâefuhekeâ efJekeâuheeW keâe megPeeJe os mekeâleer
Ans. (d) : F& keâeceme& uesve osves kesâ oewjeve efvece>efueefKele meYeer yeeleW
nw~ Ùen GheÙeesiekeâlee& keâes mener efveCe&Ùe uesves ceW meneÙelee keâjleer nw~
megefveef§ele keâjvee yengle pe¤jer neslee nw~
nueebefkeâ Ùen ve lees ceeveJeerÙe #eceleeDeeW mes Ùegòeâ nesleer nw Deewj ve ner
A DeKeb[lee (Integrity) : Ùen megefveef§ele keâjlee nw efkeâ [sše keâe
ceeveJe efveCe&Ùe efvecee&leeDeeW keâes hetjer lejn mes ØeeflemLeeefhele keâjleer nw~
š^ebmeefceMeve kesâ oewjeve keâesF& ÚsÌ[ÚeÌ[ Ùee yeoueeJe ve nes ~ Ùeeefve pees
87. efJeMes<e%e ØeCeeueer ØeewÅeesefiekeâer ceW pesme keâe hetje veece keäÙee
peevekeâejer Yespeer ieÙeer nw Jener mener meueecele hengBÛes~
nw? B ieesheveerÙelee (Confidnetiality): «eenkeâ keâer JÙeefòeâiele Deewj efJeòeerÙe
(a) peeJee efJeMes<e%e ØeCeeueer Mewue peevekeâejer keâes mebjef#ele jKevee leeefkeâ DeveeefOeke=âle ueesie Gmes ve osKe mekeWâ
(b) peeJee efm›eâhš efJeMes<e%e ØeCeeueer Mewue pewmes ›esâef[š keâe[& vebyej,heemeJe[& Deeefo~
(c) peeJee efJeMes<e%e Ghe ØeCeeueer C megj#ee (Security): uesve-osve keâes meeFyej KelejeW mes megjef#ele jKevee
(d) peeJee efm›eâhš efJeMes<e%e Ghe ØeCeeueer – pewmes nwefkebâie,efHeâefMebie, [sše Ûeesjer Deeefo keâe yeÛeeJe~
Ans. (a) : efJeMes<e%e ØeCeeueer ØeewÅeesefiekeâer ceW JESS (pesme) keâe hetje 91. keâevetveer mebj#eCe Skeâ efJeÛeej keâer DeefYeJÙeefòeâ keäÙee nw,
¤he – pewmes efkeâ Skeâ ieerle, Jeeref[Ùees iesce Deewj kegâÚ Øekeâej kesâ
peeJee efJeMes<e%e ØeCeeueer Mewue (Java Expert System Shell) ceeefuekeâevee omleeJespe?
JESS Skeâ efJeMes<e%e ØeCeeueer Mewue nw efpemes peeJee Yee<ee ceW efJekeâefmele (a) veweflekeâlee
efkeâÙee ieÙee nw~ Fmekeâe GheÙeesie efveÙece –DeeOeeefjle leke&â kesâ efueS efkeâÙee (b) keâe@heerjeFš
peelee nw Deewj Ùen CLIPS (C Language Integrated (c) yeewefækeâ mebheoe
Production System) hej DeeOeeefjle nw~ (d) efve<he#e GheÙeesie efmeæeble

Bihar STET 18 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
Ans. (b) : keâe@heerjeFš Skeâ keâevetveer mebj#eCe nw pees Skeâ efJeÛeej keâer 96. cee@efheËâie nw-
DeefYeJÙeefòeâ keâes yeÛeelee nw, pewmes efkeâ ieerle, Jeeref[Ùees iesce keâuee kesâ keâece (a) efÛe$e yeÌ{eves keâer lekeâveerkeâ
Deewj kegâÚ ceeefuekeâevee omleeJespe ~ Jen DeeefOekeâej Gme JÙeefòeâ keâes efoÙee (b) efÛe$e nsjhesâj
peelee nw efpemeves Fme efJeÛeej keâer DeefYeJÙeefòeâ (pewmes mebieerle, meeefneflÙekeâ (c) Skeâ ÚefJe mes otmejer ÚefJe ceW heefjJele&ve
jÛeveeSb Deeefo) keâes henueer yeej lewÙeej efkeâÙee nw~ (d) Ghejesòeâ ceW mes keâesF& veneR
92. CIA ceW keäÙee nw- Ans. (c) : Skeâ ÚefJe mes otmejer ÚefJe ceW heefjJele&ve cee@efhe&âie keânueelee
(a) DeeÕeemeve nw~ Ùen Skeâ efJeMes<e Øekeâej keâer lekeâveerkeâ nw, peneb Skeâ Jemleg Oeerjs-Oeerjs
(b) JeemleefJekeâ otmejer Jemleg ceW yeoue peeleer nw~ cee@ehf eËâie keâe GheÙeesie efheâuceeW, efJe%eeheveeW
(c) GheueyOelee Deewj DevÙe ÂMÙe ceere[f Ùee ceW efkeâÙee peelee nw~
(d) keâesF& Yeer 97. efvecveefueefKele ceW mes keâewve ef[efpešue ÚefJe ØemebmkeâjCe keâe
Ans. (c) : CIA ceW leerve cegKÙe Ieškeâ nwŠ Skeâ GoenjCe nw?
1. Confidentiality (ieesheveerÙelee) (a) keâchÙetšj «eeefheâkeäme
2. Integrity (DeKeb[lee) (b) efhekeämeue
3. Availability (GheueyOelee) (c) kewâceje leb$e
(d) GuuesefKele meYeer
93. Skeâ Øees«eece keäÙee nw, peye kebâhÙetšj hej Fbmše@ue efkeâÙee
Ans. (a) : keâchÙetšj «eeefheâkeäme ef[efpešue ÚefJe ØemebmkeâjCe keâe Skeâ
peelee nw, lees nj keâermš^eskeâ Deewj ceeGme efkeäuekeâ keâes
efjkeâe@[& keâjlee nw? cenlJehetCe& efnmmee nw~ keâchÙetšj «eeefheâkeäme ÚefJeÙeeW keâes yeveeves, nsjhesâj
keâjves Deewj ØeoefMele keâjves kesâ efueS keâchÙetšj keâe GheÙeesie keâjlee nw,
(a) kegbâpeer uee@iej efmemšce
Deewj FmeceW ef[efpešue ÚefJeÙeeW keâes mebmeeefOele keâjvee Meeefceue nw~
(b) ne[&JesÙej kegbâpeer uee@iej
(c) kegâkeâer 98. efvecveefueefKele ceW mes keâewvemee ÚefJe ØemebmkeâjCe Âef° keâesCe
(d) uee@iej peesÌ[W meyemes lespe, meyemes mešerkeâ Deewj ueÛeeruee nw?
Ans. (a) : kegbâpeer uee@iej efmemšce Skeâ Øekeâej keâe mee@heäšJesÙej Ùee (a) heâesšes «eeefheâkeâ
ne[&JesÙej neslee nw, pees kebâchÙetšj hej nj keâermš^eskeâ Deewj ceeGme efkeäuekeâ (b) Fueskeäš^e@efvekeâ
keâes efjkeâe[& keâjlee nw~ Ùen ØeCeeueer Deeceleewj hej OeesKeOeÌ[er, efveiejeveer (c) ef[efpešue
Ùee DevÙe DeJewOe GösMÙeeW kesâ efueS GheÙeesie keâer peeleer nw~ (d) Dee@efhškeâue
94. Dee@ef[Ùees Deewj Jeeref[Ùees mebheerÌ[ve ceW, Meyo rbg JÙeòeâ Ans. (c) : ef[efpešue ÚefJe ØemebmkeâjCe Âef° keâesCe meyemes lespe meyemes
keâjlee nw- mešerkeâ Deewj ueÛeeruee nw keäÙeeWefkeâ Ùen keâchÙetšj-DeeOeeefjle lekeâveerkeâeW keâe
(a) ueeue, keâeuee, iesÇ GheÙeesie keâjkesâ ÚefJeÙeeW keâes yesnlej yeveeves keâe Skeâ ueÛeeruee lejerkeâe
(b) veeruee, iesÇ, mehesâo Øeoeve keâjlee nw~
(c) ueeue, veeruee, nje 99. efvecveefueefKele ceW mes efkeâme GhekeâjCe keâe GheÙeesie petefcebie,
(d) ueeue, veeruee, Yetje efmekegâÌ[vee, IetCe&ve, Deeefo pewmes keâeÙeeX ceW efkeâÙee peelee nw?
Ans. (c) : RBG keâe hetJe& ™he nw: Red (ueeue), Blue (veeruee, (a) efheâušj
Green (nje), (b) vecetveekeâjCe
Ùen jbie cee@[ue ef[efpešue ÚefJeÙeeW Deewj Jeeref[ÙeeW ceW jbieeW keâes ØeoefMe&le (c) FbšjheesuesMeve
keâjves kesâ efueÙes GheÙeesie efkeâÙee peelee nw~ (d) FveceW mes keâesF& veneR
95. nce Dee@ef[Ùees Deewj Jeeref[Ùees mesJeeDeeW keâes ........ceW Ans. (c) : FbšjheesuesMeve keâe GheÙeesie petefcebie, efmekegâ[Ì vee,
efJeYeeefpele keâj mekeâles nQ~ IetCe&ve, Deeefo pewmes keâeÙeeX ceW efkeâÙee peelee nw~ Ùen Skeâ meebefKÙekeâerÙe
(a) 2 JÙeehekeâ ßesefCeÙeeW (b) 1 JÙeehekeâ ßesCeer efJeefOe nw~
(c) 4 JÙeehekeâ ßesefCeÙeeW (d) 3 JÙeehekeâ ßesefCeÙeeW 100. keâewve-mee «es-mlejerÙe heefjJele&ve ÚefJe ceW «es-mlej keâer
Ans. (d) : Dee@ef[Ùees Deewj Jeeref[Ùees mesJeeDeeW keâes leerve JÙeehekeâ ßesefCeÙeeW ieefleMeerue meercee keâes yeÌ{elee nw?
ces efJeYeeefpele efkeâÙee pee mekeâlee nw~ (a) vekeâejelcekeâ heefjJele&ve (b) kebâš^emš mš^sefÛebie
1. mš^erefcebie mesJeeSb (pewmes- Netflix , youtube, spotify) (c) hee@Jej-uee@ heefjJele&ve (d) FveceW mes keâesF& veneR
2. [eGveuees[ Ùee Dee@ve- ef[ceeb[ mesJeeSb (pewmes -iTeenes, Google Ans. (b) : kebâš^emš mš^sefÛebie «es-mlejerÙe heefjJele&ve ÚefJe ceW «es-mlej keâer
play movies) ieefleMeerue meercee keâes yeÌ{elee nw~ Ùen Skeâ ÚefJe mebJeæ&ve lekeâveerkeâ nw pees
3. ueeFJe mš^erefcebie mesJeeSb (pewmes - Twitch, Facebook live) ÚefJe ceW leer›elee ceevees keâer meercee keâes yeÌ{elee nw~
Bihar STET 19 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
 efyenej efJeÅeeueÙe hejer#ee meefceefle
ceeOÙeefcekeâ efMe#ekeâ hee$elee hejer#ee Bihar STET
keâchÙetšj
[Exam. Date - 12.06.2024 Shift-II)]
1. iewj-Deveg›eâefcekeâ efieveleer keâes Øeehle keâjves kesâ efueS efkeâme «es keâes[ ceW Skeâue oMeceueJe Debkeâ (0-9) keâes ØeefleefveefOelJe keâjves kesâ
Øekeâej keâe keâeGbšj Skeâ Øeefleef›eâÙee leb$e keâe GheÙeesie efueS 4 efyešdme keâe GheÙeesie efkeâÙee peelee nw~
keâjlee nw? 4 efyešdme 24 = 16 Deueie-Deueie ceeve (0000 - 1111)
(a) pee@vemeve keâeGbšj (b) efjbie keâeGbšj Øemlegle keâj mekeâles nw~
(c) Dehe-keâeGbšj (d) [eGve keâeGbšj 0 - 9 kesâ oMeceueJe DebkeâeW keâes Øeoe|Mele keâjves kesâ efueS kesâJeue 10
Ans. (a) : iewj-Deveg›eâefcekeâ efieveleer Øeehle keâjves kesâ efueS pee@vemeve Deueie - Deueie mebÙeespevees keâer DeeJeMÙekeâlee nesleer nw, uesefkeâve «es keâes[
keâeGbšj Skeâ Øeefleef›eâÙee leb$e keâe GheÙeesie keâjlee nw~ pee@vemeve keâeGbšj ceW ØelÙeskeâ Debkeâ kesâ efueS 4 efyešdme keâe ner GheÙeesie efkeâÙee peelee nw~
Skeâ efMeheäš jefpemšj keâeGbšj nw, efpemeceW Deefvlece efheäuehe -heäuee@he keâe 5. Skeâ 4-efyeš yeeFvejer S[[j-meyš^skeäšj meefke&âš ceW, Ùeefo
Guše DeeGšhegš henues efheäuehe-heäuee@he kesâ Fvehegš mes pegÌ[e neslee nw~ efveÙeb$eCe Fvehegš IešeJe cees[ hej mesš nw, lees keäÙee
2. Sme0Deej0 efHeäuehe-Heäuee@he keâe GheÙeesie [er0 efHeäuehe- Dee@hejsMeve efkeâÙee peeSiee ?
Heäuee@he yeveeves kesâ efueS efkeâÙee pee mekeâlee nw pees Deheves (a) efyešJeeFpe AND (b) efyešJeeFpe OR
Fvehegš keâes efkeâme lejn mes peesÌ[keâj ? (c) Fmekesâ DeueeJee (d) IešeJe
(a) s = d', r = d' (b) s = d', r = d
Ans. (d) : S[j - meyš^skeäšj meefke&âš ceW 2's keâe@chueerceWš keâe GheÙeesie
(c) s = q, r = q' (d) s = q', r = q
keâjkesâ IešeJe efkeâÙee peelee nw~
Ans. (b) : Skeâ [er0 efheäuehe-heäuee@he keâes Sme0 Deej0 efheäuehe-heäuee@he
Skeâ 4- efyeš yeeFvejer S[j- meyš^ks eäšj ceW, efveÙeb$eCe Fvehegš Ùen
mes yeveeves kesâ efueS efvecve keâveskeäMeve efkeâÙee peelee nw -
efveOee&efjle keâjlee nw efkeâ Dee@hejsMeve peesÌ[ (Addition) nesiee Ùee IešeJe
1. d Fvehegš keâes s (mesš) mes meerOes peesÌ[e peelee nw~ (subtraction).
2. d Fvehegš keâes Skeâ FveJeš&j (NOT mesš) mes iegpeejkeâj r (efjmesš) If control input = 0, then Addition
mes peesÌ[e peelee nw~ If Control input = 1, then subtraction
s = d, r=d' (d keâe@chueerceWš) 6. Skeâ Svekeâes[j keâe GheÙeesie efkeâÙee peelee nw –
keâeÙe& ØeCeeueer (a) Skeâ Sveeuee@ie efmeie>ue keâes ef[efpešue efmeie>ue ceW heefjJeefle&le
Ùeefo d = 1 keâjves kesâ efueS
s = 1, r = 0 efheäuehe-heäuee@he mesš (Q = 1) nes peelee nw~ (b) ef[efpešue efmeie>ue keâes Sveeuee@ie efmeie>ue ceW heefjJeefle&le keâjves
Ùeefo d = 0 kesâ efueS
s = 0, r = 1 efheäuehe-heäuee@he efjmesš (Q = 0) nes peelee nw~ (c) yeeFvejer peevekeâejer keâes efyešdme kesâ Skeâ Úesšs mes mesš ceW
3. efvecveefueefKele ceW mes keâewve Skeâ efÉDeeOeejer mebKÙee nw? Svekeâes[ keâjves kesâ efueS
(a) 36 (b) 10 (d) yeeFvejer peevekeâejer keâes efyešdme kesâ Skeâ yeÌ[s mesš ceW ef[keâes[
(c) 29 (d) 12 keâjves kesâ efueS~
Ans. (b) : efÉDeeOeejer (yeeFvejer) mebKÙee Jen mebKÙee nesleer nw, efpemeceW Ans. (c) : Skeâ Svekeâes[j (Encoder) keâe GheÙeesie yeeFvejer
kesâJeue 0 Deewj 1 kesâ Debkeâ nesles nw~ peevekeâejer keâes efyešdme kesâ Skeâ Úesšs mesš ceW Svekeâes[ keâjves kesâ efueS
10 Skeâ efÉDeeOeejer mebKÙee nw keäÙeeWefkeâ FmeceW kesâJeue 1 Deewj 0 Meeefceue nw~ efkeâÙee peelee nw~ Encoder Skeâ keâe@efcyevesMeveue uee@efpekeâ meefke&âš nw, pees
4. «es keâes[ ceW Skeâue oMeceueJe Debkeâ keâe ØeefleefveefOelJe keâjves keâF& Input ueeFvees ceW mes Skeâ meef›eâÙe Input keâes yeeFvejer keâes[
kesâ efueS efkeâleves efyešdme keâe GheÙeesie efkeâÙee peelee nw? (output) ceW yeouelee nw~
(a) 4 efyešdme (b) 8 efyešdme Fmekeâe cegKÙe GodosMÙe [sše keâes ›eâce efyešdme ceW Øemlegle keâjvee nw-
(c) 16 efyešdme (d) 10 efyešdme En- 8 to 3 Svekeâes[ (8 input lines 3 Bits output)
Ans. (a) : «es keâes[ Skeâ Øekeâej keâe yeeFvejer keâes[ nw, efpemeceW oes 4 to 2 Svekeâes[ (4 input lines 2 Bite output)
›eâceeiele ceeveeW kesâ yeerÛe kesâJeue Skeâ efyeš keâe Devlej neslee nw~ Fmes 7. keâewve-mee keâLeve Skeâ Øees«eecesyeue uee@efpekeâ ef[JeeFme
efjheäueskeäšs[ yeeFvejer keâes[ Yeer keâne peelee nw~ (PLD) keâe mener JeCe&ve keâjlee nw ?
Bihar STET 20 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
 (a) heer0Sue0[er0 keâes kesâJeue Skeâ yeej Øees«eece efkeâÙee pee mekeâlee henuee efyeš («es) 0,
nw Deewj Fmes hegve: keâe@efvHeâiej veneR efkeâÙee pee mekeâlee nw~ 0XOR1 = 1
(b) heer0Sue0[er0 keâe GheÙeesie ef[efpešue meefke&âš ceW cesceesjer 1XOR0 =0
mšesjspe kesâ efueS efJeMes<e ¤he mes efkeâÙee peelee nw~ 0XOR0 = 0
(c) heer0Sue0[er0 keâmšce uee@efpekeâ HebâkeäMeve keâes ueeiett keâjves 11. Skeâ ceeF›eâes kebâhÙetšj efmemšce ceW, helee yeme keäÙee megefJeOee
kesâ efueS Fvehegš Deewj DeeGšhegš Øees«eeefcebie oesveeW kesâ efueS Øeoeve keâjleer nw ?
Devegceefle osles nQ~ (a) meer0heer0Ùet0 Deewj cesceesjer kesâ yeerÛe mebÛeej
(d) heer0Sue0[er0 ceW kesâJeue AND iesš nesles nQ Deewj FmeceW (b) meer0heer0Ùet0 Deewj Fvehegš GhekeâjCeeW kesâ yeerÛe mebÛeej
OR iesš Meeefceue veneR nesles nQ~ (c) meer0heer0Ùet0 Deewj DeeGšhegš GhekeâjCeeW kesâ yeerÛe mebÛeej
Ans. (c) : Programmable logic device (PLD) Skeâ Øekeâej (d) cesceesjer Deewj Fvehegš GhekeâjCeeWb kesâ yeerÛe mebÛeej
keâe Fueskeäš^eefvekeâ ef[JeeFme nw pees GheÙeesiekeâlee& Éeje Øees«eece efkeâÙee pee Ans. (a) : Skeâ ceeF›eâes keâchÙetšj efmemšce ceW, helee yeme (Address
mekeâlee nw leeefkeâ Jen efJeefj° uee@efpekeâ hebâkeäMebme keâes ueeiet keâj mekesâ~ Bus) keâer ØecegKe megefJeOee Ùen nw efkeâ Ùen meer0heer0Ùet0 (C.P.U.) keâes
heer0 Sue0 [er0 keâmšce uee@efpekeâ hebâkeäMebme keâes ueeiet keâjves kesâ efueS Ùen yeleeves ceW ceoo keâjleer nw efkeâ [sše keâneB mes efueKevee nw Deewj keâneB
Input Deewj output Øees«eeefcebie oesveeW kesâ efueS Devegceleer osles nw~ mes heÌ{vee nw~ Ùen yeme cesceesjer ueeskesâMeve keâes efveefo&° keâjleer nw efpememes
8. yeeFvejer IešeJe ceW, Ùeefo Skeâ vekeâejelcekeâ yeeFvejer meer0heer0Ùet0 [sše heÌ{lee Ùee efueKelee nw~
heefjCeece Øeehle neslee nw, lees mekeâejelcekeâ heefjCeece Øeehle DeleŠ mener Gòej (a) meer0heer0Ùet0 Deewj cesceesjer kesâ yeerÛe mebÛeej
keâjves kesâ efueS keäÙee efkeâÙee pee mekeâlee nw? 12. 1971 ceW efkeâme kebâheveer ves henueer yeej JÙeeJemeeefÙekeâ ¤he
(a) heefjCeece ceW meYeer efyešdme keâes Guše keâjW~ mes GheueyOe ceeF›eâesØeesmesmej, Fbšsue 4004 keâer Meg®Deele
(b) heefjCeece ceW 1 peesÌ[s~ keâer ?
(c) heefjCeece keâes 0 mes IešeSbB~ (a) DeeF&0yeer0Sce
(d) heefjCeece keâes –1 mes efJeYeeefpele keâjW~ (b) ceesšesjesuee
Ans. (c) : yeeFvejer IešeJe ceW, Ùeefo Skeâ vekeâejelcekeâ yeeFvejer heefjCeece (c) Fbšsue
Øeehle neslee nw, lees Gmes mekeâejelcekeâ heefjCeece ceW yeoueves kesâ efueS nceW (d) šskeämeme FvmešÍceWšdme
2 kesâ hetjkeâ keâe GheÙeesie keâjvee neslee nw Ans. (c) : 1971 ceW Fbšsue ves henueer yeej JÙeeJemeeefÙekeâ ¤he mes
2's Complement method- GheueyOe ceeF›eâesØeesmesmej, Fbšsue 4004 keâer Meg®Deele keâer Leer~ Ùen
1. heefjCeece ceW meYeer efyešdme keâes Guše keâjW (1's Coplement uesW) Skeâ 4-efyeš ceeF›eâesØeesmesmej Lee, efpemeceW 2300 š^ebefpemšj Les Deewj Ùen
2. Gušs ngS efyešdme ceW 1 peesÌ[s (2's Complement ueW) Skeâ ceerue keâe helLej meeefyele ngDee efpemeveW keâchÙetšj GÅeesie ceW ›eâeefvle
9. Deb«espeer ceW hee" Je<eeX Deewj keâchÙetšj efmemšce ceW keâF& DevÙe uee oer~ Fme Øekeâej efJekeâuhe (c) Fbšsue mener nw~
Yee<eeDeeW keâe ØeefleefveefOelJe keâjves kesâ efueS keâewve-mee 13. [er cee@ie&ve kesâ henues ØecesÙe ceW keâne ieÙee nw efkeâ Ûej kesâ
DeuHeâevÙetcesefjkeâ keâes[ meyemes DeefOekeâ GheÙeesie efkeâÙee ............... keâe hetjkeâ Gvekesâ JÙeefòeâiele hetjkeâ............... kesâ
peelee nw? yejeyej nQ–
(a) EBCDIC (b) Ùetefvekeâes[ (a) AND, OR (b) OR, AND
(c) Deeflejefòeâ -3 keâes[ (d) «es keâes[ (c) NAND, NOR (d) NOR, NAND
Ans. (b) : Deb«espeer ceW hee" keâchÙetšj efmemšce ceW keâF& DevÙe Yee<eeDeeW Ans. (a) : [er ceeie&ve kesâ henues ØecesÙe–
keâe ØeefleefveefOelJe keâjves kesâ efueS Ùetefvekeâes[ (unicode) meyemes DeefOekeâ (A.B)' = A' + B'
GheÙeesie efkeâÙee peelee nw~ oes JesefjSyeue keâe AND keâe hetjkeâ = Gvekesâ JÙeefòeâiele hetjkeâes keâe
Unicode Skeâ DeuheâevÙetceWefjkeâ keâeWe[ f ie efmemšce nw pees ogefveÙee keâer OR
efJeefYeVe Yee<eeDeeW Deewj efueefheÙeeW kesâ De#ejes, efÛevneW Deewj ØeeflekeâeW keâes Ùeneb AND
heÇefleefveefOelJe keâjves kesâ efueS meyemes DeefOekeâ GheÙeesie efkeâÙee peelee nw~ OR +
10. yeeFvejer vebyej 0100 kesâ yejeyej «es keâes[ keäÙee nw ? AND keâe hetjkeâ = OR keâe hetjkeâ
(a) 0011 (b) 1100 keäÙeeWefkeâ henues ØecesÙe ceW AND keâe hetjkeâ, OR kesâ ¤he ceW yeouelee nw
(c) 0110 (d) 1001 14. šeFce-mhesme š^s[Dee@Heâ kesâ cegKÙe š^[ s -Dee@Heâ keäÙee nw ?
Ans. (c) : yeeFvejer vebyej 0100 keâe «es keâes[ 0110 nw~ (a) oesveeW meceÙe peefšuelee Deewj Debleefj#e peefšuelee keâes Skeâ
«es keâes[ Skeâ yeeFvejer vebyej efmemšce nw efpemeceW kesâJeue Skeâ efyeš keâe meeLe keâce keâjvee~
Devlej neslee nw~ (b) oesveeW meceÙe peefšuelee Deewj Debleefj#e peefšuelee oesveeW keâes
yeeFvejer 0100 Skeâ meeLe yeÌ{evee~
Bihar STET 21 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
 (c) yeÌ{er ngF& Debleefj#e peefšuelee keâer ueeiele hej meceÙe keâer 18. Ùeefo keâesF& mecemÙee Sve0heer0-hetCe& nw Deewj Skeâ DevÙe
peefšuelee ceW megOeej mecemÙee yeer keâes yengheo meceÙe ceW mecemÙee kesâ efueS keâce
(d) yeÌ{s ngS meceÙe peefšuelee keâer ueeiele hej Debleefj#e peefšuelee efkeâÙee pee mekeâlee nw, lees mecemÙee yeer kesâ yeejs ceW keäÙee
ceW megOeej keâne pee mekeâlee nw?
Ans. (c) : šeFce mhesme š^s[Dee@heâ kesâ cegKÙe š^s[Dee@heâ Ùen nw efkeâ (a) mecemÙee yeer Yeer Sve0heer0-hetCe& nw
DeefOekeâ Yeb[ejCe (memory) keâe GheÙeesie keâjkesâ keâce meceÙe ceWs DeleŠ (b) mecemÙee yeer heer ceW nw~
yeÌ{er ngF& Debleefj#e peefšuelee keâer ueeiele hej meceÙe keâer peefšuelee ceW (c) mecemÙee yeer nue keâjves ÙeesiÙe veneR nw~
megOeej keâjvee ~ FmeefueS efJekeâuhe (c) mener nw~ (d) mecemÙee yeer Skeâ efveCe&Ùe mecemÙee veneR nww~
15. efyeie-Dees veesšsmeve keâer keâewve-meer mebheefòe yeleeleer nw efkeâ Ans. (a) : Ùeefo keâesF& mecemÙee Sve0 heer0 hetCe& nw Deewj Skeâ DevÙe
Ùeefo f(n)o( g (n)) nw, lees k*f(n) efkeâmeer Yeer mecemÙee yeer keâes yengheo meceÙe ceW mecemÙee kesâ efueS keâce efkeâÙee pee
mekeâejelcekeâ efmLejebkeâ k kesâ efueS o( g (n)) nw~ mekeâlee nw, lees mecemÙee yeer Yeer Sve0 heer0 hetCe& nw~
(a) meb›eâceCeerÙe 19. "n" keâesves kesâ meeLe Skeâ ieÇeHeâ kesâ efueS efkeâleves efkeâveejeW
(b) Fmekesâ DeueeJee keâer DeeJeMeÙekeâlee nesleer nw (keâce-mes-keâce 3
(c) iegCeve yeeF&keâveskeäšs[ Ieškeâ nQ)?
(d) efjHeäuesefkeämešer (a) n
Ans. (c) : efyeie Dees veesšsmeve keâer iegCeve mebheefòe yeleeleer nw efkeâ Ùeefo (b) n + 1
(c) n – 2
f(n)o(g(n)) nw, lees k*f(n) efkeâmeer Yeer mekeâejelcekeâ efmLejebkeâ k kesâ
(d) Jeefš&me keâer mebKÙee kesâ DeeOeej hej efveOee&efjle keâjvee mebYeJe
efueS o(g(n)) nw~
veneR nw~
Ùen Øee@hešea yeleeleer nw efkeâ efkeâmeer hebâkeäMeve keâes Skeâ efmLejebkeâ mes iegCee
Ans. (c) : 'n' keâesves kesâ meeLe Skeâ «eeheâ kesâ0 efueS (n + 1) efkeâveejeW
keâjves hej Gmekeâer Sefmechšesefškeâ «eesLe jsš veneR yeoueleer nw~
keâer DeeJeMÙekeâlee nesleeer nw (keâce-mes-keâce 3 Ieškeâ nQ)~
16. hegvejeJe=efòe meceerkeâjCe t(n) = t(n/2) + 1 Gme SuieesefjLce
20. ceušermšspe «eeHeâ ceW F°lecelee keâer mebheefòe keäÙee nQ?
Øeefleceeve keâer meceÙe peefšuelee keâe ØeefleefveefOelJe keâjlee
(a) efkeâmeer Yeer oes ÛejCeeW kesâ yeerÛe keâe meyemes Úesše jemlee
nw ?
meyemes efkeâveejeW kesâ meeLe Skeâ nw~
(a) efJeYeeefpele Deewj efJepeÙe
(b) efkeâmeer Yeer oes ÛejCeeW kesâ yeerÛe keâe meyemes Úesše jemlee
(b) ueeueÛeer SuieesefjLce
meyemes keâce kegâue ueeiele Jeeuee Skeâ nw~
(c) ieefleMeerue Øees«eeeEcebie
(c) efkeâmeer Yeer oes ÛejCeeW kesâ yeerÛe keâe meyemes Úesše jemlee
(d) yeÇtš Heâesme& GÛÛelece kegâue ueeiele kesâ meeLe Skeâ nw~
Ans. (a) : hegvejeJe=efòe meceerkeâjCe t(n) = t(n/2) + 1 efJeYeeefpele Deewj (d) efkeâmeer Yeer oes ÛejCeeW kesâ yeerÛe keâe meyemes Úesše jemlee
efJepeÙe Øeefleceeve keâer meceÙe peefšuelee keâe ØeefleefveefOelJe keâjlee nw~ meyemes DeefOekeâ keâesves kesâ meeLe Skeâ nQ~
efJeYeeefpele Deewj efJe<eÙe Skeâ SuieesefjLce ef[peeFve Øeefleceeve nw efpemeceW Ans. (b) : ceušermšspe «eeheâ ceW F°lecelee keâer mebheefòe Ùen nw efkeâ
Skeâ mecemÙee keâes Úesšs GhemecemÙeeDeeW ceW hegvejeJeleea kesâ ™he ceW nue efkeâmeer Yeer oes ÛejCeeW kesâ yeerÛe keâe meyemes Úesše jemlee meyemes keâce kegâue
keâjvee Deewj efheâj Ghe-mecemÙeeDeeW kesâ meceeOeeve keâes mecemÙee kesâ meceeOeeve ueeieue Jeeuee Skeâ nw~
kesâ efueS mebÙeesefpele keâjvee nw~ meceerkeâjCe t(n) = t(n/2) + 1 oMee&lee nw
21. LeÇs[s[ yeeFvejer hesÌ[ efJeMes<e ¤he mes efkeâme Øekeâej kesâ
efkeâ n Deekeâej keâer mecemÙee keâes n/2 keâer GhemecemÙee ceW efJeYeeefpele efkeâÙee
š^wJeme&ue kesâ efueS GheÙeesieer nesles nQ?
peelee nw~
(a) ØeerDee@[&j (b) FveDee@[&j
17. cepe& meeBš& Skeâ ÚBšeF& SuieesefjLce keâe GoenjCe nw pees
(c) heesmš Dee@[&j (d) mlej DeeosMe
efJeYeepeve Deewj efJepeÙe Øeefleceeve keâe GheÙeesie keâjlee nw~
Ans. (b) : yeeFvejer š^er ceWs keâF& yeej NULL hee@Fbšme& jnles nw (pewmes
meyemes Kejeye efmLeefle ceW Fmekeâer meceÙe peefšuelee keäÙee nw ?
efkeâ leaf nodes ces left Ùee right child vener nesles)~ LeÇs[s[ yeeFvejer
(a) (Dees) (Sve) š^er ceW Fve NULL hee@Fbšme& keâe GheÙeesie Deieuee Ùee efheÚuee FveDee[&j
(b) (Dees) (Sve uee@ie Sve) vees[ (Thread) keâes mšesj keâjves kesâ efueS efkeâÙee peelee nw~
(c) (Dees) (Sve ^ 2) Fmemes nce Inorder Traversal keâes efyevee recursion Ùee stack kesâ
(d) (Dees) (uee@ie Sve) keâj mekeâles nw~
Ans. (b) : cepe& meeBš& Skeâ ÚBšeF& SuieesefjLce keâe GoenjCe nw pees 22. Skeâ hetCe& efÉDeeOeejer hesÌ[ Skeâ efÉDeeOeejer hesÌ[ nw efpemeceW-
efJeYeepeve Deewj efJe<eÙe Øeefleceeve keâe GheÙeesie keâjlee nw~ meyemes Kejeye (a) meYeer vees[dme ceW Skeâ ner cetuÙe neslee nw~
efmLeefle ceWs Fmekeâer meceÙe peefšuelee (Dees) (Sve uee@ie Sve) nw~ (b) meYeer ueerHeâ vees[dme Skeâ ner mlej hej nesles nQ~

Bihar STET 22 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
 (c) meYeer Deebleefjkeâ vees[dme ceW Skeâ ner ef[«eer nesleer nw~ (a) n (b) 2n
(d) ØelÙeskeâ vees[ kesâ yeeSB meyeš^er ceW oeSB meyeš^er keâer leguevee ceW (c) 2n –1 (d) 2n
yeÌ[er TbÛeeF& nesleer nw~ Ans. (c) : Tower of Hanoi Skeâ Øeefmeæ ieefCeleerÙe mecemÙee nw
Ans. (b) : hetCe& efÉDeeOeejer hes[ Ì (Perfect Binary Tree) keâer oes efpemeceW leerve je@[ (A, B, C) Deewj n ef[mkeâ nesleer nw~ meYeer ef[mkeâ
Keeme efJeMes<eleeSb nesleer nQ- Deekeâej ceW Deueie nesleer nw Deewj Meg™ ceW Skeâ ner je@[ hej jKeer peeleer
nw (yeÌ[er veerÛes, Úesšer Thej)
1-nj Deevleefjkeâ vees[ kesâ oes yeÛÛes nesles nw~
mecemÙee keâes nue keâjves keâe efveÙeceŠ
2-meYeer ueerheâ vees[dme (leaf nodes) Skeâ ner mlej (level) hej nesles nw~
1-Skeâ yeej ceW Skeâ ner ef[mkeâ keâes G"eÙee pee mekeâlee nw~
3-Ùen Skeâ hetjer lejn mes Yeje ngDee hes[ Ì neslee nw~
2-efkeâmeer Yeer je@[ hej yeÌ[er ef[mkeâ kesâ Thej Úesšer ef[mkeâ jKeer pee
23. efkeâme škeäkeâj mebkeâuhe lekeâveerkeâ ceW nwMe šsyeue ceW Deieues
mekeâleer nw, uesefkeâve Guše vener~
GheueyOe Keeueer muee@š ceW škeâjeS ngS lelJeeW keâes jKevee
3-meYeer ef[mkeâ keâes Skeâ je@[ (pewmes A) mes efkeâmeer otmejer je@[ (pewmes
Meeefceue nw? C) hej mLeeveebleefjle keâjvee neslee nw, Skeâ meneÙekeâ je@[ (pewmes B) keâer
(a) jwefKekeâ peeBÛe (b) efÉIeele peeBÛe ceoo mes~
(c) Deueie Ûewefvebie (d) [yeue nwefMebie DeeJeMÙekeâ ÛeeueeW keâer mebKÙeeŠ
Ans. (a) : Linear Probing (jwefKekeâ peeBÛe) Skeâ Deesheve S[^sefmebie Minimum steps = 2n – 1
lekeâveerkeâ nw efpemekeâe GheÙeesie collision (škeäkeâj) keâes nue keâjves kesâ GoenjCe –
efueS efkeâÙee peelee nw~ Ùeefo n = 1, lees ÛeeueW = 21 – 1 = 1
peye oes keys Skeâ ner hash index hej cewhe nesleer nQ, lees – Ùeefo n = 2, lees ÛeeueW = 22 – 1 = 3
Linear probing Gme index mes Deieuee GheueyOe Keeueer muee@š Ùeefo n = 3, lees ÛeeueW = 23 – 1 = 7
Keespelee nw~ Ùeefo n = 4, lees ÛeeueW = 24 – 1 = 15
leye lekeâ Deieuee index (i + 1, i + 2….) Ûeskeâ keâjlee nw peye lekeâ 26. efvece>efueefKele ceW mes keâewve Skeâ Decetle& [sše Øekeâej keâe Skeâ
keâesF& Keeueer mLeeve ve efceue peeS~ meeceevÙe GoenjCe veneR nw?
24. Deveg›eâefcele Deveg›eâefcekeâ Keespe hej Skeâ megOeej nw pees (a) mšwkeâ (b) hetCeeËkeâ
GheÙeesie keâjlee nw- (c) keâleej (d) metÛeer
(a) kegâMeue Keespe kesâ efueS efuebkeâ keâer ieF& metefÛeÙeeB Ans. (b) : Abstract Data Type (ADT) Skeâ [sše mebjÛevee keâer
(b) kegâMeue Keespe kesâ efueS meejefCeÙeeB mewæebeflekeâ heefjYee<ee nesleer nw, efpemeceW [sše keâes meb«enerle Deewj mebmeeefOele
(c) kegâMeue Keespe kesâ efueS nwefMebie keâjves kesâ lejerkeâeW keâes heefjYeeef<ele efkeâÙee peelee nw – uesefkeâve Gmekeâe
(d) kegâMeue Keespe kesâ efueS efÉDeeOeejer Keespe hesÌ[ keâeÙee&vJeÙeve (implementation) efÚhee jnlee nw~
ADT kesâ meeceevÙe GoenjCe –
Ans. (b) : Indexed Sequential Search Skeâ oes-mlejerÙe Keespe
lekeâveerkeâ nw pees [sše keâes kegâMeuelee mes Keespeves kesâ efueS GheÙeesie keâer efJekeâuhe ADT nw keâejCe
peeleer nw, Keemekeâj leye peye [sše henues mes ›eâceyeæ (sorted) nes~ Ùee veneR
Fmeces oes ØecegKe ÛejCe nesles nw- (A) Stack neB Ùen Skeâ Decetle& [sše Øekeâej nw
1-Index Table (meejCeer/Array) efpemeceW LIFO efveÙece ueeiet
meyemes henues Skeâ Fb[skeäme šsyeue yeveeF& peeleer nw, efpemeces ØelÙeskeâ neslee nw~
block keâe henuee SefueceWš jKee peelee nw~ (B) Integer vener Ùen Skeâ [sše Øekeâej (Data
Fme Fb[skeäme ceW Keespe keâj Ùen helee ueieeÙee peelee nw efkeâ actual [sše Type) nw, ve efkeâ ADT Ùen
ceWs efkeâme block ces target SefueceWš nes mekeâlee nw~ Skeâ Value keâes oMee&lee nw,
2-Sequential Search- keâesF& mebjÛevee veneR~
mebyebefOele block ces linear search keâer
peeleer nw~ (C) Queue neB Ùen Yeer ADT nw efpemeceW
GoenjCe – ceeve ueerefpeS Deehekesâ heeme 1000 [sše DeeFšcme nQ~ FIFO efveÙece ueeiet neslee nw~
Deehe GvnW 10 blocks ces yee@šles nwb, nj block ces 100 elements. (D) List neB metÛeer (List) Skeâ ADT nw,
Deehe 10 elements keâer index list yeveeles nwb~ pees ordered collection keâes
henues index list ces search keâjles nw, efheâj mebyebefOele block ceW oMee&leer nw~
linear search. efve<keâ<e& - ADT [sše keâes kewâmes ØeÙeesie efkeâÙee peeÙesiee, Ùen yeleelee nw
25. "n" ef[mkeâ kesâ meeLe nveesF& mecemÙee kesâ še@Jej ceW, mecemÙee – pewmes Stack, Queue, List.
keâes nue keâjves kesâ efueS efkeâleves keâoceeW keâer DeeJeMÙekeâlee peyeefkeâ Integer efmehe&â Skeâ value nw, Deewj ADT keâe efnmmee veneR
nesleer nw? nw~
Bihar STET 23 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
27. keâleej [sše mebjÛevee keâes ueeiet keâjves kesâ efueS efkeâme Øekeâej 30. yeQkeâj keâe SuieesefjLce Skeâ ieeflejesOe keâe Skeâ GoenjCe nw
keâer efuebkeâ keâer ieF& metÛeer meyemes GheÙegòeâ nw? (a) heefjnej SuieesefjLce
(a) Skeâue efuebkeä[ efuemš (b) helee ueieeves kesâ SiieesefjLce
(b) oesiegveer efuebkeâ keâer ieF& metÛeer (c) jeskeâLeece SuieesefjLce
(c) heefjhe$e ¤he mes efuebkeâ keâer ieF& metÛeer (d) meceeefhle SuieesefjLce
(d) efuebkeä[ metÛeer keâe mejCeer keâeÙee&vJeÙeve Ans. (a) : yewkeâj keâe SuieesefjLce Ùen megefveef§ele keâjlee nw efkeâ
Ans. (a) : Queue (keâleej) Skeâ FIFO (First In First Out) efmemšce keâYeer Yeer ieeflejesOe keâer efmLeefle ceW ve peeS~
mebjÛevee nw – efpemeceW henues pees Deelee nw, Jen henues efvekeâuelee nw~ Ùen Øeef›eâÙee keâes mebmeeOeve osves mes henues peeBÛelee nw efkeâ efmemšce
Skeâue efuebkeä[ efuemš (Singly Linked List) ces nce front mes megjef#ele jnsiee Ùee veneR~
ef[ueerš Deewj rear ces Fvemeš& keâj mekeâles nQ~ FmeefueS Ùen ieeflejesOe heefjnej lekeâveerkeâ nw, (Avoidance) ve efkeâ
keäÙeesb Skeâue efuebkeä[ efuemš GheÙegòeâ nw? jeskeâLeece Ùee helee ueieeves keâer~
Fmeces lelJees keâes meerOes Deeies mes nševee Deewj heerÚs peesÌ[vee Deemeeve 31. ieeflejesOe mecemÙee ceW ‘‘keâesF& ØeercesMeve’’ efmLeefle keâe celeueye
neslee nw~ nw efkeâ -
Fmeces efkeâmeer Yeer fixed Deekeâej keâer DeeJeMÙekeâlee vener nesleer (pewmes (a) mebmeeOeveeW keâes Øeef›eâÙeeDeeW mes hetJe& efveOee&efjle efkeâÙee pee
efkeâ array ces nesleer nw)~ mekeâlee nw Deewj otmejeW keâes efoÙee pee mekeâlee nw~
Fmekeâe mebÛeeueve meceÙe (Time complexity) DeeoMe& neslee nw~ (b) Skeâ yeej Skeâ Øeef›eâÙee Skeâ mebmeeOeve jKeleer nw, Fmes
Enqueue (rear ceW peesÌ[vee) 0 (1) peyejve veneR efueÙee pee mekeâlee nw~
Dequeue (front mes nševee) 0 (1) (c) Øeef›eâÙeeSB kesâJeue Skeâ efveef§ele meceÙe kesâ efueS mebmeeOeve jKe
efve<keâ<e&Š Queue keâes efmeieueer efuebkeä[ efuemš mes meyemes lejue Deewj mekeâleer nw~
kegâMeuelee mes ueeiet efkeâÙee pee mekeâlee nw~ (d) Øeef›eâÙeeDeeW keâes Skeâ efveef§ele DeJeefOe kesâ yeeo mebmeeOeve peejer
28. keâewve-mee mšesjspe SueeskesâMeve mš^sšspeer Skeâ Øeef›eâÙee kesâ keâjvee nesiee
efueS cesceesjer keâe meyemes yeÌ[e GheueyOe yuee@keâ DeeJebefšle Ans. (b) : ieeflejesOe mecemÙee ceW ‘‘keâesF& ØeercesMeve’’ keâer efmLeefle keâe
keâjlee nw, Ùen megefveef§ele keâjlee nw efkeâ Mes<e mLeeve celeueye neslee nw efkeâ Skeâ yeej Skeâ Øeef›eâÙee Skeâ mebmeeOeve jKeleer nw,
DeefOekeâlece nw? Fmes peyejve veneR efueÙee pee mekeâlee DeLee&le Ùeefo efkeâmeer Øeef›eâÙee ves keâesF&
(a) meyemes DeÛÚe efHeâš (b) meyemes Kejeye efHeâš mebmeeOeve Øeehle keâj efueÙee nw lees Gmes peyejve Gme mebmeeOeve mes JebefÛele
(c) henuee efHeâš (d) Deieuee efHeâš
veneR efkeâÙee pee mekeâlee nw peye lekeâ efkeâ Jen mJebÙe Gmes ÚesÌ[ ve os~
Ans. (b) : Worst fit (meyemes Kejeye efheâš) jCeveerefle ceW meyemes 32. mebmeeOeve cewefš^keäme Skeâ [sše mebjÛevee nw efpemekeâe GheÙeesie
yeÌ[s GheueyOe cesceesjer yuee@keâ keâes DeeJebešf le efkeâÙee peelee nw~ [s[uee@keâ ef[šskeäMeve SuieesefjLce ceW efkeâÙee peelee nw-
Fmemes Úesšs-Úesšs yeÌ[s yuee@keäme yeÛes jnles nQ, efpememes (a) mebmeeOeve DeeJebšve keâe ØeefleefveefOelJe keâjW~
fragmentation keâce nesleer nw~ (b) Øeef›eâÙeeDeeW kesâ efve<heeove ›eâce keâe ØeefleefveefOelJe keâjW~
DevÙe efJekeâuhe: (c) Øeef›eâÙeeDeeW kesâ efve<heeove Fefleneme keâe ØeefleefveefOelJe keâjles nw~
Best fit – meyemes Úesše GheÙegòeâ yuee@keâ oslee nw (keâce Jesmšspe kesâ (d) Øeef›eâÙeeDeeW keâer ØeeLeefcekeâlee keâe ØeefleefveefOelJe keâjles nw~
efueS) Ans. (a) : [s[uee@keâ ef[šskeäMeve SuieesefjLce ceW mebmeeOeve cewefš^keäme keâe
First fit – henuee GheÙegòeâ yuee@keâ oslee nw~ GheÙeesie Ùen efoKeeves kesâ efueS efkeâÙee peelee nw efkeâ keâewve-meer Øeef›eâÙee
Next fit – First fit pewmee ner nQ, uesefkeâve efheÚueer peien mes Deeies efkeâme mebmeeOeve keâes efkeâleveer cee$ee ceW DeeJebefšle keâj jner nw Ùee efkeâme
Keespelee nw~ mebmeeOeve kesâ efueS Øeleer#ee keâj jner nw~ Ùen cewefš^keäme efmemšce ceW
FmeefueS mener Gòej nw (B) meyemes Kejeye efheâš~ mebmeeOeve kesâ efJelejCe keâer efmLeefle keâes ØeoefMe&le keâjlee nw~
29. efveef§ele efJeYeepeve kesâ meeLe ceušerØees«eeefcebie ceW, Ùeefo 33. Skeâ keâceeb[ ogYeeef<eÙee keâer DeeJeMÙekeâlee GlheVe nesleer nw
efkeâmeer Øeef›eâÙee keâes Skeâ efJeYeepeve ceW GheueyOe nesves keâer keäÙeeWefkeâ-
leguevee ceW DeefOekeâ cesceesjer keâer DeeJeMÙekeâlee nesleer nw, lees (a) ne[&JesÙej meerOes keâeÙe&›eâceeW keâes efve<heeefole veneR keâj mekeâlee
Ùen nes mekeâlee nw- nw~
(a) efJeKeC[ve (b) ieeflejesOe (b) meYeer Øees«eeefcebie Yee<eeDeeW keâes Skeâ ogYeeef<eÙee keâer
(c) ØeeLeefcekeâlee Gueše (d) YegKecejer DeeJeMÙekeâlee nesleer nw~
(c) mee@HeäšJesÙej ne[&JesÙej hej veneR Ûeue mekeâlee nw~
Ans. (a) : efJeKeC[ve leye neslee nw peye cesceesjer Úesšs YeeieeW ceW yebš
peeleer nw Deewj yeÌ[er Øeef›eâÙeeDeeW kesâ efueS heÙee&hle mLeeve veneR neslee~ (d) GheÙeesiekeâlee& GUI keâe GheÙeesie keâjves hej keâceeb[ šeFhe
efveef§ele efJeYeepeve ceW, Ùeefo Øeef›eâÙee keâes DeefOekeâ cessceesjer ÛeeefnS, lees Ùen keâjvee hemebo keâjles nw~
efJeKeC[ve keâe keâejCe yevelee nw~ Ans. (a) : ne[&JesÙej meerOes keâeÙe&›eâceeW keâes efve<heeefole veneR keâj mekeâlee nw~

Bihar STET 24 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
34. "NTFS" Meyo efvece>efueefKele ceW mes efkeâmekeâes meboefYe&le 39. efvece>efueefKele ceW mes keâewve-mee “ [sše kesâ yeejs ceW [sše”
keâjlee nw? keâes meboefYe&le keâjlee nw?
(a) veF& ØeewÅeesefiekeâer HeâeFue efmemšce (a) efveoxefMekeâe (b) cesše [sše
(b) veÙee š^er HeâeFue efmemšce (c) Ghe [sše (d) ieesoece
(c) veF& leeefuekeâe Øekeâej HeâeFue efmemšce Ans. (b) : cesše [sše keâe DeLe& neslee nw ‘‘[sše kesâ yeejs ceW [sše’’
(d) "veF& ØeewÅeesefiekeâer HeâeFue efmemšce" Deewj "veF& leeefuekeâe DeLee&le Ssmee [sše pees efkeâmeer DevÙe [sše keâer peevekeâejer oslee nw~
Øekeâej HeâeFue efmemšce" oesveeW efkeâmeer HeâeFue keâe cesše [sše nes mekeâlee nw pewmes efkeâ HeâeFue keâe veece,
Ans. (a) : NTFS keâe hetje veece nw "New Technology file Deekeâej, efvecee&Ce efleefLe leLee keâe HeâeFue keâe Øekeâej~
system" pees ceeF›eâesmee@Heäš Éeje efJekeâefmele Skeâ HeâeFue nw~ NTFS 40. efvecveefueefKele ceW mes keâewve-mee keâceeb[ [sše [sefHeâefveMeve
keâe GheÙeesie ne[&[^eFJe Deewj DevÙe [sše ceeref[Ùee hej [sše keâes uewibJespe keâceeb[ keâe Skeâ Øekeâej nw?
JÙeJeefmLele keâjves kesâ efueS efkeâÙee peelee nw~ (a) Create (b) Update
35. mebyebOehejkeâ leeefuekeâe ceW, efvecveefueefKele ceW mes efkeâmes (c) Delete (d) Merge
"efJeMes<elee" Meyo Éeje Yeer oMee&Ùee pee mekeâlee nw? Ans. (a) : DDL (Data Definition Language) kesâ Devleie&le Jes
SQL keâcee@[ Deeles nQ pees [sšeyesme keâer mebjÛevee keâes heefjYeeef<ele Ùee
(a) FkeâeF&
mebMeesefOele keâjves kesâ efueS ØeÙeesie efkeâÙee peelee nw~
(b) hebefòeâ
DDL kesâ cegKÙe keâceeb[Š
(c) keâe@uece
CREATE - veÙee šsyeue, [sšeyesme Deeefo yeveevee
(d) "hebefòeâ" Deewj "keâe@uece" oesveeW
ALTER- ceewpetoe mebjÛevee ceW yeoueeJe keâjvee
Ans. (c) : mebyevOehejkeâ leeefuekeâe ceW Sefš^yÙetš keâe celeueye neslee nw
DROP- šsyeue Ùee [sšeyesme keâes nševee~
leeefuekeâe keâe keâe@uece pees efkeâmeer Sbefššer (Entity) kesâ iegCeOece& keâes
41. keâewve-mee heefjJenve Øeesšeskeâe@ue keâveskeäMeve jefnle nw Deewj
oMee&lee nw~
efJelejCe keâer ieejbšer vener nw?
36. "FAT" Meyo keâe DeLe& keäÙee nw?
(a) TCP (b) UDP
(a) HeâeFue DeeJebšve š^er (b) HeâeFue DeeJebšve leeefuekeâe (c) HTTP (d) FTP
(c) HeâeFue DeeJebšve «eeHeâ (d) Ùes meYeer Ans. (b) : UDP (Ùetpej [sše«eece Øeesšeskeâe@ue) keâveskeäMeve jefnle nw~
Ans. (b) : FAT (File Allocation Table) Skeâ HeâeFue efmemšce nw DeLee&led Ùen [eše Yespeves mes henues keâesF& meceefhe&le keâveskeäMeve mLeeefhele
efpemekeâe GheÙeesie Dee@hejsefšbie efmemšce Éeje ef[mkeâ hej HeâeFueeW keâes mšesj Deewj veneR keâjlee nw~ Ùen lespe lees nw uesefkeâve keâce efJeÕemeveerÙe nw keäÙeeWefkeâ Ùen
š^wkeâ keâjves kesâ efueS efkeâÙee peelee nw~ FAT efmemšce ceW Ùen efjkeâe@[& keâjlee nw hewkesâšeW keâer [sefueJejer Ùee Dee@[&j keâer ieejbšer veneR oslee nw~
efkeâ HeâeFueW keâneB efmLele nQ Deewj Gvekeâer mebjÛevee keäÙee nw~ 42. YeerÌ[ efveÙeb$eCe keâes jeskeâves kesâ efueS DeeJeMÙekeâ nw-
37. …… [sše kesâ mebieef"le meb«en nQ pees GvnW Skeämesme Deewj (a) DeveefOeke=âle hengBÛe
ØeyebefOele keâjvee Deemeeve yeveeles nw~ (b) [sše otef<ele
(a) [sšešeFhe (b) [sšeyesme (c) škeâjeJe kesâ keâejCe [sše neefve
(c) [sše (d) ØeCeeueer (d) vesšJeke&â mebkegâueve Deewj ØeoMe&ve ceW efiejeJeš
Ans. (b) : [sšeyesme Skeâ [sše kesâ mebieef"le meb«en (Organized Ans. (a) : YeerÌ[ efveÙeb$eCe keâe cekeâmeo efkeâmeer mLeeve Ùee efmemšce ceW
Collection of Data) keâes keâne peelee nw, efpememes [sše keâes Deemeeveer DelÙeefOekeâ ueesieeW Ùee DevegjesOeeW keâer Yeer[Ì keâes jeskeâe peeÙes, lees -
mes Skeämesme, ØeyebefOele (Manage) Deewj DeÅeleve (Update) efkeâÙee pee efmemšce hej DeveeJeMÙekeâ uees[ veneR heÌ[siee~
mekeâlee nw~ megj#ee yeÌ{sieer~
38. Skeâ mes DeefOekeâ efjmleeW mes Deehekeâe keäÙee celeueye nw? mebmeeOeveeW keâe og®heÙeesie veneR nesiee~
(a) keâF& efMe#ekeâeW kesâ heeme keâF& keâ#eeSB nes mekeâleer nw~ JewÅe GheÙeseiekeâlee&DeeW keâes yesnlej mesJee efceuesieer~
(b) Skeâ keâ#ee ceW keâF& efMe#ekeâ nes mekeâles nQ~ 43. keäueeFbš Deewj meJe&j kesâ yeerÛe HeâeFueeW keâes mLeeveebleefjle
(c) Skeâ efMe#ekeâ keâer keâF& keâ#eeSB nes mekeâleer nw~ keâjves kesâ efueS efkeâme Øeesšeskeâe@ue keâe GheÙeesie efkeâÙee peelee
(d) keâF& keâ#eeDeeW ceW keâF& efMe#ekeâ nes mekeâles nw~ nw?
Ans. (d) : ‘‘Skeâ mes DeefOekeâ efjMleeW’’ keâe DeLe& neslee nw efkeâ Skeâ (a) HTTP (b) FTP
FkeâeF& kesâ keâF& mebyevOe, otmejer FkeâeF& mes nes mekeâles nQ Deewj Gme otmejer (c) SMTP (d) SNMP
FkeâeF& kesâ Yeer keâF& mebyevOe henueer FkeâeF& mes nes mekeâles nQ~ Ans. (b) : keäueeFbš Deewj meJe&j kesâ yeerÛe heâeFueeW keâes mLeeveebleefjle
GoenjCe mJe™he, Skeâ efMe#ekeâ keâF& keâ#eeDeeW keâes heÌ{e mekeâlee nw Deewj keâjves kesâ efueS heâeFue š^ebmeheâj Øeesšeskeâe@ue (FTP) keâe GheÙeesie efkeâÙee
Skeâ keâ#ee ceW keâF& efMe#ekeâ heÌ{e mekeâles nQ~ peelee nw~
Bihar STET 25 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
44. SMTP cegKÙe ¤he mes efvecve kesâ efueS ØeÙeesie efkeâÙee peelee Ans. (c) : mee@heäšJesÙej peerJeve Ûe›eâ cee@[ue
nw- Jeešjheâe@ue, ØeesšesšeFhe Deewj mheeFjue Ùes meYeer mee@heäšJesÙej efJekeâeme
(a) Jesye yeÇeGefpebie (b) HeâeFue mLeeveeblejCe Øeef›eâÙee kesâ efJeefYeVe lejerkeâeW Ùee cee@[ŸetueeW keâes oMee&leW nQ~ FvnW
(c) otjmLe šefce&veue hengBÛe (d) F&cesue Yespevee mee@heäšJesÙej peerJeve Ûe›eâ cee@[ue keâne peelee nw, keäÙeeWefkeâ Ùes mee@heäšJesÙej
Ans. (d) : SMTP Skeâ Fbšjvesš Øeesšeskeâe@ue nw pees F&cesue Yespeves kesâ yeveeves keâer hetjer Øeef›eâÙee keâes Deueie-Deueie ÛejCeeW ceW efJeYeeefpele keâjles
efueS GheÙeesie efkeâÙee peelee nw~ Ùen Skeâ meJe&j mes otmejs meJe&j hej F&cesue nQ~
Yespeves kesâ efueS Skeâ ceevekeâ lejerkeâe Øeoeve keâjlee nw~ 49. mee@HeäšJesÙej efJeÕemeveerÙelee keâes ceeheves kesâ efueS efkeâme
45. HTTP Øeesšeskeâe@ue efvece> kesâ efueS GheÙeesie efkeâÙee peelee ceerefš^keâ keâe GheÙeesie efkeâÙee peelee nw?
nw- (a) HebâkeäMeve hee@Fbš (SHeâ0heer0)
(a) F&cesue mebÛeej (b) keâes[ keâer jsKeeSB (Sue0Dees0meer0)
(b) HeâeFue mLeeveeblejCe (c) cetmee keâe cetue cee@[ue
(d) meeFkeäueescewefškeâ peefšuelee
(c) Jesye yeÇeGefpebie
(d) otjmLe šefce&veue hengBÛe Ans. (c) : cetmee keâe cetue cee@[ue (Musa's basic Model)
mee@heäšJesÙej keâer efJeÕemeveerÙelee (reliability) keâes ceeheves kesâ efueS
Ans. (c) : HTTP (Hyper Text Transfer Protocol) cegKÙe
GheÙeesie efkeâÙee peelee nw~
™he mes Jesye yeÇeGefpebie kesâ efueS GheÙeesie efkeâÙee peelee nw~ Ùen Skeâ
Ùen cee@[ue mee@heäšJesÙej HesâefueÙej jsš, ceerve šeFce št hesâuÙeesj
Øeesšeskeâe@ue nw pees Jesye meJe&j Deewj Jesye yeÇeGpej kesâ yeerÛe ceevekeâejer kesâ
(MTTF) Deeefo ceeheo[eW kesâ DeeOeej hej efJeMues<eCe keâjlee nw~
Deeoeve-Øeoeve keâes efveÙebef$ele keâjlee nw~ peye Deehe efkeâmeer JesyemeeFš keâes
yeÇeGpe keâjles nQ, lees Deehekeâe yeÇeGpej HTTP keâe GheÙeesie keâjkesâ Jesye 50. keâewve-meer hejer#eCe efJeefOe cegKÙe ¤he mes mee@HeäšsJeÙej keâer
hespe keâes meJe&j mes Øeehle keâjlee nw~ keâeÙe&#ecelee keâe hejer#eCe keâjves mes mebyebefOele nw?
(a) yuewkeâ yee@keäme hejer#eCe (b) JneFš yee@keäme hejer#eCe
46. Ùet0[er0heer0 (GheÙeesiekeâlee& [sše«eece Øeesšeskeâe@ue) kesâ
(c) «es yee@keäme hejer#eCe (d) Øeefleieceve hejer#eCe
efueS peevee peelee nw-
Ans. (a) : yuewkeâ yee@keäme hejer#eCe cegKÙe ™he mess mee@heäšJesÙej keâer
(a) efJeÕemeveerÙe, $egefš-cegòeâ [sše š^ebmeefceMeve
keâeÙe&#ecelee (Functionality) keâer pee@Ûe keâjlee nw efyevee Gmekesâ
(b) keâveskeäMeve-GvcegKe mebÛeej
Deevleefjkeâ keâes[ keâes osKes~
(c) keâce DeesJejns[ Deewj lespeer mes [sše š^bemeHeâj Fmeces mes osKee peelee nw efkeâ Fvehegš osves hej DeeGšhegš mener Dee jne nw
(d) mJeÛeeefuele oesnjeS peeves Jeeues DevegjesOeeW kesâ efueS meceLe&ve Ùee vener, Ùeeveer mee@heäšJesÙej GheÙeesiekeâlee& keâer Dehes#eeDeeW kesâ Devegmeej
Ans. (c) : UDP (User Datagram Protocol) Skeâ keâveskeäMeve keâeÙe& keâj jne nw Ùee vener~
jefnle Øeesšeskeâe@ue nw pees [sše keâes efyevee efkeâmeer hegef°keâjCe Ùee $egefš megOeej JneFš yee@keäme hejer#eCe - Fmeces keâes[ keâer Deevleefjkeâ mebjÛevee Deewj
kesâ Yespelee nw~ Fmekeâe cegKÙe GösMÙe lespeer mes [sše š^ebmeheâj keâjvee neslee uee@efpekeâ keâer pee@Ûe keâer peeleer nw
nw, FmeefueS FmeceW DeesJejns[ yengle keâce neslee nw~ «es yee@keäme hejer#eCe - Ùen yuewkeâ Deewj JneFš yee@keäme oesveeW lekeâveerkeâes keâe
47. efvece>efueefKele ceW mes keâewve-mee meyemes Deece Fbšjvesš mebÙeespeve neslee nw~
Øeesšeskeâe@ue nw? Øeefleieceve hejer#eCe (Regression testing) - Ùen megefveef§ele keâjlee nw
(a) TCP/IP efkeâ mee@heäšJesÙej ces veÙee heefjJele&ve keâjves mes hetJe& keâer keâeÙe& #ecelee hej
(b) HTML keâesF& ØeYeeJe heÌ[e neW~
(c) IPX/SPX 51. nwumšs[ keâe meeFbme mee@HeäšJesÙej efkeâmemes mebyebeOf ele nw?
(d) NetBEUI
(a) Øeespeskeäš Mes[dÙetefuebie
Ans. (a) : TCP/IP (Transmission Control
(b) keâes[ efJeMes<eleeDeeW kesâ DeeOeej hej mee@HeäšJesÙej cewefš^keäme
Protocol/Internet Protocol) Skeâ ceevekeâ Fbšjvesš Øeesšeskeâe@ue nw
pees kebâhÙetšjeW keâes Skeâ-otmejs mes mebJeeo keâjves keâer Devegceefle oslee nw~ Ùen (c) GheÙeesiekeâlee& FbšjHesâme ef[peeFve
Øeesšeskeâe@ue keâe Skeâ metš nw pees Fbšjvesš hej [sše Yespeves Deewj Øeehle (d) iegCeJeòee DeeÕeemeve Øeef›eâÙeeSB
keâjves kesâ efueS GheÙeesie efkeâÙee peelee nw~ Ans. (b) : nwumšs[ keâe meeFbme mee@heäšJesÙej cewefš^keâ (Halstead
48. Waterfall, Prototype Deewj Spiral Fmekesâ GoenjCe software Metrics)
nw- Skeâ ieefCeleerÙe cee@[ue nw pees meesme& keâes[ keâer efJeMes<eleeDeeW pewmes-
(a) mee@HeäšJesÙej efJekeâeme Yee<eeSB Dee@hejsšme& keâer mebKÙee
(b) mee@HeäšJesÙej cewefš^keäme Dee@hejsv[dme keâer mebKÙee
(c) mee@HeäšJesÙej peerJeve Ûe›eâ cee@[ue Ùetefvekeâ Dee@hejsšme& Deewj Deehejsv[dme kesâ DeeOeej hej mee@heäšJesÙej keâer
(d) mee@HeäšJesÙej iegCeòeâe ceevekeâ peefšuelee, meeFpe, ØeÙeeme (effort) Deewj meceÙe keâe Devegceeve ueieelee nw~
Bihar STET 26 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
52. hegšvece kesâ cee@[ue keâe GheÙeesie Devegceeve ueieeves kesâ efueS Skeâ Jeie& Skeâ Dee@ypeskeäš kesâ efueS Skeâ yuetefhebÇš Ùee šscheuesš kesâ ™he ceW
efkeâÙee peelee nw- keâeÙe& keâjlee nw~ Ùen Dee@ypeskeäš kesâ iegCeeW Deewj efJeefOeÙeeW keâes heefjYeeef<ele
(a) mee@HeäšJesÙej keâe Deekeâej keâjlee nw~
(b) mee@HeäšJesÙej efJekeâeme meceÙe 56. Dees0Dees0heer0ceW [sše Symš^keäMeve keâe GösMÙe keäÙee nw?
(c) mee@HeäšJesÙej peefšuelee (a) keâeÙee&vJeÙeve efJeJejCe keâes efÚheeves kesâ efueS~
(d) mee@HeäšJesÙej hejer#eCe ØeÙeeme (b) meYeer Deebleefjle efJeJejCeeW keâes Gpeeiej keâjvee~
Ans. (b) : hegšvece keâe cee@[ue (Putnam's Model)efpemes SLIM (c) [sše kesâ oeÙejs keâes meerefcele keâjvee~
cee@[ue (Software Lifecycle Management) Yeer keâne peelee nw, (d) efJeefOeÙeeW keâes meeJe&peefvekeâ keâjvee~
keâe GheÙeesie mee@heäšJesÙej Øeespeskeäš kesâ efueS efJekeâeme meceÙe Ans. (a) : Dee@ypeskeäš DeesefjSbšs[ Øees«eeefcebie (DeesDeesheer) ceW [sše
(development time) Deewj ØeÙeeme (effort) keâe Devegceeve ueieeves ces Symšw^keäMeve keâe GösMÙe keâeÙee&vJeÙeve efJeJejCe keâes efÚheevee nQ~
efkeâÙee peelee nw~ efJekeâuhe (a) mener nw~
Ùen Skeâ Sefcheefjkeâue cee@[ue nw pees efnmšesefjkeâue [sše Deewj 57. Dees0Dees0heer0 ceW vescemhesme keâe ØeeLeefcekeâ keâeÙe& keäÙee nw?
cewLescesefškeâue meceerkeâjCeeW hej DeeOeeefjle neslee nw~ (a) mecetn mes mebyebefOele keâ#eeSB Deewj keâeÙe&
Ùen meeHeä@šJesÙej kesâ Deekeâej (Size) Deewj GheueyOe mebmeeOeveeW (b) Dee@ypeskeäš meboYeeX keâe ØeyebOeve keâjW
(Resource) keâes OÙeeve ces jKekeâj yeleelee nw efkeâ efkeâlevee meceÙe Deewj (c) FbmšWme Ûej keâes heefjYeeef<ele keâjW
ØeÙeeme ueiesiee~ (d) [sše ceeve meb«enerle keâjW
53. mee@HeäšJesÙej ceW efjJeme& FbpeerefveÙeefjbie mes leelheÙe& nw- Ans. (b) : Dees Deesheer(OOP) ces vescemhesme keâe ØeeLeefcekeâ keâeÙe&
(a) efkeâmeer Yeer Ùeespevee kesâ efyevee mee@HeäšJesÙej efJekeâefmele keâjvee~ Dee@ypeskeäš meboYeex keâe ØeyebOeve keâjvee nw~
(b) ceewpetoe mee@HeäšJesÙej keâe efJeMues<eCe Deewj mecePevee~ vescemhesme Skeâ kebâšsvej nw pees JemlegDeeW kesâ veeceeW keâes Skeâ meeLe jKelee nw,
(c) DeeJeMÙekeâleeDeeW kesâ DeeOeej hej veÙee mee@HeäšJesÙej yeveevee~ efpememes veeceeW kesâ škeâjeJe keâes jeskeâe pee mekesâ Deewj keâes[ keâes JÙeJeefmLele
(d) oes<eeW kesâ efueS mee@HeäšsJeÙej IeškeâeW keâe hejer#eCe~
yeveeÙee pee mekesâ~
58. Øees«eefcebie ceW vescemhesme keâe GheÙeesie keâjves keâe cegKÙe GösMÙe
Ans. (b) : efjJeme& FbpeerefveÙeefjbie mee@heäšJesÙej FbpeerefveÙeefjbie keâer Skeâ
Øeef›eâÙee nw efpemeceW efkeâmeer ceewpeto mee@heäšJesÙej efmemšce keâe efJeMues<eCe keäÙee nw ?
efkeâÙee peelee nw leeefkeâ Gmekesâ ef[peeFve, keâeÙe&ØeCeeueer Deewj Ieškeâes keâes (a) [sše SvekewâhmeguesMeve Øeoeve keâjves kesâ efueS~
mecePee pee mekeWâ~ Fmekeâe GodosMÙe [e@keäÙegceWšsMeve yeveevee, keâes[ keâes (b) keâes[ keâes leeefke&âkeâ mecetneW ceW JÙeJeefmLele keâjvee~
mePecevee Ùee GVeÙeve (Modification) keâjvee nes mekeâlee nw - efyevee (c) Decetle& JeieeW& keâes heefjYeeef<ele keâjvee~
cetue Œeesle keâes[ keâes yeoues~ (d) DeheJeeoeW keâes mebYeeueves kesâ efueS~
54. Ì{eÛee pees megmebiele Deewj GÛÛe iegCeJeòee Jeeues mee@HeäšsJeÙej Ans. (b) : vescemhesme keâe cegKÙe GösMÙe nw - keâes[ kesâ Deueie - Deueie
keâes Øeehle keâjves kesâ efueS efoMee-efveoxMe Øeoeve keâjlee nw- efnmmees keâer uee@efpekeâue «eghe (leee|keâkeâ mecetn) ces efJeYeeefpele keâjvee leeefkeâ
(a) keâeskeâescees (b) DeeF&0Sme0Dees0 9000 - keâes[ heÌ{vee Deewj mecePevee Deemeeve nes, Deewj veecees keâe škeâjeJe ve
(c) [suHeâer efJeefOe (d) Ûegmle Iees<eCee-he$e
nes~ FmeefueS efJekeâuhe (b) mener nw~~
59. Dees0Dees0heer0 ceW Fme keâerJe[& keâe GösMÙe keäÙee nw?
Ans. (b) : DeeF&0 Sme0 Dees0 9000(ISO 9000) ceevekeâes keâe Skeâ
heefjJeej nw pees iegCeòeâe ØeyevOeve ØeCeeefueÙeeW (Quality Management (a) Skeâ Jeie& keâe Skeâ veÙee GoenjCe yeveeves kesâ efueS
system- QMS) mes mecyeefvOele nw~ Ùen efkeâmeer mebie"ve keâes GÛÛe (b) meghejkeäueeme keâes meboefYe&le keâjves kesâ efueS
iegCeJeòee Jeeues Glheeoes Deewj mesJeeDeeW keâes ueieeleej efJeleefjle keâjves kesâ (c) Skeâ efmLej efJeefOe keâes keâe@ue keâjvee
efueS efoMee- efveoxMe Øeoeve keâjlee nw mee@heäšJesÙej efJekeâeme kesâ meboYe& ces (d) Skeâ Jeie& kesâ Jele&ceeve GoenjCe keâes meboefYe&le keâjvee
ISO 9000 mee@heäšJesÙej keâer iegCeJeòee megefveefMefÛele keâjves Deewj megOeejves Ans. (d) : This keâerJe[& OOP ceW efkeâmeer keäueeme kesâ Jele&ceeve
kesâ efueS Skeâ mebjefÛele Âef°keâesCe Øeoeve keâjlee nw~ Dee@ypeskeäš keâes oMee&ves kesâ efueS GheÙeesie neslee nw~ peye efkeâmeer keäueeme kesâ
55. efvece>efueefKele ceW mes keâewve-mee Skeâ Jeie& keâes meyemes DeÛÚer Yeerlej keâesF& cesLe[ Ûeue jner nesleer nw Deewj Gmeces this efueKee peelee nw,
lejn mes heefjYeeef<ele keâjlee nw~ lees Ùen Gme keäueeme kesâ Jele&ceeve Dee@ypeskeäš keâer Deesj FMeeje keâjlee nw~
(a) efkeâmeer Jemleg keâe Skeâ GoenjCe FmeefueS efJekeâuhe (d) mener nw~
(b) Dee@ypeskeäšdme yeveeves kesâ efueS Skeâ yuetefØebš 60. heeÙeLeve ceW meghej keâerJe[& keâe GösMÙe keäÙee nw?
(c) Skeâ Ûej nesefu[bie [sše (a) Ùen Jele&ceeve Jeie& kesâ meghejkeäueeme keâes meboefYe&le keâjlee nw~
(d) Jeehemeer ceeve kesâ meeLe Skeâ HebâkeäMeve (b) Ùen Skeâ Jeie& keâe Skeâ veÙee GoenjCe yeveelee nw~
Ans. (b) : Skeâ Jeie& keâes meyemes DeÛÚer lejn mes heefjYeeef<ele, (c) Ùen DeheJeeoeW keâes mebYeeuelee nw~
Dee@ypeskeäšdme yeveeves kesâ efueS Skeâ yuetefhebÇš~ (d) Ùen Skeâ veS Jeie& keâes heefjYeeef<ele keâjlee nw~

Bihar STET 27 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
Ans. (a) : heeÙeLeve ceW Super keâe GheÙeesie leye efkeâÙee peelee nw peye 64. [er0Dees0Sce0 š^er mebjÛevee SÛe0šer0Sce0Sue0 lelJeeW
nce efkeâmeer Subclass mes Superclass kesâ cesLe[ Ùee Constructor kesâ heoveg›eâce keâes keâwmes oMee&leer nw?
keâes keâe@ue keâjvee Ûeenles nbw~ (a) JeCee&veg›eâce ceW
FmeefueS efJekeâuhe (a) mener nw~ (b) lelJe kesâ Deekeâej kesâ DeeOeej
61. neFhejefuebkeâ yeveeves kesâ efueS efkeâme HTML šwie keâe (c) parent-child kesâ efjMles ceW
GheÙeesie efkeâÙee peelee nw? (d) lelJe kesâ jbie kesâ Devegmeej
(a) <hl> (b) <a> Ans. (c) : [erDeesSce (Document Object Model) š^er mebjÛevee
(c) <link> (d) <url> SÛešerSceSue lelJeeW kesâ heoeveg›eâce keâes Skeâ hesÌ[ keâer lejn oMee&leer nw,
Ans. (b) : neFhejefuebkeâ yeveeves kesâefueS HTML ceW <a> šwie keâe peneB ØelÙeskeâ SÛešerSceSue šwie Skeâ vees[ neslee nw~
GheÙeesie efkeâÙee peelee nw~ Fme šwie keâe GheÙeesie Skeâ hespe keâes otmejs mes Fme hesÌ[ ceW ¤š vees[ <html> lelJe nesleer nw, Deewj DevÙe lelJe Fmekesâ
peesÌ[ves kesâ efueS efkeâÙee nw~ < a > šwie kesâ Yeerlej hrey efJeMes<elee keâe yeveles , heesles, Deeefo yeveles nw~
GheÙeesie efuebkeâ kesâ iebleCÙe keâes efveefo&° keâjves kesâ efueS efkeâÙee peelee nw~ Goe0 kesâ efueS Deehekesâ heeme efvece>efueefKele keâes[ nes mekeâles nw-
Code-
62. keâewve-meer ueeFyeÇsjer HTML omleeJespe š^wJeme&ue Deewj
<html>
nsjheâj pewmes peeJee efm›eâ° keâeÙeex keâes mejue yeveeleer nw? <head>
(a) JavaFX <title > My Page < title></head>
(b) yetšmš^whe <body>
(c) Øeefleef›eâÙee keâjvee <h1>welcome</h1>
<P>This is a paragraph. </P>
(d) jQuery
</body>
Ans. (d) : jQuery ueeFyeÇsjer HTML (Hyper Text Markups </html>
Language) omleeJespe š^wJeme&ue Deewj nsjHesâj pewmes peeJeeefm›eâhš keâeÙeeW& 65. XML ceW omleeJespe Øekeâej heefjYee<ee (DTD keâer Yetefcekeâe
keâes mejue yeveeleer nw~ keäÙee nw?
Ùen Skeâ lespe, Úesšer Deewj megefJeOee mebheVe peeJeeefm›eâhš ueeFyeÇsjer nw pees (a) Ùen XML omleeJespe keâer mebjÛevee Deewj [sše Øekeâej keâes
keâF& yeÇeGpejeW ceW keâece keâjleer nw~ heefjYeeef<ele keâjlee nw~
Query yengle meejs meeceevÙe keâeÙe& keâe GheÙeesie keâjleer nw efpevns hetje (b) Ùen XML omleeJespe kesâ efueS yeeÜe mebmeeOeveeW keâer Skeâ
keâjves kesâ efueS peeJeeefm›eâhš kesâ keâF& hebefòeâÙeeW keâer DeeJeMÙekeâlee nesleer nw, metÛeer Øeoeve keâjlee nw~
Ùen Gve efJeefOeÙeeW ceW uehesšlee nw efpevnW Deehe keâes[ keâer Skeâ hebeefòeâ kesâ (c) Ùen XML lelJeeW kesâ efueS mšeFefuebie efveÙece efveefo&°
meeLe keâe@ue keâj mekeâles nw~ keâjlee nw~
Gòej- ueeFyeÇsjer HTML omleeJespe š^Jeme&ue Deewj nsjHesâj pewmes efjke=âmš (d) Ùen XML omleeJespe keâer meecee«eer keâes Sefv›eâ° keâjlee nw~
Joueey keâes mejue yeveeleer nw~ Ans. (a) : XML ceW omleeJespe Øekeâej heefjYee<ee DTD
peeJeeefm›eâhš Jesyehespe keâer meece«eer keâes ieefleMeerue ¤he mes yeoueves kesâ (Document Type Definition) keâer Yetefcekeâe XML omleeJespe keâer
efueS DOM keâe nsjeHesâjer efkeâÙee pee mekeâlee nw~ Joueey ueeFyeÇsjer keâes mebjÛevee Deesj meece«eer keâes heefjYeeef<ele keâjvee nw~ Ùen efveÙece Skeâ mess nw
Deece leewj hej Skeâ Skeâue peeJeeefm›eâhš HeâeFue kesâ ®he ceW efJeleefjle keâj pees yeleelee nw efkeâ XML omleeJespe ceW keâewve mes lelJe Deewj efJeMes<eleeSB
mekeâles nw, pees DOM Fowj Deewj Ajax HeâbkeäMeve meefnle Fmekesâ meYeer JewOe nw, Deewj Jes efkeâme ›eâce ceW efoKeeF& os mekeâles nw, DTD keâe
FbšjHewâme keâes heefjYeeef<ele keâjlee nw~ GheÙeesie XML omleeJespeeW keâes ceevÙe keâjves kesâ efueS efkeâÙee pee mekeâlee
63. AJAX keâe hetCe& ¤he keäÙee nw? nw, Ùen megefveef§ele keâjles ngS efkeâ Jes Skeâ efJeefMe° Øee™he keâe heeueve
(a) DeleguÙekeâeefuekeâ peeJeeefmkeâ° Deewj XML keâjles nw~ XML keâe GheÙeesie efJeefYeVe keâchÙetšj efmemšce pewmes-
yesyemeeFšes, [sšeyesme Deewj le=leerÙe–he#e DevegØeÙeesie kesâ yeerÛe metÛevee keâe
(b) mJeÛeeefuele peeJeeefmkeÇâ° Deewj XHTML
Deeoeve-Øeoeve keâjves kesâ efueS efkeâÙee pee mekeâlee nw~
(c) GVele peeJeeefm›eâ° Deewj XML
66. S[esye [^erceJeerJej Deeceleewj hej efkeâmekesâ efueS GheÙeesie
(d) DeleguÙekeâeefuekeâ JSON Deewj XHTML
efkeâÙee peelee nw?
Ans. (a) : AJ AX keâe hetCe& ®he Sefmeb›eâesveme peeJeeefm›eâhš Deewj
(a) Jeeref[ÙeeW mebheeove (b) «eeefheâkeâ ef[peeFve
XML nw, Ùen Skeâ lekeâveerkeâ nw pees Jesye hespeeW keâes hetjs hespe keâes hegveŠ
(c) Jesye [sJeueheceWš (d) 3-[er cee@[efuebie
uees[ efkeâS efyevee Dehe[sš keâjves kesâ efueS Devegceefle osleer nw~ Ùen meJe&j
Ans. (c) : S[esye [^erceJeerJej keâe GheÙeesie Deeceleewj hej HTML,
kesâ meeLe [sše keâe Deeoeve –Øeoeve keâjkesâ Deewj Jesye hespe kesâ kesâJeue kegâÚ
CSS, Java script Deewj DevÙe Jesye lekeâveerkeâeW kesâ meeLe JesyemeeFš
efnmmees keâes mebMeesefOele keâjkesâ keâece keâjlee nw~
yeveeves Deewj ØekeâeefMele keâjves kesâ efueS ØeÙeesie efkeâÙee peelee nw~ Ùen Jesye
Gòej- AJ AX keâe hetCe& ¤he Sbefme›eâesveme peeJeeefmke=âhš Deewj XML
hespe, Jesye SefhuekesâMeve Deewj DevÙe Jesye DeeOeeefjle heefjÙeespeveeDeeW keâes
neslee nw~ efJekeâefmele keâjves ceW ceoo keâjlee nw~ [^erceJeerJej Meg™Deeleer ueesieeW mes
Bihar STET 28 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
ueskeâj GVele hesMesJejeW lekeâ efJeefYeVe Øekeâej kesâ Jesye ef[peeFvejeW kesâ efueS Ans. (b): Skeâ DFA pees 101 kesâ meeLe meceehle nesves Jeeueer efmš^ib e keâes
GheÙeesieer nw Ùen macos Deewj efJeb[espe Dee@hejsefšbie efmemšce kesâ efueS mJeerkeâej keâjlee nw Gmes efvecveefueefKele DeJemLeeDeeW keâer DeeJeMÙekeâlee nesieer~
GheueyeIe nw~ [^erceJeerJej keâe veJeervelece mebmkeâjCe ceF& 2025 ceW peejer 1. ØeejbefYekeâ DeJemLee– Ùen DeJemLee DFA keâer Meg™Deele keâes oMee&leer nw~
efkeâÙee ieÙee nw~ 2. 1 keâer henÛeeve- peye DFA keâes 1 efceuelee nw, lees Ùen Skeâ veF&
67. SQL ceW “Into meefcceefuele keâjW” keâLeve keâe GösMÙe keäÙee nw? DeJemLee ceW Ûeuee peelee nw~ pees 1 keâer henÛeeve keâes oMee&leer nw~
(a) efkeâmeer leeefuekeâe mes [sše hegveØee&hle keâjves kesâ efueS 3. 10 keâer henÛeevee– peye DFA keâes 1 kesâ yeeo 0 efceuelee nw lees
(b) efkeâmeer leeefuekeâe ceW [sše DeÅeleve keâjves kesâ efueS Ùen Skeâ Deewj DeJemLee ceW Ûeuee peelee nw pees 10 keâer henÛeeve keâes
(c) leeefuekeâe ceW veÙee [sše meefcceefuele keâjves kesâ efueS oMee&leer nw~
(d) efkeâmeer leeefuekeâe mes [sše nševes kesâ efueS 4. 101 keâer henÛeeve– peye DFA keâes 10 kesâ yeeo 1 efceuelee nw, lees
Ans. (c) : SQL ceW "Insert Into" keâe ØeÙeesie efkeâmeer leeefuekeâe ceW Ùen Debeflece DeJemLee ceW Ûeuee peelee nw pees 101 keâer henÛeeve keâes
veF& hebefòeâÙeeb meefcceefuele keâjves kesâ efueS efkeâÙee peelee nw~ Ùen leeefuekeâe oMee&leer nw Deewj efmš^bie keâes mJeerkeâej keâjleer nw~
keâe veece Deewj meefcceefuele efkeâS peeves Jeeues [ssše kesâ ceeve efveefo&° keâjlee 71. efmš^bie Skeäme keâes heefjefcele Dee@šescesše Éeje mJeerkeâej efkeâÙee
nw~ GoenjCe Omdrty Omyp vidyp,rtd (Customer 9 0, peelee nw Ùeefo
Name, city) values (1, John Doe", New York)" keâLeve (a) *(q,x) EA (b) (q,x) EA
"customers" leeefuekeâe ceW Skeâ veÙee efjkeâe@[& meefcceefuele keâjsiee (c) (Q0,x) EA (d) *(Q0,x) EA
efpemeceW costomers ID 1, Name 'John Doe' Deewj City New Ans. (a) : * (q, x) EA Ùen mebkesâleve efJemleeefjle meb›eâceCe hebâkeäMeve
Yark nesiee~ skeâe ØeefleefveefOelJe keâjlee nw, peneB * Skeâ DeJemLee ‘q’ Deewj Skeâ efmš^bie
68. efvecveefueefKele ceW mes keâewve-mee efkeäJeve-šŸetheue (heeBÛe ‘x’ ueslee nw, leLee mechetCe& efmš^bie keâes mebMeesefOele keâjves kesâ yeeo Øeehle
šheue) heefjefcele Dee@šescesše keâe efnmmee veneR nw - DeJemLee keâes ueewšelee nw~ ‘F&S’ mebYeJele: mJeerkeâej keâjves Jeeues jepÙeeW kesâ
(a) Fvehegš JeCe&ceeuee (b) DeeGšhegš mecetn keâe ØeefleefveefOelJe keâjlee nw~
(c) ØeejbefYekeâ DeJemLee (d) meb›eâceCe hebâkeäMeve FmeefueS efJekeâuhe (a) mener nw~
Ans. (b) : DeeGšhegš JeCe&ceeuee Deeceleewj hej š^ebme[dÙetmej 72. šsš meÛe Ùee ieuele keâLeve ØelÙeskeâ mener-jwefKeÙe JÙeekeâjCe
(Transducer) ceW GheÙeesie keâer peeleer nw, pees Fvehegš kesâ DeeOeej hej Skeâ efveÙeefcele Yee<ee GlheVe keâjlee nw~
DeeGšhegš GlheVe keâjles nw~ heefjefceefle Dee@šescesše cegKÙe ™he mes Fvehegš (a) melÙe (b) ieuele
keâes mJeerkeâej keâjves Ùee DemJeerkeâej keâjves kesâ efueS ef[peeFve efkeâÙe (c) nes mekeâleer nw (d) veneR keân mekeâles
ieÙes nw~ Ans. (a) : jsKeerÙe JÙeekeâjCe (Lenear Grammar) oes Øekeâej keâer
69. Skeâ DFA efvecve Øee™he ceW ØeefleefveefOelJe keâj mekeâlee nw - nesleer nw:-
(a) meb›eâceCe «eeheâ oeBÙee jsKeerÙe
(b) meb›eâceCe leeefuekeâe yeeBÙee jsKeerÙe
(c) C keâes[ ØelÙeskeâ mener jsKeerÙe JÙeekeâjCe Skeâ efveÙeefcele Yee<ee GlheVe keâjlee nw~
(d) Ùes meYeer FmeefueS efJekeâuhe (a) mener nw~
Ans. (d) : Skeâ DFA (Deterministic Finic Automatan) pees 73. Skeâ meboYe& cegòeâ JÙeekeâjCe pees Ûee@cmkeâer meeceevÙe ™he ceW
efJeefYeVe lejerkeâeW mes ØeefleefveefOelJe efkeâÙee pee mekeâlee nw efpeveceW mes kegâÚ nw Ùeefo nj Glheeove heâe@ce& keâe nw-
ØecegKe lejerkesâ nw~
(a) A BC Ùee A A
ØeefleefveefOelJe kesâ lejerkesâ
(b) A BC Ùee A a
1. meb›eâceCe ieÇeheâ (Transition Graph) Skeâ efveoxefMele «eeheâ efpemeceW
(c) A BCa Ùee B b
DeJemLeeSb vees[dme kesâ ™he ceW Deewj meb›eâceCe Spe kesâ ™he ceW oMee&Ùes
(d) Ghejesòeâ ceW mes keâesF& veneR
peeles nw~
Ans. (b) : Ûee@cmkeâer meeceevÙe ™he (CNF) Skeâ efJeMes<e Øekeâej keâe
2. meb›eâceCe leeefuekeâe (Transition Table): Skeâ leeefuekeâe efpemeceW
Jele&ceeve DeJemLee Deewj Fvehegš Øeleerkeâ kesâ DeeOeej hej Deieueer DeJemLee JÙeekeâjCe nw pees Fme ™he ceW nesvee ÛeeefnS:
keâe efJeJejCe neslee nw~ 1. A BC - peneB A, B Deewj C leerveeW iewj-Debeflece Øeleerkeâ nw~
Ùeeveer yeeFË Deesj Skeâ non-terminal nesiee Deewj oeFË Deesj oes non-
70. vÙetvelece DeJemLeeDeeW keâer mebKÙee 101 kesâ meeLe efmš^bie
terminals neWies~
Úesj keâes mJeerkeâej keâjves keâer DeeJeMÙekeâlee nw -
2. A a - peneB A Skeâ iewj-Debeflece Deewj a Skeâ non-terminal
(a) 3
(b) 2
Debeflece Øeleerkeâ nw~ Ùeeveer Skeâ non-terminal meerOes Skeâ terminal
(c) 1 cebs yeoue mekeâlee nw~
(d) keâe ØeefleefveefOelJe vener efkeâÙee pee mekeâlee FmeefueS efJekeâuhe (b) mener nw~
Bihar STET 29 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
74. keâewve-meer mecemÙeeSB DeÙeesiÙe nw? 80. [sše keâes Skeâ Øee™he ceW heefjJeefle&le keâjves keâer Øeef›eâÙee
(a) jeskeâves keâer mecemÙee efpemes efkeâmeer DevÙe GheÙeesiekeâlee& Éeje veneR heÌ{e pee
(b) yetefueÙeve meblegef° mecemÙee mekeâlee nw-
(c) jeskeâves keâer mecemÙee Deewj yetefueÙeve meblege°
f keâer mecemÙee (a) hebpeerkeâjCe (b) uee@efkebâie
(d) GuuesefKele ceW mes keâesF& veneR (c) Sefv›eâhš keâjvee (d) efÚheevee
Ans. (a) : jeskeâves keâer mecemÙee Skeâ DeÙeesiÙe mecemÙee nw, Fmekeâe Ans. (c) : Sefv›eâhš keâjvee Jen Øeef›eâÙee nQ efpemeceW [sše keâes Skeâ
celeueye Ùen nw efkeâ keâesF& Suieesefjoce veneR nw pees Ùen leÙe keâj mekesâ efkeâ Ssmes Øee™he ces heefjJee|lele efkeâÙee peelee nw efpemes DeefveefOeke=âle GheÙeesiekeâlee&
keâesF& Øees«eece efkeâmeer Fvehegš hej ®kesâiee Ùee veneR~ ( Ùee keâesF& DevÙe GheÙeesiekeâlee& efpemekesâ heeme mener ef[Meef›eâhMeve kebgâpeer
FmeefueS efJekeâuhe (a) mener nw~ vener nw) Éeje heÌ{e Ùee mecePee vener pee mekeâlee~ Ùen [sše megj#ee keâe
Skeâ cenlJehetCe& henuet nw~
75. BLE keâe hetCe& ™he nw-
81. efkeâmeer efoS ieS DeJemLee ØeefleefveefOelJe mes efJemleej keâes
(a) yuegštLe yeÌ[er Tpee& (b) yuegštLe keâce Tpee&
nševes keâer Øeef›eâÙee keâes ……… keâne peelee nw~
(c) yuegštLe ueeFš Svepeea (d) yuegštLe uebyeer Tpee&
(a) efve<keâ<e&Ce
Ans. (b) : BLE keâe hetCe& ™he nw - yuetštLe keâce Tpee& DeleŠ
(b) Decetle&lee
efJekeâuhe (b) mener nw~
(c) [sše ceeFefvebie
76. Gve GhekeâjCeeW keâer DeefOekeâlece mebKÙee keäÙee nw efpevnW (d) metÛevee hegveØee&efhle
Skeâue cees[yeme vesšJeke&â mes peesÌ[e pee mekeâlee nw?
Ans. (b) : Decetle&lee keâe DeLe& nw efkeâmeer Ûeerpe kesâ DeeJeMÙekeâ efJeJejCeeW
(a) 32 (b) 64
hej OÙeeve kesâefvõle keâjvee Deewj DeveeJeMÙekeâ Ùee peefšue efJeJejCeeW keâes
(c) 28 (d) 256
ÚesÌ[ osvee~ keâchÙetšj efJe%eeve ces, Ùen efkeâmeer efmemšce kesâ peefšue
Ans. (a) : 32 (ne[&JesÙej meercee kesâ DeeOeej hej) Deevleefjkeâ efJeJejCeeW keâes efÚheekeâj Deewj kesâJeue DeeJeMÙekeâ megefJeOeeDeeW keâes
77. ……….. Skeâ Dee@veueeFve mšesjspe [^eFJe nw efpemes yeÇeGpe Gpeeiej keâjkesâ Gmes mejue yeveeves keâer Skeâ efJeefOe nw~
efkeâÙee pee mekeâlee nw Deewj efkeâve JemlegDeeW keâes meePee efkeâÙee 82. Devegceeve SuieesefjLce kesâJeue leYeer hetje neslee nw peye Ùen
pee mekeâlee nw? (a) keâesF& Yeer JeekeäÙe Øeehle keâj mekeâlee nw~
(a) cesje iPhone {tB{s (b) efkeâmeer Yeer JeekeäÙe keâes Øeehle keâj mekeâlee nw pees Skeâ efveefnle
(b) iWeb ØekeâeefMele keâjW mebmkeâjCe nw~
(c) ceesyeeFue ceW iewuejer (c) melÙe-mebj#eCe nw~
(d) iDisk (d) Ùen efkeâmeer Yeer JeekeäÙe keâes JeÙeglheVe keâj mekeâlee nw pees Skeâ
Ans. (d) : i Disk Skeâ Dee@veueeFve mšesjspe mesJee nw pees efveefnle mebmkeâjCe nw Deewj Ùen melÙe-mebj#eCe nw~
GheÙeesiekeâlee&DeeW keâes Deheveer heâeFues Deewj [sše Dee@veueeFve mšesj keâjves Ans. (b) : Devegceeve SuieesefjLce kesâJeue leYeer hetje neslee nw peye efkeâmeer
Deewj Fvns otmejes kesâ meeLe meePee keâjves keâer Devegceefle osleer nw~ Ùen Yeer JeekeäÙe keâes Øeehle keâj mekeâlee nw pees Skeâ efveefnle mebmkeâjCe nw~
GheÙeesiekeâlee&DeeW keâes Deheveer heâeFue keâes yeÇeGpe keâjves keâer megefJeOee oslee nw 83. Ûesnje henÛeeve ØeCeeueer efkeâme Øekeâej kesâ S◦DeeF&◦
Deewj DevÙe efJekeâuhe ieuele nw~ Âef°keâesCe hej DeeOeeefjle nw?
78. mebmeeOeve ØeyebOeve ceW Meeefceue nw? (a) keâcepeesj AI Âef°keâesCe
(a) loT ef[JeeFme (b) ueeiet AI Âef°keâesCe
(b) loT keäueeG[ (c) meb%eeveelcekeâ AI Âef°keâesCe
(c) loT Jesye (d) cepeyetle AI Âef°keâesCe
(d) loT vesšJeke&â Ans. (b) : Ùen Skeâ Ssmee AI o=ef°keâesCe nw pees efJeefMe°,JÙeJeneefjkeâ
Ans. (b) : mebmeeOeve ØeyebOeve cebs cegKÙe ®he mes IoT keäueeG[ Éeje mecemÙeeDeeW keâes nue keâjves hej kesâefvõle nw~ Ûesnje henÛeeve ØeCeeueer Skeâ
neslee nw~ efJeMes<e keâeÙe& (ÛesnjeW keâer henÛeeve keâjvee ) keâjleer nw, pees Fmes ueeiet AI
FmeefueS efJekeâuhe (b) mener nw~ keâe Skeâ Glke=â° GoenjCe yeveelee nw~
79. DES SuieesefjLce keâer Skeâ cenòJehetCe& uebyeeF&…… efyešdme 84. efvecveefueefKele ceW mes keâewve S◦DeeF&◦ SpeWš kesâ ØeoMe&ve ceW
nw~ megOeej keâj mekeâlee nw?
(a) 16 (b) 32 (a) heefjMegælee
(c) 64 (d) 128 (b) meerKevee
Ans. (c) : DES SuieesefjLece keâer uecyeeF& 64 efyešdme nw DeleŠ (c) DeJeueeskeâve
efJekeâuhe (c) mener nw~ (d) Ùes meYeer
Bihar STET 30 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
Ans. (b) : AI SspeWšeW keâes [sše mes meerKeves Deewj Deheves JÙeJenej keâes 89. Ùeefo ØeefleÙeesefieÙeeW kesâ efueS yeepeej ceW ØeJesMe keâjvee
Devegketâefuele keâjves keâer #ecelee nesleer nw~ meerKeves keâer Øeef›eâÙee kesâ ceeOÙece Deemeeve nw lees veS ØeJesMekeâeW kesâ Kelejs hej efJeÛeej efkeâÙee
mes, SpeWš Deheveer ieueefleÙees mes meerKe mekeâles nw Deewj YeefJe<Ùe ces yesnlej peelee nw-
ØeoMe&ve keâj mekeâles nw~ (a) keâce
85. mecceesnve mebyebOe keäÙee nw? (b) GÛÛe
(a) A B keâe efnmmee nw~ (c) ceOÙece
(d) veieCÙe
(b) B kesâ heeme A mJeÙeb keâe Skeâ efnmmee nw~
(c) A, B keâe DeOeervemLe nw~ Ans. (b) : Ùeefo ØeefleÙeesefieÙeeW kesâ efueS yeepeej ceW ØeJesMe keâjvee Deemeeve
nw lees veS ØeJesMekeâeW keâe Keleje GÛÛe ceevee peelee nw~ peye yeepeej ces
(d) A, B keâe DeefOe‰eheer nw~
ØeJesMe yeeOeeS@ (pewmes GÛÛe hetpeer DeeJeMÙekeâleeS@ cepeyetle yeÇeb[ efve‰e Ùee
Ans. (c) : mecceesnve mebyebOe Skeâ Ssmee mebyebOe nw pene@ Skeâ FkeâeF& A, mejkeâejer efveÙece) keâce nesleer nw, lees DeefOekeâ keâcheefveÙee@ Deemeeveer mes
otmejer FkeâeF& B hej efveYe&j keâjleer nw Ùee Gmekesâ DeOeerve nesleer nw~ Ùen yeepeej ces ØeJesMe keâj mekeâleer nw~ Fmemes ceewpetoe heâceex kesâ efueS
Dekeämej heoeveg›eâefcele mebjÛeveeDees ceW osKee peelee nw, pene@ Skeâ lelJe ØeeflemheOee& yeÌ{ peeleerr nw Deewj Gvekesâ cegveehesâ hej oyeeJe heÌ[ mekeâlee nw~
otmejs lelJe kesâ efveÙeb$eCe ces neslee nw Ùee Gmemes ØeYeeefJele neslee nw~ 90. efvecveefueefKele ceW mes keâewve megj#ee leb$e mes mebyebefOele veneR nw?
86. vesšJeke&â keâer meerceeSB nQ- (a) Sefv›eâhMeve
(a) DemeeOÙelee (b) ef[ef›eâhMeve
(b) kegâÚ iegCeeW keâes JÙeòeâ keâjves ceW keâceer (c) F&-kewâMe
(c) DehetCe& (d) FveceW mes keâesF& veneR
(d) mce=efle yeeOeeSB Ans. (c) : ‘‘F&-keâwMe’’ keâe keâesF& ceevekeâ Ùee %eele megj#ee leb$e mes
Ans. (b) :efmeceWefškeâ vesšJeke&â mebyebOees Deewj JeieeakeâjCeeW keâes DeÛÚer lejn mebyebefOele DeLe& vener nw Ùen megj#ee MeyoeJeueer ces Skeâ DeheefjefÛele heo nw
mes oMee& mekeâles nw, uesefkeâve kegâÚ peefšue leee|keâkeâ mebyebOe, cee$eelcekeâ F&-kewâMe ef[efpešue cegõe nw efpemekeâe GheÙeesie Dee@veueeFve uesve-osve kesâ
peevekeâejer, Ùee efveefÕelelee / DeefveefÕelelee keâer ef[«eer keâes JÙeòeâ keâjves ceW efueS neslee nw pewmes ›esâef[š keâe[& Ùee [sefJe[ keâe[&~
Gvekeâer meerceeS nesleer nw~ 91. heefyuekeâ keâer ef›eâhšes«eeheâer keâes……… ef›eâhšes«eeheâer kesâ
87. šesefveceer efjuesMeve keäÙee nw? ™he ceW Yeer peevee peelee nw~
(a) efvepeer kegbâpeer
(a) A, B keâe efnmmee nw~
(b) efmecesefš^keâ
(b) B kesâ heeme A mJeÙeb keâe Skeâ efnmmee nw~
(c) Demeceefcele
(c) A, B kesâ efJehejerle keâes oMee&lee nw~
(d) FveceW mes keâesF& veneR
(d) A, B keâe DeefOe‰eheer nw~
Ans. (c) : meeJe&peefvekeâ kegbâpeer ef›eâhšes«eeheâer keâes Demeceefcele ef›eâhšes«eeheâer
Ans. (c) : Sbšesefveceer efjuesMeve keâe DeLe& nw efJehejerle mebcyevOe Dele:,
kesâ ™he ceW Yeer peevee peelee nw~ Ùen Skeâ Ssmeer ØeCeeueer nw pees Skeâ
A, B kesâ efJehejerle keâes oMee&lee nQ~ meePee kegbâpeer kesâ yepeeÙe oes Deueie-Deueie kebgâefpeÙee keâe GheÙeesie keâjleer
88. Jen keäÙee Øeef›eâÙee nw efpemeces bSkeâ Kejeroej Skeâ efveef§ele nwŠ Skeâ meeJe&peefvekeâ kebgâpeer Deewj Skeâ efvepeer kebgâpeer~ meeJe&peefvekeâ kebgâpeer
cee$ee ceW JemlegDeeW keâes Kejeroves ceW Deheveer ®efÛe jKelee nw, keâe GheÙeesie mebosMe keâes Sefv›eâhš keâjves kesâ efueS efkeâÙee peelee nw~ Deewj
Deewj efJe›esâlee ›eâefcekeâ ™he mes keâce yeesefueÙeeW keâes pecee Øeehlekeâlee& keâer efvepeer kebgâpeer keâe GheÙeesie ef[ef›eâhš kesâ efueS efkeâÙee peelee
keâjkesâ JÙeJemeeÙe kesâ efueS ØeeflemheOee& keâjles nQ peye lekeâ nw~ Ùen megefveef§ele keâjlee nw efkeâ kesâJeue FefÛÚle Øeehlekeâòee& ner meoWMe heÌ{
efkeâ kesâJeue Skeâ efJe›esâlee veneR yeÛee? mekeâlee nw~
(a) B2B ceekexâšhuesme 92. ceesyeeFue kesâ hewmes keâe GheÙeesie keâjves kesâ efueS efkeâmekeâe
(b) veerueeceer GheÙeesie efkeâÙee peelee nw-
(c) efjJeme& veerueeceer (a) Sce◦meer◦DeeF◦[er◦
(d) Fbõevesš (b) Sce◦Sce◦DeeF&◦[er
Ans. (c) : efjJe&me efveueeceer Jen Øeef›eâÙee nw efpemeceW Skeâ Kejeroej (Ùee (c) Deej◦Sme◦DeeF&◦[er◦
Skeâ mebie"ve) DeeJeMÙekeâleeDeeW keâes yeleeles nw, Deewj keâF& efJe›esâlee Gme (d) Ghejesòeâ ceW mes keâesF& veneR
keâece keâes Øeehle keâjves kesâ efueS ØeeflemheOee& keâjles nw, Deheveer keâercelees keâes Ans. (b) : ceesyeeFue kesâ hewmeeW keâe GheÙeesie keâjves kesâ efueS Sce0 Sce0
›eâefcekeâ ™he mes keâce keâjles peeles nw~ Kejeroej keâe ue#Ùe meyemes keâce DeeF&0[er0 keâe GheÙeesie efkeâÙee peelee nw~
mebYeJe efkeâcele hej meJe&ßes° cetuÙe Øeehle keâjvee neslee nw~ Ùen heejbheefjkeâ Sce0 Sce0 DeeF&0[er0 keâe celeueye ceesyeeFue ceveer DeeF[WefšheâeÙej nw~
veerueeceer kesâ efJehejerle nw, pene@ Kejeroej yeesueer ueieeles nw Deewj efkeâceleW Ùen Skeâ Devet"e keâes[ nw efpemekeâe GheÙeesie ceesyeeFue ceveer uesveosve keâes
yeÌ{leer nw~ š^wkeâ keâjves kesâ efueS efkeâÙee peelee nw~
Bihar STET 31 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
ceesyeeFue ceveer Skeâ ef[efpešue Yegieleeve ØeCeeueer nw pees GheÙeesiekeâlee&DeeW (a) Jeeref[Ùees
keâes Deheves ceesyeeFue heâesve keâe GheÙeesie keâjkesâ hewmes Yespeves Deewj Øeehle (b) mebieerle
keâjves keâer Devegceefle osleer nw~ (c) ÚefJeÙeeB
93. CIA ces C keâe DeLe& keäÙee nw? (d) Øesâce
(a) jÛeveelcekeâlee Ans. (c) : meÙegbòeâ heâesšes«eeefheâkeâ efJeMes<e%e mecetn (JPEG) keâe GheÙeesie
(b) ieesheveerÙelee ÚefJeÙeeW keâes mebheerefÌ[le keâjves kesâ efueS efkeâÙee peelee nw~
(c) cenòJehetCe& JPEG, efpemekeâe celeueye pee@Fbš heâesšes«eeefheâkeâ Skeämehešd&me «eghe nw, Skeâ
(d) meeceevÙe ceevekeâer ke=âle ÚefJe mebheerÌ[ve leb$e nww~ Deewj Ùen Skeâ Ssmee Øee™he nw pees
heâeFue Deekeâej Deewj ÚefJe iegCeJeòee kesâ yeerÛe meblegueve yeveelee nw~
Ans. (b) : CIA ceW 'C' keâe DeLe& ieesheveerÙelee nw~
98. ……… efmeiveue Debleefj#e Deewj/Ùee meceÙe hej ueieeleej
CIA keâe celeueye meWš^ue FbšsefuepeWme SpeWmeer nw, pees mebÙegòeâ jepÙe
efYeVe neslee nw~
Decesefjkeâe keâer Skeâ mebIeerÙe mejkeâej keâer veeieefjkeâ efJeosMeer KegefheâÙee mesJee
(a) Sveeuee@ie
nw~ Fmekeâe keâece ogefveÙee Yej mes Kegehf eâÙee peevekeâejer S]keâ$e keâjvee Deewj
Gmekeâe efJeMues<eCe keâjvee nw Deewj ieghle Dee@hejsMeve keâjvee nw~ (b) ef[efpešue
(c) ceesveesuee@ie
94. efvecveefueefKele ceW mes keâewve Skeâ ceušerceeref[Ùee ØeCeeueer keâer
(d) ceušeruee@ie
efJeMes<elee nw?
Ans. (a) : efmeiveue pees Debleefj#e Ùee meceÙe kesâ meeLe ueieeleej yeoueles
(a) GÛÛe Yeb[ejCe
jnles nw, GvnW Sveeuee@ie efmeiveue keâne peelee nw~ Sveeueeie efmeiveue Skeâ
(b) GÛÛe [sše oj
melele lejbie ceW Yespes peeles nw~ Sveeueeie efmeiveue kesâ meeceevÙe GoenjCeeW
(c) oesveeW GÛÛe Yeb[ejCe Deewj GÛÛe [sše oj ceW OJeefve lejieW, Jeesušspe ceW Gleej-ÛeÌ{eJe Deewj jsef[Ùees lebjies Meefceue nw~
(d) Ghejesòeâ ceW mes keâesF& veneR
99. ………SveercesMeve keâe GheÙeesie Gve ÛeerpeeW keâes Ûesleve
Ans. (c) : ceušerceeref[Ùee ØeCeeueer keâer efJeMes<eCe GÛÛe Yeb[ejCe Deewj keâjves kesâ efueS efkeâÙee peelee nw pees peerJeve kesâ Deekeâej mes
GÛÛe [sše oj oesvees nw~ Úesšer nw~
ceušerceeref[Ùee ceW šskeämš, Dee@ef[Ùees, Fcespe, efJeef[Ùees Deewj SveercesMeve (a) Fceefme&Je
pewmes efJeefYeVe Øekeâej keâer meeceef«eÙeeW keâe mebÙeespeve Meefceue neslee nw~ (b) keäueesceesMeve
95. Skeâ mš^erce kesâ huesyewkeâ kesâ oewjeve nesves Jeeueer osjer keâes (c) mše@he ceesMeve
……… keâne peelee nw? (d) mebJeefOe&le
(a) mš^erce efJeuebye Ans. (c) : SveercesMeve keâe GheÙeesie Gve ÛeerpeeW keâes Ûesleve keâjves efueS
(b) huesyewkeâ osjer efkeâÙee peelee nw pees peerJeve kesâ Deekeâej mes Úesšer nw~
(c) efpešj mše@he ceesMeve SveercesMeve ceW, Yeeweflekeâ JemlegDeeW keâes Skeâ-Skeâ keâjkesâ øesâce
(d) Iešvee efJeuebye ceW ues peeÙee peelee nw, Deewj peye ÚefJeÙeeW kesâ Deveg›eâce keâes lespeer mes
Ans. (c) : mš^erce kesâ huesyewkeâ kesâ oewjeve efJeMes<e ™he mes efYeVelee Ùee ÛeueeÙee peelee nw, lees Jen ieefle keâe Yeüce hewoe keâjlee nw~ Ùen lekeâveerkeâ
Demebieefle kesâ ™he ceW nesves Jeeueer osjer keâes efpešj keâne peelee nw~ Dekeämej efJe%eeheveeW, mebieerle Jeeref[Ùees Deewj ueIeg efheâuceeW kesâ efueS GheÙeesie
96. efjÙeue šeFce FbšjSefkeäšJe Dee@ef[Ùees Jeeref[Ùees ceW, efpešj keâes keâer peeleer nw~
JeemleefJekeâ meceÙe kesâ [sše ceW osjer kesâ yeerÛe osjer mes hesMe 100. ef[efpešue ÚefJe ØemebmkeâjCe keâer ßeseCf eÙeeB keäÙee nw?
efkeâÙee peelee nw~ (a) ÚefJe mebJeæ&ve
(a) efhekeämeue (b) ÚefJe JeieeakeâjCe Deewj efJeMues<eCe
(b) uesÙeme& (c) ÚefJe heefjJele&ve
(c) Øesâce (d) GuuesefKele meYeer
(d) hewkesâš Ans. (d) : ef[efpešue ÚefJe ØemebmkeâjCe keâer ßesefCeÙeeB nwŠ ÚefJe mebJeæ&ve,
Ans. (d) : efjÙeue šeFce Dee@ef[Ùees Jeeref[Ùees ceW efpešj Øeehle [sše hewkesâš ÚefJe Jeieer&rkeâjCe Deewj efJeMues<eCe, Deewj ÚefJe heefjJele&ve~
keâer osjer ceW efYeVelee keâes JÙeòeâ keâjlee nw~ kegâÚ hewkesâš otmejeW keâer leguevee ef[efpešue ÚefJe ØemebmkeâjCe ceW keâF& Øekeâej keâer lekeâveerkeWâ Meefceue nesleer nw
ceW LeesÌ[e efJeuebefyele nes mekeâles nQ~ Deeieceve meceÙe ceW Ùen Demebieefle efpešj pees ÚefJeÙeeW keâes yesnlej yeveeves, efJeMues<eCe keâjves Deewj yeoueves kesâ efueS
keânueeleer nw~ GheÙeesie keâer peeleer nw~ ÚefJe meJebæ&ve keâe GoosMÙe ceW, ÚefJeÙeeW keâes
97. mebÙegòeâ heâesšes«eeefheâkeâ efJeMes<e%e mecetn (JPEG) keâe efJeefYeVe ßesefCeÙeeW ceW Jeieeake=âle efkeâÙee peelee nw~ ÚefJe heefjJele&ve ceW,
GheÙeesie …… keâes mebheerefÌ[le keâjves kesâ efueS efkeâÙee pÙeeefceleerÙe heefjJele&ve, jbie heefjJele&ve Ùee DevÙe Øekeâej kesâ heefjJele&ve
peelee nw~ Meefceue nesles nw~ pees ÚefJe kesâ ™he keâes yeoueles nw~
Bihar STET 32 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
 efyenej efJeÅeeueÙe hejer#ee meefceefle
ceeOÙeefcekeâ efMe#ekeâ hee$elee hejer#ee Bihar STET
keâchÙetšj
[Exam. Date - 12.09.2023 (Shift-I)]
1. What is the simplified expression for the → Term = ABC'
Boolean function F (A, B, C, D) = Σ(0, 1, 2, 4, 5, Simplified Expression–
6, 8, 9, 10, 12, 13, 14) using the K-map method? F(A, B, C, D) = C' D' + CD' + A'B'C' + AB'C' + ABC' +
K-cewhe efJeefOe keâe GheÙeesie keâjkesâ yetefueÙeve HebâkeäMeve F AB'C'
(A, B, C, D) = Σ(0, 1, 2, 4, 5, 6, 8, 9, 10, 12, 13, F = C'D' + CD' + C' (A'B' + AB' + AB+ AB')
14) kesâ efueS mejueerke=âle DeefYeJÙeefkeäle keäÙee nw? Expression ceW–
(a) A'B'C'D' + A'B'C'D + A'BC'D + AB'C'D + → ABCD (1111 → Minterm 15) veneR nw pees Option (A)
ABCD Deewj (B) ceW ieuele lejerkesâ Meeefceue nw~
(b) A'B'C'D' + A'BC'D + AB'C'D +ABC'D +
ABCD yeekeâer meejs Option ceW kegâÚ Minterms keâes ÚesÌ[ osles nw~ Ùee ieuele
(c) A'B'C'D' + A'BC'D + ABC'D + ABCD peesÌ[ osles nw~
(d) A'B'C'D' + A'BC'D' + A'BCD + ABCD veesš– DeeÙeesie ves Fme ØeMve keâe Gòej (a) ceevee nw~
Ans. (*) : 2. In a PLA, what components are used to
F(A, B, C, D), ∑(0, 1, 2, 4, 5, 6, 8, 9, 10, 12, 13, 14) implement the combinational logic functions?
Minterms PLA ces mebÙeespeveelcekeâ leke&â HebâkeäMevme keâes ef›eâÙeeefvJele keâjves
(0, 1, 2, 4, 5, 6, 8, 9, 10, 12, 13, 14) kesâ efueS keâewve mes keâcheesvesvšdme keâe GheÙeesie efkeâÙee peelee nw?
Útšs ngÙes Minterms (Ùeeefve 0 vener nesieW) (a) AND gates and OR gates
(3, 7, 11, 15) (b) NAND gates and XOR gates
Step-by-step simplification using k-map (c) NOR gates and XNOR gates
4-vaiable (A, B, C, D) (d) NOT gates and multiplexers
K-map structure–
Ans. (a) : PLA (Programmable Logic Array) ceW meyemes henues
(Columns : CD : 00,01,11,10
Rows : AB = 00,01,11, 10) Fvehegš JesefjSyeuJe mes AND iesšdme kesâ ceeOÙece mes efcevešcme& (Product
AB/CD 00 01 00 10 terms) yeveeS peeles nw, efheâj OR iesšdme keâe GheÙeesie keâjkesâ DeeJeMÙekeâ
00 1 1 0 1 DeeGšhegš hebâkeäMevme (Sum of Products) lewÙeej keâer peeleer nw~ FmeefueS,
01 1 1 0 1 PLA keâe@efcyevesMeveue uee@efpekeâ hebâkeäMeve keâes Fchueercesvš keâjves kesâ efueS
11 1 1 0 1 AND Deewj OR iesšdme keâe GheÙeesie keâjlee nw~
10 1 1 0 1
3. Which type of register is primarily used to
Group-1– hetje Column CD = 00 (Vertically 4 Rows) temporarily hold data during arithmetic and
→ Minterm: 0, 4, 8, 12 logical operations in a microprocessor?
→ Common : C'D' →Term = C'D' ceeF›eâesØeesmesmej ceW DebkeâieefCeleerÙe Deewj leeefke&âkeâ ef›eâÙeeDeeW kesâ
→ No effect of A or B. oewjeve [sše keâes DemLeeÙeer ™he mes jKeves kesâ efueS efkeâme Øekeâej
Group-2– hetje Column CD = 10 (Minter's : 2, 6, 10, 14) kesâ jefpemšj keâe cegKÙe ™he mes GheÙeesie efkeâÙee peelee nw?
→ Common : CD' (a) Shift register (b) Parallel register
→ Term CD' (c) Accumulator register (d) Counter register
Group-3– Row AB = 00 and CD = 00, 01 → Minterms
: 0,1 Ans. (c) : SkeäÙetceguesšj jefpemšj (Accumulator Register)
→ Common : A'B',D Varies (D' and D), C = 0 ceeF›eâesØeesmesmej keâe Skeâ ØecegKe jefpemšj neslee nw, pees DebkeâieefCele Deewj
→ Term = A'B'C' leeefke&âkeâ mebÛeeueve (pewmes pees[Ì , IešeJe, AND, OR Deeefo) kesâ oewjeve
Group-4– Row AB = 01 and CD = 00,01 → Minterms [sše keâes DemLeeÙeer ™he mes mšesj keâjlee nw~ Ùen ALU kesâ meeLe meerOes
4, 5 pegÌ[e neslee nw Deewj heefjCeeceeW keâes meb«enerle keâjlee nw~
→ Term = AB'C' 4. Which logic family uses both depletion and
Group-5– Row AB = 10 and C = 00,01 → Minterms : enhancement mode MOSFETs for its
8, 9 operation?
→ Term = AB'C' keâewve-meer uee@efpekeâ Hewâefceueer Deheves Dee@hejsMeve kesâ efueS
Group-6– Row AB = 11 and CD = 00,01 → Minterms : ef[hueerMeve Deewj SvnebmeceWš cees[ MOSFETs oesveeW keâe
12, 13 GheÙeesie keâjleer nw?
Bihar STET 33 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
 (a) TTL (b) ECL Step-1–
(c) PMOS (d) CMOS SOP (Sum Of Products) ceW Boolean Expression
Ans. (d) : CMOS (keâe@efchueceWšjer cesšue Dee@keämeeF[-mesceerkebâ[keäšj) F(A, B, C) = A'B'C' + A'B'C + A'BC' + A'BC + AB'C
uee@efpekeâ hewâefceueer ceW SvenebmeceWš cees[ Deewj kegâÚ efJeMes<e meefke&âšeW ceW Step-2– Group the First Term (all with A'--)
[erhueerMeve cees[ MOSFETs oesveeW keâe GheÙeesie efkeâÙee peelee nw~ A'(B'C' + B'C + BC' + BC)
meeceevÙe CMOS meefke&âšdme ceW SvenebmeceWš cees[ kesâ nMOS Deewj B'C' + B'C + BC' + BC = 1, B Deewj C meYeer combinations
pMOS š^ebefpemšj nesles nw~ hejbleg kegâÚ efJeMes<e ef[peeFveeW ceW [erhueerMeve keâes cover keâjlee nw~
cees[ MOSFET keâe GheÙeesie uees[ ef[JeeFme Ùee efmJeefÛebie efJeMes<eleeDeeW A'.1 = A
keâes yesnlej yeveeves kesâ efueS efkeâÙee peelee nw~ yeekeâer Term = AB'C
5. What is the primary difference between ROM
lees Final Simplified SOP expression
and RAM? F = A' + AB'C
ROM Deewj RAM kesâ yeerÛe cegKÙe Deblej keäÙee nw? Step-3– Option Cheaking–
(a) A'B' + AB' + AB + AC → false (kegâÚ Yeer cewÛe veneR
(a) ROM is faster than RAM
ROM, RAM keâer leguevee ceW lespe nw~
keâjlee)
(b) ROM is volatile, while RAM is non-volatile (b) A+B+C → False (Oversimplified Deewj ieuele nw)
ROM JeesueešeFue nw, peyeefkeâ RAM vee@ve-JeesueešeFue (c) AB'C' → False (Form ner vener efceue jne nw)
nw~ (d) A'B'C → ceW lees efmeHe&â Skeâ Minterm nw (0) uesefkeâve,
(c) ROM is used for data storage, while RAM is Function ces Deewj Yeer Minterms nQ~
used for program execution/ROM [eše mšesjspe veesš– DeeÙeesie ves Fme ØeMve keâe Gòej (a) ceevee nw~
kesâ efueS GheÙeesie nesleer nw, peyeefkeâ RAM Øees«eece 7. If the sum of two positive binary numbers is
efve<heeove kesâ efueS~ 11010 and there is a carry-out from the MSB,
(d) ROM stores permanent data that cannot be What should be done to obtain the correct
changed, while RAM stores temporary data result?/Ùeefo oes mekeâejelcekeâ yeeFvejer mebKÙeeDeeW keâe
that can be read and written/ ROM mLeeÙeer [eše Ùees ie 110110 nw Deewj MSB mes Skeâ keâwjer-DeeGš nes jne
keâes meb«eefnle keâjlee nw efpemes yeouee veneR pee mekeâlee, nw, lees mener heefjCeece Øeehle keâjves kesâ efueS keäÙee efkeâÙee
peyeefkeâ RAM DemLeeÙeer [eše keâes meb«eefnle keâjlee nw efpemes peevee ÛeeefnS?
heÌ{e Deewj efueKee pee mekeâlee nw~ (a) Discard the carry/keâwjer keâes nše oW
Ans. (d) : ROM (Read Only Memory) Ùen Skeâ iewj- (b) Add the carry to the least significant bit
(LSB)
heefjJele&veMeerue (Non- Volatile) cesceesjer nw, efpemekeâe DeLe& nw efkeâ keâwjer keâes keâce mes keâce cenlkehetCe& efyeš (LSB) ceW peesÌ[
efyepeueer yebo nesves hej Yeer Fmekeâe [sše veneR efcešlee~ FmeceW mLeeÙeer [sše (c) Add the carry to the most significant bit
meb«enerle neslee nw (pewmes heâce&JesÙej) efpemes Deeceleewj hej GheÙeesiekeâlee& Éeje (MSB)
yeouee veneR pee mekeâlee~ keâwjer keâes meyemes cenlkehetCe& efyeš (MSB) ceW peesÌ[W
RAM (Random Access Memory) Ùen Skeâ heefjJele&veMeerue (d) Subtract the carry from the MSB
(Volatile) cesceesjer nw, efpemekeâe DeLe& nw efkeâ efyepeueer yebo nesles ner MSB mes keâwjer keâes Ieše oW
Fmekeâe [sše efceš peelee nw~ FmeceW DemLeeÙeer [sše meb«enerle neslee nw efpemes Ans. (*) : Ùeefo oes hee@efpeefšJe yeeFvejer mebKÙeeDeeW keâe Ùeesie 11010
CPU Éeje heÌ{e Deewj efueKee pee mekeâlee nw~ Deelee nw Deewj MSB (Most Significant Bit) mes Skeâ Carry out
6. Given a Boolean function F(A, B, C) = Σ(0, 1, neslee nw, lees Gmes Discard (DeJensuevee) efkeâÙee peelee nw~
2, 3, 5), what is the expression in SOP form? keäÙeeWefkeâ meeceevÙe yeeFvejer peesÌ[ (Unsigned Binary Addition) ceW,
Skeâ yetefueÙeve heâbkeäMeve F(A, B, C) = Σ(0, 1, 2, 3, 5) efoÙee Ùeefo Debeflece efyeš mes Carry efvekeâuelee nw, lees Gmes heefjCeece keâe efnmmee
ieÙee nw, lees SOP ™he ceW Fmekeâe DeefYekÙeefòeâ keäÙee nesiee? veneR ceevee peelee Fmes yeme vepej Deboepe efkeâÙee peelee nw~
(a) A'B' +AB' + AB + AC veesš– DeeÙeesie ves Fme ØeMve keâe Gòej (b) ceevee nw~
(b) A + B + C 8. In binary multiplication using the simple
(c) AB' + C' method, what is the first step after aligning the
(d) A'B'C' digits and preparing for multiplication?
Ans. (*) : F(A, B, C) = ∑(0, 1, 2, 3, 5) mejue efkeefOe mes yeeFvejer iegCee keâjles meceÙe, DebkeâeW keâes
Minterms nw : 0, 1, 2, 3, 5 mebjsefKele keâjves Deewj iegCeve kesâ efueS lewÙeej keâjves kesâ yeeo
Minterm in SOP form
henuee keâoce keäÙee neslee nw?
Decimal A B C Expression (a) Multiply the least significant bit (LSB) by the
multiplier/meyemes keâce cenlkehetCe& efyeš (LSB) keâes
0 0 0 0 A'B'C'
1 0 0 1 A'B'C iegCekeâ mes iegCee keâjW
2 0 1 0 A'BC' (b) Multiply the most significant bit (MSB) by
3 0 1 1 A'BC the multiplier/meyemes cenlkehetCe& efyeš (MSB) keâes
5 1 0 1 AB'C iegCekeâ mes iegCee keâjW
Bihar STET 34 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
 (c) Multiply the least significant bit (LSB) by the 11. Which component of an ideal microcomputer is
multiplicand/meyemes keâce cenlkehetCe& efyeš (LSB) keâes responsible for temporarily holding data and
iegCekeâ mes iegCee keâjW instructions during processing?
(d) Multiply the most significant bit (MSB) by Skeâ DeeoMe& ceeF›eâeskeâbhÙetšj keâe keâewve mee Ieškeâ [sše
the multiplicand/meyemes cenlkehetCe& efyeš (MSB) keâes Deewj efveo&sMeeW keâes ØemebmkeâjCe kesâ oewjeve DemLeeÙeer ™he mes
iegCekeâ mes iegCee keâjW OeejCe keâjves kesâ efueS efpeccesoej nw?
Ans. (a) : meeOeejCe yeeFvejer iegCee ceW, oeSb mes yeeSb (LSB mes (a) CPU
(b) ALU
MSB keâer Deesj) keâece keâjles nQ~ henuee ÛejCe iegCekeâ (Multiplier)
(c) Memory/cesceesjer
kesâ meyemes oeSb efyeš (LSB) keâes ceušerefhuekeQâ[ mes iegCee keâjvee neslee
nw, Deewj efheâj yeeFË Deesj yeÌ{les peeles nQ~ (d) Output devices/DeeGšhegš GhekeâjCe
9. What is the relationship between the distance Ans. (c) : Skeâ DeeoMe& ceeF›eâeskebâhÙetšj ceW, cesceesjer Jen Ieškeâ nw pees
between parity bits and their error detection Øeesmesefmebie kesâ oewjeve [sše Deewj efveoxMeex keâes DemLeeÙeer ™he mes meb«enerle
and correction capability in Hamming Code? keâjlee nw~ Ùen CPU keâes lespeer mes Skeämesme keâjves kesâ efueS peevekeâejer
nwefcebie keâes[ ceW hewjer efyešdme kesâ yeerÛe keâer otjer Deewj Gvekesâ GheueyOe keâjlee nw~
$egefš henÛeeve Deewj megOeej #ecelee kesâ yeerÛe keäÙee mebyebOe nw? 12. How is the width of the data bus typically
(a) Closer parity bits provide higher error measured in a microcomputer system?
correction capability/heeme-heeme hewjer efyešdme DeefOekeâ Skeâ ceeF›eâeskeâbhÙetšj efmemšce ceW [sše yeme keâer ÛeewÌ[eF& keâes
$egefš megOeej #ecelee Øeoeve keâjles nQ Deeceleewj hej efkeâme Øekeâej mes ceeheer peeleer nw?
(b) Closer parity bits provide lower error (a) In kilobytes (KB)/efkeâueesyeeFšdme (KB) ce
correction capability/heeme-heeme hewjer efyešdme keâce $egefš (b) In megahertz (MHz)/cesieenšdÌpe& (MHz) ceW
megOeej #ecelee Øeoeve keâjles nQ (c) In bits/efyešdme ceW
(c) Distance between parity bits has no impact on (d) In address lines/helee jsKeeDeeW ceW
error correction capability/hewjer efyešdme kesâ yeerÛe keâer
Ans. (c) : [sše yeme keâer ÛeewÌ[eF& (Width) Ùen oMee&leer nw efkeâ Skeâ
otjer keâe $egefš megOeej #ecelee hej keâesF& ØeYeeke veneR heÌ[lee
(d) The position of parity bits is irrelevant in meceÙe ceW efkeâleves efyešdme [sše š^ebmeheâj efkeâÙee pee mekeâlee nw~ GoenjCe
Hamming Code/ nwefcebie keâes[ ceW hewjer efyešdme keâer kesâ efueS Skeâ 32-efyeš [sše yeme Skeâ yeej ceW 32 efyešdme [sše š^ebmeheâj
efmLeefle DeØeemebefiekeâ nw keâj mekeâleer nw~ FmeefueS, [sše yeme keâer ÛeewÌ[eF& keâes efyešdme ceW ceehee
peelee nw~
Ans. (b) : nwefcebie keâes[ (Hamming Code) ceW hewefjšer efyešdme keâes
hee@Jej Dee@heâ 2 keâer heespeerMeve (pewmes 1,2,4,8 Deeefo) hej jKee peelee nw, 13. Microcontrollers find application in various
fields. What is a typical application of
Deewj ØelÙeskeâ hewefjšer efyeš kegâÚ Keeme [sše efyešdme keâes keâJej keâjlee nw~ microcontrollers in the automotive industry?
Ùeefo hewefjšer efyešdme yengle heeme-heeme neW lees Jes yengle DeefOekeâ ceeF›eâeskeâbš^esuej keâe efkeefYeVe #es$eeW ceW GheÙeesie neslee nw~
DeesJejuewefhebie efyešdme keâes keâJej keâjles nw, efpememes Ùen leÙe keâjvee Dee@šesceesyeeFue GÅeesie ceW ceeF›eâeskeâbš^esuej keâe Skeâ
cegefMkeâue nes mekeâlee nw efkeâ ieueleer keâneB ngF& nw~ FmeefueS, hewefjšer meeceevÙe DevegØeÙeesie keäÙee nw?
efyešdme kesâ yeerÛe heÙee&hle otjer jKevee pe™jer nw leeefkeâ Jes $egefšÙeeW keâe (a) Operating systems for computers
yesnlej {bie mes helee ueiee mekeWâ Deewj GvnW megOeej mekeWâ~ keâbhÙetšjeW kesâ efueS Dee@hejsefšbie efmemšce
10. To convert a Gray Code to its binary (b) Entertainment systems in airplanes
equivalent, which technique is commonly used? nkeeF& penepeeW ceW ceveesjbpeve ØeCeeefueÙeeB
«es keâes[ keâes Gmekesâ yeeFvejer mecekeâ#e ceW heefjkeefle&le keâjves (c) Engine control in cars
kesâ efueS keâewve meer lekeâveerkeâ Deeceleewj hej GheÙeesie keâer keâejeW ceW Fbpeve efveÙeb$eCe
(d) Weather forecasting systems
peeleer nw?
ceewmece hetkee&vegceeve ØeCeeefueÙeeB
(a) Subtraction method/Iešeke efkeefOe
Ans. (c) : ceeF›eâeskebâš^esuevej keâe Dee@šesceesefšJe GÅeesie ceW Skeâ meeceevÙe
(b) Addition method/peesÌ[ efkeefOe
DevegØeÙeesie keâejeW kesâ Fbpeve keâes efveÙebef$ele keâjvee nw~ Fbpeve efveÙeb$eCe
(c) Exclusive OR (XOR) operation
ØeCeeueer (Engine Control Unit-ECU) ceW ceeF›eâeskebâš^esuej keâe
efkeefMe<š Ùee (XOR) ef›eâÙee
GheÙeesie FËOeve FbpeskeäMeve, FbefiveMeve šeFefcebie, Glmepe&ve efveÙeb$eCe Deewj
(d) Division method/ Yeeie efkeefOe
DevÙe cenlJehetCe& keâeÙeex keâes ØeyebefOele keâjves kesâ efueS efkeâÙee peelee nw~
Ans. (c) : «es keâes[ (Gray Code) keâes yeeFvejer keâes[ ceW yeoueves kesâ
14. Which data structure often results in a time-
efueS meyemes meeceevÙe Deewj ØeYeeJeer lejerkeâe SkeämekeämetefmeJe OR (XOR) space tradeoff by using extra memory to speed
Dee@hejsMeve nw~ FmeceW «es keâes[ kesâ henues efyeš keâes yeeFvejer keâes[ kesâ up operations?
henues efyeš kesâ ™he ceW efueÙee peelee nQ Deewj efheâj nj Deieues efyeš keâes keâewve mee [sše mebjÛevee Deefleefjòeâ cesceesjer keâe GheÙeesie
efheÚues yeeFvejer efyeš Deewj Jele&ceeve «es efyeš kesâ XOR mes efvekeâeuee keâjkesâ mebÛeeueve keâes lesÌpe keâjkesâ meceÙe-mhesme š^s[Dee@heâ
peelee nw~ keâe keâejCe yevelee nw?
Bihar STET 35 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
 (a) Arrays/SjsÌpe 17. If an algorithm's behavior is bounded by
(b) Linked lists/efuebkeä[ efuemšdme "o(f(n)) if g(n)", what notation does it become
(c) Hash tables/nwMe šsyeume when the condition is removed?
(d) Stacks/mšwkeäme Ùeefo efkeâmeer Suieesefjoce keâe kÙekenej 'o(f(n)) Ùeefo g(n)'
Ans. (c) : nwMe šsyeume (Hash - Tables) Skeâ Ssmee [sše mš^keäÛej Éeje meerefcele nw, lees peye Ùen Mele& nše oer peeleer nw, lees
nw pees DeefOekeâ cesceesjer keâe GheÙeesie keâjkesâ Dee@hejsMeve keâer ieefle keâes Ùen keâewve-meer veesšsMeve yeve peeleer nw?
yeÌ{elee nw~ FmeceW kegbâpeer (Key) keâes Skeâ Fb[skeäme ceW cewhe keâjves kesâ efueS (a) o(f(n)) (b) o(g(n))
nwMe hebâkeäMeve keâe GheÙeesie efkeâÙee peelee nw, efpememes [sše keâes yengle lespeer (c) o(f(n) + g(n)) (d) o(f(n) * g(n))
mes Skeämesme efkeâÙee pee mekeâlee nw~ neueebefkeâ, Fmekeâer Ùen ieefle Deefleefjòeâ Ans. (a) : Ùeefo efkeâmeer Suieesefjoce keâe JÙeJenej "O (fcn) if g (n)"
cesceesjer KeÛe& kesâ meeLe Deeleer nw, Ùener keâejCe nw efkeâ Fmes Time-Space mes yebOee ngDee nw, lees Fmekeâe celeueye nw efkeâ Suieesefjoce keâer meceÙe
Tradeoft keâe GoenjCe ceevee peelee nw~ peefšuelee O (fcn) nw peye g (n) keâer Mele& hetjer nesleer nw, O (fcn) if
15. Which term refers to the strategy of optimizing g (n) keâe DeLe& nw efkeâ peye g (n) melÙe neslee nw, lees Suieesefjoce keâer
an algorithm's use of resources, often by ieefle O (fcn) mes yebOeer nesleer nw uesefkeâve Deiej g (n) keâer Mele& nše oer
making sacrifices in one aspect for peeS, lees Suieesefjoce ncesMee O (fcn) ceW ner Ûeuesiee~ keäÙeeWefkeâ Deye
improvements in another?
keâewve-mee Meyo Gme jCeveerefle keâes meboefYe&le keâjlee nw keâesF& Mele& veneR nw pees Fmes ØeefleyebefOele keâjs~
efpemeceW Suieesefjoce kesâ mebmeeOeveeW kesâ GheÙeesie keâe 18. The recurrence equation T(n) = T(n/2) + 1
Devegkeâtueve efkeâÙee peelee nw, Dekeämej Skeâ henuet ceW represents the time complexity of which
algorithmic paradigm?
yeefueoeve oskeâj otmejs ceW megOeej efkeâÙee peelee nw?
hegvejeke=efòe meceerkeâjCe T(n) = T(n/2) + 1 efkeâme
(a) Greedy algorithm/«eer[er Suieesefjoce
Suieesefjoefcekeâ Øeefleceeve keâer meceÙe peefšuelee keâes oMee&lee
(b) Divide and conquer/ef[keeF[ Sb[ keâe@vkeâj
nw?
(c) Dynamic programming/[eÙeveeefcekeâ Øees«eeefcebie
(d) Tradeoff/š^s[Dee@heâ (a) Divide and Conquer/ ef[keeF[ Sb[ keâe@vkeâj
(b) Greedy Algorithms/«eer[er Suieesefjoce
Ans. (d) : ‘š^s[Dee@heâ (Tradeoff)’ Jen jCeveerefle nesleer nw efpemeceW
efkeâmeer Suieesefjoce kesâ mebmeeOeveeW kesâ GheÙeesie keâes yesnlej yeveeves kesâ efueS (c) Dynamic Programming/[eÙeveeefcekeâ Øees«eeefcebie
Skeâ he#e keâe yeefueoeve keâjkesâ otmejs he#e ceW megOeej efkeâÙee peelee nw~ (d) Brute Force/ yeÇtš heâesme&
GoenjCe kesâ efueS, keâce meceÙe ceW nue heeves kesâ efueS pÙeeoe cesceesjer keâe Ans. (a) : efjkeâjvme efjuesMeve (T (n) = T (n/2) + 1) Ùen oMee&lee
GheÙeesie keâjvee Ùee cesceesjer yeÛeeves kesâ efueS pÙeeoe meceÙe ueieevee Ùes meye nw efkeâ mecemÙee keâes DeeOes (n/2) Deekeâej keâer Ghe-mecemÙeeDeeW ceW yee@še
š^s[Dee@heâ kesâ GoenjCe nw~ pee jne nw Deewj efheâj GvnW nue efkeâÙee pee jne nw~ Fmekesâ yeeo Skeâ
16. Conditional asymptotic notation allows for a Constant time (+1) ceW heefjCeeceeW keâes keâcyeeFve efkeâÙee pee jne nw~
more nuanced analysis of algorithm behavior Ùen Divide and Conquer keâer henÛeeve nw, peneB mecemÙee keâes Úesšs
under specific conditions. This is particularly
useful when: YeeieeW ceW yeeBše peelee nw, GvnW nue efkeâÙee peelee nw Deewj efheâj heefjCeeceeW
keâb[erMeveue Sefmebhšesefškeâ veesšsMeve Suieesefjoce kesâ kÙekenej keâes efceueekeâj Debeflece Gòej Øeehle efkeâÙee peele nw~
keâe DeefOekeâ met#ce efkeMues<eCe keâjves keâer Devegceefle oslee nw~ 19. Divide and Conquer is an algorithmic
Ùen efkeMes<e ™he mes GheÙeesieer neslee nw peye: paradigm that solves problems by:
(a) Analyzing algorithms with constant time ef [keeF[ Sb[ keâe@vkeâj Skeâ Suieesefjoefcekeâ Øeefleceeve nw pees
complexity/Suieesefjoce keâe efkeMues<eCe efmLej meceÙe mecemÙeeDeeW keâes nue keâjlee nw:
peefšuelee kesâ meeLe efkeâÙee pee jne nes (a) Iteratively solving subproblems
(b) The input size is fixed GhemecemÙeeDeeW keâes hegvejeke=òe ™he mes nue keâjkesâ
Fvehegš Deekeâej efmLej nes (b) Recursively solving subproblems
(c) The input data is random GhemecemÙeeDeeW keâes hegvejeke=òe (Recursive) ™he mes nue
Fvehegš [sše ÙeeÂefÛÚkeâ nes keâjkesâ
(d) Algorithm behavior varies based on certain (c) Using heuristics to find solutions
input characteristics/Suieesefjoce keâe kÙekenej kegâÚ meceeOeeve Keespeves kesâ efueS nerÙegefjefmškeâ keâe GheÙeesie keâjkesâ
Fvehegš efkeMes<eleeDeeW kesâ DeeOeej hej yeouelee nes (d) Greedily combining solutions
Ans. (d) : kebâef[Meveue Sefmecešesefškeâ veesšsMeve keâe GheÙeesie leye efkeâÙee meceeOeeveeW keâes «eeref[ueer mebÙeesefpele keâjkesâ
peelee nw peye Suieesefjoce keâe ØeoMe&ve Fvehegš keâer kegâÚ efJeMes<e efmLeefleÙeeW Ans. (b) : Divide and Conquer lekeâveerkeâ nw mecemÙee keâes Úesšs-
(pewmes Fvehegš keâe ›eâce, [sše keâe efJelejCe, Ùee keâesF& efJeMes<e iegCe) hej Úesšs Ghe-mecemÙeeDeeW (Subproblems) ceW efJeYeeefpele efkeâÙee peelee nw,
efveYe&j keâjlee nw~ GoenjCe kesâ efueS kegâÚ mee@efš&ie Suieesefjoce (pewmes Fve Ghe-mecemÙeeDeeW keâes hegvejeJeleea (Reversively) nue efkeâÙee peelee nw
Quick Sort) keâe meceÙe peefšuelee leye Deueie neslee nw peye Fvehegš Deewj efheâj Fvekesâ meceeOeeveeW keâes efceueekeâj cetue mecemÙee keâe nue Øeehle
henues mes ner mee@šx[ neslee nw Ùee peye Jen ÙeeÂefÛÚkeâ neslee nw~ efkeâÙee peelee nw~
Bihar STET 36 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
20. A threaded binary tree is a binary tree in (c) Stacks/mšwkeäme
which: (d) Queues/keäÙetÌpe
Skeâ LeÇs[s[ yeeFvejer š^er ken neslee nw efpemeceW:
Ans. (a) : Separate chaining ceW, nwMe šsyeue kesâ ØelÙeskeâ yekesâš
(a) Each node has two children
(Bucket) ceW Skeâ linked list keâe GheÙeesie efkeâÙee peelee nw~ peye nwMe
ØelÙeskeâ vees[ kesâ oes yeÛÛes nesles nw
(b) Each node has at most one child
heb âkeäMeve oes Ùee oes mes DeefOekeâ keys kesâ efueS Skeâ ner Fb[skeäme pevejsš
ØelÙeskeâ vees[ kesâ DeefOekeâlece Skeâ yeÛÛee neslee nw keâjlee nw, celeueye Collision neslee nw, lees Gve keys keâes Gme yekesâš
(c) Each node is connected to its parent
keâer linked list ceW peesÌ[ efoÙee peelee nw keäÙeeWefkeâ FmeceW Dynamic
ØelÙeskeâ vees[ Deheves hewjWš mes pegÌ[e neslee nw memory allocation neslee nw Deewj insertion/deletion
(d) Each node has a thread connecting it to its operations Deemeeveer mes efkeâS pee mekeâles nQ~
predecessor or successor/ØelÙeskeâ vees[ Deheves 24. Which collision resolution technique involves
hetke&keleer& Ùee Gòejkeleer& mes pegÌ[er Skeâ LeÇ[s jKelee nw placing collided elements in the next available
empty slot in the hash table?
Ans. (d) : LesÇ[s[ yeeFvejer š^er Skeâ Øekeâej keâe yeeFvejer š^er [sše keâewve-meer keâesefueÌpeve jsÌpeesuÙetMeve lekeâveerkeâ nsMe šsyeue ceW
mš^keäÛej nw, peneB yeeFvejer š^er ceW Keeueer yeeSb Deewj oeSb ÛeeFu[ škeâjeke keeues SefueceWšdme keâes Deieues GheueyOe Keeueer
hee@Fbšme& keâes LeÇs[dme Éeje ØeeflemLeeefhele efkeâÙee peelee nw, pees vees[dme keâes muee@š ceW jKeves ceW Meeefceue nesleer nw?
meerOes Gvekesâ Fve-Dee@[&j hetJe&Jeleea (Predecessor) Ùee GòejeefOekeâejer
(a) Linear probing/ueerefveÙej Øeesefyebie
(Successor) mes peesÌ[les nQ,efpememes efjkeâme&ve Ùee mšwkeâ keâe GheÙeesie
(b) Quadratic probing/keäkee[^sefškeâ Øeesefyebie
efkeâS efyevee š^er keâes heej keâjves keâe Skeâ lejerkeâe Øeoeve efkeâÙee peelee nw~
(c) Separate chaining/meshejsš Ûesefvebie
21. Which traversal algorithm is typically
implemented using a stack data structure? (d) Double hashing/[yeue nwefMebie
keâewve-mee š^ekeme&ue Suieesefjoce Deeceleewj hej mšwkeâ [sše Ans. (a) : jwefKekeâ peebÛe (Linear Probing) Skeâ collision
mebjÛevee keâe GheÙeesie keâjkesâ ueeiet efkeâÙee peelee nw? resolution technique nw efpemeceW, Ùeefo Skeâ slot (nwMe šsyeue ceW
(a) DFS mLeeve) henues mes occupied (DeefOeke=âle) nw, lees collided element
(b) BFS (škeâjeÙee ngDee lelJe) keâes Deieues available (Keeueer) slot ceW jKee
(c) Both DFS and BFS/oesveeW DFS Deewj BFS peelee nw~ Ùen Skeâ-Skeâ keâjkesâ Deeies kesâ slot keâes check keâjlee nw peye
(d) Neither DFS nor BFS/ve DFS Deewj ve ner BFS lekeâ efkeâ Skeâ Keeueer slot veneR efceue peelee nw~
Ans. (a) : DFS (Depth-First Search) keâes mšwkeâ (Stack) [sše 25. In the Tower of Hanoi problem with "n" disks,
mebjÛevee keâe GheÙeesie keâjkesâ ueeiet efkeâÙee peelee nw, keäÙeeWefkeâ Ùen efjkeâme&ve how many moves are required to solve the
problem?
(Recursion) Ùee Skeämeefhueefmeš mšwkeâ kesâ ceeOÙece mes ienjeF& lekeâ
'n' ef[mkeâ kesâ meeLe še@kej Dee@heâ nveesF& mecemÙee keâes nue
peelee nw~ peyeefkeâ BFS (Breath-First Search) keâes keäÙet (Queve)
keâjves kesâ efueS efkeâleves cetkme keâer DeekeMÙekeâlee nesleer nw?
[sše mebjÛevee keâe GheÙeesie keâjkesâ ueeiet efkeâÙee peelee nw, keäÙeeWefkeâ Ùen
(a) n (b) 2n
uesJeue yeeSb uesJeue š^wJeme& keâjlee nw~ (c) 2^n-1 (d) 2^n
22. In a directed graph, an edge that points from
Ans. (c) : še@Jej Dee@heâ nveesF& mecemÙee ceW, n ef[mkeâ keâes Skeâ je@[ mes
vertex A to vertex B is denoted as:
Skeâ efveo&sefMele «eeheâ ceW, Ùeefo Skeâ Spe keš&skeäme A mes otmejs je@[ hej ues peeves kesâ efueS vÙetvelece ÛeeueeW keâer mebKÙee 2 – 1
n

keš&skeäme B keâer Deesj FMeeje keâjlee nw, lees Fmes keâwmes nesleer nw~ Ùen Skeâ hegvejeJe=efòe mebyebOe (Recurrence relation) Éeje
oMee&Ùee peelee nw? efmeæ efkeâÙee pee mekeâlee nw~
(a) (A, B) (b) [A, B] • 1 ef[mkeâ kesâ efueS : 1 Ûeeue (21 – 1 = 1)
(c) <A, B> (d) {A, Bue • 2 ef[mkeâ kesâ efueS : 3 Ûeeue (21 – 1 = 3)
Ans. (a) : efveoxefMele «eeheâ (Directed Graph) ceW, Deiej keâesF& • 3 ef[mkeâ kesâ efueS : 7 Ûeeue (2 – 1 = 7)
3

efkeâveeje (edge) Meer<e& A mes Meer<e& B keâer Deesj Fbefiele keâjlee nw, lees Fmes • Deewj Fmeer lejn, n ef[mkeâ kesâ efueS 2n – 1 ÛeeueW~
meeceevÙele: (A,B) kesâ ™he ceW efve™efhele efkeâÙee peelee nw~ ÙeneB hej 26. The process of removing recursion involves
keâes‰keâ (Parentheses) oMee&les nw, efkeâ Ùen Skeâ ›eâceyeæ peesÌ[e replacing recursive function calls with:
(Ordered pair) nw Ùeeveer efkeâveeje A mes B keâer Deesj efveoxefMele nw~ ef jkeâme&ve keâes nševes keâer Øeef›eâÙee ceW efjkeâefme&ke heâbkeäMeve
23. Separate chaining involves storing collided keâe@ume keâes efkeâmemes yeouee peelee nw?
elements in separate data structures, typically (a) More recursive function calls
in: DeefOekeâ efjkeâefme&ke heâbkeäMeve keâe@ume
meshejsš Ûesefvebie ceW škeâjeke keeues SefueceWšdme keâes Deueie- (b) Loops/uethme
Deueie [sše mebjÛeveeDeeW ceW meb«eefnle efkeâÙee peelee nw, (c) Additional memory allocation
Deeceleewj hej: Deefleefjòeâ cesceesjer DeueeskesâMeve
(a) Linked lists/efuebkeä[ efuemšdme (d) Non-recursive function calls
(b) Arrays/SjsÌpe iewj-efjkeâefme&ke heâbkeäMeve keâe@ume
Bihar STET 37 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
Ans. (b): efjkeâme&ve keâes nševes kesâ efueS efjkeâefme&Je hebâkeäMeve keâe@ume keâes Ans. (d) : heâeFue cewefveheguesMeve Dee@hejsMeve ceW heâeFume keâes Keesuevee,
uethme (pewmes for Ùee while uethe) mes yeouee peelee nw~ Fmemes mšwkeâ yebo keâjvee, heÌ{vee, efueKevee, Gvekeâer meece«eer keâes Dehe[sš keâjvee, Deewj
cesceesjer keâe GheÙeesie keâce neslee nw Deewj keâes[ keâer o#elee yeÌ{leer nw~ GvnW ef[ueerš keâjvee pewmes keâeÙe& Meeefceue nesles nQ~ Ùes Dee@hejsMeve Ùetpej
27. A formal model of protection in an operating Ùee Øees«eece keâes heâeFume kesâ meeLe Fbšjwkeäš keâjves keâer Devegceefle osles nw~
system provides: 30. The I/O subsystem in an operating system is
Dee@hejsefšbie efmemšce ceW megj#ee keâe Skeâ DeewheÛeeefjkeâ cee@[ue responsible for:
Øeoeve keâjlee nw: Dee@hejsefšbie efmemšce ceW I/O meyeefmemšce keâe keâeÙe& nw:
(a) Allocating memory for processes
(a) A mathematical framework for analyzing
Øeesmesmesme kesâ efueS cesceesjer Deuee@š keâjvee
resource allocation/mebmeeOeve Deekebšve kesâ efkeMues<eCe
(b) Managing the file system
kesâ efueS Skeâ ieefCeleerÙe {ebÛee heâeFue efmemšce keâe ØeyebOeve keâjvee
(b) Guidelines for designing user interfaces (c) Managing input/output operations between
ÙetÌpej Fbšjheâsme ef[ÌpeeFve kesâ efueS efoMeeefveo&sMe processes and input/output devices
(c) Methods for optimizing memory Øeesmesmesme Deewj Fvehegš/DeeGšhegš ef[keeFmesme kesâ yeerÛe
management/cesceesjer ØeyebOeve keâes Dee@efhšceeFÌpe keâjves kesâ Fvehegš/DeeGšhegš Dee@hejsMevme keâes ØeyebefOele keâjvee
lejerkesâ (d) Allocating CPU time to process
(d) Techniques for improving CPU utilization Øeesmesmesme keâes CPU meceÙe Deekebefšle keâjvee
CPU GheÙeesefielee megOeejves keâer lekeâveerkesâb Ans. (c) : Dee@hejsefšbie efmemšce ceW Fvehegš/DeeGšhegš meyeefmemšce keâe
Ans. (a) : mebmeeOeve DeeJebšve keâe efJeMues<eCe keâjves kesâ efueS Skeâ keâece Øeesmesme Deewj ef[JeeFme (pewmes keâer yees[&,ceeGme, efØebšj) kesâ yeerÛe
ieefCeleerÙe Ì{ebÛee cee@[ue Dee@hejsefšbie efmemšce ceW mebmeeOeveeW (pewmes heâeFume, [sše š^ebmeheâj keâes cewvespe keâjvee neslee nw~ Ùen cesceesjer Ùee CPU šeFce
cesceejer) keâer megj#ee Deewj Skeämesme efveÙeb$eCe keâes ieefCeleerÙe ™he mes cewvespeceWš mes Deueie neslee nw~
heefjYeeef<ele keâjlee nw, leeefkeâ Gvekeâe efJeMues<eCe Deewj melÙeeheve efkeâÙee pee 31. The primary goal of load control is to:
mekesâ~ uees[ keâbš^esue keâe cegKÙe GösMÙe nw
(a) Prevent processes from running concurrently
28. In an operating system, a "buffer cache" is
used to:
Øeesmesmesme keâes SkeâmeeLe Ûeueves mes jeskeâvee
(b) Avoid context switching between processes
Dee@hejsefšbie efmemšce ceW 'yeheâj keâwMe' keâe GheÙeesie efkeâÙee
Øeesmesmesme kesâ yeerÛe keâe@všskeämš efmkeefÛebie mes yeÛevee
peelee nw: (c) Ensure that CPU time is evenly distributed
(a) Store files in memory among processes/ CPU meceÙe keâes Øeesmesmesme kesâ
heâeFueeW keâes cesceesjer ceW mšesj keâjves kesâ efueS yeerÛe meceeve ™he mes efkeleefjle keâjvee
(b) Store copies of frequently used files in (d) Maximize the usage of virtual memory
memory/Dekeämej GheÙeesie keâer peeves keeueer heâeFueeW keâer keÛe&gDeue cesceesjer kesâ GheÙeesie keâes DeefOekeâlece keâjvee
ØeefleÙeeB cesceesjer ceW mšesj keâjves kesâ efueS Ans. (c) : uees[ kebâš^esue keâe ue#Ùe Ùen megefveef§ele keâjvee nw efkeâ CPU
(c) Store the operating system kernel šeFce meYeer Øeef›eâÙeeDeeW (Processes) ceW meceeve ™he mes efJeleefjle nes
Dee@hejsefšbie efmemšce keâve&sue keâes mšesj keâjves kesâ efueS leeefkeâ keâesF& Skeâ Øeesmesme pÙeeoe efjmeesme& ve ueW Deewj efmemšce hesâÙejueer
(d) Store input/output devices keâece keâjW~
Fvehegš/DeeGšhegš ef[keeFme keâes mšesj keâjves kesâ efueS 32. The purpose of a page table in a paging system
Ans. (b) : yeheâj kewâMe Skeâ neF&-mheer[ cesceesjer SefjÙee neslee nw peneB is to:/hesefpebie efmemšce ceW hespe šsyeue keâe GösMÙe nw:
Dekeämej Skeämesme nesves Jeeueer heâeFume Ùee [sše keâer keâe@heer jKeer peeleer nw~ (a) Store pages of memory
Fmemes ef[mkeâ Skeämesme keâer mebKÙee keâce nesleer nw Deewj efmemšce keâer cesceesjer kesâ hespesme keâes mšesj keâjvee
hejheâe@ceXme yeÌ{leer nw~ (b) Manage input/output operations
29. File manipulation operations in an operating Fvehegš/DeeGšhegš Dee@hejsMevme keâe ØeyebOeve keâjvee
system include: (c) Translate virtual addresses to physical
Dee@hejsefšbie efmemšce ceW heâeFue cewefveheguesMeve Dee@hejsMevme ceW addresses/ keÛe&gDeue S[^sme keâes efheâefpekeâue S[^sme ceW
keäÙee Meeefceue nw? š^ebmeuesš keâjvee
(a) Allocating memory to files (d) Store program instructions
heâeFume keâes cesceesjer Deuee@š keâjvee Øees«eece Fbmš^keäMevme keâes mšesj keâjvee
(b) Assigning file names to processes Ans. (c) : hesefpebie efmemšce ceW hespe šsyeue Skeâ cewefhebie štue nw pees
heâeFue veeceeW keâes Øeesmesmesme keâes DemeeFve keâjvee Øees«eece Éeje Ùetpe efkeâS ieS JeÛeg&Deue S[^sme keâes efheâefpekeâue S[^sme ceW
(c) Loading files into CPU registers yeouelee nw, leeefkeâ [sše mener ueeskesâMeve hej Skeämesme nes mekesâ~
heâeFume keâes CPU jefpemšj ceW uees[ keâjvee 33. In multiprogramming with fixed partitions, if a
(d) Reading writing, and modifying file content process requires more memory than is a
heâeFue keâbšWš keâes heÌ{vee, efueKevee Deewj mebMeesefOele keâjvee available in a partition, it may lead to:
Bihar STET 38 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
 efheâkeäm[ heeefš&Meve kesâ meeLe ceušerØees«eeefcebie ceW, Ùeefo keâesF& (a) New Technology File System
Øeesmesme efkeâmeer heeefš&Meve mes DeefOekeâ cesceesjer ceebielee nw, lees vÙet šskeäveesuee@peer heâeFue efmemšce
Ùen efkeâme mecemÙee keâes pevce os mekeâlee nw? (b) New Tree File System
(a) Fragmentation/ØeâwieceWšsMeve vÙet š^er heâeFue efmemšce
(b) Deadlock/[s[uee@keâ (c) New Table type File System
vÙet šsyeue šeFhe heâeFue efmemšce
(c) Priority inversion/ØeeÙeesefjšer Fvekepe&ve
(d) Both A and C/ Ghejesòeâ ceW mes oesveeW A Deewj C
(d) Starvation/mšejkesMeve
Ans. (a) : NTFS (New Technology File System) efJeb[espe
Ans. (a) : efheâkeäm[ heešeaMeve ceW cesceesjer yuee@keäme keâe meeFpe efveef§ele
Dee@hejsefšbie efmemšce ceW GheÙeesie nesves Jeeueer Skeâ heâeFue efmemšce nw pees
neslee nw~ Deiej Øeesmesme keâes pe™jle mes keâce cesceesjer efceueleer nw, lees
cesceesjer keâe kegâÚ efnmmee DeveÙetp[ jn peelee nw, efpemes øewâieceWšsMeve megj#ee, efJeÕemeveerÙelee Deewj yeÌ[s heâeFue meheesš& kesâ efueS peeveer peeleer nw~
(Fragmentation) keânles nw~ 37. Which of the following is a top-down approach
in which the entity's higher level can be divided
34. What is DBMS?/DBMS keäÙee nw? into two lower sub-entities?
(a) DBMS is a collection of queries ken keâewve-mee še@he-[eGve Âef<škeâesCe nw efpemeceW GÛÛe mlej
DBMS keäkesjerpe keâe meb«en nw keâer Sbefššer keâes oes efvecve mlejerÙe Ghe-SbefššerÌpe ceW
(b) DBMS is a high-level language efkeYeeefpele efkeâÙee pee mekeâlee nw?
DBMS Skeâ neF&-ueskeue Yee<ee nw (a) Aggregation/S«eeriesMeve
(c) DBMS is a programming language
(b) Generalization/pevejueeFpesMeve
DBMS Skeâ Øees«eeefcebie Yee<ee nw
(c) Specialization/mhesMeueeFpesMeve
(d) DBMS stores, modifies and retrieves data
DBMS [sše keâes meb«eefnle, mebMeesefOele Deewj hegveØee&hle (d) All of the above/Ghejesòeâ meYeer
keâjlee nw Ans. (c) : [sšeyesme kesâ še@he-[eGve DeØeesÛe ceW efJeMes<eerkeâjCe
Ans. (d) : DBMS ([sšeyesme cewvespeceWš efmemšce) Skeâ mee@heäšJesÙej nw (Specialization) Skeâ meeceevÙe (higher level) Sbefššer keâes
pees [sšeyesme keâes mšesj, cewvespe (pewmes cee@[erheâeF&, efjš^erJÙe [sše) Deewj efJeefMe° (lower level) Ghe-Sbefhšerpe ceW yeeše peelee nw~ GoenjCe kesâ
Skeämesme keâjves ceW ceoo keâjlee nw~ GoenjCe : MYSQL, Drade. efueS, ‘‘Jeenve’’ keâes ‘keâej’ Deewj ‘š^keâ’ ceW efJeYeeefpele keâjvee~
35. Which of the following is correct according to 38. The term "DFD" stands for?
the technology deployed by DBMS? 'DFD' keâe hetCe& ™he keäÙee nw?
DBMS Éeje ØeÙegòeâ lekeâveerkeâ kesâ Devegmeej efvecveefueefKele (a) Data file diagram/[sše heâeFue [eÙe«eece
ceW mes keâewve-mee mener nw? (b) Data flow document/[sše heäuees [e@keäÙetceWš
(a) Pointers are used to maintain transactional (c) Data flow diagram/[sše heäuees [e@Ùe«eece
integrity and consistency/hJeeF&šme& keâe GheÙeesie (d) None of the above/FveceW mes keâesF& veneR
uesveosve keâer DeKeb[lee Deewj efmLejlee yeveeS jKeves kesâ efueS Ans. (c) : DFD keâe hetCe& ™he [sše heäuees [eÙe«eece neslee nw~ Ùen
efkeâÙee peelee nw efmemšce ceW [sše kesâ ØeJeen keâes «eeefheâkeâueer oMee&ves keâe Skeâ lejerkeâe nw,
(b) Cursors are used to maintain transactional efpemeceW Øeef›eâÙeeSb, [sše mšesj Deewj [sše heäuees Meeefceue nesles nw~
integrity and consistency/keâme&N keâe GheÙeesie
š^ebpeskeäMeveue DeKeb[lee Deewj efmLejlee yeveeS jKeves kesâ efueS 39. The term "FAT" is stands for ……
'FAT' Meyo keâe hetCe& ™he keäÙee nw?
efkeâÙee peelee nw
(c) Looks are used to maintain transactional (a) File Allocation Tree/HeâeFue SueeskesâMeve š^er
integrity and consistency/uee@keäme keâe GheÙeesie (b) File Allocation Table/ HeâeFue SueeskesâMeve šsyeue
š^ebpeskeäMeveue DeKeb[lee Deewj efmLejlee yeveeS jKeves kesâ efueS (c) File Allocation Graph/ ÌHeâeFue SueeskesâMeve «eeÌHeâ
efkeâÙee peelee nw (d) All of the above/Ghejesòeâ meYeer
(d) Triggers are used to maintain transactional
Ans. (b) : FAT keâe hetCe& ™he heâeFue DeueeskesâMeve šsyeue neslee nw~
integrity and consistency/efš^ieme& keâe GheÙeesie
š^ebpeskeäMeveue DeKeb[lee Deewj efmLejlee yeveeS jKeves kesâ efueS Ùen Skeâ heâeFue efmemšce Deeefke&âšskeäÛej nw pees heâeFueeW keâer efmLeefle Deewj
efkeâÙee peelee nw mšesjspe ueeskesâMeve keâes š^wkeâ keâjlee nw~
Ans. (c) : [sšeyesme ØeyebOeve ceW, uee@keäme keâe GheÙeesie Skeâ ner meceÙe ceW 40. The term "Data" refers to:
'Data' Meyo keâe leelheÙe& nw:
keâF& GheÙeesiekeâlee&DeeW Éeje [sše Skeämesme keâjves hej nesves Jeeueer
mecemÙeeDeeW (pewmes [sše Demebieefle) keâes jeskeâves kesâ efueS efkeâÙee peelee nw~ (a) The electronic representation of the
Fmekeâe GheÙeesie uesve-osve keâer DeKeb[lee Deewj efmLejlee (Transactional information (or data)/metÛevee (Ùee [sše) keâe
integrity and consistency) yeveeS jKeves kesâ efueS efkeâÙee peelee nw~ Fueskeäš^e@efvekeâ ØeefleefveefOelke
36. The term "NTFS" refers to which one of the (b) Basic information/cetue peevekeâejer
following? (c) Row Facts and figures/keâÛÛes leLÙe Deewj DeebkeâÌ[s
'NTFS' keâe hetCe& ™he keäÙee nw? (d) Both A and C/A Deewj C oesveeW
Bihar STET 39 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
Ans. (c) : [sše (Data) Meyo keâÛÛes leLÙe Deewj DeebkeâÌ[s keâes meboefYe&le 45. Contention-based MAC protocols are
keâjlee nw~ Ùen [sše kesâ meyemes yesefmekeâ heâe@ce& (DemebmeeefOele peevekeâejer) keâes commonly used in:/keâbšWMeve-DeeOeeefjle MAC
oMee&lee nw, efpemes Deeies Øeesmesme keâjkesâ GheÙeesieer peevekeâejer yeveeÙee peelee nw~ Øeesšeskeâe@ue meeceevÙeleŠ keâneB GheÙeesie efkeâS peeles nQ?
41. What is the primary function of routing in the (a) Ethernet network/F&Lejvesš vesškeke&â
network layer? (b) Token Ring networks/šeskeâve efjbie vesškeke&â
vesškeke&â uesÙej ceW jeGefšbie keâe ØeeLeefcekeâ keâeÙe& keäÙee nw? (c) ATM networks/SšerSce vesškeke&â
(a) Data framing/[sše Øeâsefcebie (d) Point-to-Point networks/hee@Fbš-št-hee@Fbš vesškeke&â
(b) Error correction/$egefš megOeej (Error correction) Ans. (a) : keâe@všWMeve-yesmš Øeesšeskeâe@ue (pewmes CSMA/CD), ceW
(c) Finding the best path for data/[sše kesâ efueS ef[JeeFme [sše Yespeve mes henues vesšJeke&â keâer GheueyOelee Ûeskeâ keâjles nQ~
mekee&sòece ceeie& Keespevee Ùen F&Ùejvesš vesšJeke&â ceW ØeÙeesie efkeâÙee peelee nw, peyeefkeâ šeskeâve efjbie
(d) Flow control/heäuees keâbš^esue pewmes vesšJeke&â ceW DevÙe Øeesšeskeâe@ue nesles nw~
Ans. (c) : vesšJeke&â uesÙej ceW ™efšbie keâe cegKÙe GösMÙe vesšJeke&â hej 46. Routing involves:
[sše hewkesâšdme keâes œeesle mes iebleJÙe lekeâ hengbÛeeves kesâ efueS meyemes GheÙegòeâ jeGefšbie ceW keäÙee Meeefceue nw?
ceeie& (Path) keâe ÛeÙeve keâjvee nw~ (a) Dividing data into frames
42. What is a socket in the context of process-to- [sše keâes Øeâscme ceW efkeYeeefpele keâjvee
process communication?/Øeesmesme-št-Øeesmesme mebÛeej (b) Managing flow control
kesâ meboYe& ceW mee@kesâš keäÙee neslee nw? heäuees keâbš^esue keâe ØeyebOeve
(a) A hardware device for data transmission (c) Determining the best path for data packets
[sše š^ebmeefceMeve kesâ efueS Skeâ ne[&kesÙej ef[keeFme [sše hewkesâšdme kesâ efueS mekee&sòece ceeie& efveOee&efjle keâjvee
(b) A software interface for network (d) Correcting errors in data transmission
communication/vesškeke&â mebÛeej kesâ efueS Skeâ [sše š^ebmeefceMeve ceW $egefšÙeeW keâes "erkeâ keâjvee
mee@ÌHeäškesÙej FbšjÌHeâsme Ans. (c) : ™efšbie
vesšJeke&â hej [sše hewkesâšdme keâes œeesle mes iebleJÙe lekeâ
(c) A type of cable used for high-speed data heng B Ûeeves kes â ef ueS meyemes GheÙegòeâ ceeie& (path) Ûegveves keâer Øeef›eâÙee nw~
transmission/neF&-mheer[ [sše š^ebmeefceMeve kesâ efueS Skeâ FmeceW ™efšbie šsyeume Deewj Suieesefjoce (pewmes OSPF, BGP) keâe
Øekeâej keâer kesâyeue GheÙeesie neslee nw~ Ùen heäueeW kebâš^esue Ùee Sj keâjskeäMeve mes Deueie nw~
(d) type of network topology 47. What is the purpose of ARP (Address
Skeâ Øekeâej keâer vesškeke&â šesheesuee@peer Resolution Protocol)?
Ans. (b) : mee@kesâš (Socket) Skeâ mee@heäšJesÙej Fbšjhesâme nw pees oes Øeesmesme ARP (S[^sme jspeesuÙetMeve Øeesšeskeâe@ue) keâe GösMÙe keäÙee
(pewmes keäueeFbš Deewj meJe&j) kesâ yeerÛe vesšJeke&â hej [sše š^ebmeefceMeve keâes mebYeJe nw?
yeveelee nw~ Ùen ne[&JesÙej veneR nw, yeefukeâ Skeâ Øees«eeefcebie DeJeOeejCee nw pees (a) To assign IP addresses to devices
IP S[^sme Deewj heesš& vebyej keâe GheÙeesie keâjlee nw~ GhekeâjCeeW keâes IP S[^sme DemeeFve keâjvee
43. Data transmission using multiple pathways (b) To resolve domain names to IP addresses
simultaneously is known as:/Skeâ meeLe keâF& ceeieeX keâe [escesve veece keâes IP S[^sme ceW heefjkeefle&le keâjvee
(c) To map MAC addresses to IP addresses
GheÙeesie keâjkesâ [sše š^ebmeefceMeve keâes keäÙee keâne peelee nw?
MAC S[^sme keâes IP S[^sme mes cewhe keâjvee
(a) Parallel Transmission/ hewjsueue š^ebmeefceMeve (d) To manage network congestion
(b) Serial Transmission/meerefjÙeue š^ebmeefceMeve vesškeke&â YeerÌ[ keâe ØeyebOeve keâjvee
(c) Duplex Transmission/[ghueskeäme š^ebmeefceMeve Ans. (c) : ARP keâe cegKÙe
GösMÙe vesšJeke&â hej efkeâmeer ef[JeeFme kesâ
(d) Half-duplex Transmission/neheâ-[ghueskeäme š^ebmeefceMeve MAC S[^sme keâes Gmekesâ IP
S[^sme mes peesÌ[vee nQ, leeefkeâ [sše mener
Ans. (a) : hewjsueue š^ebmeefceMeve ceW, [sše kesâ keâF& efyešdme Skeâ meeLe ef[JeeFme lekeâ hengBÛe mekesâ~
Deueie-Deueie JeeÙej Ùee heLeeW kesâ ceeOÙece mes Yespes peeles nQ~ Ùen 48. Which software life cycle model allows for
meerefjÙeue š^ebmeefceMeve mes lespe neslee nw, peneb [sše Skeâ ner heLe hej Skeâ iterative development and incorporates risk
efyeš kesâ yeeo otmejer efyeš Yespeer peeleer nw~ analysis?/keâewve-mee mee@heäškesÙej peerkeve Ûe›eâ cee@[ue
hegvejeke=òe efkekeâeme keâer Devegceefle oslee nw Deewj peesefKece
44. Which of the following is NOT a network
topology?/efvecveefueefKele ceW mes keâewve-meer vesškeke&â efkeMues<eCe keâes Meeefceue keâjlee nw?
šesheesuee@peer veneR nw? (a) Waterfall model/kee@šjheâe@ue cee@[ue
(b) Prototype model/ØeesšesšeFhe cee@[ue
(a) Star/mšej (b) Ring/efjbie
(c) Spiral model/mheeFjue cee@[ue
(c) Disk/ef[mkeâ (d) Mesh/cesMe
(d) Agile model/SpeeFue cee@[ue
Ans. (c) : vesšJeke&â šesheesuee@peer vesšJeke&â ceW ef[JeeFme kesâ pegÌ[ves keâe
Ans. (c) : mheeFjue cee@[ue ceW mee@heäšJesÙej keâes Úesšs-Úesšs ÛejCeeW ceW
lejerkeâe yeleeleer nw~ mšej, efjbie Deewj cesMe Skeâ JewOe šesheesuee@peer nQ, efJekeâefmele efkeâÙee peelee nw Deewj nj ÛejCe ceW efjmkeâ Sveeefueefmeme keâer
uesefkeâve ‘ef[mkeâ’ keâesF& šesheesuee@peer veneR nw~ peeleer nw, efpememes peesefKeceeWb keâes keâce efkeâÙee pee mekesâ~
Bihar STET 40 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
49. What is the main goal of software quality Ans. (c): efmemšce šsefmšbie keâe cegKÙe ue#Ùe Ùen megefveef§ele keâjvee nw
assurance?/mee@heäškesÙej keäkeeefuešer SMÙeesjWme keâe cegKÙe efkeâ hetje mee@heäšJesÙej efmemšce GheÙeesiekeâlee& keâer DeeJeMÙekeâleeDeeW kesâ
GösMÙe keäÙee nw? Devegmeej keâece keâjlee nw~ FmeceW efmemšce keâes Skeâ mece«e FkeâeF& kesâ ™he
(a) To eliminate all defects from the software ceW šsmš efkeâÙee peelee nw, ve efkeâ Deueie-Deueie YeeieeW keâes~
mee@heäškesÙej mes meYeer oes<eeW keâes meceehle keâjvee
(b) To ensure the software is defect - free before 53. Which metric is used for estimating the size of
release a software project?/efkeâmeer mee@ÌHeäškesÙej Øeespeskeäš kesâ
efjueerÌpe mes henues mee@heäškesÙej keâes oes<ecegòeâ yeveevee Deekeâej keâe Devegceeve ueieeves kesâ efueS keâewve-mee ceerefš^keâ
(c) To establish and enforce standards and GheÙeesie efkeâÙee peelee nw?
processes to improve software quality (a) Cyclomatic Complexity/meeFkeäueescewefškeâ
mee@heäškesÙej iegCekeòee ceW megOeej kesâ efueS ceevekeâeW Deewj keâe@chuesefkeämešer
Øeef›eâÙeeDeeW keâes mLeeefhele keâjvee Deewj ueeiet keâjvee (b) Function Points (FP)/heâbkeäMeve hee@Fbšdme (FP)
(d) To test software under different conditions
(c) Defect Density/ef[heâskeäš [Wefmešer
efkeefYeVe heefjefmLeefleÙeeW ceW mee@heäškesÙej keâe hejer#eCe keâjvee
(d) Software Reliability Index
Ans. (c) : mee@heäšJesÙej keäJeeefuešer SMÙeejWme (SQA) keâe GösMÙe
mee@ÌHeäškesÙej efjueeÙeefyeefuešer Fb[skeäme
mee@heäšJesÙej keâer iegCeJeòee yeÌ{eves kesâ efueS Øeef›eâÙeeDeeW Deewj ceevekeâeW keâes
ueeiet keâjvee nw, ve efkeâ kesâJeue ef[hesâkeäšdme keâes {tb{vee Ùee Kelce keâjvee~ Ans. (b) : Function Points (FP) Skeâ Ssmee ceeheoC[
(Metric) nw, pees mee@heäšJesÙej Øeespeskeäš kesâ meeFpe (Deekeâej) keâe
50. Reverse engineering is primarily used for:
efjkeme& FbpeerefveÙeefjbie keâe cegKÙe GheÙeesie efkeâmekesâ efueS Devegceeve ueieeves kesâ efueS GheÙeesie efkeâÙee peelee nw~ Fmekeâe GheÙeesie Ùen
efkeâÙee peelee nw? peeveves kesâ efueS efkeâÙee peelee nw efkeâ Skeâ Øeespeskeäš ceW efkeâlevee keâeÙe&
(a) Creating new software from scratch keâjvee nesiee, Deewj Ùen GheÙeesiekeâlee& kesâ pe™jleeW (User
Meg®Deele mes veÙee mee@heäškesÙej yeveevee requirements) hej DeeOeeefjle neslee nw~
(b) Improving software performance 54. What is the purpose of staffing level estimation
mee@heäškesÙej ØeoMe&ve ceW megOeej keâjvee in software project management?
(c) Understanding and documenting existing mee@ÌHeäškesÙej Øeespeskeäš ØeyebOeve ceW mšeefheâbie ueskeue keâe
software/ceewpetoe mee@heäškesÙej keâes mecePevee Deewj ØeuesefKele Devegceeve ueieeves keâe GösMÙe keäÙee nw?
keâjvee (a) To determine the number of hardware
(d) Testing software components components required/DeekeMÙekeâ ne[&kesÙej IeškeâeW keâer
mee@heäškesÙej IeškeâeW keâe hejer#eCe keâjvee mebKÙee efveOee&efjle keâjvee
Ans. (c) : efjJeme& FbpeerefveÙeefjbie ceW efkeâmeer ceewpetoe mee@heäšJesÙej keâer (b) To identify potential risks in the project
mebjÛevee Deewj keâeÙe&ØeCeeueer keâes mecePekeâj Gmekeâe [e@keäÙetceWšsMeve lewÙeej Øeespeskeäš ceW mebYeeefkele peesefKeceeW keâer henÛeeve keâjvee
efkeâÙee peelee nw~ (c) To allocate appropriate resources to the
51. Which testing approach involves testing project/Øeespeskeäš kesâ efueS GheÙegòeâ mebmeeOeve Deekebefšle keâjvee
individual components or units of code? (d) To estimate the maintenance costs of the
keâewve-mee hejer#eCe Âef<škeâesCe keâes[ kesâ kÙeefòeâiele IeškeâeW software/ mee@ÌHeäškesÙej kesâ jKejKeeke keâer ueeiele keâe
Ùee Ùetefvešdme kesâ hejer#eCe ceW Meeefceue neslee nw? Devegceeve ueieevee
(a) Integration Testing/Fbšer«esMeve šsefmšbie Ans. (c) : mšeefhebâie uesJeue (Staffing level) keâe Devegceeve ueieeves
(b) System Testing/efmemšce šsefmšbie keâe cegKÙe GösMÙe Øeespeskeäš kesâ efueS GheÙegòeâ mebmeeOeveeW (pewmes efkeâ
(c) Unit Testing/Ùetefveš šsefmšbie [sJeueheme&, šsmšme& Deeefo) keâe DeeJebšve keâjvee neslee nw, leeefkeâ keâeÙe&
(d) Acceptance Testing/SkeämeshšWme šsefmšbie meceÙe hej Deewj ØeYeeJeer {bie mes hetje efkeâÙee pee mekesâ~
Ans. (c) : Ùetefveš šsefmšbie ceW mee@heäšJesÙej kesâ Úesšs-Úesšs efnmmeeW (pewmes veesš– DeeÙeesie ves Fme ØeMve keâe Gòej (b) ceevee nw~
hebâkeäMevme Ùee cee@[Ÿetume) keâes Deueie mes šsmš efkeâÙee peelee nw leeefkeâ 55. Which keyword is used to create an instance of
Gvekeâer keâeÙe&#ecelee megefveef§ele keâer pee mekesâ~ a class in most programming languages?
52. What is the main goal of System Testing? DeefOekeâebMe Øees«eeefcebie Yee<eeDeeW ceW efkeâmeer keäueeme keâe FbmšWme
efmemšce šsefmšbie keâe cegKÙe GösMÙe keäÙee nw? yeveeves kesâ efueS keâewve-mee keâerke[& GheÙeesie efkeâÙee peelee nw?
(a) Testing individual components in isolation (a) alloc (b) new
kÙeefòeâiele IeškeâeW keâe Deueie-Deueie hejer#eCe (c) create (d) instance
(b) Testing the integration between different
Ans. (b) : pÙeeoelej Øees«eeefcebie Yee<eeDeeW (pewmes Java, C++, C#
software components/ efkeefYeVe mee@ÌHeäškesÙej IeškeâeW kesâ
yeerÛe SkeâerkeâjCe keâe hejer#eCe Deeefo) ceW efkeâmeer keäueeme keâer Skeâ veF& instance (object) yeveeves kesâ
(c) Testing software functionally from the user's ueS 'new' keyword keâe GheÙeesie efkeâÙee peelee nw~
ef
perspective/ GheÙeesiekeâlee& kesâ Âef<škeâesCe mes mee@ÌHeäškesÙej GoenjCe: Java ceW,
keâes keâeÙee&lcekeâ ™he mes hejer#eCe keâjvee Car my car = new car () ;
(d) Identifying defects in the source code 56. What is an abstract class in OOP?
œeesle keâes[ ceW oes<eeW keâer henÛeeve keâjvee OOP ceW Symš^wkeäš keäueeme keäÙee nesleer nw?

Bihar STET 41 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
 (a) A class with no methods 59. Which principle ensures that only essential
Skeâ keäueeme efpemeceW keâesF& cesLe[ veneR neslee information is visible to the outside world?
(b) A class that cannot be instantiated keâewve-mee efmeæeble Ùen megefveefMÛele keâjlee nw efkeâ kesâkeue
Skeâ keäueeme efpemes FbmšWefmeSš veneR efkeâÙee pee mekeâlee DeekeMÙekeâ peevekeâejer ner yeenjer ogefveÙee keâes efoKeeF& os?
(c) A class that can only have private members (a) Polymorphism/hee@efuecee@efhe&âÌpedce
Skeâ keäueeme efpemeceW kesâkeue ØeeFkesš ceWyeme& nes mekeâles nQ (b) Information hiding/Fveheâe@ce&sMeve neFef[bie
(d) A class that cannot have methods with (c) Encapsulation/SvkeâwhmeguesMeve
parameters/ Skeâ keäueeme efpemeceW hewjeceeršj keeues cesLe[
(d) Abstraction/Symš^wkeäMeve
veneR nes mekeâles
Ans. (*) : Abstraction Jen efmeæevle nw pees Ùen megefveef§ele keâjlee
Ans. (b) : Abstract Class Dee@ypeskeäš DeesefjSbšs[ Øees«eesefcebie
(Oop) ceW Skeâ Ssmeer class nesleer nw efpemes meerOes instantiats (object
nw efkeâ efmehe&â DeeJeMÙekeâ peevekeâejer ner yeenj (User Ùee DevÙe
Objects) keâes efoKeeÙeer os, Deewj peefšuelee (Complexity) keâes efÚhee
yeveekeâj GheÙeesie) veneR efkeâÙee pee mekeâlee~ Fmekeâe cegKÙe GösMÙe neslee nw
efkeâ Ùen otmejer keäueemesme kesâ efueS Base Class (Parent Class) keâer efueÙee peeÙeW~
lejn keâece keâjs~ Abstraction keâe cegKÙe GösMÙe:
57. What is the purpose of the "super" keyword in • kesâJeue Jener peevekeâejer GheueyOe keâjevee pees pe™jer nw~
Java and other similar languages? • efmemšce kesâ Devoj kesâ implementation details keâes Úgheevee~
Java Deewj DevÙe meceeve Yee<eeDeeW ceW 'super' keâerke[& keâe veesš– DeeÙeesie ves Fme ØeMve keâe Gòej (b) ceevee nw~
keäÙee GösMÙe neslee nw? 60. What is the main purpose of inheritance in
(a) It refers to the superclass in inheritance OOP?/OOP ceW FvensefjšWme keâe cegKÙe GösMÙe keäÙee nw?
FvensefjšWme ceW meghejkeäueeme keâes meboefYe&le keâjlee nw (a) To create instances of classes
(b) It creates a new object instance keäueemesme kesâ FbmšWme yeveevee
Skeâ veÙee Dee@ypeskeäš FbmšWme yeveelee nw (b) To prevent data abstraction
(c) It defines a new class [sše Symš^wkeäMeve keâes jeskeâvee
Skeâ veF& keäueeme keâes heefjYeeef<ele keâjlee nw (c) To establish a parent-child relationship
(d) It handles exceptions between classes
DehekeeoeW keâes mebYeeuelee nw keäueemesme kesâ yeerÛe hewjWš-ÛeeFu[ mebyebOe mLeeefhele keâjvee
Ans. (a) : Java leLee DevÙe Øees«eeefcebie (Object Oriented) (d) To define exceptions
Yee<eeDeeW ceW 'Super' keâerJe[& keâe GheÙeesie Parent Class (super SkeämeshMebme keâes heefjYeeef<ele keâjvee
class) keâes meboefYe&le (refer) keâjves kesâ efueS efkeâÙee peelee nw~ peye Ans. (c) : Inheritance, Dee@ypeskeäš DeesefjSbšs[ Øees«eeefcebie (Oop)
keâesF& Subclass (Child Class) efkeâmeer Super class keâes extend keâe Skeâ cenlJehetCe& efmeæevle nQ, efpemekeâe cegKÙe GösMÙe neslee nw efkeâ
keâjleer nw, lees Super keâer ceoo mes Skeâ class otmejer class keâer efJeMes<eleeDeeW (Properties) Deewj keâeÙeex
• nce Super class kesâ Constructor keâes keâe@ue keâj mekeâles nQ~ (methods) keâes Øeehle keâj mekeWâ~
• nce Super Class kesâ methods Ùee Variables keâes access keâj • Fmemes oes classes kesâ yeerÛe parent-child keâe mebyebOe mLeeefhele neslee nw~
mekeâles nQ, Keemekeâj peye Subclass ceW Gvner veeceeW mes Overricle 61. What are abstract methods?
efkeâÙee ieÙee nes~ Symš^wkeäš cesLe[dme keäÙee nesles nQ?
58. Which of the following best defines a class? (a) Methods that are inaccessible to the outside
efvecve ceW mes keâewve-mee efkekeâuhe keäueeme keâes meyemes DeÛÚer world/ Ssmes cesLe[ pees yeenjer ogefveÙee mes megueYe veneR nesles
lejn heefjYeeef<ele keâjlee nw? (b) Methods that have implementation details
(a) An instance of an object Ssmes cesLe[ efpeveceW keâeÙee&vkeÙeve (implementation) neslee nw
Skeâ Dee@ypeskeäš keâe FbmšWme (c) Methods without a body, defined in an
(b) A blueprint for creating objects abstract class/ Ssmes cesLe[ pees yee@[er kesâ efyevee nesles nQ
Dee@ypeskeäšdme yeveeves kesâ efueS Skeâ yuetefØebš Deewj Symš^wkeäš keäueeme ceW heefjYeeef<ele nesles nQ
(c) A variable holding data (d) Methods that cannot be inherited
[sše keâes jKeves keeuee Skeâ kesefjSyeue Ssmes cesLe[ efpevnW Fvensefjš veneR efkeâÙee pee mekeâlee
(d) A function with a return value
Ans. (c) : Abstract method keâe celeueye neslee nw Skeâ Ssmee
Skeâ efjšve& kewuÙet keeueer heâbkeäMeve
method (keâeÙe&ØeCeeueer), efpemes kesâJeue Ieesef<ele (declare) efkeâÙee peelee
Ans. (b) : Class Dee@ypeskeäš Dee@efjSbšs[ Øees«eeefcebie ceW (Oop) Skeâ nw, hej GmeceW keâesF& body (Ùeeefve keâes[) vener efueKee peelee~ Fmekeâer
yuetefØebš (Blue print) Ùee {ebÛee (Template) neslee nw, efpemekeâe Deesefjpeveue keâesef[bie Gme class kesâ subclass ceW keâer peeleer nw~
GheÙeesie keâjkesâ nce {ebÛee yeveeles nQ~ 62. Which protocol is commonly used for sending
• Skeâ Class ceW nce Propertion (data/variables) Deewj emails?/F&cesue Yespeves kesâ efueS Deeceleewj hej keâewve-mee
methods (functions/behaviour) keâes heefjYeeef<ele keâjles nQ~ Øeesšeskeâe@ue GheÙeesie efkeâÙee peelee nw?
peye nce keäueeme mes object yeveeles nw, lees Gme object ceW keäueeme keâer (a) .HTTPS (b) FTP
meYeer efJeMes<eleeSB nesleer nw~ (c) SMTP (d) TCP
Bihar STET 42 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
Ans. (c) : SMTP (Simple Mail Transfer Protocol) Skeâ 67. In XML, which attribute is used to uniquely
Ssmee vesšJeke&â Øeesšeskeâe@ue nw efpemekeâe GheÙeesie F&cesue Yespeves kesâ efueS identify an element?
XML ceW efkeâmeer SefueceWš keâes DeefÉleerÙe ™he mes henÛeeveves
efkeâÙee peelee nw~ peye Yeer Deehe efkeâmeer keâes F&cesue Yespeles nw, lees Deehekeâe
F&cesue keäueeFbš (pewmes Gmail, Outlook Deeefo) Fme Øeesšeskeâe@ue keâe kesâ efueS keâewve-mee Sefš^yÙetš GheÙeesie efkeâÙee peelee nw?
GheÙeesie keâjkesâ Deehekeâe mebosMe F&cesue meJe&j lekeâ hengBÛeelee nw~ (a) id (b) class
(c) name (d) tag
63. What does CSS stand for?
Ans. (a) : XML (Extensible Markup Language) ceW peye
CSS keâe hetCe& ™he keäÙee nw?
(a) Cascading Style System
nceW efkeâmeer Skeâ efJeMes<e SefueceWš keâes DeefÉleerÙe (Uniquely) henÛeevevee
(b) Creative Styling Script neslee nw, lees nce id Sefš^yÙetš keâe GheÙeesie keâjles nw~
(c) Computer Style Sheets • Id Skeâ Ssmee Sefš^yÙetš nw pees efkeâmeer Yeer XML SefueceWš keâes Skeâ Ùetefveš
(d) Cascading Style Sheets henÛeeve (Unique Identifier) Fmekeâe celeueye nw efkeâ Gme id keâes hetjs
Ans. (d) : CSS (Cascading Style Sheets), Ùen Skeâ XML [e@keäÙetceWš ceW efmehe&â Skeâ ner yeej Fmlesceeue efkeâÙee pee mekeâlee nQ~
mšeFefuebie ueQiJespe nw efpemekeâe GheÙeesie JesyemeeFšdme kesâ ef[peeFve Deewj 68. The Kleene Star operation accepts the
uesDeeGš keâes megvoj Deewj Deekeâ<e&keâ yeveeves kesâ efueS efkeâÙee peelee nw~ following string of finite length over set A = {0,
1ue │where string s contains even number of 0
64. Which library simplifies Java Script tasks like
and 1.
HTML document traversal and manipulation?
efvecve ceW mes keâewve-meer ueeFyeÇsjer JavaScript keâeÙeeX pewmes efkeäueerveer mšej Dee@hejsMeve Gme finite uebyeeF& keâer efmš^bie
HTML [e@keäÙetceWš š^wkeme&ue Deewj cewefveheguesMeve keâes
keâes mkeerkeâej keâjlee nw efpemeceW mesš A = {0,1ue Deewj
Deemeeve yeveeleer nw? efmš^bie ceW 0 Deewj 1 keâer mebKÙee mece (even) nes~
(a) 01, 0011,010101 (b) 0011, 11001100
(a) Java FX (b) Bootstrap
(c) ε, 0011, 11001101 (d) ε, 0011, 11001100
(c) React (d) jQuery
Ans. (d) : Kleene Star (A*) keâe celeueye nw:
Ans. (d) : JQuery Skeâ peeJee efm›eâhš ueeFyeÇsjer nw pees NTML
[e@keäÙetceWš keâes traverse (Ùeeveer {t{ves), modify (yeoueves) Deewj • A kesâ SefueceWš ces yeveer keâesF& Yeer Finite length keâer efmš^bie~
FJeWšdme keâes Handle keâjves kesâ keâece keâes Deemeeve yevee osleer nw~ • efpeveceW keâesF& Yeer mebKÙee ceW SefueceWš nes mekeâles nw (MetvÙe Yeer -
• Ùen peefšue java script keâes Deemeeve Deewj Úesšs keâes[ ceW yeoue oslee nw~ celeueye ε Yeer Meeefceue nw)
• HTML SefueceWš keâes hide/show keâjvee, slide effects, ε, 0011, 11001100
ε – 0 Zero, O One
animation Deeefo keâes Deemeeve yevee oslee nw~
0011 – O = 2, 1 = 2
65. What does AJAX stand for? 11001100 – O = 4, 1 = 4
AJAX keâe hetCe& ™he keäÙee nw? pees efmš^bime even mebKÙee ceW O Deewj jKeleer nw, Jener Kleene Star
(a) Asynchronous Java Script and XML Operation keâer Mele& keâes hetje keâjleer nw~ FmeefueS mener Gòej (D) nesiee~
(b) Automated Java Script and XHTML
69. A Language for which DFA exist is a ……
(c) Advanced Java Script and XML
(d) Asynchronous JSON and XHTML
ken Yee<ee efpemekesâ efueS DFA ceewpeto neslee nw, ken Skeâ
…… nesleer nw:
Ans. (a) : AJAX keâe hetje veece nw: Asynchronous Javascript
and XML. (a) Regular Language/efveÙeefcele Yee<ee
Ùen Skeâ lekeâveerefkeâ nw pees Jesye hespe keâes efyevee efjuees[ (refresh) efkeâÙes (b) Non-Regular Language/ iewj-efveÙeefcele Yee<ee
mejJej mes [sše Yespeves Deewj Øeehle keâjves keâer megefJeOee osleer nw~ (c) Any language/keâesF& Yeer Yee<ee
66. How does the DOM tree structure reflect the (d) Cannot be said/keâne veneR pee mekeâlee
hierarchy of HTML elements?/DOM š^er mš^keäÛej Ans. (a) : DFA keâe hetje veece nw Deterministic Finite
HTML SefueceWšdme keâer ßesCeeryeælee keâes keâwmes oMee&lee nw? Automation, Ùen Skeâ mJeÛeeefuele ceMeerve (Automation) nw Ùee
(a) In alphabetical order/keCee&veg›eâce ceW
Gmes mJeerkeâej (accept) keâjleer nw~
(b) Based on the element's size • Regular Language Jen Yee<ee nesleer nw efpemes efkeâmeer DFA,
SefueceWš kesâ Deekeâej kesâ DeeOeej hej NFA Ùee Regular Expression Éeje henÛeevee pee mekeâlee nw~
(c) In a parent-child relationship • Ùeeveer Deiej efkeâmeer Yee<ee kesâ efueS Deehe Skeâ DFA yevee mekeâles nQ,
hewjWš-ÛeeFu[ mebyebOe ceW lees Jen Regular Language nw~
(d) According to the element's color 70. Let u = '1101', v = '0001', then uv = 11010001 and
SefueceWš kesâ jbie kesâ Devegmeej vu = 00011101. Using the given information what
is the identity element for the string?
Ans. (c) : DOM (Documentj Object Model) Skeâ Tree Ùeefo u = '1101', v = '0001', lees uv = 11010001
pewmeer mebjÛevee nesleer nw efpemes š^er mš^keäÛej (Tree Structure) keânles Deewj vu = 00011101 nw~ oer ieF& peevekeâejer keâe GheÙeesie
nQ~ FmeceW HTML kesâ meejs Sefuecesvšdme Deeheme ceW Parent (cetue keâjles ngS, efmš^bie kesâ efueS DeeF[Wefššer SefueceWš keäÙee nw?
Sefuecesvš) Deewj ÛeeFu[dme (Gmekesâ Devoj kesâ SefueceWšdme) kesâ ™he ceW (a) u-1 (b) v-1
pegÌ[s nesles nQ~ (c) u-1v-1 (d) ε
Bihar STET 43 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
Ans. (d): Identity element: Jen String nesleer nw, efpemes efkeâmeer 73. If NFA of 5 states excluding the initial state is
Yeer efmš^bie kesâ meeLe peesÌ[ves (Concatenate keâjves) hej cetue String ner converted into DFA, maximum possible
number of states for the DFA is?
Jeeheme efceueleer nw~ Ùeefo efkeâmeer NFA ceW ØeejbefYekeâ mšsš keâes ÚesÌ[keâj 5
Ùeeefve Ùeefo keâes identity element e nw,lees: mšsšdme nQ, lees peye Fmes DFA ceW yeouee peeS, lees
• ue = u DeefOekeâlece efkeâleves mšsšdme mebYeke nes mekeâles nQ?
• eu = i
(a) 64 (b) 32
ε (Epsilon) Skeâ Emply String keâes oMee&lee nQ– Ùeeefve efpemeceW (c) 128 (d) 187
keâesF& Yeer Character veneR neslee~ Ans. (a) : NFA ceW kegâue States = 6 (5 + 1 intial)
U ˆI µ = "1101" • DFA ceW Maximum possible states = 2n peneb n = NFA
Ùeefo: keâer kegâue States
Î µ U = "1101"
lees oesveeW ceW U Jewmee ner jnsiee~ • lees 26 = 64
mener Gòej nw (D) Dele: efJekeâuhe (A) mener nesiee~
keäÙeeWefkeâ ε (Empty String) ner Ssmee element nw efpemes pees[Ì ves hej Original 74. The class of CFG is not closed under
String veneR yeoueleer - Ùener indentity element keâer heefjYee<ee nw~ keâewve-meer efmLeefle ceW keâe@vešskeämš-Øeâer «eecej (CFG)
71. For a DFA accepting binary numbers whose
keäueespe veneR neslee?
decimal equivalent is divisible by 3, what are (a) Concatenation/mebÙeesie
all the possible remainders?/Skeâ DFA pees Gve (b) Intersection /FbšjmeskeäMeve
yeeFvejer mebKÙeeDeeW keâes mkeerkeâej keâjlee nw efpevekeâe (c) Union/ÙetefveÙeve
oMeceueke ceeve 3 mes efkeYeepÙe nes, Gmekesâ efueS meYeer (d) Repeated Concatenation/yeej-yeej mebÙeesie.
mebYeeefkele Mes<eheâue (remainders) keäÙee nes mekeâles nQ? Ans. (*) : Context-Free Grammar (CFG) keâer keäueeme kegâÚ
(a) 0 (b) 0,2 Dee@hejsMeveeW kesâ Devleie&le yevo (Closed) nesleer nw, pewmes-
(c) 0,1,2 (d) 0,1,2,3 • mebIe (Union)
Ans. (c) : peye keâesF& DFA (Deterministic Finite Automation) • mebÙeespeve (Concatenation)
yeveeles nw, pees efkeâmeer mebKÙee keâes 3 mes efJeYeepÙe henÛeevelee nes, lees DFA kesâ • yeej-yeej mebÙeespeve (Repeated Concatenation/Kleene Star)
states remainder hej DeeOeeefjle nesles nQ~ • ØeefleÛÚso (Intersection) FmeefueS; CFG keâer ßesCeer Intersection
Ùeefo efkeâmeer mebKÙee keâes 3 mes divide keâjs lees kesâJeue leerve mebYeJe Dee@hejsMeve kesâ efueS yebo veneR nesleer nw~
remainder nes mekeâles nQ: veesš– DeeÙeesie ves Fme ØeMve keâe Gòej (d) ceevee nw~
• O (Deiej hetjer lejn divide nes peeS) 75. Which among the following is not true about
• 1 (Deiej 1 remainder DeeÙes) loT?/efvecve ceW mes keâewve-mee loT (Fbšjvesš Dee@heâ efLebime)
kesâ yeejs ceW mener veneR nw?
• 2 (Deiej 2 remainder DeeS)
(a) loT uses Micro Controllers
72. Minimum Number of states require to accept loT ceeF›eâeskeâbš^esueme& keâe GheÙeesie keâjlee nw
string ends with 101.
(b) loT is fully safe
Skeâ DFA keâes yeveeves kesâ efueS vÙetvelece efkeâleves mšsšdme loT hetjer lejn megjef#ele nw
keâer DeekeMÙekeâlee nesieer pees '101' hej meceehle nesves keeueer (c) loT uses Sensors and Actuators
efmš^bie keâes mkeerkeâej keâjs? loT meWmeme& Deewj Ske䚟etSšme& keâe GheÙeesie keâjlee nw
(a) 3 (b) 2 (d) loT uses wireless technology
(c) 1 loT keeÙejuesme lekeâveerkeâ keâe GheÙeesie keâjlee nw
(d) can't be represented/Fmes oMee&Ùee veneR pee mekeâlee
Ans. (b) : IOT is fully safe: Ùen ieuele nw keäÙeeWefkeâ IOT
Ans. (*) : '101' pattern keâes hekeâÌ[ves kesâ efueS Step-by-Step ef[JeeFsmepe hetjer lejn megjef#ele veneR nesles, FveceW nwefkebâie Deewj [sše Ûeesjer
š^wkeâ keâjWies: keâe Keleje ncesMee yevee jnlee nw~
90 Start State (Deye lekeâ kegâÚ veneR efceuee Ùee 76. About loT, which among the following is not
irrelevant efceuee nw) correct?/IoT kesâ yeejs ceW efvecve ceW mes keâewve-mee keâLeve
91 henuee '1' efceuee mener veneR nw?
92 efheâj '0' efceuee (a) Light sensor is analog
93 efheâj '1' efceuee – Accepting State (keäÙeeWefkeâ ueeFš meWmej Sveeuee@ie neslee nw
String '101' hej Kelce nes jner nw) (b) microphone is a digital sensor
'101' keâes henÛeeveves kesâ efueS DFA ceW keâce mes keâce 3 States ceeF›eâesheâesve Skeâ ef[efpešue meWmej nw
ÛeeefnS–Skeâ -Skeâ keâjkesâ '1' efheâj 'O' efheâj '1' keâes š^wkeâ keâjves kesâ (c) Keyboard is a digital sensor
efueS~ Dele: efJekeâuhe (A) 3 mener nesiee~ keâeryees[& Skeâ ef[efpešue meWmej nw
(d) Push button is a digital Sensor
veesš– DeeÙeesie ves Fme ØeMve keâe Gòej (b) ceevee nw~ hegMe yešve Skeâ ef[efpešue meWmej nw
Bihar STET 44 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
Ans. (b): Microphone is a digital sensor– Ùen efJekeâuhe Ans. (a) : MISO keâe hetje veece nw: (Master in slave out) Ùen
ieuele nw~ SPI (Serial Peripheral Interface) Communication keâe efnmmee
• ceeF›eâesheâesve (Microphone) Skeâ Analog Sensor neslee nw, nw~ Fme efheve kesâ peefjS Slave device (pewmes RFID module), [sše keâes
keäÙeeWefkeâ Ùen DeeJeepe (Sound Waves) keâes Electrical Signals ceW Master device (pewmes Microcontroller) keâes Yespelee nw~
yeouelee nw, pees Confinuous nesles nQ~ 81. Who is known as the father of AI?
77. BLE stands for /BLE keâe hetCe& ™he keäÙee nw? AI (ke=âef$ece yegefæceòee) kesâ pevekeâ keâewve ceeves peeles nQ?
(a) Bluetooth large energy/yuetštLe ueepe& Svepeer& (a) Fisher Ada/efheâMej S[e
(b) Bluetooth low energyyuetštLe uees Svepeer& (b) Alan Turing/Sueve šŸetefjbie
(c) Bluetooth light energy/yuetštLe ueeFš Svepeer& (c) John McCarthy/pee@ve cewkeâeLeer&
(d) Bluetooth long energy/uetštLe uee@vie Svepeer& (d) Allen Newell/Suesve vÙetkesue
Ans. (b) : BLE keâe celeueye neslee nw (Bluetooth Low Ans. (c) : 'John Mcarthy' keâes AI (Artificial Intelligence)
Energy) Ùen Skeâ JeeÙejuesme lekeâveerkeâ nw pees keâce efyepeueer keâer Kehele keâe pevekeâ keâne peelee nw~ FvneWves 1956 F&. ceW 'Dartmouth
keâjleer nw Deewj IOT ef[JeeFmespe ceW GheÙeesie nesleer nw~ Conference' keâe DeeÙeespeve efkeâÙee Lee, peneB 'Artificial
78. WSN stands for?/WSN keâe hetCe& ™he keäÙee nw? Infelligence' Meyo keâe henueer yeej GheÙeesie efkeâÙee ieÙee~
(a) Wireless Standard Protocol 82. Programming language commonly used for AI
keeÙejuesme mšQ[[& Øeesšeskeâe@ue is …….?/AI kesâ efueS meeceevÙeleŠ GheÙeesie keâer peeves
(b) Wireless Sensor Protocol keeueer Øees«eeefcebie Yee<ee keâewve-meer nw?
keeÙejuesme meWmej vesškeke&â (a) Lisp (b) Perl
(c) Wireless Serial Protocol (c) Prolog (d) C++
keeÙejuesme meerefjÙeue Øeesšeskeâe@ue Ans. (a) : Lisp (LIST Processing) keâes 1958 ceW 'John
(d) Wireless Single Protocol Maccarthy' ves efJekeâefmele efkeâÙee Lee - pees AI kesâ pevekeâ ceeves peeles nw~
keeÙejuesme efmebieue Øeesšeskeâe@ue • Ùen AI kesâ efueS yeveeF& ieÙeer ogefveÙee keâer henueer Øees«eeefcebie Yee<eeDeeW ceW
Ans. (*) : Wireless Sensor Network (WSN) Skeâ Ssmee vesšJeke&â mes Skeâ nw~
neslee nw efpemeceW keâF& Úesšs-Úesšs Sensor JeeÙejuesme lejerkesâ mes Skeâ-otmejs mes 83. The algorithm used in the Game tree to make
peg[Ì keâj [sše Fkeâªe keâjles nw, Deewj Deeies Yespeles nQ~ Fmes IOT, mceeš& decisions of Win/Lose is ………….?
Kesleer, nsuLe cee@efvešefjbie, Deewj efceefueš^er ceW GheÙeesie efkeâÙee peelee nw~ iesce š^er ceW peerle/nej kesâ efveCe&Ùe kesâ efueS keâewve-mee
veesš– DeeÙeesie ves Fme ØeMve keâe Gòej (b) ceevee nw~ Suieesefjoce GheÙeesie neslee nw?
79. A complex SCADA system has …. levels? (a) Heuristic Search Algorithm
Skeâ peefšue SCADA ØeCeeueer ceW efkeâleves mlej nesles nQ? nerÙetefjefmškeâ meÛe& Suieesefjoce
(a) 6 (b) 5 (b) DFS/BFL algorithm/DFS/BFS Suieesefjoce
(c) 3 (d) 4
(c) Greedy Search algorithm/ «eer[er meÛe& Suieesefjoce
Ans. (d) : SCADA (Super visory control & Data
Acquisition) efmemšce kesâ 4 cegKÙe mlej nesles nQ: (d) Min/Max algorithm/efceve/cewkeäme Suieesefjoce
(1) Field Level:– FmeceW Sensor Deewj Actuators nesles nQ, pees Ans. (d) : Min/Max Algorithm keâe GheÙeesie oes-efKeueeefÌ[ÙeeW
[sše Fkeâªe keâjles nQ~ Jeeues iescme (pewmes Chess, Tic-Tac-Toe) ceW efkeâÙee peelee nw~
(2) PLC/RTU Level:– PLC/RTU [sše keâes Øeesmesme keâjles nw • Ùen Skeâ efKeueeÌ[er keâer peerJe keâes DeefOekeâlece (Maximize) keâjves
Deewj Field ef[JeeFmespe keâes keâvš^esue keâjles nQ~ Deewj efJejesOeer peerle keâes (Minimize) keâjves keâer keâesefMeMe keâjlee nw~
(3) Super visory Level (SCADA software):– ÙeneB hej • Game Tree ceW meYeer mebYeeefJele ÛeeueeW keâes osKekeâj efveCe&Ùe efueÙee
[sše Monitor Deewj Control efkeâÙee peelee nw~ peelee nw~
(4) Enterprise Level:– Ùen uesJeue data analysis reporting 84. Uniform-cost search expands the node n with
Deewj Decision making kesâ efueS neslee nw~ the ………/ÙetefveÌHeâe@ce&-keâe@mš meÛe& Gme vees[ keâes
80. What is the role of the MISO pin in the RFID efkemleeefjle keâjlee nw efpemekeâe ……… neslee nw:
Module? (a) Lowest path cost/meyemes keâce heLe ueeiele
RFID cee@[Ÿetue ceW MISO efheve keâer Yetefcekeâe keäÙee nw? (b) Heuristic cost/Devegceeveer ueeiele
(a) Master In Slave Out (c) Highest path cost/meyemes DeefOekeâ heLe ueeiele
ceemšj Fve mueske DeeGš (d) Average path cost/Deewmele heLe ueeiele
(b) Manage Internal Slave Output
Ans. (a) : Uniform - Cost Search ncesMee Gme node keâes
cewvespe Fbšjveue mueske DeeGšhegš
(c) Master Internal Search Optimization Ûeg velee nw efpemekeâe path cost (Ùeeefve Deye lekeâ keâe kegâue KeÛee&) meyemes
ceemšj Fbšjveue meÛe& Dee@efhšceeFpesMeve keâce neslee nw~
(d) Manage Input Slave Op • Ùen Skeâ Øekeâej keâe Best Friend Search nw uesefkeâve Heuristic
cewvespe Fvehegš mueske Dee@hejsMeve keâe GheÙeesie veneR keâjlee~
Bihar STET 45 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
85. The process of removing detail from a given 89. What is the process in which a buyer posts its
state representation is called……. interest in buying a certain quantity of items,
efkeâmeer efmLeefle kesâ efve™heCe (representation) mes and sellers compete for the business by
efkekejCe nševes keâer Øeef›eâÙee keâes keäÙee keâne peelee nw? submitting successively lower bids until there is
only one seller left?/ken Øeef›eâÙee efpemeceW Skeâ Kejeroej
(a) Extraction/Skeämeš^wkeäMeve
kegâÚ kemlegDeeW keâes Kejeroves ceW ®efÛe efoKeelee nw Deewj
(b) Abstraction/Symš^wkeäMeve
efke›eâslee Skeâ-otmejs mes ØeeflemheOee& keâjles ngS keâce mes keâce
(c) Data Mining/[sše ceeFefvebie
yeesueer ueieeles nQ peye lekeâ efkeâ Skeâ ner efke›eâslee ve jn
(d) Information Retrieval/metÛevee hegveŠØeeefhle
peeS, Gmes keäÙee keâne peelee nw?
Ans. (b) : Abstraction keâe celeueye neslee nw- efkeâmeer Ûeerpe keâer (a) B2B Marketplace/B2B ceeke&âsšhuesme
kesâJeue DeeJeMÙekeâ peevekeâejer keâes jKevee Deewj yeekeâer DeveeJeMÙekeâ (b) Auction/veerueeceer
efJeJejCe keâes nše osvee~ (c) Reverse Auction/efjkeme& veerueeceer
• Ùen Øeef›eâÙee efmemšce keâes mejue Deewj mecePeves ceW Deemeeve yeveeleer nw~ (d) Intranet/Fbš^evesš
86. What does a first order predicate logic contain?
Ans. (c) : meeceevÙe veerueeceer (Auction) ceW Kejeroej pÙeeoe yeesueer
heâmš& Dee@[&j Øesef[kesâš uee@efpekeâ ceW keäÙee Meeefceue neslee nw?
ueieelee nw~
(a) Predicate and a subject/ Øesef[kesâš Deewj meypeskeäš
uesefkeâve Reverse Auction ceW efJe›esâlee Skeâ-otmejs mes keâce keâercele keâes
(b) Predicate and a Preposition
Øesef[kesâš Deewj ØeheespeerMeve yeesueer ueieeleskeâ nQ leeefkeâ Kejeroej GvnW Ûegves~
(c) Subject and an object/ meypeskeäš Deewj Dee@ypeskeäš
Ùen lejerkeâe Deeceleewj hej B2B (Business to Business E-
Commerce) ceW ØeÙeesie neslee nw~
(d) None of the above/ Ghejesòeâ ceW mes keâesF& veneR
90. If it is easy for competitors to enter the market,
Ans. (a) : First Order Predicate Logic (FOPL) ceW efkeâmeer the threat of new entrants is considered:
keâLeve keâes JÙeòeâ keâjves kesâ efueS Predicate (ef›eâÙee) Deewj Subject Ùeefo ØeefleÙeesefieÙeeW kesâ efueS yeepeej ceW ØekesMe keâjvee
(efJe<eÙe) keâe ØeÙeesie neslee nw~ Deemeeve nw, lees veS ØekesMekeâeW keâe Keleje efkeâme mlej keâe
• GoenjCe: Loves (John, Mary) ceevee peeSiee?
ÙeneB Loves = Predicate (a) Low/keâce (b) High/GÛÛe
John = Subject (Deewj mary = object) (c) Moderate/ceOÙece (d) Negligible/veieCÙe
87. Which of the following can improve the Ans. (b) : Ùeefo efkeâmeer yeepeej ceW ØeJesMe keâjvee Deemeeve neslee nw pewmes
performance of AI agent?/efvecve ceW mes keâewve-mee AI efkeâ keâce hetBpeer keâer DeeJeMÙekeâlee nes, yengle DeefOekeâ efveÙece keâevetve ves
SpeWš kesâ ØeoMe&ve keâes yesnlej keâj mekeâlee nw? neW, Deewj henÛeeve yeveevee Deemeeve nes lees veS ØeefleÙeesefieÙeeW kesâ Deeves keâer
(a) Precision/mešerkeâlee (b) Learning/meerKevee mebYeeJevee DeefOekeâ nesleer nw~ FmeefueS Ssmes ceeceueeW ceW veS ØeJesMekeâeW keâe
(c) Observing/efvejer#eCe keâjvee Keleje DeefOekeâ neslee nw~
(d) All of the above/Ghejesòeâ meYeer 91. Which of the following refers to creating
Ans. (*) : AI SpeWš keâer keâeÙe&#ecelee (Performance) keâes yesnlej products tailored to individual customers?
yeveeves ceW efvecveefueefKele meYeer keâe Ùeesieoeve neslee nw: Ssmes Glheeo yeveevee pees kÙeefòeâiele «eenkeâeW kesâ Devegmeej
• Precision (mešerkeâlee) neW, keâes keäÙee keânles nQ?
• Learning (meerKevee) (a) Customization/keâmšceeFÌpesMeve
• Observing (DeJeueeskeâve) (b) Adaptation/S[ehšsMeve
veesš– DeeÙeesie ves Fme ØeMve keâe Gòej (b) ceevee nw~ (c) Direct material/[eÙejskeäš cešsefjÙeue
88. Which of the following is part of the four main (d) Auction/veerueeceer
types for e-commerce?/efvecve ceW mes keâewve-mee F&- Ans. (a) : peye efkeâmeer Glheeo keâes efJeMes<e ™he mes efkeâmeer Skeâ «eenkeâ
keâe@ceme& kesâ Ûeej cegKÙe ØekeâejeW ceW Meeefceue nw? keâer pe™jleeW Deewj hemebo kesâ Devegmeej yeveeÙee peelee nw, lees Fmes
(a) B2B (b) B2C keâmšceeFpes M eve (Customization) keânles nQ~
(c) C2B 92. Which form of e‐marketplace brings together
(d) All of the above/Ghejesòeâ meYeer buyers and sellers from the same industry?
Ans. (d) : E-Commerce kesâ Ûeej cegKÙe Øekeâej nesles nw: keâewve-mee F&-ceeke&âsšhuesme Øekeâej Skeâ ner GÅeesie kesâ
(1) B2B (Business to Business):– keâcheefveÙeeW kesâ yeerÛe uesve-osve KejeroejeW Deewj efke›eâsleeDeeW keâes Skeâ meeLe ueelee nw?
(2) B2C (Business to Consumer):– keâcheefveÙeeW mes «eenkeâeW kesâ (a) Horizontal/ne@efjÌpee@všue (b) Vertical/keefš&keâue
yeerÛe efye›eâer~ (c) integrated/Fbšer«esšs[ (d) isolated/DeeFmeesuesšs[
(3) C2B (Consumer to Consumer):– «eenkeâ JÙeJemeeÙe keâes Ans. (b) : Jeefš&keâue ceekexâšhuesme (Vertical Marketplace) Jen
mesJee Ùee Øees[keäš osles nw~ neslee nw, pees efkeâmeer efJeMes<e GÅeesie Ùee #es$e kesâ KejeroejeW Deewj efJe›esâleeDeeW
(4) C2C (Consumer to Consumer):– «eenkeâ Deeheme ceW JÙeeheej keâes Skeâ meeLe ueelee nw, pewmes kesâJeue nsuLekesâÙej, Dee@šesceesyeeFue Ùee
keâjles nQ (pewmes OLX) ke=âef<e GÅeesie kesâ efueS~
Bihar STET 46 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
93. Which of the following is done by Secure 97. In Audio and Video Compression, voice is
Sockets Layers? sampled at 8000 samples per second
efmekeäÙeesj mee@kesâš uesÙej (SSL) keäÙee keâjlee nw? with………/Dee@ef[Ùees Deewj keeref[Ùees mebheerÌ[ve ceW, kee@Ùeme
(a) creates a secure, private connection to a web keâes 8000 meQheue Øeefle meskeâb[ hej meQheue efkeâÙee peelee nw,
server/Skeâ megjef#ele, efvepeer keâveskeäMeve yeveelee nw
(b) Encrypts information
ØelÙeskeâ meQheue ceW ………… nesles nQ:
metÛevee keâes Sefv›eâhš keâjlee nw (a) 8 bits per sample/8 efyešdme
(c) Sends information over the internet (b) 5 bits per sample/5 efyešdme
Fbšjvesš hej peevekeâejer Yespelee nw (c) 7 bits per sample/7 efyešdme
(d) All of the above/Ghejesòeâ meYeer (d) 6 bits per sample/6 efyešdme
Ans. (d) : SSL (Secvre Socket Layer) Skeâ lekeâveerefkeâ nw pees Ans. (a) : DeeJeepe keâes ef[efpešue ™he mes mšesj Deewj š^ebmeefceš keâjves
Jesye meJe&j mes Skeâ megjef#ele Deewj efvepeer keâveskeäMeve yeveeleer nw, peevekeâejer
kesâ efueS, Deeceleewj hej Gmes 8000 meQheue Øeefle meskesâC[ Deewj 8 efyešdme
keâes Sefv›eâhš (ieghle) jKeleer nw~ Deewj Gmes Fbšjvesš hej megjef#ele ™he mes
Yespeleer nw~ FmeefueS mener Gòej nw – Ghejesòeâ meYeer Øeefle meQheue keâer oj mes meQheue efkeâÙee peelee nw~
94. The delay that occur during the playback of a Ùen lejerkeâe PCM (Pulse Code Modulation) ceW GheÙeesie efkeâÙee
stream is called ___________./efkeâmeer mš^erce kesâ peelee nw, pees šsueerheâesve Dee@ef[ÙeeW kesâ efueS ceevekeâ nw~
huesyewkeâ kesâ oewjeve pees osjer nesleer nw, Gmes keäÙee keânles nQ? 98. Audio compression can be used for ………..
(a) Stream delay/mš^erce ef[ues Dee@ef[Ùees mebheerÌ[ve keâe GheÙeesie efkeâmekesâ efueS efkeâÙee pee
(b) Playback delay/huesyewkeâ ef[ues mekeâlee nw?
(c) Jitter/efpešj (a) voice and data/DeekeeÌpe Deewj [sše
(d) Event delay/FkeWš ef[ues
(b) video and voice/keeref[Ùees Deewj DeekeeÌpe
Ans. (c) : peye mš^erefcebie kesâ oewjeve Dee@ef[ÙeeW Ùee Jeeref[Ùees [sše mener
(c) speech or music/Yee<eCe Ùee mebieerle
meceÙe hej veneR hengBÛelee nw, efpememes ™keâeJeš Ùee osjer nesleer nw, lees meF
(d) picture and colors/efÛe$e Deewj jbie
osjer keâes efpešj (Jitter) keâne peelee nw~ Ùen vesšJeke&â kesâ
DeefveÙeefceleleeDeeW kesâ keâejCe neslee nw~ Ans. (c) : Dee@ef[Ùees kebâØesMeve keâe GösMÙe OJeefve [sše (pewmes yeesueves keâer
95. In teardown state of real time streaming DeeJeepe Ùee mebieerle) kesâ Deekeâej keâes keâce keâjvee neslee nw, leeefkeâ Gmes
protocol is ………../fjÙeue šeFce mš^erefcebie Øeesšeskeâe@ue keâce yeQ[efJe[dLe ceW š^ebmeefceš efkeâÙee pee mekesâ Ùee mšesjspe ceW keâce meceÙe
keâer 'Teardown' efmLeefle ceW keäÙee neslee nw? ues~ FmeefueS mener Gòej nw–mheerÛe Ùee cÙetefpekeâ
(a) the server resources for client 99. Each ___ represents a particular colour.
meke&j keäueeFbš kesâ efueS mebmeeOeve cegòeâ keâjlee nw ØelÙeskeâ _____ Skeâ efkeMes<e jbie keâes oMee&lee nw~
(b) server delivers the stream to client
meke&j keäueeFbš keâes mš^erce Yespelee nw (a) Frame/Øeâsce
(c) server suspends delivery of stream (b) Character/keâwjskeäšj
meke&j mš^erce ef[ueerkejer keâes efveuebefyele keâjlee nw (c) Pixel value/efhekeämesue kewuÙet
(d) server breaks down the connection (d) None of the above/Ghejesòeâ ceW mes keâesF& veneR
meke&j keâveskeäMeve leesÌ[ oslee nw Ans. (c) : ØelÙeskeâ efhekeämeue JewuÙet (Pixel Value) Skeâ efJeMes<e jbie
Ans. (d) : Teardown efmLeefle ceW, meJe&j Deewj keâueebFš kesâ yeerÛe pees keâes oMee&leer nw~ efhekeämeue (Pixel) Fcespe Ùee Jeeref[Ùee keâe meyemes Úesše
mš^erefcebie (Streaming) mes pegÌ[e keâveskeäMeve neslee nw, Gmes meceehle Yeeie neslee nw, Deewj Gmekeâer JewuÙet Ùen leÙe keâjleer nw efkeâ Jen efkeâme jbie
(Terminate) keâj efoÙee peelee nw~
ceW efoKeeÙeer osiee~
Fmekeâe celeueye nw efkeâ meJe&j meYeer mš^erefcebie mebmeeOeveeW keâes øeâer keâjlee nw
Deewj keâveskeäMeve keâes yebo keâj oslee nw~ 100. ………….. is basically a form of pictorial
presentation./…………… cetue ™he mes Skeâ
96. In Real Time Interactive Audio Video, Jitter is
introduced in real-time data by delay between… ef Ûe$eelcekeâ Øemlegefle keâe ™he nw~
/efjÙeue šeFce FbšjSefkeäške Dee@ef[Ùees keeref[Ùees ceW efpešj (a) Photography/heâesšes«eeheâer
efkeâmekesâ yeerÛe keâer osjer mes GlheVe neslee nw? (b) Animations/SefvecesMeve
(a) pixels/efhekeämeume (b) layers/uesÙeme& (c) Drawing/[^eFbie
(c) frames/Øeâscme (d) packets/hewkesâšdme (d) Creativity/ef›eâSefšefkešer
Ans. (d) : efpešj (Jitter) Gme efmLeefle keâes keânles nw peye vesšJeke&â
Ans. (b) : "Animation" keâe leelheÙe& efmLej efÛe$eeW keâer Skeâ ëe=bKeuee
hewkesâšdme ([sše kesâ Úesšs-Úesšs efnmmes) Skeâ ner ›eâce ceW Deewj Skeâ meceeve
meceÙe hej veneR hengBÛeles~ peye hewkesâš kesâ yeerÛe osjer nesleer nw lees Fmes keâes lespeer mes ØeoefMe&le keâjkesâ ieefleMeerue ÚefJeÙeeW kesâ efvecee&Ce mes nw~ Ùen
efpešj (Jitter) GlheVe neslee nw, efpememes efjÙeue šeFce Dee@ef[Ùees Ùee cetuele: ef$e$eelcekeâ Øemlegefle keâe Skeâ ™he nw, peneB ieefle keâe Yeüce hewoe
efJeef[Ùees ceW ™keâeJeš Ùee ieÌ[yeÌ[er Dee mekeâleer nw~ keâjves kesâ efueS Deueie-Deueie ÚefJeÙeeW keâes mebÙeesefpele efkeâÙee peelee nw~
Bihar STET 47 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
 efyenej efJeÅeeueÙe hejer#ee meefceefle
ceeOÙeefcekeâ efMe#ekeâ hee$elee hejer#ee Bihar STET
keâchÙetšj
[Exam. Date - 12.09.2023 (Shift-II)]
1. Consider two binary numbers A = 110001 and Ans. (a) : Skeâ oMeceueJe Debkeâ (0 mes 9) keâes yeeFvejer Ùee «es keâes[
B = 001100. What is the result of (A AND B) ceW ØeoefMe&le keâjves kesâ efueS 4 efyešdme heÙee&hle nesles nQ~
OR (NOT A AND NOT B)?
GoenjCe–
oes yeeFvejer mebKÙeeDeeW hej efJeÛeej keâjW:
A = 110001 Deewj B = 001100 (A AND B) OR «es keâes[ ceW '0' = 0000
(NOT A AND NOT B) keâe heefjCeece keäÙee nesiee? «es keâes[ ceW '1' = 0001
(a) 000000 (b) 110001 «es keâes[ ceW '9' = 1101
(c) 001100 (d) 111101 4.
What is the minimized expression for the
Ans. (*) : efoÙee ieÙee nw: Boolean function F(A, B, C, D) = Σ(0, 1, 2, 4, 5,
A = 110001 6, 10, 12, 13) using the K-map method?
B = 001100 yetefueÙeve Heâueve F(A, B, C, D) = (0, 1, 2, 4, 5, 6,
Step (I)– (A AND B) 10, 12, 13) keâe K-map efJeefOe keâe GheÙeesie keâjkesâ
110001 AND 001100 mejueerke=âle (Minimized) ™he keäÙee nessiee?
000000 (a) A'B'C'D' + A'B'C'D + A'B'CD + A'BC'D +
Step (II)– (NOT A AND NOT B) A'B'C'D' + A'BCD
NOT A (110001) AND NOT B (001100) (b) A'B'C'D' + A'B'C'D + A'B'CD + A'BC'D +
001110 AND 110011 A'B'C'D' + A'BC'D
000010 (c) A'B'C'D' + A'B'C'D + A'B'CD + A'BC'D +
Step (III)– (A AND B) OR (NOT A AND NOT B) A'B'C'D' + A'BC'D'
000000 OR 000010 (d) A'B'C'D' + A'B'C'D + A'B'CD + A'BC'D +
000010 A'B'C'D' + A'BCD
Dele: Final Gòej 000010 nesiee~ Ans. (*) : K-map efJeefOe keâe GheÙeesie keâjkesâ yetefueÙeve HebâkeäMeve
veesš– DeeÙeesie ves Fme ØeMve keâe Gòej (a) ceevee nw~ F(A, B, C, D) = (0, 1, 2, 4, 5, 6, 10, 12, 13) kesâ efueS
vÙetvelece JÙebpekeâ (Minimized Expression) %eele keâjves kesâ efueS,
2. Which of the following is a self-complementing
binary code, where adjacent codes differ in nces Skeâ 4-Ûej K-map yeveevee nesiee Deewj efoÙes ieÙes Minterms (0,
only one bit position? 1, 2, 4, 5, 6, 10, 12, 13) keâes 1's mes Yejvee nesiee~ efHeâj, nceW
efvecveefueefKele ceW mes keâewve mee Skeâ mJeÙeb hetjkeâ (Self- meyemes yeÌ[s mebYeJe mecetn (Pairs, quads, octets) yeveeves neWies~
Complementing) yeeFvejer keâes[ nw, peneB meefVekeâš ÙeneB K-map Deewj mecetnve (Grouping) keâer Øeef›eâÙee nw: meyemes henues
keâes[ kesâJeue Skeâ efyeš heespeerMeve ceW efYeVe nesles nw? K-map yeveeÙes Deewj 1's nes Gvekesâ mebyebefOele mLeeveeW hej jKes:
(a) BCD (b) ASCII
(c) Gray Code (d) EBCDIC
Ans. (c) : Gray Code («es keâes[) Ssmee yeeFvejer keâes[ nw efpemeceW
ØelÙeskeâ ueieeleej ceeve (Adjacent Value) kesâJeue Skeâ efyeš yeouelee
nw~ Fmes Unit Distance Code Yeer keâne peelee nw, Deewj Fmekeâe
ØeÙeesie Sjj keâce keâjves kesâ efueS ef[efpešue meefke&âšdme ceW efkeâÙee peelee nw~
3. How many bits are used to represent a single
decimal digit in Gray Code?
«es-keâes[ ceW Skeâ oMeceueJe Debkeâ keâes ØeoefMe&le keâjves kesâ (0, 1, 2, 4, 5, 6, 10, 12, 13)
efueS efkeâleves efyešdme keâe GheÙeesie efkeâÙee peelee nw? G 1 , G2, G3, G4 meYeer Groups keâes efceueves hej:-
(a) 4 bits (b) 8 bits A'C' + A'D' + ABC' + B'CD' Øeehle nesiee~
(c) 16 bits (d) 10 bits vees š – DeeÙeesie ves Fme ØeMve keâe Gòej (b) ceevee nw~
Bihar STET 48 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
5. A binary-to-gray code converter is an example (a) A type of microcontroller with high
of:/Skeâ yeeFvejer-št-iesÇ keâes[ keâveJeš&j Svekeâes[j keâe Skeâ processing speed/Skeâ Øekeâej keâe ceeF›eâeskeâbš^esuej
GoenjCe nw– efpemekeâer Øeesmesefmebie mheer[ DeefOekeâ nesleer nw
(a) Encoder (b) Decoder (b) A microcontroller architecture that uses a
(c) Comparator (d) Multiplexer separate memory space for instructions and data/
Ans. (a) : Svekeâes[j (Encoder)– Skeâ Svekeâes[j Skeâ ef[efpešue Skeâ ceeF›eâeskeâbš^esuej Deeefke&âšskeäÛej pees efveo&sMeeW Deewj [sše
meefke&âš nw pees Fvehegš kesâ Skeâ mesš keâes Skeâ keâesef[le DeeGšhegš ceW kesâ efueS Deueie-Deueie cesceesjer mhesme keâe GheÙeesie keâjlee nw
heefjJeefle&le keâjlee nw~ yeeFvejer-št-«es keâes[ keâveJeš&j Skeâ yeeFvejer Fvehegš (c) A microcontroller with advanced addressing
modes/Skeâ ceeF›eâeskeâbš^esuej efpemeceW GVele S[^sefmebie cees[
ueslee nw Deewj Gmes «es keâes[ ceW yeoue oslee nw, pees Skeâ Deueie Øekeâej
keâe keâes[ nw~ nesles nQ
(d) A microcontroller with a large number of I/O
6. Which statement accurately describes a ports/Skeâ ceeF›eâeskeâbš^esuej efpemeceW Fvehegš/DeeGšhegš
Programmable Logic Device (PLD)?
efvecve ceW mes keâewve mee keâLeve Skeâ Øees«eecesyeue uee@efpekeâ heesšdme& keâer mebKÙee DeefOekeâ nesleer nw
ef[JeeFme (PLD) keâe mešerkeâ ™he mes JeCe&ve keâjlee nw? Ans. (b) : neJe&[& Deeefke&âšskeäÛej Skeâ Ssmee ceeF›eâeskebâš^esuej Dee@ekf e&âšskeäÛej
(a) PLDs can only be programmed once and neslee nw efpemeceW efveoxMe (Instructions) Deewj [sše kesâ efueS Deueie-Deueie
cannot be reconfigured. cesceesjer mhesme nesles nQ~ Fmekeâe celeueye nw efkeâ efveoxMe Deewj [sše Skeâ ner meceÙe
PLDs keâes kesâJeue Skeâ yeej Øees«eece efkeâÙee pee mekeâlee nw hej Deueie-Deueie yemeeW (Buses) kesâ ceeOÙece mes Skeämesme efkeâÙes pee mekeâles
Deewj hegve: keâe@efvHeâiej veneR efkeâÙee pee mekeâlee~ nQ, efpememes Øeesmesefmebie mheer[ yesnlej nesleer nw~
(b) PLDs are used exclusively for memory 9. What is the primary purpose of using Don't
storage in digital circuits. Care conditions in Karnaugh Map
PLDs keâe GheÙeesie kesâJeue ef[efpešue meefke&âš ceW cesceesjer simplification?/keâveexHeâ cewhe mejueerkeâjCe ceW '[eWš
mšesjspe kesâ efueS efkeâÙee peelee nw~ kesâÙej' efmLeefleÙeeW keâe cegKÙe GösMÙe keäÙee nw?
(c) PLDs allow for both input and output (a) To mark cells that should not be included in
programming to implement custom logic the simplification process/Gve keâesefMekeâeDeeW keâes
functions./ PLDs Fvegheš Deewj DeeGšhegš Øees«eeefcebie efÛeefÖle keâjvee efpevnW mejueerkeâjCe Øeef›eâÙee ceW Meeefceue veneR
oesveeW keâer Devegceefle osles nQ, leeefkeâ keâmšce uee@efpekeâ efkeâÙee peevee ÛeeefnS
HebâkeäMevme keâes ueeiet efkeâÙee pee mekesâ~ (b) To indicate cells that have an undefined logic
(d) PLDs consist of only AND gates and do not value/Gve keâesefMekeâeDeeW keâes Fbefiele keâjvee efpevekeâe uee@efpekeâ
include OR gates./ PLDs ceW kesâJeue AND iesšme ceeve DeefveefMÛele nw
nesles nQ Deewj OR iesšdme Meeefceue veneR nesles nwb~ (c) To identify cells that are already in their
Ans. (c) : Programmable Logic Devices (PLDs) pewmes simplest form/Gve keâesefMekeâeDeeW keâer henÛeeve keâjvee pees
Fueskeäš^e@efvekeâ Ieškeâ nesles nQ efpevnW GheÙeesiekeâlee& Éeje Deheveer henues mes ner Deheves meyemes mejue ™he ceW nQ
DeeJeMÙekeâleeDeebs kesâ Devegmeej Øees«eece efkeâÙee pee mekeâlee nw leeefkeâ efJeMes<e (d) To mark cells with special logic functions
uee@efpekeâ HebâkeäMeve keâes ef›eâÙeeefvJele efkeâÙee pee mekesâ~ FveceW Fvehegš, efkeMes<e uee@efpekeâ HÌ eâbkeäMeveeW keeueer keâeseMf ekeâeDeeW keâes efÛeefÖle
DeeGšhegš Deewj uee@efpekeâ keâes Øees«eece keâjves keâer #ecelee nesleer nw~ keâjvee
7. Which of the following applications is a typical Ans. (a) : Karnaugh Map (K-map) ceW "Don't care" kebâ[erMebme
use of microcontrollers in the field of home keâe cegKÙe GösMÙe Gve Cells keâes oMee&vee neslee nw efpevekeâe uee@epf ekeâ ceeve
automation?/Iejsuet mJeÛeeueve (nesce Dee@šescesMeve) kesâ efveOee&efjle veneR neslee nw Ùeeveer Undefined neslee nw~ Fve "Don't Care"
#es$e ceW ceeF›eâeskebâš^eus ej keâe Skeâ efJeefMe° GheÙeesie efmLeefleÙeeW keâes 0 Ùee 1 efkeâmeer Yeer ™he ceW ceevee pee mekeâlee nw- pewmee efkeâ
efvecveefueefKele ceW mes keâewve mee nw? mecetnerkeâjCe (Simplification) ceW ceoo keâjs~ Fmemes Boolean meceerkeâjCe
(a) Satellite communication/mewšsueeFš mebÛeej keâes mejuelece ™he ceW yeouee pee mekeâlee nw~
(b) Air traffic control/nJeeF& ÙeeleeÙeele efveÙeb$eCe 10. De Morgan's First Theorem states that the
(c) Temperature and lighting control complement of a ___________ of variables is
leeheceeve Deewj ØekeâeMe efveÙeb$eCe equal to the ___________ of their individual
(d) Space exploration/Debleefj#e DevJes<eCe complements./[er cee@ie&ve keâe henuee ØecesÙe keäÙee keânlee
Ans. (c) : ceeF›eâeskebâš^esuej Úesšs, mJeefveefnle kebâhÙetšj nesles nQ efpevnW
nw : Ûej kesâ ________keâe hetjkeâ Gvekesâ kÙeefòeâiele hetjkeâeW
efJeefMe° keâeÙeex keâes keâjves kesâ efueS ef[peeFve efkeâÙee peelee nw~ Iejsuet kes â ________ kesâ yejeyej neslee nw~
mJeeÛeeueve ceW, Gvekeâe GheÙeesie Dekeämej efJeefYeVe GhekeâjCeeW Deewj (a) AND, OR (b) OR, AND
(c) NAND, NOR (d) NOR, NAND
ØeCeeefueÙeeW keâes efveÙebef$ele keâjves kesâ efueS efkeâÙee peelee nw~
Ans. (b) : ef[. cee@ie&ve (De. Morgan's First Theorem) keâe
8. What does the term "harvard architecture"
refer to in the context of microcontrollers? henuee ØecesÙe efkeâmeer OR Dee@hejsMeve kesâ hetjkeâ (Complement) keâe
ceeF›eâeskeâbš^esueme& kesâ meboYe& ceW 'neke&[& Deeefke&âšskeäÛej' Meyo heef j Ceece, ØelÙeskeâ Fvehegš keâe hetjkeâ ueskeâj Gvns AND keâjves kesâ yejeyej
keâe keäÙee DeLe& nw? neslee nw~
Bihar STET 49 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
Ùeeefve:- Ùen keäuee@keâ efmeiveue CPU Deewj DevÙe IeškeâeW keâes efveoxefMele keâjlee nw
A B A B efkeâ keâye keâewve-meer ef›eâÙee keâjveer nw~
FmeefueS mener efJekeâuhe nw (b) OR. AND 14. What is the worst-case time complexity of
(OR Dee@hejsMeve keâe hetjkeâ · meYeer Fvehegš kesâ hetjkeâ keâe AND) Binary Search for an array of size "n"?
'n' Deekeâej kesâ Ssjs kesâ efueS yeeFvejer meÛe& keâer meyemes
11. The hexadecimal number F4 is equivalent to
which binary number? Kejeye efmLeefle ceW meceÙe peefšuelee keäÙee nesleer nw?
nskeämee[smeerceue mebKÙee F4 efkeâme yeeFvejer mebKÙee kesâ (a) O(log n) (b) O(n)
mecekeâ#e nw? (c) O(n log n) (d) O(1)
(a) 11111001 (b) 11110100 Ans. (a) : yeeFvejer meÛe& (Binary Search) Suieesefjoce Skeâ meešx[
(c) 11111100 (d) 11111010 (Sorted) Ssjs hej keâeÙe& keâjlee nw Deewj nj ÛejCe ceW Keespe keâer ieF&
Ans. (b) : meercee keâes DeeOee keâj oslee nQ FmeefueS peye Yeer nce efkeâmeer lelJe keâes
{tb{les nw, leye nce mebYeeJeveeDeeW keâes ueieeleej DeeOee keâjles peeles nw~ leLee
Fme Øeef›eâÙee ceW DeefOekeâlece leguevee keâer mebKÙee nesieer, log2n~ Dele:
yeeFvejer meÛe& (Search Tree) keâe Worst - Case Time
Complexity = 0(log n).
15. The minimum number of edges in a spanning
tree of a connected graph with "n" vertices is:
'n' Meer<eeX keeues Skeâ mebÙeesefpele «eeheâ kesâ mhewevf ebie š^er ceW
Dele: oesvees keâes Deeheme ceW efceueeves hej (F4) keâer yeeFvejer mebKÙee
vÙetvelece efkeâleveer OeejeSB (edges) nesleer nQ?
11110100 nesieer~
(a) n (b) n – 1
12. When converting a binary number to Gray (c) n + 1 (d) n(n–1)/2
Code, what is the result of XORing the most
significant bit (MSB) of the binary number Ans. (b) : Skeâ mhewefvebie š^er (Spanning Tree) efkeâmeer
with the next bit? connected graph keâe Ssmee meye«eeheâ neslee nw efpemeceW-
peye efkeâmeer yeeFvejer mebKÙee keâes «es keâes[ ceW yeouee peelee meYeer n Jeefš&mespe (Vertices) Meeefceue nesles nw,
nw, lees meyemes cenòkehetCe& efyeš (MSB) keâes Deieueer efyeš keâesF& meeF&keâue (Cycle) vener neslee~
kesâ meeLe XOR keâjves keâe keäÙee heefjCeece neslee nw? Deewj meYeer Jeefš&mespe Skeâ-otmejs mes Connected nesles nQ~
(a) The MSB of the Gray Code/«es keâes[ keâer MSB mhewefvebie š^er keâes yeveeves kesâ efueS keâce mes keâce (n –1) efkeâveejs (edges)
(b) The LSB of the Gray Code/«es keâes[ keâer LSB ÛeeefnS nesles nw~
(c) The XOR of all the bits in the binary number 16. Which property of dynamic programming is
yeeFvejer mebKÙee keâer meYeer efyešdme keâe XOR particularly useful for solving Optimal Binary
(d) The XOR of all the bits in the Gray Code Search Tree problems?
«es keâes[ keâer meYeer efyešdme keâe XOR [eÙevesefcekeâ Øees«eeefcebie keâer keâewve-meer efkeMes<elee Dee@efhšceue
Ans. (b) : (Gray Code ceW ) peye Deehe yeeFvejer mebKÙee kesâ MSB yeeFvejer meÛe& š^er mecemÙeeDeeW keâes nue keâjves ceW efkeMes<e ™he
keâes Gmekesâ Deieues efyeš mes XOR keâjles nw, lees Deehekeâes «es keâes[ keâe mes GheÙeesieer nesleer nw?
otmeje efyeš (otmeje cenlJehetCe& efyeš LSB) Øeehle nw, vee efkeâ MSB~ (a) Optimal substructure/Dee@efhšceue meyemš^keäÛej
13. In an ideal microcomputer, what is the purpose (b) Greedy choice property/«eer[er Ûee@Fme Øee@hešer&
of the clock or oscillator circuit? (c) Divide and Conquer/ef[keeF[ Sb[ keâe@vkeâj
Skeâ DeeoMe& ceeF›eâeskeâbhÙetšj ceW, keäuee@keâ Ùee Dee@mmeeruesšj (d) Linear programming/jwefKekeâ Øees«eeefcebie
meefke&âš keâe GösMÙe keäÙee neslee nw? Ans. (a) : Optimal Binary Search Tree (OBST) keâer
(a) Providing power to the microcomputer mecemÙee keâes nue keâjves kesâ efueS Dynamic Programming keâe
ceeF›eâeskeâbhÙetšj keâes heekej Øeoeve keâjvee GheÙeesie efkeâÙee peelee nw, Deewj FmeceW meyemes GheÙeesieer iegCe neslee nw:
(b) Displaying time and date information Optimal Substructure (meJeexòece Ghe-mebjÛevee) Fmekeâe celeueye Ùen
meceÙe Deewj efoveebkeâ keâer peevekeâejer ØeoefMe&le keâjvee nw efkeâ efkeâmeer mecemÙee keâe meJeexòece nue Gmekesâ Ghe-mecemÙeeDeeW kesâ
(c) Generating timing signals to synchronize meJeexòece nuees mes efceuekeâj yevelee nw~
operations/mebÛeeueve keâes mecekeâeefuekeâ keâjves kesâ efueS OBST ceW, nceW Ùen leÙe keâjvee neslee nw efkeâ keâewve mee Key root yeves
šeFefcebie efmeiveue GlheVe keâjvee leeefkeâ hetje meÛe& š^er keâce mes keâce cost ceW keâece keâjs~ Ùen efveCe&Ùe Úesšs-Úesšs
(d) Cooling the microcomputer components
efnmmees (Sub problems) keâes nue keâj kesâ efueÙee peelee nw~
ceeF›eâeskeâbhÙetšj kesâ IeškeâeW keâes "b[e keâjvee
17. The Floyd-Warshall algorithm is a popular
Ans. (c) : Skeâ DeeoMe& ceeF›eâes-kebâhÙetšj ceW keäuee@keâ (Clock) Ùee
method for solving the All-Pair Shortest Paths
Dee@mmeeruesšj (Oscillator) meefke&âš keâe cegKÙe GösMÙe neslee nw~ problem. What is the time complexity of the
Dee@hejsMeveeW keâes efmeb›eâveeFpe (mecevJeefÙele) keâjves kesâ efueS meceÙe mebkesâle Floyd-Warshall algorithm for a graph with "n"
(timing signals) GlheVe keâjvee~ vertices?

Bihar STET 50 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
 'n' Meer<eeX keeues «eeheâ kesâ efueS Dee@ue-hesÙej Mee@š&smš heeLe Ans. (b) : Stack- Ùen Skeâ ADT efpemeceW [sše keâes Last In
mecemÙee keâes nue keâjves kesâ efueS heäuee@Ùe[-kee@jMeeue First Out (LIFO) lejerkesâ mes jKee Deewj efvekeâeuee peelee nw~
Suieesefjoce keâer meceÙe peefšuelee keäÙee nw? Queue- Ùen Skeâ ADT nw pees First In First Out (FIFO)
(a) O(n) (b) O(n log n) veerefle hej keâece keâjlee nw~
(c) O(n^2) (d) O(n^3) List- Ùen Yeer Skeâ ADT nw, efpemeceW [sše keâes ›eâceyeæ lejerkesâ mes
Ans. (d) : Floyd-Warshall Suieesefjoce leerve Nested Loops meb«eefnle efkeâÙee peelee nw~
keâe GheÙeesie keâjlee nw, ØelÙeskeâ Jeefš&me kesâ efueS~ FmeefueS Fmekeâer kegâue 21. Which traversal technique is used to visit each
Time Complexity nesleer nw O(n3), peneB n «eeheâ kesâ Jeefš&mespe keâer node of a linked list exactly once?
mebKÙee nw~ efuebkeä[ efuemš kesâ ØelÙeskeâ vees[ keâes kesâkeue Skeâ yeej
18. What is the time complexity of the Divide and efkeefÌpeš keâjves kesâ efueS keâewve-meer š^wkeme&ue lekeâveerkeâ keâe
Conquer algorithm for finding the maximum GheÙeesie efkeâÙee peelee nw?
and minimum elements in an array of size "n"? (a) Preorder traversal/ØeerDee@[&j š^wkeme&ue
'n' Deekeâej keâer Ssjs ceW DeefOekeâlece Deewj vÙetvelece lelkeeW
(b) Inorder traversal/FveDee@[&j š^wkeme&ue
keâes Keespeves kesâ efueS ef[keeF[ Sb[ keâe@vkeâj Suieesefjoce
(c) Postorder traversal/heesmšDee@[&j š^wkeme&ue
keâer meceÙe peefšuelee keäÙee nesleer nw?
(d) Linear traversal/jwefKekeâ š^wkeme&ue
(a) O(n) (b) O(log n)
(c) O(n log n) (d) O(n^2) Ans. (d) : Preorder traversal, Inodder traversal Deewj
Ans. (a) : Divide Deewj Conquer Suieesefjoce array keâes oes Yeeiees Postorder traversal, š^er (tree) [sše mš^keäÛej keâe GheÙeesie keâjlee
ceW yeeBšlee nw Deewj ØelÙeskeâ Yeeie ceW recursively maximum Deewj nw , peyeef k eâ Linear traversal efuebkeä[ efuemš kesâ nj vees[ keâes Skeâ
minimum {tB{lee nw~ efheâj oesvees YeeieeW mes Øeehle heefjCeeceeW keâer leguevee yeej ›eâce mes ef J eef p eš keâjves kesâ efueS GheÙeesie nesleer nw~
keâjkesâ Debeflece maximum Deewj minimum efvekeâeues peeles nw~ 22. In pointer implementation of linked lists, which
Fme Øeef›eâÙee ceW kegâue leguevee ueieYeie (3n + 2 – 2) nesleer nw, FmeefueS operation can be performed in constant time
(O(1)) when inserting or deleting nodes?
Suieesefjoce keâer kegâue time complexity nesleer nw O(n)~ efuebkeä[ efuemš kesâ hee@Fbšj FchueerceWšsMeve ceW, peye vees[dme
19. In multistage graphs, what is the property of keâes peesÌ[ves Ùee nševes keâer yeele Deeleer nw, lees keâewve-mee
optimality?/ceušermšspe «eeheäme ceW, Dee@efhšceefuešer keâer
Dee@hejsMeve efmLej meceÙe (O(1)) ceW efkeâÙee pee mekeâlee nw?
efkeMes<elee keäÙee nesleer nw?
(a) Inserting at the beginning/Meg®Deele ceW peesÌ[vee
(a) The shortest path between any two stages is
the one with the fewest edges (b) Inserting at the end/Deble ceW peesÌ[vee
efkeâmeer oes ÛejCeeW kesâ yeerÛe meyemes Úesše jemlee ken neslee nw (c) Inserting at a specific position
efpemeceW meyemes keâce OeejeSB nesleer nQ efkeâmeer efkeefMe<š efmLeefle hej peesÌ[vee
(d) Deleting a specific node
(b) The shortest path between any two stages is
the one with the lowest total cost
efkeâmeer efkeefMe<š vees[ keâes nševee
efkeâmeer oes ÛejCeeW kesâ yeerÛe meyemes Úesše jemlee ken neslee nw Ans. (a) : efuebkeä[ efuemš (Linked List) ceW peye nce efkeâmeer veÙes
efpemekeâer kegâue ueeiele meyemes keâce nesleer nw vees [ keâes Meg ™ Deele (Begining) ceW peesÌ[les nw, lees nceW kesâJeue oes
(c) The shortest path between any two stages is
mšs h me keâjves nes les nw:
the one with the highest total cost  veÙes vees[ keâe next hJe@eFbšj hegjeves ns[ keâes hJee@Fbš keâjlee nw~
efkeâmeer oes ÛejCeeW kesâ yeerÛe meyemes Úesše jemlee ken neslee nw  ns[ hJee@Fbšj keâes veÙes vees[ hej mesš keâj osles nw~
efpemekeâer kegâue ueeiele meyemes DeefOekeâ nesleer nw Ùes oesveeW steps efyevee hetjer efuemš keâes š^wJeme& efkeâÙes nes efkeâÙes pee mekeâles nw~
(d) The shortest path between any two stages is 23. Which representation is best suited for
the one with the most vertices matrices with a small number of non-zero
efkeâmeer oes ÛejCeeW kesâ yeerÛe meyemes Úesše jemlee ken neslee nw elements in each row and column?
efpemeceW meyemes DeefOekeâ Meer<e& (Vertices) nesles nQ Gve cewefš^keäme kesâ efueS keâewve-mee ØeefleefveefOelke meyemes
Ans. (b) : Multistage graph ceW efkeâmeer Source mes GheÙegòeâ neslee nw efpevekeâer ØelÙeskeâ hebefòeâ Deewj mlebYe ceW
destination lekeâ meyemes keâce ueeiele Jeeuee ceeie& efvekeâeuevee cegKÙe yengle keâce iewj-MetvÙe lelke nesles nQ?
GösMÙe neslee nw~ FmeefueS Optimality keâe celeueye neslee nw efkeâ kegâue (a) Triplet representation/efš^heuesš ØeefleefveefOelke
ueeiele (cost) meyemes keâce nes~ (b) Compressed sparse row (CSR) format
20. Which of the following is not a common
mebheerefÌ[le efkejue hebefòeâ (CSR) Øee™he
example of an abstract data type? (c) Compressed sparse column (CSC) format
efvecveefueefKele ceW mes keâewve Decetle& [sše Øekeâej (Abstract meb heerefÌ[le efkejue mlebYe (CSC) Øee™he
Data Type) keâe meeceevÙe GoenjCe veneR nw? (d) Array representation/Ssjs ØeefleefveefOelke
(a) Stack/mšwkeâ (b) Integer/hetCeeËkeâ Ans. (*) : CSR (Compressed Sparse Row) Øee™he efJeMes<e
(c) Queue/keâleej (d) List/metÛeer ™he mes Gve cewefš^me kesâ efueS GheÙeesieer nesleer nw
Bihar STET 51 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
efpeveceW DeefOekeâebMe lelJe MetvÙe (zero) nesles nQ Deewj kesâJeue kegâÚ ner (ix kegâue mlebYees keâer mebKÙee + j)
non-zero Sefuecexšme nesles nw~ Ùen cesceesjer keâes yeÛeelee nw Deewj cewefš^me Deewj Ùeefo base address B nw lees:
Dee@hejsMeve (pewmes cewefš^me-Jeskeäšj iegCee) keâes lespe yeveelee nw~ Index = B + (i × n + j)
veesš– DeeÙeesie ves Fmekeâe Gòej (c) ceevee nw~ 27. The Banker's algorithm is an example of a
deadlock:/yeQkeâme& Suieesefjoce [s[uee@keâ keâer efkeâme ßesCeer
24. Which of the following representations is most
suitable for efficient row-wise traversal of a keâe GoenjCe nw?
sparse matrix?/efkejue cewefš^keäme keâer hebefòeâ-keej š^wkeme&ue (a) Avoidance algorithm/ yeÛeeke Suieesefjoce
keâes kegâMeueleehetke&keâ keâjves kesâ efueS efvecve ceW mes keâewve-mee (b) Detection algorithm/henÛeeve Suieesefjoce
ØeefleefveefOelke meyemes GheÙegòeâ nw? (c) Prevention algorithm/jeskeâLeece Suieesefjoce
(a) Triplet representation/efš^heuesš ØeefleefveefOelke (d) Termination algorithm/meceeheve Suieesefjoce
(b) Compressed sparse row (CSR) format Ans. (a) : Banker's algorithm Skeâ "Dead lock Avoidance
mebheerefÌ[le efkejue hebefòeâ (CSR) Øee™he Algorithm" nw~ Ùen algorithm Ùen megevf eef§ele keâjlee nw efkeâ System
(c) Compressed sparse column (CSC) format keâYeer Yeer Ssmes Unsafe ceW ve peeS peneB Dead lock nes mekeâlee nw~ Ùen
mebheerefÌ[le efkejue mlebYe (CSC) Øee™he henues mes Ùen peeBÛe keâjlee nw efkeâ resource allocation safe nw Ùee veneR,
(d) Array representation/Ssjs ØeefleefveefOelke Deewj leYeer allocation keâjlee nw~
Ans. (b) : CSR (Compressed Sparse Row) Øee™he efJeMes<e 28. The concept of monitors was introduced by:
™he mes Sparse Matrix keâer hebefòeâÙeeW keâes kegâMeuelee-hetJe&keâ Traverse cee@efvešme& keâer mebkeâuhevee efkeâmekesâ Éeje Øemlegle keâer ieF& Leer?
keâjves kesâ efueS ef[peeFve efkeâÙee ieÙee nw~ FmeceW kesâJeue non-zero ceeveeW (a) Edsger Dijkstra/S[dmiej [eÙekeâmš^e
keâes meb«eefnle efkeâÙee peelee nw Deewj ØelÙeskeâ hebefòeâ keâer Meg™Deele Deewj Devle (b) Alan Turing/Sueve šŸetefjbie
keâe Fb[skeäme Deueie mes jKee peelee nw, efpememes row-wise traversal (c) Tim Berners-Lee/efšce yeve&me&-ueer
yengle lespe Deewj memory-efficient nes peelee nw~ (d) Linus Torvalds/efuevegme še@jkeeu[dme
25. In computer graphics, arrays can be used to Ans. (a) : Monitors keâer DeJeOeejCee 'Edsger Dijkstra' Éeje oer
store pixel values for images. Which type of
ieÙeer Leer~ Ùen Øeef›eâÙee (Process) Ùee yes[ (Thread) kesâ yeerÛe
array would be suitable for this purpose?
keâbhÙetšj «eeefheâkeäme ceW, Fcespe kesâ efhekeämesue ceeveeW keâes meb«enerle efmeb›eâesveeFpesMeve (Synchronization) kesâ efueS ØeÙeesie efkeâÙee peelee
nw, efpememes Shared resources keâe ieuele lejerkesâ mes GheÙeesie ve nes~
keâjves kesâ efueS Ssjs keâe GheÙeesie efkeâÙee pee mekeâlee nw~ Fme
29. Priority Scheduling involves assigning a priority
GösMÙe kesâ efueS keâewve-mee Øekeâej keâe Ssjs GheÙegòeâ nesiee? value to each process. Which scheduling
(a) 1-D array (b) 2-D array algorithm is closely related to this concept?
(c) 3-D array (d) 4-D array ØeeÙeesefjšer Mes[Ÿetefuebie ceW ØelÙeskeâ Øeesmesme keâes Skeâ
Ans. (b) : Skeâ ÚefJe (Image) oes DeeÙeesceeW (Dimensions) ØeeLeefcekeâlee ceeve meeQhee peelee nw~ Ùen DekeOeejCee efkeâme
TBÛeeF& (Height) Deewj ÛeewÌ[eF& (Width) ceW yeveer nesleer nw~ nj Mes[Ÿetefuebie Suieesefjoce mes efvekeâšlee mes mebyebefOele nw?
efhekeämeue keâe mLeeve Fve oes DeeÙeeceeW Éeje efveOee&efjle neslee nw~ FmeefueS, (a) FCFS/SheâmeerSheâSme (b) SJN/SmepesSve
efhekeämeue ceeveeW keâes meb«eefnle keâjves kesâ efueS 2-D array GheÙegòeâ neslee (c) Multilevel Queue Scheduling
nw~ Ùeefo jbie (Color) keâer peevekeâejer pewmes RGB Vallues Meeefceue ceušerueskeue keäÙet Mes[Ÿetefuebie
keâjveer nes, leye 3-D array keâe GheÙeesie efkeâÙee pee mekeâlee nw, uesefkeâve (d) First-Come, First-Served (FCFS)
kesâJeue efhekeämeue keâer efmLeefle kesâ efueS 2-D array ner heÙee&hle neslee nw~ heâmš&-keâce, heâmš&-mek[& (FCFS)
26. For a 2-D array represented in row-major Ans. (c) : Priority Scheduling keâe leelheÙe& nw efkeâ nj (Priority)
order, the index formula to access the element keâes Skeâ ØeeLeefcekeâlee (Priority) oer peeleer nw, Deewj CPU Gmeer Priority
at row "i" and column "j" using the base
address "B" is:/Ùeefo Skeâ efÉ-DeeÙeeceer Ssjs keâes jes-
kesâ Devegmeej Processes keâes Allocate efkeâÙee peelee nw~
cespej ›eâce ceW meb«enerle efkeâÙee ieÙee nw, lees 'i' hebefòeâ Deewj Multilevel Queue Scheduling ceW Processes keâes Deueie-
'j' mlebYe hej efmLele leòke keâes yesme S[^sme 'B' keâe GheÙeesie
Deueie Priority Jeeues Queues ceW yeeBše peelee nw, Deewj nj Queue
keâer Deueie ØeeLeefcekeâlee nesleer nw~ FmeefueS Ùen Algorithm Priority
keâjkesâ Skeämesme keâjves keâe Fb[skeäme met$e keäÙee nesiee?
Scheduling mes meyemes pÙeeoe mebyebefOele nw~
(a) Index = B + (i * n + j)
(b) Index = B + (j * n + i) 30. The resource matrix is a data structure used in
(c) Index = B + (i + j) deadlock detection algorithms to:
(d) Index = B + (i * m + j) efjmeesme& cewefš^keäme [s[uee@keâ ef[šskeäMeve Suieesefjoce ceW
Ans. (a) : peye nce efkeâmeer 2-D array keâes row-major order ceW efkeâmekesâ ØeefleefveefOelke kesâ efueS GheÙeesie keâer peeleer nw?
meb«eefnle keâjles nw, lees hetjer henueer row henues memory ceW Deeleer nw, (a) Represent resource allocation
efheâj otmejer row Deewj Ssmes ner Deeies~ FmeefueS Ùeefo nceW efkeâmeer row mebmeeOeve Deekebšve keâes oMee&ves kesâ efueS
'i' Deewj colum 'j' hej efmLele element keâe address ÛeeefnS, lees (b) Represent the execution order of processes
Gmekeâe formula neslee nw~ Øeesmesme kesâ efve<heeove ›eâce keâes oMee&ves kesâ efueS
Bihar STET 52 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
 (c) Represent the execution history of processes 33. The term "multi-user" in an OS context refers
Øeesmesme kesâ efve<heeove Fefleneme keâes oMee&ves kesâ efueS to:/Dee@hejsefšbie efmemšce kesâ meboYe& ceW 'ceušer-ÙetÌpej' Meyo
(d) Represent the priority of processes keâe keäÙee DeLe& nw?
Øeesmesme keâer ØeeLeefcekeâlee keâes oMee&ves kesâ efueS (a) An OS that can execute multiple programs
Ans. (a) : Re source Matrix Skeâ Ssmee Data Structure nw simultaneously/Skeâ Ssmee OS pees Skeâ meeLe keâF&
efpemekeâe GheÙeesie Deadlock defection algorithms ceW Ùen oMee&ves Øees«eece Ûeuee mekeâlee nw
(b) An OS that supports multiple users working
kesâ efueS efkeâÙee peelee nw efkeâ keâewve-keâewve mes Resources efkeâme-efkeâme on the same machine/Skeâ Ssmee OS pees Skeâ ner
Process keâes Allocate efkeâÙes ieÙes nw~ ceMeerve hej keâF& GheÙeesiekeâlee&DeeW keâes meceLe&ve oslee nw
Fmemes Ùen helee ueieeÙee pee mekeâlee nw efkeâ keâesF& Process efkeâmeer (c) An OS that can only run on multiple
Resource kesâ efueS Wait keâj jne nw Ùee vener, efpememes deadlock computers/Skeâ Ssmee OS pees kesâkeue keâF& keâbhÙetšjeW hej
keâer efmLeefle keâes henÛeevee pee mekesâ~ Ûeue mekeâlee nw
31. The term "race condition" in parallel (d) An OS with a graphical user interface
programming refers to: Skeâ Ssmee OS efpemeceW «eeefheâkeâue ÙetÌpej Fbšjheâsme neslee nw
hewjsueue Øees«eeefcebie ceW 'jsme keâb[erMeve' Meyo keâe keäÙee DeLe& Ans. (b) : Multi-User Operating System Jen Dee@hejsefšbie
nw? efmemšce neslee nw pees Skeâ ner meceÙe ceW keâF& Users keâes Skeâ ner
(a) A competition between processes to terminate keâchÙetšj efmemšce hej keâece keâjves keâer megefJeOee oslee nw~
first/Øeef›eâÙeeDeeW kesâ yeerÛe meyemes henues meceehle nesves keâer  nj User keâe Dehevee Session Ùee Environment nes mekeâlee
ØeeflemheOee& nw, Deewj System Gvekesâ keâeÙeex keâes Manage keâjlee nw~
(b) A competition between processes to access 34. ______ offers the ability to query the data and
shared resources/Øeef›eâÙeeDeeW kesâ yeerÛe meePee mebmeeOeveeW insert, alter, and delete tuples.
lekeâ hengBÛeves keâer ØeeflemheOee& ______ [sše keâes keäkesjer keâjves Deewj šheume keâes peesÌ[ves,
(c) A situation where a process is stuck in a loop yeoueves leLee nševes keâer #ecelee Øeoeve keâjlee nw~
ken efmLeefle peneB Skeâ Øeef›eâÙee uethe ceW heâBme peeleer nw (a) Transaction Control Language (TCL)
(d) A situation where processes are running š^ebÌpewkeäMeve keâbš^esue ueQikespe (TCL)
sequentially/ken efmLeefle peneB Øeef›eâÙeeSB ›eâefcekeâ ™he mes (b) Data Control Language (DCL)
Ûeue jner nesleer nQ [sše keâbš^esue ueQikespe (DCL)
Ans. (b) : Race condition keâe celeueye nw efkeâ peye Skeâ mes pÙeeoe (c) Data Definition Language (DDL)
Processes Ùee Threads efkeâmeer Shared Resource (pewmes
[sše [sefheâefveMeve ueQikespe (DDL)
(d) Data Manipulation Language (DML)
memory, file variable) keâes Skeâ ner meceÙe ceW access Ùee [sše cewefveheguesMeve ueQikespe (DML)
modify keâjves keâer keâesefMeMe keâjles nw~
Ans. (d) : DML (Data Manipulation Language) keâe
Deiej Fvekeâer access keâes mener lejerkesâ Synchronize vener efkeâÙee GheÙeesie [sšeyesme ceW ceewpeto [sše keâes Øeehle (query) peesÌ[ves
ieÙee nes, lees Output hej Demej heÌ[lee nw Deewj Program ieuele (Insert), mebMeesefOele (alter/update), Deewj njeves (delete) kesâ
JÙeJenej keâjves ueielee nw~ efueS efkeâÙee peelee nw~
32. The need for a command interpreter arises FmeceW cegKÙe 'Commands' nesles nw~
because:  SELECT (Data keâes osKeves kesâ efueS )
keâceeb[ FbšjØesšj keâer DeekeMÙekeâlee keäÙeeW nesleer nw?  INSERT (veÙee Data peesÌ[ves kesâ efueS )
(a) Hardware cannot execute programs directly  UPDATE (ceewpetoe Data yeoueves kesâ efueS )
ne[&kesÙej meerOes Øees«eece efve<heeefole veneR keâj mekeâlee  DELETE (Data nševes kesâ efueS)
(b) All programming languages require an 35. Which of the following is a database?
interpreter/meYeer Øees«eeefcebie Yee<eeDeeW keâes Skeâ FbšjØesšj efvecveefueefKele ceW mes keâewve Skeâ [sšeyesme nw?
keâer DeekeMÙekeâlee nesleer nw (a) MySQL (b) Informix
(c) Software cannot run on hardware (c) SQL Server
mee@heäškesÙej ne[&kesÙej hej veneR Ûeue mekeâlee (d) All of the above/Ghejesòeâ meYeer
(d) Users prefer typing commands over using Ans. (d) : efoÙes ieÙes meYeer efJekeâuhe DBMS (Data Base
GUIs/GheÙeesiekeâlee& GUI keâer leguevee ceW keâceeb[ šeFhe Management System) nw, efpevekeâe GheÙeesie [sše keâes mšesj,
keâjvee hemebo keâjles nQ cewvespe Deewj Skeämesme keâjves kesâ efueS efkeâÙee peelee nw~
Ans. (a) : nceW keâceeC[ FCšj efØešj (Command Interprets) My SQL Skeâ Open Source [sšeyesme (Informix) Éeje
efpemes Shell Yeer keânles nQ, keâer pe™jle nesleer nw, keäÙeesefkeâ ne[&JesÙej efJekeâefmele [sšeyesme, SQL Server (Micro Soft Éeje efJekeâefmele)
meerOes User kesâ Command keâes vener mecePe mekeâlee~ hee@heguej [sšeyesme nQ~
 Command Interpreter Fve Commands keâes heÌ{lee nw, Gvns 36. What do you mean by one to many
Process keâjlee nw Deewj efheâj Operating System kesâ efueS relationships?
Actionable Instructions ceW yeoue oslee nw~ 'keve št cesveer efjuesMeveefMehe' keâe keäÙee DeLe& neslee nw?
Bihar STET 53 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
 (a) Many teachers may have many classes (a) Specialized File/efkeefMe<š ÌHeâeFue
keâF& efMe#ekeâ keâF& keâ#eeDeeW keâes heÌ{e mekeâles nQ (b) Master File/ceemšj ÌHeâeFue
(b) One class may have many teachers (c) Log File/uee@ie ÌHeâeFue
Skeâ keâ#ee kesâ keâF& efMe#ekeâ nes mekeâles nQ (d) Update File/Dehe[sš ÌHeâeFue
(c) One teacher can have many classes
Ans. (b) : peye efkeâmeer yeÌ[s keâchÙetšj metÛevee ØeCeeueer (Computer
Skeâ efMe#ekeâ keâer keâF& keâ#eeSB nes mekeâleer nQ
Information System) ceW keâF& lejn keâer heâeFueW nesleer nQ, lees GveceW
(d) Many classes may have many teachers
keâF& keâ#eeDeeW kesâ keâF& efMe#ekeâ nes mekeâles nQ mes Jen heâeFue pees ueieeleej Dehe[sš nesleer jnleer nw Deewj uecyeW meceÙe
lekeâ mebjef#ele jnleer nQ, Gmes Perpetual File Ùee Master File keâne
Ans. (c) : One To Many Relationship keâe DeLe& neslee nw efkeâ
peelee nw~
Skeâ entity mes keâF& otmejer entities pegÌ[er nes mekeâleer nw~
41. Subnetting allows for:
GoenjCe: Skeâ teacher keâF& classes keâes heÌ{e mekeâlee nw, uesefkeâve meyevesefšbie efkeâmekesâ efueS Devegceefle Øeoeve keâjlee nw?
nj class keâe Skeâ ner main teacher nes mekeâlee nw~
(a) Faster data transmission/lespe [sše š^ebmeefceMeve
37. In general, a file is basically a collection of all
related______. (b) Improved error control/yesnlej $egefš efveÙeb$eCe
meeceevÙeleŠ, Skeâ ÌHeâeFue cetue ™he mes meYeer mebyebeOf ele (c) Efficient use of IP addresses
IP heleeW keâe kegâMeue GheÙeesie
______ keâe meb«en nesleer nw~
(d) Increased network security
(a) Rows & Columns (b) Database
(c) Fields (d) Records
vesškeke&â megj#ee ceW ke=efæ
Ans. (c) : Subnetting keâe GheÙeesie vesšJeke&â keâes Úesšs-Úesšs YeeieeW
Ans. (d) : meeceevÙe ™he mes, Skeâ fille Skeâ Ssmeer FkeâeF& nesleer nw
pees meYeer related records keâe meb«en nesleer nw~ (Subnets) ceW yeeBšves kesâ efueS efkeâÙee peelee nw~
 Record– Skeâ complete entry (pewmes Skeâ JÙeefòeâ keâe veece, Fmekeâe cegKÙe GösMÙe nw–
helee heâesve vecyej Deeefo) IP Addresses keâe kegâMeue (Efficient) GheÙeesie keâjvee~
 keâF& efjkeâe@[&dme efceuekeâj Skeâ heâeFue yeveleer nw~ IP Address Space keâes Manage keâjvee~
38. Which of the following refers to the number of Network Traffic keâes yesnlej Ì{bie mes Control keâjvee~
attributes in a relation?/efkeâmeer efjuesMeve ceW iegCeeW 42. Upward multiplexing involves:
(Attributes) keâer mebKÙee keâes keäÙee keâne peelee nw? Deheke[& ceušerhuesefkeämebie ceW keäÙee neslee nw?
(a) Row/hebefòeâ (b) Degree/ef[«eer (a) Combining multiple data streams into one
(c) Column/mlebYe
keâF& [sše mš^ercme keâes Skeâ ceW peesÌ[e peelee nw
(b) Distributing data to different physical
(d) All of the above/Ghejesòeâ meYeer
channels/[sše keâes efkeefYeVe efheâefpekeâue ÛewveueeW ceW efkeleefjle
Ans. (a) : efkeâmeer relation ceW pees attributes nesles nw– efkeâÙee peelee nw
Ùeeveer efkeâ Columns keâer mebKÙee, Gmes Degree keâne peelee nw~ (c) Separating data into smaller units
 Row– Skeâ record keâes oMee&leer nw~ efpemes tuple Yeer keânles nQ) [sše keâes Úesšs YeeieeW ceW efkeYeeefpele efkeâÙee peelee nw
 Column– Skeâ attributes keâes oMee&lee nw~ (d) Reordering data packets
 Degree– Attributes (columns) keâer kegâue mebKÙee~ [sše hewkesâšdme keâes hegve: ›eâceyeæ efkeâÙee peelee nw
39. A report generator is used to/Skeâ efjheesš& pevejsšj Ans. (a) : Up ward Multiplexing keâe DeLe& neslee nw- keâF&
keâe GheÙeesie efkeâme efueS efkeâÙee peelee nw? Data Streams keâes efceueekeâj Skeâ ner Connection (Ùee
(a) Update file/HeâeFue keâes Dehe[sš keâjves kesâ efueS Channel) kesâ ceeOÙece mes Yespevee~
(b) Print file on paper 43. Process-to-process communication involves
HeâeFue keâes keâeieÌpe hej efØebš keâjves kesâ efueS communication between:
(c) Both of the above/Ghejesòeâ oesveeW Øees mesme-št-Øeesmesme keâcÙegefvekesâMeve keâe DeLe& nw:
(d) None of the above/Ghejesòeâ ceW mes keâesF& veneR (a) Different network layers
Ans. (b) : Report Generator Skeâ Ssmee štue neslee nw efpemekeâe
ef keefYeVe vesškeke&â uesÙeme& kesâ yeerÛe mebÛeej
(b) Different devices on the same network
GheÙeesie [sše keâes Skeâ JÙeJeefmLele efjheesš& kesâ ™he ceW lewÙeej keâjves Deewj
Skeâ ner vesškeke&â hej efkeefYeVe ef[keeFmeeW kesâ yeerÛe mebÛeej
Gmes efhebÇš keâjves kesâ efueS efkeâÙee peelee nw~ (c) Devices using different protocols
Ùen efjheesš& keâes keâeiepe hej efhebÇš keâjves Ùee ef[efpešue ™he ceW Øemlegle keâjves kesâ efkeefYeVe Øeesšeskeâe@ue keâe GheÙeesie keâjves keeues ef[keeFmeeW kesâ
efueS ØeÙeesie neslee nw~ pewmes efjheesš& keâe[&, efyeefuebie efjheesš& Deeefo~
yeerÛe mebÛeej
40. A large computer information system (d) Processes on different devices
maintains many different computer files.
Which amongst them is called a perpetual file? efkeefYeVe ef[keeFmeeW hej Øeef›eâÙeeDeeW kesâ yeerÛe mebÛeej
Skeâ yeÌ[e keâbhÙetšj metÛevee ØeCeeueer keâF& efkeefYeVe keâbhÙetšj Ans. (d) : Process to Process Communication keâe DeLe& nw-
ÌHeâeFueeW keâes yeveeS jKelee nw~ FveceW mes keâewve-meer oes Deueie-Deueie ef[JeeFmespe (Computers or Systems) hej Ûeue
'hejhesÛegDeue heâeFue' keânueeleer nw? jns Processes kesâ yeerÛe mebÛeej (Communication).
Bihar STET 54 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
44. The HTTP protocol is used for:/HTTP Øeesšeskeâe@ue (a) Line of Change/ueeFve Dee@heâ ÛeWpe
keâe GheÙeesie efkeâmekesâ efueS efkeâÙee peelee nw? (b) Level of Complexity/ueskeue Dee@heâ keâe@chuesefkeämešer
(a) Email communication/F&cesue mebÛeej (c) Lines of Code/ueeFvme Dee@heâ keâes[
(b) File transfers/HeâeFue š^ebmeheâj (d) List of Components/efuemš Dee@heâ keâbheesveWšdme
(c) Web browsing/kesye yeÇeGefÌpebie Ans. (c) : LOC (Lines Of Code) keâe celeueye neslee nw efkeâ
(d) Remote terminal access/efjceesš šefce&veue Skeämesme efkeâmeer mee@heäšJesÙej Øees«eece ceW efkeâleveer hebefòeâÙeeB (Lines) keâes[ efueKeer
Ans. (c) : HTTP keâe GheÙeesie Jesye yeÇeGefpebie kesâ efueS efkeâÙee peelee ieÙeer nw~ Ùen mee@heäšJesÙej kesâ Deekeâej Deewj peefšuelee keâe Devegceeve
nw~ peye Deehe efkeâmeer JesyemeeFš keâes Keesueles nw, lees Deehekeâe yeÇeGpej ueieeves kesâ efueS GheÙeseie efkeâÙee peelee nw~
Deewj Jesye meJe&j HTTP Øeesšeskeâe@ue keâe GheÙeesie keâjkesâ Skeâ-otmejs mes 50. The Cost Estimation technique that involves
[sše keâe Deeoeve-Øeoeve keâjles nw~ expert judgments and consensus is called:
45. The term HTTP stand for: ueeiele Devegceeve lekeâveerkeâ pees efkeMes<e%e kesâ efveCe&Ùe Deewj
HTTP keâe hetCe& ™he keäÙee nw? menceefle hej DeeOeeefjle nesleer nw, Gmes keäÙee keâne peelee nw?
(a) Hyper Terminal Tracing Program (a) COCOMO
neFhej šefce&veue š^sefmebie Øees«eece (b) Delphi Method/[suheâer efkeefOe
(b) Hypertext Tracing Program (c) Waterfall Model/kee@šjheâe@ue cee@[ue
neFhejšskeämš š^sefmebie Øees«eece (d) Prototype Model/ØeesšesšeFhe cee@[ue
(c) Hypertext Transfer Protocol Ans. (b) : Delphi Method Skeâ Ssmeer lekeâveerkeâ nw, efpemeceW keâF&
neFhejšskeämš š^ebmeheâj Øeesšeskeâe@ue efJeMes<e%eeW mes Deueie-Deueie jeÙe ueer peeleer nw, efheâj Gve jeÙeeW keâe
(d) Hypertext Tracing Protocol efJeMues<eCe keâjkesâ meJe&mecceefle yeveeF& peeleer nw~
neFhejšskeämš š^sefmebie Øeesšeskeâe@ue 51. ISO 9000 and SEI CMM are both frameworks
Ans. (c) : HTTP (Hyper Text Transfer Protocol) Skeâ related to:/ISO 9000 Deewj SEI CMM oesveeW {eBÛes
Application Layer Øeesšeskeâe@ue neslee nw~ Ùen Jesye yeÇeGefpebie keâjves kesâ efkeâmemes mebyebefOele nQ?
efueS GheÙeesie efkeâÙee peelee nw~ (a) Software testing/mee@ÌHeäškesÙej hejer#eCe
46. The length of an IPv6 address is: (b) Software documentation/mee@ÌHeäškesÙej omleekesÌpeerkeâjCe
IPv6 heles keâer uebyeeF& nesleer nw: (c) Software quality assurance and process
(a) 32 bits/32 efyešdme (b) 64 bits/64 efyešdme improvement/mee@ÌHeäškesÙej iegCekeòee DeeÕeemeve Deewj
(c) 128 bits/128 efyešdme (d) 256 bits/256 efyešdme Øeef›eâÙee megOeej
Ans. (c) : IPv6 address keâer uecyeeF& 128 efyešdme nesleer nw~ Ùen (d) Software design principles
IPv4 keâe Deieuee mebmkeâjCe nQ, efpemeceW kesâJeue 32 bit nesles nw~ mee@ÌHeäškesÙej ef[ÌpeeFve efmeæeble
47. The maximum length (in bytes) of an IPv4 Ans. (c) : ISO 9000 Deewj SEI CMM (Capability
datagram is:/Skeâ IPv4 [eše«eece keâer DeefOekeâlece Maturity Model) oesveeW ner øesâceJeke&â mee@heäšJesÙej efJekeâeme Øeef›eâÙee
uebyeeF& (yeeFšdme ceW) nesleer nw: keâer iegCeJeòee kesâ yesnlej yeveeves Deewj Gmes ceevekeâerke=âle keâjves kesâ efueS
(a) 32 (b) 256 yeveeS ieS nw~
(c) 1024 (d) 65535 52. Which type of maintenance involves adding
Ans. (d) : IPv4 [sše«eece keâer DeefOekeâlece uecyeeF& 65535 yeeFšdme new features to existing software?/ken keâewve mee
nesleer nw~ Ùen meercee ns[j meefnle hetjer [sše«eece keâer nesleer nw, Deewj Ùen jKe-jKeeke (Maintenance) nw pees ceewpetoe mee@ÌHeäškesÙej
16- bit heâeru[ "Total Length" Éeje efveOee&efjle nesleer nw~ ceW veF& efkeMes<eleeSB peesÌ[ves mes mebyebefOele nw?
48. Which software life cycle model is based on (a) Corrective Maintenance/keâjsefkeäške ceWšsveWme
iterative./keâewve mee mee@ÌHeäškesÙej peerkeve Ûe›eâ cee@[ue (b) Perfective Maintenance/hejheâsefkeäške ceWšsveWme
hegvejeke=òe (Iterative) hej DeeOeeefjle nw? (c) Adaptive Maintenance/S[wefhške ceWšsveWme
(a) Waterfall model/kee@šjheâe@ue cee@[ue (d) Preventive Maintenance/efØekeWefške ceWšsveWme
(b) Spiral model/mheeFjue cee@[ue Ans. (b) : Perfective Maintenance Jen Øeef›eâÙee nesleer nw efpemeceW
(c) Agile model/SpeeFue cee@[ue ceewpetoe mee@heäšJesÙej keâes Deewj yesnlej yeveeves kesâ efueS veS efheâÛeme& peesÌ[s
(d) Prototype model/ØeesšesšeFhe cee@[ue peeles nQ Ùee hegjeves heâerÛeme& keâes megOeeje peelee nw, leeefkeâ Ùetpeme& keâer
Ans. (b) : Spiral model Skeâ Ssmee mee@heäšJesÙej [sJeueheceWš cee@[ue pe™jleeW keâes yesnlej Ì{ib e mes hetje efkeâÙee pee mekeWâ~
nw, pees Iteration (oesnjeJe) Deewj Proto typing oesveeW keâes efceueekeâj 53. The framework that provides guidelines for
keâece keâjlee nw~ achieving consistent and high-quality software is:
49. In the context of software project management, Jen øesâceJeke&â pees ueieeleej GÛÛe iegCeòeâe Jeeuee mee@heäšJesÙej
what is LOC an acronym for? Øeehle keâjves kesâ efueS efoMee efveoxMe Øeoeve keâjlee nw
mee@ÌHeäškesÙej heefjÙeespevee ØeyebOeve kesâ meboYe& ceW LOC keâe (a) COCOMO (b) ISO 9000
hetCe& ™he keäÙee nw? (c) Delphi Method (d) Agile Manifesto
Bihar STET 55 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
Ans. (b): ISO 9000 Skeâ Devle&je°^erÙe ceevekeâ nw pees iegCeòeâe ØeyebOeve Ans. (c) : Symeš^wkeäš keäueemesme Deewj Fbšjhesâme oesveeW Deeypeskeäš
ØeCeeueer (Quality Management System) kesâ efueS efoMee-efveoxMe DeesefjSbšs[ Øees«eeefcebie ceW Symeš^wkeäš keäueemesme keâe GheÙeesie leye efkeâÙee
oslee nw~ Fmekeâe GösMÙe nw efkeâ Glheeo Ùee mesJee efvejblej GÛÛe iegCeòeâe peelee nw peye Deehe kegâÚ meeceevÙe keâeÙe&#ecelee (common
keâer yeveer jns~ Fme efueS ISO 9000 mee@heäšJesÙej keâer iegCeòeâe Deewj functionaliaty) keâes heefjYeeef<ele keâjs Deewj JÙeglheVe keäueemesme
efmLejlee keâes yeveeS jKeves ceW ceoo keâjlee nw~ (deriued classes) keâes mebMeesefOele keâjW~
54. Which maintenance process involves 57. What is the main purpose of using namespaces
documenting the software's structure and in programming?
functionality? Øeesieeefcebie ceW vescemhesme keâe GheÙeesie keâjves keâe cegKÙe GösMÙe
mee@heäšJesÙej keâer mebjÛevee Deewj keâeÙe&#ecelee keâes omleeJespe keäÙee nw?
keâjves Jeeueer jKejKeeJe Øeef›eâÙee keâewve-meer nw? (a) To provide data encapsulation
(a) Reverse Engineering (b) To organize code into logical groups
(b) Preventive Maintenance (c) To define abstract classes
(c) Perfective Maintenance (d) To handle exceptions
(d) Adaptive Maintenance Ans. (b) : Øeesieeefcebie ceW vescemhesve keâe cegKÙe GössMÙe keâes[ keâes
Ans. (a) : Reverse Engineering Skeâ Øeef›eâÙee nw efpemeceW henues JÙeJeefmLele keâjvee nw, leeefkeâ mebyebefOele henÛeevekeâlee&Dees (JesefjSyeue,
mes yeves ngS mee@heäšJesÙej keâe efJeMues<eCe keâjkesâ Gmekeâer mebjÛevee Deewj hebâkeäMeve Ùee keäueeme) keâer DeefÉleerÙe veece kesâ lenle mecetefnle efkeâÙee pee
keâece keâjves kesâ lejerkesâ keâes mecePee peelee nw~ Fmekeâe GösMÙe Gme efmemšce mekeWâ, efpememes veeceeW kesâ škeâjeJe keâes jeskeâe pee mekesâ Deewj keâes[ keâer
keâes efheâj mes ef[peeFve keâjvee Ùee Gmekeâe omleeJespe lewÙeej keâjvee neslee he"veerÙelee Je jKejKeeJe ceW megOeej nes mekesâ~
nw, efJeMes<ekeâj peye cetue ef[peeFve keâer peevekeâejer GheueyOe veneR nesleer~ 58. What is the term for creating a new class that
inherits properties and behaviors from an
55. What is the term for defining multiple methods
existing class?
in a class with the same name but different
efkeâmeer Ssmes veÙes Jeie& keâes yeveeves kesâ efueS keäÙee Meyo
parameters?
Skeâ ner veece uesefkeâve Deueie-Deueie hewjeceeršj Jeeues ØeÙeesie efkeâÙee peelee nw pees efkeâmeer ceewpetoe Jeie& mes iegCe
Deesj JÙeJenej efJejemele ces ueslee nw?
keäueeme ceW keâF& efJeefOeÙeeW keâes heefjYeeef<ele keâjves kesâ efueÙes
(a) Polymorphism (b) Encapsulation
keäÙee Meyo nw? (c) Abstraction (d) Derivation
(a) Overriding (b) Overloading Ans. (d) : Ssmes veÙes Jeie& (Class) keâes yeveeves kesâ efueÙes pees efkeâmeer
(c) Inheriting (d) Inheritance ceewpetoe Jeie& (Existing Class) mes iegCe Deewj JÙeJenej efJejemele ceW
Ans. (b) : Method Overloading Deewj object oriented efceuelee nw, Gmes JÙeglheVe Jeie& (Derivation Class) keâne peelee nw~
Programming keâer efJeMes<elee nw, efpemeceW Skeâ ner veece kesâ meeLe keâF& 59. What is the primary purpose of an interface in
Methods yeveeS pee mekeâlee nw, yeMelex Gvekesâ Parameters Deueie- OOP?
Deueie nes (mebKÙee, Øekeâej Ùee ›eâce ceW)~ Ùen Compile time hej OOP ceW Fbšjhesâme keâe ØeeLeefcekeâ GösMÙe keäÙee nw?
efveOee&efjle neslee nw~ (a) To provide a blueprint for creating objects
56. What is the main advantage of using abstract (b) To define a set of methods that must be
implemented by implementing classes
classes over interfaces?
(c) To define constructors for classes
Fbšjhesâme keâer leguevee ceW Deecetle& keäueemeeW keâe GheÙeesie keâjves (d) To create static methods
keâe cegKÙe ueeYe keäÙee nw? Ans. (b) : Fbšjhesâme keâe cegKÙe GösMÙe neslee nw, efkeâ Ssmes Methoed
(a) Abstract classes can have multiple keâe mesš heefjYeeef<ele keâjvee efpemes Gme Interface keâes Implement
inheritance, unlike interfaces/ Symš^wkeäš keâjves Jeeueer Classes keâes ueeiet pe™j keâjvee neslee nw~
keäueemesme ceW ceušerheue FvensefjšWme nes mekeâleer nw, peyeefkeâ 60. What is the term for a variable that references
Fbšjhesâme ceW veneR~ an instance of a class?
(b) Interfaces can have constructors, while Gme Ûej kesâ efueS keäÙee Meyo nw pees efkeâmeer keäueeme kesâ
abstract classes cannot/Fbšjhesâme ceW kebâmš^keäšj nes GoenjCe keâes meboefYe&le keâjlee nw?
mekeâles nw peyeefkeâ Symš^wkeäš keäueeme ceW veneR~ (a) Property (b) Method
(c) Abstract classes can provide default (c) Object (d) Constructor
implementations of methods/Symš^wkeäš keäueemesme Ans. (c) : peye nce efkeâmeer keäueeme mes keâesF& JeemleefJekeâ GoenjCe
cesLe[dme keâer ef[heâe@uš FchueerceWšsMeve Øeoeve keâj mekeâleer nw~ (instance) yeveeles nQ Deewj Gmes efkeâmeer Ûej (Variable) kesâ ceeOÙece
(d) Interfaces allow for private access modifiers, mes meboefYe&le (References) keâjles nQ, lees Gme Ûej keâes Dee@ypeskeäš keâne
unlike abstract classes/Fbšjhesâme ceW ØeeFJesš Skeämesme peelee nww~
cee@ef[heâeÙeme& keâer Devegceefle nesleer nw, peyeefkeâ Symš^wkeäš 61. What is the term for a condition that occurs
keäueeme ceW vener during program execution that disrupts the
normal flow of instructions?
Bihar STET 56 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
 Øees«eece efve<heeove kesâ oewjeve GlheVe nesves Jeeueer Gme efmLeefle Ans. (a) : Select keâLeve [sšeyesme mes efJeefMe° [sše keâer hegve: Øeehle
keâes keäÙee keânles nQ pees efveoxMeeW kesâ meeceevÙe ØeJeen keâes keâjkesâ [sše keâes hegve: Øeehle keâjkesâ [sše keâes leeefuekeâe (Table) mes
yeeefOele keâjleer nw? Ûegvelee nw Deewj GheÙeesiekeâlee& keâes heefjCeece oslee nw leLee Fmekeâe GheÙeesie
(a) Abstraction (b) Inheritance leeefuekeâe (Table) kesâ keâe@uece, hebefòeâÙeeW Ùee efJeefMe° MeleeX kesâ DeeOeej
(c) Exception (d) Encapsulation hej [sše efvekeâeueves kesâ efueS efkeâÙee peelee nw~
Ans. (c) : Øees«eece efve<heeove kesâ oewjeve GlheVe nesves Jeeueer Gme efmLeefle 66. What is CRUD an acronym for in database
keâes pees efveoxMeeW kesâ meeceevÙe ØeJeen keâes yeeefOele keâjleer nw, pewmes efkeâ operations?
[sšeyesme mebÛeeueve ceW CRUD keâe mebef#ehle veece keäÙee nw?
MetvÙe mes Yeeie osvee, ieuele Fvehegš Ùee HeâeFue ve efceuevee ‘‘SkeämeshMeve
(a) Create, Read, Update, Delete
keânueelee nw~ (b) Cache, Read, Update, Delete
62. What is the role of a Document Type Definition (c) Copy, Replace, Update, Delete
(DTD) in XML? (d) Collect, Read, Use, Discard
XML ceW [e@keäÙetceWš šeFhe [sefHeâvesMeve (DTD) keâer keäÙee Ans. (a) : C-Create– [sšeyesme ceW veÙee [sše peesÌ[vee SQL ceW
Yetefcekeâe nw? INSERT keâLeve keâe GheÙeesie neslee nw~
(a) It defines the structure and data types of XML R–Read– [sšeyesme mes [sše Øeehle keâjvee SQL ceW SELECT keâLeve
documents. keâe GheÙeesie neslee nw~
(b) It provides a list of external resources for an U–Update– [sšeyesme ves ceewpeto [sše keâes mebMeesOeve keâjvee SQL ceW
XML document. update keâLeve keâe GheÙeesie neslee nw~
(c) It specifies the styling rules for XML
D–Delete– [sšeyesme ves ceewpeto [sše nševee SQL ceW Delete
elements.
(d) It encrypts the content of an XML document keâLeve keâe GheÙeesie neslee nw~
67. Which SQL command is used to remove a table
Ans. (a) : XML ceW [e@keäÙetceWš šeFhe [sefHeâvesMeve (DTD) keâer keäÙee
from a database?
Yetefcekeâe XML omleeJespe keâer mebjÛevee Deewj [sše keâer JewÅelee keâes [sšeyesme ceW leeefuekeâe nševes kesâ efueS efkeâme SQL keâceeb[
heefjYeeefJele keâjvee nw leLee Ùen Skeâ Øekeâej keâer mkeâerce nw pees Ùen keâe GheÙeesie efkeâÙee peelee nw?
meefveef§ele keâjlee nw efkeâ XML omleceeJespe Skeâ efveef§ele mebjÛevee Deewj (a) DELETE TABLE (b) DROP TABLE
efveÙeceeW keâe heeueve keâjlee nw~ (c) REMOVE TABLE (d) ERASE TABLE
63. What does PHP stand for? Ans. (b) : DROP TABLE keâceeb[ efkeâmeer [sšeyesme mes efveefo&°
PHP keâe keäÙee DeLe& nw? leeefuekeâe keâes hetjer lejn nše osleer nw, efpemeceW Gmekeâe [sše, mebjÛevee
(a) Personal Home Page Deewj mebyebefOele Fb[skeäme Meeefceue nesles nQ leLee nšeF& ieF& leeefuekeâe keâes
(b) Professional Hypertext Processor hegveØeeefhle (Recover) veneR efkeâÙee pee mekeâlee, peye lekeâ efkeâ [sšeyesme
(c) Preprocessed Hypertext Pages ceW yewkeâDehe Ùee š^ebpeskeäMeve uee@ie ve nes~
(d) PHP: Hypertext Preprocessor 68. The language accepted by Push down
Ans. (d) : Ùen Gme hee" keâes meboefYe&le keâjlee nw efpemecesW DevÙe hee"eW Automaton:
kesâ efuebkeâ nesles nQ, pees Deeceleewj hej Jesye heWpeeW ceW GheÙeesie neslee nw~ hegMe [eGve Dee@šescesšve Éeje mJeerke=âle Yee<ee :
ØeerØeesmesmej– Ùen oMee&lee nw efkeâ PHP keâes[ keâes keäueeFbš lekeâ Yespes (a) Recursive Language
(b) Context free language
peeves mes henues Øeesmesme keâjlee nw efpememes ieefleMeerue Jesye meecee«eer (c) Linearly Bounded language
(Dynamic Web Content) GlheVe nesleer nw~ (d) All of the mentioned
64. How do you comment a single line in PHP? Ans. (b) : PDA Skeâ ieCeveelcekeâ cee@[ue nw pees Skeâ heefjefcele
PHP ceW Skeâ hebeòf eâ keâer efšhheCeer keâwmes keâjW? Dee@šescesšve (Finite Automaton) keâes Skeâ Deefleefjòeâ cesceesjer
(a) // This is a comment @
mebjÛevee, Ùeeveer mšwkeâ (Stack) kesâ meeLe efJemleeefjle keâjlee nw leLee
(b) /* This is a comment */
(c) <!-- This is a comment --> PDA keâes Deefleefjòeâ meboYe& (Context) keâes Ùeeo jKeves keâer #ecelee
(d) ** This is a comment ** oslee nw, efpememes Ùen efveÙeefcele Yee<eeDeeW mes peefšue Yee<eeDeeW keâes mJeerkeâej
Ans. (a) : PHP ceW Skeâ hebefòeâ keâer efšhheCeer keâjves keâe celeueye nw efkeâ keâj mekeâlee nw~
Deehe keâes[ ceW Ssmeer efšhheCeer peesÌ[les nQ pees kesâJeue Skeâ hebefòeâ lekeâ 69. Which of the following is type 1 language or
meerefcele oes Deewj efpemes FbšjØesšj vepejDeboepe keâj oW~ Type 1 grammar?/efvecve ceW mes keâewve meer šeFhe 1
65. Which statement is used to retrieve data from a Yee<ee Ùee šeFve 1 JÙeekeâjCe nw?
database in SQL? (a) Regular grammar/ Regular language
SQL ceW [sšeyesme mes [sše Øeehle keâjves kesâ efueS efkeâme (b) Context Free Grammar/Context Free
keâLeve keâe GheÙeesie efkeâÙee peelee nw? language
(c) Context Sensitive Grammar/Context Sensitive
(a) SELECT (b) UPDATE
language
(c) DELETE (d) INSERT
(d) Recursively Enumerable
Bihar STET 57 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
Ans. (c) : šeFhe 1 Yee<ee Ùee šeFhe 1 JÙeekeâjCe, efpemes meboYe&-mebJesoer ● šeFhe-2 (meboYe& cegòeâ) :meboYe&–cegòeâ JÙeekeâjCe- hegMe[eGve Deešescesše
Yee<ee (Context Sensitive Language) Ùee meboYe&- mebJesoer Éeje ceevÙelee Øeehle
JÙeekeâjCe (Context Sensitive Grammar) keâne peelee nw, pees ● šeFhe-3 (efveÙeefcele):efveÙeefcele JÙeekeâjCe, HeâeFveeFš Deešescesše Éeje
ueerefveÙej JeeGb[s[ Dee@šescesšve Éeje mJeerkeâej keâer peeleer nw~ ceevÙelee Øeehle~
70. A context free grammar G is in Chomsky 73. A universal Turing machine is a
normal form if every production is of the form Skeâ Ùetevf eJeme&ue šÙetefjbie ceMeerve nw~
Skeâ meboYe& cegòeâ JÙeekeâjCe G Ûeesmkeâer meeceevÙe ™he ceW nw (a) Single tape Turing machine
Ùeefo ØelÙeskeâ Glheeove Fme ™he keâe nw~ (b) Two-tape Turing machine
(a) A → BC or A → A (b) A → BC or A → a (c) Reprogrammable Truing machine
(c) A → BCa or B → b (d) None of these (d) All of the above
Ans. (b) : keâe@šskeämš øeâer «eecej (CFG)G Ûee@mkeâer veece&ue Heâece& ÙetefveJeme&ue šŸetefjbie ceMeerve Skeâ Ssmeer ceMeerve nw pees efkeâmeer
Ans. (c) :
(CNF) ceW nesleer nw Ùeefo Fmekeâe ØelÙeskeâ Øees[keäMeve Fme ™he keâe nes~ Yeer šŸetefjbie ceMeerve kesâ keâeÙe& keâes, mener Øees«eece (Fvehegš) efceueves hej,
>A BC peneB A, B, Deewj C meYeer vee@ve-šefce&veue efmebyeue nw peyeefkeâ DevegkeâjCe keâj mekeâleer nw~ Dele: Fmes Deueie-Deueie keâeÙeeX kesâ efueS
Skeâ vee@ve-šefce&veue keâes "erkeâ oes DevÙe vee@ve- šefce&veue mes yeouee pee Øees«eece keâjles ngÙes efmebieue šshe Ùee št-šshe ceMeervees lekeâ meerefcele vener
mekeâlee nw~ jKee pee mekeâlee nw~
A a peneB A Skeâ vee@ve-šefce&veue efmebyeue nw peyeefkeâ Deewj a Skeâ 74. Turing machine can be represented using:
šefce&veue efmebyeue nw~ peyeefkeâ veeve-šefce&veue keâes "erkeâ Skeâ šefce&veue šŸet efjbie ceMeerve keâer Fme Øekeâej oMee&Ùee pee mekeâlee nw~
efmebyeue mes yeouee pee mekeâlee nw~ (a) Transition table (b) Transition diagram
(c) Instantaneous description
71. The context free grammar S → SS | 0S1 | 1S0 |
(d) All of these
ɛ generates
meboYe& cegòeâ JÙeekeâjCe S → SS | 0S1 | 1S0 | ɛ GlheVe Ans. (d) : Transition Table– Ùen Skeâ leeefuekeâe nesleer nw pees
keâjlee nw~ šŸet e f j b i e ceMeer v e kes â š^ e b e f p eMeve efv eÙeceeW keâes oMee& l eer nw, efpemeceW Jele&ceeve
(a) Equal number of 0’s and 1’s ef mLeef l e, Fveheg š Øeleer k eâ, Deieueer ef mLeef le Deeošheg š Øeleer keâ Deewj šshe ns[
(b) Unequal number of 0’s and 1’s keâer ef o Mee Meeef c eue nes l eer nw ~
(c) Any number of 0’s followed by any number Transition diagram– Ùen Skeâ «eeefheâkeâue ØeefleefveefOelJe nw efpemeceW
of 1’s vees[dme Deewj leerj (š^ebefpeMeve) šŸetefjbie ceMeerve kesâ Øeleerkeâes, uesKeve Deewj
(d) None of these ns[ keâer ieefle kesâ DeeOeej hej š^ebefpeMeve efoKeeÙes peeles nw~
Ans. (a) : JÙeekeâjCe S → SS | 0S1 | 1S0 | ɛ Instantaneous description– FbmšWšsefveÙeme ef[efm›eâhMeve šŸetefjbie
> ɛ:0 Deewj 1 keâer mebKÙee = 0 (yejeyej)~ ceMeerve keâer efkeâmeer efJeMes<e meceÙe hej efmLeefle keâes oMee&lee nw, efpemeceW
> 0S1: 01 (0 0, S1 1) Skeâ 0, Skeâ 1 (yejeyej)~ Jele&ceeve efmLeefle, šshe keâer meece«eer Deewj šshe ns[ keâer efmLeefle Meeefceue
> 1S0: Skeâ 0, Skeâ 1 (S šefce&veue nw, efieveleer ceW veneR) (yejeyej)~ nesleer nw~
> SS: ØelÙeskeâ S → S ɛ , 0S1 Ùee 1S0 nes mekeâlee nw efoÙes ieÙes 75. Maximum read range of RFID module is?
efJekeâuheeW ceW:- RFID cee@[Ÿetue keâer DeefOekeâlece jer[ jWpe keäÙee nw?
> (A) 0: Deewj 1 keâer yejeyej mebKÙee: meYeer efmš^bime (ɛ , 01, 1S0, S (a) 10 CM (b) 5 CM
S ) ceW 0 Deewj 1 yejeyej (c) 15 CM (d) 2 CM
> (B) Demeceeve mebKÙee : keâesF& efmš^bie Ssmeer veneR Ans. (b) : RFID cee@[Ÿetue keâer DeefOekeâlece jer[ jWpe keâF& keâejkeâeW hej
> (C) keâesF& mebKÙee 0 kesâ yeeo 1 kesâJeue 01 Ùee 1S0 yevelee nw~ efveYe&j keâjleer nw, RFID efmemšce keâe Øekeâej (uees-efØeâkeäJeWMeer, neF&
> (D) keâesF& veneR eføeâkeäJeWMeer, Ùee Deuš^e neF& eføeâkeäJeWMeer) nesleer nw pees keâer Ùen (hewefmeJe Ùee
(A) 0: Deewj 1 keâer yejeyej mebKÙee SefkeäšJe), jer[j keâer Meefòeâ, Sšervee ef[peeFve Deewj heÙee&JejCeerÙe efmLeefle
72. According to Chomsky hierarchy, which of the nes leer nw~
following is recognized by Recursively (i) uees eføeâkeäJeWMeer (LF) RFID (125-134 KHz)– DeefOekeâlece
Enumerable language? jer[ jWpe Deeceleewj hej 5-10 mesšerceeršj neF&-heeJej jer[j keâer meeLe Ùen
Ûee@mkeâer heoeveg›eâce kesâ Devegmeej efvecveefueefKele ceW mes efkeâmes 80 meWšerceeršj lekeâ nes mekeâleer nw~
efjkeâefme&Jeueer SvÙetcesjsyeue Yee<ee Éeje ceevÙelee Øeehle nw~ GheÙeebie- heMeg š^sefvebie, Skeämesme kebâš^esue
(a) Type 0 (b) Type 1
(ii) neF& eføeâkeäJeWMeer (HF) RFID (13.56 MHz)– DeefOekeâlece
(c) Type 2 (d) Type 3
Ans. (a) : Ûee@mkeâer heoeveg›eâce kesâ Devegmeej efjkeâefme&Jeueer SvÙetcesjsyeue
jer [ jWpe Deeceleewj hej 10 mesšer. ceeršj mes 1 ceeršj~
Yee<eeÙes šeFhe-0 Yee<eeÙes nQ~ GheÙeesie- mcee[& keâe[&, ueeFyeÇsjer cewvespeceWš, NFC DevegØeÙeesie
● šeFhe-0 (efjkeâefme&Jeueer SvÙetcesjsyeue): Ssmeer Yee<eeÙes efpevnW šÙetefjbie (iii) Deuš^e - neF& eføeâkeäJeWMeer (UHF) RFID (860 - 960
ceMeerve mJeerkeâej keâj mekeâleer nw~ MHz)– DeefOekeâlece jer[ jWpe 12-16 ceer. lekeâ, 4 - Jeeš jer[j
● šeFhe-1 (meboYe& mebJesoer) meboYe&–mebJesoer JÙeekeâjCe, ueerefveÙej- yeeGb[s[ Deewj neF Sbšervee kesâ meeLe~
Dee@šescesše Éeje ceevÙelee Øeehle GheÙeesie- FvJeWš^er cewvespeceWš, ueeefpeefmškeâ, Spesš š^wefvebie~

Bihar STET 58 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
76. Which ZigBee device is used to transfer data (a)
Clustering
between ZigBee devices?/Zigbee GhekeâjCeeW kesâ (b)
Software agents
yeerÛe [sše mLeeveebleefjle keâjves kesâ efueS efkeâme Zigbee (c)
Synchronization techniques
(d)
Cluster, Software agent, and Synchronization
ef[JeeFme keâe GheÙeesie efkeâÙee peelee nw? techniques
(a) Zigbee Coordinator device Ans. (d) : IoT mebmeeOevees kesâ ØeyebOeve keâer ÛegveewefleÙeeW keâes nue keâjves
(b) Zigbee Router
kesâ efueÙes keâuemšefjbie, mee@heäšJesÙej Spesvš Deewj mecekeâeefuekeâjCe
(c) Zigbee start devce
lekeâveerkeâeW keâe GheÙeesie efkeâÙee peelee nw~
(d) Zigbee end devce
81. What is the frame?
Ans. (b) : Zigbee jeGšj vesšJeke&â ceW [sše keâes DevÙe GhekeâjCeeW øesâce keäÙee nw?
(jeGšme&, Sb[ ef[JeeFme, Ùee keâes Dee@ef[&vesšj) kesâ yeerÛe efjues keâjlee nw~
(a) Data type (b) Data Structure
Zigbee keâer cesMe vesšJeke&â šesheesuee@peer ceW, jeGšme& [sše keâer Skeâ (c) A way of representing knowledge
GhekeâjCe mes otmejs lekeâ heeme keâjkesâ vesšJeke&â keâer jWpe keâes yeÌ{eles ngÙes
(d) None of the above
[sše mLeeveeblejCe kesâ efueS ØeeLeefcekeâ GhekeâjCe keâjlee nw~ (c) : øesâce Skeâ AI (ArtiDicial intelligence) Deewj
Ans.
77. The Internet of Things (IoT), access to real- knowlege Representation keâer lekeâveerkeâ nw, Fmekeâe GheÙeesie
time data, and the introduction of cyber- efkeâmeer Jemleg, Iešvee Ùee efmLeefle keâer peevekeâejer keâes Skeâ mebieef"le ™he ceW
physical systems mark the big changes for this oMee&ves kesâ efueÙes efkeâÙee peelee nw~
era./Fbšjvesš Deeheâ efLebime (IoT), JeemleefJekeâ meceÙe kesâ 82. What is hyponymy relation?
[sše lekeâ hengBÛe Deewj meeFyej Yeeweflekeâ ØeCeeefueÙeeW keâer neFheesveerceer mebyebOe keäÙee nw?
Meg™Deele Fme Ùegie kesâ efueS yeÌ[s yeoueeJees keâes efÛeefvnle (a) A is part of B
keâjleer nw~ (b) B has A as a part of itself
(c) A is subordinate of B
(a) Industrial Revolution
(d) A is superordinate of B
(b) 3rd Industrial Revolution
(c) Industry 4.0 Ans. (c) : neFheesefveceer Skeâ MeyoeJeueer mebyebOe nw, efpemeceW Skeâ Meyo
(d) Manufacturing automation (neFheesefvece, A) otmejs Meyo (neFheesefvece, B) kesâ Deleie&le Deelee nw,
Ans. (c) : Fb[mš^er 4.0 ÛeewLeer DeewÅeesefiekeâ ›eâebefle, IoT, meeFyej Yeeweflekeâ Fmekeâe ef J eef M e° ™he nes l es ng
Ù es Skeâ Ghe-ßes C eer Ùee DeOeervemle (Subor
dinate) neslee nw~
ØeCeeefueÙeeW, ke=âef$ece yegefæceòee Deewj JeemleefJekeâ meceÙe [sše kesâ efJeMues<eCe hej
DeeOeeefjle nw leLee mceeš& hewâefkeäš^ÙeeW hejmhej pegÌ[s GhekeâjCeeW Deewj [sše-Ûeefuele 83. Which among the following is/are the best
example of semantic networks?
Éeje keâLeve kesâ meeLe hetjer lejn cesue Keelee nw~ efvecveefueefKele ceW mes keâewve-mee/mes MeyoeLe& meceerkeâjCe keâe
78. The default baud rate of Modbus RTU is? meyemes DeÛÚe GoenjCe nw?
cees[yeme DeejšerÙet keâer ef[heâe@uš yeeB[ oj keäÙee nw? (a) WorldNet
(a) 9600 (b) 19200 (b) Human Food Chain
(c) 38400 (d) 57600 (c) MYSIN
Ans. (b) : Modbus RTU (Remote Terminal Unit) (d) Autonomous car driver
ef[he@âeuš yeeB[ jsš 19200 efyešdme Øeefle meskesâC[ nw Jees ieefle Deewj Ans. (a) : Ùen Skeâ yesefkeämeskeâue [sšeyesme nw pees Meyoes kesâ DeLe&,
efJeÕemeveerÙelee kesâ yeerÛe meblegueve Øeoeve keâjlee nw~ Gvekesâ mebyebOe (synonym, antonym, hyponym) keâes oMee&lee nw~
79. __________ is an online storage drive which efpememes DeLe& mes mebyebefOele mebjÛevee hej DeeOeeefjle word net meyemes
can be browsed and from which items can be GheÙegòeâ GoenjCe nw~
shared?/Skeâ Dee@veueeFve mšesjspe [^eFJe nw efpemes yeÇeGpe 84. The “Turing Machine” showed that you could
efkeâÙee pee mekeâlee nw Deewj efkeâme DeeFšce kesâ meeLe mee#ee use a/an _____ system to program any
algorithmic task.
efkeâÙee pee mekeâlee nw? šŸetefjbie ceMeerve ves Ùen oMee&Ùee efkeâ efkeâmeer Yeer
(a) Find my iPhone (b) iWeb Publish SuieesefjLeefcekeâ keâeÙe& keâes Øees«eece keâjves kesâ efueÙes efkeâme
(c) Mobile Me Gallery (d) iDesk
Øekeâej keâer ØeCeeueer keâe GheÙeesie efkeâÙee pee mekeâlee nw~
Ans. (d) : iDesk Skeâ Dee@veueeFve mšesjspe mesJee nw, pees Apple (a) Binary (b) Electro-chemical
keâer Mac Deewj Mobile me mesJeeDeeW keâe Dee@veueeFve mšesjspe kesâ ™he (c) Recursive (d) Semantic
keâeÙe& efkeâÙee~ efpemes yeÇeGpe keâjkesâ heâeFue keâes MesÙej efkeâÙee pee mekeâlee nw~ Ans. (a) : šŸetefjbie ceMeerve
Skeâ mewÉebeflekeâ ieefCeleerÙe cee@[ue nw, pees
80. _________ are used to overcome the challenges efkeâmeer Yeer SuieesefjLece keâeÙe& keâes yeeFvejer efmemšce (0 Deewj 1 kesâ
of managing the resources of the IoT. ØeleerkeâeW) GheÙeesie keâjkesâ Øees«eece keâes efkeâÙee pee mekeâlee nw~ leLee ceMeerve
mebmeeOevees kesâ ØeyebOeve keâer ÛegveewefleÙeeW hej keâeyet heeves kesâ Skeâ šshe hej yeeFvejer Debkeâes heÌ{leer Deewj efmeKeleer nw, efpememes peefšue
efueS efkeâmekeâe GheÙeesie efkeâÙee peelee nw~ ieCeveeÙes mebYeJe nesleer nw~
Bihar STET 59 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
85. Which of the following is not a Characteristics 89. Public key cryptography is also known as
of Expert Systems?/efvecveefueefKele ceW mes keâewve-meer ‐‐‐‐‐‐cryptography./Public key cryptography keâes
efJeMes<elee efJeMes<e%e ØeCeeefueÙeeW keâer veneR nw? efkeâme Øekeâej keâer cryptography keâne peelee nw~
(a) Understandable /mecePeves ÙeesiÙe (a) Private key (b) Symetric
(b) Highly responsive/DelÙeefOekeâ Øeefleef›eâÙeeMeerue (c) Asymetric (d) None of the above
(c) Unreliable/DeefJeÕemeveerÙe Ans. (c) : heefyuekeâ ‘keâer’ ef›eâhšes«eeheâer keâes Demeceefcele ef›eâhšes«eeheâer
(d) High performance/GÛÛe ØeoMe&ve (Asymmetric cryptography) kesâ ™he ceW peevee peelee nw, FmeceW
Ans. (c) : efJeMes<eCe ØeCeeefueÙeeB Ssmeer ØeCeeefueÙeeB nw pees efJeMes<eCe mlej
oes Deueie-Deueie kegbâefpeÙeeW heefyuekeâ keâer (meeJe&peefvekeâ kebgâpeer) pees [sše
keâer efveCe&Ùe uesves kesâ #ecelee Øeoeve keâjleer nw, pees mecePeves ÙeesiÙe, keâes Sefv›eâhš keâjves kesâ efueÙes Deewj otmejer ØeeFJesš keâer (efvepeer kebgâpeer) pees
DelÙeefOekeâ Øeefleef›eâÙeeMeerue Deewj GÛÛe ØeoMe&ve nes leLee DeefJeÕemeveerÙe [sše keâes ef[ef›eâhš keâjves kesâ efueÙes GheÙeesie keâer peeleer nw~
Fvekeâer efJeMes<elee vener nw, keäÙeesbefkeâ efJeMes<eCe ØeCeeefueÙeeB efJeÕemeveerÙelee 90. Which one is not a physical threat
Deewj mešerkeâlee kesâ efueÙes ef[peeFve keâer peeleer nw~ efvecveefueefKele ceW mes keâewve-mee Skeâ Yeeweflekeâ (Physical)
86. Which of the following is Capabilities of Expert
Keleje vener nw?
Systems?/efvecveefueefKele ceW mes keâewve-meer Expert (a) Hacking (b) Storm
(c) Fire (d) Flood
System keâer #ecelee nw?
Ans. (a) : Ùen Skeâ Yeeweflekeâ Keleje vener nw, keäÙeesefkeâ nwefkebâie Skeâ
(a) Possessing human capabilities
meeFyej Keleje (Cyber threat) nw, pees mee@heäšJesÙej Ùee vesšJeke&â kesâ
(b) Suggesting alternative options to a problem
(c) Refining their own knowledge
ceeOÙece mes [sše keâes ØeYeeefJele keâjlee nw ve efkeâ Yeeweflekeâ ™he mes
(d) Substituting human decision makers FmeefueÙes, nwefkebâie Yeeweflekeâ Kejlee vener nw~
Ans. (b) : Expert System efkeâmeer mecemÙee kesâ efueÙes efJekeâuhe 91. Which one is a communication channel security
protocol?/efvecveefueefKele ceW mes keâewve-mee Skeâ mebÛeej
meguePeeves keâer #ecelee jKeleer nw~ Ùen GheÙeesiekeâlee& keâes efJeefYeVe mebYeeefJele
Ûewveue megj#ee Øeesšeskeâe@ue nw?
meceeOeeve oskeâj efveCe&Ùe ceW meneÙelee keâjleer nw~
(a) SSL (b) SET
87. What is the full form of JESS in Expert System (c) S-HTTP (d) All of the above
Technology?/Expert System Techology ceW JESS
Ans. (d) : SSL (Secure Sockets Layer)– Ùen Skeâ megj#ee
keâe hetje veece keäÙee nw? Øeesšeskeâe@ue nw pees Jesye meJe&j Deewj yeÇeopej kesâ yeerÛe Skeâ megjef#ele Deewj
(a) Java Expert System Shell Sefv›eâhšs[ keâveskeäMeve yeveelee nw~ Fmekeâe GheÙeesie cegKÙe ™he mes
(b) Javascript Expert System Shell HTTPs ceW neslee nw~
(c) Java Expert Sub System
SET (Secure Electronic Transaction)– Ùen ›esâef[š keâe[&
(d) Javascript Expert Sub System
mes Dee@veueeFve uesve-osve keâes megjef#ele keâjves kesâ efueÙes Visa Deewj
Ans. (a) : JESS (Java Expert System Shell) Skeâ efJeMes<e%e ØeCeeueer
Mastercard Éeje efJekeâefmele efkeâÙee ieÙee Lee~
(Expert System) keâes efJekeâefmele keâjves kesâ efueÙes GheÙeesie efkeâÙee peeves Jeeuee
S.HTTP (Secure Hyper Text Transfer)- Ùen Skeâ
Øees«eeefcebie štue nw, pees veÙee Øees«eeefcebie Yee<ee hej DeeOeeefjle nw Deewj peefšue Øeesšeskeâe@ue nw pees Fbšjvesš hej Yespes peeves Jeeues nj Skeâ HTTP mebosMe
mecemÙeeDeeW keâes nue keâjves kesâ efueÙes GheÙeesie efkeâÙee peelee nw~ keâes Sefv›eâhš keâjlee nw~ Ùen HTTPS keâe Skeâ efJekeâuhe Lee~
88. During E‐commerce transaction we should 92. Which one is used toidentify mobile money
ensure‐‐‐‐‐‐/E- commerce uesveosve kesâ oewjeve nceW ceesyeeFue ceveer keâer henÛeeve kesâ efueÙes efvecveefueefKele ceW mes
keäÙee megefveef§ele keâjvee ÛeeefnÙes? efkeâmekeâe GheÙeesie efkeâÙee peelee nw?
(a) Integrity (b) Confidentiality (a) MCID (b) MMID
(c) Security (d) All of the above (c) RSID (d) None of the above
Ans. (d) : (i) Integrity (DeKeb[lee) Ans. (b) : MMID (Mobile money Identifier) Ùen Skeâ 7
● Ùen megefveef§ele keâjlee nw efkeâ [sše keâes š^ebpewkeäMeve kesâ oewjeve yeouee Debkeâes keâer efJeMes<e mebKÙee nesleer nw, efpemes yeQkeâ Éeje «eenkeâ keâes ceesyeeFue
vener ieÙee nw~ yewefkebâie uesve-osve kesâ efueÙes peejer efkeâÙee peelee nw~ efpemekeâer ceoo mes keâesF&
(ii) Confidentiality (ieesheveerÙelee) Yeer JÙeefòeâ kesâJeue ceesyeeFue vebyej Deewj MMID keâe GheÙeesie keâjkesâ
● «eenkeâes keâer efvepeer peevekeâejer (›esâef[š keâe[&, heemeJe[& Deeefo) hewmee Yespe Ùee Øeehle keâj mekeâlee nw~
93. Unclassified email is called?
megjef#ele Deewj efvepeer jnveer ÛeeefnÙes~
DeJeCeeake=âle (unclassified) F&cesue keâes keäÙee keâne peelee
(iii) Security (megj#ee)
nw?
● meYeer [sše Deewj š^epewkeäMeve keâes nwefkebâie, Ûeesjer Deewj DevÙe meeFyej (a) Extra mail (b) Spam
Kelejes mes megjef#ele jKevee pe™jer nw~ (c) Junk mail (d) None of the above

Bihar STET 60 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
Ans. (c): Ssmes F&cesue pees DeveÛeens, efyevee ßesCeeryeæ GheÙeesie kesâ nesles 97. Which of the following is the next step in image
nw, Gvns Deeceleewj hej pebkeâ cesue keâneB peelee nw~ Ùes F&cesue Dekeämej processing after compression?
efJe%eeheve, ØeceesMeve, Ùee De%eele œeeslees mes Deeles nw~ kebâØesMeve kesâ yeeo Øeesmesemf ebie keâe Deieuee ÛejCe efvecve ces mes
keâewve-mee nw?
94. _____ refers to simulated motion pictures
showing movement of drawn objects. (a) Representation and description
[^e@ keâer ieF& JemlegDeeW keâer ieefle keâes efoKeeves Jeeueer ke=âef$ece (b) Morphological processing
(c) Segmentation
ÛeueefÛe$eeW keâes keäÙee keâne peelee nw? (d) Wavelets
(a) Motion (b) Animation
Ans. (b) : ef[efpešue Fcespe Øeesmesefmebie ceW, meheerÌ[ve
(c) VR (d) SMD
(Compression) kesâ yeeo Deieuee ÛejCe Deeceleewj hej ØeefOeefveefOelJe
Ans. (b) : SefvecesMeve Jen Øeef›eâÙee nw efpemeceW efÛeef$ele Ùee ef[efpešue
Deesj JeCe&ve (Representation and description) neslee nw, uesefkeâve
™he mes yeveeÙes ieÙes JemlegDeeW keâer ieefle keâes DevegkeâjCe (simulate)
cee@heâe&suee@efpekeâue Øeesmesefmebie ÚefJe kesâ Deekeâej Deewj mebjÛevee keâes efJeMuesef<ele
keâjkesâ ieefleMeerue efÛe$e (Motion pictures) yeveeÙes peeles nw~ pees ieefle
keâjves kesâ efueÙes GheÙeesieer nw~ pees mebheer[Ì ve kesâ legjble yeeo keâe ÛejCe ve
keâe DeeYeeme osles nw~ neskeâj ÛejCe Deeceleewj hej efmebieceWšMeve Ùee DevÙe Øeesmesefmebie kesâ yeeo
95. Which of the following is an example of Digital Deelee nw~
Image Processing?
efvecveefueefKele ceW mes keâewve-mee ef[efpešue Fcesue Øeesmesefmebie 98. Which of the following is the abbreviation of
JPEG?
keâe Skeâ GoenjCe nw? efvecveefueefKele ceW mes JPEG keâe mebef#ehle ™he keäÙee nw?
(a) Computer Graphics
(a) Joint Photographic Experts Group
(b) Pixels (b) Joint Photographs Expansion Group
(c) Camera Mechanism (c) Joint Photographic Expanded Group
(d) All of the mentioned (d) Joint Photographic Expansion Group
Ans. (d) :
Ans. (a) : JPEG keâe hetje veece (Joint Photographic Experts
(i) Computer Graphics (keâchÙetšj «eeefheâkeäme) Ùen ef[efpešue
Group) nw, efpemeves ef[efpešue Fcespe keâes kebâØesme keâjves kesâ efueÙes mšw[b[&
Fcespe Øeesmesefmebie keâe efnmmee nes mekeâlee nw, keäÙeeWefkeâ Ùen ÚefJeÙeeW keâes efJekeâefmele efkeâÙee Lee~ leLee JPEG heâe@cexš keâe GheÙeesie Fcespe heâeFueeW
yeveeves Deewj nsjhesâj keâjves mes mebyebefOele nw~ keâes Úesšs Deekeâej ceW mesJe keâjves kesâ efueÙes efkeâÙee peelee nw~
(ii) Pixels (efhekeämeume)– ef[efpešue ÚefJeÙeeB efhekeämeue mes yeveer
99. Which gray-level transformation increases the
nesleer nw, Deewj Fcespe Øeesmesefmebie ceW efhekeämeue mlejerÙe nsjhesâj Meeefceue neslee dynamic range of gray-level in the image?
nw~ efvecve ceW mes keâewve-mee «es-uesyeue š^ebmeheâeceW&Meve (Gray -
(iii) Camera Mechanism (kewâceje leb$e)– kewâcejs ef[efpešue Level Transformation) Fcespe ceW «es-uesJeue keâer
ÚefJeÙeeB kewâhÛej keâjles nw, Deewj Fve ÚefJeÙeeW keâes Øeesmesme keâjves kesâ efueÙes [eÙeveeefceue jWpe keâe yeÌ{elee nw?
ef[efpešue Fcespe Øeesmesefmebie lekeâveerkeâeW keâe GheÙeesie efkeâÙee peelee nw~ (a) Negative transformations
96. The aliasing effect on an image can be reduced (b) Contrast stretching
using which of the following methods? (c) Power-law transformations
Skeâ F&cespe hej FefueÙeeefmebie ØeYeeJe keâes efvecveefueefKele ceW mes (d) None of the mentioned
efkeâme efJeefOe mes keâce efkeâÙee pee mekeâlee nw? Ans. (b) : Contrast stretching Skeâ Ssmeer
lekeâveerkeâ nw, pees
(a) By reducing the high-frequency components efhekeämesue JewyÙetpe henues Skeâ Úesšs jWpe ceW efmecešer nesleer Leer, Gvns hetjs
of image by clarifying the image jWpe (0 mes 255) ceW hewâueeles ngÙes Fcespe keâe keâe@vš^emš yesnlej Deewj
(b) By increasing the high-frequency components ef[šsume meeheâ efoKeeF& osles nw~
of image by clarifying the image 100. Multimedia is widely used to add special_____
(c) By increasing the high-frequency components to movies
of image by blurring the image ceušerceeref[Ùee keâe JÙeehekeâ ™he mes GheÙeesie efheâuceeW ceW
(d) By reducing the high-frequency components efJeMes<e-peesÌ[ves kesâ efueÙes efkeâÙee peelee nww~
of image by blurring the image
(a) Arrangement (b) Attachment
Ans. (d) : Aliasing leye neslee nw peye Skeâ Fcespe ceW yengle pÙeeoe (c) Effects (d) Control
neF&-efØeâkeäJeWmeer ef[šsume nesles nw Deewj Gmes efj»eesyÙetMeve hej Ùee efyevee Ans. (c) : Multi media keâe GheÙeesie efheâuceeW ceW visual effects,
mener efheâušj kesâ efoKeeÙee peelee nw~ leye Fmes keâce keâjves kesâ efueÙes nce sound effects, animation Deeefo efJeMes<e ØeYeeJe (special
yueefjbie (Blurring) lekeâveerkeâ keâe GheÙeesie keâjkesâ Fcespe keâer neF&- effect) peesÌ[ves kesâ efueÙes efkeâÙee peelee nw~ leeefkeâ Fmemes ÂMÙe Deewj
efØeâkeäJeWMeer IeškeâeW keâes keâce keâj mekeâles nw~ ßeuÙe DevegYeJe yesnlej neskeâj efheâuces DeefOekeâ Deekeâ<e&keâ yeveleer nw~
Bihar STET 61 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
 efyenej efJeÅeeueÙe hejer#ee meefceefle
ceeOÙeefcekeâ efMe#ekeâ hee$elee hejer#ee Bihar STET
keâchÙetšj
[Exam. Date - 18.09.2020 (Shift-I)]
51. Computer is a/an ………… Ans. (c) : Fvehegš ef[JeeFme Jes nesles nQ efpevekeâer ceoo ceW nce kebâhÙetšj
keâchÙetšj Skeâ ................ keâes [sše Ùee efveoxMe osles nw~ Deepe kesâ meceÙe ceW keâeryees[& meyemes meeceevÙe
(a) Electrical device Deewj yengØeÙegòeâ Fvehegš ef[JeeFme nw keäÙeeWefkeâ Fmekeâer GheÙeesie šskeämš
(b) Electronic device šeFhe keâjves, Mee@š&keâš Ûeueeves Deeefo kesâ efueS efkeâÙee peelee nw~
(c) Mechanical device 56. Which of the following is a part of the Central
(d) Electro/Mechanical device Processing unit?
Ans. (b) : kebâchÙešj Skeâ Fueskeäš^e@efvekeâ ef[JeeFme nw pees [eše keâes FveceW mes keâewve CPU keâe Yeeie nw?
Øeesmesme keâjlee nw Deewj efoS ieS efveoxMeeW kesâ Devegmeej keâeÙe& keâjlee nw~ (a) Mouse (b) ALU
Ùen efJeÅegle (Eletricity) keâe GheÙeesie keâjkesâ ieCeveeSB Deewj leke&â (c) Keyboard (d) Printer
DeeOeeefjle keâeÙe& keâjlee nw~ Ans. (b) : meWš^ue Øeesmesefmebie Ùetefveš (CPU) kebâhÙetšj keâe ‘‘ceefmle<keâ’’
52. …………is the brain of computer. nselee nw~ Arithmetic logic Unit (ALU) CPU keâe Skeâ cegKÙe
…………kebâhÙetšj keâe ceefmle<keâ nw~ efnmmee neslee nw pees DeLe&cesefškeâue Deewj uee@efpekeâue ef›eâÙeebS keâjlee nw~
(a) CPU (b) Memory 57. Which of the following is an example of non-
(c) VDU (d) Keyboard volatile memory?
Ans. (a) : meWš^ue Øeesmesefmebie Ùetefveš (CPU) keâes kebâhÙetšj keâe
FveceW mes keâewve keâe Non-volatile memory GoenjCe nw?
ceefmle<keâ) keâne peelee nw~ keäÙeeWefkeâ Ùen meYeer ieCeveeS keâjlee nw Deewj (a) RAM (b) LSI
(c) ROM (d) VLSI
keâchÙetšj kesâ meYeer keâeÙeeX keâes efveÙebef$ele keâjlee nw~
Ans. (c) : Non-valatile memory Jen nesleer nw pees keâchÙetšj yebo
53. VGA stand for?
nes peeves hej Yeer [sše mesJe jKeleer nw~ ROM (Read only
VGA keâe DeLe& nw?
memory) ceW [eše mLeeÙeer ™he mes mšesj jnlee nw Fme efueS Ùen
(a) Video Guard Ample
Non-volatile kesâ Devle&iele Deeleer nw peyeefkeâ RAM Skeâ
(b) Visual Gate Adapter
JeesueešeFue cesceesjer nw efpemekeâe [eše keâchÙetšj yevo nesves hej uee@me nes
(c) Video Graphics Array
(d) Visual Game Adapter
peelee nw~
Large computer system typically use…………
Ans. (c) : VGA keâe hegâueheâece& Video Graphics Array neslee 58.
yeÌ[e kebâhÙetšj efmemšce …………GheÙeesie keâjlee nw~
nw~ Ùen Skeâ Øekeâej keâe ef[mheues mšQ[[& nw efpemekeâe Fmlesceeue kebâhÙetšj
(a) Line Printer
cee@efvešj Deewj Øeespeskeäšj keâes keâveskeäš keâjves kesâ efueS efkeâÙee peelee nw~
(b) Ink jet printer
54. Computer cannot function without a? (c) Dot-metric printers
kebâhÙetšj…………kesâ efyevee kegâÚ veneR keâj mekeâlee nw~ (d) Daisy wheel printers
(a) Paper (b) Cable Ans. (a) : yeÌ[s keâchÙetšj efmemšce pewmes efkeâ cesveøesâce Ùee meJe&j
(c) Battery (d) Program efmemšce, yengle lespe Deewj yeÌ[s hewceeves hej efØebefšbie kesâ efueS Line
Ans. (d) : kebâhÙetšj keâes efkeâmeer Yeer keâeÙe& keâes keâjves kesâ efueS Øees«eece Printer keâe GheÙeesie keâjles nw~
keâer DeeJeMÙekeâlee nesleer nw~ Øees«eece efveoxMeeW keâe Skeâ mecetn neslee nw pees 59. 1 Byte carry …………Bits
kebâhÙetšj keâes yeleelee nw efkeâ keäÙee keâjvee nw~ Fmekesâ efyevee kebâhÙetšj kegâÚ 1 yeeF&š …………ceW efyešdme neslee nw?
vener keâj mekeâlee nw~ (a) 8 (b) 16
55. The most common input device used today is? (c) 10 (d) 1024
Deepe kesâ meceÙe keâe meJee&efOekeâ GheÙeesieer Input Ans. (a) : ef[efpešue [eše keâer meyemes Úesšer FkeâeF& bit (binary digit)
Device nw~ nesleer nw, 1 Byte ceW kegâue 8 bits nesles nw~ Bit keâchÙetšj keâer meyemes Úesšer
(a) Mouse (b) ALU FkeâeF& nw efkeâmeer Yeer efyeš keâer kesâJeue oes ner mebYeJe efmLeefleÙeeb nesleer nw 0 Ùee
(c) Keyboard (d) Printer 1, 0 DeLee&led yevo leLee 1 Ûeeuet~ Byte Dee" efyešdme (bits) keâe Skeâ

Bihar STET 62 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
mecetn neslee nw Ùen Skeâ yeÌ[s [sše yuee@keâ keâer FkeâeF& nw efpemekeâe GheÙeesie Ans. (d): [eše Øeesmesefmebie kesâ efueS pees efveoxMeeW (statements) keâe
meeceevÙele: kewâjskeäšj keâes mšesj keâjves kesâ efueS neslee nw~ A kewâjskeäšj keâes mecetn neslee nw, Gmes Øees«eece keâne peelee nw~ Ùes efveoxMe keâchÙetšj keâes
mšesj keâjves kesâ efueS 1 Byte keâe GheÙeesie neslee nw~ yeleeles nW efkeâ keäÙee keâjvee nw Deewj kewâmes keâjvee nw~
60. Which of the following computer is least 64. An operating system is system software that
powerful? works as an interface between the computer
FveceW mes keâewve meyemes vÙetvelece #ecelee keâchÙetšj nw? and an user, it does the following works?
(a) Super Computer Operating system, user Deewj kebâhÙetšj kesâ yeerÛe keâe
(b) Mini Computer ceeOÙece neslee nw, Deewj Ùen efvecve keâeÙe& keâjlee nw?
(c) Micro Computer (a) Controls input & output
(d) Mainframe Computer (b) Control program execution
Ans. (c) : keâchÙetšj keâer #ecelee kesâ DeeOeej hej Gvns efJeefYeVe ßesefCeÙeeW (c) Manages use of main memory
(d) All of the above
ceW yeeBše ieÙee nw-
Ans. (d) : Dee@hejsefšbie efmemšce efvecve meYeer keâeÙe& keâjlee nw~
(i) Super computer- meyemes MeefòeâMeeueer, peefšue ieCeveeDeeW Deewj
Input Deewj Output devices keâes efveÙebef$ele keâjlee nw~
Jew%eeefvekeâ ØeÙeesieeW ceW GheÙeesie neslee nw~
Program kesâ execution keâes efveÙebef$ele keâjlee nw~
(ii) Main frame computer- yeÌ[s-yeÌ[s mebmLeeveeW, yeQkeâes Deeefo ceW
Skeâ meeLe keâF& Ùetpeme& keâes nw[ue keâjves kesâ efueS~ cegKÙe cesceesjer (RAM) keâe ØeyebOeve keâjlee nw~
(iii) Minicomputer- Main frame mes Úesše uesefkeâve keâF& Ùetpeme& 65. Paintbrush belongs to?
Paint Brush mecyeefvOele nw?
kesâ efueS me#ece~
(a) Main Group (b) Application Group
(iv) Micro computer- meyemes Úesše Deewj keâcepeesj, Deeceleewj hej
(c) Accessories Group (d) Startup Group
heme&veue keâchÙetšj (PC)~
Ans. (c) : Paint Brush Skeâ «eeefheâkeâue Øees«eece nw pees efJeC[espe
61. An Application package is used to? Dee@hejsefšbie efmemšce ceW "Accessories" «eghe kesâ Devleie&le Deelee nw~
Skeâ Application Package keâe GheÙeesie neslee nw? "Accessories" ceW Úesšs GheÙeesieer štue nesles nQ
(a) Run the computer system smoothly
pewmes- Calculatar
(b) Run the compiler in a better way
Notepad
(c) Meet the specific needs of a user
Paint (Paint Brush)
(d) Enable operating system to control hardware
Word Pad Deeefo~
Ans. (c) : Application package Jes mee@heäšJesÙej ns pees efkeâmeer
66. WINDOWS is popular because of its?
Ùetpej keâer efJeefMe° pe™jleeW keâes hetje keâjves kesâ efueS yeveeS peeles nQ- Windows keâer ueeskeâefØeÙelee keâe keâejCe nw?
GoenjCe- MS word [e@keäÙetceWš efueKeveW kesâ efueS MS Excel [sše (a) GUI feature (b) Multi color
efJeMues<eCe Deewj efjheesš& yeveeves kesâ efueS, Tally DekeâeGefšbie kesâ efueS~ (c) Desktop technology (d) Being inexpensive
62. Which of the following is not a programming Ans. (a) : Windows keâer ueeskeâefØeÙelee keâe cegKÙe keâejCe Fmekeâe
language? GUI (Graphical User Interface) nw GUI Ùetpej keâes ceeGme mes
FveceW mes keâewve Programming language veneR nw? «eeefheâkeâue DeeFkeâve Deewj efJeb[es kesâ peefjS keâece keâjves keâer megefJeOee oslee
(a) UNIX (b) C nw, efpememes Ùen Deemeeve Deewj Ùetpej øesâv[ueer yevelee nw~
(c) Fourth (d) Ada
67. Windows 10 professional has new improved
Ans. (a) : Unix: Ùen Skeâ Operating system (OS) nw~ interface which is?
C: Ùen Skeâ Øeefmeæ Øees«eeefcebie Yee<ee nw~ Windows 10 professional ceW veÙee improved
Fourth : Ùen Fourth Generaltion Language keâe efnmmee nw, interface nw?
Øees«eeefcebie mes mecyeefOele nw~ (a) Easier and simpler interface
Ada: Ùen Skeâ Øees«eeefcebie Yee<ee nw efpemes efJeMes<e ™he mes j#ee Deewj (b) Built in internet explorer
efceMeve- ef›eâefškeâue efmemšce kesâ efueS efJekeâefmele efkeâÙee ieÙee nw~ (c) Support of online website
veesš– DeeÙeesie ves Fme ØeMve keâe Gòej (b) ceevee nw~ (d) All of the above
Ans. (d) : Windows 10 professional ceW keâF& megOeej efkeâS ieS
63. A Series of statement explaining how the data
is to be processed is called. nQ pewmes-
Data Processing kesâ efueS Statement keâe mecetn keâes  mejue Deewj GheÙeesie ceW Deemeeve Fbšjhesâme
keânles nw?  henues mes ceewpeto Internet Explarer Deewj Deye Microsoft
(a) Editing (b) Compiler Edge.
(c) Interpreter (d) Program  Dee@veueeFve JesyemeeFš Deewj keäueeG[ megefJeOeeDeeW keâe meceLe&ve~
Bihar STET 63 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
68. Small symbols or pictures used to represent .exe.executable Øees«eece heâeFue nesleer nw~
programs, files, disks is called? .Txt - Notepad pewmeer meeceevÙe šskeämš heâeFue keâe SkeämešWMeve nw~
Program files & disks kesâ Øemlegefle kesâ efueS GheÙeesie
html- Jesye hespe keâer heâeFue nesleer nw~
nesves Jeeues efÛe$e keâes keânles nQ?
73. To select a sentence. Click anywhere on the
(a) Folder (b) Desktop sentence with the following key
(c) Icon (d) None of the above
Skeâ JeekeäÙe keâes Select keâjves nsleg efvecve Key keâe ØeÙeesie
Ans. (c) : efkeâmeer Yeer Øees«eece, heâeFue, ef[mkeâ Deeefo keâes oMee&ves kesâ efkeâÙee peelee nw~
efueS keâchÙetšj ceW efÛe$e/Úesše «eeefheâkeâue efmeyeue GheÙeesie efkeâÙee peelee
(a) Ctrl (b) Alt
nw, efpemes "Icon" (DeeFkeâve) keâne peelee nw~ pewmeW-
(c) Shift (d) Esc
 My computer
 Recycle Bin
Ans. (a) : Microsoft word ceW ctrl key keâe GheÙeesie Skeâ meeLe ceeGme
efkeäuekeâ keâjves hej hetje JeekeäÙe mesueskeäš keâjves kesâ efueS efkeâÙee peelee nw~
 Word, Excel Deeefo kesâ Úesšs efÛe$e Ùes meYeer Icons nesles nw~
Ctrl + efkeäuekeâ hetje JeekeäÙe mesueskeäš
69. Display of name of the program running within
the windows is called? Shift ÛeÙeve keâes efJemleeefjle keâjlee nw (pewmes- Shift + Arrow )
Windows ceW Øees«eece keâe veece Debefkeâle nesves Jeeues mLeeve Alt efJeMes<e Meeš&keâšdme kesâ efueS neslee nw~
keâes keânles nQ? Esc efkeâmeer keâceeC[ keâes keQâefmeue keâjlee nw~
(a) Menu Bar (b) Title Bar 74. To find and replace text, click on…………
(c) Tool Bar (d) Scroll Bar Find & Replace nsleg…………hej Click keâjW~
Ans. (b) : peye keâesF& Øees«eece efJeb[es ceW Ûeuelee nw, lees Gmekeâer efJeb[es kesâ (a) Edit (b) File
meyemes Thej pees heóer nesleer nw, GmeceW Gme Øees«eece Ùee heâeFue keâe veece (c) View (d) None of the above
efueKee neslee nw Fme heóer keâes šeFšue yeej keânles nw~ Ans. (a) : Microsoft word ceW find and Replace keâe efJekeâuhe
veesš– DeeÙeesie ves Fme ØeMve keâe Gòej (c) ceevee nw~ Deeceleewj hej Edit cesvet kesâ Devle&iele Deelee nw~
70. ………… is used to rearrange files and unused  Edit menu ceW nceW "Find" Deewj "Replace" pewmes efJekeâuhe
space on the Hard disk so that program run
faster. efceueles nw~
Hard disk kesâ efjkeäle mLeeveeW SJeb HeâeFueeW keâes JÙeJeefmLele  File menu ceW heâeFue mesJe, Deeshesve, efØebš Deeefo efJekeâuhe nesles nQ
keâjves kesâ efueS …………GheÙeesie neslee nw?  View menu ceW [e@keäÙetceWš keâe uesDeeGš, petce Deeefo nesles nw~
(a) Disk space (b) Scan Disk 75. To paste text from the clipboard in the
(c) Disk Defragmenter (d) Disk clean up document being edited, press the key(S)
Ans. (c) : Hard disk kesâ efjòeâ mLeeveeW SJeb heâeFueeW keâes JÙeJeefmLele Clipboard mes text keâes Document ceW uesves kesâ
keâjves kesâ efueS ef[mkeâ ef[øesâieceWvšj keâe GheÙeesie efkeâÙee peelee nw Ùen efueS…………oyeeÙeW~
ne[& ef[mkeâ ceW efyeKejer ngF& heâeFuees keâes Skeâ$e Deewj JÙeJeefmLele keâjlee nw (a) Ctrl + X (b) Ctrl + V
efpememes efmemšce keâer ieefle yeÌ{leer nw~ (c) Ctrl + A (d) Ins
71. In MS-WORD every command is available is… Ans. (b) : Ctrl+V ‘Mee@š&keâš keâer’ keâe GheÙeesie efkeäueheyees[& hej
MS-WORD ceW meYeer keâceeC[…………ceW GheueyOe nw~ keâe@heer efkeâS ieS šskeämš keâes Jele&ceeve [e@keäÙetceWš ceW hesmš keâjveW kesâ efueS
(a) Print (b) Icons neslee nw~ Ctrl + X keâš keâjves kesâ efueS leLee Ctrl + A mesueskeäš
(c) Letter (d) Digit Dee@ue kesâ efueS GheÙeesie~
Ans. (b) : Microsoft word ceW efJeefYeVe keâeÙeeX (pewmes- save, Ins: Insert ‘keâer’, pees hegjeves efmemšce ceW hesmš keâe keâeÙe& keâjleer Leer
open farmatting, insert Deeefo) keâes keâjveW kesâ efueS keâceeb[dme nesles
hej Deye meeceevÙe ™he mes ØeÙeesie ceW vener nw~
nQ Ùes meYeer keâceeb[dme Deehekeâes Icons kesâ ™he ceW efoKeeF& osleW nQ~
GoenjCe- Bold, Italic, Save, print, underline Deeefo~ veesš– DeeÙeesie ves Fme ØeMve keâe Gòej (d) ceevee nw~
76. In order to open existing document, you can
72. File extension of a ward document is?
click on.
Word keâe Extension HeâeFue nw?
GheueyOe Document Keesueves nsleg …………Click keâjW~
(a) .exe (b) .doc or docx
(a) Edit (b) View
(c) .txt (d) .html
(c) File (d) None of the above
Ans. (b) : ceeF›eâesmee@heäš Je[& [ekeäÙetceWš keâe mener SkeämešWMeve
.doc/.docx neslee nw Ans. (c) : [e@keäÙetceWš Keesueves keâe efJekeâuhe File Menu ceW neslee nw
File menu mes nce veÙee Ùee hegjevee [ekeäÙetceWš Keesue mekeâles nw pees
.doc.word 2003 Deewj hegjeves Jepe&ve kesâ efueS~
efmemšce ceW henues mes mesJe nw~
.doc.word 2007 Deewj yeeo kesâ Jepe&ve kesâ efueS~
Bihar STET 64 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
77. Mark the most appropriate statement. (ii) Standerd toolbar keâe cut yešve efkeäuekeâ keâjvee, štueyeej ceW
mener Statement Ûegves~ Skeâ kewâÛeer kesâ DeeFkeâve pewmee yešve neslee nw, efpememes meerOes keâš keâj
(a) Mail Merge can be used to print the form mekeâles nw~
letters (iii) Key board shortcut keâe Fmlesceeue keâjvee, šskeämš keâes
(b) Mail merge can be used to print the form efmeueskeäš keâjkesâ Ctrl X oyeeS, pees meyemes lespe Deewj Deemeeve nw~
letters and mailing labels
(c) Mail merge can be used to print envelopes 81. In Excel there are………… columns numbered
as A, B, C, .…Z, AA, AB….AZ
(d) All of the above
Excel ceW kegâue …………keâe@uece A, B, C….Z, AA,
Ans. (d) : Mail Merge Skeâ Microsoft Word heâerÛej nw pees AB….AZ mes Debefkeâle nQ~
Skeâ ner Øekeâej kesâ omleeJes]pe keâes keâF& ueesieeW kesâ efueS JÙeefòeâiele ™he mes
(a) 256 (b) 200
yeveeveW keâer megefJeOee oslee nw~ (c) 10 (d) 65536
 Form Lellers- Mail Merge keâe meyemes Deece GheÙeesie nw Skeâ
Ans. (a) : Ùen ØeMve Excel keâer hegjeveer Jepe&ve (pewmes Excel 2003)
ner he$e keâes keâF& ueesieeW kesâ efueS veece-helee yeoue keâj Yespevee~ hej DeeOeeefjle nw
 Mailing Labels Ùen Yeer Mail Merge mes mebYeJe nw, pewmes he$eeW
 Excel 2003 lekeâ, kegâue keâe@uece keâer mebKÙee 256 Leer~
hej efÛehekeâeves Jeeues veece-heles keâer uesyeume~
 keâe@uece keâe veece A mes Meg™ neslee nw Deewj Z lekeâ peelee nw, efheâj
 Envelopes: Mail Merge keâe GheÙeesie keâjkesâ nj efjmeerJej keâe veece
AA, AB, ...., AZ, BA...... Deewj Deble ceW IV lekeâ~
Deewj helee [euekeâj Deueie-Deueie efueheâehesâ Yeer efØebš efkeâS pee mekeâles nw~  Fme efmLeefle ceW Debeflece keâe@uece keâe veece IV neslee nw, pees 256 Jeeb
78. An …………entry refers location for text or keâe@uece nw~
graphics you want to use again.
 Excel 2007 Ùee yeeo kesâ mebmkeâjCees ceW 16384 keâe@uece leLee
…………Entry Text or Graphics keâes refer keâjlee
Debeflece keâe@uece XFD nw~
nw efpemes Deehe yeeo ceW GheÙeesie keâj mekeâles nw~
82. The intersection of a column and a row is
(a) Auto correct (b) Auto Text
called as a?
(c) Auto format (d) None of the above
Column & row keâe Intersection keânueelee nw?
Ans. (b) : Auto text Skeâ Ssmeer megefJeOee nw pees Deehekeâes yeej-yeej
(a) Work sheet (b) Work Book
GheÙeesie nesves Jeeues text Ùee graphics keâes Skeâ veece oskeâj mesJe keâjves (c) Cell (d) Range
osleer nw leeefkeâ Deehe Gmes yeeo ceW Deemeeveer mes hegve: GheÙeesie keâj mekesâ~ Ans. (c) : Excel ceW Skeâ Row (hebeòf eâ) Deewj Skeâ column (mlebYe)
Goe.- Deiej Deehe yeej-yeej Skeâ uebyee helee efueKeles nw, lees Gmes Auto peneb hej Deeheme ceW efceueles nQ, Gme mLeeve keâes Cell (keâes‰keâ) keânles nw~
text ceW mesJe keâj mekeâles nw Deewj YeefJe<Ùe ceW kesâJeue Gmekeâe veece šeFhe
GoenjCe - A1, B3, C5 Deeefo meYeer cells nw~
keâjkesâ enter oyeekeâj GheÙeesie keâj mekeâles nw~
83.
A formula can begin with a?
veesš– DeeÙeesie ves Fme ØeMve keâe Gòej (c) ceevee nw~ Formula ØeejcYe neslee nw?
79. In order to print Header & Footer, you can (a) +sign (b) =sign
click on………… /Header & Footer efØevš keâjves (c) Both A & B (d) None of the above
nsleg …………Click keâjW~ Ans. (b) : Excel ceW keâesF& Yeer Formula ncesMee = (equals
(a) Edit (b) View sign) mes Meg™ neslee nw~
(c) Insert (d) Tools
GoenjCe - = A1 + B1
Ans. (c) : ceeF›eâesmee@heäš Word ceW Header Deewj Footer pees[veW = SUM (A1 : A5)
kesâ efueS Deehe "Insert" šwye hej efkeäuekeâ keâjles nw, Ùeneb mes Deehe Ùen Excel keâes Ùen yeleeves kesâ efueS neslee nw efkeâ Deehe ieCevee
Header, Footer, Page Number Deeefo peesÌ[ mekeâles nw~ (calculation) keâjvee Ûeenles nQ
80. To delete a text from a document? 84. =$B$3*$c$3 is called?
Document mes Text delete keâjves kesâ efueS? =$B$3*$c$3 keânueelee nw?
(a) Select the text to be deleted, select the cut (a) Relative Reference (b) Absolute Reference
option from the edit menu (c) Mixed Reference (d) Both A & B
(b) Click the cut button from standard toolbar
(c) Select the text and press Ctrl + X Ans. (b) : Absalute Reference Jen mesue efjHeâjWme neslee nw
(d) All of the above efpemeceW Row Deewj Column oesveeW keâes efmLej (Constant) yeveeves kesâ
Ans. (d) : Ward Ùee efkeâmeer Yeer šskeämš Sef[šj ceW efkeâmeer šskeämš efueS Gvekesâ henues [e@uej ($) efÛevn ueieeÙee peelee nw~ peye Deehe efkeâmeer
keâes ef[ueerš (keâš) keâjves kesâ efueS efvecveefueefKele lejerkesâ nw- Heâe@cet&uee keâes Skeâ mesue mes otmejer mesue ceW keâe@heer keâjles nw, lees
Absalute Reference yeouelee veneR nw~ Deehe efkeâmeer Yeer mesue
(i) Edit menu mes keâš Dee@hMeve Ûegvevee,
efjHeâjWme keâes efmLej yeveeves kesâ efueS F4 kegbâpeer oyee mekeâles nw~
meyemes henues šskeämš keâes ÛegveW, efheâj Menubar Edit Cut hej
peeSb~ veesš– DeeÙeesie ves Fme ØeMve keâe Gòej (d) ceevee nw~
Bihar STET 65 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
85. A Cell can contain? (a) Filter (b) Advance filter
Skeâ Cell ceW neslee nw? (c) Sort (d) All of the above
(a) Text (b) Number Ans. (d) : Filter [sše keâes Úebšves (Úgheeves/efoKeeves) ceW ceoo keâjlee
(c) Formula (d) All of the above nw, uesefkeâve Sorting Yeer Fmekeâe efnmmee nes mekeâlee nw~
Ans. (d) : ceeF›eâesmee@heäš Excel ceW Skeâ mesue (cell) ceW keâF& Øekeâej Ùen DeefOekeâ peefšue MeleeX kesâ meeLe Filtering Deewj
Advance filter
kesâ [eše jKe mekeâles nw Sorting ces ceoo
keâjlee nw~
 Text veece, Meyo Deeefo Sort Fmekeâe GheÙeesie meerOes leewj hej [sše keâes JeCe&ceeuee mebKÙee Ùee
 Number 123, 45.6 Deeefo efleefLe kesâ ›eâce ceW mepeeves kesâ efueS efkeâÙee peelee nw~
 Formula =A1 + B1 pees efkeâmeer ieCevee keâe heefjCeece efoKeelee nw~
leervees štue efkeâmeer ve efkeâmeer ™he ceW [sše keâes ›eâceyeæ (arrange)
86. When Excel is loaded, it automatically opens a keâjves ceW ceoo keâjles nw Dele: efJekeâuhe (d) mener nw~
new workbook, with extension?
Excel uees[ nesves hej veÙee Workbook efkeâme 90. An interactive table that summarizes and
Extension mes Keguelee nw? analyses data from a database is a?
Data keâes Database mes ueskeâj Summarize &
(a) .XLW (b) .XLC
(c) .XLS (d) .XLT analysis keâjves Jeeuee Table nw?
Ans. (c) : Excel ceW peye veÙee Jeke&âyegkeâ (work book) yevelee nw, (a) Data Table (b) Pivot Table
lees Jen ef[heâe@uš ™he mes .XLS (hegjeves Jepe&ve ceW) Ùee XLSX (veS (c) Query Table (d) None of the above
mebmkeâjCeeW ces) SkeämešWMeve kesâ meeLe Keguelee nw~ Ans. (b) : Pivat Table Skeâ Ssmee štue nw pees database mes
87. To determine the value of the input to get the [sše ueskeâj Gmekeâe meejebMe (Summary) Deewj efJeMues<eCe
desired result……… is used. (Analysis) keâjves kesâ efueS GheÙeesie neslee nw~
DeeJeMÙekeâ result Øeehle keâjves leLee input keâes peeveves Pivat Table yeveeves kesâ mšshe-
nsleg……… GheÙeesie neslee nw~ (i) hetjer [sše šsyeue mesueskeäš keâjs~
(a) Auto format (b) Scenarios (ii) Insert Pivat table hej efkeäuekeâ keâjW~
(c) Goal Seek (d) Solver
(iii) veÙee Jeke&âMeerš Ùee ceewpetoe ceW peien ÛegveW~
Ans. (c) : DeeJeMÙekeâ result Øeehle keâjveW leLee Input keâes peeveves
(iv) Pivat Table Field List ceW
nsleg Goal Seek keâe GheÙeesie neslee nw
GoenjCe- Deiej Deehekesâ heeme Ùen heâe@cet&uee nw: ‘‘efJeYeeie’’ keâes Row ceW [eueW~
A1 * 10 Deewj Deehe Ûeenles nw efkeâ Fmekeâe heefjCeece 100 DeeS, lees
Jesleve keâes Values ceW [eueW (default sum neslee nw~)
Goal Seek yeleeSiee efkeâ A1 ceW 10 nesvee ÛeeefnS~ efvecveefueefKele šsyeue mes [eše G"eS-
88. ….. is used to total; a range of numeric cells keâce&Ûeejer efJeYeeie Jesleve
based on a condition. jece efye›eâer 25,000
jWpe kesâ Cell keâes Conditionally peesÌ[ves nsleg .......
MÙeece efye›eâer 26,000
GheÙeesie keâjles nQ~
(a) SUMIF() (b) SUM () meerlee HR 30,000
(c) SUMTHEN() (d) DSUM() ieerlee HR 32,000
Ans. (a) :  SUMIF () Skeâ Mele&
(condition) kesâ DeeOeej hej ceesnve IT 40,000
ner mesume keâes peesÌ[lee nw~ meesnve IT 42,000
 SUM () efmehe&â mebKÙeeDeeW keâes peesÌ[lee nw keâesF& keâv[erMeve vener
91. Network of networks is called?
ueielee~
vesšJeke&â keâe vesšJeke&â keânueelee nw?
 DSUM () Yeer keâv[erMeve hej DeeOeeefjle peesÌ[ves keâe keâeÙe& keâjlee nw
(a) INTERANET
uesefkeâve Ùen [sše yesme jWpe ceW ØeÙeesie neslee nw~
(b) INTERNET
 SUMTHEN () keâesF& JewOe Excel hebâkeäMeve vener nw~
(c) NETWORKING
veesš– DeeÙeesie ves Fme ØeMve keâe Gòej (b) ceevee nw~ (d) COMMUNICATION
89. In order to arrange the information in selected
Ans. (b) : Fbšjvesš keâes meyemes cetue ®he ceW ‘‘vesšJekeäme& keâe vesšJeke&â’’
rows or lists alphabetically, numerically or by
date we use……… keâne peelee nw~ Ùen ogefveÙee Yej kesâ kebâhÙetšj vesšJekeâeX keâe Skeâ meeLe
Ûegves ngS keâleej Ùee metÛeer ceW metÛevee keâes JeCe&ceeuee, pegÌ[eJe nw, peemes Skeâ efmebieue FkeâeF& yeveelee nw Ùen keâesF& Skeâ yeÌ[e
mebKÙeevegmeej Ùee efleefLe Devegmeej ›eâceyeæ mepeeles nsleg keâbhÙetšj veneR, yeefukeâ Skeâ otmejs mes pegÌ[s ngS keâF& vesšJeke&â kebâhÙetšjeW
………GheÙeesie keâjles nQ~ keâe mecettn nw~
Bihar STET 66 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
92. FTP stands for? Ùes Yee<eeSB FbmeeveeW Éeje Deemeeveer mes heÌ{er Deewj mecePeer pee mekeâleer nw~
FTP keâe DeLe& nw? Source program keâes keâcheeFuej Ùee FvšjØesšj keâer ceoo mes ceMeerve
(a) File Transfer Protocol Yee<ee (0 Deewj 1) ceW yeouee peelee nw, leeefkeâ keâchÙetšj Gmes mecePe
(b) Fixed Transfer Protocol
mekesâ~
(c) Fixed transfer Port
97. The first generation computer system used?
(d) None of the above
1st generation computer ceW GheÙeesie efkeâÙee ieÙee?
Ans. (a) : FTP keâe hegâueheâece& File Transfer Pratocol nw Ùen Skeâ
(a) Vacuum tube (b) Registers
vesšJeke&â Øeesšeskeâe@ue nw efpemekeâe GheÙeesie Fbšjvesš hej keâchÙetšj mes otmejs
(c) Transistor (d) Magnetic cores
keâchÙetšj ceW heâeFue YespeveW Deewj Øeehle keâjves kesâ efueS efkeâÙee peelee nw~
Ans. (a) : First Generation Computer ceW (1940s - mid
93. Important service of Internet are?
Internet keâe cenlJehetCe& mesJee nw? 1950s) ceW Vaccum tubes keâe ØeÙeesie efkeâÙee ieÙee Lee~
(a) File Transfer (b) Remote login  Ùes Large, slow Deewj Unreliable nesles Les Deewj yengle ieceea
(c) Views and News (d) All of the above GlheVe keâjles Les~
Ans. (d) : Fbšjvesš keâer cenlJehetCe& mesJeeSB nesleer nw pewmes-  GoenjCe ENIAC, UNIVAC
 File Transfer, pewmeer mesJeeDeeW Éeje heâeFueW Yespevee/Øeehle keâjvee~ peyeefkeâ-
 Remat login, SSH Ùee Telnet pewmes štume mes otj yew"s  Registers, CPU keâe efnmmee nesles nw pees ØeLece heerÌ{er mes lekeâveerkeâer
keâchÙetšj keâes Skeämesme keâjvee~ ™he mes mecyeefOele vener nw~
 Views and News, JesyemeeFš osKevee, meceeÛeej heÌ{vee Deeefo~  Transistars, second generation keâchÙetšj (1950s -
 Online Servies, Dee@veueeFve Kejerooejer hescesvš Deeefo~ 1960s) ceW ØeÙeesie efkeâÙee ieÙee nw~
94. www.google.com is a?  Magnetic cares Ùes cesve cesceesjer kesâ efueS GheÙeesie nesles nQ pees
www.google.com nw Skeâ? heâeGv[sMeveue keâcheesvesvš vener nw~
(a) E-mail Site (b) Charting Site
98. A Monitor looks like a TV set but it does Not…
(c) Search Site (d) Movie Site
Monitor TV pewmee nw hej Ùen……vener keâj mekeâlee~
Ans. (c) : www.google.com Skeâ meÛe& meeFš JesyemeeFš nw,
(a) Receive TV signals (b) Give a clear picture
keäÙeeW efkeâ ietieue Skeâ meÛe& Fbpeve nw pees Fbšjvesš hej peevekeâejer KeespeveW (c) Give a steady picture (d) display graphics
ces ceoo keâjleer nw~
Ans. (a) : cee@veeršj osKeves ceW TV keâer lejn ueielee nw, uesefkeâve Jen
95. Protocol used for the working with the
TV efmeiveue efjmeerJe vener keâj mekeâlee Ùen efmehe&â keâchÙetšj DeeGšhegš
internet?
Fvšjvesš kesâ meeLe GheÙeesie nesves Jeeuee Øeesšeskeâe@ue nw? keâes ef[mhues keâjlee nw, pewmes- šskeämš, «eeefheâkeäme Deeefo, cee@veeršj ceW
(a) CPU šŸetvej vener neslee pees šerJeer ceW Ûewveue efmeiveue hekeâÌ[lee nw~
(b) Magnetic tapes and disks 99. Compute consists of?
(c) Video terminal kebâcÙetšj ceW neslee nw?
(d) None of these (a) A central Processing Unit
Ans. (d) : C.P.U Skeâ ne[&JesÙej nw pees meYeer Øekeâej keâer ieCeveeSB (b) Input and output unit
Deewj Øeesmesefmebie keâjlee nw~ (c) A memory
cewivesefškeâ šshe Deewj ef[mkeâ [sše keâes mšesj keâjves kesâ efueS Fmlesceeue keâer (d) All of the above
peeves Jeeueer hegjeveer mšesjspe ef[JeeFmesme nw~ Ans. (d) : Skeâ keâchÙetšj leerve cegKÙe IeškeâeW mes efceuekeâj yevee neslee
Jeeref[Ùees šefce&veue Skeâ DeeGšhegš ef[JeeFme nw pees Ùetpej keâes keâchÙetšj nw:
keâer m›eâerve hej [sše efoKeeleer nw~ Dele: efJekeâuhe D nesiee Ghejesòeâ ceW mes (i) Central Processing Unit (CPU)
keâesF& vener~  Fmes keâchÙetšj keâe ‘‘ceefmle<keâ’’ keâne peelee nw~
96. A source program is the program Written  Ùen meYeer Instructions keâes Øeesmesme keâjlee nw~
in……… language.
(ii) Memory (mce=efle)
Source program………Yee<ee ceW efueKee neslee nw?
 FmeceW [sše Deewj Øees«eece mšesj efkeâS peeles nw~
(a) English (b) Machine language
(c) High-Level (d) Symbolic  pewmes RAM, ROM Deeefo~

Ans. (c) : Source Program Jen Øees«eece neslee nw pees Øees«eecej (iii) Input and Output: Keyboard, Mouse [sše Fvehegš keâjves
Éeje efueKee peelee nw~ Ùen efkeâmeer high-level language ceW efueKee kesâ efueS/leLee output devices pewmes Monitar, Printer [sše
peelee nw pewmes- C, C++, Java, python Deeefo~ ef[mhues keâjves kesâ efueS~

Bihar STET 67 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
100. ……… is known as half byte? 010 0 2
2
1 2
1
0 2
0
0 2 0 2
………DeeOee byte keânueelee nw?
Dele: Binary 1110101 = Octal 72 nesiee
(a) Data (b) Bit
(c) Nibble (d) None of the above 105. Bubble memory is a?
Bubble memory nw Skeâ?
Ans. (c) : 1 yeeFš (Byte) = 8 efyeš (Bit)
(a) Sequential access device only
DeeOee yeeFš = 4 efyeš, efpemes efveyeue (Nibble) (b) Direct access device only
keâne peelee nw Dele: efJekeâuhe (c) mener nesiee~ (c) Combination of sequential and direct access
veesš– DeeÙeesie ves Fme ØeMve keâe Gòej (d) ceevee nw~ device
101. ……… is the product of Data Processing. (d) All of the above
………Data processing keâe Product nw~ Ans. (c) : Bubble Memory Skeâ efJeMes<e Øekeâej keâer cesceesjer nw pees
(a) Data (b) Software cewivesefškeâ [escesve keâe GheÙeesie keâjleer nw Ùen Sequential Deewj
(c) Information (d) A computer Direct oesveeW lejn keâer Access Øeoeve keâjleer nw~
Ans. (c) : peye [sše keâes mebmeeefOele (Process) efkeâÙee peelee nw lees 106. Data entry can be performed with all of the
Gmemes pees DeLe&hetCe& heefjCeece efvekeâuelee nw Jen metÛevee (Information) following except………
keânueeleer nw~ ……… keâes ÚesÌ[keâj Data Entry meYeer mes neslee nw~
GoenjCe- hejer#ee kesâ Debkeâes keâes peesÌ[vee ([sše Øeesmesefmebie (a) OCR (b) OMR
(c) COM
kegâue Debkeâ Deewj ØeefleMele (metÛevee)~ (d) Voice-recognition systems
102. Which of the following is a non-impact printer? Ans. (c) : COM (Communication Port) Ùen keâchÙetšj Deewj
FveceW Non-Impact efØevšj nw? DevÙe ef[JeeFme kesâ yeerÛe [sše YespeveW keâe ceeOÙece nw hej Fmemes [eÙejskeäš
(a) Daisy wheel printer (b) Drum printer [sše Sbš^er vener keâer peeleer~
(c) Laser printer (d) All of the above
 peyeefkeâ OCR (Optical Character Recognition) mkewâve efkeâS
Ans. (c) : efoS ieS efJekeâuheeW ces uespej efØebšj vee@ve Fchewkeäš efØebšj nw,
ieS šskeämš keâes ef[efpešue heâece& ceW keâvJe&š keâjkesâ keâjlee nw pees [sše
vee@ve Fchewkeäš efØebšj keâe@iepe mes keâesF& Yeeweflekeâ mebheke&â vener keâjles, Ùes Svš^er ceW GheÙeesie neslee nw~
ueeFš, nerš Ùee Fueskeäš^esmšwefškeâ Ûeepe& keâe GheÙeesie keâjles nw
 OMR (Optical Mark Recognition) hejer#ee Meerš keâes jer[
peyeefkeâ Fchewkeäš efØebšj efØebš ns[ mes keâeiepe Ùee efjyeve hej Yeeweflekeâ keâjveW kesâ efueS neslee nw Ùen Yeer [sše Svš^er ceW GheÙeesie neslee nw~
mecheke&â (Impact) keâjles nw~
 Voice Recognition System Ùen DeeJeepe keâes šskeämš ceW
GoenjCe- Daisy Wheel Printer, Drum Printer yeouelee nw Ùen Yeer [sše Svš^er ceW GheÙeesie neslee nw~
103. Which of the following is not a sequential
107. A program written in machine language is
storage device? called?
FveceW mes keâewve mee Sequential storage device veneR nw? ceMeerve Yee<ee ceW efueKee Øees«eece keânueelee nw?
(a) Magnetic disk (b) Magnetic Tape (a) Assembler (b) Object program
(c) Paper tape (d) All of the above (c) Computer (d) Machine
Ans. (a) : Sequential starage ef[JeeFme Ssmes nesles nQ efpeveceW Ans. (d) : Machine Yee<ee ceW efueKee ieÙee Øees«eece Machine
[eše keâes ›eâce (Sequence) ceW jer[/jeFš efkeâÙee peelee nw~ Language Program keânueelee nw~
GoenjCe Magnetic tape, Paper tape  Assembler, Assembly Language keâes ceMeerve Yee<ee ceW
Magnetic disk Skeâ [eÙejskeäš Skeämesme ef[JeeFme nw, efpemeces Deehe yeouelee nw~
meerOes efkeâmeer Yeer mLeeve mes [eše Øeehle keâj mekeâles nw  Object Program, keâcheeFuej Éeje pevejsš efkeâÙee ieÙee ceMeerve
GoenjCe- HDD, SSD, RAM keâes[ nes mekeâlee nw, uesefkeâve Ùen meerOes ceMeerve Yee<ee ceW efueKee ngDee
104. The octal equivalent of 111010 is? Øees«eece vener nw~
111010 keâe Octal mebKÙee nw?  Computer Ùen ceMeerve keâes oMee&lee nw, Øees«eece vener nw~
(a) 81 (b) 72 veesš– DeeÙeesie ves Fme ØeMve keâe Gòej (a) ceevee nw~
(c) 81 (d) None of the above
108. PPS stands for?
Ans. (b) : 111010 keâe Dee@keäšue mebKÙee 72 nesiee~ PPS keâe hegve&™he nw?
Step-1 Binary mebKÙee = 111010 keâes oeSB mes yeeSB keâer Deesj 3 (a) Power Point show (b) Power Point slide
DekeâeW kesâ mecetn ceW efJeYeeefpele keâjves hej (c) Power Point save (d) None of the above
111010 111 010 Ans. (a) : PPS Skeâ heâeFue SkeämešWMeve nw pees ceeF›eâesmee@heäš heeJej
Step-2 Deye nj mecetn keâes Decimal ceW yeoueves hej hJeeFbš Éeje GheÙeesie efkeâÙee peelee nw Fmekeâe celeueye neslee nw Power
111 1 2
2
1 2
1
1 2
0
4 2 1 7 Point Show, Ùeeveer Ùen heâeFue meerOes ØespesvšsMeve cees[ ceW Kegueleer nw~
Bihar STET 68 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
109. Which of the following is directly controlled 114. Low level computer language used?
from a keyboard? Low level computer language ceW GheÙeesie neslee nw?
FveceW mes keâewve Keyboard mes meerOes mebÛeeefuele neslee nw? (a) English word
(a) Card Punch (b) Punched paper tape (b) Limited grammar
(c) Magnetic disk (d) Magnetic tape (c) Mnemonic codes
Ans. (a) : Card Punch ceMeerve hegjeveer keâchÙetefšbie lekeâveerkeâ ceW (d) Mathematical symbol
GheÙeesie nesleer Leer, peneB keâer yees[& mes Fvehegš osves hej keâe[& hej efÚõ Ans. (c) : Low Level Language pewmes Assembly
(hebefÛebie) efkeâS peeles Les~ Ùen Skeâcee$e ef[JeeFme nw pees meerOes keâeryees[& mes Language ceW Menmonic codes keâe ØeÙeesie efkeâÙee peelee nw~
efveÙebef$ele keâer peeleer nw~ GoenjCe: MOV, ADD, SUB FlÙeeefo~
110. What is Python? Ùes keâes[ ceMeerve kesâ efueS efveoxMe osves ces ceoo keâjles nQ
heeFLeve keäÙee nw? 115. A Compiler means
(a) Programming Language Compiler keâe DeLe& nw~
(b) Compiler (a) A person who compile source program
(c) OS (b) The same thing as a programmer
(d) Protocol (c) Keypunch operator
Ans. (a) : Python Skeâ neF&-uesJeue, FvšjØesšs[ Øees«eeefcebie Yee<ee nw (d) A program which translate source program
into object program
pees mejuelee Deewj heÌ{ves ceW Deemeeveer kesâ efueS peeveer peeleer nw, Fmekeâe
GheÙeesie Jesye [sJeueheceWš, [sše meeFvme Deeefš&efheâefMeÙeue FbšsefuepeWme Ans. (d) : Compiler Skeâ Ssmee mee@heâšJesÙej Øees«eece nw pees
Source Code (GÛÛe mlejerÙe Yee<ee) keâes Object Code (ceMeerve
Deeefo ceW neslee nw~
Yee<ee) ceW yeouelee nw, leeefkeâ keâchÙetšj Gmes mecePe mekesâ~
111. JVM is part of………
pesYeerSce ………keâe efnmmee nw~ 116. Which of the following is a displayed listing of
program option that user can select?
(a) C sharp (b) Oracle FveceW User Éeje Select keâjves ÙeesiÙe keäÙee nw?
(c) C++ (d) JAVA
(a) Menu (b) Block
Ans. (d) : JVM (Java Virtual Machine) Skeâ Ssmee efmemšce (c) File (d) Data items
nw pees Java Øees«eece keâes jve keâjves kesâ efueS keâece keâjlee nw Ùen peeJee Ans. (a) : peye keâesF& Ùetpej keâchÙetšj Ùee mee@heäšJesÙej keâe GheÙeesie
Øees«eeefcebie uewiJespe keâe cenlJehetCe& efnmmee nw~ C++, C# Deewj Oracle keâjlee nw lees Gmes keâF& efJekeâuhe efoKeles nw efpevns Jen Ûegve mekeâlee nw,
Fmekesâ efnmmes vener nQb~ Menu Skeâ Ssmee Fbšjhesâme nw efpememes Ùetpej efJekeâuheeW keâes Ûegve mekeâlee
112. Computer memory consists of? nw
Computer memory ceW neslee nw? pewmes File, Edit View Deeefo~
(a) RAM (b) ROM 117. Polymorphism is related to?
(c) PROM (d) All of the above heesueerceexefHeâpece efkeâmemes mecyeefvOele nw?
Ans. (d) : keâchÙetšj keâer cesceesjer ceW keâF& Øekeâej keâer cesceesjer nesleer nw: (a) Structured programming
 RAM (Random Access Memory) DemLeeÙeer cesceesjer nw pees (b) Object Oriented programming
keâchÙetšj yebo nesles ner, Fmekeâe [eše efceš peelee nw~ (c) NLP
 ROM (Read Only Memory) mLeeÙeer cesceesjer ns efpemeceW efmemšce (d) Machine Learning
mšeš&Dehe Øees«eece nesles nw~ Ans. (b) : Polymarphism (yeng™helee) Skeâ Dee@ypeskeäš DeesefjSšs[
 PROM (Programmable Rom) Skeâ yeej Øees«eece keâer pee Øees«eeefcebie (oop) keâer efJeMes<elee nw, efpemeceW Skeâ ner veece kesâ Deueie-
mekeâleer nw~ Deueie keâeÙe& nes mekeâles nw, DeLee&led Skeâ hebâkeäMeve keâF& ™he ues mekeâlee
113. Control unit is called? nw~
Control Unit keânueelee nw? 118. Which function of a computer is responsible
for permanent storage of data?
(a) Nerve centre (b) Clock
(c) Master dispatcher (d) All of the above
FveceW keâewve Storage function kesâ efueS efpeccesoej nw?
(a) Input (b) Output
Ans. (a) : keâvš^esue Ùetefveš (cu) meerheerÙet keâe Jen Yeeie neslee nw pees (c) CPU (d) Memory
meYeer keâeÙeeX keâes efveÙebef$ele keâjlee nw~
Ans. (d) : keâchÙetšj ceW [eše keâes mLeeÙeer ™he mes meb«enerle keâjves keâe
Fmes Nerve Center Yeer keânles nw keäÙeeW efkeâ Ùen hetjs efmemšce keâes keâeÙe& cesceesjer keâjleer nw, cesceesjer oes Øekeâej keâer nesleer nw mLeeÙeer mšesjspe
efveÙebef$ele keâjlee nw~ SJeb DemLeeÙeer mšesjspe efpemeceW ›eâceMe: Hard disk, SSD,
 Ùen efveoxMeeW keâes ueelee nw, ef[keâes[ keâjlee nw Deewj keâeÙeex keâes CD/DVD, Pen Drive Deewj RAM (Random Access
efve<heeefole keâjJeelee nw~ Memory) Deeefo nesleer nw~ peyeefkeâ Input, Output SJeb CPU
 Ùen meYeer ieefleefJeefOeÙeeW keâe mecevJeÙe (Cordination) keâjlee nw~ [sše mšesjspe keâe keâeÙe& vener keâjles~
Bihar STET 69 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
119. Data warehouse is a? Ans. (d) : Øees«eece ceW, Variable Skeâ veeefcele mLeeve neslee nw~
[eše JesÙej neGme nw? efpemeceW [eše mšesj efkeâÙee peelee nw, Skeâ JewefjSyeue ceW efvecveefueefKele
(a) Part of Java Ûeerpes nesveer ÛeeefnS-
(b) Part of RDBMS  Sig bit: Ùen yeleelee nw efkeâ ceeve Positive nw Ùee negative
(c) Huge collection of data (efmehe&â signed data ceW)
(d) None of the above  Starage Location: peneB JewefjSyeue keâe [eše cesceesjer ceW meb«eefnle
Ans. (b) : [sše JesÙej neGme Skeâ Øekeâej keâe [sše mšesjspe efmemšce neslee nw~
neslee nw pees efJeMes<e ™he mes efjheesefšËie Deewj [eše efJeMues<eCe kesâ efueS  Data Type: pewmes Int, float, char Deeefo, pees Ùen efveOee&efjle
ØeÙeesie efkeâÙee peelee nw~ Ùen RDBMS (Relational Data Base keâjlee nw efkeâ JewefjSyeue efkeâme Øekeâej keâe [eše mšesj keâjsiee~ FmeefueS,
Management System) keâe efnmmee neslee nw Deewj efJeMeeue cee$ee ceW Ùes leerveeW ÛeerpeW JewefjSyeue ceW DeeJeMÙekeâ nesleer nw~
[sše meb«eefnle neslee nw~ 124. All data to be stored and processed in
120. Which one is used to express logic gate computers are transformed or represented as
sequence of two symbols. These symbols
ueewefpekeâ iesš efkeâmekesâ Éeje ØeoefMe&le neslee nw~ are………
(a) Set theory Computer ceW Data efpeve oes Symbols Éeje Øemlegle
(b) Numerical Technique neslee nw Jes nQ………~
(c) Artificial Intelligence (a) 0 and 1 (b) On and Off
(d) Boolean Algebra (c) True and False (d) Bits and Byte
Ans. (d) : Logic Gates pewmes AND, OR, NOT Deeefo keâe Ans. (a) : keâchÙetšj Binary System hej keâece keâjlee nw, efpemeceW
keâeÙe& leeefke&âkeâ efveCe&Ùe (Logical decision) uesvee neslee nw Fve iesšdme kesâJeue oes Debkeâ nesles nw: 0 (off) Deewj 1(on) meYeer Øekeâej keâe [eše
keâer keâeÙe& ØeCeeueer keâes mecePeves Deewj ieefCeleerÙe ™he mes JÙeòeâ keâjves kesâ
Ûeens Jen šskeämš nes, Fcespe, Jeeref[Ùees Ùee keâesF& mebKÙee, Jen Deblele: 0
efueS Boolean Algebra keâe GheÙeesie efkeâÙee peelee nw~ Deewj 1 ceW yeouee peelee nw~ Fme efueS keâchÙetšj ceW [eše 0 Deewj 1 kesâ
Boolean Algebra ceW kesâJeue oes ceeve nesles nw 0 (false) Deewj ™he ceW Øemlegle neslee nw~
1 (True), pees uee@efpekeâ iesšdme keâer keâeÙe&ØeCeeueer keâes oMee&les nw~ 125. Main memory is called?
121. Webcam is an ……… Device Main memory keânueelee nw?
Webcam Skeâ ………Ùev$e nw~ (a) Cells (b) RAM
(c) Hard Disk (d) Floppy Disk
(a) Memory (b) Output
Ans. (b) : cegKÙe mce=efle (Main Memory) Jen cesceesjer nesleer nw
(c) Input (d) Processing
efpemes CPU meerOes GheÙeesie keâjlee nw, Fmes RAM (Random
Ans. (c) : Webcam Skeâ Ssmee ef[JeeFme nw pees efJeef[Ùees Ùee Fcespe
Access Memory) keânles nw~ Ùen Skeâ DemLeeÙeer mce=efle nesleer nw,
keâes keâchÙetšj ceW Yespelee nw, DeLee&led [eše keâes Input keâjlee nw~ Fvehegš efpemeceW keâchÙetšj keâe keâeÙe& keâjles meceÙe [sše mšesj jnlee nw pewmes ner
ef[JeeFme Jes nesles nQ pees Ùetpej mes peevekeâejer ueskeâj keâchÙetšj keâes osles nw keâchÙetšj yevo nes peelee nw Fmekeâe [eše uee@me nes peelee nw Fmeer efueS
pewmes- Keyboard, Mouse, Scanner, Webcam Deeefo~ Fmes JeesueešeFue cesceesjer Yeer keânles nw~
122. The list of instruction to be executed by a 126. Computers works only on 1s and 0s pattern,
computer is known as…. instructions made up with it is called?
kebâhÙetšj Éeje efve<heeefole efkeâS peeves Jeeues efveoxMeeW keâer keâchÙetšj ceW 1 Deewj 0 Éeje efveefce&le efveoxMe keânueelee nw?
metÛeer keâes keäÙee keâne peelee nw? (a) Programming language
(a) Hardware (b) Software (b) Machine code
(c) Language (d) Process (c) Instructions
(d) Data
Ans. (b) : keâchÙetšj keâes pees keâeÙe& keâjvee neslee nw, Gmekesâ efueS
Ans. (b) : keâchÙetšj kesâJeue yeeFvejer (Binary) Yee<ee keâes mecePelee nw
efveoxMeeW (Instructions) keâer Skeâ metÛeer oer peeleer nw~ pewmes Øees«eece~
DeLee&led 0 Deewj 1 keâe GheÙeesie keâjlee nw peye Fvš^keäMeve 0 Deewj 1 kesâ
Ùen efveoxMe keâchÙetšj Éeje Execute efkeâS peeles nw Deewj Fvns efceueekeâj
™he ceW efueKes peeles nw, lees Gvns ceMeerve keâes[ (Machine Code)
mee@heäšJesÙej yevelee nw~ FmeefueS, keâchÙetšj ceW Ûeueves Jeeues efveoxMeeW keâer keâne peelee nw~ Ùen (Low Level Language) nesleer nw efpemes
metÛeer keâes Software keâne peelee nw~ keâchÙetšj meerOes mecePelee nw~
123. A variable must have……… 127. The example of system software is?
JewefjÙeyegue ceW ………DeJeMÙe nesvee ÛeeefnS~ System Software keâe GoenjCe nw?
(a) Sign bit (b) Storage location (a) Linux (b) Windows
(c) Data type (d) all of the above (c) Both A and B (d) PowerPoint
Bihar STET 70 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
Ans. (c): efmemšce mee@heäšJesÙej Jen mee@heäšJesÙej neslee nw pees keâchÙetšj Ans. (c): HeäueesÛeeš& (Flowchart) Skeâ Øekeâej keâe efÛe$eelcekeâ
ne[&JesÙej Deewj Ùetpej kesâ yeerÛe ceW Fbšjhesâme Øeoeve keâjlee nw~ Linux Deewj (Pictorial) lejerkeâe nw, efpememes nce efkeâmeer Øees«eece Øeesmesme Ùee uee@efpekeâ
Windows oesveeW Dee@hejsefšbie efmemšce nw, pees system software kesâ keâes Step-by-step [eÙe«eece kesâ ™he ceW efoKeeles nw~ FmeceW efJeefYeVe
symbols (pewmes- rectangle, diamond, arrow) keâe GheÙeesie
GoenjCe nw peyeefkeâ heeJejhJee@Fš Skeâ SefhuekesâMeve mee@heäšJesÙej nw~ keâjkesâ keâeÙeex Deewj efveCe&ÙeeW keâes oMee&lee nw~
128. Knowledge discover and data mining are 132. Inheritance reflects………
associated with?/vee@uespe ef[mkeâJejer SJeb [eše ceeFveeRie Fve nsefjšsvme ØeoMeeale ………keâjlee nw?
efkeâmemes mebyebefOele nw? (a) Association (b) Difference
(a) Database (b) Oracle (c) Specification (d) Generalization
(c) Internet (d) Data warehouse Ans. (d) : meeceevÙeerkeâjCe (Generalization) ceW nce meeceevÙe iegCeeW
Ans. (a) : Knowledge Discovery (vee@uespe ef[mkeâJejer) Deewj Deewj JÙeJenejeW keâes Thej (Super class) ceW KeerÛe uesles nw~
Inheritance = Generalization keâe ØeefleefveefOelJe keâjlee nw, keäÙeeWefkeâ
[eše ceeFefvebie Ssmes Øeesmesme nw efpevekeâe GheÙeesie yeÌ[s [eše mesš ceW mes
FmeceW nce meeceevÙe efJeMes<eleeDeeW keâes meePee keâjves Jeeues JeieeX keâes Skeâ
cenlJehetCe& Fvheâe@cexMeve, hewšve&, efjuesMeveefMehe efvekeâeueveW kesâ efueS efkeâÙee meeceevÙe Jeie& ceW meceeefnle keâjles nw~
peelee nw Ùen Øeef›eâÙee Deeceleewj hej Data Warehouse mes Meg™ nesleer veesš– DeeÙeesie ves Fme ØeMve keâe Gòej (a) ceevee nw~
nw, peneB yeÌ[er cee$ee ceW [sše mšesj efkeâÙee peelee nw, efheâj Gme [sše hej 133. EDI is a kind of ………
Data Mining kesâ lekeâveerkeWâ ueeiet keâer peeleer nQ leeefkeâ efÚheer ngF& F&[erDeeF& Skeâ Øekeâej keâe ………nw?
GheÙeesieer peevekeâejer efvekeâeueer pee mekeWâ~ (a) Programs (b) Method
129. Analytics is related with? (c) Database tool (d) Network
Ssveeuesefškeâ efkeâmemes mebyebefOele nw? Ans. (b) : EDI (Electronic Data Interchange) Skeâ Ssmeer
efJeefOe (Method) nw efpemekesâ Éeje oes JÙeJemeeÙeeW kesâ yeerÛe ef[efpešue
(a) ERP (b) Database
™he ceW [sše keâe Deeoeve-Øeoeve efkeâÙee peelee nw pewmes Fveyee@keäme, Dee[&j
(c) Data warehouse (d) Big data
efMeefhebie ef[šsume Deeefo~ Ùen cewvÙegDeue FbšjJesšve keâes nšekeâj kebâhÙetšj
Ans. (d) : Ssveeuesefškeâ (Analytics) keâe DeLe& neslee nw [sše keâe mes kebâhÙetšj mJeÛeeefuele mebÛeej keâes me#ece keâjlee nw~ EDI keâe GheÙeesie
efJeMues<eCe keâjvee leeefkeâ GmeceW mes GheÙeesieer peevekeâejer Øeehle keâer pee cegKÙele: efyepevesme št efyepevesme (B2B) keâcÙegefvekesâMeve ceW efkeâÙee peelee nw~
mekesâ, pewmes efkeâ ®Peeve (Trends), hewšve&, YeefJe<ÙeJeeCeer (Prediction) veesš– DeeÙeesie ves Fme ØeMve keâe Gòej (a) ceevee nw~
Deeefo~ 134. Reader.readline(); is input syntax for………
Big data Skeâ Ssmee Meyo nw pees efJeMeeue cee$ee ceW [sše keâes oMee&lee Reader.readline();……… keâe Fvehegš efmebšwkeäme nw?
nw, efpemes heejbheefjkeâ lejerkesâ mes mšesj Ùee Øeesmesme veneR efkeâÙee pee mekeâlee~ (a) C (b) C++
(c) Python (d) JAVA
Ssveeuesefškeâ ceW Fve yeÌ[s [sše mesšdme keâe GheÙeesie keâjkesâ cenlJehetCe&
Ans. (c) : Reader.readline(), Python ceW HeâeFue Ùee Fvehegš
peevekeâejer efvekeâeueer pee mekeâleer nw mš^erce mes Skeâ ueeFve heÌ{ves keâe Skeâ meeceevÙe lejerkeâe nw
[sše JesÙejneGme, [sše keâes Skeâef$ele keâjves Deewj efjheesefšËie kesâ efueS GoenjCe–With open ("file.txt","r")as reader:
GheÙeesieer nw, uesefkeâve Ssveeuesefškeâ cegKÙele: efyeie [sše mes mecyeefvOele nw~ line = reader.readline()
veesš– DeeÙeesie ves Fme ØeMve keâe Gòej (a) ceevee nw~ Print (line)
130. Hadoop and mapreduce are related with?
Ùeneb reader Skeâ file object nw, readoline() method Gme
HeâeFue mes Skeâ-Skeâ ueeFve heÌ{ves kesâ efueS ØeÙeesie efkeâÙee peelee nw~
ne[the SJeb cewhejer[tme efkeâmemes mebyebefOele nw?
veesš– DeeÙeesie ves Fme ØeMve keâe Gòej (d) ceevee nw~
(a) DB/2 (b) RDBMS
135. Myint() is a syntax used for variable
(c) JAVA (d) Big data
declaration in………
Ans. (d) : Hadoop Deewj Mapreduce oesveeW lekeâveerkesâ Big data Myint()………keâe ef[keâueejsmeve efmebškeäme nw?
mes pegÌ[er nw Ùes šskeäveesuee@peer yengle yeÌ[s hewceeves hej [sše keâes Øeesmesme Deewj (a) C sharp (b) VB dot net
mšesj keâjves kesâ efueS GheÙeesie neslee nw~ (c) R programming (d) Python
ne[the Skeâ Deeshesve-meesme& øesâceJeke&â nw pees efyeie [sše ef[mš^eryÙetšs[ ™he Ans. (d) : Python ceW peye efkeâmeer Custom Class Ùee type keâes
ceW mšesj Deewj Øeesmesme keâjlee nw~ Ùen [sše HDFS (Hadoop define keâjles nw leye Myint() efmebšskeäme keâe GheÙeesie keâjles nw~
Distributed File System) ceW mšesj keâjlee nw~ GoenjCe–Class Myint(int):
veesš– DeeÙeesie ves Fme ØeMve keâe Gòej (c) ceevee nw~ Pass
131. ………is a pictorial representation of a a = Myint(S)
program. Print(a)
………Program keâe pictorial Øemlegleer nw~ # Output : 5
(a) Icon (b) Folder Ùeneb Myint() Skeâ keâmšce keäueeme nw pees int keâes extend keâjleer nw,
(c) Flowchart (d) Command FmeefueS Ùen Python ceW JewefjSyeue ef[keäuesjsMeve keâe Skeâ efmebšskeäme nw~
Bihar STET 71 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
136. try{ }…catch{ } in JAVA use for? 140. HTML stands for?
try{ }…catch{ } keâe peeJee ceW keäÙee GheÙeesie nw? HTML keâe DeLe& nw?
(a) CLASS collaboration (a) Human Text Makeup Language
(b) Subclasses inheritance (b) Hyper Text Markup Language
(c) Exception handling (c) Human Text Manipulation Language
(d) Debugging (d) Handy Text Markup Language
Ans. (c) : Java ceW try{ } Deewj catch{ } yuee@keâ Exception Ans. (b) : HTML keâe DeLe& Hyper Text Markup Language
Handling kesâ efueS GheÙeesie efkeâS peeles nw, Ùeefo keâesF& error Ùee nw, Hyper text keâe celeueye nw Skeâ Ssmee šskeämš efpemeceW efuebkeâ
exception neslee nw, lees Gmes try yuee@keâ ceW hekeâÌ[e peelee nw Deewj (Links) Meeefceue nesles nQ, efpeve hej efkeäuekeâ keâjkesâ Deehe Skeâ Jesyehespe
catch yuee@keâ ceW handle efkeâÙee peelee nw~ mes otmejs Jesyehespe hej pee mekeâles nQ~ Markup Language keâe DeLe&
GoenjCe:- Ùen nw efkeâ Skeâ mš^keäÛej yeveeves Jeeueer Yee<ee nw, efpemeceW nce Jesyehespe kesâ
try { šskeämš, Fcespe, nsef[bie šsyeue Deeefo keâes JÙeJeefmLele keâjles nw~ Ùen
int a = 10 /0; Jesyehespe ef[peeFve keâjves keâer yegefveÙeeoer Yee<ee (Basic Language) nw~
} catch (Arithmetic Exception e)
141. TCP/IP is a………
{
šer meer heer/DeeF& heer Skeâ ………nw~
System.out.print in ("cannot divide by zero!");
(a) Web Browser (b) System Software
}
(c) Application Software (d) Protocol
137. Ethernet is a standard for
Ans. (d) : TCP/IP (Transmission Control
Ethernet keâe mšsC[& nw~
Protocol/Internet Protocol) Skeâ vesšJeke&â Øeesšeskeâe@ue nw, pees
(a) HDD (b) CDs
(c) USB (d) NIC
Fbšjvesš Deewj DevÙe vesšJekeâeX ceW [sše Yespeves Deewj Øeehle keâjves kesâ efveÙece
efveOee&efjle keâjlee nw~ TCP/IP Øeesšeskeâe@ue metš ceW TCP Ùen megefveef§ele
Ans. (d) : Ethernet Skeâ vesšJeefkeËâie ceevekeâ (Standard) nw pees
keâjlee nw efkeâ [sše megjef#ele ™he mes Deewj mener ›eâce ceW hengBÛes IP [sše
keâchÙetšj Deewj DevÙe ef[JeeFmeeW keâes Local Area Network (LAN)
keâes mener heles lekeâ hengbÛeeves keâe keâeÙe& keâjlee nw~
ceW peesÌ[ves kesâ efueS GheÙeesie neslee nw~ Ùen ceevekeâ IEEE802.3 kesâ veece
mes peevee peelee nw~ peye keâesF& ef[JeeFme vesšJeke&â mes pegÌ[lee nw, lees Jen 142. URL stands for………?
NIC (Network Interface Card) kesâ ceeOÙece mes pegÌ[lee nw~ URL………keâe DeLe& nw?
Ethernet Ùener efveOee&efjle keâjlee nw efkeâ NIC kesâ ceeOÙece mes [eše kewâmes (a) Uniform Resource Locator
(b) United Residence Language
Yespee Deewj Øeehle efkeâÙee peeS~
(c) Uniform Reused Language
138. ………is used to transfer files from one
(d) Upper Regional Language
computer to another computer.
………keâe GheÙeesie File keâes Skeâ keâcheÙetšj mes otmejs Ans. (a) : URL (Uniform Resource Locator) yesJe S[^sme
kebâhÙetšj ceW Transfer keâjves kesâ efueS keâjles nw~ neslee nw efpemeceW nce efkeâmeer JesyemeeFš, HeâeFue, Ùee Jesye hespe lekeâ henbgÛe
(a) FTP (b) Telnet
mekeâles nwb~
(c) Chat (d) DNS GoenjCe– https://www.google.com
Ans. (a) : FTP (File Transfer Protocol) keâe GheÙeesie Skeâ 143. Algebra of logic is termed as?
kebâhÙetšj mes otmejs kebâhÙetšj hej HeâeFue YespeveW (Upload) Ùee HeâeFue leke&â keâe yeerpeieefCele keâne peelee nw?
cebieJeeves (Download) kesâ efueS efkeâÙee peelee nw, Ùen Fbšjvesš Ùee (a) Numerical logic (b) Boolean algebra
ueeskeâue vesšJeke&â kesâ ceeOÙece mes HeâeFue š^e@vmeHeâj keâer megefJeOee oslee nw~ (c) Arithmetic logic (d) Boolean number
139. ………is used to send and receive mail. Ans. (b) : leke&â (Logic) keâe ieefCeleerÙe DeOÙeÙeve "Boolean algebra"
………keâe GheÙeesie mail send & receive keâjves kesâ keânueelee nw, pees 0 Deewj 1 pewmes efÉ-cetuÙe (Binary Values) kesâ meeLe
efueS GheÙeesie keâjles nwb~ keâeÙe& keâjlee nw~ Fmekeâe GheÙeesie ef[efpešue Fueskeäš^ee@ vf ekeâ Deewj keâchÙetšjeW ceW
(a) E-mail (b) Internet Explorer uee@efpekeâ iesšdme Deeefo kesâ efvecee&Ce ceW neslee nw~
(c) Gopher (d) Telnet veesš– DeeÙeesie ves Fme ØeMve keâe Gòej (c) ceevee nw~
Ans. (a) : E-mail keâe DeLe& Electronic mail nw Fmekeâe GheÙeesie 144. Boolean algebra can be used………
Fbšjvesš kesâ ceeOÙece mes cewmespe, [e@keäÙetceWš, Heâesšes Deewj DevÙe HeâeFueW yetefueÙeve yeerpeieefCele keâe GheÙeesie efkeâÙee pee mekeâlee
Yespeves Deewj Øeehle keâjves kesâ efueS efkeâÙee peelee nw~ nw………?
Bihar STET 72 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
 (a) For designing of the digital computers 148. The expression for Absorption law is given
(b) In building logic symbols by………
(c) Circuit theory DeJeMeemeve uee@ keâer DeYeerJÙeefkeäle ………Éeje oer ieF& nw~
(d) Building algebraic functions (a) A + AB = A (b) A + AB = B
Ans. (a): Boolean algebra ef[efpešue kebâhÙetšjeW kesâ uee@efpekeâ (c) AB + AA' = A (d) A + B = B + A
meefke&âšdme Deewj iesšdme keâes ef[peeFve keâjves kesâ efueS ØeÙeesie neslee nw~ Ùen Ans. (a) : Absorption Law yetefueÙeve yeerpeieefCele keâe Skeâ efveÙece
AND, OR, NOT pewmes uee@efpekeâ Dee@hejsMevme keâes heefjYeeef<ele keâjlee nw pees yeleelee nw efkeâ efkeâmeer Yeer efJeMes<e SefueceWš kesâ meeLe Gmekeâe keâesF&
nw, efpemeceW ef[efpešue efmemšce keâe keâeÙe& leÙe efkeâÙee peelee nw~ Deewj mebÙeespeve (Combination) peesÌ[ves mes heefjCeece Jener SueerceWš nes
145. A……… value is represented by a Boolean mekeâlee nw~
expression. efmeæeble– A + AB = A
Skeâ……… cetuÙe Skeâ yegefueÙeve DeefYeJÙeefkeäle Éeje A (A + B) = A
oMee&Ùee ieÙee nw~ Ùen keânlee nw efkeâ Deiej efkeâmeer šce& (A) kesâ meeLe Gmekeâe AND keâesF&
(a) Positive (b) Recursive otmeje šce& (AB) peesÌ[ efoÙee peeS lees Gmekeâe heefjCeece kesâJeue A
(c) Negative (d) Boolean nesiee~
Ans. (d) : yetefueÙeve SkeämeØesMeve kesâJeue oes ceeveeW (Value) keâes GoenjCe ceeve ueerefpeS
oMeeleea nw: melÙe (1/True) Deewj DemelÙe (0/False) Fve JewuÙe keâes A =1 Deewj B = 0
yetefueÙeve JewuÙet keâne peelee nw~ FmeefueS efkeâmeer Yeer yetefueÙeve SkeämeØesMeve lees AB = 1 0 = 0
Éeje ØeoefMe&le ceeve yetefueÙeve neslee nw~ A + AB = 1 + 0 = 1 = A
146. What are the canonical forms of Boolean 149. According to Boolean law : A + 1 = ?
Expression? yetefueÙeve uee@ kesâ Devegmeej : A + 1 = ?
yetefueÙeve SkeämeØesMebme kesâ efJeefnle ™he keäÙee nw? (a) 1 (b) A
(a) OR and XOR (b) NOR and XNOR (c) 0 (d) A'
(c) MAX and MIN (d) SOM and POM Ans. (a) : yetefueÙeve uee@ kesâ Devegmeej-
Ans. (d) : yetefueÙeve SkeämeØesMebme kesâ oes ØecegKe Canonical forms A+1=1
nesles nw: keäÙeeWefkeâ OR iesš ceW Deiej keâesF& Skeâ Fvehegš Yeer 1 nes, lees DeeGšhegš
SOM (Sum OF Minterms)– peneB meYeer šcme& OR Dee@hejsMeve ncesMee 1 neslee nw~
mes pegÌ[s nesles nw~ A – A+1
POM (Product of Maxterms) peneb meYeer šcme& AND 0 - 1
Dee@hejsMeve mes pegÌ[s nesles nQ~ 1 - 1
Ùes Canonical forms efkeâmeer Yeer yetefueÙeve HebâkeäMeve keâes ceevekeâerke=âle Ûeens A keâer JewuÙet kegâÚ Yeer nes- 0 Ùee 1 Deiej nce GmeceW 1 peesÌ[les nQ
(Standardized) ™he ceW JÙekeäle keâjves kesâ efueS ØeÙeesie efkeâS peeles nw~ (OR keâjles nw), lees DeeGšhegš ncesMee 1 jnsiee~
147. The logic gate that provides high output for 150. A (A + B) = ?
same inputs……… (a) AB (b) 1
………leke&â iesš pees meceeve Fvehegš kesâ efueS GÛÛe (c) (1 + AB) (d) A
DeeGšhegš Øeoeve keâjlee nw~ Ans. (d) : Absorption Law kesâ Devegmeej
(a) NOT (b) X-NOR A (A + B ) = A
(c) AND (d) XOR Fme uee@ kesâ Devegmeej peye nesF& JewefjSyeue (A) efkeâmeer otmejs JewefjSyeue kesâ
Ans. (b) : X-NOR iesš (Exclusive NOR gate) leye meeLe OR keâjkesâ efHeâj AND efkeâÙee peelee nw, lees Gmekeâe Demej veneR
DeeGšhegš 1 (GÛÛe) oslee nw peye oesveeW Fvehegš meceeve nesles nw~ neslee- Debeflece Gòej Jener henuee JewefjSyeue neslee nw~
A B A X-NOR B šÎLe šsyeue–
0 0 1 A B A+ B A(A + B)
0 1 0 0 0 0 0
1 0 0 0 1 1 0
1 1 1 1 0 1 1
DeLee&led– peye Fvehegš meceeve nes (0, 0 Ùee 1, 1) DeeGšhegš 1 1 1 1 1
peye Fvehegš Deueie nes DeeGšhegš 0 GheÙeg&keäle šsyeue kesâ Devegmeej, Debeflece keâe@uece (A(A + B)) keâer JewuÙet
FmeefueS Fmes "Equality Gate" Yeer keâne peelee nw~ A kesâ meceeve ner nw~

Bihar STET 73 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
 efyenej efJeÅeeueÙe hejer#ee meefceefle
ceeOÙeefcekeâ efMe#ekeâ hee$elee hejer#ee Bihar STET
keâchÙetšj
[Exam. Date - 2020]
51. Which of the following is/are word processing Ans. (c) : 'Ctrl + N' Skeâ Keyboard shortcut nw efpemekeâe
software/efvecveefueefKele ceW mes keâewve mee Meyo mebmeeOeve GheÙeesie yengle meejs mee@heäšJesÙej (pewmes MS Word, Excel, Notepad
mee@HeäšJesÙej nw? Deeefo) ceW efkeâÙee peelee nw~ Fmekeâe celeueye nw 'New Document'
(a) Word Perfect Ùeeveer veÙee omleeJespe yeveevee~ peye Deehe 'Ctrl + N' Mee@š&keâš oyeeles
(b) Easy Word nQ, lees Øees«eece Skeâ veÙee Keeueer [e@keäÙetceWš Ùee veF& efJe[eW Keesuelee nw,
(c) MS Word
leeefkeâ Deehe GmeceW veÙee keâece Meg™ keâj mekesâ~
(d) All of these/Fveces mes meYeer
54. CPP keywords are also called
Ans. (d) : Meyo mebmeeOeve mee@HeäšJesÙej (Word Processing
CPP keâerJe[& keâes.............. Yeer keâne peelee nw~
Software) Jees mee@HeäšJesÙej nesles nQ efpevekeâe GheÙeesie omleeJespe
(a) Preprocessor
(Document) yeveeveW, mebheeefole keâjves, Heâe@ceW&š keâjves Deewj efØevš keâjves
(b) Punctuation symbols
kesâ efueS efkeâÙee peelee nw~ Ùes mee@HeäšJesÙej nceW šskeämš šeFhe keâjves, (c) Operators
GmeceW yeoueeJe keâjves ef[peeFve peesÌ[ves Deewj Gmes mesJe (Save) Ùee (d) Reserve words
efØevš (Print) keâjves keâer megefJeOee osles nw~ Ans. (d) : C++ ceW "Keywords" Jes Meyo nesles nQ efpevekeâe efJeMes<e
∎ Word Perfect– Ùen Skeâ Øeefmeæ Meyo mebmeeOeve mee@HeäšJesÙej nw,
DeLe& neslee nw Deewj efpevnW Øees«eeefcebie ceW henues mes ner efkeâmeer Keeme keâece
pees henues yengle ueeskeâefØeÙe Lee, Keemekeâj JÙeeJemeeefÙekeâ #es$eeW ceW~ kesâ efueS Deejef#ele (Reserved) efkeâÙee ieÙee neslee nw~
∎ Easy Word– Ùen Yeer Skeâ Meyo mebmeeOeve (Word
FmeefueS FvnW "Reserved words" Yeer keâne peelee nw~
Processing) mee@HeäšJesÙej nw, pees GheÙeesiekeâlee&DeeW (Users) keâes šskeämš
55. What are inserted as cross-reference in Word?
Sef[efšbie Deewj [e@keäÙetceWš yeveeves keâer megefJeOee oslee nw~
Meyo ceW Cross-Reference kesâ ™he ceW keäÙee [euee peelee
∎ MS Word (Microsoft Word)– Ùen meyemes ueeskeâefØeÙe Deewj
nw?
JÙeehekeâ ™he mes GheÙeesie efkeâÙee peeves Jeeuee Je[& Øeesmesefmebie mee@HeäšJesÙej
(a) Placeholders (b) Bookmarks
nw~ Ùen Microsoft Office keâe efnmmee neslee nw~
(c) Objects (d) Word fields
52. To perform I/O operations in CPP, we must
use…………header file. Ans. (d) : Cross-Reference keâe GheÙeesie MS Word ceW
CPP ceW I/O Dee@hejsMeve keâjves kesâ efueS nceW............ ns[j omleeJes pe kesâ Yeerlej efkeâmeer DevÙe mLeeve (pewmes- Heading, figure,
HeâeFue keâe GheÙeesie keâjvee ÛeeefnS~ table, numbered item, FlÙeeefo) keâer Deesj meboYe& (Reference)
(a) <iostream.h> (b) <string.h> os ves kesâ efueS efkeâÙee peelee nw~ peye Deehe Cross-Reference yeveeles
(c) <math.h> (d) <stdio.h> nQ , lees Word 'fields' keâe GheÙeesie keâjlee nw~
Ans. (a) : C++ ceW Input/Output (I/O) Operation pewmes efkeâ cin, 56. Which of the following is not the Section Break
cout keâe GheÙeesie keâjves kesâ efueS nceW Skeâ efJeMes<e 'header file' keâer Option?
DeeJeMÙekeâlee nesleer nw, pees Fve operations keâes define keâjleer nw~ ef vecveefueefKele ceW mes keâewve Keb[ efJeÛÚso efJekeâuhe veneR nw?
Example– CPP (a) Next Page (b) Previous Page
# include <iostream.h> (c) Odd Page (d) Even Page
void main(){ Ans. (b) : KeC[ ef J eÛÚs o (Section Break) keâe GheÙeesie
cout <<"Hello World"; Microsoft word pewmes Je[& Øeesmesefmebie mee@HeäšJesÙej ceW [e@keäÙetceWš keâes
} Deueie-2 YeeieeW (Sections) ceW yeebšves kesâ efueS efkeâÙee peelee nw,
53. Ctrl + N is used to efpememes nj KeC[ ceW Deueie-2 Heâe@cexefšbie (pewmes efkeâ ns[j-Hegâšj,
‘Ctrl + N’ keâjlee nw keâe@uecme, heWpe vebyeefjib e Deeefo) ueeiet keâer pee mekeâleer nw~
(a) Save Document Word ceW cegKÙe Keb[ efJeÛÚso (Section Break) kesâ efJekeâuhe nesles nQ-
(b) Open Document
(1) Next Page– Ùen KeC[ efJeÛÚso Deieues he=‰ mes veF& meskeäMeve
(c) Create New Document
(d) Close Document
Meg ® keâjlee nw~
Bihar STET 74 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
(2) Odd Page– Ùen KeC[ efJeÛÚso Deieueer efJe<ece (odd) mebKÙee ∎ hetJe&lee (Precedence) keâe DeLe&–
Jeeues hespe mes veF& meskeäMeve Meg™ keâjles nw~ hetJe&lee Ùen efveOee&efjle keâjleer nw efkeâ peye Skeâ ner Expression ceW Skeâ
(3) Even Page– Ùen KeC[ efJeÛÚso Deieueer mece (Ecen) mebKÙee mes DeefOekeâ Operator nes, lees keâewve mee Dee@hejsšj henues Ûeuesiee~
Jeeues heWpe mes veF& meskeäMeve Meg™ keâjlee nw~ ∎ peye meYeer keâer ØeeLeefcekeâlee meceeve nesleer nw–
(4) Continuous– Ùen KeC[ efJeÛÚso Gmeer hespe hej veF& meskeäMeve lees efHeâj SmeesefmeSefšefJešer (Associatively) Ùen leÙe keâjleer nw efkeâ
Meg™ keâjlee nw~ evaluation efkeâme efoMee ceW nesieer~ Fve leerveeW Dee@hejsšj (*, /, %) keâer
57. DBMS stands for Left to right associatively nesleer nw, Ùeeveer FvnW yeeÙes mes oeSb nue
DBMS keâe hetje veece nw efkeâÙee pelee nw~
(a) Database Management System 60. 'Ctrl + G executes
(b) Database Master System 'Ctrl + G keâjlee nw
(c) Database management Structure
(a) Open Paragraph Dialog ox activating Goto
(d) None of these/FveceW mes keâesF& veneR
Tab
Ans. (a) : [sšeyesme cewvespeceWš efmemšce (DBMS) Skeâ mee@HeäšJesÙej (b) Open Page Setup Dialog box activating Goto
ShueerkesâMeve nw efpemekeâe GheÙeesie [sšeyesme yeveeves ØeyebefOele keâjves Deewj Tab
yeveeÙes jKeves kesâ efueS efkeâÙee peelee nw~ Ùen [sše keâes meb«enerle Deewj (c) Open Find and Replace Dialog box with
JÙeJeefmLele keâjves keâe Skeâ lejerkeâe Øeoeve keâjlee nw Deewj GheÙeeskeâlee&DeeW activating Goto Tab
keâes DeeJeMÙekeâleevegmeej [sše keâes hegve: Øeehle keâjves, Dehe[sš keâjves Deewj (d) Open Goto Dialog box
nsjHesâj keâjves keâer Devegceefle oslee nw~ Ans. (d) : peye Deehe 'Ctrl + G' oyeeles nw, lees Ùen Microsoft
58. By default, on which page the header or the Word (Ùee DevÙe Office Øees«eecme ceW) "Go To" [eÙeuee@ie yee@keäme
footer is printed? Keesuelee nw~
ef[Heâe@uš ™he mes, efkeâme he=‰ hej Meer<e& uesKe Ùee heeo uesKe Fmekeâe GheÙeesie efkeâmeer hespe vebyej, ueeFve vecyej, yegkeâceeke&â, Hegâšveesš Ùee
cegefõle efkeâÙee peelee nw? keâceWš pewmeer ÛeerpeeW hej meerOes peeves kesâ efueS efkeâÙee peelee nw~
(a) On first page Ùen Find & Replace [eÙeuee@ie yee@keäme keâe Skeâ Yeeie neslee nw,
(b) On alternate page
(c) On every page
uesefkeâve Ùes meerOes "Go To" šwye keâes SefkeäšJe keâjlee nw~
(d) None of these/Fveces mes keâesF& veneR 61. What is a Firewall in Computer Network?
kebâhÙetšj vesšJeke&â ceW HeâeÙejJee@ue keäÙee nw?
Ans. (c) : Header (Meer<e& uesKe) Deewj Footer (heeo uesKe) Jes Yeeie
nesles nw, pees efkeâmeer omleeJespe kesâ oj he=‰ kesâ Thej (Header) Ùee veerÛes (a) The physical boundary of Network
(b) An operating system of computer Network
(Footer) ceW efoKeeF& osles nw~ peye nce Microsoft Word Ùee efkeâmeer
(c) A system designed to prevent unauthorized
DevÙe Je[& Øeesmesefmebie mee@HeäšJesÙej ceW keâesF& omleeJespe lewÙeej keâjles nQ, lees
access
ef[Heâe@uš ™he mes Header Deewj Footer nj he=‰ hej efoKeeF& osles nw~ (d) A web browsing Software
Fmekeâe celeueye Ùen nw efkeâ Ùeefo Deeheves Skeâ yeej Header Ùee Footer
HeâeÙejJee@ue Skeâ megj#ee ØeCeeueer (Security System)
Ans. (c) :
[euee, lees Jen Deheves Deehe meYeer he=‰eW hej ueeiet nes peeÙesiee- peye lekeâ
nesleer nw pees keâchÙetšj vesšJeke&â ceW DeveefOeke=âle hengBÛe (Unauthorized
Deehe keâesF& efJeMes<e mesefšbie pewmes "Different First Page" Ùee
access) keâes jeskeâves kesâ efueS ef[peeFve keâer peeleer nw~ HeâeÙejJee@ue Skeâ
"Odd/Even Pages Different" keâe GheÙeesie veneR keâjles~
Ssmee mee@HeäšJesÙej Ùee ne[&JesÙej neslee nw pees Deehekesâ keâchÙetšj Ùee
59. Which operator has highest precedence in
*/%?/efvecve ceW mes */% keâer efkeâme Operator ces meyemes vesšJeke&â keâes Fbšjvesš Ùee DevÙe vesšJeke&â mes Deeves Jeeues Kelejveekeâ [sše,
DeefOekeâ hetJe&lee nw? JeeÙejme nwkeâme& Deeefo mes yeÛeelee nw~ Ùen vesšJeke&â ceW Deeves peeves Jeeues
(a) *
[sše keâes efHeâušj keâjlee nw Deewj Ùen leÙe keâjlee nw efkeâ keâewve-meer
(b) / peevekeâejer Devoj Dee mekeâleer nw Deewj keâewve meer veneR~
(c) % 62. The IETF standards of documents are called
(d) All have same precedence/meYeer keâer meceeve hetJe&lee IETF ceevekeâeW kesâ omleeJespe keânueeles nQ
Ans. (d) : C, C++, Java, Python pewmeer DeefOekeâebMe Øees«eeefcebie (a) RFC (b) RCF
Yee<eeDeeW ceW, efvecveefueefKele leerveeW Dee@hejsšj- (c) ID (d) None of these
*(iegCee/Multiplication) Ans. (a) : IETF keâe hetje veece (Internet Engineering Task
/(Yeeie/division) Force) nw~
%(cee@[dÙetueme/Remainder) Ùen Skeâ mebmLee nw pees Fbšjvesš mes mecyebefOele lekeâveerkeâer ceevekeâeW keâes
meYeer keâer meceeve ØeeLeefcekeâlee (Same Precedence) nesleer nw~ (Standards) efJekeâefmele keâjleer nw~

Bihar STET 75 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
IETF Éeje yeveeS ieÙes ceevekeâeW kesâ omleeJespe keâes RFC keâne peelee nw~ [sše hewkesâš keâes Gmekesâ iebleJÙe (Destination) lekeâ hengBÛeeves kesâ efueS
RFC keâe DeLe&: Request For Comments Ùes omleeJespe Fbšjvesš kesâ keâewve mee jemlee (Route) Fmlesceeue efkeâÙee peeSiee~
Øeesšeskeâe@ue, efmemšce Deewj Øeef›eâÙeeDeeW keâes heefjYeeef<ele keâjles nQ, pewmes- peye keâesF& [sše vesšJeke&â kesâ efkeâmeer ef[JeeFme mes efvekeâuelee nw, lees Jen
∎ TCP/IP keâF& vesšJekeäme& mes neskeâj iegpej mekeâlee nw~ jeGšj Gme [sše keâes Gmekesâ
∎ HTTP iebleJÙe lekeâ henBgÛeeves kesâ efueS meyemes GheÙegkeäle jemlee Ûegvelee nw Deewj Ùes
∎ DNS..etc. jemles jeGefšbie šsyeue ceW ope& nesles nQ~
63. Which data communication method is used to jeGefšbie šsyeue ceW efvecve peevekeâejer nesleer nw–
transmit the data over a serial communication
∎ iebleJÙe IP S[^sme (Destination IP)
link?
∎ meyevesš ceemkeâ (Subnet mask)
Serial Communication Link hej [sše mebÛeeefjle
keâjves kesâ efueS efkeâme [sše mebÛeej heæefle keâe GheÙeesie ∎ Deieuee ne@he (Next Hop)– Deieuee jeGšj keâneB nw~

neslee nw? ∎ FbšjHesâme (Interface)– keâewve mee heesš& Fmlesceeue nesiee~

(a) Simplex ∎ cewefš^keâ (Metric)– jemles keâer ueeiele Ùee ØeeLeefcekeâlee

(b) Half-duplex 66. Which of the following is not External Security
(c) Full-duplex Threats?
(d) All of these/Fveces mes meYeer efvecveefueefKele ceW mes keâewve mee yeenjer megj#ee Kelejs veneR nw?
Ans. (d) : ‘Serial Communication Link’ Jen mebÛeej ceeOÙece (a) Front-door Threats
nw efpemeceW [sše Skeâ meceÙe ceW Skeâ efyeš kesâ ™he ceW Skeâ kesâ yeeo Skeâ (b) Back-door Threats
(c) Underground Threats
Yespee peelee nw~ Ùen [sše mebÛeej keâer ieefle keâes efveÙebef$ele keâjves Deewj
(d) Denial of Service (DoS)
uecyes otjer lekeâ mebÛeej kesâ efueS yengle GheÙeesieer neslee nw~
Ans. (c) : Front door Threats– Ùen yeenjer nceueeW keâe
Serial Communication leerve Øekeâej keâer [sše heæefleÙeeW
meeceevÙe lejerkeâe nw, efpemeceW nceueeJeej JewOe uee@efieve ›esâ[WefMeÙeume (pewmes
(Communication Modes) keâe meceLe&ve keâjlee nw~
Ùetpejvesce Deewj heemeJe[&) kesâ peefjS efmemšce ceW ØeJesMe keâjlee nw~
(i) Simplex
(ii) Half-Duplex GoenjCe– efHeâefMebie (Phishing) mes heemeJe[& Ûegjevee~ Ùen Skeâ
(iii) Full-Duplex yeenjer Keleje nw~
64. What is the minimum header size of an IP Back-door Threats– FmeceW nwkeâj Ùee keâesF& mee@heäšJesÙej efÚhee
packet? ngDee jemlee yevee ueslee nw efpememes Jen efyevee Devegceefle kesâ efmemšce ceW Dee
IP hewkesâš keâe vÙetvelece ns[j Deekeâej keäÙee nw? pee mekeâlee nw~
(a) 16 bytes (b) 10 bytes GoenjCe– š^espeve JeeÙejme pees yewkeâ[esj Keesuelee nw~ Ùen Yeer Skeâ
(c) 20 bytes (d) 32 bytes yeenjer Keleje nw~
Ans. (c) : IP (Internet Protocol) Packet keâe ns[j Jen efnmmee Denial of Service (DoS)– Ùen Skeâ yeenjer nceuee neslee nw
neslee nw pees vesšJeke&â keâes Ùen peevekeâejer oslee nw efkeâ [sše keâes kewâmes Deewj efpemeceW meJe&j Ùee vesšJeke&â keâes š^wefHeâkeâ mes Yej efoÙee peelee nw leeefkeâ
keâneB Yespelee nw~ IP ns[j kesâ keâF& Heâeru[dme nesleer nw pewmes efkeâ- Demeueer Ùetpeme& keâes mesJee ve efceue mekesâ~
∎ Version Underground Threats– keâesF& efJeefMe° Ùee meeceevÙe meeFyej
∎ Header Length megj#ee ßesCeer veneR nw~ Ùen Skeâ mhe° Meyo nQ, Deewj meeFyej megj#ee ceW
∎ Source Address
ØeÛeefuele šce& veneR nw~
∎ Destination Address
∎ Time to Live (TTL) 67. What is the IP Address range of APIPA?
∎ Protocol
APIPA keâer IP helee Øemeej keäÙee nw?
∎ Checksum Deeefo~ (a) 169.254.0.1 to 169.254.0.254
(b) 169.254.0.1 to 169.254.0.255
∎ IP Header keâe vÙetvelece Deekeâej 20 Bytes neslee nw~
(c) 169.254.0.1 to 169.254.255.254
65. Routing table of a router keeps track of (d) 169.254.0.1 to 169.254.255.255
Skeâ jeGšj keâe jeGefšbie šsyeue vepej jKelee nw Ans. (c) : APIPA (Automatic Private IP Addressing)
(a) MAC Address Assignments Skeâ megefJeOee nw pees Windows pewmes Dee@hejsefšbie efmemšce ceW nesleer nw,
(b) Port Assignments to network devices pees leye GheÙeesie nesleer nw peye keâesF& keâchÙetšj DHCP meJe&j mes IP
(c) Distributed IP addresses to network devices
Øeehle veneR keâj heelee nw~
(d) Routes to use for forwarding data to its
destination ∎ APIPA keâe IP Address Range neslee nw:

Ans. (d) : jeGefšbie šsyeue (Routing Table)– Skeâ jeGšj ceW 169.254.0.1 mes 169.254.255.254 lekeâ Ùen jWpe IETF Éeje
ceewpeto Skeâ Øekeâej keâe [sše šsyeue neslee nw, pees Ùen leÙe keâjlee nw efkeâ RFC 3927 ceW heefjYeeef<ele keâer ieF& nw~
Bihar STET 76 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
68. Which of the following is not the possible ways Ans. (d): Int (Integer) Skeâ yegefveÙeeoer [sše Øekeâej (Primitive
of data exchange?/ efvecveefueefKele ceW mes keâewve [sše Data Type) nw, pees hetCeeËkeâ (pewmes 1, –5, 100) Deeefo keâes mšesj
efJeefveceÙe kesâ mebYeeefJele lejerkesâ veneR nw? keâjlee nw~
(a) Simplex (b) Multiplex
72. Which option can be used to set custom timing
(c) Half-duplex (d) Full-duplex for slides in a presentation?
Ans. (b) : Simplex Skeâ Ssmee lejerkeâe nw efpemeceW [sše kesâJeue Skeâ efkeâmeer Øemlegefle ceW mueeF[ kesâ efueS keâmšce šeFefcebie mesš
efoMee ceW Ûeuelee nw, Half-duplex ceW [sše oesveeW efoMeeDeeW ceW pee keâjves kesâ efueS efkeâme efJekeâuhe keâe GheÙeesie efkeâÙee pee
mekeâlee nw uesefkeâve Skeâ meceÙe ceW Skeâ efoMee ceW, Full-duplex ceW [sše mekeâlee nw?
oesveeW efoMeeDeeW ceW Skeâ meeLe Ûeuelee nw, peyeefkeâ Multiplex [sše
(a) Slider Timing (b) Slider Timer
SkeämeÛeWpe keâe lejerkeâe veneR yeefukeâ Skeâ lekeâveerkeâ nw, efpememes Skeâ meeLe (c) Rehearsal (d) Slide Show Setup
keâF& [sše efmeiveue Skeâ ner ueeFve hej Yespes pee mekeâles nQ, FmeefueS mener
Ans. (c) : peye Deehe efkeâmeer Øemlegefle (Presentation) ceW mueeF[ kesâ
Gòej Multiplex nw~
efueS keâmšce šeFefcebie mesš keâjvee Ûeenles nQ, lees 'Rehearsal' efJekeâuhe
69. The management of data flow between
computers or devices or between nodes in a
keâe GheÙeesie efkeâÙee peelee nw~ Fme efJekeâuhe mes Deehe mueeF[ Mees keâes
network is called Skeâ yeej Ûeuee keâj nj mueeF[ hej efkeâlevee meceÙe osvee nw, Ùen leÙe
kebâhÙetšj Ùee GhekeâjCeeW kesâ yeerÛe Ùee vesšJeke&â ceW vees[dme kesâ keâj mekeâles nQ~ Fmekesâ yeeo 'PowerPoint' Deehekesâ Éeje efoÙes ieÙes
yeerÛe [sše ØeJeen keâe ØeyebOeve keâne peelee nw meceÙe keâes ‘mueeF[ šeFefcebie’ kesâ ™he ceW mesJe keâj ueslee nw~
(a) Flow Control (b) Data Control 73. Variables which can be accessed inside a
(c) Data Management (d) Flow Management module of the program is called
Ans. (a) : ‘‘Flow Control’’ [sše mebÛeej ceW Skeâ lekeâveerkeâ nw JesefjSyueme efpemes Øees«eece kesâ Skeâ Module kesâ Devoj
efpemekeâe GheÙeesie kebâhÙetšj Ùee vesšJeke&â vees[dme kesâ yeerÛe [sše kesâ ØeJeen Skeämesme efkeâÙee pee mekeâlee nw, Gmes keâne peelee nw
keâes efveÙebef$ele keâjves kesâ efueS efkeâÙee peelee nw, leeefkeâ efjmeerJej DeesJejuees[ (a) Global (b) Auto
ve nes peeS Deewj [sše kegâMeueleehetJe&keâ mLeeveebleefjle nes mekesâ~ (c) Static (d) Local
Fmekeâe GheÙeesie efJeMes<e ™he mes vesšJeefkeËâie Øeesšeskeâe@ue ceW efkeâÙee peelee nw Ans. (d) : Local variables Jes JesefjSyeume nesles nQ pees efmehe&â Gmeer
pewmes efkeâ TCP (Transmission Control Protocol)~ hebâkeäMeve Ùee cee@[Ÿetue kesâ Devoj Skeämesme efkeâÙes pee mekeâles nQ efpemeceW Jes
70. What does the port number in a TCP Ieesef<ele (declare) efkeâÙes ieÙes nQ~ Jes Øees«eece kesâ DevÙe efnmmeeW mes efÚhes
connection specify? (Hidden) jnles nQ~
TCP keâveskeäMeve ceW, heesš& vebyej keäÙee efveefo&° keâjlee nw? 74. Which key can be used to view slide show?
(a) It specifies the communication process on the mueeF[ Mees osKeves kesâ efueS efkeâme kegbâpeer keâe GheÙeesie
two-and systems
efkeâÙee peelee nw?
(b) It specifies the quality of the data &
connection (a) F5 (b) F2
(c) It specifies the size of data (c) F7 (d) F8
(d) All of these./FveceW mes meYeer Ans. (a) : ØespesvšsMeve mee@heäšJesÙej Éeje lewÙeej keâer ieÙeer mueeF[dme keâes
Ans. (a) : TCP keâveskeäMeve ceW, heesš& vecyej keâe GheÙeesie Ùen Mees (show) keâjves kesâ efueS Mee@š&keâš kegbâpeer (shortcut key) 'F5'
efveOee&efjle keâjves kesâ efueS efkeâÙee peelee nw efkeâ efkeâmeer efoÙes ieÙes efmemšce keâe GheÙees
i e ef k eâÙee peelee nw~
hej keâewve-meer mesJee Ùee ShueerkesâMeve [sše keâes Yespe jner nw Ùee Øeehle keâj 75. To store character or text data we need
jner nw~ Character Ùee Text Data keâes meb«enerle keâjves kesâ efueS
GoenjCe– nceW pe™jle nesleer nw
∎ Heesš& 80 = HTTP (Jesye yeÇeGefpebie) (a) Numeric variable (b) String variable
∎ Heesš& 443 = HTTPS (efmekeäÙeesj Jesye) (c) Logical function (d) Array
∎ heesš& 25 = SMTP (F&cesue Yespevee) Ans. (b) : Character Ùee text data keâes store keâjves kesâ efueS
Fmekeâe celeueye– heesš& vebyej Ùen efveefo&° keâjlee nw efkeâ oes Sb[ 'String variable' keâer DeeJeMÙekeâlee nesleer nw~ String Skeâ [sše
efmemšce pewmes (keäueeFbš Deewj mejJej) kesâ yeerÛe mebÛeej efkeâme ShueerkesâMeve šeFhe nw pees De#ejeW, MeyoeW Ùee JeekeäÙeeW keâes meb«eefnle keâjves kesâ efueS
kesâ efueS nes jne nw~ GheÙeesie neslee nQ~
71. ………. is a basic data type. 76. How can we stop a slide show?
..............Skeâ yegefveÙeeoer [sše Øekeâej nw~ nce Skeâ mueeF[ Mees keâes kewâmes jeskeâ mekeâles nQ?
(a) Array (b) Struct (a) Press the right arrow (b) Press Ctrl + A
(c) Boolean (d) Int (c) Press Escape (d) Press Ctrl + S

Bihar STET 77 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
Ans. (c): mueeF[ Mees (slide show) keâes jeskeâves kesâ efueS Ùee yevo ∎ mueeF[ ceW [^e@ efkeâÙes ieÙes Dee@ypeskeäšme Deewj Deeke=âefleÙeeB (Shapes)
(close) keâjves kesâ efueS Escape (Esc) kegbâpeer oyeeF& peeleer nw~ Yeer peesÌ[er pee mekeâleer nw~
Right Arrow ( ) kegbâpeer keâe GheÙeesie Deieueer mueeF[ ceW peeves kesâ ∎ mueeF[ ceW efkeäueheDeeš&, efÛe$e Deewj efJepegDeume (pewmes Fcespe Ùee Ûeeš&)
efueS efkeâÙee peelee nw~ Yeer peesÌ[s pee mekeâles nw~
77. Power Point can display data from which of the 81. Right clicking on something in word
following add-in software of MS office? Meyo ceW efkeâmeer Ûeerpe hej jeFš efkeäuekeâ keâjvee
Power Point, MS office kesâ efvecveefueefKele Ss[-Fve (a) Deletes the objects
mee@HeäšJesÙej ceW mes keâewve mee [sše ØeoefMe&le keâj mekeâlee nw? (b) Is nothing but the right mouse button is there
(a) Organization Chart for left handed people
(b) Photo Album (c) Opens the short-cut list
(c) Equation Editor (d) Insets the picture
(d) All of these/FveceW mes meYeer Ans. (c) : Microsoft word ceW peye Deehe efkeâmeer Ûeerpe (pewmes
Ans. (d) : Microsoft Powerpoint ceW efoÙes ieS meYeer Ss[-Fve šskeämš, Fcespe, šsyeue Deeefo) hej jeFš efkeäuekeâ keâjles nQ, lees Skeâ
mee@heäšJesÙej efkeâmeer ve efkeâmeer ™he ceW [sše ØeoefMe&le keâj mekeâles nw: Mee@š&keâš cesvet (shortcut list) Keguelee nw~ Fme Mee@š&keâš cesvet ceW Gme
Organization chart:– Ùen mebie"ve keâer mebjÛevee keâes «eeefheâkeâ ™he Jemleg mes mebyebefOele keâF& GheÙeesieer efJekeâuhe nesles nQ pewmes–
ceW efoKeelee nw, pees [sše keâe Skeâ Øekeâej nw~ Cut, Paste, Font, Copy, Delete, Hyperlink
Photo Album:– Ùen lemJeerjes (visual data) keâes mueeF[dme ceW 82. > = is a/an
efoKeeves kesâ efueS GheÙeesie neslee nw~ > = nw Skeâ
78. the spelling dialog box can be involved by (a) Instance (b) Design
choosing spelling from……..menu. (c) Data type (d) Operator
……..cesvÙeg mes Spelling Ûegvekeâj Spelling [eÙeuee@ie Ans. (d) : '> = ' Skeâ Dee@hejsšj (operator) nw efpemes "greater
yee@keäme keâes Meeefceue efkeâÙee pee mekeâlee nw~ than or equal to" (yeÌ[e Ùee yejeyej) keânles nw~ Ùen Dee@hejsšj oes
(a) Tools (b) View ceeveeW (values) keâer leguevee keâjves kesâ efueS Fmlesceeue neslee nw~
(c) File (d) Insert 83. The autocorrect tool
Ans. (a) : Spelling [eÙeuee@ie yee@keäme keâes Keesueves kesâ efueS Autocorrect tool nw
'Tools' cesvÙet mes 'Spelling efJekeâuhe Ûegvee peelee nw FmeefueS mener (a) Provides statistics about your document
Gòej (A) Tools nw~ (b) Displays words with the same or similar
79. Which one is a primary key in a bank customer meaning
table? (c) Checks the grammar in the document
yeQkeâ «eenkeâ leeefuekeâe ceW keâewve meer Skeâ ØeeLeefcekeâ kegbâpeer (d) Checks for misspelled words as you type and
nw? correct them as defined
(a) UID number (b) Admission number Ans. (d) : 'Autocorrect Tool' Skeâ Ssmee štue nw pees pewmes ner
(c) Account number (d) PAN Deehe šeFhe keâjles nQ, Deehekesâ Éeje ieuele šeFhe efkeâÙes ieÙes MeyoeW keâes
Ans. (c) : ØeeLeefcekeâ kegbâpeer (primary key) Jen heâeru[ nesleer nw pees mJele: mener (Correct) keâjlee nw, Deiej Jen Meyo henues mes Define
efkeâmeer leeefuekeâe (table) ceW nj efjkeâe[& keâes DeefÉleerÙe (unique) ™he (efveOee&efjle) efkeâÙee ieÙee nes~
mes henÛeeveleer nw~ FmeceW oesnjeJe (duplicate) Ùee efjòeâ ceeve (null GoenjCe:– Deiej Deehe šeFhe keâjles nQ teh lees Auto correct Gmes
value) vener neslee~ Deheves Deehe megOeej osiee 'the'~
80. Power Point slide can have 84. Which is encapsulated in a class?
Power Point slide nes mekeâlee nw Skeâ Class ceW keâewve mee Encapsulated efkeâÙee peelee nw?
(a) Title, text, graphs (a) Program & Process
(b) Drawn objects, shapes (b) Function and Data
(c) Clipart, drawn art, visual (c) File and Disk
(d) Any of these (d) Variable and Constant
Ans. (d) : Power Point mueeF[ Skeâ Øemlegefle (Presentation) Ans. (b) : Encapsulation, Skeâ Object-Oriented
keâe efnmmee nesleer nw, efpemeceW nce Deueie-2 Øekeâej keâer meece«eer Programming (OOP) keâer cegKÙe efJeMes<elee nw~ Fmekeâe celeueye nw
(content) peesÌ[ mekeâles nw~ efkeâ [sše (Data) Deewj Gme [sše hej keâece keâjves Jeeues hebâkeäMeve
∎ mueeF[ ceW Deehe Meer<e&keâ (Title), šskeämš (Text) Deewj «eeheäme (Function) oesveeW keâes Skeâ Class Skeâ meeLe Úgheekeâj
(Graphs) peesÌ[ mekeâles nQ~ (encapsulate keâjkesâ) jKee peelee nw~
Bihar STET 78 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
85. To display hyperlink field in a Work document, ∎ Animal to cat ceW 'Animal' Skeâ meeceevÙe ßesCeer nw, Deewj cat
you can press the
Work omleeJespe ceW, Hyperlink Heâeru[ ØeoefMe&le keâjves
GmeceW Skeâ efJeMes<e Øekeâej keâe peeveJej nw~
kesâ efueS Deehe oyee mekeâles Qw Ùen General Specific keâe mecyevOe nw~
(a) Ctrl + Shift + F9 key 89. The command Cross reference is available in
(b) Shift + F9 key keâceeb[ Cross reference GheueyOe nw
(c) Ctrl + Alt key (a) View menu (b) Format menu
(d) None of these/FveceW mes keâesF& veneR (c) Insert menu (d) Tools menu
Ans. (b) : Microsoft word ceW peye Deehe Skeâ Hyperlink Ùee Ans. (c) : keâceeb[ 'Cross-reference' Microsoft word Ùee
keâesF& Yeer field (pewmes Date, Page Number, Deeefo) keâe keâes[ DevÙe Je[& Øeesmesefmebie mee@heäšJesÙej ceW Insert cesvet kesâ Debleie&le heeÙeer peeleer
osKevee Ûeenles nQ, lees Deehe 'Shift + F9' oyee mekeâles nQ~ nw~
Fmemes word heâeru[ keâe actual code (keâes[ Ùee met$e) efoKeelee nw, Ùen efJekeâuhe omleeJespe ceW efkeâmeer DevÙe Yeeie (pewmes heading, figure,
pewmes, meeceevÙe ™he ceW: click here table Deeefo) keâe meboYe& peesÌ[ves kesâ efueS GheÙeesie efkeâÙee peelee nw~
shift +F9 oyeeves hej:
90. Column or Field of a table is called
{ HYPER LINK
" https:// www.example.com"}
efkeâmeer leeefuekeâe keâe mlecYe Ùee Heâeru[ keâne peelee nw
Ùen megefJeOee leye keâece Deeleer nw peye Deehe heâeru[ kesâ heerÚs keâe uee@efpekeâ (a) Data type (b) Row name
Ùee efuebkeâ osKevee Ùee Sef[š keâjvee Ûeenles nw~ (c) Attribute (d) Entity name
86. Which is an Abstract data type? Ans. (c) : [sšeyesme ceW efkeâmeer leeefuekeâe (table) kesâ mlecYe
efvecve ceW mes keâewve Skeâ Abstract [sše Øekeâej nw? (column) keâeW 'Attribute' keâne peelee nw~ Ùen šsyeue ceW meb«eefnle
(a) Class (b) Double [sše keâer efJeMes<elee (Property) Ùee heâeru[ keâes oMee&lee nw~
(c) Int (d) String  Attributes = Column (mlecYe/heâeru[)
Ans. (a) : Abstract Data Type (ADT) keâe celeueye nw Skeâ  Entity = Table (mebheefòe/FkeâeF&)
Ssmee [sše šeFhe pees kesâJeue Ùen yeleelee nw efkeâ [sše keâe Fmlesceeue  Row = Record (hebefòeâ)
efkeâÙee pee mekeâlee nw, uesefkeâve Ùen vener yeleelee efkeâ Gmekesâ heerÚs keâer  Data type = [sše keâe Øekeâej (pewmeW Integer, varchar Deeefo)
JeemleefJekeâ Implementation keäÙee neslee nw~ 91. TCP/IP is a
∎ Class Skeâ ADT (Abstact Data Type) nesleer nw~
TCP/IP nw Skeâ
∎ Ùen yeleeleer nw efkeâ [sše Deewj Gme hej nesves Jeeues Dee@hejsMeve kewâmes
(a) Network Hardware
nesves ÛeeefnS, uesefkeâve Gmekeâer JeemleefJekeâ Implementation Deboj (b) Network Software
Úgheer nesleer nw~ (c) Protocol
87. To cut or copy text you must first (d) None of these/FveceW mes keâesF& veneR
hee" keâes keâešves Ùee keâe@heer keâjves kesâ efueS Deehekeâes henues Ans. (c) : TCP/IP (Transmission Control
DeJeMÙe keâjvee ÛeeefnS Protocol/Internet Protocol) Skeâ vesšJeke&â Øeesšeskeâe@ue nw, efpemekeâe
(a) Click the remove/duplicate button GheÙeesie keâchÙetšj vesšJeke&â, efJeMes<ekeâj Fbšjvesš hej [sše Yespeves Deewj
(b) First highlight the text and click the Copy or Øeehle keâjves kesâ efueS efkeâÙee peelee nw~ Ùen oes cegKÙe Øeesšeskeâe@ue keâe
Cut command from edit menu
mecetn nw- TCP Deewj IP pees efceuekeâj [sše š^ebmeefceMeve keâes megjef#ele
(c) Click on File menu
Deewj JÙeJeefmLele yeveeles nQ~
(d) None of these/FveceW mes keâesF& veneR
92. OSI stands for
Ans. (b) : efkeâmeer Yeer hee" (text) keâes keâe@heer (copy) Ùee keâš
OSI keâe hetje veece nw
(cut) kesâ efueS meyemes henues Gme hee" keâes neFueeFš (highlight) Ùee
(a) Open Soft ID
efmeueskeäš (select) keâjvee DeeJeMÙekeâ neslee nw~ Gmekesâ yeeo Deehe Edit (b) Open System ID
cesvet mes copy Ùee cut keâceeb[ keâe GheÙeesie keâj mekeâles nQ~ (c) Open System Interconnection
88. Which is correct for inheritance? (d) Open Source Information
JebMeeveg›eâce kesâ efueS keâewve mee mener nw? Ans. (c) : Open System Interconnection (OSI), Ùen Skeâ
(a) Animal to Cat (b) Variable to constant cee@[ue nw efpemes ISO Éeje vesšJeefkeËâie kesâ ceevekeâ kesâ ™he ceW
efJekeâefmele
(c) Lock to key (d) Data to Program efkeâÙee peelee nw~
Ans. (a) : ‘JebMeeveg›eâce’ (Hierarchy) keâe celeueye neslee nw- Skeâ 93. The Internet was originally a project of which
Ssmee mecyevOe efpemeceW Skeâ Ûeerpe otmejer Ûeerpe mes JÙeehekeâ (General) agency?
nesleer nw Deewj otmejer Ûeerpe Gmemes efJeMes<e (Specific) nesleer nw~ Fbšjvesš cetue ™he mes efkeâme SpeWmeer keâe Øeespeskeäš Lee?
Bihar STET 79 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
 (a) ARPA Ans. (a): HTML keâe hetCe& ™he neFhej šskeämeš ceeke&âDehe uewiJeWpe
(b) NSF (Hyper Text Markup Language) nw~ Ùen Skeâ ceeke&âDehe
(c) NSA
uewiJeWpe nw~ Fmekeâes 90's kesâ oMekeâ ceW ‘efšce yeve&j ueer’ kesâ Éeje
(d) None of these/FveceW mes keâesF& venber efJekeâefmele efkeâÙee ieÙee Lee~
Ans. (a) : Fbšjvesš keâes cetue ™he mes S[Jeebm[ efjmeÛe& Øeespeskeäšdme
98. Computer Network is
SpeWmeer (ARPA) Éeje efJekeâeme efkeâÙee ieÙee Lee, pees yeeo ceW US Computer Network nw
Department of Defense keâe Skeâ efnmmee yeve ieF&~ ARPA ves
(a) Collection of hardware components and
ARPANET veece mes Skeâ ØeejbefYekeâ vesšJeke&â keâe efJekeâeme efkeâÙee, pees computers
Fbšjvesš kesâ efueS Skeâ De«eotle Lee~ (b) Interconnected by communication channels
94. HTML is used to create (c) Sharing of resources and information
HTML................ keâes yeveeves kesâ efueS GheÙeesie efkeâÙee (d) All of these/FveceW mes meYeer
peelee nw~ Ans. (d) : Computer Network Jen ØeCeeueer nw efpemeceW-
(a) Machine language program ne[&JesÙej kebâheesveWšdme Deewj kebâhÙetšjes keâe meb«en neslee nw~ Ùen mebÛeej
(b) High level program ÛewveueeW kesâ ceeOÙece mes Deeheme ceW pegÌ[s nesles nw leeefkeâ mebmeeOeveeW Deewj
(c) Web page peevekeâejer keâes meePee efkeâÙee pee mekesâ~
(d) Web server
99. Protocols are
Ans. (c) : HTML (Hyper Text Markup Language) keâe øeesšeskeâe@ue nQ
GheÙeesie Jesye hespe yeveeves kesâ efueS efkeâÙee peelee nw Ùen Skeâ ceeke&âDehe
(a) Agreements on how communication
Yee<ee nw pees Jesye hespe keâer mebjÛevee (Structure) lewÙeej keâjleer nw, pewmes components and DTEs are to communicate
efkeâ nsef[bie, hewje«eeheâ, efuebkeâ Fcespe Deeefo~ (b) Logical communication channels for
95. The computer jargon wwww, stands for transferring data
keâchÙetšj Meyopeeue wwww keâe hetje veece nw (c) Physical communication channels used for
(a) World Wide Web Worm transferring data
(b) World Wide Wildlife Web (d) None of these/FveceW mes keâesF& veneR
(c) World Wide Women's Web Ans. (a) : Øeesšeskeâe@ue mebÛeej kesâ efveÙeceeW Deewj Øeef›eâÙeeDeeW keâe Skeâ mesš
(d) World Wide Women's Week nw pees [sše mLeeveebleefjle keâjves kesâ efueS mebJeeo keâjves Jeeues IeškeâeW kesâ
Ans. (a) : WWWW (World Wide Web Worm) Skeâ yeerÛe mecePeewles keâer JÙeeKÙee keâjles nQ~ Øeesšeskeâe@ue [sše mebÛeej ceW
ØeejbefYekeâ meÛe& Fbpeve Lee efpemes 1994 ceW efJekeâefmele efkeâÙee ieÙee Lee~ cenlJehetCe& Yetefcekeâe efveYeeles nw, efkeâ efJeefYevve ef[JeeFme Skeâ otmejs kesâ
Note:– Ùen WWW (World Wide Web) mes Deueie nw, pees meeLe mener {bie mes mebJeeo keâj mekeWâ~ kegâÚ meeceevÙe Øeesšeskeâe@ue pewmes :–
Fbšjvesš hej JesyehespeeW keâe vesšJeke&â neslee nw~ TCP/IP, HTTP, FTP Deewj SMTP Deeefo~
96. A website's front page/main page is called
100. Two devices are in network is
Skeâ JesyemeeFš kesâ øebâš hespe Ùee cegKÙe hespe keâes keâne
oes ef[JeeFme vesšJeke&â ceW nQ, Deiej
peelee nw
(a) A process in one device is able to exchange
(a) Browser Page (b) Search Page information with a process in another device
(c) Home Page (d) Bookmark (b) A process is running on both devices
Ans. (c) : nesce hespe (Home Page) JesyemeeFš keâe Jen henuee hespe (c) PIDs of the processes running of different
neslee nw pees keâesF& GheÙeesiekeâlee& (User) leye osKelee nw peye Jen devices are same
JesyemeeFš hej peelee nw~ (d) None of these/FveceW mes keâesF& veneR
Ùen JesyemeeFš keâe cegKÙe ØeJesMe Éej neslee nw~ Ans. (a) : vesšJeefkeËâie ceW, Deiej oes ef[JeeFme Skeâ vesšJeke&â ceW nw Deewj
 yeÇeGpej hespe, Skeâ yeÇeGpej kesâ Devoj efkeâmeer Yeer Jesye hespe keâes meboefYe&le Skeâ ef[JeeFme keâer Øeesmesme otmejer ef[JeeFme keâer Øeesmesme mes peevekeâejer keâe
keâjlee nw, peyeefkeâ ‘‘nesce heWpe’’ JesyemeeFš keâe cegKÙe hespe neslee nw~ Deeoeve-Øeoeve keâj mekeâleer nw, lees Fmekeâe celeueye ns efkeâ Jes vesšJeke&â ceW
97. Full form of HTML is peg Ì[s ngS nQ Deewj meheâueleehetJe&keâ keâcÙetefvekesâš keâj mekeâles nw~
HTML keâe hetje ™he nw 101. A high quality CAD system uses which of the
(a) Hyper Text Markup Language following for printing, drawing and graphs?
(b) Hyper Text Manipulation Language GÛÛe iegCeJeòee Jeeuee CAD efmemšce efØebefšbie, [^e@Fbie Deewj
(c) Hyper Text Managing Links «eeHeâ kesâ efueS efvecveefueefKele ceW mes efkeâmekeâe GheÙeesie
(d) Hyper Text Manipulating Links keâjlee nw?
Bihar STET 80 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
 (a) Dot matrix printer Fmekeâe celeueye, Ùen ueieYeie Gmes ‘4’ oMeceueJe Debkeâes keâer mešerkeâlee
(b) Digital plotter os mekeâlee nQ uesefkeâve Ùeefo meJeeue ceW oes 16 efyeš MeyoeW keâer yeele nes
(c) Line Printer jner nes, lees Fmekeâe celeueye nes mekeâlee nw:
(d) All of these/FveceW mes meYeer oes 16 efyeš Meyo · 32 efyešdme Ùen single precision keâes
Ans. (b) : GÛÛe iegCeJeòee Jeeues CAD efmemšce kesâ efueS efhebÇefšbie, oMee&lee nw~
[^eFbie Deewj «eeheâ kesâ efueS ef[peeršue huee@šj keâe GheÙeesie efkeâÙee peelee  mešerkeâlee: ueieYeie 6-7 decimal digits nesleer nw~
nw~ 104. A CPU contains
huee@efšieb ef[JeeFme CAD/CAM DevegØeÙeesieeW ceW JÙeehekeâ ™he mes Skeâ CPU jKelee nw
GheÙeesie efkeâÙes peeles nQ~ Ùes ef[JeeFme kebâhÙetšj Éeje Øeoeve efkeâÙes ieÙes (a) A card reader and a printing device
jsKeeefÛe$eeW keâes yeveeves kesâ efueS hesve Ùee ceeke&âj keâe GheÙeesie keâjles nw~ Jes (b) An analytical engine and a control unit
(c) A control unit and an arithmetic logic unit
GÛÛe iegCeJeòee Jeeueer jsKeeefÛe$e Øeoeve keâjles nw, pees CAD efmemšce kesâ
(d) An arithmetic logic unit and a card reader
efueS DeeJeMÙekeâ nw~
Ans. (c) : CPU (Central Processing Unit) cegKÙe ™he mes oes
102. Which of the following is not an input device? ØecegKe Ieškeâ mes efceuekeâj yevee neslee nw:
efvecveefueefKele ceW mes keâewve Fvehegš ef[JeeFme veneR nw? (i) Control Unit (CU):– Ùen efveoxMeeW keâes efveÙebef$ele keâjleer nw
(a) OCR Deewj CPU keâes efJeefYeVe efnmmeeW kesâ yeerÛe mecevJeÙe mLeeefhele keâjleer nw~
(b) Optical scanners (ii) Arithmetic Logic Unit:– Ùen DebkeâieefCeleerÙe Deewj leeefke&âkeâ
(c) Voice recognition device ieCeveeSB keâjlee nw~
(d) COM (Computer Output to Microfilm)
105. In most IBM PCs, the CPU, the device drives,
Ans. (d) : OCR (Optical Character Recognition) Skeâ memory expansion slots and active components
Fvehegš ef[JeeFme nw, Fmekesâ Deefleefjòeâ Optical scanners Deewj are mounted on a single board. What is the
'voice recognition' Yeer Fvehegš ef[JeeFme nw pees efkeâ Ùetpej mes data name of this board?
DeefOekeâebMe IBM heermeer ceW, CPU, ef[JeeFme [^eFJeme,
keâes Fvehegš kesâ ™he ceW Øeehle keâjleer nw~
cesceesjer efJemleej muee@š Deewj meef›eâÙe IeškeâeW keâes Skeâ ner
COM (Computer Output to Microfilm) Skeâ DeeGšhegš yees[& hej ueieeÙee peelee nw~ Fme yees[& keâe veece keäÙee nw?
ef[JeeFme nw~ (a) Motherboard (b) Breadboard
103. The accuracy of the floating-point numbers (c) Daughter board (d) Grandmother board
represent able in two 16-bit words of a Ans. (a) : ceojyees[& Skeâ meefke&âš yees[& nw pees keâchÙetšj ceW meYeer
computer is approximately cenlJehetCe& IeškeâeW, pewmes efkeâ CPU ef[JeeFme [^eFJe, cesceesjer efJemleej
kebâhÙetšj kesâ oes 16 efyeš MeyoeW ceW Heäueesefšbie hee@Fbš vebyejeW muee@š Deewj meef›eâÙe Ieškeâes keâes Skeâ meeLe jKelee nw~
keâer mešerkeâlee leeefuekeâe keâe ØeefleefveefOelJe keâjleer nw 106. Magnetic disks are the most popular medium
ueieYeie for
(a) 16 digits ÛegcyekeâerÙe ef[mkeâ meyemes ueeskeâefØeÙe ceeOÙece nw
(b) 6 digits (a) Direct access
(c) 9 digits (b) Sequential access
(d) All of these/FveceW mes meYeer (c) Both of these/FveceW mes oesveeW
Ans. (b) : peye nce 16-Bit MeyoeW ces heäueesefšbie hee@Fbš vebyej keâer (d) None of these/FveceW mes keâesF& veneR
yeele keâjles nw, lees nce Deeceleewj hej single precision floating Ans. (a) : ÛegcyekeâerÙe ef[mkeâ (magnetic disk) pewmes efkeâ ne[&
point format keâer leguevee ceW keâce efyešdme keâer mešerkeâlee (precision) ef[mkeâ [^eFJe (HDD) keâe GheÙeesie 'Direct Access' kesâ efueS efkeâÙee
Jeeues Úesšs heâe@cexš keâer yeele keâj jns nesles nQ~ neueebefkeâ standard peelee nw, keäÙeesefkeâ FmeceW Deehe efkeâmeer Yeer [sše ueeskesâMeve lekeâ meerOes
IEEE 754 format ceW 32 efyeš (single precision) Deewj 64- hengBÛe mekeâles nw efyevee ›eâce ceW Deeies-heerÚs peeves keâer DeeJeMÙekeâlee kesâ~
efyeš (double precision) nesles nw, 16- efyeš heäueesefšbie hee@Fbš keâes  Sequential Access kesâJeue ÛegcyekeâerÙe šshe pewmes ceeOÙeceeW ceW
"half Precision" keâne peelee nw~
GheÙeesie neslee nw peneB [sše keâes ›eâce ceW Skeämesme keâjvee neslee nw~
Half-Precision (16-bit) floating point ceW-
FmeefueS ÛegcyekeâerÙe ef[mkeâ 'Direct Access' ceeOÙece nw~
107. A technique used by codes to convert an analog
 kegâue efyešdme : 16 signal into a digital bit stream is known as
 Sign bit : 1 keâes[ Éeje GheÙeesie keâer ieF& Skeâ lekeâveerkeâ efpemes Sveeuee@ie
 Exponent : 5 bits efmeiveue keâes ef[efpešue efyeš mš^erce ceW yeoueves kesâ efueS
 Fraction (mantissa) : 10 bits. GheÙeesie efkeâÙee peelee nw, Jen nw
Bihar STET 81 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
 (a) Pulse code modulation 111. The main electronic component used in first
(b) Pulse stretcher generation computers was
(c) Query processing henueer heerÌ{er kesâ kebâhÙetšjeW ceW Fmlesceeue nesves Jeeuee cegKÙe
(d) Queue management Fueskeäš^e@efvekeâ Ieškeâ Lee
Ans. (a) : Pulse Code Modulation (PCM) Skeâ lekeâveerkeâ nw (a) Transistors
efpemekeâe GheÙeesie Sveeuee@ie efmeiveue keâes ef[efpešue efyeš mš^erce ceW (b) Vacuum Tubes and Valves
yeoueves kesâ efueS efkeâÙee peelee nw~ (c) Integrated Circuits
FmeceW Sveeuee@ie efmeiveue keâes henues vecetvee (sampling) efheâj (d) None of these/FveceW mes keâesF& veneR
keäJeebšeFpe (quantizing) Deewj Devle ceW yeeFvejer keâes[ ceW yeoueves keâer Ans. (b) : henueer heerÌ{er kesâ keâchÙetšjeW ceW Fmlesceeue nesves Jeeuee cegKÙe
Øeef›eâÙee nesleer nw~ Fueskeäš^e@efvekeâ Ieškeâ JewkeäÙetce šŸetye Deewj Jee@uJe (Vaccum Tubes &
108. Regarding a VDU, which statement is more Valves) Lee~ JewkeäÙetce šŸetye yeÌ[s veepegkeâ Deewj yengle DeefOekeâ efyepeueer
correct? keâer Kehele keâjles Les~ š^e@efpemšj Deewj Fbšer«esšs[ meefke&âš yeeo keâer heeref{ÙeeW
Skeâ VDU kesâ yeejs ceW, keâewve mee keâLeve DeefOekeâ mener nw? kesâ keâcÙetšj ces Fmlesceeue ngS~
(a) It is an output device
112. A dumb terminal has
(b) It is an input device
Skeâ dumb terminal nw
(c) It is a peripheral device
(d) It is hardware item (a) An embedded microprocessor
(b) Extensive memory
Ans. (a) : VDU (Visual Display Unit) Skeâ DeeGšhegš
(c) Independent processing capability
ef[JeeFme neslee nw, Ùen Skeâ Ssmee GhekeâjCe neslee nw, pees keâchÙetšj mes (d) A keyboard and screen
DeeGšhegš keâes ÂMÙe ™he ceW efoKeelee nw, pewmes šskeämš, FceWpe, Jeeref[Ùees
Ans. (d) : Skeâ dumb terminal Skeâ Ssmee ef[JeeFme neslee nQ
Deeefo~ peye Deehe keâeryees[& Ùee ceeGme mes Fvehegš osles nw, lees Gmekeâe
heefjCeece VDU hej efoKeeÙeer oslee nw~ ef p emeceW kes â Jeue keâer y ees [ & Deew j m›eâer v e nes
l eer nw , Deew j Fmekeâe keâes F& mJelev$e
Øeesmesefmebie kewâhesyesefuešer vener neslee~ Ùen efmehe&â Ùetpej Fvehegš keâes cesve
109. A modern electronic computer is a machine
that is meant for
keâchÙetšj (Host) lekeâ Yespelee nw~ Deewj cesve kebâhÙetšj mes Øeehle
Skeâ DeeOegefvekeâ Fueskeäš^e@efvekeâ kebâhÙetšj Skeâ Ssmeer ceMeerve nw DeeGšhegš keâes ef[mhues keâjlee nw~ FmeceW Kego keâe Øeesmesmej Ùee mšesjspe
efpemekeâe celeueye nw vener neslee~
(a) Doing quick mathematical calculations 113. One millisecond is
(b) Input, storage, manipulation and outputting of Skeâ millisecond nw
data (a) I second
(c) Electronic data processing (b) 10th of a second
(d) Performing repetitive tasks accurately (c) 1000th of a second
Ans. (b) : Skeâ DeeOegefvekeâ Fueskeäš^e@efvekeâ keâchÙetšj kesâJeue ieCevee (d) 10000th of a second
(Calculation) keâjves Jeeueer ceMeerve vener nw, yeefukeâ Ùen Skeâ [eše Ans. (c) : 1 second = 1000 milliseconds
Øeesmesefmebie efmemšce nw, pees efvecve keâeÙe& keâjlee nw: Fmekeâe celeueye nw efkeâ 1 millisecond = 1/1000 second FmeefueS,
(i) Input (Fvehegš):– [sše keâes Øeehle keâjvee (pewmes keâeryees[& ceeGme millisecond meskesâC[ keâe 1000 JeeB efnmmee neslee nw~
mes) 114. Modern computers are very reliable but they
are not
(ii) Storage (meb«en):– [sše keâes mLeeÙeer Ùee DemLeeÙeer ™he mes
DeeOegefvekeâ kebâhÙetšj yengle efJeMJemeveerÙe nw uesefkeâve Jes
meb«eefnle keâjvee~
.................veneR nw~
(iii) Manipulation/Processing (ØemebmkeâjCe):– [sše
(a) Fast (b) Powerful
ieCeveeSb Ùee DevÙe Øeesmesefmebie keâjvee~ (c) Infallible (d) Cheap
(iv) (DeeGšhegj):– heefjCeece keâes ØeoefMe&le keâjvee (pewmes m›eâerve, Ans. (c) : "Infallible" keâe DeLe& neslee nw ‘‘ keâYeer ieueleer keâjves
efØebšj hej)~ Jeeuee’’ Ùee ‘DeÛetkeâ’~
110. When was vacuum tube invented?  Ùen JeekeäÙe Ùen keânvee Ûeenlee nw efkeâ keâchÙetšj yengle Yejesmescebo nesles
Vacuum šŸetye keâe DeeefJe<keâej keâye ngDee Lee? nw, efheâj Yeer Jes hetjer lejn DeÛetkeâ vener nesles- GveceW $egefšÙeeB nes mekeâleer
(a) 1900 (b) 1906 nw, Ûeens ne[&JesÙej keâer Jepen mes nes Ùee mee@heäšJesÙej/ceeveJe Éeje
(c) 1910 (d) 1880 Øees«eeefcebie keâer Jepen mes~
Ans. (b) : Vaccum Tube (efveJee&led šŸetye) keâe DeeefJe<keâej 1906 115. Which of the following was a special purpose
ceW 'Lee De Forest' Éeje efkeâÙee ieÙee Lee~ Gvnesves Fmes Audition computer?
veece efoÙee Lee, pees henueer 'triode vaccum tube' Leer~ Ùen efvecveefueefKele ceW mes keâewve mee Skeâ efJeMes<e GÅesMÙe Jeeuee
Fueskeäš^e@efvekeâ efmeiveue keâes yeÌ{eves (amplify) ceW me#ece Leer~ kebâhÙetšj Lee?
Bihar STET 82 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
 (a) ABC ieÙee Lee~ uesefkeâve 1973 ceW Skeâ Decesefjkeâer Deoeuele ves ENIAC kesâ
(b) ENIAC hesšWš keâes DeceevÙe keâj efoÙee, Ùen leÙe keâjles ngS efkeâ ENIAC keâe
(c) EDVAC ef[peeFve "ABC keâchÙetšj (Atanasoff- Berry computer) hej
(d) All of these/FveceW mes meYeer DeeOeeefjle Lee, efpemes John Atanassoff Deewj Berry ves 1937-
Ans. (a) : ABC (Atanasoff-Berry Computer):– Ùen 1942 kesâ yeerÛe efJekeâefmele efkeâÙee Lee~
Skeâ efJeMes<e GösMÙe (special purpose) Jeeuee keâchÙetšj Lee~ Fmes Fme efveCe&Ùe kesâ yeeo ABC keâchÙetšj keâes henues Fueskeäš^e@efvekeâ ef[efpešue
kesâJeue efmemšce Dee@heâ ueerefveÙej FkeäJesMeve keâes nue keâjves kesâ efueS kebâhÙetšj kesâ ™he ceW ceevÙelee efceueveer Meg™ nes ieÙeer~
ef[peeFve efkeâÙee ieÙee Lee~ peyeefkeâ ENIAC Deewj EDVAC Skeâ 119. A physical connection between the
meceevÙe GösMÙe (General Purpose) keâchÙetšj Les~ microprocessor memory and other parts of the
116. SMPS stands for microcomputer is known as/ceeF›eâesØeesmesmej cesceesjer
SMPS keâe celeueye nw Deewj ceeF›eâeskebâhÙetšj kesâ DevÙe YeeieeW kesâ yeerÛe Skeâ
(a) Switched Mode Power Supply Physical Connection keâes peevee peelee nw
(b) Start Mode Power Supply (a) Path
(c) Store Mode Power Supply (b) Address bus
(d) Single Mode Power Supply (c) Route
Ans. (a) : SMPS keâe celeueye nw Switched Mode Power (d) All of these/FveceW mes meYeer
Supply pees Skeâ Fueskeäš^e@efvekeâ hee@Jej mehueeF& nw~ Fmekeâe GheÙeesie Ans. (b) : ceeF›eâesØeesmesmej Deewj cesceesjer (Ùee DevÙe YeeieeW) kesâ yeerÛe
Jeesušspe keâes kegâMeueleehetJe&keâ yeoueves kesâ efueS efkeâÙee peelee nw, pewmes efkeâ [sše kesâ mLeeve (Address) keâes Yespeves kesâ efueS pees Physical
kebâhÙetšj šerJeer, Ûeepe&j ceW~ SMPS Jeesušspe keâes AC mes DC Ùee connection neslee nw, Gmes Address Bus keâne peelee nw~ Ùen
Skeâ Jeesušspe uesJeue mes otmejs Jeesušspe uesJeue ceW yeoueves kesâ efueS kesâJeue S[^sme (heles) keâes š^ebmeheâj keâjlee nw, [sše vener~
efkeâÙee peelee nw, efpememes Ùen meeceevÙe š^ebmeheâece&j keâer leguevee ceW keâce  Address Bus:– cesceesjer Ùee Fvehegš/DeeGšhegš ef[JeeFmesme kesâ heles
ieceea hewoe keâjlee nw Deewj pÙeeoe SefheâefMeSbš neslee nw~ keâes oMee&lee nw~
117. Which of the following storage devices can  Data Bus:– Demeueer [sše keâes š^ebmeheâj keâjlee nw~
store maximum amount of data?
efvecveefueefKele ceW mes keâewve mee mšesjspe ef[JeeFme DeefOekeâlece 120. High density, double sided floppy disks could
store……….of data.
cee$ee ceW [sše mšesj keâj mekeâlee nw GÛÛe IevelJe, [yeue he#eerÙe Heäuee@heer ef[mkeâ ………. [sše
(a) Floppy Disk (b) Hard Disk
keâes mšesj keâj mekeâlee nw~
(c) Compact Disk (d) Magneto-optic Disk
(a) 1.40 MB (b) 1.44 GB
Ans. (b) : meYeer mšesjspe ef[JeeFmespe keâer meeceevÙe [sše mšesjspe
(c) 1.40 GB (d) 1.44 MB
#eceleeSB nQ-
Ans. (d) : GÛÛe IevelJe (High Density), [yeue he#eerÙe
 Floppy Disk : ueieYeie 1.44 MB
(Double- Sided) 3.5 FbÛe heäuee@heer ef[mkeâ meeceevÙele: 1.44
 Compact Disk (CD) : ueieYeie 700 MB
cesieeyeeFš (MB) [sše mšesj keâj mekeâleer nw~ Ùen heäuee@heer ef[mkeâ
 Magneto - Optic Disk : kegâÚ GB lekeâ (Deeceleewj hej 1GB kebâhÙetšjeW ceW [sše mšesjspe Deewj š^ebmeheâj kesâ efueS yengle ØeÛeefuele ngDee
mes 9 GB lekeâ) keâjleer Leer~
 Hard Disk : Deepekeâue TB (Terabyte) ceW GheueyOe nesleer nw,
121. You can auto fit the width of column by
pewmes 500 GB, 1 TB, 2TB Deeefo~ Deehe keâe@uece keâer ÛeewÌ[eF& keâes auto fit keâj mekeâles nQ
FmeefueS Hard Disk meyemes pÙeeoe [sše mšesj keâj mekeâleer nw~ ..............Éeje~
118. Which computer was considered the first (a) Double clicking on the column name on
electronic computer until 1973 when court column header
invalidated the patent? (b) Double clicking on the cell pointer in
1973 lekeâ efkeâme kebâhÙetšj keâes henuee Fueskeäš^e@efvekeâ worksheet
kebâhÙetšj ceevee ieÙee Lee peye keâesš& ves hesšWš keâes DeceevÙe (c) Double clicking on column right border on
keâj efoÙee Lee? column header
(a) ENIAC (b) MARKI (d) Double clicking on the column left border of
(c) Z3 (d) ABC column header
Ans. (a) : ENIAC (Electronic Numerical Integrator and Ans. (c) : peye Deehe Excel ceW efkeâmeer keâe@uece keâer jeFš yee@[&j (oeF&
Computer) keâes uecyes meceÙe lekeâ ogefveÙee keâe henuee Fueskeäš^e@efvekeâ meercee) hej [yeue efkeäuekeâ keâjles nQ, lees Jen keâe@uece Deheves kebâšWš kesâ
kebâhÙetšj ceevee peelee Lee~ Fmekeâe DeefJe<keâej 'John Mauchly' Deewj Devegmeej 'Auto fit' nes peelee nw, Ùeeveer efkeâ keâe@uece keâer ÛeewÌ[eF& Deheves
'J. Presper Eckert' ves efkeâÙee Lee Deewj Fmes 1945 ceW hetje efkeâÙee meyemes yeÌ[s kebâšWš kesâ Devegmeej Deheves Deehe mesš nes peeleer nw~
Bihar STET 83 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
122. MS Excel provides the default value ……….. Ans. (c) : Microsoft Excel kesâ Fill Series [eÙeuee@ie yee@keäme ceW
for step in Fill Series dialog box. efvecveefueefKele ëe=Kebuee (Series) Øekeâej ceevÙe nesles nw~
MS Excel Fill Series [eÙeuee@ie yee@keäme ceW ÛejCe kesâ
(i) Linear:– Skeâ meceeve Devlejeue mes ceeve yeÌ{evee (pewmes 1, 2,
efueS ef[Heâe@uš ceeve............Øeoeve keâjlee nw~
3.....)
(a) 0 (b) 1
(ii) Growth:– iegCeesòej ëe=Kebuee (pewmes 2, 4, 8)
(c) 5 (d) 10
(iii) Date/Time:– leejerKe Deewj meceÙe DeeOeeefjle ëe=bKeuee (pewmes
Ans. (b) : Microsoft Excel kesâ fill series [eÙeuee@ie yee@keäme ceW
ÛejCe kesâ efueS ef[heâe@uš ceeve 1 Øeoeve keâjlee nw~ Fmekeâe celeueye peye efove, ceen, Je<e& Deeefo)
heäuewMe efheâue Dee@hMeve keâe GheÙeesie keâjles nQ, lees JewuÙet ›eâce mes (1, 2, uesefkeâve 'Auto fill' keâesF& (series type) veneR nw, Ùen Skeämesue ceW
3......) yeÌ{lee nw~ Skeâ Deueie megefJeOee nw pees hewšve& keâes henÛeevekeâj mJele: Yejleer nw~
123. Ctrl + D shortcut key in Excel will 127. Which of the following you can paste
Skeämesue ceW, Ctrl + D Mee@š&keâš kegbâpeer keâjsiee selectively using Paste Special Command?
(a) Open the font dialog box efvecveefueefKele ceW mes keäÙee Deehe hesmš efJeMes<e keâe GheÙeesie
(b) Apply double underline for the active cell keâjkesâ Ûegefveboe ™he ceW hesmš keâj mekeâles nw?
(c) Fill down in the selection (a) Validation
(d) None of these/FveceW mes keâesF& veneR (b) Formats
Ans. (c) : Microsoft Excel ceW 'Ctrl + D' Mee@š&keâš kegbâpeer keâe (c) Formulas
GheÙeesie Thej Jeeueer mesue keâer meece«eer keâes veerÛes keâer ÛeÙeefvele mesue ceW (d) All of these/FveceWmes meYeer
keâe@heer (fill down) keâjves kesâ efueS efkeâÙee peelee nw~ Ans. (d) : Excel ceW Paste Special keâceeb[ keâe GheÙeesie keâjkesâ
124. The shortcut key Ctrl + R is used in Excel to Deehe [sše keâes efJeefYeVe ™heeW ceW efÛehekeâe (paste) mekeâles nQ~ FmeceW
Mee@š&keâš kegbâpeer Ctrl + R keâe GheÙeesie Skeämesue ceW Deehe kesâJeue efkeâmeer Skeâ efJeMes<e Yeeie keâer hesmš keâj mekeâles nQ, pewmes-
............keâjves kesâ efueS efkeâÙee peelee nw~ (i) Validation:– [sše Jewefue[sMeve efveÙece
(a) Right align the content of cell
(ii) Formats:– kesâJeue mesue keâe heâecexš (pewmes jbie, yee[&j Deeefo)
(b) Remove the cell contents of selected cells
(c) Fill the selection with active cells to the right (iii) Formulas:– kesâJeue heâe@ce&tuee efyevee heâe@cexš kesâ~
(d) None of these/FveceW mes keâesF& venber 128. Paste Special allows some operation while you
paste to new cell. Which of the following
Ans. (c) : Excel ceW 'Ctrl + R' Mee@š&keâš keâe GheÙeesie ÛeÙeefvele
operations is valid?
mesume keâeW oeF& Deesj Yejves (fill right) kesâ efueS efkeâÙee peelee nw~
Hesmš mhesMeue kegâÚ Dee@hejsMeve keâer Devegceefle oslee nw peyeefkeâ
celeueye, pees Yeer kebâšWš mesue (henues mesue) ceW nw, Gmes ÛeÙeefvele jWpe kesâ
Deehe veS mesue ceW hesmš keâjles nQ pees efvecve Dee@hejsMeve ceW mes
yeekeâer mesume ceW oeF& keâe@heer keâj efoÙee peelee nw~
keâewve nw?
125. The command Edit >> Fill Across Worksheet is
active only when (a) Square (b) Percentage
keâceeb[ Edit >> Fill S›eâe@me Jeke&âMeerš ceW efmeHe&â leYeer (c) Goal Seek (d) Divide
meef›eâÙe nesleer nw, peye Ans. (d) : Paste special keâceeC[ keâe GheÙeesie Excel ceW efmehe&â
(a) One sheet is selected [sše Ùee heâecexš hesmš keâjves kesâ efueS vener, yeefukeâ kegâÚ ieefCeleerÙe
(b) Many sheets are selected Dee@hejsMeve (Operation) keâjves kesâ efueS Yeer efkeâÙee peelee nw~
(c) No sheet is selected peye Deehe Paste special > Operation efJekeâuhe Ûegveles nw, lees
(d) None of these/FveceW mes keâesF& veneR Excel efvecveefueefKele Dee@hejsMeve keâer Devegceefle oslee nw:
Ans. (b) : Excel ceW "Edit >> Fill Across Worksheets"  Add (peesÌ[vee)
keâceeb[ keâe GheÙeesie leYeer efkeâÙee pee mekeâlee nw peye Skeâ mes DeefOekeâ  Substruct (Ieševee)
Jeke&âMeeršdme keâes Skeâ meeLe mesueskeäš efkeâÙee ieÙee nes~ Ùen keâceeC[ Skeâ
 Multiply (iegCee keâjvee)
Meerš ceW [eues ieÙes [sše Ùee heâe@cexš keâes DevÙe mesueskeäšs[ Meeršdme hej
keâe@heer keâjves kesâ efueS GheÙeesie nesleer nw~  Divide (Yeeie osvee)
126. Which of the following series type is not valid 129. Edit >> Delete command
for Fill Series dialog box? Edit >> Delete keâceeb[ keâjlee nw
efvecveefueefKele ceW mes keâewve meer ëe=bKeuee Øekeâej Fill Series (a) Deletes the content of a cell
[eÙeuee@ie yee@keäme kesâ efueS ceevÙe veneR nw (b) Deletes formats of cell
(a) Linear (b) Growth (c) Deletes the comment of cell
(c) Auto Fill (d) Time (d) Deletes selected cells
Bihar STET 84 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
Ans. (d): "Edit > Delete' keâceeb[ keâe GheÙeesie Excel ceW 133. Primary key is also called
ÛeÙeefvele mesume (selected cells) keâes hetjer lejn nševes kesâ efueS efkeâÙee ØeeLeefcekeâ kegbâpeer keâes Yeer keâne peelee nw~
peelee nw, Fmekeâe DeLe& nw:- (a) Candidate key (b) Super key
(c) Alternate key (d) Non key
 Ùeefo Deehe Skeâ Ùee Skeâ mes DeefOekeâ mesume Ûegveles nw Deewj Edit >
Ans. (a) : Candidate key Jen kegbâpeer pees šsyeue keâer meYeer hebefòeâÙeeW
Delete keâjles nw lees hetjs mesume nš peeles nQ, Deewj yeekeâer mesume Thej
keâes efJeefMe° ™he mes henÛeeve mekeâleer nw~ Skeâ šsyeue ceW keâF&
Ùee yeeSb efMeheäš nes peeles nw~
Candidate keys nes mekeâleer nQ~ peye FveceW mes efkeâmeer Skeâ keâes Ûegvee
 Ùen kesâJeue kebâšWš, heâe@cexš Ùee keâceWš keâes vener nšelee, yeefukeâ mesue peelee nw Primary key kesâ ™he ceW, leye Yeer Jen cetuele: Candidate
keâer hetjer FkeâeF& keâes nšelee nw~ key ner nesleer nw~
130. To remove the content of selected cells you 134. Which of the following methods can insert a
must issue ……….command. new slide in current presentation?
Gve ÛeÙeefvele keâ#eeW keâer meece«eer keâes efvekeâeueW efpevnW efvecveefueefKele ceW mes keâewve meer efJeefOe Jele&ceeve Øemlegefle ceW
Deehekeâes............... keâceeb[ peejer keâjvee ÛeeefnS~ Skeâ veF& mueeF[ meefcceefuele keâj mekeâleer nw
(a) Edit >> Delete (a) Right click on the slide panel and choose
(b) Edit >> Clear >> Contents New Slide
(c) Edit >> Clear >> All (b) From Insert menu choose New Slide
(d) Data >> Delete (c) Click on New Slide button on toolbar
(d) All of these/FveceW mes meYeer
Ans. (b) : Ùeefo kesâJeue mesueeW keâer meece«eer (contents) keâes nševee
nw, uesefkeâve heâe@cexefšbie, efšhheefCeÙeeB, Ùee keâ#e mJeÙeb vener nševes nQ, lees Ans. (d) : meYeer efJekeâuheeW mes Jele&ceeve Øemlegefle ceW Skeâ veF& mueeF[
Deehekeâes: meefcceefuele keâer pee mekeâleer nw:
 Edit >> Clear >> Contents mueeF[ hewveue hej jeFš efkeäuekeâ keâjkesâ 'New slide' Ûegve mekeâles nw~
 Insert cesvet mes 'New slide' Ûegve mekeâles nQ~
keâceeb[ keâe GheÙeesie keâjvee ÛeeefnS~
 štueyeej hej 'new slide' yešve hej efkeäuekeâ keâj mekeâles nQ~
131. What will be the output of the following line of
code? 135. Android is a/an
efvecveefueefKele keâes[ kesâ ueeFve keâe DeeGšhegš keäÙee nesiee? Android nw Skeâ
(a) Operating system (b) Compiler
int A ; A = 10; A++; cout<<A;
(c) Editor (d) Interpreter
(a) 10 (b) 11
(c) 0 (d) 9 Ans. (a) : Android Skeâ Dee@hejsefšib e efmemšce (Operating System)
Ans. (b) :
nw, pees cegKÙe ™he mes ceesyeeFue ef[JeeFme (pewmes mceeš&heâesve Deewj šsyeuesš) kesâ
efueS efJekeâefmele efkeâÙee ieÙee nw~ Ùen 'Linux Kernel' hej DeeOeeefjle nw Deewj
(i) int A; Skeâ Fvšerpej yewefjSyeue A ef[keäuesÙej ngDee~
Google Éeje efJekeâefmele efkeâÙee ieÙee nw~
(ii) A = 10 ; A keâes 10 mes FefveefMeÙeueeFpe efkeâÙee ieÙee~
136. What is the best way to create another copy of
(iii) A++ i Ùen heesmš Fv›eâerceWš Dee@hejsšj nw, pees A kesâ ceeve a slide?
keâes 1 mes yeÌ{e oslee nw~ Ùeeveer Deye A = 11 nes peeÙesiee~ mueeF[ keâer otmejer Øeefle yeveeves keâe meyemes DeÛÚe lejerkeâe
(iv) Cout << A; Fmekeâe celeueye A keâes efØebš keâjvee nw, pees keäÙee nw?
Deye 11 nw~ (a) Click the slide then press Ctrl + A and paste
132. Which short cut key inserts a new slide in in new slide
current presentation? (b) From Insert Menu choose Duplicate Slide
(c) Redo everything on a new slide that you had
Jele&ceeve Øemlegefle ceW keâewve meer Mee@š&keâš kegbâpeer Skeâ veF&
done on previous slide
mueeF[ inserts keâjleer nw? (d) None of these/FveceW mes keâesF& veneR
(a) Ctrl + N
Ans. (b) : Ùeefo Deehe efkeâmeer mueeF[ keâer otmejer (Duplicate) Øeefle
(b) Ctrl + M
yeveevee Ûeenles nQ, lees meyemes Deemeeve Deewj ØeYeeJeer lejerkeâe neslee nw
(c) Ctrl + S
'Duplicate Slide' keâe GheÙeesie keâjvee~ Fmemes mueeF[ keâe hetje
(d) All of these/FveceW mes meYeer
uesDeeGš, kebâšWš Deewj heâe@ceW&efšbie Jewmee keâe Jewmee keâe@heer nes peelee nw~
Ans. (b) : 'Ctrl + M'– Microsoft Power Point ceW Skeâ veF& 137. Float is a/an
mueeF[ insert keâjves kesâ efueS GheÙeesie efkeâÙee peelee nw~ Float nw Skeâ
 'Ctrl + N':– Skeâ veF& Presentation (heâeFue) Keesuelee nw~ (a) Value (b) Variable
 'Crtl + S':– Jele&ceeve Presentation keâes Save keâjlee nw~ (c) Operator (d) Data type
Bihar STET 85 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
Ans. (d) : 'Float' Skeâ [sše šeFhe nw, pees oMeceueJe (decimal) (a) Right click on Sheet Tab of third sheet and
mebKÙeeDeeW keâes mšesj keâjves kesâ efueS GheÙeesie neslee nw pewmes 3.14,50 – choose Delete from the context menu
2.75 Deeefo~ (b) Click on Sheet 3 and from Edit menu choose
Delete
138. From Which menu you can access Picture, Test
(c) Both (A) and (B)/ (A) leLee (B) oesveeW
Box, Chart etc.?
efkeâme cesvÙeg mes Deehe efÛe$e, šskeämš yee@keäme, Ûeeš& Deeefo (d) None of these/FveceW mes keâesF& veneR
Skeämesme keâj mekeâles nQ? Ans. (c) : ceeF›eâesmee@heäš Excel ceW efkeâmeer Jeke&âMeerš keâes nševes kesâ
(a) File (b) Edit efueS Deehe efvecveefueefKele oesveeW lejerkeâeW keâe GheÙeesie keâj mekeâles nw:
(c) Insert (d) View  leermejer Meerš kesâ šwye hej jeFš keâjW Delete efJekeâuhe ÛegveW~
Ans. (c) : 'Insert' cesvÙet keâe GheÙeesie 'Microsoft Word' Deeefo  Sheet:3 keâes Ûegves Deewj efheâj Edit cesvet ces peekeâj Delete
pewmes Øees«eecme ceW, Excel (efÛe$e), Text Box (šskeämš yee@keäme), efJekeâuhe Ûegves veesš: Edit cesvet hegjeveer Excel Jepe&ve ceW neslee nw, pewmes
Chart (Ûeeš&) Deeefo keâes [e@keäÙetceWš ceW peesÌ[ves kesâ efueS efkeâÙee peelee Excel 2003, veF& Jepe&ve ceW Ùen efjyeve ceW 'Home' šwye kesâ Debleie&le
nw~ neslee nw~
139. Term 'Data' refers to …….. and information
142. Which of the following actions removes a sheet
refers to ………
from workbook?
Meyo ‘[sše’ .......... keâes meboefYe&le keâjlee nw Deewj metÛevee
efvecveefueefKele ceW mes keâewve meer ef›eâÙee Jeke&âyegkeâ mes Skeâ
..........keâes meboefYe&le keâjlee nw~
Meerš nšeleer nw?
(a) Raw & New (b) Raw & Old
(a) Select the sheet, then choose Edit >> Delete
(c) Old & Processed (d) Raw & Processed
Sheet
Ans. (d) : [sše (Data):– Gme keâÛÛeer peevekeâejer keâes keânles nQ pees
(b) Select the sheet then choose format >> Sheet
DeYeer lekeâ efJeMuese<f ele Ùee JÙeJeefmLele vener keâer ieF& nes~ Fmes Raw >> Hide
(keâÛÛee) keâne peelee nw~ (c) Both (A) and (B)/ (A) leLee (B) oesveeW
metÛevee (Information):- Jen peevekeâejer nesleer nw pees ØemebmkeâjCe (d) None of these/FveceW mes keâesF& veneR
(Processing) kesâ yeeo GheÙeesieer ™he mes Øemlegle keâer peeleer nw~ Ans. (a) : Select the Sheet, then choose Edit >> Delete
FmeW Processed (Øemebmke=âle) keâne peelee nw~ Sheet.
140. To insert slide numbers Ùen ef›eâÙee Jeke&âyegkeâ mes ÛeÙeefvele Meerš keâes mLeeÙeer ™he mes nševes
mueeF[ vebyej [eueves kesâ efueS (Delete) kesâ efueS GheÙeesie nesleer nw~
(a) Insert a text box and select insert >> Page 143. While finding and replacing some data in
Number Excel, which of the follow statements is valid?
(b) Insert a text box and select Insert >> Number Skeämesue ceW kegâÚ [sše Keespeves Deewj yeoueves kesâ oewjeve,
>> Page Number
(c) Choose Insert >> Slide Number efvecve ceW mes keâewve Skeâ keâLeve ceevÙe nw?
(d) Insert a new text box and select Insert >> (a) You can find and replace within the sheet or
Slide Number workbook
Ans. (c) : Power point ceW mueeF[ vecyej [eueves keâe mener lejerkeâe (b) Excel does not have option to match case for
Ùen nw: find
(i) Insert šwye hej efkeäuekeâ keâjW~ (c) Both are valid/oesveeW ceevÙe nQ
(ii) efheâj Slide Number efJekeâuhe keâes ÛegveW~ (d) None are valid/keâesF& ceevÙe veneR nQ
(iii) Skeâ [eÙeuee@ie yee@keäme KegueWiee,peneB Deehe Slide Number keâe Ans. (a) : Excel ceW Deehe Find and Replace heâerÛej keâe
Ûeskeâ yee@keäme efškeâ keâj mekeâles nQ~ GheÙeesie keâjkesâ efkeâmeer Skeâ Meerš Ùee hetjs Jeke&âyegkeâ ceW [sše Keespe Deewj
(iv) Fmekesâ yeeo 'Apply to All' hej efkeäuekeâ keâjves mes meYeer yeoue mekeâles nQ~ Ùen efJekeâuhe Find & Replace [eÙeuee@ie yee@keäme ceW
mueeF[dme hej vecyej ueie peeÙeWies~ "Within sheet/workbook" efJekeâuhe mes Ûegvee pee mekeâlee nw~
141. By default Excel provides 3 worksheets. You 144. Rounding errors can occur
need only two of them. How will you delete the Rounding errors nes mekeâleer nw
third one?
ef[Heâe@uš ™he mes Skeämesue 3 Jeke&âMeerš Øeoeve keâjlee nw~ (a) When you use multiplication, division, or
exponentiation in a formula
Deehekeâes GveceW mes kesâJeue oes keâer pe™jle nw~ Deehe leermejs
(b) When you use addition and subtraction in a
keâes kewâmes nšeSbies? formula
Bihar STET 86 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
 (c) Because excel uses hidden decimal places in 147. Which of the following is a popular DOS based
computation spreadsheet package?
(d) When you show the results of formulas with efvecveefueefKele ceW mes keâewve Skeâ ueeskeâefØeÙe [e@me DeeOeeefjle
different decimal places that the calculated mØes[Meerš hewkesâpe nw?
results (a) Word (b) Smart cell
Ans. (c) : Excel ieCeveeDeeW ceW DeefOekeâ mešerkeâlee yeveeÙes jKeves kesâ (c) Excel (d) Lotus 1-2-3
efueS Debleefve&efnle (hidden) oMeceueJe mLeeve keâe GheÙeesie keâjlee nw~ Ans. (d) : Lotus 1-2-3 Ùen DOS DeeOeeefjle Skeâ yengle ueeskeâefØeÙe
uesefkeâve peye Deehe heefjCeeceeW keâes keâce oMeceueJe mLeeveeW ces jeGb[ keâjkesâ mØes[Meerš hewkesâpe Lee, 1980 Deewj 1990 kesâ oMekeâ ceW meyemes pÙeeoe
ØeoefMe&le keâjles nQ, lees keâYeer - 2 Ùen rounding errors $egefšÙeeB Fmlesceeue efkeâÙee peelee Lee~
GlheVe keâj mekeâlee nw~ 148. An excel workbook is a collection of
145. You can copy data or formulas Skeâ Skeämesue Jeke&âyegkeâ meb«en nw
Deehe [sše Ùee Heâe@cet&uee keâe@heer keâj mekeâles nQ (a) Workbooks
(a) With the copy, paste and cut commands on (b) Worksheets
the edit menu. (c) Charts
(b) With commands on the shortcut menu (d) Worksheets and charts
(c) With buttons on the standard toolbars Ans. (d) : Skeâ Excel Jeke&âyegkeâ (workbook) JeemleJe ceW Skeâ
(d) All of these/FveceW mes meYeer heâeFue nesleer nw efpemeces keâF& lejn keâer Ûeerpes nes mekeâleer nw:
Ans. (d) : Deehe Excel ceW [sše Ùee heâe@cet&uee keâe@heer keâjves kesâ efueS  Worksheets:– efpeveceW [sše, he@âcet&uee Deeefo nesles nw~
efvecve meYeer lejerkeâes keâe GheÙeesie keâj mekeâles nw~  Charts:– [sše keâes «eeefheâkeâue ™he ceW efoKeeves kesâ efueS~
 Edit Menu ceW ceewpeto Copy, Paste, Cut keâceeC[dme kesâ Fmeef ueS, Excel keâer Skeâ Jeke&âyegkeâ ceW Worksheets Deewj Charts
oesveeW keâe meb«en nes mekeâlee nw~
ceeOÙece mes~
149. Excel files have a default extension of
 efkeâmeer mesue hej jeFš efkeäuekeâ keâjkesâ Kegueves Jeeues Shortcut
Skeämesue HeâeFue keâe ef[Heâe@uš SkeämešWMeve neslee nw
Menu mes Yeer Ùes keâceeb[dme GheueyOe nesles nQ~
(a) Xls (b) Xlw
 Standard Toolbar (Ùee Ribbon ceW Clipboard meskeäMeve) ceW (c) Wkl (d) 123
ceewpeto yešve mes Yeer Deehe Copy, Paste keâj mekeâles nw~ Ans. (a) : Excel heâeFuees kesâ ef[heâe@uš SkeämešWMeve Fme Øekeâej nesles
146. You cannot link excel worksheet data to a word nw:
document  xls:- Ùen Excel keâer hegjeveer Jepe&ve (Excel 97-2003) keâer
Deehe Skeämesue Jeke&âMeerš [sše keâes Je[& [e@keäÙetceWš mes efuebkeâ ef[heâe@uš SkeämešWMeve nw~
veneR keâj mekeâles nQ  xlsx:– Ùen Excel 2007 Deewj Gmekesâ yeeo keâer Jepe&ve keâe
(a) With the right drag method ef[keâe@uš SkeämešsMeve nw~
(b) With a hyperlink
150. You can use the Format Painter multiple times
(c) With the copy and paste special commands before you turn it off by
(d) With the copy and paste buttons on the Fmemes henues efkeâ Deehe Fmes yebo keâj oW, Deehe keâF& yeej
standard toolbar
Format Painter keâe GheÙeesie keâj mekeâles nQ
Ans. (d) : Skeämesue Jeke&âMeerš [sše keâes Je[& [ekeäÙetceWš mes efuebkeâ keâj (a) You can use the format painter button only
mekeâles nQ efvecve lejerkeâes mes– one time when you click it
 Right drag method:– Fmemes efuebkeâ Ùee Scyes[s[ efkeâÙee pee (b) Double clicking the format painter button
mekeâlee nw~ (c) Pressing the Ctrl key and clicking the format
painter button
 Hyperlink:– Fmemes Skeämesue heâeFue mes efuebkeâ efkeâÙee pee mekeâlee
(d) Pressing the Alt key and clicking the format
nw~ painter button
 Copy & Paste Special:– Fmemes efuebkeâ kesâ ™he ceW [sše Ans. (b) : Format painter keâe GheÙeesie keâjves kesâ efueS peye Deehe
efÛehekeâeÙee pee mekeâlee nw (Paste Special paste Link) Skeâ yeej Gme hej efkeäuekeâ keâjles nw, lees Deehe kesâJeue Skeâ yeej
peyeefkeâ:– formatting keâes efkeâmeer Skeâ peien apply keâj mekeâles nw~
Copy & Paste buttons on the standard toolbar kesâJeue uesefkeâve Ùeefo Deehe Format painter button keâes double-click
meeceevÙe Paste keâjves keâer ef›eâÙee keâjlee nw efpememes efuebkeâ vener keâjles nQ, lees Deehe Gmes multiple times (keâF& yeej) use keâj mekeâles
yevelee nw~ nQ peye lekeâ Deehe Kego Gmes yevo ve keâj os Ùee Esc ve oyee os~
Bihar STET 87 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
 efyenej efJeÅeeueÙe hejer#ee meefceefle
ceeOÙeefcekeâ efMe#ekeâ hee$elee hejer#ee Bihar STET
keâchÙetšj
[Exam. Date - 2019 (Shift-II)]
51. How can you update the values of formula cells (a) Double CAL indicator on status bar
if Auto Calculate mode of Excel is disabled? (b) Go to Tools >> Options >> Calculation and
Ùeefo Skeämesue keâer Dee@šes ieCevee cees[ De#ece nw lees Deehe mark the corresponding radio button
Heâe@cet&uee mesue kesâ cetuÙeeW keâes kewâmes Dehe[sš keâj mekeâles nQ? (c) Both of (A) and (B)/(A) leLee (B) oesveeW
(a) F8 (b) F9 (d) None of these/FveceW mes keâesF& veneR
(c) F10 (d) F11
Ans. (b) : Excel ceW hegjeves mebmkeâjCe (pewmes Excel 2003) ceW
Ans. (b) : Ùeefo Excel ceW Auto calculation mode (mJeÛeeefuele Calculation Mode (Automatic Ùee Manual) yeoueves kesâ efueS
ieCevee cees[) De#ece nw (Ùeeveer Manual mode Ûeeuet nw), lees Excel
Steps, follow keâjles nQ-
mJele: Heâe@cet&ueeW keâer ieCevee veneR keâjlee nw~ Ssmes ceW Deehekeâes cewvÙegDeueer
Heâe@ce&tuee mesume keâes Dehe[sš keâjves kesâ efueS 'F9' kegbâpeer oyeeveer nesleer nw~ Tools Options Calculation tab efHeâj Automatic
Ùee Manual jsef[ÙeeW yešve Ûegveles nQ~
F9– meYeer Jeke&âMeeršdme ceW meYeer Heâe@cet&uee mesume keâer ieCevee keâjlee nw~
Excel 2007 Deewj Gmemes Thej kesâ mebmkeâjCeeW ceW-
52. You want to set such that when you type
Baishakh and drag the fill handle, Excel should Formulas tab Calculation Options Select
produce Jauitha, Aashadh and so on. What will Automatic Ùee Manual.
you set to effect that? 54. How can you show or hide the grid lines in
Deehe Ssmee mesš keâjvee Ûeenles nQ efkeâ peye Deehe yesMeeKe Excel Worksheet?
šeFhe keâjW Deewj efHeâue nQ[ue keâes KeerÛeW lees Skeämesue keâes Deehe Skeämesue Jeke&âMeerš ceW ef«e[ ueeFvme kewâmes efoKee Ùee
pÙes‰, Dee<eeÌ{ Deeefo keâe Glheeove keâjvee ÛeeefnS~ Fme efÚhee mekeâles nQ?
lejn Deehe Gme hej keäÙee ØeYeeJe [eueWies? (a) Go to Tools >> Options >> View tab and
(a) Custom List mark or remove the check …. named
(b) Auto Fill Options Gridline
(c) Fill Across Worksheet (b) Cliclk Gridline tool on Forms toolbar
(d) Fill Series (c) Both of (A) and (B)/(A) leLee (B) oesveeW
Ans. (a) : Deehe Ùeefo Ûeenles nQ efkeâ peye Deehe ‘‘yewMeeKe’’ šeFhe keâjW (d) None of these/FveceW mes keâesF& veneR
Deewj 'Fill Handle' KeeRÛes, lees Excel mJele: ›eâce ceW ‘‘pÙes‰,
Ans. (a) : Excel Worksheet ceW ef«e[ ueeFvme keâes efoKeeves Ùee
Dee<eeÌ{ .........’’ pewmes veece Yej os- lees Fmekesâ efueS Deehekeâes Excel
efÚheeves kesâ efueS Deehe efvecveefueefKele mšshme Heâe@ueeW keâj mekeâles nQ:–
ceW Skeâ Custom List (keâmšce metÛeer) yeveeveer nesieer~
(1) Tools cesvet ceW peeÙes~
Custom list– Deehekeâes Deheveer Kego keâer Deveg›eâceefCekeâe
(Sequence) yeveeves keâer megefJeOee osleer nw~ Skeâ yeej peye Deehe Fmes (2) Options hej efkeäuekeâ keâjs~
yevee uesles nQ, lees Excel Gmeer ›eâce ceW [sše keâes Autofill keâj mekeâlee (3) View šwye ÛegveW~
nw~ (4) Gridlines kesâ yee@keäme keâes Ûeskeâ Ùee DeveÛeskeâ keâjves mes efÚhe
GoenjCe– peeÙesieer~
Custom List– yewMeeKe, pÙes‰, Dee<eeÌ{, ßeeJeCe, Yeeõheo, 55. Which of the following Excel screan
DeeefMJeve, keâeefle&keâ, ceeie&Meer<e&, heew<e, ceeIe, Heâeuiegve, Ûew$e~ components cannot be tuned on or off?
Deye Deehe efmeHe&â ‘‘yewMeeKe’’ šeFhe keâj kesâ Fill Handle KeerÛeWies, lees efvecveefueefKele ceW mes keâewve mee Skeämesue m›eâerve Ieškeâ Ûeeuet
Excel yeekeâer veece Kego Yej uesiee~ Ùee yebo veneR efkeâÙee pee mekeâlee nw?
53. Where can you change automatic or manual (a) Formula Bar
calculation mode in Excel? (b) Status Bar
Deehe Skeämesue ceW mJeÛeeefuele Ùee cewvÙegDeue ieCevee cees[ (c) Tool Bar
keâes keâneB yeoue mekeâles nQ? (d) None of these/FveceW mes keâesF& veneR
Bihar STET 88 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
Ans. (b) : Excel kesâ
m›eâerve IeškeâeW ceW– 58. Which command will you choose to convert a
column of data into row?
Formula Bar- Fmes Ûeeuet Ùee yevo efkeâÙee pee mekeâlee nw~
Deehe [sše ceW Skeâ keâe@uece keâes hebeòf eâ ceW yeoueves kesâ efueS
Method- Excel ceW peeSb View šwye Formula Bar
keâewve meer keâceeb[ ÛegveWies?
(Check/Uncheck)
(a) Cut and Paste
Tool Bar- hegjeves Jepe&ve (Excel 2003) ceW štueyeej keâes (b) Edit >> Paste Special >> Transpose
Show/Hide efkeâÙee pee mekeâlee nw~ (c) Both of (A) and (B)/(A) leLee (B) oesveeW
Method- View Tool bars Check box kesâ peefjÙes Ûeeuet (d) None of these/FveceW mes keâesF& veneR
Ùee yebo keâjW~
Ans. (b) : Ùeefo Deehe Skeämesue ceW efkeâmeer keâe@uece (Column) keâes
Status Bar keâes Excel keâer UI mes Dee@ve/Dee@Heâ veneR efkeâÙee pee hebefkeäle (Row) ceW Ùee hebefkeäle keâes keâe@uece ceW yeouevee Ûeenles nQ, lees
mekeâlee nw~ Deehekeâes Transpose keâceeb[ keâe GheÙeesie keâjvee neslee nw~
56. What happens when you press Ctrl + X after Steps–
selecting some cells in Excel? 1. efpeme keâe@uece keâes hebefkeäle ceW yeouevee Ûeenles nQ, Gmes Copy (Ctrl +
peye Deehe Skeämesue ceW kegâÚ keâesefMekeâeDeeW keâe ÛeÙeve keâjves C) keâjW~
kesâ yeeo Ctrl + X oyeeles nQ lees keäÙee neslee nw? 2. peneB hesmš keâjvee nw, Gme mesue keâes Ûegves
(a) The cell content of selected cells disappear 3. Home tab Paste Paste special hej peeÙeW~
from cell and stores in clipboard
4. JeneB Transpose keâe efJekeâuhe ÛegveW~
Selected cells kesâ cell content, cell mes DeÂMÙe
5. OK oyeeSb
neskeâj clipboard ceW stored nes peelee nQ
Fmemes keâe@uece [sše hebefkeäle ceW yeoue peeÙesiee~
(b) The cells selected are marked for cutting
59. It is acceptable to let long text flow into
ÛeÙeefvele cells keâefšbie kesâ efueÙes efÛeefÖle nesles nQ
adjacent cells on a worksheet when
(c) The selected cells are deleted and the cells are keâye efkeâmeer worksheet hej meceerhemLe cells ceW uebyes hee"
shifted left/ÛeÙeefvele cells ef[efueš nes peeles nQ leLee
ØeJeen keâes osvee mJeerkeâeÙe& nes?
cells yeeÙeer Deesj mLeeveebleefjle nes peeles nQ
(a) Data will be entered in the adjacent cells
(d) The selected cells are deleted and cells are
Data keâer ØeefJeef° meceerhemLe cells ceW nesieer
shifted up/ÛeÙeefvele cells ef[efueš neskeâj Thej keâer
(b) No data will be entered in the adjacent cells
Deesj mLeeveebleefjle nesles nQ keâesF& Data keâer ØeefJeef° meceerhemLe cells ceW veneR nesieer
Ans. (b) : peye Deehe Excel ceW kegâÚ Cells keâe ÛeÙeve keâjves kesâ (c) There is no suitable abbreviation for the text
yeeo 'Ctrl + X' oyeeles nQ, lees Gve Cells kesâ ÛeejeW Deesj Skeâ Text kesâ efueÙes keâesF& Yeer GheÙegkeäle abbreviation veneR
Moving dashed border (Ûeueleer ngÙeer [wMe Jeeueer meercee) efoKeeÙeer nesiee
osleer nw~ Fmekeâe celeueye nw efkeâ Jes Cells keâefšbie kesâ efueS efÛeefvnle nes (d) There is no time to format the text
ieÙes nw, uesefkeâve DeYeer lekeâ nšs veneR nQ, peye yeeo ceW 'Ctrl + V' Text keâes format keâjves ner nsleg keâesF& meceÙe veneR nes
oyeekeâj keâner hesmš keâjles nQ, leYeer Jes Cells nšles nQ Deewj veF& peien Ans. (b) : peye Deehe Excel ceW efkeâmeer Cell ceW uecyee text efueKeles
hej Ûeues peeles nQ~ nQ Deewj meceerhemLe (Adjacent) cell Keeueer neslee nw, lees Jen text
FmeefueS kesâJeue 'Ctrl + X' oyeeves hej Cells ef[ueerš veneR nesles, Jes Deheves Deehe Deeme-heeme keâer Keeueer cells ceW Hewâue peelee nQ- efpememes Jen
efmeHe&â keâš kesâ efueS efÛeefvnle nQ~ hetje efoKeeF& oslee nw~
57. Which of the following options is not available uesefkeâve Ùeefo meceerhemLe cells ceW keâesF& data henues mes ceewpeto neslee nw,
in Paste Special dialog box? lees text keâš peelee nw Deewj hetje efoKeeÙeer veneR oslee~
efvecveefueefKele ceW mes keâewve mee efJekeâuhe Paste Special FmeefueS uecyes hee" keâes meceerhemLe Cells ceW ØeJeeefnle keâjvee leYeer
dialog box ceW GheueyOe veneR nw? mJeerkeâeÙe& neslee nw peye meceerhemLe Cells Keeueer nes, Deewj GmeceW keâesF&
(a) Add (b) Subtract [sše ve [euee peevee nes~
(c) Divide (d) SQRT 60. Which of the cell pointers indicates you that
Ans. (d) : Excel kesâ Paste Special [eÙeuee@ie yee@keäme ceW you can make selection?
efvecveefueefKele Dee@hMeve GheueyOe nesles nQ- mesue hee@Fbšj ceW mes keâewve Deehekeâes Fbefiele keâjlee nw efkeâ
Add– hesmš keâjles meceÙe ceewpetoe JewuÙetpe ceW peesÌ[e peelee nw~ Deehe ÛeÙeve keâj mekeâles nQ?
(a) Doctor's symbol (Big Plus)
Substract– ceewpeto JewuÙet mes IešeÙee peelee nw~
(b) Small thin plus icon
Multiply– ceewpetoe JewuÙet mes iegCee efkeâÙee peelee nw~ (c) Mouse Pointer with anchor at the tip
Divide– ceewpetoe JewuÙet mes Yeeie efoÙee peelee nw~ (d) None of these/FveceW mes keâesF& veneR
Bihar STET 89 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
Ans. (a) : peye Deehe Excel ceW mesue kesâ Thej ceeGme keâme&j ues peeles Ans. (c) : Object- Oriented Programming (OOP) ceW-
nQ Deewj Jen yeÌ[s hueme efÛevn (Big plus sign) pewmee efoKelee nw- efpemes Class Skeâ šscheuesš Ùee yueteØf ebš nesleer nw~
Dekeämej Doctor's symbol Yeer keâne peelee nw- lees Fmekeâe celeueye peye Deehe Gme keäueeme mes keâesF& JeemleefJekeâ FkeâeF& (Entity) yeveeles
neslee nw efkeâ Deehe mesue keâe ÛeÙeve (Select) keâj mekeâles nQ~ nQ, lees Gmes Object keâne peelee nw~
Ùen keâme&j Fbefiele keâjlee nw efkeâ Deehe efkeâmeer mesue Ùee mesue jWpe keâes FmeefueS- Objects = Instances of Classes.
mesueskeäš keâjves pee jns nQ~
65. You can edit an embedded organization chart
Fme Selection Cursor Yeer keânles nw~ object by
61. Which of the following is a primary key in a Deehe Skeâ Embedded mebie"ve Chart object keâes
student table?
efvecve ceW mes keâewve Úe$e leeefuekeâe ceW Skeâ ØeeLeefcekeâ kegBâpeer mebheeefole keâj mekeâles nQ
nw? (a) Double clicking the organizations chart object
(b) Clicking edit object
(a) UID number/UID mebKÙee
(c) Right clicking the chart object, then clicking
(b) Admission number/Admission mebKÙee edit MS-Organization Chart object
(c) Account number/Account mebKÙee (d) None of these/FveceW mes keâesF& veneR
(d) PAN
Ans. (d) : Deehe PowerPoint Ùee Word pewmes Microsoft
Ans. (b) : ØeeLeefcekeâ mebKÙee (Primary key) Jen Heâeru[ nesleer nw
Office SefhuekesâMeve ceW Embedded Organization Chart
pees efkeâmeer leeefuekeâe (Table) ceW nj efjkeâe@[& keâes DeefÉleerÙe (Unique)
Object keâes efvecveefueefKele lejerkeâeW mes mecheeefole keâj mekeâles nQ:
™he mes henÛeeveleer nw~ Úe$e leeefuekeâe ceW Ùen keâesF& Ssmee keâe@uece nesvee
ÛeeefnS pees- (I) Double-Clicking Dee@iexveeFpesMeve Ûeeš& Dee@ypeskeäš hej keâjves mes
nj Úe$e kesâ efueS DeefÉleerÙe nes Jen meef›eâÙe (Active) nes peelee nw Deewj Deehe Gmes meerOes Sef[š
(Edit) keâj mekeâles nw~
Null ve nes
(II) Right-Click– Edit MS-Organization Chart Object
ncesMee GheueyOe nes~
Ûegveves mes Yeer Deehe Gmes mebheeefole keâjves kesâ cees[ ceW uee mekeâles nw~
62. Which of the following is a valid SQL
command 66. In Boolean algebra A.A. is equal to
efvecveefueefKele ceW mes keâewve-mee Skeâ JewOe SQL Boolean yeerpeieefCele ceW A. A. yejekeâj nw
command nw? (a) A (b) 2A
(a) Cin (b) Cout (c) A2 (d) 1
(c) Tuple (d) Select Ans. (a) : Boolean Algebra ceW, Ùeefo keâesF& JewefjSyeue Kego mes
Ans. (d) : SQL (Structured Query Langauge) Skeâ [sšeyesme AND(.) efkeâÙee peeÙes, lees Gmekeâe heefjCeece Jener JewefjSyeue neslee nw~
Yee<ee nw efpemekeâe GheÙeesie [sše keâes keäJesjer (Query), Fbmeš& (Insert), efveÙece- A.A=A
Dehe[sš (Update), ef[ueerš (Delete) Deeefo keâjves kesâ efueS efkeâÙee Ùen efveÙece Idempotent Law keânueelee nw~
peelee nw~
67. Slide sorter can be accessed from which menu?
63. Which PowerPoint view works best for adding mueeF[ mee@š&j keâes efkeâme Menu mes Skeämesme efkeâÙee pee
slide transition?
mueeF[ meb›eâceCe peesÌ[ves kesâ efueS keâewve-mee Power ÂMÙe mekeâlee nw?
(View) meyemes DeÛÚe keâece keâjlee nw? (a) View (b) Edit
(c) File (d) Insert
(a) Animations
(b) Chart Wizard Ans. (a) : mueeF[ mee@š&j keâe GheÙeesie hee@Jejhee@Fbš (PowerPoint)
(c) Transition Wizard Ùee DevÙe ØespesvšsMeve mee@HeäšJesÙej ceW meYeer mueeF[me keâes meeLe Lebyevesue
(d) Auto Content Wizard (Thumbnail) ™he ceW osKeves Deewj GvnW JÙeJeefmLele jKeves kesâ efueS
Ans. (a) : PowerPoint ceW mueeF[ meb›eâceCe (Slide efkeâÙee peelee nw~ Ùen efJekeâuhe View cesvet ceW neslee nw, peneB mes Deehe
Transitions) peesÌ[ves keâe meyemes GheÙegkeäle lejerkeâe 'Animations' šwye efJeefYeVe JÙet ceW pewmes Normal, Slide, Sorter, Reading View
Ùee JÙet kesâ ceeOÙece mes neslee nw~ Deeefo Ûegve mekeâles nw~
'Animations' JÙet ceW Deehe mueeF[me kesâ yeerÛe ØeYeeJe (Effects) 68. In Boolean algebra the function of AND
pewmes- Fade, Wipe, Push Deeefo Ûegve mekeâles nQ~ operator is
64. Objects/Objects nQ Boolean yeerpeieefCele ceW AND operator keâe keâeÙe& nw
(a) Design of function (b) Creator of data (a) + (b) –
(c) Instances of classes (d) Program block5 (c) / (d) *
Bihar STET 90 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
 Ans. (d) : AND Dee@hejsšj oes Ùee DeefOekeâ Fvehegš keâes ueslee nw Fmekeâe cegKÙe GösMÙe neslee nw efkeâ Ùetpej keâes Ùen cenmetme ve nes efkeâ
Deewj kesâJeue leYeer 1 (True) DeeGšhegš oslee nw peye meYeer Fvehegš 1 Jen keâF& kebâhÙetšjeW mes pegÌ[e nw hetjer ØeCeeueer Skeâ efmemšce keâer lejn
nes~ JÙeJenej keâjleer nw~
Boolean algebra ceW Fmes iegCee efÛevn (*) mes oMee&Ùee peelee nw~ 72. Two devices are in network if
A B A*B (AND) oes ef[JeeFme vesšJeke&â ceW nw, Deiej
0 0 0 (a) A process in one device is able to exchange
0 1 0 Skeâ Øeef›eâÙee ceW Skeâ ef[JeeFme SkeämeÛeWpe keâj mekeâleer nw
1 0 0 (b) A process is running on both devices
1 1 1 oesveeW ef[JeeFmeeW ceW Skeâ Øeef›eâÙee jve keâj jns nQ
69. What would you choose to create a pre- (c) PIDs of the processes running on different
formatted style? devices are same/efJeefYeVe ef[JeeFmeeW ceW Ûeueves Jeeueer
Skeâ hetJe& Formatted Mewueer yeveeves kesâ efueS efvecve ceW mes Øeef›eâÙeeDeeW kesâ PID Skeâ ner nw
keäÙee Ûegvee pee mekeâlee nw? (d) None of these/FveceW mes keâesF& veneR
(a) Format Ans. (a) : oes ef[JeeFmespe leYeer vesšJeke&â ceW ceeves peeles nQ, peye Jes
(b) Slide layout Skeâ-otmejs kesâ meeLe [sše Ùee mebmeeOeve keâe Deeoeve-Øeoeve (Exchange)
(c) Slide sorter view keâj mekeâles nw~
(d) None of these/FveceW mes keâesF& veneR [sše keâe Deeoeve-Øeoeve (Communication) ner vessšJeefkeËâie keâe
Ans. (b) : Slide Layout– keâe GheÙeesie mueeF[ ceW kebâšWš (pewmes- yegefveÙeeoer henÛeeve nw~
Meer<e&keâ, šskeämš, efÛe$e, Ûeeš& Deeefo) keâes Skeâ efveOee&efjle Deewj hetJe& 73. Which one of the following computer networks
efveOee&efjle (Pre-formatted style) ceW JÙeJeefmLele keâjves kesâ efueS is built on the top of another network?
efkeâÙee peelee nw~ efvecveefueefKele ceW mes keâewve mee kebâhÙetšj vesšJeke&â efkeâmeer
Ùen Deehekeâes henues mes yeveeÙes ieÙes ef[peeFve šscheuesš Deewj mebjÛevee DevÙe vesšJeke&â kesâ Meer<e& hej yeveeÙee ieÙee nw?
Øeoeve keâjlee nw, efpememes mueeF[ yeveevee Deemeeve Deewj ØeesHesâMeveue (a) Prior network (b) Chief network
efoKelee nw~ (c) Prime network (d) Overlay network
70. Which of the following logical operations is Ans. (d) : Overlay Network Skeâ Ssmee vesšJeke&â neslee nw, pees
represented by the + sign in Boolean algebra? efkeâmeer ceewpetoe (Existing) vesšJeke&â kesâ Thej (Top) yeveeÙee peelee nw~
efvecveefueefKele Logical keâeÙeeX ceW mes keâewve mee Boolean Ùen JeÛeg&Deue vesšJeke&â neslee nw pees Underlying Physical vesšJeke&â
yeerpeieefCele ceW + mebkesâle Éeje oMee&Ùee ieÙee nw? keâer mejbÛevee keâes GheÙeesie keâjlee nw uesefkeâve Gmemes Deueie Logical
(a) OR (b) NOT Connections yeveelee nw~
(c) NOR (d) AND
74. In computer network nodes are
Ans. (a) : Boolean yeerpeieefCele ceW + (hueme) efÛevn keâe GheÙeesie kebâhÙetšj vesšJeke&â ceW Nodes nw
OR Dee@hejsMeve keâes oMee&ves kesâ efueS efkeâÙee peelee nw~ (a) The computer that originates the data
OR Dee@hejsšj keâe DeeGšhegš 1 (True) neslee nw peye keâce mes keâce (b) The computer that routes the data
Skeâ Fvehegš 1 nes~ (c) The computer that terminates the data
71. When collection of various computers seems a (d) All of these/FveceW mes meYeer
single coherent system to its client, then it is Ans. (d) : Node vesšJeke&â keâe keâesF& Yeer Ssmee GhekeâjCe (Device)
called
peye efJeefYeVe kebâhÙetšjeW keâe meb«en Deheves «eenkeâ kesâ efueS nes l ee nw ~ pees [s še Yes p e mekeâlee nw, Øeehle keâj mekeâlee nw Ùee Gmes ceeefie&le
(Route) keâj mekeâlee nw-
Skeâ Single coherent efmemšce ueielee nw lees Fmes keâne
The computer that originates the data- meesme& vees[
peelee nw
(Source Node)
(a) Computer network
The computer that routes the data - jeGbšj/efmJeÛe Deeefo
(b) Distributed system
(Inter Mediate Node)
(c) Both of (A) and (B)/(A) leLee (B) oesveeW
The computer that terminates the data - iebleJÙe
(d) None of the mentioned
(Destination Node).
Ans. (b) : Distributed System efJeleefjle ØeCeeueer– Jen
75. Communication channel is shared by all the
efmemšce neslee nw efpemeceW keâF& keâchÙetšj Skeâ meeLe efceuekeâj Fme lejn machines on the network in
keâece keâjles nw efkeâ Jes Ùetpeme& keâes Skeâ Skeâue (Single), Skeâerke=âle mebÛeej Ûewveue vesšJeke&â hej meYeer ceMeerueeW Éeje meePee
(Coherent) efmemšce keâer lejn Øeleerle nesles nw~ efkeâÙee peelee nw
Bihar STET 91 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
 (a) Broadcast network/Broadcast network ceW 79. Which of the following is not a network edge
(b) Unicast network/Unicast network ceW device?
(c) Multicast network/Multicast network ceW efvecve ceW mes keâewve Skeâ vesšJeke&â Spe ef[JeeFme veneR nw?
(d) None of these/FveceW mes keâesF& veneR (a) PC (b) Smartphones
(c) Servers (d) Switch
Ans. (a) : Broad Cast Network– Ssmee vesšJeke&â neslee nw
efpemeceW Skeâ ner mebÛeej Ûewveue (Communication Channel) meYeer Ans. (d) : Network Edge Devices Jes ef[JeeFme nesles nQ pees
ceMeerveeW Éeje meePee efkeâÙee peelee nw~ vesšJeke&â kesâ ‘Spe’ Ùeeveer efkeâveejs hej efmLele nesles nQ Deewj ØelÙe#e ™he mes
GheÙeesiekeâlee&DeeW kesâ meeLe Fbšjwkeäš keâjles nQ~ Ùes ef[JeeFme [sše keâes
peye keâesF& ceMeerve [sše Yespeleer nw, lees Jen mebosMe meYeer vesšJeke&â
pevejsš efjmeerJe Ùee Øeesmesme keâjles nw~
ef[JeeFmespe lekeâ hengBÛelee nw, uesefkeâve kesâJeue FefÛÚle efjmeerJej ner Gmes
Example– PC, Smartphones, Servers, etc.
mJeerkeâej keâjlee nw~
Switch Skeâ vesšJeke&â Fbšjveue (Network Internal) device nw,
76. …… is a device that forwards packets between
pees vesšJeke&â kesâ Yeerlej [sše š^wefHeâkeâ keâes Heâe@jJe[& keâjlee nw~
networks by processing the routing
information included in the packet. 80. Which transmission media has the highest
......... Skeâ GhekeâjCe nw pees Packets ceW Routing transmission speed in a network?
peevekeâejer keâes Processing keâjkesâ vesšJeke&â kesâ yeerÛe ef keâme Transmission ceeref[Ùee kesâ Skeâ vesšJeke&â ceW meyemes
Packets keâes Forward keâjlee nw~ DeefOekeâ transmission speed nw?
(a) Bridge (a) Coaxial cable (b) Twisted pair cable
(b) Firewall (c) Optical fiber (d) Electrical cable
(c) Router Ans. (c) : Optical Fiber kesâyeume ceW [sše keâes ØekeâeMe (Light)
(d) All of these/FveceW mes meYeer kesâ ™he ceW š^ebmeefceš efkeâÙee peelee nw, efpememes Ùen DevÙe meYeer
Ans. (c) : Router Skeâ vesšJeke&â ef[JeeFme nw pees [sše hewkesâšdme ceW š^ebmeefceMeve ceeref[Ùee keâer leguevee ceW yengle DeefOekeâ mheer[ Øeoeve keâjlee
ceewpeto Routing peevekeâejer keâes Øeesmesme keâjlee nw Deewj Ùen leÙe keâjlee nw~
nw efkeâ hewkesâš keâes efkeâme jemles mes Deieueer cebefpeue (Destination) lekeâ 81. Which of the cell pointers indicates that you
Yespee peeS~ can fill series?
Ùen efJeefYeVe vesšJekeâeX keâes Deeheme ceW peesÌ[ves Deewj [sše keâes meyemes mesue hee@Fbšj ceW mes keâewve Fbefiele keâjlee nw efkeâ Deehe ëe=bKeuee
kegâMeue ceeie& mes Yespeves keâe keâeÙe& keâjleer nw~ Yej mekeâles nQ?
77. The structure or format of data is called (a) Doctor's symbol (Big Plus)
[sše keâer mebjÛevee Ùee Øee™he keâes keâne peelee nw (b) Small thin plus icon
(a) Syntax (c) Mouse Pointer with anchor at the tip
(b) Semantics (d) None of these/FveceW mes keâesF& veneR
(c) Struct Ans. (b) : peye Deehe Microsoft Excel Ùee DevÙe mØes[Meerš
(d) None of these/FveceW mes keâesF& veneR Øees«eecme ceW keâece keâjles nQ, lees-
Ans. (a) : Syntax keâe DeLe& neslee nw: [sše Ùee efveoxMeeW keâer mebjÛevee Skeâ mesue kesâ veerÛes oeSb keâesves hej Úesše mee Ûeewkeâesj yee@keäme neslee nw,
(Structure) Deewj Øee™he (Format)~ efpemes Fill-Handle keânles nQ, peye Deehe ceeGme keâer Gme yee@keäme hej ues
Ùen efveOee&efjle keâjlee nw efkeâ [sše keâes kewâmes efueKee], JÙeJeefmLele Deewj peeles nQ, lees keâme&j Úesšs heleues hueme (+) DeeFkeâve ceW yeoue peelee nw~
Øemlegle efkeâÙee peeS leeefkeâ Jen efmemšce Éeje mecePee pee mekesâ~ 82. On an Excel sheet the active cell is indicated by.
78. Communication between a computer and a Skeämesue Meerš hej meef›eâÙe mesue Fbefiele efkeâÙee peelee nw
keyboard involves ………. transmission. (a) A dotted border /Skeâ [e@šs[ yee@[j& Éeje
kebâhÙetšj Deewj keâeryees[& kesâ yeerÛe mebÛeej........... š^ebmeefceMeve
(b) A dark wide border/Skeâ [ke&â JeeF[ yee@[&j Éeje
ceW Meeefceue nw~
(c) A blinking border/Skeâ efyuebefkebâie yee@[&j Éeje
(a) Automatic (b) Half-duplex
(c) Full-duplex (d) Simplex (d) By italic text/veerjÚer šskeämš Éeje
Ans. (d) : Simplex Communication Skeâ Ssmee mebÛeej Øekeâej Ans. (b) : Microsoft Excel ceW peye Deehe efkeâmeer mesue keâes Ûegveles
nw efpemeceW [sše kesâJeue Skeâ ner efoMee ceW š^ebmeefceš neslee nw~ nQ, lees Jen mesue ‘‘meef›eâÙe mesue’’ (Active cell) keânueelee nw~
keâeryees[& kesâJeue [sše keâes keâchÙetšj keâer lejHeâ Yespelee nw (pewmes efkeâ meef›eâÙe mesue (Active cell) kesâ ÛeejeW Deesj Skeâ ieeÌ{e (Dark) Deewj
Deehe pees šeFhe keâjles nw), uesefkeâve kebâhÙetšj Keyboard keâes kegâÚ ceesše (Wide) yee[&j efoKeeÙeer oslee nQ Fmeer mesue ceW Ùetpej [sše šeFhe
Jeeheme veneR keâjlee Yespelee~ keâjlee nw~

Bihar STET 92 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
83. What term describes explanatory text attached Enter oyeeves hej mesue Deehekeâer šeFefhebie keâes mJeerkeâej keâjlee nw Deewj
to a cell? Deehekeâes Deieues mesue hej ues peelee nw~
mesue mes petÌ[er JÙeeKÙeelcekeâ hee" efkeâme Meyo keâe JeCe&ve Tab oyeeves hej Yeer mesue [sše mJeerkeâej keâjlee nw, uesefkeâve keâme&j
keâjlee nw? Deieues keâe@uece ceW peelee nw~
(a) Context (b) Callout 87. Which among the following is associated with
(c) Comment (d) Dialog Excel?
Ans. (c) : Excel ceW peye Deehe efkeâmeer mesue ceW JÙeeKÙeelcekeâ Ùee efvecveefueefKele ceW mes keâewve-mee Skeämesue kesâ meeLe peÌ[e ngDee
veesšdme kesâ ™he ceW šskeämš peesÌ[les nQ, lees Gmes "Comment" keâne peee nw ?
(a) Graphic program (b) Word Processor
nw~
(c) Presentation (d) Spreadsheet
Ùen Skeâ Úesše šskeämš yee@keäme neslee nw, pees mesue mes pegÌ[e neslee nw~ Ans. (d) : Microsoft Excel Skeâ Spreadsheet Øees«eece nw,
84. Which of the following will not select all the efpemekeâe cegKÙe GheÙeesie [sše keâes leeefuekeâe (table) kesâ ™he ceW
cells in a document? JÙeJeefmLele keâjves, ieCevee keâjves, efJeMues<eCe keâjves Deewj Ûeeš& yeveeves kesâ
efvecve ceW mes keâewve Skeâ omleeJespe ceW meYeer cells keâe ÛeÙeve efueS efkeâÙee peelee nw~
veneR keâjsiee? 88. Except which of the following functions, a
(a) Using the Edit - Select all menu/Using the formula with a logical function shows the
Edit - Select all menu keâe ØeÙeesie Éeje words "TRUE" or "False" as a result?
(b) Pressing Ctrl + A on the keyboard ef vecve ceW mes efkeâme Function keâes leeefke&âkeâ HebâkeäMeve kesâ
keâeryees[& hej Ctrl + A oyeekeâj meeLe Skeâ met$e kesâ DeueeJee Skeâ heefjCeece kesâ ™he ceW mener
(c) Clicking three times with the right mouse (True) Ùee ieuele (False) efoKeelee nw?
button in the spreadsheet/mØes[Meerš ceW oeÙeeB (a) NOT (b) OR
Mouse button leerve yeej efkeäuekeâ keâj (c) IF (d) AND
(d) None of these/FveceW mes keâesF& veneR Ans. (c) : If Function Skeâ leeefke&âkeâ HebâkeäMeve nw pees efkeâmeer Mele&
(Logical test) keâer peeBÛe keâjlee nw Deewj Mele& True nes lees Skeâ
Ans. (c) : Excel Ùee DevÙe mØes[Meerš Øees«eece ceW meYeer mesume keâe
heefjCeece Deewj False nes lees otmeje heefjCeece efoKeelee nw~
ÛeÙeve keâjves kesâ efueS Deeceleewj hej efvecve lejerkeâeW keâe GheÙeesie efkeâÙee
89. Which of the following is not a valid zoom
peelee nw~ percentage in Excel?
Edit Select All Ùen cesvet mes meYeer mesume keâes mesueskeäš keâjlee Skeämesue ceW, efvecveefueefKele ceW mes keâewve Skeâ JewOe petce
nw~ ØeefleMele veneR nQ?
Ctrl + A Ùen keâeryees[& Mee@š&keâš mes hetjs Jeke&âMeerš keâes mesueskeäš
(a) 10 (b) 100
keâjlee nw~ (c) 300 (d) 500
85. The default style for new data keyed in a new Ans. (d) : Microsoft Excel ceW petce (Zoom) HeâerÛej keâe GheÙeesie
workbook is? Jeke&âMeerš kesâ ÂMÙe keâes Úesše Ùee yeÌ[e keâjves kesâ efueS efkeâÙee peelee nw~
Skeâ veF& Workbook ceW veS [sše kesâ efueS ef[Heâe@uš vÙetvelece : 10%
Mewueer nw DeefOekeâlece : 400%
(a) Comma (b) Normal
90. You can check the conditions against
(c) Currency (d) Percent
………..when applying conditional formatting.
Ans. (b) : Microsoft Excel ceW peye Deehe veF& Workbook Conditional Formatting ueeiet keâjles meceÙe
Deesheve keâjles nQ Deewj keâesF& veÙee [sše šeFhe keâjles nQ, lees ef[Heâe@uš Deehe............... kesâ efKeueeHeâ efmLeefle keâer peeBÛe keâj mekeâles
mesue mšeFue nesleer nw "Normal"~ nQ~
Ùen mšeFue meeceevÙe Heâe@cexefšbie oslee nw pewmes meeceevÙe Heâe@vš, meeceevÙe (a) Cell Value/mesue cetuÙe
jbie Deewj keâF& efJeMes<e vecyej Heâe@cexefšbie veneR~ (b) Formula/met$e
86. If you press………, the cell accepts your typing
(c) Both of (A) and (B)/(A) leLee (B) oesveeW
as its contents.
Ùeefo Deehe .......... oyeeles nQ lees cell Deehekesâ šeFefhebie keâes (d) None of these/FveceW mes keâesF& veneR
efJe<eÙeJemleg kesâ ™he ceW mJeerkeâej keâjlee nw~ Ans. (c) : Conditional Formatting Skeâ Ssmee HeâerÛej nw pees
(a) Tab (b) Ctrl + Enter Excel ceW mesume kesâ Heâe@cexš (pewmes jbie, Heâe@vš, yee@[&j Deeefo) keâes kegâÚ
(c) Enter (d) Alt + Enter ef JeMes<e Meleex (Conditions) kesâ DeeOeej hej yeoueves oslee nw~
Ans. (c) : peye Deehe Excel Ùee efkeâmeer mØes[Meerš ceW keâesF& [sše mesue cetuÙe (Cell Value)
šeFhe keâj jns nesles nQ: Heâe@cet&uee (Formula)
Bihar STET 93 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
91. UNIVAC is Ans. (a) : DOS (Disk Operating System) Skeâ Dee@hejsefšbie
UNIVAC nw efmemšce nw pees kebâhÙetšj keâes Ûeueeves kesâ efueS Fmlesceeue efkeâÙee peelee Lee,
(a) Universal Automatic Computer Keemekeâj Meg™Deeleer efoveeW ceW~ Ùen Skeâ keâceeC[ DeeOeeefjle
(b) Universal Array Computer (Command Based) efmemšce nw, efpemeceW Ùetpeme& keâes keâeryees[& kesâ
(c) Unique Automatic Computer
(d) Unvalued Automatic Computer
peefjS keâceeC[ šeFhe keâjkesâ kebâhÙetšj keâes efveo&sMe osvee neslee nw~
Ans. (b) : UNIVAC keâe hetje veece (Universal Automatic 96. ASCII and EBCDIC are the popular character
coding systems. What does EBCDIC stand for?
Computer)
ASCII Deewj EBCDIC ueeskeâefØeÙe Character
Ùen henuee JÙeeJemeeefÙekeâ (Commercial) Fueskeäš^e@efvekeâ ef[efpešue
keâchÙetšj Lee~ Coding System nQ~ EBCDIC keâe hetje veece nw
Fmes J. Presper Eckert Deewj John Mauchly ves efJekeâefmele (a) Extended Binary Coded Decimal Interchange
Code
efkeâÙee Lee~ Ùen 1951 ceW henueer yeej GheÙeesie ceW ueeÙee ieÙee~
(b) Extended Bit Code Decimal Interchange
92. The basic operations performed by a computer Code
are
(c) Extended Bit Case Decimal Interchange Code
Skeâ Computer Éeje efkeâS ieS cetue mebÛeeueve nw (d) Extended Binary Case Decimal Interchange
(a) Arithmetic operation Code
(b) Logical operation
Ans. (a) : EBCDIC (Extended Binary Coded
(c) Storage and related
Decimal Interchange Code)– Skeâ kewâjskeäšj Svekeâesef[bie
(d) All of these/FveceW mes meYeer
efmemšce nw efpemekeâe GheÙeesie kebâhÙetšj ceW Dekeämej mebKÙee Deewj efJeMes<e
Ans. (d) : efkeâmeer Yeer Computer keâe cegKÙe keâeÙe& neslee nw [sše keâes efÛevneW (Characters) keâes yeeFvejer keâes[ (0 Deewj 1) ceW yeoueves kesâ
Øeesmesme keâjvee~ Fmekesâ efueS keâchÙetšj efvecveefueefKele cetue (Basic) keâe efueS efkeâÙee peelee nw~
mebÛeeueve keâjlee nw–
97. Who is the father of Computer?
Arithmeticm Operation– peesÌ[, IešeJe, iegCee, Yeeie~
Computer kesâ efhelee (pevceoelee) keâewve nw?
Logical Operation– leguevee pewmes (>, <, =)
(a) Allen Turing (b) Simur Cray
Storage & Relative– [sše keâes mšesj keâjvee Deewj Gmes hegve: (c) Augusta Adaming (d) Charles Babbage
Øeehle keâjvee~ Ans. (d) : 'Charles Babbage' keâes Computer keâe efheleecen
93. Who is the inventor of "Difference Engine"? keâne peelee nw~ Ùes Skeâ ieefCele%e DeeefJe<keâejkeâ Deewj Ùeebef$ekeâ FbpeerefveÙej
"Difference Engine" keâe DeeefJe<keâejkeâ keâewve nw? Les~ FvneWves Difference Engine Deewj Analytical Engine keâe
(a) Allen Turing (b) Charles Babbage DeefJe<keâej efkeâÙee~
(c) Simur Cray (d) Augusta Adaming
98. Storage capacity of magnetic disk depends on
Ans. (b) : 'Difference Engine' keâe DeeefJe<keâej 'Charles ÛegcyekeâerÙe ef[mkeâ keâer Yeb[ejCe #ecelee efveYe&j keâjleer nw
Babbage' ves efkeâÙee Lee~ Ùen Skeâ cewkesâefvekeâue kewâuekegâuesšj Lee~ efpemes (a) Tracks per inch of surface
ieefCeleerÙe leeefuekeâeSB (Mathmatical Tables) yeveeves kesâ efueS 1822 (b) Bits per inch of tracks
F&. ceW ef[peeFve efkeâÙee ieÙee Lee~ (c) Disk pack in disk surface
94. Microprocessors as switching devices are for (d) All of these/FveceW mes meYeer
which generation computers Ans. (d) : ÛegcyekeâerÙe ef[mkeâ pewmes ne[& [^eFJe (HDD) ceW [sše
Switching GhekeâjCeeW kesâ ™he ceW Microprocessor
mšesj keâjves keâer #ecelee Fve yeeleeW hej efveYe&j keâjleer nw–
efkeâme heerÌ{er kesâ Computer kesâ efueS nw?
Tracks per inch of surface– Ùen oMee&lee nw efkeâ ef[mkeâ keâer
(a) First Generation (b) Second Generation
lejn hej Øeefle FbÛe efkeâleves š^wkeâ (Data Circles) yeveeS pee mekeâles nQ~
(c) Third Generation (d) Fourth Generation
š^wkeâ efpeleves DeefOekeâ nesieW Glevee pÙeeoe [sše mšesj nessiee~
Ans. (d) : Microprocessors keâe GheÙeesie Switching
Bits per inch of track– Ùen [sše IevelJe keâes oMee&lee nw~
Devices kesâ ™he ceW ÛeewLeer heerÌ{er (Fourth Generation) kesâ
kebâhÙetšjeW ceW Meg™ ngDee~ Fmekeâe meceÙeeJeefOe (1970 mes Deye lekeâ) ceeveer Disk pack in disk surface– ef[mkeâ hewkeâ Ùeeveer Skeâ ef[mkeâ
peeleer nw~ GoenjCe- Intel 4004 henuee ceeF›eâesØeesmesmej (1971)~ melen ceW efkeâleveer melenW (Surface) Ùee huesšme nesleer nw~
95. DOS stands for 99. The two kinds of main memory are
DOS keâe hetje veece nw oes Øekeâej kesâ Main Memory nQ
(a) Disk Operating System (a) Primary and Secondary
(b) Disk Operating Session (b) Random and Sequential
(c) Digital Operating System (c) ROM and RAM
(d) Digital Open System (d) All of these/FveceW mes meYeer

Bihar STET 94 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
Ans. (c) : Main Memory keâes Primarty Memory Yeer keâne 103. What is the term used when you press and hold
peelee nw, Deewj Fmekesâ oes Øekeâej nesles nQ- RAM and ROM the left mouse key and move the mouse around
the slide?
ROM (Read Only Memory)– Ùen Skeâ mLeeÙeer cesceesjer
peye Deehe yeeF& ceeGme kegBâpeer oyeeles nQ Deewj ceeGme keâes
(Non-Volatile) nesleer nw~ FmeceW yetefšbie Øeef›eâÙee mes pegÌ[er peevekeâejer
mueeF[ kesâ ÛeejeW Deesj oyeeles nQ, lees keäÙee Meyo keâe
nesleer nw~
GheÙeesie efkeâÙee peelee nw?
RAM (Read Only Memory)– Ùen Skeâ DemLeeÙeer cesceesjer
(a) Moving (b) Dragging
(Volatile) nesleer nw~ kebâhÙetšj kesâ keâeÙe& keâjles meceÙe [sše FmeceW mšesj
(c) Monitoring (d) Highlighting
neslee nw~
Ans. (b) : peye Deehe ceeGme keâe yeeÙeer (Left) yešve keâes oyeekeâj
100. A storage area used to store data to compensate jKeles nQ Deewj ceeGme keâes m›eâerve Ùee mueeF[dme hej ÛeejeW Deesj Iegceeles nQ,
for the difference in speed at which the
different units can handle data is
lees Fme ef›eâÙee keâes Dragging (KeeRÛevee) keâne peelee nw~
Skeâ Storage area efpemes [sše keâes Gme ieefle kesâ Deblej Ùen leye GheÙeesie efkeâÙee peelee nw peye Deehe–
keâer YejheeF& keâjves kesâ efueS GheÙeesie efkeâÙee peelee nw efpeme efkeâmeer #es$e keâe ÛeÙeve keâjles nw~
hej efJeefYeVe FkeâeFÙeeB [sše keâes mebYeeue mekeâleer nQ,nw keâesF& Dee@ypeskeäš keâes Skeâ peien mes otmejer peien ues peeles nw~
(a) Memory (b) Buffer 104. Which of the following SQL commands is used
(c) Accumulator (d) Address to view data?
Ans. (b) : Buffer Skeâ DemLeeÙeer mšesjspe SefjÙee neslee nw, efpemekeâe efvecveefueefKele ceW mes keâewve meer SQL commands [sše
GheÙeesie leye efkeâÙee peelee nw peye oes ef[JeeFme (pewmes CPU Deewj osKeves kesâ efueS GheÙeesie keâer peeleer nw?
Harddisk) Deueie-Deueie ieefle mes [sše Øeesmesme keâjles nQ~ (a) CREATE (b) INSERT
Ùeefo Skeâ lespe CPU efkeâmeer Oeerces I/O ef[JeeFme (pewmes efØebšj Ùee ne[& (c) SELECT (d) UPDATE
ef[mkeâ) mes [sše Øeehle keâj jne nw, lees Buffer yeerÛe ceW [sše keâes Ans. (c) : SELECT keâceeC[ keâe GheÙeesie SQL ceW [sše keâes
nesu[ keâjlee nw leeefkeâ oesveeW FkeâeFÙeeB mener mes keâece keâj mekesâb~ osKeves Ùee Øeehle keâjves kesâ efueS efkeâÙee peelee nw Ùen keâceeC[ [sšeyesme
101. To preview a motion path effect using the
mes [sše Query keâjves kesâ efueS meyemes pÙeeoe GheÙeesie keâer peeleer nw~
custom animation task pane, we should pewmes- SELECT * From student;
Custom Animation task pane keâe GheÙeesie keâjles Ùen keâceeC[ Student šsyeue mes meYeer [sše efoKeeÙesieer~
ngS Skeâ ieefle heLe ØeYeeJe kesâ hetJee&Jeueeskeâve ceW nceW keâjvee 105. Which of the following views is the best view to
ÛeeefnS use when setting transition effects for all slides
(a) Double click the motion path in a presentation?
(b) Click the show effect button efvecveefueefKele ceW mes keâewve mee ÂMÙe efkeâmeer Øemlegefle ceW meYeer
(c) Click the play button mueeF[eW kesâ efueS meb›eâceCe ØeYeeJe mesš keâjles meceÙe
(d) None of these/FveceW mes keâesF& veneR GheÙeesie keâjves kesâ efueS meyemes DeÛÚe ÂMÙe nw?
Ans. (c) : peye Deehe Custom Animation Task Pane keâe (a) Slide (b) Notes page view
GheÙeesie keâjles nQ Deewj keâesF& Motion Path (ieefle heLe) ØeYeeJe peesÌ[les (c) Outline view (d) Slide sorter view
nQ, lees Gme ØeYeeJe keâe hetJee&ueeskeâve (Preview) osKeves kesâ efueS– Ans. (d) : Slide Sorter View ceW PowerPoint keâes meYeer
Deehekeâes 'Play' yešve hej efkeäuekeâ keâjvee neslee nw, pees Task pane mueeF[W Lebyevesue (Thumbnail) ™he ceW Skeâ meeLe efoKeeÙeer osleer nw~
ceW GheueyOe neslee nw~ Fme ÂMÙe (View) ceW-
Ùen yešve SefvecesMeve keâe hetJee&ueeskeâve efoKeelee nw, efpememes Deehe osKe meYeer mueeF[eW keâes Skeâ meeLe osKe mekeâles nQ~
mekeâles nQ efkeâ mueeF[ Mees ceW Jen ØeYeeJe kewâmes efoKeeF& osiee~ Skeâ meeLe keâF& mueeF[eW keâe ÛeÙeve keâj mekeâles nw~
102. Which one is a DCL command in SQL? 106. Math.h is a
efvecve ceW keâewve mee SQL ceW DCL Command nw? Math.h nw Skeâ
(a) UPDATE (b) SELECT (a) Derived data type (b) Function
(c) DELETE (d) GRANT (c) Header file (d) Built-in data type
Ans. (d) : DCL (Data Control Language) keâe GheÙeesie Ans. (c) : Math.h Skeâ Header file nw pees C Deewj C++ pewmeer
[sšeyesme ceW Ùetpeme& kesâ Skeämesme Deewj hejefceMeve keâes efveÙebef$ele keâjves kesâ Yee<eeDeeW ceW Mathmatical Functions (pewmes- sqrt(), pow(), sin(),
efueS efkeâÙee peelee nw~ SQL ceW cegKÙe DCL keâceeb[dme– cos() Deeefo) keâes GheÙeesie keâjves kesâ efueS Meeefceue keâer peeleer nw~
1. GRANT– efkeâmeer Ùetpej keâes efkeâmeer Dee@ypeskeäš hej hejefceMeve osvee~ 107. The selected design template can be aplied
2. REVOKE– efkeâmeer Ùetpej mes oer ieÙeer hejefceMeve nševee~ ÛeÙeefvele ef[peeFve šscheuesš ueeiet efkeâÙee pee mekeâlee nw
Bihar STET 95 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
 (a) To current slide only/kesâJeue kesâ efueS Ans. (d): Slide Show Menu ceW DeehekeâeW efvecveefueefKele efJekeâuhe
(b) To all the slides/meYeer mueeF[eW kesâ efueS efceueles nQ–
(c) To all the new presentation you create Animation Scheme (hegjeves PowerPoint mebmkeâjCeeW ceW)
meYeer veF& Øemlegefle pees Deehe lewÙeej keâjles nQ kesâ efueS Custom Animation
(d) All of these/FveceW mes meYeer Slide Transition
Ans. (d) : PowerPoint ceW peye keâesF& ef[peeFve šscheuesš (Design Ùes meYeer efJekeâuhe mueeF[dme ceW SveercesMeve Deewj š^ebefpeMeve peesÌ[ves kesâ
Template) Ûegveles nw, lees Deehe Gmes- efueS nesles nQ, Deewj Ùes Slide Show Menu kesâ Devleie&le Deeles nQ~
kesâJeue Current Slide kesâ efueS Yeer ueeiet keâj mekeâles nQ~ 111. Computer is free from tiresome and boredom.
We call it
meYeer mueeF[eW kesâ efueS Yeer ueeiet keâj mekeâles nw~
keâchÙetšj Lekeâeve Deewj efJeMmelee mes cegkeäle neslee nw, efpemes
YeefJe<Ùe ceW yeveeÙeer peeves Jeeueer meYeer veF& ØemlegefleÙeeW hej Yeer ueeiet keâj
nce keânles nQ
mekeâles nQ (Deiej Deehe ef[Heâeuš kesâ ™he ceW mesJe keâj oW)~
(a) Accuracy (b) Reliability
108. The difference between Slide Design and Auto (c) Diligence (d) Versatility
Content Wizard is
Ans. (c) : Diligence (ueieveMeeruelee/heefjßeceMeeruelee)–
mueeF[ ef[peeFve Deewj Dee@šes meece«eer efJepee[& kesâ yeerÛe
Fmekeâe DeLe& nw efkeâ kebâhÙetšj Lekeâlee veneR nw, Tyelee veneR nw, Deewj
keâe Deblej nw
ueieeleej keâece keâj mekeâlee nw, efyevee efkeâmeer efJejece kesâ~ FmeefueS Ùen
(a) Both are same/oesveeW Skeâ ner nw
efJeMes<elee kebâhÙetšj keâer Lekeâeve Deewj efJeßeece mes cegkeäle nesves keâes oMee&lee nw~
(b) Auto Content Wizard is just the wizard
version of Slide Design 112. Integrated Circuits (ICs) are related to which
generation of computers?
(c) Slide Design does not provide sample content
Integrated Circuits (ICs) efkeâme heerÌ{er kesâ
but Auto Content Wizard provides sample
content too Computer mes mebyebefOele nw?
(d) Slide Design asks your choice in steps but (a) First generation (b) Second generation
Auto Content Wizard does not let you make (c) Third generation (d) Fourth generation
choices Ans. (c) : First Generation kesâ kebâhÙetšj ceW JewkeäÙetce šŸetye
Ans. (c) : Slide design Deehekeâes kesâJeue mueeF[ keâe ÂMÙe ™he (Vaccum Tube) Fmlesceeue efkeâÙee peelee Lee~ Second
(Layout, background, theme) Ûegveves ceW ceoo keâjlee nw~ Ùen Generation kesâ keâchÙetšj ces š^ebefpemšj keâe GheÙeesie ngDee~ peyeefkeâ
meece«eer (Content) veneR oslee nw~ Third Generation kesâ kebâhÙetšj ceW Integrated Circuits (IC's)
peyeefkeâ Auto Content Wizard Skeâ efJepee[& keâer lejn mšshe- keâe GheÙeesie efkeâÙee ieÙee, efpememes kebâhÙetšj Úesše, lespe Deewj DeefOekeâ
yeeÙe-mšshe ceoo keâjlee nw Deewj GoenjCe meece«eer (Sample kegâMeue nes ieÙes~
Content) Yeer oslee nw, leeefkeâ Deehe Deheveer Øemlegefle peuoer Meg™ keâj 113. CD-ROM is a
mekeWâ~ CD-ROM nw Skeâ
109. In which menu can you find features like Slide (a) Semiconductor memory
Design, Slide Layout etc.? (b) Memory register
efkeâme cesvÙeg ceW Deehekeâes mueeF[ ef[peeFve, mueeF[ (c) Magnetic Memory
uesDeeGš Deeefo pewmeer megefJeOeeSB efceue mekeâleer nQ? (d) None of these/FveceW mes keâesF& veneR
(a) Insert Menu (b) Format Menu Ans. (d) : CD-ROM (Compact Disc-Read Only
(c) Tools Menu (d) Slide Show Menu Memory) Skeâ Dee@efhškeâue cesceesjer (Optical Memory) nesleer nw,
Ans. (b) : PowerPoint kesâ Format Menu ceW DeehekeâeW Slide ve efkeâ mesceerkeâv[keäšj, jefpemšj Ùee cewivesefškeâ cesceesjer~
Design, Slide Layout, Background, Color Scheme Deeefo 114. A hybrid computer
mes pegÌ[er megefJeOeeSB efceueleer nQ~ efJekeâuhe mueeF[ keâer ÂMÙe Mewueer Deewj Skeâ hybrid computer
®hejsKee keâes efveÙebef$ele keâjles nw~ (a) Resembles digital computer
110. Which menu provides you the options like ef[efpešue kebâhÙetšj pewmee nw
Animation Scheme, Custom Animation, Slide (b) Resembles analogue computer
Transition? Sveeuee@ie kebâhÙetšj pewmee nw
keâewve mee cesvÙeg Deehekeâes Ùeespevee, keâmšce SveercesMeve, (c) Resembles both as digital and analogue
mueeF[ Transition pewmes efJekeâuhe Øeoeve keâjlee nw? computer
(a) Insert Menu (b) Format Menu oesveeW ef[efpešue leLee Sveeuee@ie kebâhÙetšj pewmee nw
(c) Tools Menu (d) Slide Show Menu (d) None of these/FveceW mes keâesF& veneR

Bihar STET 96 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
Ans. (c) : Hybrid Computer Jen kebâhÙetšj neslee nw, pees 118. …..… is a combination of hardware and
Analog Deewj Digital oesveeW Øekeâej kesâ kebâhÙetšjeW keâer efJeMes<eleeDeeW keâes software that facilitates the sharing of
information between computing devices.
efceueekeâj keâece keâjlee nw~
.......... ne[&JesÙej Deewj mee@HeäšJesÙej keâe Skeâ mebÙeespeve nw
Ùes kebâhÙetšj Gve keâeÙeex kesâ efueS GheÙeesie efkeâÙes peeles nw peneB [sše keâe
pees kebâhÙetefšbie ef[JeeFmeeW kesâ yeerÛe metÛevee kesâ Deeoeve-
kegâÚ Yeeie ueieeleej (Analog) Deewj kegâÚ Yeeie ieCeelcekeâ (Digital)
Øeoeve keâer megefJeOee Øeoeve keâjlee nw~
™he ceW neslee nQ- pewmes efkeâ cesef[keâue GhekeâjCeeW (ECG), meeFbefšefHeâkeâ
(a) Network (b) Peripheral
ØeÙeesie Deeefo ceW~
(c) Expansion board (d) Digital device
115. Which type of computer uses the 8-byte code
Ans. (a) : Network (vesšJeke&â) ne[&JesÙej Deewj mee@heäšJesÙej keâe Ssmee
called EBCDIC?
efkeâme Øekeâej kesâ keâchÙetšj ceW 8 efyeš keâes[ keâe GheÙeesie Ùeespeve neslee nw, pees oes Ùee DeefOekeâ kebâhÙetefšbie ef[JeeFmeeW (pewmeer
meb
kebâhÙetšj, ceesyeeFue, efØebšj Deeefo) kesâ yeerÛe metÛevee (Information) kesâ
efkeâÙee peelee nw, efpemes EBCDIC keâne peelee nw?
Deeoeve-Øeoeve (Communication) keâes mecYeJe yeveelee nw~
(a) Minicomputers
(b) Microcomputers 119. 1 Byte = ?
(c) Mainframe computers (a) 8 bits (b) 4 bits
(d) Supercomputer (c) 2 bits (d) 9 bits
Ans. (c) : EBCDIC keâe hetje veece (Extended Binary Coded Ans. (a) : kebâhÙetšj ceW [sše keâes efyešdme (Bits) Deewj yeeFšdme ceW ceehee
Decimal Interchange Code) Ùen Skeâ 8-bit kewâjskeäšj keâesef[bie peelee nw~
mkeâerce nQ efpemes IBM Éeje efJekeâefmele efkeâÙee ieÙee Lee~ Ùen cegKÙele: 1 Byte = 8 Bits neslee nw~
Mainframe Computers ceW GheÙeesie neslee nw, Keemekeâj IBM kesâ 120. Which of the following IC was used in third
hegjeves efmemšcedme ceW~ generation of computers?
efvecve ceW mes efkeâme IC keâe GheÙeesie leermejer heerÌ{er kesâ
116. The ALU of a computer responds in the
kebâhÙetšj ceW efkeâÙee ieÙee Lee?
commands coming from
(a) SSI
Computer keâe ALU ……….. mes Deeves Jeeues DeeosMe
(b) MSI
keâe peJeeye oslee nw~ (c) LSI
(a) Primary memory (b) Control section (d) Both of (A) and (B)/(A) leLee (B) oesveeW
(c) External memory (d) Cache memory
Ans. (d) : leermejer heerÌ{er kesâ kebâhÙetšj (Third Generation
Ans. (b) : ALU (Arithmetic Logic Unit) kebâhÙetšj keâe Jen Computers) ceW ICs (Integrated Circuits) keâe GheÙeesie Meg™
Yeeie neslee nw pees ieefCeleerÙe Deewj leeefke&âkeâ (Logical) ef›eâÙeeÙes keâjlee ngDee~
nw~ Fme heerÌ{er ceW efvecve Øekeâej kesâ ICs keâe GheÙeesie efkeâÙee ieÙee-
Ùen mJeleb$e ™he mes keâece veneR keâjlee yeefukeâ Control Unit SSI (Small Scale Integration)– FmeceW kegâÚ ner iesšdme
(Control Section) mes efveoxMe Øeehle keâjlee nw~ (Logic Gates) nesles LeW~
Control Unit efveoxMeeW keâes ef[keâes[ keâjlee nw Deewj ALU keâes MSI (Medium Scale Integration)– FmeceW mewkeâÌ[eW iesšdme
yeleelee nw efkeâ keâewve mee keâeÙe& keâjvee nw~ nes mekeâles Les efpememes DeefOekeâ peefšue keâeÙe& mecYeJe ngS~
117. Chief component of first generation computer 121. End Key
was (a) Moves the cursor to the end of the line
ØeLece heerÌ{er kesâ kebâhÙetšj keâe cegKÙe Ieškeâ Lee Cursor keâes Line kesâ Deble lekeâ Ûeueelee nw
(a) Transistors (b) Moves the cursor to the end of the document
(b) Vacuum Tubes and Valves Cursor keâes Document kesâ Deble lekeâ Ûeueelee nw~
(c) Integrated Circuits (c) Moves the cursor to the end of the paragraph
(d) None of these/FveceW mes keâesF& veneR Cursor keâes Paragraph kesâ Deble lekeâ Ûeueelee nw~
Ans. (b) : ØeLece heerÌ{er (First Generation) kesâ kebâhÙetšj 1940 mes (d) Moves the cursor to the end of the screen
1956 kesâ yeerÛe efJekeâefmele efkeâÙes ieÙes Les~ Cursor keâes Screen kesâ Deble Ûekeâ Ûeueelee nw~
FveceW cegKÙe ™he mes Vaccum Tubes Deewj Valves keâe GheÙeesie Ans. (a) : End Key keâe GheÙeesie keâjles meceÙe keâme&j (Cursor)
efkeâÙee peelee Lee, [sše Øeesmesefmebie kesâ efueS~ Jele&ceeve ueeFve (Current Live) kesâ Deble (End) lekeâ Ûeuee peelee nw~
Ùes kebâhÙetšj Deekeâej ceW yeÌ[s, OeerceW Deewj yengle DeefOekeâ efyepeueer keâer Ùen šeFefhebie Ùee šskeämš Sef[efšbie ceW yengle GheÙeesieer neslee nw, peye
Kehele keâjves Jeeues nesles Les~ Deehekeâes ueeFve kesâ Deble ceW peuoer mes hengBÛevee neslee nw~
Bihar STET 97 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
122. "Ctrl + Page Down" is used to (c) Move the cursor one paragraph up
"Ctrl + Page Down" keâe GheÙeesie efkeâÙee peelee nw Cursor keâes Skeâ Paragraph Thej ues peeves kesâ efueS
(a) Move the cursor one paragraph down (d) Move the cursor one paragraph down
Cursor keâes Skeâ Paragraph veerÛes Ûeueeves kesâ efueS Cursor keâes Skeâ Paragraph veerÛes ues peeves kesâ efueS
(b) Move the cursor one Page down
Ans. (b) : "Ctrl + Left Arrow" oyeeves hej keâme&j (Cursor)
Cursor keâes Skeâ Page veerÛes Ûeueeves kesâ efueS
Skeâ Meyo (Word) yeeF& Deesj peelee nw~
(c) Move the cursor one line down
Cursor keâes Skeâ Line veerÛes Ûeueeves kesâ efueS Ùen šskeämš Sef[efšbie kesâ meceÙe lespeer mes Skeâ-Skeâ Meyo heerÚs peeves
(d) Move the cursor one Screen down kesâ efueS Fmlesceeue efkeâÙee peelee nw~
Cursor keâes Skeâ Screen veerÛes Ûeueeves kesâ efueS 126. Abstraction means
Ans. (b) : 'Ctrl + Page Down' keâe GheÙeesie omleeJespe Abstraction keâe celeueye nw
(Document) Jeke&âyegkeâ (pewmes Excel) Ùee yeÇeGpej ceW Deieues hespe Ùee (a) Summarization (b) Elimination
Deieueer meskeäMeve hej peeves kesâ efueS efkeâÙee peelee nw~ (c) Hiding (d) Casting
Ùen keâme&j keâes Skeâ hespe veerÛes ues peelee nw, Keemekeâj peye heWpe Ùee Ans. (c) : Abstraction Skeâ Object-Oriented
šwye DeeOeeefjle vesefJeiesMeve neslee nw~ Programming (OOP) keâer ØecegKe efJeMes<elee nw, efpemekeâe celeueye
123. "Ctrl + Down Arrow" is used to neslee nw-
"Ctrl + Down Arrow" keâe GheÙeesie efkeâÙee peelee nw ‘‘peefšuelee keâes efÚheevee Deewj kesâJeue DeeJeMÙekeâ peevekeâejer efoKeevee~’’
(a) Move the cursor one paragraph down Ùeeefve Ùetpeme& keâes kesâJeue Jener Ûeerpes efoKeeÙeer peeleer nw pees Gmekesâ efueS
Cursor keâes Skeâ Paragraph veerÛes Ûeueeves kesâ efueS pe®jer nQ~
(b) Move the cursor one line down 127. "Ctrl + Page Up" is used to
Cursor keâes Skeâ Line veerÛes Ûeueeves kesâ efueS "Ctrl + Page Up" key keâe GheÙeesie neslee nw
(b) Move the cursor one Page down (a) Move the cursor one page up
Cursor keâes Skeâ Page veerÛes Ûeueeves kesâ efueS Cursor keâes Skeâ Page Thej ues peeves kesâ efueS
(d) Move the cursor one Screen down (b) Move the cursor one paragraph up
Cursor keâes Skeâ Screen veerÛes Ûeueeves kesâ efueS Cursor keâes Skeâ Paragraph Thej ues peeves kesâ efueS
Ans. (a) : "Ctrl + Down Arrow" keâe GheÙeesie keâjves hej keâme&j (c) Move the cursor one screen up
meerOes Deieues hewje«eeHeâ keâer Meg®Deele ceW Ûeuee peelee nw~ Cursor keâes Skeâ Screen Thej ues peeves kesâ efueS
Ùen keâce meceÙe ceW šskeämš ceW hewje«eeHeâ oj hewje«eeHeâ vesefJeiesš keâjves kesâ (d) Move the cursor one line up
efueS GheÙeesieer nesleer nw, efJeMes<e ™he mes Word Øeesmesmej pewmes MS Cursor keâes Skeâ Line Thej ues peeves kesâ efueS
word ceW~
Ans. (a) : "Ctrl + Page Up" oyeeves hej keâme&j (Cursor) Ùee JÙet
124. Which one is a non-linear data structure? (View) keâes Skeâ hespe Thej ues peeÙee peelee nw~
efvecve ceW mes keâewve non-linear [sše mebjÛevee nw?
Ùen Mee@š&keâš efJeMes<e ™he mes Word Øeesmesmej (pewmes- MS Word,
(a) Stack (b) Queue
(c) Linked list (d) Tree Excel Jeke&âyegkeâ Deewj yeÇeGpej Deeefo) ceW lespe vesefJeiesMeve kesâ efueS
Ans. (d) : Linear Data Structure ceW [sše keâes ›eâceyeæ GheÙees ie neslee nw~
(Sequential) lejerkesâ mes mšesj efkeâÙee peelee nw nj Skeâ SefueceWš keâe 128. Polymorphism is feature of
Skeâ Deieuee Deewj efheÚuee SefueceWš neslee nw~ Polymorphism ………keâer Skeâ efJeMes<elee nw~
pewmes- Stack, Queue, Linked List (a) Procedural programming
Non-Linear Data Structure ceW [sše keâes njeefke&âue (Hierarchical) (b) SQL
Ùee Non-Sequential lejerkesâ mes mšesj efkeâÙee peelee nw~ (c) Non-procedural programming
pewmes- Tree, Graph- etc. (d) Object Oriented Programming
Ans. (d) : Polymorphism Skeâ cegKÙe efJeMes<elee nw, Object-
125. "Ctrl + Left Arrow" key in used to
"Ctrl + Left Arrow" key keâe GheÙeesie efkeâÙee peelee nw Oriented Programming (OOP) keâer~
(a) Move the cursor at the beginning of the line Fmekeâe celeueye nw Skeâ ner veece kesâ Function Ùee Operator
Cursor keâes Line kesâ Meg™ ceW ues peeves kesâ efueS Deueie-Deueie Øekeâej mes keâece keâj mekeâles nw~
(b) Move the cursor one word left 129. "Ctrl + Home" is used to
Cursor keâes Skeâ Word yeeÙeeb ues peeves kesâ efueS "Ctrl + Home" key keâe GheÙeesie neslee nw
Bihar STET 98 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
 (a) Move the cursor to the beginning of 133. Internet access by transmitting digital data
document over the wires of a local telephone network is
Cursor keâes Document kesâ Meg™ ceW ues peeves kesâ efueS provided by
(b) Move the cursor to the beginning of line Skeâ mLeeveerÙe šsueerHeâesve vesšJeke&â kesâ leejeW hej ef[efpešue
Cursor keâes Line kesâ Meg™ ceW ues peeves kesâ efueS [sše mebÛeeefjle keâjkesâ Fbšjvesš keâe GheÙeesie Éeje Øeoeve
(c) Move the cursor to the beginning of
efkeâÙee peelee nw
paragraph
Cursor keâes Paragraph kesâ Meg™ ceW ues peeves kesâ efueS (a) Leased line
(d) All of these/FveceW mes meYeer (b) Digital subscriber line
(c) Digital signal line
Ans. (a) : "Ctrl + Home" keâer yees[& Mee@š&keâš keâme&j keâes hetjs
(d) None of the mentioned
omleeJespe (Document) kesâ meyemes Meg®Deele (Beginning) ceW ues
peelee nw~ Ans. (b): mLeeveerÙe šsueerHeâesve vesšJeke&â keâer leejeW kesâ ceeOÙece mes
Ùen Mee@škeâš& yeÌ[s [e@keäÙetceWš ceW lespeer mes Meg®Deele hej peeves kesâ efueS ef[efpešue [sše keâes mebÛeeefjle keâjkesâ pees Fbšjvesš mesJee oer peeleer nw, Gmes
yengle GheÙeesieer neslee nw~ DSL (Digital Subscriber Line) keâne peelee nw~ Ùen Skeâ
130. "Ctrl + End" is used to meeceevÙe šsueerHeâesve ueeFve keâe GheÙeesie keâjkesâ GÛÛe ieefle mes Fbšjvesš
"Ctrl + End" key keâe GheÙeesie neslee nw Øeoeve keâjlee nw~
(a) Move the cursor to the end of line 134. ISP exchanges internet traffic between their
Cursor keâes Line kesâ Deble ceW ues peeves kesâ efueS networks by
(b) Move the cursor to the end of document ISP Deheves vesšJekeâeX kesâ yeerÛe Fbšjvesš š^wefHeâkeâ keâe
Cursor keâes Document kesâ Deble ceW ues peeves kesâ efueS Deeoeve-Øeoeve keâjlee nw
(c) Move the cursor to the end of paragraph
(a) Internet exchange point
Cursor keâes Paragraph kesâ Deble ceW ues peeves kesâ efueS
(b) subscriber end point
(d) None of these/FveceW mes keâesF& veneR
(c) ISP end point
Ans. (b) : "Ctrl + End" keâer yees[& Mee@š&keâš keâme&j keâes hetjs (d) None of these/FveceW mes keâesF& veneR
omleeJespe (Document) kesâ meyemes Deble ceW ues peelee nw~
Ans. (a) : peye Deueie-Deueie Internet Service Provider
131. What is internet ?
Fbšjvesš keäÙee nw? (ISPs) Deheves vesšJekeäme& kesâ yeerÛe Fbšjvesš š^wefHeâkeâ keâe Deeoeve-Øeoeve
(a) A single network keâjles nQ, lees Ùen keâeÙe& Internet Exchange Point (IXP) kesâ
(b) A vast collection of different networks ceeOÙece mes neslee nw~ Ùen Skeâ Yeeweflekeâ mLeeve neslee nw peneB ISPs
(c) Interconnection of local area networks Deeheme ceW [sše š^wefHeâkeâ meePee keâjles nQ leeefkeâ Fbšjvesš keâer ieefle yesnlej
(d) None of these/FveceW mes keâesF& veneR nes Deewj ueeiele keâce nes~
Ans. (b) : Fbšjvesš Demeue ceW Deveskeâ vesšJekeâeX keâe Skeâ yengle yeÌ[e 135. Which one of the following protocols is not
mecetn nw pees Deeheme ceW pegÌ[s ngS nw~ used in internet?
Ùen ogefveÙee Yej kesâ mejkeâejer Mewef#ekeâ, JÙeeheeefjkeâ Deewj efvepeer vesšJekeâeX efvecveefueefKele ceW mes keâewve mee Øeesšeskeâe@ue Fbšjvesš ceW
keâes peesÌ[lee nw~ GheÙeesieer veneR efkeâÙee peelee nw?
Ùen vesšJeke&â TCP/IP Øeesšeskeâe@ue kesâ peefjÙes Deeheme ceW yeele keâjles nw~ (a) HTTP
132. To join the internet, the computer has to be (b) DHCP
connected to a (c) DNS
Fbšjvesš mes pegÌ[ves kesâ efueS kebâhÙetšj keâes Skeâ............... mes (d) None of these/FveceW mes keâesF& veneR
keâveskeäš keâjvee nesiee~ Ans. (d) : efvecveefueefKele meYeer Øeesšeskeâe@ue Internet ceW GheÙeesie efkeâÙes
(a) Internet architecture board
peeles nQ–
(b) Internet society
(c) Internet service provider HTTP (Hyper Text Transfer Protocol)– Jesye hespe
(d) None of these/FveceW mes keâesF& veneR Load keâjves kesâ efueS~
Ans. (c) : Fbšjvesš mes pegÌ[ves kesâ efueS kebâhtÙešj keâes Internet DHCP (Dynamic Host Configuration Protocol)–
Service Provider (ISP) mes keâveskeäš keâjvee neslee nw~ ISP Jen ef [ JeeFme keâes IP S[^sme osves kesâ efueS~
kebâheveer nesleer nw pees Fbšjvesš keâer mesJee Øeoeve keâjleer nw~ pewmes efkeâ Jio, DNS (Domain Name System)– [escesve veece keâes IP ceW
Airtel, BSNL Deeefo~ yeoueves kesâ efueS~
Bihar STET 99 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
136. IPv6 address has a size of 140. Which one of the following is not used in media
IPv6 address keâe Deekeâej nw access control?
(a) 32 bits/32 efyeš (b) 64 bits/64 efyeš Media Access Control ceW efvecveefueefKele ceW mes
(c) 128 bits/128 efyeš (d) 265 bits/265 efyeš efkeâmekeâe GheÙeesie veneR efkeâÙee peelee nw?
(a) Ethernet
Ans. (c) : IPv4 S[^sme keâe Deekeâej neslee nw 32 efyeš,
(b) Digital subscriber line
pewmes- 192:168:1.1 (c) Fiber distributed data interface
peyeefkeâ IPv6 S[^sme keâe Deekeâej 128 efyeš neslee nw~ (d) None of these/FveceW mes keâesF& veneR
pewmes- 2001.0db8.85a3.0000.0000.8a2e.0370.7334
Ans. (b) : Media Access Control (MAC) Jen lejerkeâe nw
137. Internet works on efpemeceW vesšJeke&â hej Ùen leÙe efkeâÙee peelee nw efkeâ keâewve mee ef[JeeFme keâye
Internet keâece keâjlee nw [sše Yespesieer~
(a) Packet switching /Packet switching hej
Ethernet– MAC keâe GheÙeesie keâjlee nw~
(b) Circuit switching /Circuit switching hej
FDDI (Fiber Distributed Data Interface)– MAC keâe
(c) Both Packet switching and circuit switching
GheÙeesie keâjlee nw~
Packet switching leLee circuit switching hej
141. Term, Data Structure refers to………. and
(d) None of these/FveceW mes keâesF& veneR interrelationship between them.
Ans. (a) : Fbšjvesš Packet Switching lekeâveerkeâ hej keâeÙe& keâjlee Meyo, [sše mebjÛevee............ Deewj Gvekesâ yeerÛe DeblemebyebOe
nw, efpemeceW [sše keâes Úesšs-Úesšs hewkesâšdme ceW yeebškeâj Deueie-2 jemleeW mes keâes meboefYe&le keâjlee nw
Yespee peelee nw Deewj iebleJÙe (Destination) hej efHeâj mes pees[Ì e peelee nw~ (a) Organization of data
138. Which one of the following is not an application (b) Programming standard
layer protocol used in internet? (c) Coding
efvecveefueefKele ceW mes keâewve Skeâ Fbšjvesš ceW GheÙeesie keâer (d) Program design
peeves Jeeueer Application layer Øeesšeskeâe@ue veneR nw? Ans. (a) : peye nce Meyo (Data Items) [sše mejbÛevee (Data
(a) Remote procedure call structure) Deewj Gvekesâ Deehemeer mecyevOe (Inter relation) keâer yeele
(b) Internet relay chat keâjles nQ lees Ùen meye [sše kesâ mebie"ve (Organization of Data) mes
(c) Resource reservation protocol mecyeefvOele neslee nw~
(d) None of these/FveceW mes keâesF& veneR 142. In data structure, data may of ……… types.
Ans. (c) : Remote Procedure Call (RPC) SefhuekesâMeve uesÙej hej [sše mebjÛevee ceW, [sše ............ Øekeâej kesâ nes mekeâles nQ~
ØeÙeesie efkeâÙee peelee nw leeefkeâ Skeâ Øees«eece otmejs vesšJeke&â kebâhÙetšj hej keâes[ (a) 1 (b) 2
Ûeuee mekesâ~ Internet Relay Chat (IRC) SefhuekesâMeve uesÙej keâe (c) 3 (d) 4
Øeesšeskeâe@ue nw, efpemekeâe GheÙeesie Ûewefšbie kesâ efueS efkeâÙee peelee nw~ Ans. (b) : Data Structure ([sše mebjÛevee) ceW [sše cegKÙele: oes
Resource Reservation Protocol (RSVP)– Ùen vesšJeke&â uesÙej Øekeâej kesâ nesles nw~
hej keâece keâjlee nw Deewj vesšJeke&â ceW yeQ[ efJe[dLe efjpeJe& keâjves kesâ efueS (1) Primitive Data Structure– Char, float, int: boolean
GheÙeesie efkeâÙee peelee nw~ Ùen SefhuekesâMeve uesÙej Øeesšeskeâe@ue veneR nw~ Deeefo~
139. Which protocol assigns IP address to the client (2) Non Primitive Data Structures– Array List, stack,
connected in the internet? Queue, Tree, Graph Deeefo~
keâewve mee Øeesšeskeâe@ue, Fbšjvesš ceW pegÌ[s Client keâes IP 143. Variables which can be accessed by all modules
Address Øeoeve keâjlee nw? of the program is called
(a) DHCP Variables pees Program kesâ meYeer Modules Éeje
(b) IP hengBÛee pee mekeâlee nw, Gmes keâne peelee nw
(c) RPC (a) Global (b) Auto
(d) None of these/FveceW mes keâesF& veneR (c) Static (d) Local
Ans. (a) : DHCP (Dynamic Host Configuration Ans. (a) : Global Variable Skeâ Ssmee JewefjSyeue pees hetjs Øees«eecme
Protocol) Jen Øeesšeskeâe@ue neslee nw pees Fbšjvesš mes pegÌ[s keäueeFbš kesâ meYeer cee@[Ÿetume Deewj HebâkeäMeve Éeje Skeämesme efkeâÙee pee mekeâlee nw~
ef[JeeFme keâes IP Address Subnet, Mask, Gateway Deeefo peyeefkeâ Local Variable kesâJeue Gmeer HebâkeäMeve Ùee yuee@keâ kesâ Deboj
mJeeÛeeefuele ™he mes Øeoeve keâjlee nw~ ceevÙe neslee nw peneB Ùen ef[keäuesÙej nesles nw~
Bihar STET 100 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
144. Stack, Queue and Linked list can be Ans. (c) : ‘mebmkeâjCe keâe Keguevee’ (Opening a version) Skeâ
implemented using JÙeekeâjefCekeâ ™he mes mener ef›eâÙee veneR nw~ nce omleeJespe
Stack, Queue Deewj Linked List…………. keâe (Document) Keesueles nw, mebmkeâjCe keâes vener~
GheÙeesie keâj ueeiet efkeâÙee pee mekeâlee nw~ 148. When you drag selected text, you can
(a) Numeric variable (b) String variable peye Deehe ÛeÙeefvele hee" keâes KeerÛeleW nw, lees Deehe keâj
(c) Logical function (d) array mekeâles nQ
Ans. (d) : Stack, Queue Deewj Linked List pewmeer [sše (a) Delete text (b) Link text
mebjÛeveeDeeW keâes Array keâe GheÙeesie keâjkesâ FcehueerceWš (Implement) (c) Copy text (d) Move text
efkeâÙee pee mekeâlee nw~ Ans. (d) : peye Deehe ef k eâmeer šs k eä mš keâes mesueskeäš keâjkesâ Gmes KeerÛeleW
145. Hyperlinks can be created between a Word nQ Deew j ef k eâmeer DevÙe mLeeve hej Úes Ì
[ les (Drop) nw, lees Jen šskeämš
document and mLeeveebefjle (Move) nes peelee nw~
Hyperlinks, Skeâ Word document Deewj ............. kesâ Deiej Deehe 'Ctrl' keâer oyeekeâj KeeRÛeles nQ, lees Jen keâe@heer (Copy)
yeerÛe yeveeÙee pee mekeâlee nw Yeer nes mekeâlee nw, uesefkeâve kesâJeue KeeRÛeves mes Jen Move neslee nw~
(a) another word document 149. You can search in a word document for
otmejs Word document Deehe Skeâ word document ceW Keespe keâj mekeâles nQ
(b) A webpage on the www (a) Formatting/ Formatting kesâ efueS
www hej Skeâ webpage (b) Special characters/ Special characters kesâ efueS
(c) A webpage on a company Internet (c) Phrases/ Phrases kesâ efueS
Skeâ keâcheveer Internet hej Skeâ webpage (d) All of these/FveceW mes meYeer
(d) All of these/FveceW mes meYeer Ans. (d) : Microsoft Word ceW "Find" Ùee "Advanced
Ans. (d) : Hyperlink Skeâ Ssmee efuebkeâ neslee nw efpeme hej efkeäuekeâ Find" HeâerÛej keâe GheÙeesie keâjkesâ Deehe Keespe mekeâles nQ:
keâjves mes Deehe efkeâmeer otmejer peien hengBÛe mekeâles nQ~ Word (I) Formatting kesâ efueS– pewmes- Bold, Italic, Font, Size
Document ceW Deehe neFhejefuebkeâ Éeje efuebkeâ keâj mekeâles nw~ Deeefo~
146. You can insert the clip art from (II) Special Characters– pewmes hewje«eeHeâ ceeke&â tabs, manual
Deehe clip art, Insert keâj mekeâles nw line breaks Deeefo~
(a) Insert choose Pictures then Clip Art (III) Phrases kesâ efueS– Ùeeveer hetjs JeekeäÙeebMe Ùee Meyo mecetn~
Insert choose Pictures leye Clip Art mes 150. You can add a data to a document by
(b) Choose Clip Art icon from Drawing toolbar Deehe efkeâmeer omleeJespe ceW efoveebkeâ peesÌ[ mekeâles nQ
Choose Clip Art icon mes Drawing toolbar (a) Inserting a text date
(c) All of these/FveceW mes meYeer Skeâ šskeämš efoveebkeâ keâes Fvemeš& keâj
(d) None of these/FveceW mes keâesF& veneR (b) Inserting a date field that will update
Ans. (c) : 'Clip Art' keâes Microsoft word pewmes Øees«eece ceW keâF& automatically/Skeâ efoveebkeâ #es$e keâes Fvemeš& keâj pees
lejerkeâeW mes Insert efkeâÙee pee mekeâlee nw- mJeÙeb Dehe[sš neslee nw
Insert šwye Ûegvekeâj, efHeâj Pictures Ùee Online Pictures kesâ (c) Typing the date manually
efJekeâuhe mes Clip Art peesÌ[er pee mekeâleer nw~ efoveebkeâ keâes neLe mes šeFhe keâj
hegjeves Jepe&ve ceW Drawing Toolbar ceW Clip Art DeeFkeâve neslee (d) All of these/FveceW mes meYeer
Lee efpememes meerOes Clip Art [eueer pee mekeâleer Leer~ Ans. (d) : Microsoft Word ceW Deehe efoveebkeâ peesÌ[ mekeâles nQ, keâF&
147. Which of the following cannot be done with lejer keâes mes–
document version? (I) Skeâ šskeämš efoveebkeâ keâes Fvemeš& keâj– pewmes meerOes "08 June
efvecveefueefKele ceW mes keâewve mee omleeJespe mebmkeâjCe kesâ meeLe 2025" šeFhe keâjW~
veneR efkeâÙee pee mekeâlee nw? (II) Skeâ efoveebkeâ #es$e keâes Fvemeš& keâj pees mJeÙeb Dehe[sš neslee
(a) Modifying a version/mebmkeâjCe keâer heefjJele&ve nw– pewmes Insert > Data & Time > "Update
(b) Deleting a version/mebmkeâjCe keâes nševee Automatically" efJekeâuhe Ûegvekeâj~
(c) Opening a version/mebmkeâjCe keâes Keguevee (III) efoveebkeâ keâes neLe mes šeFhe keâj– Ùeeveer cewvÙegDeueer Deehe
(d) None of these/FveceW mes keâesF& veneR Deheveer cepeea mes keâesF& Yeer leejerKe šeFhe keâj keâjles nw~
Bihar STET 101 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
 PRACTICE SET - 1
1. Which of the following is an unsupervised (c) Global Process Input Output
machine learning algorithm?/efvecveefueefKele ceW mes iueesyeue Øeesmesme Fvehegš DeeGšhegš
keâewve-meer DevegheÙeesieer ceMeerve ueefveËie Suieesefjodce nw? (d) General Purpose Input Output
(a) Clustering/keäuemšefjbie pevejue hehe&pe Fvehegš DeeGšhegš
(b) Decision Trees/ef[efmeMeve š^er 7. Which of the following is NOT an IoT function
(c) K-Nearest Neighbour/kesâefveÙejsmš vesFyej block?/efvecveefueefKele ceW mes keâewve mee IoT HebâkeäMeve
(d) Naive Bayes/vewJe yeeSme
yuee@keâ veneR nw?
2. Who among the following is the Originator of (a) Exclusive-Pair (b) Devices
binary logic and arithmetic in Computer (c) Services (d) Application
programming? 8. Which framework is widely used for
efvecveefueefKele ceW mes keâewve kebâhÙetšj Øees«eeefcebie ceW yeeFvejer developing machine learning models?
ceMeerve ueefveËie cee@[ue efJekeâefmele keâjves kesâ efueS efkeâme
uee@efpekeâ Deewj DeefjLecesefškeâ (binary logic and
arithmetic) kesâ ØeJele&keâ nQ?
{eBÛes (øesâceJeke&â) keâe JÙeehekeâ ™he mes GheÙeesie efkeâÙee
peelee nw?
(a) Claude Shannon/keäueeG[ Mewveve
(a) Oracle/Deesjskeâue
(b) Noam Chomsky/veesce Ûeescmkeâer
(b) MongoDB/ceeWiees[eryeer
(c) Leslie Lamport/uesmueer ueeceheesš&
(c) Visual Basic/efJepegDeue yesefmekeâ
(d) John Backus/pee@ve yewkeâme
(d) TensorFlow/šWmejHeäuees
3. Which of the following is NOT a cloud
computing model? 9. The application protocol that makes the web
efvecveefueefKele ceW mes keâewve-mee keäueeG[ kebâhÙetefšbie cee@[ue work is:/Jesye keâes keâeÙe& keâjves ÙeesiÙe yeveeves Jeeuee
(cloud computing model) veneR nw? SefhuekesâMeve Øeesšeskeâe@ue nw-
(a) Hybrid Cloud/ neFefyeÇ[ keäueeG[ (a) HTML (b) SMTP
(c) HTTP (d) IP
(b) Public Cloud/ heefyuekeâ keäueeG[
10. ................is an episodic series of spoken word
(c) Society Cloud/ meesmeeFšer keäueeG[ digital audio files that a user can download to a
(d) Private Cloud/ ØeeFJesš keäueeG[ personal device for easy listening.
4. Which of the following is not a sensor in IoT? ...............mheeskeâve-Je[& ef[efpešue Dee@ef[Ùees heâeFueeW keâer
efvecveefueefKele ceW mes keâewve IoT ceW meWmej veneR nw? Skeâ Øeemebefiekeâ (Sefhemeesef[keâ) ëe=bKeuee nw efpemes
(a) BMP280 GheÙeesiekeâlee& Deemeeveer mes megveves kesâ efueS JÙeefòeâiele
(b) DHT11 ef[JeeFme hej [eGveuees[ keâj mekeâlee nw~
(c) Photoresistor
(d) None of the above (a) Groupchat/«egheÛewš (b) Hotspot/ne@šmhee@š
5. How can an IoT device be associated with (c) Chromecast/›eâescekeâemš (d) Podcast/hee@[keâemš
data?/IoT ef[JeeFme keâes [sše kesâ meeLe kewâmes peesÌ[e pee 11. .mp4 is a digital multimedia container format
mekeâlee nw? which is basically _______.
(a) Through Intranet/Fbš^evesš kesâ ceeOÙece mes .mp4 Skeâ ef[efpešue ceušerceeref[Ùee heâe@cexš nw pees efkeâ
(b) Through Network/vesšJeke&â kesâ ceeOÙece mes
cetuele: _______ nw~
(a) mpeg4 part 21 (b) mpeg4 part 3
(c) Through Internet/Fbšjvesš kesâ ceeOÙece mes
(c) mpeg4 part 19 (d) mpeg4 part 14
(d) Through Cloud/keäueeG[ kesâ ceeOÙece mes 12. Which of the following is NOT a valid
6. On an Arduino board, what does GPIO stand multimedia authoring metaphor?
for? efvecveefueefKele ceW mes keâewve Skeâ ceevÙe ceušerceeref[Ùee
Dee[t&Fvees yees[& hej, GPIO keâe hetCe& ™he keäÙee nw? mebuesKeve ™hekeâ (authoring metaphor) veneR nw~
(a) General Process In Out (a) Hierachical metaphor
pevejue Øeesmesme Fve DeeGš (b) Scipting language metaphor
(b) Global Pins In Out (c) Flow-control metaphor
iueesyeue efhebme Fve DeeGš (d) Automatic metaphor
102 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
13. This E-Commerce commercial enterprise 19. When the mail server sends mail to other mail
model specifically specialises in selling services servers it becomes
or products online. peye cesue meJe&j, DevÙe cesue meJe&jeW keâes cesue Yespelee nw, lees
Ùen F&-keâe@ceme& JeeefCeefpÙekeâ GÅece cee@[ue efJeMes<e ™he mes Ùen ____ nes peelee nw~
mesJeeDeeW Ùee GlheeoeW keâes Dee@veueeFve yesÛeves ceW ceeefnj nw~ (a) SMTP client
(a) Indirect Marketing (b) SMTP server
(b) Online Direct Marketing (c) peer
(c) Brick & Mortar (d) More than one of the above/GheÙeg&òeâ ceW mes Skeâ
(d) More than one of the above DeefOekeâ
14. What does MIME stand for? 20. Which of the following statements about
MIME keâe keäÙee DeLe& nw? firewall (in the context of computing) is
(a) Multipurpose Internet Messaging Extension incorrect?
(b) Multipurpose Internet Mail Extension ]HeâeÙejJee@ue (kebâhÙetefšbie kesâ meboYe& ceW) kesâ mebyebOe ceW
(c) Multipurpose Internet Multimedia Extension efvecveefueefKele ceW mes keâewve-mee keâLeve mener veneR nw?
(d) More than one of the above (a) It is a combination of both, software and
15. efvecveefueefKele ceW mes keâewve-mee Ieškeâ Fbšjvesš hej mebÛeej hardware devices. /Ùen mee@HeäšJesÙej Deewj ne[&JesÙej
keâes me#ece keâjves kesâ efueS [escesve kesâ veece (pewmes, oesveeW ef[JeeFmeeW keâe mebÙeespeve nw~
www.example.com) keâe DeeF&heer (IP) S[^sme (pewmes, (b) It is frequently used to protect a computer
192.168.1.1) ceW DevegJeeo keâjves kesâ efueS GòejoeÙeer network from unauthorised access.
neslee nw? Fmekeâe Fmlesceeue ØeeÙe: keâchÙetšj vesšJeke&â keâes DeveeefOeke=âle
(a) jeGšj (b) ]heâeÙejJee@ue hengBÛe mes yeÛeeves kesâ efueS efkeâÙee peelee nw~
(c) [er.Sve.Sme. (DNS) meJe&j (d) cee@[sce (c) It is unable to permit legitimate
communication to pass
16. Which network topology requires a central
controller or hub? Ùen JewOe mebÛeej kesâ heejieceve keâer Devegceefle veneR oslee nw~
efkeâme vesšJeke&â šesheesuee@peer kesâ efueS, kesâvõerÙe efveÙev$ekeâ Ùee (d) It permits network transmission based on a
set of rules./Ùen efveÙeceeW kesâ DeeOeej hej vesšJeke&â
nye keâer DeeJeMÙekeâlee nesleer nw?
ØemeejCe keâer Devegceefle oslee nw~
(a) Star/mšej
21. Which of these establishes communication
(b) Mesh/cesMe between servers and work stations?
(c) Ring/efjbie efvecveefueefKele cebs mes keâewve meJe&j SJeb keâeÙe& mLeeveeW kesâ ceOÙe
(d) More than one of the above/GheÙeg&òeâ ceW mes Skeâ mebheke&â mLeeefhele keâjJeelee nw?
DeefOekeâ (a) Interspace/Fbšjmhesme
17. WAN kesâ meboYe& ceW efvecve ceW mes keâewve-mee keâLeve melÙe nw? (b) Backbone/yewkeâyeesve
(i) efkeâmeer oHeälej keâer efyeefu[bie ceW ceewpeto vesšJeke&â Skeâ WAN (c) Terminal Access Point/šefce&veue Skeämesme hee@Fbš
nes mekeâlee nw~ (d) Gateway/iesšJes
(ii) WANs uebyeer otefjÙeeW ceW keâvesefkeäšefJešer kesâ efueS MPLS, 22. Which among the following is NOT true with
ATM, øesâce efjues Deewj X.25 pewmeer ØeewÅeesefieefkeâÙeeW keâe reference to wireless networks?
Fmlesceeue keâjles nQ~ efvecveefueefKele ceW mes keâewve-mee JeeÙejuesme vesšJeke&â kesâ
(a) kesâJeue (i) (b) oesveeW (i) Deewj (ii) mevoYe& ceW melÙe veneR nw?
(c) kesâJeue (ii) (d) ve lees (i) ve (ii) (a) Wireless means without wire, media that is
18. What is the network byte order used in made up of electromagnetic waves (EM
TCP/IP? Waves) or infrared waves
TCP/IP ceW ØeÙegòeâ vesšJeke&â yeeFš Dee@[&j keäÙee neslee nw? JeeÙejuesme keâe celeueye nw efyevee leej kesâ ceeref[Ùee pees
(a) Middle Endian/efceef[ue Sbef[Ùeve Fueskeäš^escewivesefškeâ Jesyme Ùee Fvøeâejs[ Jesyme mes yevee nw~
(b) They are more secure and hence reliable
(b) Random/jQ[ce
when compared to wired networks.
(c) Big Endian/efyeie Sbef[Ùeve JeeÙe[& vesšJeke&â keâer leguevee ceW Jes DeefOekeâ megjef#ele nw
(d) Little Endian /efueefšue Sbef[Ùeve FmeefueS efJeÕemeveerÙe nw~
103 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
 (c) Installation is quick when compared to wired nceejs heeme oes šsyeue nw- Skeâ keâes students keâne peelee
networks nw Deewj Skeâ keâes advisors keâne peelee nw~ advisors
JeeÙe[& vesšJeke&â keâer leguevee ceW Fbmše@uesMeve lJeefjle nw~ šsyeue ceW advisor-id Skeâ heâeru[ nw pees advisors šsyeue
(d) Slow transmission speed when compared to kesâ Yeerlej Skeâ DeeF&[er keâe meboYe& oslee nw~ meYeer
wired networks students kesâ heeme Skeâ meueenkeâej veneR neslee nw, Deewj
JeeÙe[& vesšJeke&â keâer leguevee ceW Oeerceer mebÛejCe ieefle~ meYeer advisors students keâes veneR meeQhes peeles nQ~ Ùeefo
23. What is the maximum data rate of Bluetooth nce students Deewj Gvekesâ advisors kesâ yeejs ceW
version 5.0?/yuetštLe mebmkeâjCe 5.0 keâer DeefOekeâlece [sše peevekeâejer Øeehle keâjvee Ûeenles nw, lees Gve students keâes
oj keäÙee nw? ÚesÌ[keâj efpevnW advisors keâes veneR meeQhee ieÙee nw, nce
(a) 1 Mbps GheÙeesie keâjWies–
(b) 2 Mbps (a) Inner Join/Fvej pJee@Fve
(c) 5 Mbps
(b) Cross Join/›eâe@me pJee@Fve
(d) More than one of the above/GheÙeg&òeâ ceW mes Skeâ mes
(c) Full Join/hegâue pJee@Fve
DeefOekeâ
(d) Left Join/uesheäš pJee@Fve
24. efvecveefueefKele ceW mes efkeâme Øekeâej kesâ Fbšjvesš keâveskeäMeve ceW 28. In a Relational Data Model, which of the
[sše š^ebmeefceMeve kesâ efueS šsueerheâesve ueeFve keâe GheÙeesie following options describe how the data can be
efkeâÙee peelee nw? manipulated for querying?
(a) yeÇe@[yeQ[ (Broadband) Skeâ efjuesMeveue [sše cee@[ue ceW, efvecveefueefKele efJekeâuheeW
(b) [eÙeue Dehe (Dial up)
ceW mes keâewve mee JeCe&ve keâjlee nw efkeâ keäJesjer keâjves kesâ efueS
[sše keâes peesÌ[–leesÌ[ kewâmes keâer pee mekeâleer nw?
(c) mewšsueeFš (Satellite)
(a) Objects/Dee@ypeskeäšdme
(d) HeâeFyej Dee@efhškeâ (Fibre optic)
(b) Constraints/kebâmš^Wšdme
25. Select the INVALID type of wireless
(c) Entities/Sbefššerme
communication medium.
JeeÙejuesme mebÛeej ceeOÙece (wireless communication (d) Operations/Dee@hejsMebme
medium) kesâ DeceevÙe Øekeâej keâe ÛeÙeve keâerefpeS~ 29. What is an Instance of a Database?
[sšeyesme keâe Skeâ GoenjCe keäÙee nw?
(a) Optical fibre/Dee@efhškeâ
HeâeFyej
(a) The state of the database system at any given
(b) Broadcast radio/yeÇe@[keâemš jsef[Ùees point of time/efkeâmeer Yeer meceÙe [sšeyesme efmemšce efkeâ efmLeleer~
(c) Satellite/mewšsueeFš (b) The entire set of attributes of the Database put
(d) Infrared/Fvøeâejs[ together in a single relation/[sšeyesme keâer efJeMes<eleeDeeW
26. Which of the following refers to exploring keâe mebchetCe& mecetn Skeâ ner mebyebOe ceW Skeâ meeLe~
appropriate, ethical behaviour related to the (c) The initial values inserted into the Database
online environment and digital media platform? immediately after its creation/[sšeyesme kesâ efvecee&Ce
efvecveefueefKele ceW mes keâewve-mee Dee@veueeFve JeeleeJejCe Deewj kesâ legjble yeeo FmeceW [eues ieS ØeejbefYekeâ ceeve
ef[efpešue ceeref[Ùee huesšheâe@ce& mes mebyebefOele GefÛele, veweflekeâ (d) More than one of the above/GheÙeg&òeâ ceW mes Skeâ mes
JÙeJenej keâer Keespe keâes meboefYe&le keâjlee nw? DeefOekeâ
(a) Cyber security/meeFyej efmekeäÙeesefjšer 30. Degree and cardinality of a relation in relational
(b) Cyber law/meeFyej keâevetve database are 4 and 3 respectively. If 3 attributes
and 4 tuples are added to the relation, what will
(c) Cyber ethics/meeFyej FefLekeäme be its new cardinality and degree?
(d) Cyber safety/meeFyej mesheäšer efjuesMeveue [sše yesme ceW Skeâ efjuesMeve keâe ef[«eer Deewj
27. We have two tables-one called students and one keâeef[&veefuešer ›eâceMe: 4 Deewj 3 nQ~ Deiej 3 Ssefšy^ Ùetš
called advisors. The students table contains a Deewj 4 šŸetheue Gme efjuesMeve ceW peesÌ[ efoÙee peeS, lees Gme
field called advisor_id that references an id
efjuesMeve keâe veÙee keâeef[&veefuešer Deewj ef[«eer keäÙee nesiee?
within the advisors table. Not all students have
an advisor, and not all advisors are assigned to (a) 7, 6
students. If we wanted to pull information on (b) 7, 7
students and their advisors, EXCLUDING (c) 8, 6
students who are not assigned to an advisor, we (d) More than one of the above/GheÙeg&òeâ ceW mes Skeâ mes
would use: DeefOekeâ
104 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
31. SQL views are also known as (a) Command Language/keâceeb[ ueQiJespe
SQL views keâes _____ veece mes Yeer peevee peelee nw~ (b) Machine Language/ceMeerve ueQiJespe
(a) simple tables (c) Markup Language/ceeke&âDehe ueQiJespe
(b) virtual tables
(d) Style Sheet Language/mšeFue Meerš ueQiJespe
(c) complex tables
(d) More than one of the above/GheÙeg&òeâ ceW mes Skeâ 37. Which of the following is NOT a component
in ASP?/efvecveefueefKele ceW mes keâewve ASP ceW Skeâ
DeefOekeâ
32. Which company developed ``Swift" Programming Ieškeâ veneR nw?
Language?/efmJeHeäš Øees«eeefcebie Yee<ee keâes efkeâme keâcheveer (a) Content Linking/kebâšWš efuebefkebâie
ves efJekeâefmele efkeâÙee Lee? (b) LinkCounter/efuebkeâkeâeGbšj
(a) Google/ietieue (b) Microsoft/ceeF›eâesmee@Heäš (c) Browser Capability/yeÇeGpej #ecelee
(c) Facebook/Hesâmeyegkeâ (d) Apple/Shheue (d) Ad Rotator/efJe%eeheve jesšsšj
33. The traditional storage of data organized by 38. Adding an element to the stack means:
the customer, stored in separate folders in
filing cabinets is an example of: mšwkeâ ceW Skeâ SefueceWš kesâ peesÌ[ves keâe celeueye neslee nw:
«eenkeâ Éeje JÙeJeefmLele [sše keâe heejbheefjkeâ Yeb[ejCe, (a) Removing elements from the stack
HeâeFeEueie kewâefyevesš ceW Deueie-Deueie Heâesu[jeW ceW meb«enerle mšwkeâ mes Sefuecebsš keâes nševee
neslee nw, _______keâe Skeâ GoenjCe nw~ (b) Placing an element at the front end
(a) Realational database management øebâš Sb[ ceW Skeâ SefueceWš keâes jKevee
system/efjuesMeveue [sšeyesme ØeyebOeve ØeCeeueer (c) Placing an element at the rear end
(b) Network database management system/vesšJeke&â efjÙej Sb[ ceW Skeâ SefueceWš keâes jKevee
[sšeyesme ØeyebOeve ØeCeeueer (d) Placing an element at the top
(c) Hierarchical database management Meer<e& hej Skeâ SefueceWš keâes jKevee
system/heoeveg›eâefcele [sšeyesme ØeyebOeve ØeCeeueer 39. From where does the indexing of an array
(d) More than one of the above/GheÙeg&keäle ceW mes Skeâ mes start?/Skeâ Ssjs keâer Fb[sefkeämebie (Deveg›eâceCe) keâneB mes
DeefOekeâ Meg™ neslee nw?
34. Which type of data can be stored in the database? (a) -1 (b) 0
[sšeyesme ceW efkeâme Øekeâej keâe [sše meb«enerle efkeâÙee pee (c) 1 (d) 100
mekeâlee nw? 40. The pointers are used to store only the
(a) Image-oriented data/ÚefJe-GvcegKe [sše hJeeFbšme& keâe ØeÙeesie kesâJeue efvecveefueefKele mebefÛele keâjves
(b) Text, files containing data/hee", [sše Ùegòeâ HeâeFueW kesâ efueS efkeâÙee peelee nw
(c) Data in the form of audio or video /Dee@ef[Ùees Ùee (a) value of variables/ÛejeW keâe ceeve
Jeeref[Ùees kesâ ™he ceW [sše (b) address of variables/ÛejeW keâe helee
(d) More than one of the above/GheÙeg&keäle ceW mes Skeâ mes (c) sign of variables/ÛejeW keâe efÛevn
DeefOekeâ (d) power of variables/ÛejeW keâe hee@Jej
35. ______ means that the data contained in a 41. Which programming language was developed
database is accurate and reliable. by Bjarne Stroustrup in early 1980s?
__________ keâe DeLe& nw efkeâ [sšeyesme ceW jKee [sše 1980 kesâ oMekeâ keâer Meg™Deele ceW yepe&ve mš^e@mš^=he Éeje
ÙeLeeLe& nw Deewj efJeÕemeveerÙe nw~ keâewve-meer Øees«eeefcebie Yee<ee efJekeâefmele keâer ieF& Leer?
(a) Data redundancy/[sše efj[b[Wmeer (efvejLe&keâ) (a) JAVA/peeJee (b) C++
(b) Data integrity/[sše Fbšeref«ešer (DeKeb[lee) (c) C (d) Pascal/heemkeâue
(c) Data reliability/[sše efjueeÙesefyeefuešer (efJeÕemeveerÙe) 42. DeheeÛes n[the øesâceJeke&â keâe Skeâ yeÌ[e efnmmee _____ Yee<ee
(d) Data consistency/[sše kebâefmemšWmeer (megmebieefle) ceW efueKee ieÙee nw~
36. A computer language that expresses the (a) JAVA (b) C++
presentation of structured documents, such as
(c) R Programming (d) Python
CSS, is called ........../Jen keâchÙetšj Yee<ee, pees mebjefÛele
43. Which of the following is NOT a valid CSS type
omleeJespeeW keâer Øemlegefle keâes JÙeòeâ keâjleer nw, pewmes used to set the style in web pages that contain
meerSmeSme, .......... keânueeleer nw~ HTML elements?
105 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
 efvecveefueefKele ceW mes keâewve-mee JewOe CSS Øekeâej veneR nw (c) Programmable Logic Architecture
efpemekeâe GheÙeesie HTML lelJeeW Jeeues Jesye hespeeW ceW Øees«eecesyeue uee@efpekeâ Deee|keâšskeäÛej
mšeFue mesš keâjves kesâ efueS efkeâÙee peelee nw~ (d) More than one of the above
(a) Inward CSS/FveJe[& CSS GheÙeg&òeâ ceW mes Skeâ mes DeefOekeâ
(b) External CSS/Skeämešve&ue CSS 48. Which of the following is userdefined header
file extension used in C++?
(c) Inline CSS/FveueeFve CSS
efvecveefueefKele ceW mes efkeâme GheÙeesiekeâlee&-heefjYeeef<ele ns[j
(d) Internal or embedded CSS
]heâeFue SkeämešWMeve keâe GheÙeesie C++ ceW efkeâÙee peelee nw?
Fvešve&ue Ùee Scye[s[ CSS
(a) hg
44. How can one implement the compile-time
(b) cpp
polymorphism in the C++ programming
(c) h
language?
keâesF& C++ Øees«eeefcebie Yee<ee ceW mebkeâueve-meceÙe yeng¤helee (d) More than one of the above/GheÙeg&òeâ ceW mes Skeâ
keâes kewâmes keâeÙee&evf Jele keâj mekeâlee nw? DeefOekeâ
49. Which of the following is used to define the
(a) By using the template members of a class externally in C++?
šscheuesš keâe GheÙeesie keâjkesâ efvecveebefkeâle ceW mes efkeâmekeâe C++ ceW class kesâ meomÙeeW keâes
(b) By using the concepts of inheritance yeenj mes heefjYeeef<ele keâjves kesâ efueS ØeÙeesie efkeâÙee peelee nw?
JebMeeveg›eâce keâer DeJeOeejCeeDeeW keâe GheÙeesie keâjkesâ (a) :
(c) By using both the virtual functions and (b) ::
inheritance (c) #
JeÛe&gDeue hebâkeäMeve Deewj FvnsefjšWme oesveeW keâe GheÙeesie keâjkesâ (d) More than one of the above/GheÙeg&òeâ ceW mes Skeâ mes
(d) More than one of the above DeefOekeâ
GheÙeg&keäle ceW mes Skeâ mes DeefOekeâ 50. High level languages are converted into
45. Considering signed magnitude representation machine language using :
for negetive numbers, -42 will be stored into an neF& uesJeue ueQiJespe keâes ceMeerveer Yee<ee ceW efkeâmekeâer
8-bit memory space as meneÙelee mes yeoueles nQ?
$e+Ceelcekeâ mebKÙeeDeeW keâes nmlee#eefjle heefjceeCe Éeje
(a) Assembler/Demescyeuej (b) Scanner/mkesâvej
JÙeòeâ keâjles ngS mebKÙee –42 keâes Skeâ 8-Bit cesceesjer
(c) Compiler/keâcheeFuej (d) Decoder/[erkeâes[j
mLeeve ceW efkeâme Øekeâej mes mebefÛele keâj mekeâles nw?
51. In which of the following notation the operator
(a) 10101010
comes between the two operands?
(b) 10110111
(c) 1011010 efvecveefueefKele ceW mes efkeâme veesšsMeve ceW Dee@hejsšj oes
(d) 10100001 Dee@hejW[ kesâ yeerÛe Deelee nw?
46. Inheritance in OOP allows a class to:/OOP ceW (a) Postfix Expression/heesmšef]heâkeäme SkeämeØesMeve
inheritance/Skeâ Jeie& keâes Ùen keâjves keâer Devegceefle oslee nw : (b) Infix Expression/Fefv]heâkeäme SkeämeØesMeve
(a) Inherit properties and behavior from another (c) Prefix Expression/efØeefheâkeäme SkeämeØesMeve
class/efkeâmeer DevÙe Jeie& mes iegCe Deewj JÙeJenej Øeehle (d) Priority Expression/ØeÙeesefjšer SkeämeØesMeve
keâjvee 52. If you have to implement an 'if..else' construct
(b) Create inheritances of another class in a flow chart, the symbol to be used is/Ùeefo
efkeâmeer DevÙe Jeie& keâer efJejemele yeveeÙes Deehekeâes heäueesÛeeš& ceW Skeâ 'if..else' kebâmš^keäš keâe
(c) Override methods of another class keâeÙee&vJeÙeve keâjvee, lees efkeâme efÛevn keâe GheÙeesie nesiee?
efkeâmeer DevÙe Jeie& kesâ lejerkeâes keâes DeesJejjeF[ keâjW (a) Diamond /[eÙeceb[
(d) More than one of the above
(b) Parallelogram /meceevlej ÛelegYeg&pe
GheÙeg&òeâ ceW mes Skeâ mes DeefOekeâ
(c) Oval /Deb[ekeâej
47. What is a PLA?/heerSueS (PLA) keäÙee nw?
(d) Arrow /leerj
(a) Programmable Logic Application
53. ______ is a framework that you can use to
Øees«eecesyeue uee@efpekeâ ShueerkesâMeve
write a program. It provides a set of classes and
(b) Programmable Logic Array functions that helps you avoid writing all the
Øees«eecesyeue uee@efpekeâ Ssjs low-level code to perform specific actions.
106 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
 ......... Skeâ ØesâceJeke&â nw efpemekeâe GheÙeesie Deehe Øees«eece 57. In Python, modules are simply files with the
efueKeves kesâ efueS keâj mekeâles nw~ Ùen keâ#eeDeeW Deewj keâeÙeeX '________' extension, containing Python code
that can be imported inside another Python
keâe Skeâ mesš Øeoeve keâjlee nw pees efJeefMe° keâeÙeeX keâes keâjves
programme.
kesâ efueS meYeer efvecve mlejerÙe keâes[ efueKeves mes yeÛeves ceW heeFLeve ceW, cee@[Ÿetue kesâJeue '________' SkeämešWMeve
Deehekeâer meneÙelee keâjlee nw~ Jeeueer HeâeFueW nesleer nQ, efpemeceW keâes[ neslee nw, efpemes otmejs
(a) Electronic Data Interchange heeFLeve Øees«eece kesâ Deboj Fcheesš& efkeâÙee pee mekeâlee nw~
Fueskeäš^e@efvekeâ [sše FbšjÛeWpe (a) .lst (b) .txt
(b) Application Programming Interface (c) .py (d) .dat
ShueerkesâMeve Øees«eeefcebie Fbšjhesâme 58. Assertion (A) : Array is a data type which can
(c) Enterprise Resource Planning (ERP) systems store multiple homogeneous data elements.
FšjØeeFpe efjmeesme& hueeefvebie (ERP) efmemšce DeefYekeâLeve (A) : Ssjs Skeâ [sše Øekeâej nw pees keâF&
(d) Client Server Architecture mepeeleerÙe [sše leòJeeW keâes meb«enerle keâj mekeâlee nw~
keäueeFbš meJe&j Deeefke&âšskeäÛej Assertion (R) : Elements of array are stored in
54. Which of the following should have a same an indexed manner starting with index 0.
name as class name?/efvecveefueefKele ceW mes efkeâmekeâe DeefYekeâLeve (R) : Ssjs kesâ leòJeeW keâes Fb[skeäme 0 mes Meg™
veece keäueeme veece kesâ meceeve nesvee ÛeeefnS? keâjkesâ Deveg›eâefcele (Fb[skeäm[) lejerkesâ mes meb«enerle efkeâÙee
(a) Variable/JesefjSyeue peelee nw~
(b) Method/cesLe[ (a) Assertion (A) is true, but Reason (R) is false.
(c) Constructor/kebâmš^keäšj /DeefYekeâLeve (A) mener nw, uesefkeâve keâejCe (R) ieuele nw~
(d) Header File/ns[j heâeFue (b) Both Assertion (A) and Reason (R) are true
and Reason (R) is the correct explanation of
55. Among the following, which statement is correct
about the modularity? Assertion (A)/DeefYekeâLeve (A) leLee keâejCe (R) oesveeW
efvecveefueefKele ceW mes cee@[dÙetuewefjšer kesâ yeejs ceW keâewve-mee mener nQ leLee keâejCe (R) DeefYekeâLeve (A) keâer mener
keâLeve mener nw? JÙeeKÙee nw~
(c) Both Assertion (A) and Reason (R) are true,
(a) Modularity means hiding the parts of the
but Reason (R) is not the correct explanation
program./cee@[dÙetueefjšer keâe celeueye Øees«eece kesâ efnmmeeW
of Assertion (A)/DeefYekeâLeve (A) leLee keâejCe (R)
keâes efÚheeveee nw~ oesveeW mener nw, hejvleg keâejCe (R) DeefYekeâLeve (A) keâer
(b) Modularity refers to dividing a program into mener JÙeeKÙee veneR nw~
subsequent small modules or independent
(d) Assertion (A) is false, but Reason (R) is true.
parts./cee@[dÙetue efjšer keâe DeLe& nw Skeâ Øees«eece keâes Úesšs-
/DeefYekeâLeve (A) ieuele nw, uesefkeâve keâejCe (R) mener nw~
Úesšs cee@[dÙetue Ùee mJeleb$e YeeieeW ceW efJeYeeefpele keâjvee~
59. A computer virus is a/an .........., which
(c) It refers to overloading the program's part. replicates by inserting copies of itself.
Ùen Øees«eece kesâ efnmmes keâes DeesJejuees[ keâjveW keâes oMee&lee Skeâ keâchÙetšj JeeÙejme, Skeâ............... nw pees Ùen Deheveer
nw~ ØeefleefueefheÙeeB efveJesefMele keâj Øeefleke=âle neslee nw~
(d) More than one of the above/GheÙeg&keäle ceW mes Skeâ mes
(a) Software/mee@heäšJesÙej
DeefOekeâ
(b) Malware/cewueJesÙej
56. Which of the following features must be
supported by any programming language to (c) Application/SefhuekesâMeve
become a pure object-oriented programming (d) System file/efmemšce heâeFue
language?
60. A Program that generally has more user-
Megæ object-oriented programming Yee<ee yeveves kesâ friendly interface than a DBMS is:
efueS efkeâmeer Yeer Programming Yee<ee keâes efvecveefueefKele Skeâ Øees«eece efpemeceW DBMS mes pÙeeoe GheYeesòeâe
ceW mes efkeâme efJeMes<elee keâe meceLe&ve keâjvee ÛeeefnS? Devetketâue Fbšjhesâme nw:
(a) Encapsulation
(a) Front end /øebâš Sb[
(b) Inheritance
(c) Polymorphism (b) Repository /keâes<e
(d) More than one of the above (c) Back end /yewkeâ Sb[
GheÙeg&òeâ ceW mes Skeâ DeefOekeâ (d) Form /Øehe$e
107 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
61. efvecveefueefKele ceW mes keâewve mee Skeâ Ùetefšefuešer mee@heäšJesÙej 66. Which of the following function(s) is/are
veneR nw? provided by operating system?
(a) SbšerJeeÙejme (b) ef[mkeâ [erØesâieceWšj ØeÛeeueve leb$e Éeje efvecveefueefKele ceW mes keâewve mee/mes keâeÙe&
(c) heâeFue cewvespej (d) veesš hew[ efkeâÙee peelee nw/efkeâS peeles nQ?
62. Computer software is divided mainly into (a) Process management/Øe›eâce ØeyebOeve
which categories? Choose the most appropriate (b) Security management/megj#ee ØeyevOeve
option./keâchÙetšj mee@heäšJesÙej keâes cegKÙe ™he mes efkeâve (c) File management/heâeFue ØeyevOeve
ßesefCeÙeeW ceW efJeYeeefpele efkeâÙee ieÙee nw~ meyemes GheÙegòeâ (d) All of these/FveceW mes meYeer
efJekeâuhe Ûegevf eS~ 67. ..............refers to the process of rearranging the
(a) System software/efmemšce mee@heäšJesÙej files on disk so that all datas are
(b) User software/GheÙeesiekeâlee& mee@heäšJesÙej adjoined./..............,ef[mkeâ hej HeâeFueeW keâes
(c) Application software and System software hegveJÙe&JeefmLele keâjves keâer Øeef›eâÙee keâes meboefYe&le keâjlee nw
SefhuekesâMeve mee@heäšJesÙej Deewj efmemšce mee@heäšJesÙej leeefkeâ meYeer [sše mebueive nes peeSb~
(d) Application software and User software (a) Defragmentation/ef[øewâicesvšsMeve
SefhuekesâMeve mee@heäšJesÙej Deewj GheÙeesiekeâlee& mee@heäšJesÙej (b) Disksorting/ef[mkeâmee@efšËie
63. A compiler is a translating program which:
(c) Diskfiltering/ef[mkeâef]Heâušefjbie
kebâheeFuej Skeâ DevegJeeo keâjves Jeeuee Øees«eece nw, pees–
(d) Deserialization/ef[meerefjDeueeF]pesMeve
(a) Translates instruction of a high-level
language into machine language/keâcheeFuej keâe 68. Dee@hejsefšbie efmemšce keâer efvecveefueefKele ceW mes keâewve meer
Fvehegš meesme& Øees«eece nw~ ØekeâeÙee&lcekeâlee, efve<heeove (executtion) DeOeerve efJeefYeVe
(b) Translates entire source program into Øees«eeceeW keâes cesceesjer mhesme DeeJebefšle keâjleer nw?
machine language program/Ùen meesme& keâes[ keâes (a) efmekeäÙeesefjšer cewvespeceWš
mechetCe& ™he mes Dee@ypeskeäš keâes[ ceW š^ebmeuesš keâjlee nw~ (b) Øeesmesmej cewvespeceWš
(c) It is not involved in program's execution/ (c) cesceesjer ceQvespeceWš
keâcheeFuej keâe DeeGšhegš Dee@ypeskeäš keâes[ nw~
(d) ef[JeeFme ceQvespeceWš
(d) More than one of the above/GheÙeg&keäle ceW mes Skeâ mes
69. Which of the following is a file system
DeefOekeâ commonly used in operating systems?
64. ef[mkeâ Mes[dÙetefuebie Suieesefjodce cebs, FIFO (heâerheâes) keâe efvecveefueefKele ceW mes keâewve-mee HeâeFue efmemšce meeceevÙele:
celeueye _____ neslee nw~ Dee@hejseEšie efmemšce ceW GheÙeesie efkeâÙee peelee nw?
(a) Few In Few Out (heäÙet Fve heäÙet DeeGš) (a) NTFS
(b) First In First Out (heâmš& Fve heâmš& DeeGš) (b) FAT32
(c) Frequently In Frequently Out (øeâerkeäJesvšueer Fve (c) HFS+
heÇâerkeäJesvšueer DeeGš) (d) More than one of the above/GheÙeg&òeâ ceW mes Skeâ mes
(d) Fast In Fast Out (]heâemš Fve ]heâemš DeeGš) DeefOekeâ
65. While scheduling process, which of the 70. [smkeâše@he Deewj uewheše@he Dee@hejsefšbie efmemšce keâes Scyes[s[
following controls the degree of efmemšce keâer leguevee ceW DeefOekeâ GVele cesceesjer ØeyebOeve
multiprogramming (the number of processes in lekeâveerkeâeW keâer DeeJeMÙekeâlee keäÙeeW nesleer nw~
memory)?
(a) [smkeâše@he Deewj uewheše@he Dee@hejsefšbie efmemšce kesâ efueS
Øeef›eâÙeeDeeW keâes Mes[Ÿetue keâjles meceÙe, efvecveefueefKele ceW mes
cesceesjer ØeyebOeve DeeJeMÙekeâ veneR nw~
keâewve ceušer Øees«eeefcebie (cesceesjer ceW Øeef›eâÙeeDeeW keâer
(b) Jes meerefcele ne[&JesÙej mebmeeOeveeW kesâ keâejCe mšsefškeâ cesceesjer
mebKÙee) keâer ef[«eer keâes efveÙebef$ele keâjlee nw?
SueeskesâMeve hej efveYe&j keâjles nw~
(a) Process control block scheduler
(c) Jes DeefOekeâ ne[&JesÙej mebmeeOeveeW keâe GheÙeesie keâjles nQ Deewj
Øeesmesme kebâš^esue yuee@keâ Mes[Ÿetuej
GvnW [eÙeveeefcekeâ cesceesjer SueeskesâMeve (Allocation) keâer
(b) Long-term scheduler/ueebie-šce& Mes[Ÿetuej DeeJeMÙekeâlee nesleer nw~
(c) CPU scheduler/meer.heer.Ùet. Mes[Ÿetuej (d) Jes Skeâ meceÙe ceW kesâJeue Skeâ ner SefhuekesâMeve jve keâjles nQ,
(d) Short-term scheduler/Mee@š& šce& Mes[Ÿetuej efpememes cesceesjer ØeyebOeve mejue nes peelee nw~
108 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
71. What is the correct sequence of steps followed (c) Rename/veece yeouevee
in data processing? (d) More than one of the above/GheÙeg&òeâ ceW mes Skeâ mes
[eše Øeesmesefmebie ceW DeheveeS peeves Jeeues ÛejCeeW keâe mener DeefOekeâ
Deveg›eâce keäÙee nw? 74. efvecveefueefKele ceW mes keâewve mee efØebšj Skeâ-Skeâ Meerš kesâ
(a) Decode instruction -> instruction address yepeeÙe efvejblej heshej keâe GheÙeesie keâj mekeâlee nw?
calculation -> fetch instruction ->
(a) Fbkeâpesš efhebÇšj
executeinstruction -> read operands -> store
(b) [e@š cewefš^keäme efØebšj
the results/ef[keâes[ Fbmš^keäMeve - Fbmš^keäMeve S[^smesme
(c) Fbkeâpesš Deewj uespej efØebšj oesveeW
kewâuekegâuesMeve - hewâÛe Fbmš^keäMeve - SefipekeäÙetš (d) uespej efØebšj
Fbmš^keäMeve - jer[ Dee@hejW[dme - mšesj o efjpeušdme 75. Which of the following keys work in a toggle
(b) Decode instruction -> fetch instruction -> mode in a computer keyboard?/efvecveefueefKele ceW mes
read operands -> execute instruction - keâewve meer kegbâefpeÙeeB keâchÙetšj keâer yees[& ceW še@ieue cees[ ceW
>instruction address calculation -> store the keâeÙe& keâjleer nQ?
results/ef[keâes[ Fbmš^keäMeve - hewâÛe Fbmš^keäMeve - jer[ (a) Shift (b) Caps lock
Dee@hejW[dme - SefipekeäÙetš Fbmš^keäMeve - Fbmš^keäMeve (c) Enter (d) Ctrl
76. When a key is pressed on keyboard, which
S[^smesme kewâuekegâuesMeve - mšesj o efjpeušdme standard is used for converting the keystroke
(c) Instruction address calculation -> fetch into the corresponding bits?
instruction -> decode instruction -> peye keâeryees[& hej Skeâ kegbâpeer oyeeF& peeleer nw, lees keâermš^eskeâ
readoperands -> execute instruction -> store keâes mebyebefOele efyešdme ceW heefjJeefle&le keâjves kesâ efueS efkeâme
the results/Fbmš^keäMeve S[^smesme kewâuekegâuesMeve - hewâÛe ceevekeâ keâe GheÙeesie efkeâÙee peelee nw?
Fbmš^keäMeve - ef[keâes[ Fbmš^keäMeve - jer[ Dee@hejW[dme - (a) ANSI
SefipekeäÙetš Fbmš^keäMeve - mšesj o efjpeušdme (b) ASCII
(d) Decode instruction -> read operands -> (c) EBCDIC
instruction address calculation -> (d) More than one of the above/GheÙeg&keäle ceW mes Skeâ mes
fetchinstruction -> execute instruction -> DeefOekeâ
store the results/ ef[keâes[ Fbmš^keäMeve - jer[ 77. With respect to the first digital electronic
Dee@hejW[dme - Fbmš^keäMeve S[^smesme kewâuekegâuesMeve - hewâÛe computer, what is the full form of ABC?
Fbmš^keäMeve - SefipekeäÙetš Fbmš^keäMeve - mšesj o ØeLece ef[efpešue Fueskeäš^e@efvekeâ keâchÙetšj kesâ mebyebOe ceW,
efjpeušdme ABC keâe hetCe& ™he keäÙee nw?
72. In a timeshare operating system, when the time (a) Atanasoff Binary Computer/Sševeemee@heâ yeeFvejer
slot assigned to a process is completed, the keâchÙetšj
process switches from the current state to? (b) Analog Berry Computer/Sveeuee@ie yesjer keâchÙetšj
šeFceMesÙej Dee@hejseEšie efmemšce ceW, peye efkeâmeer Øeef›eâÙee (c) Atanasoff-Berry Computer
keâes meeQhee ieÙee meceÙe muee@š hetje nes peelee nw, lees Øeef›eâÙee Sševeemee@heâ-yesjer keâchÙetšj
Jele&ceeve efmLeefle mes efmJeÛe nes peeleer nw? (d) Analog Binary Computer/Sveeuee@ie yeeFvejer keâchÙetšj
(a) Suspended state 78. Artificial intelligence is an example of:
(b) Blocked state ke=âef$ece yegefæ .............. keâe Skeâ GoenjCe nw~
(c) Ready state (a) Second generation computers
(d) More than one of the above efÉleerÙe heerÌ{er mebieCekeâ
73. Which of the following is a common file (b) Third generation computers
operation?/efvecveefueefKele ceW mes keâewve-mee Skeâ meeceevÙe le=leerÙe heerÌ{er mebieCekeâ
(c) Fourth generation computers
HeâeFue Dee@hejsMeve nw?
ÛelegLe& heerÌ{er mebieCekeâ
(a) Create/yeveeSB
(d) Fifth generation computers
(b) Delete/nšeSB heeBÛeJeeR heerÌ{er mebieCekeâ
109 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
79. Which of the following is not a processor (a) Prefaced Internet Controller
manufacturer?/efvecveefueefKele ceW mes keâewve Skeâ Øeesmesmej Øeerhesâm[ Fbšjvesš kebâš^esuej
keâe efvecee&Cekeâòee& veneR nw? (b) Prefaced Interface Controller
(a) Nvidia /SveefJeef[Ùee Øeerhesâm[ Fbšjhesâme kebâš^esuej
(b) AMD /S Sce [er (c) Peripheral Internet Controller
(c) Qualcomm/keäJeeuekeâe@ce
hesefjhesâjue Fbšjvesš kebâš^esuej
(d) Peripheral Interface Controller
(d) Apple /Shheue
hesefjhesâjue Fbšjhesâme kebâš^esuej
80. What do we use to extend the connectivity of
86. Which of the following is an example of a
the processor bus?
digital Electronic?/efvecveefueefKele ceW mes keâewve
Øeesmesmej yeme keâer keâvesefkeäšefJešer yeÌ{eves kesâ efueS nce
efkeâmekeâe GheÙeesie keâjles nQ? ef[efpešue Fueskeäš^e@efvekeâ keâe GoenjCe nw?
(a) PCI bus (a) Computers/keâchÙetšj
(b) Multiple bus (b) Mobile phones/ceesyeeFue Heâesve
(c) SCSI bus (c) Digital cameras/ef[efpešue kewâcejs
(d) More than one of the above/GheÙeg&òeâ ceW mes Skeâ (d) More than one of the above/GheÙeg&òeâ ceW mes Skeâ mes
DeefOekeâ DeefOekeâ
81. How many output ports are there in peripheral 87. 100 nibbles are equal to______bits.
I/O?/hesefjHesâjue I\O ceW efkeâleves DeeGšhegš heesš& nesles nw? 100 efveyeume (nibbles)...........efyeš kesâ yejeyej neslee nwb~
(a) 512 (b) 264 (a) 512 (b) 200
(c) 24 (d) 256
(c) 256 (d) 400
82. Which of the following provides internal
88. A hard disk becomes totally inaccessible when
storage to the CPU? a computer virus corrupts
efvecve ceW mes keâewve meer meer.heer.Ùet. keâes Deebleefjkeâ Yeb[ejCe ne[& ef[mkeâ hetjer lejn mes DeØeehÙe nes peelee nw, peye
Øeoeve keâjlee nw? keâchÙetšj JeeÙejme _____ keâes otef<ele keâjlee nw~
(a) Register (b) Register and RAM
(a) partition table/efJeYeepeve leeefuekeâe (heeefš&Meve šsyeue)
(c) RAM (d) Hard disk
83. The brain of any computer system is- (b) file allocation table/heâeFue Deeyebšve leeefuekeâe (heâeFue
efkeâmeer Yeer kebâhÙetšj efmemšce keâe ceefmle<keâ______neslee nw~ SueeskesâMeve šsyeue)
(a) ALU (c) root directory/™š efveoxefMekeâe (™š [eÙejskeäšjer)
(b) Memory (d) More than one of the above/GheÙeg&òeâ ceW mes Skeâ mes
(c) CPU
DeefOekeâ
(d) More than one of the above/GheÙeg&keäle ceW mes Skeâ mes
89. Which of the following is a very-high-speed
DeefOekeâ
semiconductor memory which can speed up the
84. The concept of "stored-program architecture",
CPU?/efvecveefueefKele ceW mes keâewve meer Deefle GÛÛe ieefle
which greatly influenced modern computing,
was first articulated by which of the following Deæ&Ûeeuekeâ cesceesjer nw pees CPU keâer ieefle keâes yeÌ{e
pioneers? mekeâleer nw?
‘‘mšes[&-Øees«eece Deeefke&âšskeäÛej’’ keâer DeJeOeejCee, efpemeves
(a) Primary Memory/ØeeLeefcekeâ cesceesjer
DeeOegefvekeâ keâchÙetefšbie keâes yengle ØeYeeefJele efkeâÙee, meyemes
(b) Main Memory/cegKÙe cesceesjer
henues efvecveefueefKele ceW mes efkeâme De«eotle Éeje JÙeòeâ keâer
(c) Secondary Memory/efÉleerÙekeâ cesceesjer
ieF& Leer?
(d) Cache Memory/kewâMe cesceesjer
(a) Grace Hopper/«esme ne@hej
90. The_____unit is capable of mimicking the
(b) John von Neumann/pee@ve Jee@ve vÙetcewve
(c) Steve Jobs/mšerJe pee@yme processor and, indeed, of taking over control of
the system from the processor.
(d) Bill Gates/efyeue iesšdme
…..FkeâeF& Øeesmesmej keâer vekeâue keâjves ceW me#ece nw Deewj
85. With reference to microcontroller, PIC stands
for _____. JeemleJe ceW, Øeesmesmej mes efmemšce keâe efveÙeb$eCe keâjves kesâ
ceeF›eâeskebâš^esuej kesâ meboYe& ceW, PIC keâe DeLe& ........ nw~ efueS~
110 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
 (a) Random Memory Access (c) don't care conditions should not be present
(b) Indexed sequential Memory Access [eWš kesâÙej keâer MeleX veneR GheefmLele nesveer ÛeeefnÙes
(c) Sequential Memory Access (d) don't care conditions, if present, should be
(d) Direct Memory Access taken as zero/[eWš kesâÙej keâer MeleX, Deiej GheefmLele nw,
91. efvecveefueefKele ceW mes keâewve meerheerÙet Éeje Jele&ceeve ceW lees MetvÙe efueÙee peevee ÛeeefnS
efve<heeefole efkeâS pee jns Øees«eece Deewj [sše keâes mšesj 95. What are the canonical forms of Boolean
expressions?
keâjlee nw? yetefueÙeve SkeämeØesMeve kesâ kewâvee@efvekeâue ™he keäÙee nQ?
(a) Tertiary memory/le=leerÙekeâ cesceesjer (a) OR and XOR/ OR Deewj XOR
(b) Auxiliary memory/meneÙekeâ cesceesjer (b) NOR and XNOR/ NOR Deewj XNOR
(c) Primary memory/ØeeLeefcekeâ cesceesjer (c) SOM and POM/ SOM Deewj POM
(d) Secondary memory/efÉleerÙekeâ cesceesjer (d) More than one of the above/GheÙeg&òeâ ceW mes Skeâ
92. _____ is used to store softwares that does not DeefOekeâ
update. 96. DeMorgan's second theorem says that a NAND
_____ keâe ØeÙeesie Ssmes mee@heäšJesÙej keâes mšesj keâjves kesâ gate is equivalent to a bubbled _______ gate.
efueS efkeâÙee peelee nw, efpemekeâes Dehe[sš keâjvee veneR ef[cee@ie&ve keâe efÉleerÙe ØecesÙe keânlee nw efkeâ Skeâ NAND
heÌ[lee nw~ iesš Skeâ yeyeu[ ______ iesš kesâ leguÙe neslee nw~
(a) XAND (b) AND
(a) SRAM
(c) OR (d) XOR
(b) DRAM
97. The most widely used universal gates are:
(c) ROM JÙeehekeâ ™he mes GheÙeesie efkeâÙee peeves Jeeuee meeJe&ef$ekeâ
(d) More than one of the above/GheÙeg&òeâ ceW mes Skeâ mes (universal) iesš nw :
DeefOekeâ (a) OR and AND gates/ OR leLee AND iesš
93. K-Map can be used to simplify the (b) NOR and NAND gates/ NOR leLee NAND iesš
A. Min Term (c) NOR and AND gates/ NOR leLee AND iesš
B. Max Term (d) NAND and OR gates/ NAND leLee OR iesš
K-cewhe keâe GheÙeesie efkeâmes mejueerke=âle keâjves kesâ efueS 98. If A and B are the inputs of a half adder, the
efkeâÙee pee mekeâlee nw? carry is given by _______.
A. efceve šce& Ùeefo A Deewj B half adder kesâ Fvehegš nQ, lees neefmeue
keâe cetuÙe _______ nesiee~
B. cewkeäme šce&
(a) A XOR B (b) A OR B
(a) Neither A nor B /vener A Deewj ve ner B (c) A AND B (d) A PXOR B
(b) Both A and B/A Deewj B oesveeW 99. The minimum number of NAND gates required
(c) Only A/kesâJeue A to implement Boolean function f = x'y + xy' is
(d) Only B/kesâJeue B yetefueÙeve hebâkeäMeve f = x'y + xy' keâes Fchueercesvš keâjves kesâ
94. To get a boolean expression in the product of
efueS vÙetvelece efkeâleves NAND iesš ÛeeefnS?
sum form, from a given K-map (a) 3
efkeâmeer efoS ieS K-map ceW, ÙeesieeW kesâ iegCeveHeâue kesâ (b) 4
(c) 6
JegefueÙeve JÙebpekeâ Øeehle keâjves kesâ efueS–
(d) More than one of the above
(a) one should cover all the 1's present and
GheÙeg&òeâ ceW mes Skeâ mes DeefOekeâ
complement the resulting expressing
100. Decimal equivalent of the hexadecimal number
meYeer GheefmLele 1's keâes meefcceefuele keâjvee ÛeeefnS Deewj (ADD)16 is:
heefjCeeceer JÙebpekeâ keâes keâe@chueerceWš keâjvee ÛeeefnS <ees[MeDeeOeejer mebKÙee (hexadecimal number)
(b) one should cover all the 0's present (ADD)16 keâe oMeceueJe meceleguÙe (Decimal
complement the resulting expression equivalent) nwŠ
meYeer GheefmLele 0's keâes meefcceefuele keâjvee ÛeeefnS Deewj (a) 2871 (b) 2178
heefjCeeceer JÙebpekeâ keâes keâe@chueerceWš keâjvee ÛeeefnS (c) 2187 (d) 2781
111 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
 SOLUTION : PRACTICE SET- 1
ANSWER KEY
1. (a) 11. (d) 21. (c) 31. (b) 41. (b) 51. (b) 61. (d) 71. (c) 81. (d) 91. (c)
2. (a) 12. (d) 22. (b) 32. (d) 42. (a) 52. (a) 62. (c) 72. (c) 82. (a) 92. (c)
3. (c) 13. (b) 23. (b) 33. (c) 43. (a) 53. (b) 63. (d) 73. (d) 83. (c) 93. (b)
4. (d) 14. (b) 24. (b) 34. (d) 44. (a) 54. (c) 64. (b) 74. (b) 84. (b) 94. (b)
5. (d) 15. (c) 25. (a) 35. (b) 45. (a) 55. (b) 65. (b) 75. (b) 85. (d) 95. (c)
6. (d) 16. (a) 26. (c) 36. (d) 46. (a) 56. (d) 66. (d) 76. (a) 86. (d) 96. (c)
7. (a) 17. (c) 27. (a) 37. (b) 47. (b) 57. (c) 67. (a) 77. (c) 87. (d) 97. (b)
8. (d) 18. (c) 28. (d) 38. (d) 48. (c) 58. (c) 68. (c) 78. (d) 88. (a) 98. (c)
9. (c) 19. (a) 29. (a) 39. (b) 49. (b) 59. (b) 69. (d) 79. (d) 89. (d) 99. (b)
10. (d) 20. (c) 30. (b) 40. (b) 50. (c) 60. (a) 70. (c) 80. (a) 90. (d) 100. (d)
SOLUTION
1. (a) 8. (d)
keäuemšefjbie Skeâ DevegheÙeesieer ceMeerve ueefveËie Suieesefjodce nw~ Ùen TensorFlow ietieue Éeje efJekeâefmele Skeâ Deesheve-meesme& øesâceJeke&â,
Suieesefjodce [sše mesš ceW efyevee efkeâmeer uesyeue kesâ Skeâ hewšve& Keespeves keâer efpemekeâe JÙeehekeâ ™he mes ceMeerve ueefveËie cee@[ue efJekeâefmele keâjves Deewj
keâesefMeMe keâjlee nw~ lewveele keâjves kesâ efueS GheÙeesie efkeâÙee peelee nw~ TensorFlow štue,
2. (a) ueeFyeÇsjer Deewj meecegoeefÙekeâ mebmeeOeveeW keâe Skeâ JÙeehekeâ heeefjefmLeeflekeâer leb$e
keäueeG[ Mewveve keâes Fueskeäš^e@efvekeâ mebÛeej Ùegie keâe mebmLeehekeâ ceevee peelee Øeoeve keâjlee nw pees [erheueefveËie Deewj DevÙe ueefveËie keâeÙeeX keâe meceLe&ve
nw Deewj GvnW kebâhÙetšj Øees«eeefcebie ceW yeeFvejer uee@efpekeâ Deewj DeefjLecesefškeâ keâjlee nw~
keâe ØeJele&keâ keâne peelee nw~ GvneWves 1937 ceW ceemšj Leerefmeme kesâ 9. (c)
oewjeve Ùen efoKeeÙee efkeâ yetefueÙeve uee@efpekeâ keâe GheÙeesie keâjkesâ yeeFvejer Jesye keâece keâjves Jeeuee SefhuekesâMeve Øeesšeskeâe@ue neFhej šskeämš š^ebmeheâj
DebkeâieefCeleerÙe mebÛeeueve Deewj leke&â keâes Fueskeäš^eefvekeâ meefke&âšdme kesâ ceeOÙece Øeesšeskeâe@ue (HTTP) nw~ HTTP Jen Øeesšeskeâe@ue nw efpemekeâe GheÙeesie
Jesye-yeÇeGpej Deewj Jesye meJe&j Fbšjvesš hej Skeâ-otmejs kesâ meeLe mebÛeej
mes ueeiet efkeâÙee pee mekeâlee nw~
keâjves kesâ efueS keâjles nw~
3. (c)
10. (d)
keäueeG[ keâchÙetefšbie cee@[ue Skeâ lekeâveerkeâer ØeCeeueer nw efpemeceW Fbšjvesš
hee@[keâemš Skeâ Øekeâej keâe ef[efpešue ceeref[Ùee nw, efpemeceW mheeskeâve Je[&,
kesâ ceeOÙece mes efJeefYevve mesJeeDeeW Deewj mebmeeOeveeW keâe GheÙeesie keâj mekeâles ef[efpešue Dee@ef[Ùees pees Sefhemees[ Ùee YeeieeW keâer meerjerpe ceW GheueyOe neslee
nQ~ pewmes- [sše mšesjspe, vesšJeke&â Deeefo~ FmeceW neFefyeÇ[ keäueeG[, nw Deewj pees Fbšjvesš hej Ùetpej Éeje mš^erce Ùee megveves kesâ efueS Deheves
heefyuekeâ keäueeG[, ØeeFJesš keäueeG[ pewmes cee@[ume Meeefceue nw~ heme&veue ef[JeeFme hej [eGveuees[ keâj mekeâles nw~
meesmeeFšer keäueeG[ Fmekeâe Yeeie veneR nw~ 11. (d)
4. (d) Ùee mp4 Skeâ ef[efpešue ceušerceeref[Ùee kebâšsve kesâ Øee™he nw
mpeg4
BMP280 Skeâ SÙej ØesMej meWmej nw~ DHT11 Skeâ Deeõ&lee Deewj pees Deeceleewj hej Jeeref[Ùees Deewj Dee@ef[Ùees mšesj keâjves kesâ efueS GheÙeesie
leeheceeve meWmej nw~ Heâesšesjsefmemšj (Photoresistor) Skeâ ØekeâeMe meWmej efkeâÙee peelee nw~
nw Dele: efoS ieS meYeer meWmej IoT kesâ nw~ 12. (d)
5. (d) Dee@šescesefškeâ cesšeheâesj ceušerceeref[Ùee keâe ceevÙe Dee@Leefjbie mebuesKeve
IoT (Fbšjvesš Dee@heâ efLebime) ef[JeeFme keâes keäueeG[ kesâ ceeOÙece mes [sše cesšeheâesj veneR nw~ ceušerceeref[Ùee SefhuekesâMeve yeveeves keâer Skeâ Øeef›eâÙee nw
mes peesÌ[e pee mekeâlee nw~ IoT ef[JeeFme [sše meb«en, Øeesmesefmebie, leLee ™hekeâ (Metaphor) Skeâ heæefle nesleer nw,
š^ebmeefceMeve, mšesjspe, efJeMues<eCe Deewj Øemlegefle kesâ Ûe›eâ kesâ ceeOÙece mes Dele: ceušerceeref[Ùee mebuesKeve ™hekeâ (Multimedia authoring
[sše mes pegÌ[s nesles nw~ metaphor) ceušerceeref[Ùee SefhuekesâMeve yeveeves keâer Øeef›eâÙee keâer Skeâ
6. (d) heæefle nw~ kegâÚ ceevÙe ceušerceeref[Ùee Dee@Leefjbie cesšeheâesj Fme Øekeâej nw~
Dee[t&Fvees yees[& ceW, GPIO keâe hetCe& ™he ‘pevejue hehe&pe Fvehegš (i) Scripting Language Metaphor
DeeGšhegš’ neslee nw~ Ùen efhevme nesles nQ efpevekeâe GheÙeesie efJeefYeVe Fvehegš (ii) Hierarchical metaphor
Deewj DeeGšhegš ef[JeeFme pewmes– meWmej, SueF&[er, ceesšj Deeefo mes (iii) Iconic/flow-control metaphor
(iv) Slide show metaphor
keâveskeäš keâjves kesâ efueS efkeâÙee peelee nw~ 13. (b)
7. (a) F&-keâe@ceme& JeeefCeefpÙekeâ GÅece cee@[ue pees mesJeeDeeW Ùee GlheeoeW keâes
IoT efmemšce ceW ef[JeeFme, mebÛeej megj#ee mesJeeSB Deewj SefhuekesâMeve Dee@veueeFve yesÛeves ceW ceeefnj nw, Dee@veueeFve [eÙejskeäš ceekexâefšbie nw~ Ùen
pewmes keâF& HebâkeäMeveue yuee@keâ Meeefceue nw~ HebâkeäMeveue yuee@keâ meWefmebie, cee@[ue JÙeJemeeÙeeW keâes heejbheefjkeâ Kegoje ogkeâeveeW keâes ÚesÌ[keâj, Fbšjvesš
henÛeeve, ef›eâÙeevJeÙeve, ØeyebOeve Deewj mebÛeej #ecelee Øeoeve keâjles nw~ hej meerOes «eenkeâeW keâes Deheves meeceeve Deewj mesJeeSb yesÛeves keâer Devegceefle
FkeämekeäuegefpeJe-hesÙej IoT keâcÙetefvekesâMeve cee@[ue keâe Øekeâej nw~ oslee nw~
112 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
14. (b) 21. (c)
MIME keâe hetCe& ®he 'Multipurpose Internet Mail šefce&veue Skeämesme hee@Fš efJeefYeVe meJe&j leLee keâeÙe& mLeeveeW kesâ ceOÙe mebheke&â
Extension' nw~ Ùen Skeâ ceevekeâ nw efpemekeâe GheÙeesie Fbšjvesš hej mLeeefhele keâjves keâe keâeÙe& keâjlee nw~ efpememes keâer [eše keâe Deeoeve-Øeoeve
efJeefYeVe Øekeâej kesâ [sše pewmes efkeâ šskeämš, FceWpe, Dee@ef[Ùees, efJeef[Ùees efkeâÙee pee mekesâ~
22. (b)
Deeefo keâes mebØesef<ele (Compreset) keâjves kesâ efueS efkeâÙee peelee nw~
JeeÙejuesme keâe DeeMeÙe nw efyevee leej, ceeref[Ùee pees efJeÅegle ÛegcyekeâerÙe
15. (c)
lejbieeW Ùee DeJejòeâ lejbieeW mes yevee nw~ Sbšsvee Ùee meWmej meYeer JeeÙejuesme
[escesve vesce efmemšce (DNS) keâe keâeÙe& Domain Name keâes IP GhekeâjCeeW hej ceewpeto jnWies~ JeeÙe[& vesšJeke&â keâer leguevee ceW JeeÙejuesme
address ceW heefjJeefle&le keâjvee neslee nw~ peye nce efkeâmeer Web vesšJeke&â keâer mebjÛeCe ieefle Oeerceer nesleer nw~ Ùen JeeÙe[& keâer leguevee ceW
browser hej efkeâmeer JesyemeeFš keâe Domain Name šeFhe keâjles nQ keâce megjef#ele neslee nw FmeefueS keâce efJeÕemeveerÙe neslee nw~ JeeÙejuesme
lees DNS meJe&j Gmekeâes IP Address ceW heefjJeefle&le keâj oslee nw~ vesšJeke&â keâe Fbmše@uesMeve Deewj cesvešsveWme ueeiele keâce nesleer nw~
16. (a) 23. (b)
mše@j šesheesuee@peer Skeâ vesšJeke&â šesheesuee@peer keâe Øekeâej neslee nw efpemeceW yuetštLe mebmkeâjCe 5.0 kesâ DeefOekeâlece [sše oj 2 Mbps nw~ Fmekeâe
keâF& ef[JeeFme Ùee keâchÙetšj pegÌ[s nesles nw~ Fme šesheesuee@peer ceW meYeer DeLe& nw efkeâ yuetštLe 5.0 DeefOekeâlece 2 Mbps keâer oj mes [sše
ef[JeeFme meerOes nye Ùee efmJeÛe mes pegÌ[s nessles nQ Deewj nye Ùee efmJeÛe keâe š^ebmeHeâj keâj mekeâlee nw, pees efkeâ yuetštLe 4.2 keâer leguevee ceW oesiegveer
GheÙeesie [sše hewkesâšdme keâes ef[JeeFmeeW kesâ yeerÛe Øesef<ele keâjves kesâ efueS ieefle nw~
24. (b)
efkeâÙee peelee nw~ peyeefkeâ cesMe Deewj efjbie šesheesuee@peer ceW nye keâer [eÙeueDehe (Dial up) Fbšjvesš keâveskeäMeve ceW [sše š^ebmeefceMeve kesâ efueS
DeeMÙekeâlee veneR nesleer nw~ šsueerheâesve ueeFve keâe GheÙeesie efkeâÙee peelee nw~
17. (c) 25. (a)
WAN, JeeF[ SefjÙee vesšJeke&â keâe mebef#ehle ™he nw~ Ùen ueeskeâue Dee@efhškeâue HeâeFyej Skeâ JeeÙe[& mebÛeej ceeOÙece nw~ neF&-mheer[ vesšJeke&â
SefjÙee vesšJeke&â (LANs) mes efceuekeâj yevee neslee nw~ DeLee&le Ùen ceW keâhÙetšj Deewj DevÙe GhekeâjCeeW keâes peesÌ[ves kesâ efueS Dee@efhškeâue
vesšJekeâex keâe vesšJeke&â neslee nw~ Fbšjvesš meyemes yeÌ[s Jewve vesšJeke&â keâe HeâeFyej keâe GheÙeesie efkeâÙee peelee nw~ Dee@efhškeâue HeâeFyej JeeÙejuesme
GoenjCe nQ~ mebÛeej ceeOÙece ve nesves kesâ keâejCe JeeÙejuesme mebÛeej keâe DeceevÙe Øekeâej
uewve vesšJeke&â keâe GheÙeesie keâeÙee&ueÙe SbJe oheälej kesâ efyeefu[bie ceW efkeâÙee nw~
peelee nw~ 26. (c)
meeFyej FefLekeäme Dee@veueeFve SveJeeÙejceWš Deewj ef[efpešue ceeref[Ùee
Ùen uebyeer otefjÙeeW ceW keâvesefkeäšefJešer kesâ efueS MPLS, ATM, øesâce efjues huesšheâe@ce& hej GefÛele Deewj veweflekeâ JÙeJenej keâer Keespe mes mebyebefOele nw~
Deewj X.25 pewmeer ØeewÅeesefieefkeâÙeeW keâe GheÙeesie keâjlee nw~ peyeefkeâ DevÙe efJekeâuheeW ceW meeFyej efmekeäÙeesefjšer (megj#ee), meeFyej keâevetve
Dele: efJekeâuhe (c) melÙe nesiee~ (keâevetveer henuet) Deewj meeFyej mesHeäšer (megjef#ele GheÙeesie) Meeefceue nw,
18. (c) meeFyej FefLekeäme efJeMes<e ™he mes Gve veweflekeâ efmeæebleeW Deewj DeeÛejCeeW keâes
efkeâmeer efoS ieS vesšJeke&â ceW vesšJeke&â S[^sme meYeer keâes Skeâ megmebiele DeOÙeÙeve keâjlee nw~ pees Fbšjvesš Deewj ef[efpešue ogefveÙee ceW Dehesef#ele
S[^sefmebie keâvJeWMeve keâe heeueve keâjvee ÛeeefnS~ vesšJeke&â yeeFš Dee@[&j kesâ nesles nw~
¤he ceW peevee peeves Jeeuee Ùen meccesueve (convention), vesšJeke&â 27. (a)
S[^sme kesâ efyeš-Dee@[&j keâes heefjYeeef<ele keâjlee nw keäÙeeWefkeâ Jes vesšJeke&â mes Fvej pJee@Fve oes šsyeueeW mes efjkeâe[& keâes peesÌ[leer nw, peye Yeer efkeâmeer
iegpejles nQ~ TCP/IP ceevekeâ vesšJeke&â yeeFš Dee@[&j efyeie-Sbef[Ùeve nw~ heâeru[ ceW oesveeW šsyeueeW kesâ efueS meceeve JewuÙet efceueles nQ~ lees Deehe
ØelÙeskeâ efJeYeeie ceW meYeer keâce&ÛeeefjÙeeW Ùee meueenkeâej keâe ÛeÙeve keâjves kesâ
19. (a)
efueS efJeYeeieeW Deewj advisors šsyeueeW kesâ meeLe Fvej pJee@Fve keâe
SMTP client F&-cesue keâes Yespeves kesâ efueS GheÙeesie efkeâÙee peelee nw~ GheÙeesie keâjles nw~
SMTP client Ùetpeme& kesâ Éeje efueKes ieS F&-cesue keâes Gvekesâ F&-cesue
meJe&j kesâ meeLe mebJeeo keâjves kesâ efueS neslee nw Deewj Gmes efJeefMe„ F&-cesue
S[^sme hej hengBÛeeves ceW ceoo keâjlee nw~ Ùen Skeâ Øekeâej keâe F&-cesue
Øeesšeskeâe@ue neslee nw pees F&-cesue kesâ ØemeejCe keâes megefveef§ele keâjves ceW ceoo
keâjlee nw~ peye cesue meJe&j, DevÙe cesue meJe&jeW keâes cesue Yespelee nw, lees
Ùen SMTP client nes peelee nw~ 28. (d)
20. (c) Skeâ efjuesMeveue [sše cee@[ue ceW Dee@hejsMebme Ùen JeCe&ve keâjlee nw efkeâ
HeâeÙejJee@ue (keâchÙetšj kesâ meboYe& ceW) JewÅe mebÛeej kesâ heejieceve keâer keäJesjer keâjves kesâ efueS [sše keâes peesÌ[-leesÌ[ kewâmes keâer pee mekeâleer nw~
Devegceefle veneR oslee nw Ùen keâLeve mener veneR nw~ HeâeÙejJee@ue keâchÙetšj 29. (a)
keâes megjef#ele jKeves kesâ efueS Skeâ JÙeJemLee nw, pees meYeer lejn kesâ [sšeyesme keâe FbmšWme (Instance), efkeâmeer Yeer meceÙe hej Fve JesefjSyeume
kesâ ceeve nesles nQ~ FbmšWme keâes Jele&ceeve efmLeefle Ùee [sšeyesme keâer efmLeefle
keâchÙetšj Deewj Gmekesâ vesšJeke&â keâes hackers Deewj malware mes yeÛee Yeer keâne peelee nw~ [sšeyesme mkeâercee Jen ef[peeFve nw pees JesefjSyeume keâes
keâj jKelee nw~ pees Ûeghekesâ mes nceejs keâchÙetšj kesâ Devoj Dee peeleer nw Gve šsyeume ceW heefjYeeef<ele keâjlee nw pees Skeâ efJeMes<e [sšeyesme mes
Deewj meYeer personal detail Gme software keâes Yespeves Jeeues mebyebefOele nesleer nQ~ Skeâ efveefMÛele [sšeyesme mkeâercee kesâ efueS keâF& FbmšWme
hackers kesâ heeme hengbÛee osleer nw, pees Fmekeâe ieuele HeâeÙeoe G"eles nw~ nes mekeâles nQ~
113 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
30. (b) 38. (d)
efjuesMeve keâe ef[«eer Deewj keâeef[&veefuešer keâes veS Sefš^yÙetšdme Deewj mšwkeâ Skeâ efueefveÙej [sše mš^keäÛej nw efpemeceW [sše keâes peesÌ[ves kesâ efueS
šŸetheume keâes peesÌ[ves kesâ yeeo efveOee&efjle efkeâÙee pee mekeâlee nw~ Gme SefueceWš keâes še@he hej jKeles nw~
ef[«eer: efjuesMeve keâe ef[«eer veS SefšyÙetšdme kesâ peesÌ[ves kesâ yeeo 3 mes 39. (b)
yeÌ{keâj 7 nes peeÙesiee~ Ssjs Skeâ meceeve Øekeâej kesâ [sše šeFhe keâe Skeâ keâueskeäMeve neslee nw
keâeef[&veefuešer: veS šŸetheume keâes peesÌ[ves kesâ yeeo, Ùeefo keâesF& ØeeFcejer DeLee&le Ssjs ceW Skeâ ner Øekeâej Ùee [sše šeFhe kesâ SsefueceWš keâes jKee
kebgâpeer nw, lees keâeef[&veefuešer Deye 4 mes yeÌ{keâj 7 nes peeÙesiee~ peelee nw~ FmeceW Fb[sefkeämebie 0 (MetvÙe) mes Meg™ neslee nw~
Ùeefo keâesF& vee@ve ØeeFcejer Sefš^yÙetš kesâJeue ØeeFcejer kebgâpeer hej GoenjCe kesâ efueS-
hetjer lejn mes efveYe&j nw, lees keâeef[&veefuešer Jener jnsieer~
31. (b)
SQL views keâes JeÛe&gDeue šsyeue kesâ veece mes Yeer peevee peelee nw efpemes 40. (b)
Skeâ Ùee Skeâ mes DeefOekeâ yesme šsyeue keâer Skeâ GheefmLeefle kesâ ™he ceW hJeeFbšj Skeâ JesefjSyeue nw, pees otmejs JesefjSyeue keâe cesceesjer S[^sme
Øemlegle efkeâÙee peelee nw, uesefkeâve Ùen JeemleefJekeâ [sše mšesj veneR keâjleer~ jKelee nw~ hJeeFbšj keâe ØeÙeesie JesefjSyeue keâe helee mebefÛele keâjves kesâ
Ùen [sšeyesme ceW meb«eefnle [sše keâes Deueie-Deueie lejerkeâeW mes Øemlegle efueS efkeâÙee peelee nw~
keâjves kesâ efueS GheÙeesie keâer peeleer nw, efpememes [sše keâer Øeeefhle Deewj 41. (b)
C++, Skeâ GÛÛe mlejerÙe kebâhÙetšj Øees«eeefcebie Yee<ee nw efpemes 1980 kesâ
Øemlegefle keâes mejue yeveeÙee pee mekeâlee nw~
oMekeâ keâer Meg™Deele ceW yesue uesyeesjsšjerpe kesâ yepejves mš^e@mš^he Éeje
32. (d)
efJekeâefmele efkeâÙee ieÙee nw~
efmJeHeäš veÙes Øees«eecej kesâ Devegketâue Øees«eeefcebie Yee<ee nw efpemekesâ Éeje 42. (a)
Heâesve, [smkeâše@he, meJe&j Deeefo kesâ efueS mee@HeäšJesÙej Øees«eece efkeâÙee pee DeheeÛes n[the øesâceJeke&â keâe Skeâ yeÌ[e efnmmee peeJee Yee<ee ceW efueKee ieÙee
mekeâlee nw~ Fmekeâe efJekeâeme Shheue keâcheveer ves efkeâÙee Lee~ nw, efpemeceW C ceW kegâÚ cetue keâes[ Deewj keâceeb[ ueeFve GheÙeesefieleeDees keâes
33. (c) Mesue efm›eâhš kesâ ™he ceW efueKee ieÙee nw~
«eenkeâ Éeje JÙeJeefmLele [sše keâe heejbheefjkeâ Yeb[ejCe, HeâeFeEueie kewâefyevesš 43. (a)
ceW Deueie-Deueie Heâesu[jeW ceW meb«enerle neslee nw, pees heoeveg›eâefcekeâ CSS Skeâ mšeFefuebie ueQiJespe nw efpemekeâe GheÙeesie HTML Ùee XML
[sšeyesme ØeyebOeve ØeCeeueer keâe Skeâ GoenjCe nw~ [e@keäÙetceWbš kesâ ØespeWšsMeve keâes mepeeves kesâ efueS efkeâÙee peelee nw~ cegKÙele:
34. (d) CSS kesâ leerve Øekeâej nesles nw– FveueeFve CSS, Skeämešve&ue CSS Deewj
kebâhÙetšj [sšeyesme Deeceleewj hej [sše efjkeâe@[& Ùee HeâeFueeW kesâ Skeâ$eerkeâjCe Fvšve&ue CSS peyeefkeâ FveJe[& CSS, CSS keâe Øekeâej veneR nw~
keâes meb«enerle keâjles nQ efpeveceW efye›eâer uesveosve, «eenkeâ [sše, efJeòeerÙe Deewj 44. (a)
Glheeo peevekeâejer pewmes peevekeâejer nesleer nw~ [sšeyesme keâe GheÙeesie efkeâmeer mebkeâueve kesâ meceÙe yeng¤helee keâes šscheuesšdme keâe GheÙeesie keâjkesâ
Yeer Øekeâej kesâ [sše keâes meb«enerle keâjves, yeveeS jKeves Deewj Skeämesme keâjves keâeÙee&efvJele efkeâÙee peelee nw, efpemeceW (efpevnW mebkeâueve meceÙe kesâ oewjeve
kesâ efueS efkeâÙee peelee nw~ pewmes–šskeämš, [sše Jeeueer HeâeFueeW, Dee@ef[Ùees peeBÛee pee mekeâlee nw) keâe GheÙeesie keâjkesâ Ùen leÙe efkeâÙee peelee nw efkeâ
Deewj Jeeref[Ùees [sše Deewj Fcespe HeâeFueW Meeefceue nQ~ HebâkeäMeve keâes keâe@ue efkeâÙee peevee ÛeeefnS~
35. (b) 45. (a)
[eše Fbšeref«ešer, [sše keâer ØeceeefCekeâlee keâes mebjef#ele keâjves kesâ efueS
heefjYeeef<ele efkeâÙee ieÙee nw~ Fmekesâ Éeje [eše mebÛeeefjle Ùee mšesj efkeâÙee
peelee nw~
36. (d)
mšeFue Meerš ueQiJespe Jen keâchÙetšj Yee<ee nw, pees mebjefÛele omleeJespeeW
pewmes– CSS keâer Øemlegefle keâes JÙeòeâ keâjleer nw, peyeefkeâ keâceeb[ ueQiJespe 8 bit kesâ efueS
(00101010)2
Jen Øees«eeeEceie Yee<ee nw efpemekesâ ceeOÙece mes GheÙeesiekeâlee& Dee@hejseEšie 42= (00101010)2
efmemšce mes mebÛeej mLeeefhele keâjlee nw, pewmes– [ermeerSue, Mesue~ –42=(10101010)2
ceeke&âDehe Yee<ee keâes šskeämš keâer Øemlegefle kesâ efueS ef[peeFve efkeâÙee ieÙee 46. (a)
nw~ ceMeerve ueQiJespe keâchÙetšj keâer DeeOeejYetle Yee<ee nw leLee Ùen kesâJeue OOP (Object. Oriented Programming) ceW FvnsefjšWme
cenlJehetCe& keâebmeshš nQ pees Skeâ keäueeme keâes otmejer keäueeme kesâ iegCe Deewj
0 Deewj 1 oes DebkeâeW kesâ ØeÙeesie mes efvee|cele DeLee&led yeeFvejer keâes[ mes
efJeMes<eleeDeeW keâes Øeehle keâjves keâer Devegceefle oslee nw~ Fmes nce efJejemele kesâ
efueKeer peeleer nw~ ™he ceW mecePe mekeâles nw~ peye Skeâ keäueeme otmejer keäueeme mes iegCe Deewj
37. (b) keâeÙe&efJeefOeÙeeB (Methods) Øeehle keâjleer nw, lees Fmes FvnsefjšWme keâne
GheÙeg&òeâ efJekeâuhe ceW efuebkeâkeâeGbšj ASP ceW Ieškeâ veneR nw~ ASP kesâ peelee nw~
Ieškeâ efvecve Øekeâej nw– 47. (b)
1. efJe%eeheve jesšsšj 2. yeÇeGpej #ecelee 3. keâesuewyejsMeve [sše PLA keâe hetje veece Øees«eecesyeue uee@efpekeâ Sssjs nw~ PLA Skeâ ef[efpešue
Dee@ypeskeäš 4. kebâšWš efuebefkebâie 5. kebâšWš jesšsšj 6. [sšeyesme Skeämesme uee@efpekeâ ef[JeeFme nw efpemes efJeefYeVe uee@efpekeâ HebâkeäMeve keâes keâmšceeFpe
Ùes meYeer ASP kesâ Ieškeâ nw~ keâjves kesâ efueS Øees«eece efkeâÙee pee mekeâlee nw~
114 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
48. (c) Ssjs Skeâ [sše šeFhe pees Skeâ ner Øekeâej kesâ SueerceWšdme keâes mšesj keâjves
C++ ceW ns[j HeâeFue keâe SkeämešWMeve 'h' neslee nw~ GoenjCe kesâ efueS, Skeâ kesâ efueS ØeÙeesie efkeâÙee peelee nw~
C++ keäueeme keâer ef[efHeâefveMeve ns[j HeâeFue ceW jKeer pee mekeâleer nw Deewj Ssjs Fb[sefkeämebie 0 mes Meg™ nesleer nw, FmeefueS henues SueerceWšdme keâe
Fmekeâe veece pewmes efkeâ 'myclass.h' nes mekeâlee nw~ Fb[skeäme 0 neslee nw~
49. (b) 59. (b)
mkeâeshe Dee@hejsšj (::) keâe GheÙeesie C++ ceW keäueeme kesâ meomÙeeW keâes Skeâ keâchÙetšj JeeÙejme Skeâ cewuesJeÙej (Malware) nw efpemes
yeenj mes heefjYeeef<ele keâjves kesâ efueS efkeâÙee peelee nw~ ogYee&JeveehetCe& keâes[ Yeer keânles nQ pees Kego keâes Deheveer ØeefleefueefheÙeeB efkeâmeer
50. (c) DevÙe Øees«eece, keâchÙetšj yetš meskeäšj Ùee omleeJespe ceW keâe@heer keâjkesâ
keâcheeFuej Skeâ Øees«eece nw pees efkeâmeer GÛÛe-mlejerÙe Øees«eeefcebie Yee<ee ceW oesnjelee nw Deewj keâchÙetšj kesâ keâece keâjves kesâ lejerkesâ keâes yeoue oslee nw~
efueKes ieS meesme& Øees«eece keâes kegâÚ keâchÙetšj Deeefke&âšskeäÛej kesâ efueS 60. (a)
ceMeerve keâes[ ceW DevegJeeo keâjlee nw~ Skeâ Øees«eece efpemeceW Deeceleewj hej DBMS keâer leguevee ceW DeefOekeâ
51. (b)
GheÙeesiekeâlee& Devegketâue Fbšjhesâme neslee nw Gmes øebâš Sb[ (Front end)
Fefv]heâkeäme SkeämeØesMeve ceW Dee@hejsšj oes Dee@hejW[ kesâ ceOÙe ceW Deelee nw~
++ ++ keâne peelee nw~ DBMS ([sšeyesme cewvespeceWš efmemšce) Skeâ mee@heäšJesÙej
Syntax:- a + b
nw efpemes [sšeyesme ceW [sše keâes mšesj keâjves, hegve:Øeehle keâjves, heefjYeeef<ele
52. (a)
keâjves Deewj ØeyebefOele keâjves kesâ efueS ef[peeFve efkeâÙee ieÙee nw~
heäueesÛeeš& ceW Skeâ 'if..else' kebâmš^keäš keâe FchueerceWš keâjves kesâ efueS
61. (d)
[eÙeceC[ ( ) efÛevn keâe ØeÙeesie keâjles nw~ efoS ieS efJekeâuheeW ceW SbšerJeeÙejme, ef[mkeâ [erøesâieceWšj leLee HeâeFue
53. (b)
cewvespej Ùetefšefuešer mee@HeäšJesÙej nw peyeefkeâ veesšhew[ šskeämš Sef[šj
ShueerkesâMeve Øees«eeefcebie Fbšjhesâme (API) Skeâ øesâceJeke&â nw Ùen Skeâ Ssmee mee@HeäšJesÙej nw~
cewkesâefvepce nw pees oes mee@heäšJesÙej IeškeâeW (component) keâes
62. (c)
heefjYee<eeDeeW Deewj Øeesšeskeâe@ue kesâ Skeâ mesš keâe GheÙeesie keâjkesâ Skeâ-otmejs keâchÙetšj mee@HeäšJesÙej keâes cegKÙe ™he mes oes YeeieeW, SefhuekesâMeve
kesâ meeLe mebJeeo (communicate) keâjves ceW me#ece yeveelee nw~ mee@HeäšJesÙej Deewj efmemšce mee@HeäšJesÙej ßesefCeÙeeW ceW efJeYeeefpele efkeâÙee ieÙee
GoenjCe kesâ efueS, ceewmece yÙetjes kesâ mee@heäšJesÙej efmemšce ceW owefvekeâ nw~
ceewmece [sše neslee nw~
efmemšce mee@HeäšJesÙej– Øees«eeceeW keâe mecetn pees keâchÙetšj efmemšce kesâ
54. (c)
kebâmš^keäšj Skeâ efJeMes<e cesLe[ nw efpemekeâe GheÙeesie Dee@ypeskeäš keâes ueYetle keâeÙeeX keâes mecheVe keâjves leLee GvnW keâeÙe& keâjves ueeÙekeâ yeveeS
cet
FefveefMeÙeueeFpe keâjves kesâ efueS efkeâÙee peelee nw~ peye efkeâmeer keäueeme keâe jKeves kesâ efueS lewÙeej efkeâÙes peeles nw, efmemšce mee@HeäšJesÙej keânueeles nw~
Dee@ypeskeäš yeveeÙee peelee nw lees kebâmš^keäšj keâes keâe@ue efkeâÙee peelee nw~ pewmes- DeeF& Dees Sme, efJev[espe, Ùegefvekeäme Deeefo~
Fmekeâe GheÙeesie Dee@ypeskeäš Sš^eryÙetšdme kesâ efueS FefveefMeÙeue JewuÙet SefhuekesâMeve mee@HeäšJesÙej– Ùen Øees«eeceeW keâe mecetn nw pees efkeâmeer
(ØeejefcYekeâ ceeve) mesš keâjves kesâ efueS efkeâÙee peelee nw~ efJeefMe° keâeÙe& kesâ efueS lewÙeej efkeâÙee peelee nw~ pewmes- Sce.Sme.
Fmekeâe Jener veece nw pees Gme keäueeme keâe nw efpemeceW Jen jnlee nw~ Dee@efheâme, Jesye yeÇeGpej
55. (b) 63. (d)
cee@[dÙetuewefjšer Skeâ Øees«eece keâes yeeo kesâ Úesšs cee@[dÙetue mJeleb$e YeeieeW ceW kebâheeFuej Skeâ Øees«eece neslee nw, pees neF& uesJeue Øees«eeeEceie Yee<ee mes uees
efJeYeeefpele keâjves keâes meboefYe&le keâjleer nw~ Ùen [sJeueheceWš keâes megiece Deewj uesJeue ceMeerve Yee<ee ceW Øees«eece keâes DevegJeeo keâjlee nw~ Ùen Ùetpeme& Éeje
megieef"le yeveeleer nw Deewj keâes[ keâer hegveefve&ÙeespÙelee keâes yeÌ{eJee osleer nw~ efueKes ieS œeesle keâes[ keâes kebâheeFue keâjlee nw, leeefkeâ Jen kebâhÙetšj Éeje
56. (d)
mecePeer pee mekesâ~
object-oriented programing Yee<ee yeveves kesâ efueS efkeâmeer Yeer 64. (b)
Øees«eeefcebie Yee<ee keâes efvecve efJeMes<eleeDeeW keâe meceLe&ve keâjvee ÛeeefnS– FIFO (First In First Out) [sše yeheâj keâes JÙeJeefmLele keâjves Deewj
(i) Object ns jhesâj keâjves kesâ efueS Skeâ efJeefOe nw, FmeceW keâleej keâer henueer ØeefJeef°
(ii) Class keâes henues mebMeesefOele efkeâÙee peelee nw, Ùen henues DeeDees henues heeDees
(iii) Inheritance (FCFS) JÙeJenej kesâ meeLe keâeÙe& keâjlee nw~
(iv) Polymarphism 65. (b)
(v) Abstraction Mee@š& šce& Mes[Ÿetuej Ùee meer.heer.Ùet. Mes[Ÿetuej, Gve Øeef›eâÙeeDeeW ceW mes
(vi) Encapsulation ÛeÙeve keâjlee nw pees efve<heeefole keâjves kesâ efueS lewÙeej nw Deewj uee@ie šce&
57. (c) Mes[Ÿetuej ceušerØees«eeefcebie keâer ef[«eer cesceesjer ceW Øeef›eâÙeeDeeW keâer mebKÙee keâes
heeFLeve ceW, cee@[Ÿetue kesâJeue '.py' SkeämešWMeve Jeeueer HeâeFueW nesleer nQ, efveÙebef$ele keâjlee nw~
efpemeceW keâes[ neslee nw, efpemes otmejs heeFLeve Øees«eece kesâ Deboj Fcheesš& ueebie šce& Mes[Ÿetuej keâes pee@ye Mes[Ÿetuej kesâ ™he ceW Yeer peevee peelee nw~
efkeâÙee pee mekeâlee nw~ ueebie šce& Mes[Ÿetuej Gve Øees«eece keâes efveÙebef$ele keâjlee nw efpevnW Øeesmesme kesâ
58. (c) efueS efmemšce ceW Ûegvee peelee nw~ FmeceW Øees«eece keâes keâleej (queue) ceW
DeefYekeâLeve (A) leLee keâejCe (R) oesveeW mener nw, hejvleg keâejCe (R) mLeeefhele efkeâÙee peelee nw Deewj DeeJeMÙekeâlee kesâ Devegmeej ÛeÙeve efkeâÙee
DeefYekeâLeve (A) keâer mener JÙeeKÙee veneR nQ~ peelee nw~
115 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
66. (d) 2. Read- HeâeFue keâer meece«eer keâes heÌ{vee
Dee@hejsefšbie efmemšce kesâ ØecegKe keâeÙe& nw– 3. Write- HeâeFue ceW [sše peesÌ[vee Ùee yeouevee
1. Øe›eâce ØebyeOeve 2. megj#ee ØeyebOeve 3. HeâeFue ØeyebOeve 4. Rename- HeâeFue keâe veece yeouevee
67. (a) 5. Remove- HeâeFue keâes hetjer lejn mes nše osvee
ef[øewâicesvšsMeve Skeâ Ssmeer Øeef›eâÙee nw, pees efJeKeb[ve (fragmentation) 74. (b)
keâer ef[«eer keâes keâce keâjleer nw~ Ùen HeâeFueeW keâes mšesj keâjves kesâ efueS [e@š cewefš^keäme efØebšj kesâ efhebÇš ns[ ceW Deveskeâ efheveeW keâe Skeâ cewefš^keäme
GheÙeesie efkeâS peeves Jeeues ceeme mšesjspe ef[JeeFme keâer meece«eer keâes keâce neslee nw Deewj ØelÙeskeâ efheve kesâ efjyeve Deewj keâeiepe hej mheMe& mes Skeâ
mes keâce efvekeâšJeleea #es$eeW ceW Yeeweflekeâ ™he mes JÙeJeefmLele keâjkesâ keâjlee nw~ [e@š Úehelee nw Fme efhebÇšj ceW Skeâ-Skeâ Meerš ve ueieekeâj efvejblej heshej
68. (c) keâe jesue ueielee nw leLee efØebš efvekeâuelee jnlee nw pewmes yeQkeâ Ùee efškeâš
cesceesjer cewvespeceWš Skeâ Dee@hejsefšbie efmemšce keâer keâeÙe&#ecelee nw pees ØeeFcejer ceMeerve Ùee SšerSce ceW ueiee efhebÇšj Deeefo~
cesceesjer keâes cewvespe keâjlee nw Deewj efve<heeove (Execution) DeOeerve 75. (b)
efJeefYevve Øees«eeceeW keâes cesceesjer mhesme DeeJebefšle keâjleer nw~ meyemes DeefOekeâ Fmlesceeue keâer peeves Jeeueer še@ieue kegbâpeer kewâhme uee@keâ
69. (d) kegbâpeer nw pees Dehej kesâme Deewj ueesDejkesâme kesâ yeerÛe kesâ De#ejeW keâes
efoÙes ieÙes meYeer HeâeFue efmemšce Dee@hejsefšbie efmemšce ceW meeceevÙele: alternates (Jewkeâefuhekeâ) keâjleer nw~
GheÙeesie efkeâS peeles nw~ 76. (a)
NTFS- Ùen Windows Dee@hejsefšbie efmemšce ceW GheÙeesie efkeâÙee peelee nw~ ANSI keâe hetje veece Decesefjkeâve vesMeveue mšQ[[& FbmšeršÙd etš nw~ Ùes
HFS+ - Ùen MacOS Dee@hejsefšbie efmemšce ceW GheÙeesie efkeâÙee peelee nw~ keâermš^eskeäme keâes mebyebefOele efyešdme ceW yeoueves kesâ efueS ceevekeâ Øeoeve efkeâS nw~
FAT32 - Ùen efJeefYeVe Dee@hejsefšbie efmemšce ceW GheÙeesie efkeâÙee peelee nw, 77. (c)
Keemekeâj hegjeves efmemšce ceW Ùee peye Fbšj Dee@hejseyf eefuešer keâer ØeLece ef[efpešue Fueskeäš^e@efvekeâ keâchÙetšj keâes Sševeemee@heâ-yesjer keâchÙetšj
DeeJeMÙekeâlee nesleer nw~ Ùee ABC keâne peelee Lee~ Ùen Yeeweflekeâer kesâ Øeeshesâmej pee@ve efJebmesš
FmeefueS efJekeâuhe (d) mener nesiee~ Sševeemee@heâ Deewj Gvekesâ mveelekeâ Úe$e, efkeäueheâes[& yesjer Éeje 1942 ceW
70. (c) DeeÙeesJee mšsš keâe@uespe ceW yeveeÙee ieÙee Lee, efpemes Deye DeeÙeesJee mšsš
[smkeâše@he Deewj uewheše@he Dee@hejsefšbie efmemšce keâes Scyes[s[ efmemšce keâer ÙetefveJeefme&šer kesâ veece mes peevee peelee nw~
leguevee ceW DeefOekeâ GVele cesceesjer ØeyebOeve lekeâveerkeâeW keâer DeeJeMÙekeâlee 78. (d)
FmeefueS nesleer nw keäÙeeWefkeâ Jes DeefOekeâ ne[&JesÙej mebmeeOeveeW keâe GheÙeesie heeBÛeJeeR heerÌ{er kesâ keâchÙetšj Deeefš&efheâefMeÙeue FbšsefuepeWme (AI) ceMeerveeW ceW
keâjles nQ Deewj GvnW [eÙeveeefcekeâ cesceesjer SueeskesâMeve (Allocation) keâer ceeveJe yegefæ kesâ DevegkeâjCe keâes mevoefYe&le keâjlee nw efpevnW ceveg<ÙeeW keâer
DeeJeMÙekeâlee nesleer nw~ lejn meesÛeves Deewj meerKeves kesâ efueS Øees«eece efkeâÙee peelee nw~
[smkeâše@he Deewj uewheše@he Dee@hejsefšbie efmemšce Dekeämej keâF& SefhuekesâMeveeW 79. (d)
keâes Skeâ ner meceÙe hej Ûeueeles nQ, efpemes ceušeršeefmkebâie keâne peelee nw~ Shheue Øeesmesmej keâe efvecee&Cekeâlee& veneR nw keäÙeeWefkeâ iPhone, iPad Deewj
Fmekesâ efueS yesnlej Deewj kegâMeue cesceesjer ØeyebOeve keâer DeeJeMÙekeâlee nesleer Mac kesâ efueS meYeer Shheue Øeesmesmej leeFJeeve ceW TSMC Éeje
nw leeefkeâ meYeer SefhuekesâMeve Deewj Øeef›eâÙeeSb megÛee™ ™he mes Ûeue mekeWâ~ Glheeefole efkeâS peeles nQ~ Nvidia, AMD, Intel, Qualcomm Deewj
[eÙeveeefcekeâ cesceesjer SueeskesâMeve Deewj ef[ceeb[ hesefpebie pewmeer lekeâveerkeWâ Fve Mediatek ØecegKe Øeesmesmej efvecee&Cekeâòee& keâcheefveÙeeB nQ~ ieewjleueye nw
ØeCeeefueÙeeW ceW meeceevÙe nesleer nw leeefkeâ cesceesjer keâe kegâMeueleehetJe&keâ GheÙeesie efkeâ Skeâ Øeesmesmej, efpemes meWš^ue Øeesmesefmebie Ùetefveš (CPU) kesâ ™he ceW
efkeâÙee pee mekeWâ~ Yeer peevee peelee nw, Skeâ efÛehe neslee nw pees keâchÙetšj Ùee ceesyeeFue
71. (c) GhekeâjCeeW keâe efveÙeb$eCe leLee mecevJeÙe keâjlee nw~
[sše Øeesmesefmebie kesâ mener ›eâce efvecve Øekeâej kesâ nw- 80. (a)
PCI (Peripheral Component Interconnect) yeme Skeâ kebâhÙetšj
efveoxMe S[^sme kewâuekegâuesMeve hesâÛe Fbmš^keäMeve ef[keâes[ FbšjHesâme nw, efpemekeâe GheÙeesie Øeesmesmej yeme keâer keâvesekf eäšefJešer yeÌ{eves kesâ efueS
Fbmš^keäMeve jer[ DeehejW[ SefkeäpekeäÙetš Fbmš^keäMeve efkeâÙee peelee nw~ Ùen Deeceleewj hej Skeâ [smkeâše@he ceW efJeefYeVe S[-Dee@ve keâe[&
heefjCeeceeW keâes meb«enerle keâjvee~ Deewj hesefjHesâjue ef[JeeFme keâes keâveskeäš keâjves kesâ efueS ØeÙegòeâ neslee nw~
72. (c) 81. (d)
šeFce-MesÙeeEjie Dee@hejseEšie efmemšce ceW peye efkeâmeer Øeesmesme keâes efoÙee ieÙee hesefjHesâjue ef[JeeFme keâchÙetšj keâer meneÙekeâ ef[JeeFme nesleer nw~ Ùen Skeâ
šeFce muee@š hetje nes peelee nw, lees Øeesmesme jefvebie mšsš mes js[er mšsš ne[&JesÙej Fvehegš Ùee DeeGšhegš ef[JeeFme nw pees keâchÙetšj keâes Deefleefjòeâ
(Ready state) ceW Ûeueer peeleer nw~ šeFce-MesÙeefjbie Dee@hejseEšie efmemšce #ecelee Øeoeve keâjlee nw~ hesefjHesâjue ef[JeeFme kesâ GoenjCe nw pewmes- keâer
ceW CPU keâes MesÙej keâjves kesâ efueS Ùetefveš šeFce efveOee&efjle efkeâÙee peelee yees[&, ceeGme, peeÙeefmškeâ Deeefo~ hesefjHesâjue Fvehegš DeeGšhegš ef[JeeFme
nw; Fmes šeFce keäJeebšce Ùee šeFce mueeFme keânles nQ~ Deiej keâesF& Øeesmesme ceW 256 DeeGšhegš heesš& nesles nQ~ pees ceeF›eâesØeesmesmejeW Deewj
1 šeFce keäJeebšce mes keâce ueslee nw, lees Øeesmesme Kego ner CPU keâes ceeF›eâeskebâš^esueme& ceW meeceevÙele: ØeÙegkeäle ceevekeâ S[^sefmebie jspe keâer Devegceefle
efjueerpe keâj oslee nw~ osles nw~
73. (d) 82. (a)
meeceevÙe HeâeFue Dee@hejsMeve efvecve nw~ CPU ceW Fvšjveue mšesjspe kesâ efueS jefpemšj neslee nw, jefpemšj [sše
1. Create- veF& HeâeFue yeveevee mšesj keâjves keâer meyemes Úesšer FkeâeF& nesleer nw~
116 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
83. (c) 93. (b)
kebâhÙetšj efmemšce keâe ceefmle<keâ Gmekeâe cegKÙe Yeeie CPU neslee nw, pees K-cewhe keâe ØeÙeesie yegefueÙeve SkeämeØesMeve keâes efceefveceeFpe keâjlee nw efyevee
meYeer keâeÙeeX keâes efveoxeMf ele keâjlee nw, [sše Øeesmesme keâjlee nw Deewj efkeâmeer yegefueÙeve LÙeesjce Deewj ieCevee kesâ DeLee&le K-cewhe keâe ØeÙeesie
GheÙeesiekeâlee& kesâ DeeosMeeW keâe heeueve keâjlee nw~ FmeceW meb«eefnle peevekeâejer cewkeäme Je efceve oesveeW šce& ceW efkeâÙee pee mekeâlee nw~
kebâhÙetšj Øees«eece Deewj DevÙe mebmeeOeve nesles nQ, pees kebâhÙetšj keâes Gmekesâ 94. (b)
keâeÙeeX keâes hetje keâjves ceW ceoo keâjles nQ~ efkeâmeer efoS ieS K-map mes Product of Sums (POS) ™he ceW, nceeje
84. (b) GösMÙe meYeer 0's keâes keâJej keâjvee neslee nw~ meYeer MetvÙe keâes keâJej keâjkesâ nce
‘mšes[&-Øees«eece Deeefke&âšskeäÛej’ keâer DeJeOeejCee meyemes henues pee@ve Jee@ve Ùeesie Jeeues heo yeveeles nQ~ Fmekesâ yeeo, heefjCeeceer JÙebpekeâ keâe keâe@chueerceWš
vÙetcewve ves ØemleeefJele keâer Leer~ Fmes Jee@ve vÙetcewve Deeefke&âšskeäÛej kesâ veece mes efueÙee peelee nw efpememes POS keâe ™he yevelee nw~
Yeer peevee peelee nw~ Fme Deeefke&âšskeäÛej ceW Øees«eece Deewj [sše oesveeW keâes 95. (c)
keâchÙetšj keâer cesceesjer ceW mšesj efkeâÙee peelee nw~ Ùen DeeOegefvekeâ keâchÙetšme& yetefueÙeve SkeämeØesMeve kesâ kewâvee@efvekeâue ™he mebÛeeueve kesâ Skeâ efJeefMe„
kesâ efueS Skeâ yegefveÙeeoer {ebÛee Øeoeve keâjlee nw~ mesš keâe GheÙeesie keâjkesâ leee|keâkeâ keâeÙeesX keâe ØeefleefveefOelJe keâjves kesâ ceevekeâ
85. (d)
PIC Skeâ hesefjhesâjue Fbšjhesâme ceeF›eâeskebâš^esuej nw~ Fmes mee@heäšJesÙej Éeje
lejerkesâ nw~ ÙeneB oes cegKÙe kewâvee@efvekeâue ™he nw:
efveÙebef$ele efkeâÙee peelee nw Deewj Fme lejn mes Øees«eece efkeâÙee peelee nw efkeâ 1. Sum of Products (SOP) Deewj 2. Product of Sum
Ùen efJeefYeVe keâeÙe& keâjlee nw~ PIC ceeF›eâeskebâš^esuej keâe GheÙeesie efJeefYeVe (POS). Ùen kewâvee@efvekeâue ™he yetefueÙeve SkeämeØesme keâes mejue yeveeves Deewj Gvekeâe
veS DevegØeÙeesieeW pewmes- mceeš&heâesve, Dee@ef[Ùees Skeämesefmejerpe Deeefo efJeMues<eCe keâjves kesâ efueS DeeJeMÙekeâ nw Deewj Dekeämej ef[efpešue meefke&âš
GhekeâjCeeW ceW efkeâÙee peelee nw~
86. (d)
ef[peeFve Deewj uee@efpekeâ Dee@efhšceeFpesMeve ceW GheÙeesie efkeâS peeles nw~
96. (c)
ef[efpešue Fueskeäš^e@efvekeâ Skeâ Ssmeer lekeâveerkeâ nw efpemeceW [sše Ùee metÛevee
keâes yeeFvejer (0 Deewj 1) kesâ ™he ceW Øeesmesme, mšesj Deewj š^ebmeefceš ef[cee@ie&ve keâe efÉleerÙe ØecesÙe keânlee nw efkeâ Skeâ NAND iesš Skeâ
efkeâÙee peelee nw~ FmeceW efJeefYeVe Øekeâej kesâ Fueskeäš^e@efvekeâ GhekeâjCeeW Deewj yeyeu[ OR iesš kesâ meceleguÙe nw~ Dele: ØecesÙe kesâ Devegmeej -
meefke&âšdme keâe GheÙeesie efkeâÙee peelee nw, pees yeeFvejer efmemšce hej A .B A B

DeeOeeefjle nesles nw~ GoenjCe– keâchÙetšj, metÛevee GhekeâjCe, ef[efpešue peyeef k eâ ef [ cee@ i e&
v e keâe henuee ØecesÙe keânlee nw efkeâ Skeâ NOR iesš
kewâceje, ef[efpešue šsueerefJepeve, HeäuewMe cesceesjer, USB cesceesjer, ceesyeeFue yeyeu[ AND iesš kesâ yejeyej nw~
Heâesve, ne[& ef[mkeâ Deeefo~ Dele: ØecesÙe kesâ Devegmeej -
87. (d)  1 efveyeume = 4 efyeš A B A .B
100 efveyeume = 400 efyeš 97. (b)
88. (a) JÙeehekeâ ™he mes GheÙeesie efkeâÙes peeves Jeeuee meeJe&ef$ekeâ iesš NOR Deewj
ne[& ef[mkeâ hetjer lejn mes DeØeehÙe (Inaccessible) nes peelee nw, peye NAND nw, efpevekeâer meneÙelee mes DevÙe meYeer iesš Øeehle efkeâÙes pee
keâchÙetšj JeeÙejme heeefš&Meve šsyeue keâes keâjhš keâjlee nw~ mekeâles nQ~
89. (d)
kewâMe cesceesjer, Skeâ GÛÛe mheer[ Deæ&Ûeeuekeâ cesceesjer nw, pees meerheerÙet keâer
ieefle yeÌ{e osleer nw~ Ùen meerheerÙet Deewj cegKÙe cesceesjer kesâ yeerÛe Skeâ yeheâj
kesâ ™he ceW keâeÙe& keâjleer nw~ kewâMe cesceesjer keâe GheÙeesie Ùetpej Éeje efoS 98. (c)
ieS Fvehegš keâes meb«enerle keâjves kesâ efueS efkeâÙee peelee nw~ Ùen meyemes Ùeefo A Deewj B half adder kesâ Fvehegš nw lees neefmeue (carry) keâe
lespe cesceesjer nw pees keâchÙetšj ceeF›eâesØeesmesmej keâes neF&-mheer[ [sše cetuÙe A AND B nesiee peyeefkeâ Ùeesie keâe ceeve A XOR B mes nesiee~
Skeämesme Øeoeve keâjleer nw~ 99. (b)
90. (d) yetefueÙeve HeâbkeäMeve f = x'y + xy' keâe DeLe& nw XOR HebâkeäMeve, efpemes f
DMA ([eÙejskeäš cesceesjer Skeämesme) Øeesmesmej keâer Yeeieeroejer kesâ efyevee [sše = x y kesâ ™he ceW efueKee pee mekeâlee nw~ XOR HebâkeäMeve keâes
mLeeveevleefjle keâjves keâer Øeef›eâÙee nw~ Øeesmesmej mes efveÙeb$eCe uesves kesâ efueS NAND iesšdme keâe GheÙeesie keâjkesâ FchueerceWš keâjves kesâ efueS vÙetvelece
DMA FkeâeF& Øeesmesmej keâer vekeâue keâjves ceW me#ece neslee nw~ 4 NAND iesšdme keâer DeeJeMÙekeâlee nesleer nw~
91. (c) 100. (d)
ØeeFcejer cesceesjer keâes DemLeeF& cesceesjer Yeer keâne peelee nw Ùen cesceesjer nskeämee[sefmeceue mebKÙee (ADD)16 keâe oMeceueJe meceleguÙe %eele keâjvee~
meer.heer.Ùet. keâe cenòJehetCe& Yeeie nw peneB mes meer.heer.Ùet. [eše Ùee efveoxMe nskeämee[sefmeceue keâe DeeOeej 16 nQ efpemekeâe DeLe& nw efkeâ Ùen 0 mes 9
Øeehle keâjlee nw~ ØeeFcejer cesceesjer kesâJeue Gme [eše Deewj efveoxMe keâes lekeâ keâer mebKÙeeDeeW Deewj efHeâj A mes F lekeâ keâe ØeefleefveefOelJe keâjves kesâ
nesu[ keâjkesâ jKeleer nw efpememes keâchÙetšj Jele&ceeve ceW mebÛeeefuele nes jne efueS 16 ØeleerkeâeW keâe GheÙeesie keâjlee nw~ nskeämee[sefmeceue mebKÙee
neslee nw~ Ùen leerve Øekeâej keâer nesleer nw RAM jwce, ROM jesce, Ùee (ADD)16 keâes Fme Øekeâej efJemleeefjle efkeâÙee pee mekeâlee nw~
kewâMe cesceesjer (Cache memory)~ (ADD)16 = (A*162) + (D*161) + (D*160)
92. (c) = (10*162) + (13*161) + (13*160)
ROM (Read Only Memory) keâe ØeÙeesie Gve mee@HeäšJesÙej keâes = (10×256)+ (13*16)+ (13×1)
= 2560 + 208 + 13
mšesj keâjves kesâ efueS efkeâÙee peelee nw~ efpevnW Dehe[sš keâjves keâer = 2781
DeeJeMÙekeâlee veneR nesleer nw, Deewj FmeceW [sše keâes kesâJeue heÌ{e pee FmeefueS nskeämee[sefmeceue mebKÙee (ADD)16 keâe oMeceueJe meceleguÙe
mekeâlee nw~ 2781 nw~
117 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
 PRACTICE SET - 2
1. What is the purpose of regression technique in 7. What configures the specified pin to behave
machine learning?/efj«esMeve lekeâveerkeâ keâe ceMeerve either as an input or an output in Arduino
ueefveËie ceW keäÙee GösMÙe nw? programming?
(a) Prediction/YeefJe<ÙeJeeCeer
Dee[t&Fvees Øees«eeefcebie (Arduino programming) ceW Ùee
(b) Classification/JeieeakeâjCe
lees Fvehegš Ùee lees DeeGšhegš kesâ ™he ceW JÙeJenej keâjves kesâ
(c) Clustering/keäuemšefjbie
efueS efveefo&° efheve keâes keäÙee keâe@evf Heâiej keâjlee nw?
(a) pinMode() (b) ScanIOMode()
(d) Reinforcement/megÂÌ{erkeâjCe
(c) digitalMode() (d) PrintMode()
2. ..............is a type of software that provides
8. In HDFS, which component coordinates data
control, monitoring and data manipulation of
replication and oversees the data blocks?
engineered products and systems:
SÛe[erSHeâSme ceW, keâewve-mee Ieškeâ [sše Øeefleke=âefle keâe
efvecveebefkeâle ceW mes efkeâme Øekeâej keâe mee@HeäšJesÙej
mecevJeÙe keâjlee nw Deewj [sše yuee@keâ keâer osKejsKe keâjlee nw?
DeefYeÙeebef$eefkeâÙe GlheeoeW SJeb leb$eeW hej efveÙeb$eCe, efveiejeveer
(a) Job Tracker/pee@ye š^wkeâj
SJeb DeeBkeâÌ[e Øekeâueve Øeoeve keâjlee nw-
(b) NameNode/veecevees[
(a) Freeware/øeâerJesÙej
(c) Task Tracker/šemkeâ š^wkeâj
(b) Firmware/Heâce&JesÙej
(d) DataNode/[sševees[
(c) Batchware/yewÛeJesÙej
9. Which of the following values are valid with
(d) Dual Technology/oesnjer lekeâveerkeâ
respect to align attribute of 'div' tag in HTML?
3. Which of the following is NOT an application
of an IoT?/efvecveefueefKele ceW mes keâewve-mee loT keâe Skeâ HTML ceW 'div' šwie kesâ DeueeFve Sefš^yÙetš kesâ mebyebOe ceW
DevegØeÙeesie veneR nw? efvecveefueefKele ceW mes keâewve mee ceeve ceevÙe nw?
(a) Smartweed/mceeš&Jeer[ (i) Left/ yeeSB
(b) Smart healthcare/mceeš& nsuLekesâÙej (ii) Center/ ceOÙe
(c) Smart pollution control/mceeš& hee@uÙetMeve kebâš^esue (iii) Right/ oeSB
(d) Smart vehicles/mceeš& Jnerkeâume (a) (i), (ii) and (iii) /(i), (ii) Deewj (iii)
4. IoT gateway must provide ______ (b) Only (i) and (iii) / kesâJeue (i) Deewj (iii)
IoT iesšJes keâes ______ Øeoeve keâjvee nesiee~ (c) Only (i) and (ii) / kesâJeue (i) Deewj (ii)
(a) Protocol abstraction (d) Only (ii) and (iii) / kesâJeue (ii) Deewj (iii)
(b) Data storage / Security with hardware 10. Which of the following HTML tags specifies a
(c) Simple and fast installation container for an external (non-HTML)
(d) More than one of the above application?
5. Which programming language is used by the efvecveefueefKele ceW mes keâewve mee HTML šwie, Jee¢e (iewj -
Raspberry Pi IoT software for developing
HTML) SefhuekesâMeve kesâ efueS Skeâ kebâšsvej efveefo&°
codes?/keâes[ [sJeuehe keâjves kesâ efueS Raspberry Pi
IoT mee@]heäšJesÙej Éeje efkeâme Øees«eeefcebie Yee<ee keâe GheÙeesie
keâjlee nw?
efkeâÙee peelee nw? (a) <ins> (b) <em>
(c) <embed> (d) <nav>
(a) Java/peeJee (b) JavaScript/peeJeeefm›eâhš
11. With respect to multimedia, sampling rate is
(c) C/C ++
(d) Python/heeFLeve the number of times the analog sound is taken
6. What does DDoS Security Attack in IoT stand for? per:
IoT ceW DDoS efmekeäÙeesefjšer Dešwkeâ keâe hetCe& ™he keäÙee nw? ceušerceeref[Ùee kesâ meboYe& ceW, Sveeuee@@ie OJeefve keâer mebKÙee
(a) Direct Distraction of Service yeej-yeej ueer peeleer nw:
[eÙejskeäš ef[mš^wkeäMeve Dee@Heâ meefJe&me (a) month (b) second
(b) Direct Detention of Software (c) hour (d) minute
[eÙejskeäš ef[šWMeve Dee@Heâ mee@HeäšJesÙej 12. Which of the following is an audio file
(c) Distributed Denial of Service extension?/efvecveefueefKele ceW keâewve-mee Skeâ Dee@ef[Ùees
ef[efmš^yÙetšs[ [sefveÙeue Dee@Heâ meefJe&me HeâeFue keâe SkeämešWMeve nw?
(d) Distributed Disturbance of Software (a) WMA (b) MP5
ef[efmš^yÙetšs[ ef[mšyeXme Dee@Heâ mee@HeäšJesÙej (c) MOV (d) WMV
118 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
13. Yeejle ceW F&-ieJeveXme kesâ efkeâme ÛejCe ceW DeefOekeâebMe (a) GPRS (b) LTE
mejkeâejer keâeÙee&ueÙe kebâhÙetšj mes megmeefppele Les Deewj (c) VPN (d) WAP
kebâhÙetšj keâe GheÙeesie Je[& Øeesmesefmebie kesâ meeLe Meg™ ngDee, 19. The length of an IPv6 address is
Fmekesâ legjble yeeo [sše Øeesmesefmebie ngF&? IPv6 address keâer uecyeeF& nesleer nw
(a) Computerization/kebâhÙetšjeFpesMeve (a) 32 bits
(b) Networking/vesšJeefkeËâie (b) 64 bits
(c) On-line interactivity/Dee@ve-ueeFve FbšjSefkeäšefJešer (c) 256 bits
(d) On-line presence/Dee@ve-ueeFve ØespeWme (d) None of the above/GheÙeg&òeâ ceW mes keâesF& veneR
14. What does the page property of Page Object 20. efvecve ceW mes keâewve meer efvecve hee@Jej, ueeskeâue SefjÙee
do?/hespe Dee@ypeskeäš keâer hespe Øee@hešea keäÙee keâjleer nw? JeeÙejuesme mebÛeej lekeâveerkeâ nw?
(a) Gets or sets the path of a layout page (a) yuetštLe (b) JeeF&-cewkeäme
uesDeeGš hespe keâe heLe Øeehle Ùee mesš keâjlee nw~ (c) F&Lejvesš (d) mesueguej vesšJeke&â
(b) Provides property such as access to data 21. Computers connected to a LAN can ______.
shared between pages and layout pages
uewve (LAN) mes pegÌ[s ngS keâchÙetšj _______~
hespe Deewj uesDeeGš hespeeW kesâ yeerÛe meePee efkeâÙes ieS [sše
lekeâ hengBÛe pewmeer Øee@hešea Øeoeve keâjlee nw~ (a) Go online / Dee@ve ueeFve pee mekeâles nw
(c) Gets the Http Request object for the current (b) Run faster / leer›e ieefle mes keâeÙe& keâj mekeâles nw
HTTP request/keâjbsš HTTP efjkeäJesmš kesâ efueS (c) Share information /or share peripheral
HttpRequest Dee@ypeskeäš Øeehle keâjlee nw~ /metÛevee/hesefjHesâjue MesÙej keâj mekeâles nw
(d) Returns true if HTTP data transfer method (d) e-mail /F&-cesue keâj mekeâles nw
used by client is POST 22. Which of the following statements is NOT true
efjšve& šÍ, Ùeefo keäueeFbš Éeje GheÙeesie keâer peeves Jeeueer about twisted pair cable?/šdefJemšs[ hesÙej kesâyeue kesâ
HTTP [sše š^ebmeheâj efJeefOe POST nw~ yeejs ceW efvecveefueefKele ceW mes keâewve-mee keâLeve mener veneR nw?
15. Which of the following browsers is the fastest? (a) The two wires are typically 'twisted' together
efvecveefueefKele ceW mes keâewve-mee yeÇeG]pej meyemes lespe nw? in a helix to reduce interference between the
(a) Microsoft Edge/ ceeF›eâesmee@heäš Sspe two conductors./oes kebâ[keäšjeW kesâ yeerÛe nmle#eshe keâes
(b) Opera/ Deeshesje keâce keâjves kesâ efueS oes leejeW keâes Deeceleewj hej Skeâ
(c) Brave/ yeÇsJe nsefuekeäme ceW Skeâ meeLe ‘cegÌ[’ efoÙee peelee nw~
(b) Data rate is determined by wire thickness and
(d) Chrome/›eâesce
length./[sše oj leej keâer ceesšeF& Deewj uecyeeF& mes
16. What is the primary function of a router in a
computer network?/keâchÙetšj vesšJeke&â ceW jeGšj keâe efveOee&efjle nesleer nw~
(c) Twisted pair can be used for both analog and
ØeeLeefcekeâ keâeÙe& keäÙee nw?
digital communications.
(a) To connect devices within the same network/ cegÌ[ peesÌ[er keâe GheÙeesie Sveeuee@ie Deewj ef[efpešue mebÛeej
kesâ Yeerlej GhekeâjCeeW keâes peesÌ[ves kesâ efueS Jener vesšJeke&â oesveeW kesâ efueS efkeâÙee pee mekeâlee nw~
(b) To connect multiple networks together/ (d) One of their most popular use is in cable TV
SkeâeefOekeâ vesšJeke&â keâes peesÌ[ves kesâ efueS Skeâ meeLe (CATV) for the distribution of TV
(c) To filter incoming traffic based on IP signals./šerJeer mebkesâleeW kesâ efJelejCe kesâ efueS kesâyeue šerJeer
addresses/Deeves Jeeues š^wefHeâkeâ keâes efHeâušj keâjves kesâ (meerSšerJeer) ceW Gvekeâe meyemes ueeskeâefØeÙe GheÙeesie nw~
efueS DeeF&heer heles 23. Wireless transmission of signals can be done
(d) More than one of the above/GheÙeg&òeâ ceW mes Skeâ mes via./efmeiveueeW keâe JeeÙejuesme š^ebmeefceMeve______ kesâ
DeefOekeâ ceeOÙece mes efkeâÙee pee mekeâlee nw~
17. The general length of a MAC address is: (a) Radio waves
cewkeâ S[^sme keâer meeceevÙe uecyeeF& nw- (b) Microwaves
(a) 42 bits/efyešdme (b) 40 bits/efyešdme (c) Infrared
(c) 38 bits/efyešdme (d) 48 bits/efyešdme (d) More than one of the above/GheÙeg&keäle ceW mes Skeâ mes
18. Which among the following wireless standard DeefOekeâ
is used in 4G network technology? 24. efvecveefueefKele ceW mes keâewve mee keâveskeäMeve heâesve ueeFveeW keâe
4G vesšJeke&â ØeewÅeesefiekeâer ceW efvecveefueefKele ceW mes keâewve-mee GheÙeesie keâjlee nw, pees Sveeuee@ie efmeiveue kesâ yepeeÙe
JeeÙejuesme ceevekeâ GheÙeesie efkeâÙee peelee nw? ef[efpešue efmeiveue Jenve keâjles nQ?
119 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
 (a) DSL (b) Wi-Fi 30. Which SQL command is used to remove a table
(c) Dial-up/[eÙeue-Dehe (d) Satellite/mewšsueeFš from a database?
25. In TDM, slots are further divided into: efkeâmeer [sšeyesme mes šsyeue keâes nševes kesâ efueS efkeâme SQL
šer[erSce ceW, muee@š keâes____ceW efJeYeeefpele efkeâÙee ieÙee nw~ keâceeb[ keâe ØeÙeesie efkeâÙee peelee nw?
(a) Frames (a) DELETE
(b) Packets (b) DROP
(c) Bits (c) ERASE
(d) More than one of the above/GheÙeg&keäle ceW mes Skeâ mes (d) More than one of the above/GheÙeg&òeâ ceW mes Skeâ mes
DeefOekeâ DeefOekeâ
26. Which of the following statements could not be 31. How many primary keys can be there in a table?
valid with respect to ICMP (Internet Control Skeâ table ceW efkeâleveer primary key/keys nes mekeâleer
Message Protocol)?/efvecveefueefKele ceW mes keâewve-mee nw/nQ?
keâLeve ICMP (Fbšjvesš kebâš^esue cewmespe Øeesšeskeâe@ue) kesâ (a) Only 1/kesâJeue 1
mebyebOe ceW ceevÙe veneR nes mekeâlee nw? (b) Only 2/kesâJeue 2
(a) Time exceeded Type 11/šeFce Fkeämeeref[[ šeFhe 11 (c) Depends on number of columns/keâe@ueceeW keâer
(b) Incorrect path Type 6/Fvkeâjskeäš heeLe šeFhe 6 mebKÙee hej efveYe&j keâjleer nw
(c) A redirect message Type 5/De jer[eÙejskeäš cewmespe (d) More than one of the above/GheÙeg&òeâ ceW mes Skeâ
šeFhe 5 DeefOekeâ
(d) The "destination unreachable" Type 3 32. Python is a ––––/heeFLeve (Python) Skeâ ____ nw~
/o ‘‘[sefmšvesMeve DevejerÛesyeue’’ šeFhe 3 (a) Programming language/Øees«eeefcebie Yee<ee
27. What is a 'tuple'?/Skeâ ‘šheue’ keäÙee nw? (b) Operating system/Dee@hejsefšbie efmemšce
(a) It is a related set of records in a table.
(c) Malware/ceeueJesÙej
Ùen Skeâ šsyeue ceW efjkeâe[& keâe Skeâ mecyeefvOele mesš nw~
(d) Web Browsers/Jesye yeÇeG]pej
(b) It corresponds to a row in the table
33. After groups have been established, SQL
Ùen šsyeue ceW Skeâ hebefòeâ mes cesue Keeleer nw~ applies predicates in the___clause, allowing
(c) It is another name for third normal form. aggregate functions to be used.
Ùen leermejs meeceevÙe ™he keâe otmeje veece nw~ mecetn mLeeefhele nesves kesâ yeeo, SQL______Keb[ ceW
(d) It is the attribute for each relation, and the efJeOesÙe ueeiet keâjlee nw, efpememes mece«e keâeÙe& keâjves keâer
governing constraint./Ùen ØelÙeskeâ mecyevOe kesâ efueS Devegceefle efceueleer nw~
efJeMes<elee nw Deewj Meemeve yeeOee nw~ (a) HAVING
28. Which of the following commands is used to (b) GROUP BY
remove privileges from a specific user or role? (c) WITH
efkeâmeer efJeefMe° GheÙeesiekeâlee& Ùee Yetefcekeâe mes (d) More than one of the above/GheÙeg&keäle ceW mes Skeâ mes
efJeMes<eeefOekeâejeW keâes nševes kesâ efueS efvecveefueefKele ceW mes DeefOekeâ
efkeâme keâceeb[ keâe GheÙeesie efkeâÙee peelee nw? 34. Which of the following is not a type of database?
(a) Reassign / jerDemeeFve (b) Remove /efjcetJe efvecveefueefKele ceW mes keâewve-mee [sšeyesme keâe Skeâ Øekeâej
(c) Revoke /jerJeeskeâ (d) Reserve /efj]peJe& veneR nw?
29. In the flat file database, each line of the Plain- (a) Network
text file holes only one record. These records (b) Distributed
are separated using delimiters called ________ (c) Decentralized
heäuewš heâeFue [sšeyesme ceW, huesve-šskeämš heâeFue keâer (d) More than one of the above/GheÙeg&keäle ceW mes Skeâ mes
ØelÙeskeâ ueeFve ceW kesâJeue Skeâ efjkeâe@[& neslee nw~ Fve DeefOekeâ
efjkeâe@[&me keâes------ veecekeâ heefjmeercekeâeW (delimiters) 35. The database stores information in ______.
keâe GheÙeesie keâjkesâ he=Lekeâ efkeâÙee peelee nw~ [sšeyesme, metÛevee keâe mebÛeÙe ________ ceW keâjlee nw~
(a) backslashes/yewkeâmuewMe (a) rows and column/hebefòeâ Deewj mlebYe (jes Deewj keâe@uece)
(b) asterisks/Smšsefjmkeâ (b) blocks/yuee@keäme
(c) paragraph marks/hewje«eeheâ ceekeäme& (c) tracks and sectors/š^wkeäme Deewj meskeäšjme
(d) tabs/šwye (d) index/Fb[skeäme
120 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
36. Which of the given options best describes the (a) Underflow /Deb[jheäuees
truthfulness of the following statements? (b) Queuefull /keäÙethegâue
efoS ieS efJekeâuheeW ceW mes keâewve efvecveefueefKele keâLeveeW keâer
(c) Onflow /Dee@veheäuees
melÙelee keâe meJeexòece JeCe&ve keâjlee nw?
(d) Overflow / DeesJejheäuees
(i) ASP.NET is a web framework designed
and developed by Microsoft. 41. Which of these is NOT an object Oriented
ASP.NET ceeF›eâesmee@heäš Éeje ef[peeFve Deewj language?/efvecveefueefKele cebs mes keâewve Skeâ Dee@ypeskeäš
efJekeâefmele efkeâÙee ieÙee Skeâ Jesye øesâceJeke&â nw~ DeesefjSbšs[ ueQiJespe veneR nw?
(ii) ASP.NET provides fantastic integration of (a) C (b) Ruby/™yeer
HTML, CSS and JavaScript. (c) VB.Net (d) C++
ASP.NET, HTML, CSS, leLee JAVAScript 42. In programming, which among the following
keâe Meeveoej SkeâerkeâjCe Øeoeve keâjlee nw~ is/are the parts of function header?
(a) (i)-False, (ii) - False/(i) DemelÙe (ii) DemelÙe Øees«eeefcebie ceW efvecveefueefKele ceW mes keâewve hebâkeäMeve ns[j kesâ
(b) (i) - True, (ii) - False/(i) melÙe (ii) DemelÙe Yeeie nw?
(c) (i) - False, (ii)- True /(i) DemelÙe (ii) melÙe A. Return type/efjšve& šeFhe
(d) (i) - True, (ii) - True/(i) melÙe (ii) melÙe B. Function name/hebâkeäMeve vesce
37. "double" data type in VB.NET gets a storage C. Parameter list/hewjeceeršj efuemš
allocation of _________ bytes. (a) Both C and B/B Deewj C oesveeW
VB.NET cebs "double" [eše Øekeâej keâes _________
(b) Both A and C/A Deewj C oesveeW
yeeFš keâe mšesjspe SueeskesâMeve Øeoeve efkeâÙee peelee nw~
(c) Both B and A/A Deewj B oesveeW
(a) 2 (b) 8
(d) All A, B, C/A, B, C meYeer
(c) 6 (d) 4
38. Which of the following statements is 43. Identify whether the following statement are
INCORRECT with respect to a binary tree? true or false.
yeeFvejer š^er kesâ mecyevOe ceW efvecveefueefKele ceW mes keâewve-mee henÛeeefveS efkeâ efvecveefueefKele keâLeve melÙe Ùee DemelÙe nQ~
keâLeve ieuele nw? i) The CSS class selectors are used to specify a
group of elements./ CSS keäueeme mesueskeäšme& keâe
(a) The height of a node is the number of edges
from the node to the deepest leaf/Skeâ vees[
Ì keâer GheÙeesie efkeâmeer DeJeÙeJe mecetn (group of element) keâes
TBÛeeF& vees[ mes meyemes ienjs heòes lekeâ efkeâveejeW keâer mebKÙee nw~ efveefo&° keâjves kesâ efueS efkeâÙee peelee nw~
(b) The height of a tree is a height of the root. ii) The 'Internal' CSS can be added by using
š^er keâer TBÛeeF& peÌ[ keâer TBÛeeF& nw~ the <style> element in the <head> section./
<head> meskeäMeve <style> DeJeÙeJe keâe GheÙeesie keâjkesâ
(c) The depth of the node is the number of edges
from the root to the node. ‘Fbšjveue’ CSS keâes Ss[ efkeâÙee pee mekeâlee nw~
vees[ keâer ienjeF& peÌ[ mes vees[Ì lekeâ efkeâveejeW keâer mebKÙee nw~ iii) The 'External' CSS can be added by using a
(d) A full binary tree is a binary tree in which <link> element to link to an external CSS
each node has exactly two children. file./efkeâmeer Skeämešve&ue CSS HeâeFue kesâ efuebkeâ keâjves kesâ
Skeâ hetCe& yeeFvejer š^er Skeâ yeeFvejer š^er nw efpemeceW ØelÙeskeâ efueS <link> DeJeÙeJe keâe GheÙeesie keâjkesâ ‘Skeämešve&ue’
vees[ kesâ "erkeâ oes efÛeu[^sve nesles nw~ CSS keâes Ss[ efkeâÙee pee mekeâlee nw~
39. Which of the following operators is used for (a) i-True, ii-True, iii-True/ i-melÙe, ii-melÙe, iii-melÙe
making comparison between different operands? (b) i-False, ii-True, iii-False/ i-DemelÙe, ii-melÙe, iii-DemelÙe
efJeefYeVe mebkeâeÙeeW kesâ yeerÛe leguevee keâjves kesâ efueS (c) i-False, ii-True, iii-True/ i-DemelÙe, ii-melÙe, iii-melÙe
efvecveefueefKele mebkeâejkeâ keâe ØeÙeesie efkeâÙee peelee nw (d) i-True, ii-False, iii-True/ i-melÙe, ii-DemelÙe, iii-melÙe
(a) Logical operator/leeefke&âkeâ mebkeâejkeâ 44. How many correct statements in regard to a
(b) Relational operator/mebyebOehejkeâ mebkeâejkeâ CSS framework scenario are given below?
(c) Arithmetic operator/DebkeâieefCeleerÙe mebkeâejkeâ veerÛes CSS øesâceJeke&â heefjÂMÙe kesâ mebyebOe ceW efkeâleves mener
(d) Assignment operator/efveOee&jCe mebkeâejkeâ keâLeve efoS ieS nQ?
40. What happens when an attempt is made to 1. A CSS framework is used for advanced
read an element from an empty queue?/keäÙee visual elements.
neslee nw peye Skeâ Keeueer keäÙet mes SefueceWš keâes heÌ{ves keâe S[Jeebm[ efJepegDeue SefueceWšdme kesâ efueS CSS
ØeÙeeme efkeâÙee peelee nw? øesâceJeke&â keâe GheÙeesie efkeâÙee peelee nw~
121 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
 2. A CSS framework helps in quick generation 49. Which concept of C++ is used to reuse the
of a UI. written code?
CSS øesâceJeke&â UI kesâ lJeefjle efvecee&Ce ceW meneÙelee C++ keâe keâewve-mee concept efueKes ieÙes code keâes
keâjlee nw~ ogyeeje ØeÙeesie keâjves kesâ efueS efkeâÙee peelee nw?
3. Bootstrap is a CSS framework. (a) Polymorphism
yetšmš^whe Skeâ CSS øesâceJeke&â nw~ (b) Inheritance
(c) Encapsulation
(a) 2 (b) 3
(c) 1 (d) 0 (d) More than one of the above/GheÙeg&òeâ ceW mes Skeâ mes
45. Which of the following is the correct syntax to DeefOekeâ
read the single character to console in the C++ 50. Which of the following takes one statement of a
language? high-level language program at a time and
C++ Yee<ee ceW kebâmeesue kesâ efueS Skeâue JeCe& keâes heÌ{ves kesâ translate it into machine instruction, which is
immediately executed
efueS efvecveefueefKele ceW mes keâewve-mee mener JeekeäÙe efJevÙeeme nw? efvecveefueefKele ceW keâewve Skeâ meceÙe ceW GÛÛe mlejerÙe ueQiJespe
(a) read ch() Øees«eece kesâ keâLeve mes mebyebOe jKelee nw Deewj ceMeerve kesâ
(b) getlinech()
efveoxMe ceW DevegJeeo legjble keâeÙee&evf Jele neslee nw–
(c) get(ch)
(a) Assembler/DemeWyeuej (b) Compiler/keâcheeFuej
(d) None of the above/GheÙeg&keäle ceW mes keâesF& veneR
(c) Interpreter/FbšjØesšj (d) Loader/uees[j
46. Which of the following approaching is used by
C++? 51. OLE kesâ mebyebOe ceW, _____ oes JemlegDeeW kesâ yeerÛe
efvecveefueefKele ceW Skeâ keâewve-mee Âef°keâesCe C++ Éeje keâveskeäMeve mLeeefhele keâjlee nw, Deewj _____ SefhuekesâMeve ceW
GheÙeesie efkeâÙee peelee nw? [sše [euelee nw~
(a) Left-right (a) ScyeeefkeËâie, ueefveËie (b) efuebefkebâie, Scyese[
f bie
(b) Top-down (c) Scyesef[bie, efuebefkebâie (d) efuebefkebâie, ScyeeefkeËâie
(c) Bottom-up 52. Which symbol is used for flow of control?/heäuees
(d) More than one of the above Dee@]heâ kebâš^esue kesâ efueS efkeâme efÛevn keâe GheÙeesie efkeâÙee
GheÙeg&keäle ceW mes Skeâ mes DeefOekeâ peelee nw?
47. Which of the following data structures stores (a) Arrow/leerj
elements in a non-linear relationship?/
(b) Dashed arrow/[wMeÙegòeâ leerj
efvecveefueefKele ceW mes keâewve-meer [sše mebjÛevee lelJeeW keâes
(c) Dotted arrow/efyebogoej leerj
iewj-jwefKekeâ ™he ceW mebyebOe meb«enerle keâjlee nw?
(d) Line/jsKee
(a) Stack
53. What is the set of instructions forming a program
(b) Queue
which is executed by a computer called?
(c) Array
efkeâmeer Øees«eece keâes yeveeles meceÙe efveoxMeeW keâe mecetn, pees
(d) None of the above/GheÙeg&òeâ ceW mes keâesF& veneR
Skeâ kebâhÙetšj Éeje efve<heeefole neslee nw; keäÙee keânueelee nw?
48. What will happen if the following C++
statement is compiled and executed? (a) Syntax/efmebšwkeäme (b) Code/keâes[
keäÙee neslee nw, Ùen efvecveefueefKele C++ keâLeve mebkeâefuele (c) Error/Sjj (d) Language/ueQiJespe
Deewj efve<heeefole efkeâÙee peelee nw? 54. Which of the following can be overloaded?
efvecveefueefKele ceW mes efkeâmes DeesJejuees[ efkeâÙee pee mekeâlee nw?
int *ptr = NULL;
delete ptr; (a) Variable/JesefjSyeue (b) Objects/Dee@ypeskeäšdme
(a) The program is not semantically correct/ (c) Class/keäueeme (d) Function/hebâkeäMeve
Øees«eece MeyoeLe& ™he mes mener veneR nw~ 55. A ________ contains specific rules and words
(b) The program is compiled and executed that express the logical steps of an algorithm.
successfully/Øees«eece keâes meheâueleehetJe&keâ mebkeâefuele Deewj Suieesefjoce kesâ leke&âMegæ efJeJejCe, efJeefMe° efveÙece Deewj
efve<heeefole efkeâÙee peelee nw~ MeyoeW________ ces meceeefJe° nw
(c) The program gives a compile-time error (a) Programming language /›eâceeosMeve Yee<ee
Øees«eece Skeâ mebkeâueve-meceÙe $egefš oslee nw~ (b) Programming structure /›eâceeosMeve {eÛee
(d) More than one of the above (c) Syntax /JeekeäÙeefJevÙeeme
GheÙeg&òeâ ceW mes Skeâ DeefOekeâ (d) Logic chart /leke&â Ûeeš&
122 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
56. Which of the following is not a valid variable (c) Disk defragmenter/ef[mkeâ ef[ØesâiceWšj
name in most programming languages? (d) File compression tools/heâFue kebâØesMeve štume
DeefOekeâebMe Øees«eeefcebie Yee<eeDeeW ceW, efvecveefueefKele ceW mes 62. Which of the following software collects
keâewve-mee valid variable veece veneR nw? information from a computer and transmits it
(a) myVariable to Man-in-the-middle?/efvecve ceW mes keâewve mee
(b) 123Variable mee@HeäšJesÙej kebâhÙetšj mes peevekeâejer Skeâ$e keâjlee nw Deewj
(c) _myVariable
Fmes cewve-Fve-o-efceef[ue keâes mebÛeeefuele keâjlee nw?
(d) More than one of the above/GheÙeg&òeâ ceW mes Skeâ
DeefOekeâ (a) Fork Bomb/Heâeske&â yee@cye
57. How can we describe an array in the best possible (b) Boot Sector Virus/yetš meskeäšj JeeÙejme
way?/nce efkeâmeer Ssjs keâe meJeexòece mebYeJe lejerkesâ mes (c) Memory Resident Virus/cesceesjer jsef]pe[Wš JeeÙejme
JeCe&ve kewâmes keâj mekeâles nQ? (d) Spyware/mheeFJesÙej
(a) Array are immutable 63. ____converts High level language into machine
(b) Container that stores the elements of similar language and execute it in one go./____GÛÛe
types mlejerÙe Yee<ee keâes ceMeerveer Yee<ee cebs heefjJeefle&le keâjlee nw
(c) The array is not a data structure
Deewj Skeâ yeej cebs ner efve<heeefole keâj oslee nw~
(d) More than one of the above/GheÙeg&keäle ceW mes Skeâ mes
DeefOekeâ (a) Assembler/Demescyeuej
58. Which among the following describes an Applet? (b) Interpreter/FvšjØesšj
Fvecebs mes keâewve-mee Shuesš keâe JeCe&ve keâjlee nw? (c) None of these/Fvecebs mes keâesF& veneR
(a) A tag in HTML/SÛešerSceSue cebs Skeâ šwie (d) Compiler/keâcheeFuej
(b) A security protocol/Skeâ megj#ee Øeesšeskeâe@ue 64. A process requests resources, if the resources
(c) Picture displayed on a web page are not available at that time; the process
efÛe$e Skeâ Jesye hespe hej ØeoefMe&le efkeâÙee ieÙee enters a waiting state. Sometimes a waiting
(d) Program that can be embedded in another process is never again able to change state,
application/Øees«eece efpemes otmejs SefhuekesâMeve cebs Scyes[ because the resources it has requested are held
by other waiting processes. This situation is
efkeâÙee pee mekeâlee nw~
called a/Skeâ Øeef›eâÙee mebmeeOeveeW keâes DevegjesOe keâjleer nw,
59. Viruses, trojan horses and worms are:
JeeÙejme, š^espeve ne@mexme Deewj Jeecme& nQ: Ùeefo Gme meceÙe mebmeeOeve GheueyOe veneR nQ; Øeef›eâÙee
(a) able to harm computer system Øeleer#ee keâer efmLeefle ceW ØeJesMe keâjleer nw~ keâYeer-keâYeer
mebieCekeâ leb$e keâes vegkeâmeeve hengBÛeeves ceW meceLe& Øeleer#ee Øeef›eâÙee keâYeer Yeer DeJemLee keâes yeoueves ceW me#ece
(b) unable to detect if present on computer veneR nesleer nw, keäÙeeWefkeâ Fmekesâ Éeje DevegjesefOele mebmeeOeveeW
Ùeefo Ùen mebieCekeâ ceW ceewpeto nes lees helee ueieeves ceW keâes DevÙe Øeleer#ee Øeef›eâÙeeDeeW Éeje DeeÙeesefpele efkeâÙee
DemeceLe&lee peelee nw~ Ùen efmLeefle keäÙee keânueeleer nw?
(c) user - friendly applications (a) Preemption/ØeercheMeve
ØeÙeesJelee efceueJele SefhuekesâMeve (b) Mutual exclusion/cÙetÛegDeue Skeämekeäuegpeve
(d) harmless applications resident on computer
mebieCekeâ ceW eqmLele jnves Jeeues vegkeâmeeve jefnle SefhuekesâMeve (c) Deadlock/[s[uee@keâ
60. DBMS helps to achieve (d) Circular wait/mekeg&âuej Jesš
[eryeerSceSme efkeâmekeâes Øeehle keâjves ceW GheÙeesieer Ùee 65. A computer system that permits multiple users
ceooieej neslee nw? to run programs at the same time is a
(a) data independence/[eše keâer mJeleb$elee kebâhÙetšj efmemšce efpemeceW Deveskeâ ØeÙeeskeälee Skeâ ner meceÙe
(b) centralized control of data/[eše hej kesâvõerke=âle hej Øees«eece Ûeuee mekeâles nQ keânueelee nw
efveÙeb$eCe (a) real time system
(c) selection of data/[eše keâe ÛeÙeve JeemleefJekeâ keâeue efmemšce
(d) Both ‘a’ and ‘b’/oesveeW ‘a’ Je ‘b’ (b) multi programming syste
61. WinZip Deewj WinRAR efkeâme Øekeâej kesâ Ùetefšefuešer ceušer Øees«eeefcebie efmebmšce
mee@heäšJesÙej nQ? (c) time sharing system
(a) Free up disk management tools/øeâer Dehe ef[mkeâ keâeue menYeepeve efmemšce
cewvespeceWš štume (d) multi tasking system
(b) Disk cleanup tools/ef[mkeâ keäueerveDehe štume ceušer šeefmkebâie efmemšce
123 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
66. ––––––– Skeâ Øekeâej keâe ueIeg Øees«eece nw pees keâchÙetšj 70. Which of the following is a lightweight process
keâes Gme meceÙe mes efveÙebef$ele keâjlee nw peye mes Ùen Dee@ve that can run independently or as part of a
process?
neslee nw Deewj leye lekeâ, peye lekeâ Dee@hejsefšbie efmemšce Gmes
efvecveefueefKele ceW mes keâewve-meer nukeâer Øeef›eâÙee nw pees
Deheves efveÙeb$eCe ceW ve keâj ueW~
mJeleb$e ™he mes Ùee efkeâmeer Øeef›eâÙee kesâ Yeeie kesâ ™he ceW
(a) CMOS (b) BIOS
Ûeue mekeâleer nw?
(c) EPROM (d) POST
(a) Thread/LeÇs[ (b) Program/Øees«eece
67. efvecveefueefKele ceW mes keâewve-mee, efuevekeäme Dee@hejsefšbie
efmemšce keâe Ssmee meye-efmemšce nw pees cee@efvešj hej (c) Process/Øeesmesme (d) CPU/meerheerÙet
«eeefHeâkeäme keâes ØeoefMe&le keâjlee nw Deewj Fmes Deeceleewj hej 71. Constantly running system-program processes
are known as
meJe&j Ùee cee$ee kesâ ™he ceW meboefYe&le efkeâÙee peelee nw? efvejblej meef›eâÙe efmemšce-Øees«eece Øeesmesme keâes keäÙee
(a) Init system/Fefveš efmemšce keânles nw?
(b) Daemons/[wcevme (a) Daemons/[erceve
(c) Graphical server/«eeefHeâkeâue meJe&j (b) Processes/Øeesmesme
(d) Kernel/keâvexue (c) Process Block/Øeesmesme yuee@keâ
68. Which of the following statements is NOT true (d) Process Control Block/Øeesmesme kebâš^esue yuee@keâ
with respect to semaphores?/mesceeheâesj kesâ mecyevOe
72. A deadlock avoidance algorithm dynamically
ceW efvecveefueefKele ceW mes keâewve-mee keâLeve melÙe veneR nw? examines the ______ to ensure that a circular
(a) When one process modifies the semaphore wait condition can never exist.
value, no other process can simultaneously Skeâ [s[uee@keâ heefjnej SuieesefjLece ieefleMeerue ™he mes Ùen
modify the same semaphore value. megefveefMÛele keâjves kesâ efueS _________ keâer peebÛe keâjlee
peye Skeâ Øeef›eâÙee mesceeheâesj ceeve keâes mebMeesefOele keâjleer nw, nw efkeâ Skeâ heefjhe$e Øeleer#ee efmLeefle keâYeer ceewpeto veneR nes
lees keâesF& DevÙe Øeef›eâÙee Gmeer mesceeheâesj ceeve keâes Skeâ meeLe mekeâleer nw~
mebMeesefOele veneR keâj mekeâleer nw~ (a) Resource allocation state
(b) An integer variable that, apart from (b) Resources
initaialisation, is accessed only through two (c) System storage state
standard atomic operations./Skeâ hetCeeËkeâ JewefjSyeue (d) More than one of the above
pees DeejcYeerkeâjCe kesâ DeueeJee kesâJeue oes ceevekeâ hejceeCeg 73. Consider a disk queue with requests for I/O to
mebÛeeueve kesâ ceeOÙece mes hengBÛee pee mekeâlee nw~ blocks on cylinders. 98 183 37 122 14 124 65 67
(c) Semaphore is a signalling mechanism, i.e. considering FCFS (First Come First Served)
processes perform wait() and signal() scheduling, the total number of head
operation to indicate whether they are movements is, if the disk head is initially at 53
acquiring or releasing the resource/mesceeheâesj Skeâ is?/efmeueW[jeW hej yuee@keâeW kesâ efueS I/O kesâ DevegjesOeeW kesâ
efmeiveefuebie leb$e nw Ùeeveer Øeef›eâÙeeSb wait() Deewj signal() meeLe Skeâ ef[mkeâ keâleej hej efJeÛeej keâjW~ 98 183 37 122
Dee@hejsMeve keâjleer nw~ 14 124 65 67 FCFS (henues DeeDees henues heeDees)
(d) A process must acquire the lock before Mes[dÙeteEueie hej efJeÛeej keâjles ngS, ns[ cetJeceWš keâer kegâue
entering the critical section; it releases the mebKÙee keäÙee nw, Ùeefo ef[mkeâ ns[ Meg™ ceW 53 hej nw?
lock when it exits the critical section. (a) 640 (b) 620
Skeâ Øeef›eâÙee keâes cenlJehetCe& Keb[ ceW ØeJesMe keâjves mes henues (c) 630
uee@keâ Øeehle keâjvee ÛeeefnS, peye Ùen cenlJehetCe& Keb[ mes (d) More than one of the above/GheÙeg&òeâ ceW mes Skeâ mes
yeenj efvekeâuelee nw lees Ùen uee@keâ efjpeerpe keâj oslee nw~ DeefOekeâ
69. Contiki is used as a/an ______. 74. How many audio and video streams can be
keâeWefškeâer (Contiki) keâe GheÙeesie Skeâ _______ kesâ ™he handled by HDMI?/HDMI Éeje efkeâleves Dee@ef[Ùees
ceW efkeâÙee peelee nw~ Deewj Jeeref[Ùees mš^ercme mebYeeues pee mekeâles nQ?
(a) operating system (a) 2 Video, 2 audio / 2 Jeeref[Ùees, 2 Dee@ef[Ùees
Dee@hejsefšbie efmemšce (b) 1 audio, 1 video / 1 Dee@ef[Ùees, 1 Jeeref[Ùees
(b) software application (c) 2 audio, 1 video / 2 Dee@ef[Ùees, 1 Jeeref[Ùees
mee@heäšJesÙej SefhuekesâMeve (d) 1 video, 2 audio / 1 Jeeref[Ùees, 2 Dee@ef[Ùees
(c) protocol for IoT systems 75. Which of the following type of scanner reads
IoT efmemšce kesâ efueS Øeesšeskeâe@ue characters with the help of a light?
(d) cloud server efvecveefueefKele ceW mes efkeâme Øekeâej keâe mkewâvej De#ejeW keâes
keäueeG[ meJe&j ØekeâeMe keâer ceoo mes heÌ{lee nw?
124 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
 (a) Optical Barcode Recognition 81. What is the primary function of the ALU
Dee@efhškeâue yeejkeâes[ efjkeâe@efiveMeve (Arithmetic Logic Unit)?
(b) Optical mark Recognition ALU (DeLe&cesefškeâ uee@efpekeâ Ùetefveš) keâe ØeeLeefcekeâ keâeÙe&
Dee@efhškeâue ceeke&â efjkeâe@eif veMeve keäÙee nw?
(c) Optical Character Recognition (a) Managing input/output devices/Fvehegš/DeeGšhegš
Dee@efhškeâue kewâjskeäšj efjkeâe@efiveMeve ef[JeeFme keâe ØeyebOeve keâjvee
(d) Magnetic Ink Character Recognition (b) Monitoring memory usage/cesceesjer GheÙeesie keâer
cewivesefškeâ Fbkeâ kewâjskeäšj efjkeâe@efiveMeve efveiejeveer keâjvee
76. Which of the following contains a laser? (c) Performing calculation and logical operation/
efvecveebefkeâle ceW mes efkeâmeceW uespej neslee nw? ieCevee Deewj leeefke&âkeâ mebef›eâÙeeSB keâjvee
(d) Storing data/ Dee@BkeâÌ[eW keâe Yeb[ejCe keâjvee
(a) CD Drive
82. The four basic tasks performed by CPU are
(b) RAM Fetch, ............ , Manipulate and Output:
(c) Hard Disk Drive CPU Éeje mecheeefole efkeâÙes peeves Jeeues Ûeej keâeÙe&
(d) More than one of the above/GheÙeg&òeâ ceW mes Skeâ mes ›eâceMe: Øeehle keâjvee, .......... kegâMeue-heefjJele&ve SJeb
DeefOekeâ Glheeove (heefjCeece) Øeoeve keâjvee nw-
77. IBM-360 meerjerpe kebâhÙetšj keâer efvecveefueefKele ceW mes efkeâme (a) Design/mebkeâuhevee (b) Decode/mhe° keâjvee
heerÌ{er mes mebyebefOele nw? (c) Display/ØeoMe&ve (d) Regulate/jsieguesš
(a) ØeLece (b) ÛelegLe& 83. The maximum memory size of third generation
(c) efÉleerÙe (d) le=leerÙe microprocessor is/le=leerÙe pesvejsMeve ceeF›eâesØeesmesmej
78. The basic architecture of a computer was
keâe DeefOekeâlece cesceesjer meeFpe nw
developed by who of the following? (a) 4 GB
(b) 16 MB
efvecveefueefKele ceW mes efkeâmeves keâchÙetšj keâe yegefveÙeeoer
(c) 16 GB
Deeefke&âšskeäÛej keâe efvecee&Ce efkeâÙee? (d) More than one of the above/GheÙeg&òeâ ceW mes Skeâ mes
(a) Blaise Pascal/yuespe heemkeâue DeefOekeâ
(b) Denis Ritchie/[sefveme efjÛeer 84. What does POST stand for in the context of
(c) Garden Moore/iee[&sve cetjs computers?
keâchÙetšjeW kesâ meboYe& ceW POST keâe keäÙee DeLe& nw?
(d) John Von Neumann/pee@ve Jee@ve vÙetcewve
(a) Power-On Self-Test/heeJej-Dee@ve mesuheâ-šsmš
79. A________is a large and expensive computer
(b) Power-On System Test/heeJej-Dee@ve efmemšce šsmš
capable of simultaneously processing data for
hundreds of thousands of users. (c) Post-Operating System Test/heesmš-Dee@hejsefšbie
meQkeâÌ[eW Deewj npeejeW ØeÙeesòeâeDeeW nsleg menkeâeefuekeâ ™he mes efmemece šsmš
mebmeeefOele DeeBkeâÌ[eW mes me#ece............Skeâ yeÌ[s Deekeâej keâe (d) Pre-Operating System Test/Øeer-Dee@hejseš f bie efmemšce šsmš
85. An integrated circuit is commonly known as :
Deewj keâerceleer mebieCekeâ nw~ Skeâ Skeâerke=âle heefjheLe meeceevÙele: peevee peelee nw ?
(a) hand held computer/nQ[ nsu[ mebieCekeâ (a) chip/efÛehe (b) resistor/ØeeflejesOekeâ
(b) mainframe computer/cesveøesâce mebieCekeâ (c) transistor/š^ebefpemšj (d) plate/huesš
(c) personal computer/heme&veue mebieCekeâ 86. The three main components of a digital
(d) tablet computer/šsyeuesš mebieCekeâ computer system are
80. Which of the following is correct for Digital ef[efpešue keâchÙetšj efmemšce kesâ leerve cegKÙe Ieškeâ nQ
Circuits?/ef[efpešue mee|keâš kesâ efueS efvecveefueefKele ceW mes (a) memory/cesceesjer, I/O, DMA
keâewve-mee mener nw? (b) ALU, CPU,memory/cesceesjer
(a) They use analog signals for communication/ (c) memory/cesceesjer, CPU, I/O
Jes Sveeuee@ie efmeiveue keâe mebÛeej ceW GheÙeesie keâjles nQ (d) More than one of the above/GheÙeg&òeâ ceW mes Skeâ mes
(b) They process information using continuous DeefOekeâ
voltage levels/efvejblej Jeesušspe mlej, Jes metÛevee keâe 87. Mb in computer language is the abbreviation of
GheÙeesie keâj Øeef›eâÙee keâjles nQ which of the following?/kebâhÙetšj Yee<ee ceW Mb
(c) They are not suitable for high speed operations/ efvecveefueefKele ceW mes efkeâmekeâe mebef#ehle ®he nw?
ieefle mebÛeeueve ceW Jes GÛÛe kesâ efueS GheÙegòeâ veneR nw (a) Megabyte/cesieeyeeFš (b) Megabit/cesieeefyeš
(d) None of the above/GheÙeg&òeâ ceW mes keâesF& veneR (c) Megaboast/cesieeyeesmš (d) Masterboot/ceemšjyetš

125 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
88. Secondary memory is the long term store for (a) A+A'B= A+B (b) A+B=B+A
programs and data while main memory holds (c) A+A=A (d) A'+B'=A+B
program and data currently in use. What kind 94. Which of the following combinations CAN
of an organization is this? NOT be combined into K-map groups?
ceeOÙeefcekeâ cesceesjer keâeÙe&›eâceeW Deewj [sše kesâ efueS efvecveefueefKele ceW mes keâewve-mee mebÙeespeve K-ceeveefÛe$e
oerIe&keâeefuekeâ mšesj nw peyeefkeâ cegKÙe cesceesjer Jele&ceeve ceW mecetneW ceW mebÙeesefpele veneR efkeâÙee pee mekeâlee nw?
GheÙeesie ceW Deeves Jeeues Øees«eece Deewj [sše jKeleer nw~ Ùen (a) Diagonal corners/efJekeâCe& keâe@ve&me&
efkeâme lejn keâe mebie"ve nw? (b) Corners in the same row/Skeâ ner hebefòeâ ceW keâe@ve&me&
(a) Physical/Yeeweflekeâ (b) Logical/leeefke&âkeâ (c) Overlapping combinations/DeesJejuewefhebie mebÙeespeve
(c) Structural/mejbÛeveelcekeâ (d) Corners in the same column
(d) More than one of the above/GheÙeg&òeâ ceW mes Skeâ DeefOekeâ Skeâ ner keâe@uece ceW keâesves
89. Cache memory is used to transfer the data 95. Derive the Boolean expression for the logic
between/kewâMe mce=efle keâe ØeÙeesie efvecveefueefKele kesâ yeerÛe circuit shown below :
[eše Debleefjle keâjves kesâ efueS efkeâÙee peelee nw
(a) processor and input device/Øeesmesmej Deewj Fvehegš Ùegefòeâ
(b) main memory and secondary memory
cegKÙe mce=efle Deewj efÉleerÙekeâ mce=efle
(c) processor and outpur device
Øeesmesmej Deewj DeeGšhegš Ùegefòeâ veerÛes efoKeeS ieS uee@efpekeâ meefke&âš kesâ efueS, yetefueÙeve
(d) main memory and processor DeefYeJÙeefòeâ Øeehle keâerefpeS :
cegKÙe mce=efle Deewj Øeesmesmej (a) C (A + B)DE (b) [C (A + B)D + E]
90. Which of the following types of memory must (c) [[C(A + B)D]E]
be continually refreshed in order to maintain (d) More than one of the above/GheÙeg&òeâ ceW mes Skeâ
the data?/ [sše keâes yeveeS jKeves kesâ efueS, DeefOekeâ
efvecveefueefKele ceW mes efkeâme Øekeâej keâer cesceesjer keâes ueieeleej 96. The Boolean expression x + x'y equals
jerøesâMe efkeâÙee peevee ÛeeefnS? yetefueÙeve SkeämeØesMeve x + x'y yejeyej nw
(a) PROM (b) SRAM (a) x + y (b) x + xy
(c) DRAM (d) ROM (c) y + yx
91. Skeämesme mheer[ (access speed) kesâ yeÌ{les ›eâce kesâ meboYe& (d) More than one of the above/GheÙeg&òeâ ceW mes Skeâ mes
ceW efvecveefueefKele ceW mes keâewve-mee efJekeâuhe mener nw? DeefOekeâ
(a) cewivesefškeâ šshe (Magetic tape) Dee@efhškeâue ef[mkeâ 97. Which of the following logic gates is a universal
(Optical disk) kewâMe cesceesjer (Cache memory) gate i.e. its combinations can be used to
jefpemšme& (Registers) construct the logic of any other logic gate?
(b) cewivesefškeâ šshe (Magetic tape) Dee@efhškeâue ef[mkeâ Jen keâewve mee iesš ÙetveerJeme&ue iesš nw~ pees DevÙe uee@efpekeâ
(Optical disk) kewâMe cesceesjer (Cache memory) iesšes mes efceuekeâj yevelee nw?
cesve cesceesjer (Main memory) (a) OR iesš (b) AND iesš
(c) Dee@efhškeâue ef[mš (Optical disk) cewivesefškeâ šshe (c) NAND iesš (d) NOT iesš
(Magnetic tape) kewâMe cesceesjer (Cache 98. Which Gate is also known as inverter ?
memory) jefpemšme& (Registers) keâewve-mee iesš keâes FvJeš&j kesâ ™he ceW Yeer peevee peelee nw ?
(d) Dee@efhškeâue ef[mš (Optical disk) cewivesefškeâ šshe (a) OR (b) NOT
(Magnetic tape) Main memory kewâMe (c) XOR (d) NAND
cesceesjer (Cache memory) 99. Digital circuit can be made by the repeated use
92. The memory devices which are similar to of the _________./ef[efpešue mee|keâš ________ kesâ
EEPROM but differ in the cost effectiveness is yeej-yeej GheÙeesie mes yeveeÙee pee mekeâlee nw~
_____./cesceesjer ef[JeeFme pees EEPROM kesâ meceeve nQ (a) NAND gate (b) NOR gate
uesefkeâve ueeiele ØeYeeJeMeeruelee ceW efYevve nw___ (c) AND gate
(a) CMOS (b) Memory sticks (d) More than one of the above/GheÙeg&òeâ ceW mes Skeâ mes
(c) Flash memory DeefOekeâ
(d) More than one of the above
100. What is the base for hexadecimal system?
93. Which of the following Boolean algebra
statement represents commutative law? nskeämee[sefmeceue mebKÙee heæefle keâe DeeOeej (yesme) keäÙee nw?
efvecveefueefKele ceW mes keâewve mee yetefueÙeve yeerpeieefCele keâLeve (a) Fourteen/Ûeewon (b) Fifteen/hebõn
keâcÙetšsefšJe efveÙece keâes efve™efhele keâjlee nw? (c) Twelve/yeejn (d) Sixteen/meesuen

126 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
 SOLUTION : PRACTICE SET- 2
ANSWER KEY
1. (a) 11. (b) 21. (c) 31. (a) 41. (a) 51. (b) 61. (d) 71. (a) 81. (c) 91. (a)
2. (b) 12. (a) 22. (d) 32. (a) 42. (d) 52. (a) 62. (d) 72. (a) 82. (b) 92. (c)
3. (a) 13. (a) 23. (d) 33. (a) 43. (a) 53. (b) 63. (d) 73. (a) 83. (a) 93. (b)
4. (a) 14. (b) 24. (a) 34. (c) 44. (b) 54. (d) 64. (c) 74. (b) 84. (a) 94. (a)
5. (d) 15. (d) 25. (a) 35. (a) 45. (d) 55. (c) 65. (d) 75. (c) 85. (a) 95. (a)
6. (c) 16. (b) 26. (b) 36. (d) 46. (c) 56. (b) 66. (b) 76. (a) 86. (c) 96. (a)
7. (c) 17. (d) 27. (b) 37. (b) 47. (d) 57. (b) 67. (c) 77. (d) 87. (b) 97. (c)
8. (b) 18. (b) 28. (c) 38. (d) 48. (b) 58. (d) 68. (d) 78. (d) 88. (a) 98. (b)
9. (a) 19. (d) 29. (d) 39. (b) 49. (b) 59. (a) 69. (a) 79. (b) 89. (d) 99. (d)
10. (c) 20. (a) 30. (b) 40. (a) 50. (c) 60. (d) 70. (a) 80. (d) 90. (c) 100. (d)
SOLUTION
1. (a) efoÙee peelee nw, efpememes Jen efmemšce DeesJejuees[ nes peelee nw Deewj mener
efj«esMeve, mJeleb$e Ûej Ùee efJeMes<eleeDeeW Deewj Skeâ Deeefßele Ûej Ùee heefjCeece kesâ lejerkesâ mes keâece veneR keâj heelee~
yeerÛe mebyebOeeW keâer peeBÛe kesâ efueS Skeâ lekeâveerkeâ nw~ Fmekeâe GheÙeesie ceMeerve 7. (c)
ueefveËie ceW YeefJe<Ùe keânves Jeeuee cee@[efuebie kesâ efueS Skeâ efJeefOe kesâ ™he ceW Dee[t&FveeW Øees«eeefcebie ceW Ùee lees Fvehegš Ùee lees DeeGšhegš kesâ ™he ceW
efkeâÙee peelee nw efpemeceW efvejvlej heefjCeeceeW keâer YeefJe<ÙeJeeCeer keâjves kesâ efueS JÙeJenej keâjves kesâ efueS efveefo&° efheve keâes pinMode() keâe@evf Heâiej
Skeâ Suieesefjodce keâe GheÙeesie efkeâÙee peelee nw~ keâjlee nw~
2. (b) 8. (b)
Heâce&JesÙej mee@HeäšJesÙej DeefYeÙeeefv$ekeâ GlheeoeW SJeb Ùev$eeW hej efveÙev$eCe, NameNode HDFS Deeefke&âšskeäÛej keâe kesâvõerÙe Ieškeâ nw Ùen HeâeFue
efveiejeveer SJeb DeebkeâÌ[e Øeekeäkeâueve Øeoeve keâjlee nw~ Heâece&JesÙej Skeâ efmemšce kesâ cesše[sše keâes ØeyebefOele keâjves Deewj [sše efJeMJemeveerÙelee Deewj
Øees«eeefcebie nw~ pees ne[&JesÙej ef[JeeFme kesâ efueS Non-Volatile oes<e meefn<Ceglee ( ) megefveef§ele keâjves kesâ efueS [sše yuee@keâ keâer Øeefleke=âefle
memory efueKelee nw~ keâes mecevJeefÙele ( ) keâjves kesâ efueS efpeccesoej nw~
3. (a) NameNode cenlJehetCe& nw keäÙeeWefkeâ Ùen HeâeFue efmemšce keâer mebjÛevee
IoT kesâ DevegØeÙeesie- Deewj [sše kesâ yuee@keâ kesâ mLeeveeW keâe š^wkeâ jKelee nw, Ùen megefveef§ele
* mceeš& nsuLekesâÙej (Smart healthcare) keâjlee nw efkeâ efJeHeâueleeDeeW kesâ ceeceues ceW [sše neefve keâes jeskeâves kesâ efueS
* mceeš& Jnerkeâume (Smart vehicles) [sše keâes keâF& [sše vees[ ceW oesnjeÙee peelee nw~
* mceeš& hee@uÙetMeve kebâš^esue (Smart pollution control) 9. (a)
* mceeš& efmešer (Smart city) 'div' šwie keâes ef[efJepeve šwie kesâ veece mes Yeer peevee peelee nw Fmekeâe
* mceeš& nesce (Smart home) ØeÙeesie HTML ceW Jesye hespe kesâ kebâšWš keâes Deueie-Deueie YeeieeW ceW
mceeš&yeer[ (Smartweed) IoT keâe Skeâ DevegØeÙeesie veneR nw~ ef[JeeF[ keâjves kesâ efueS efkeâÙee peelee nw FmeceW uesheäš, jeFš leLee mesvšj
4. (a) DeueeFve Sefš^yÙetš keâe JewuÙeg pemšerHeâeF& neslee nw~
Skeâ IoT iesšJes IoT GhekeâjCeeW Deewj Skeâ kesâvõerÙe ØeCeeueer Ùee keäueeG[ 10. (c)
kesâ yeerÛe ceOÙemLe kesâ ®he ceW keâeÙe& keâjlee nw IoT iesšJes Éeje Øeoeve <embed> šwie efkeâmeer yeenjer (external mebmeeOeve kesâ efueS Skeâ
efkeâS peeves Jeeues ØecegKe keâeÙeeX ceW mes Skeâ Øeesšeskeâe@ue Symš^wkeäMeve nw~ kebâšsvej keâes heefjYeeef<ele keâjlee nw pewmes- Jesye hespe, Fcespe, ceeref[Ùee huesÙej
Fmekeâe celeueye Ùen nw efkeâ iesšJes efJeefYeVe IoT GhekeâjCeeW Éeje GheÙeesie Ùee hueie-Fve SefhuekesâMeve~
efkeâS peeves Jeeues efJeefYeVe mebÛeej Øeesšeskeâe@ue keâes Skeâ meeceevÙe Øee®he ceW
<ins> šwie Gme šskeämš keâes heefjYeeef<ele keâjlee nw efpemes efkeâmeer
DevegJeeo Deewj Devegketâefuele keâjves ceW me#ece nesvee ÛeeefnS efpemes kesâvõerÙe[ekeäÙegceWš ceW [euee ieÙee nw~ yeÇeGpej Deeceleewj hej [eues ieS šskeämš
ØeCeeueer Éeje mecePee pee mekesâ~ keâes Deb[jueeFve keâjlee nw~
5. (d) <em> šwie keâe GheÙeesie peesj efoS ieS šskeämš keâes ef[heâeFve keâjves kesâ
keâes[ [sJeuehe keâjves kesâ efueS Raspberry Pi IoT mee@]heäšJesÙej Éeje efueS efkeâÙee peelee nw~ šwie kesâ Deboj keâer kebâšsš Deeceleewj hej Fšwefuekeâ
heeFLeve Øees«eeefcebie Yee<ee keâe GheÙeesie efkeâÙee peelee nw~ heeÙeLeve keâe ceW ØeoefMe&le nesleer nw~
GheÙeesie GÛÛe mlejerÙe Deewj megueYe efmebšwkeäme kesâ keâejCe efJeefYeVe IoT <nav> šwie vesefJeiesMeve efuebkeâ kesâ Skeâ mesš keâes heefjYeeef<ele keâjlee nw~
ef[JeeFmeeW keâes Øees«eece keâjves kesâ efueS neslee nw~ 11. (b)
6. (c) vecetvee oj Ùee ØeefleÛeÙeve DeeJe=efòe (Sampling rate or Sampling
IoT ceW DDoS efmekeäÙeesefjšer Dešwkeâ keâe hetCe& ™he ‘ef[efmš^yÙetšs[ frequency) Ùee ef[efpešue mebkesâle yeveeves kesâ efueS melele mebkesâle mes efueS
[sefveÙeue Dee@Heâ meefJe&me’ neslee nw~ Ùen Skeâ Øekeâej keâe meeFyej Dešwkeâ nw ieS Øeefle meskeWâ[ vecetveeW keâer mebKÙee keâes heefjYeeef<ele keâjleer nw šeFce-[escesve
efpemeceW Skeâ meJe&j, vesšJeke&â Ùee mesJee keâes DelÙeefOekeâ š^wefheâkeâ mes Yej mebkesâleeW kesâ efueS lejbie®he keâes (Hz) Ùee Øeefle meskesâC[ Ûe›eâ ceW ceehee peelee nw~
127 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
GoenjCe kesâ efueS Ùeefo Skeâ Dee@ef[Ùees mebkesâle keâer meercee 20,000 Hz nw 21. (c)
(ceeveJeerÙe megveJeeF& keâer ueieYeie Ghejer meercee) lees vecetvee DeeJe=efòe uewve (Local Area Network-LAN) Skeâ Ssmee vesšJeke&â nw pees
(Sampling Frequency) 40,000 Hz nesleer nw~ Dehes#eeke=âle Úesšs #es$e ceW keâchÙetšj Deewj DevÙe GhekeâjCeeW keâes peesÌ[lee nw~
LAN mes pegÌ[s ngS keâchÙetšj mes peevekeâejer Je heefjOeerÙe GhekeâjCe keâes
12. (a)
efJeb[espe ceeref[Ùee Dee@ef[Ùees (WMA) ceeF›eâesmee@Heäš Éeje efJekeâefmele meePee keâj mekeâles nQ~
22. (d)
Dee@ef[ÙeeW keâes[skeäme Deewj Gmemes mebyebefOele Dee@ef[ÙeeW keâesef[bie Øee™heeW keâer
efJekeâuhe (d) šdefJemšs[ hesÙej kesâyeue kesâ yeejs ceW mener veneR nw keäÙeeWefkeâ
Skeâ ëe=bKeuee nw, WMA keâer heefjkeâuhevee ueeskeâefØeÙe MP3 Deewj Real kesâyeue šsueerefJepeve, mecee#eerÙe (coaxial) kesâyeueeW kesâ ceeOÙece mes
Audio keâes[skeâ kesâ ™he ceW keâer ieF& Leer, pees GÛÛe efjpee@uÙetMeve Øemeeefjle jsef[ÙeeW øeâerkeäJeWmeer (RF) mebkesâleeW kesâ ceeOÙece mes GheYeesòeâeDeeW kesâ
Dee@ef[Ùees keâe meceLe&ve keâjlee nw~ šsueerefJepeve Øees«eece Øeoeve keâjves keâer Skeâ ØeCeeueer nw~
13. (a) 23. (d)
Yeejle ceW F&-ieJeveXme kesâ keâchÙetšjeFpesMeve ÛejCe ceW DeefOekeâebMe mejkeâejer efmeiveueeW keâe JeeÙejuesme š^ebmeefceMeve efvecve Øekeâej mes efkeâÙee pee mekeâlee
keâeÙee&ueÙe keâchÙetšj mes megmeefppele Les Deewj keâchÙetšj keâe GheÙeesie Je[& nw–
Øeesmesefmebie kesâ meeLe Meg™ ngDee, Fmekesâ legjble yeeo [sše Øeesmesefmebie ngF&~ 1. jsef[Ùees JesJe 2. ceeF›eâesJesJe 3. Fbøeâejs[
14. (b) 24. (a)
hespe Dee@ypeskeäš keâer hespe Øee@hešea, hespeeW Deewj uesDeeGš hespeeW kesâ yeerÛe ef[efpešue meyme›eâeFyej ueeFve keâveskeäMeve heâesve ueeFveeW keâe GheÙeesie
meePee efkeâÙes ieS [sše lekeâ Øee@hešea pewmeer hengBÛe Øeoeve keâjleer nw~ Deehe keâjlee nw pees Sveeuee@ie efmeiveue kesâ yepeeÙe ef[efpešue efmeiveue keâe
GheÙeesie keâjles nQ~ ef[efpešue meyme›eâeFyej ueeFve ([erSmeSue) neF&-
hespe Øee@hešea ceW Deheveer Kego keâer Øee@hešea keâe Fmlesceeue (peesÌ[) keâj mekeâles
nw~ mheer[ Fbšjvesš keâveskeäMeve nw~ pees ceevekeâ šsueerheâesve ueeFve keâe GheÙeesie
15. (d)
keâjles nQ Ùes ueeFves kesâJeue OJeefve mebkesâleeW kesâ efueS efJekeâefmele keâer ieF& Leer
kesye yeÇeGÌpej Skeâ SefhuekesâMeve nw efpemekeâe GheÙeesie kesyemeeFšeW keâes yeQ[efJe[dLe Deewj [sše oj ceW ØeefleyebeOf ele nw~
vesefkeiesš keâjves Deewj Gve lekeâ hengbÛeves kesâ efueS efkeâÙee peelee nw~ 25. (a)
efvecveefueefKele kesye yeÇeGÌpej kesâ GoenjCe nQ - ceesefÌpeuee ÌHeâeÙejÌHeâe@keäme, šer[erSce ceW muee@š keâes øesâcme ceW efJeYeeefpele efkeâÙee pee mekeâlee nw~
Deeshesje, ietieue ›eâesce, meheâejer, ceeF›eâesmee@heäš Spe Deewj Fbšjvesš šer[erSce šeFce ef[efJepeve ceušerhuesefkeämebie keâe mebef#ehle ¤he nw~ Ùen keâF&
Skeämehueesjj Deeefo~ FveceW mes ›eâesce meyemes lesÌpe kesye yeÇeGÌpej nw~ efvecve oj ÛewveueeW keâes Skeâ GÛÛe oj Ûewveue ceW mebÙeesefpele keâjves keâer
16. (b)
lekeâveerkeâ nw~ Skeâ efveefMÛele meceÙe muee@š kesâ efueS keâF& Ûewveue
DeefOekeâlece yeQ[efJe[dLe keâe GheÙeesie keâj mekeâles nQ~
keâchÙetšj vesšJeke&â ceW jeGšj keâe ØeeLeefcekeâ keâeÙe&, keâF& vesšJeke&â keâes Skeâ
26. (b)
meeLe peesÌ[vee nw~ jeGšj efJeefYeVe vesšJekeâeX keâes peesÌ[lee nw Deewj [sše
Fbšjvesš kebâš^esue cewmespe Øeesšeskeâe@ue (ICMP) Skeâ cenlJehetCe& Øeesšeskeâe@ue nw
hewkesâšdme keâes Skeâ vesšJeke&â mes otmejs vesšJeke&â lekeâ ieeF[ keâjlee nw~ pees Fbšjvesš Øeesšeskeâe@ue (IP) vesšJeke&â ceW $egešf Deewj efveÙeb$eCe meboMs eeW keâes
17. (d) Øemeeefjle keâjves kesâ efueS GheÙeesie efkeâÙee peelee nw~
Skeâ cewkeâ S[^sme ceW 48 efyešdme nesles nQ, efpevnW Deeceleewj hej 12
efoÙes ieÙes efJekeâuheeW ceW mes ‘‘Fvkeâjskeäš heeLe šeFhe 6’’ ICMP mebosMe
nskeämee[sefmeceue DebkeâeW (0 mes 9, a mes f, A mes F) keâer Skeâ efmš^bie kesâ
keâe Skeâ ceevÙe Øekeâej veneR nw~ ICMP mebosMeeW kesâ Øekeâej 0 mes 18
™he ceW oMee&Ùee peelee nw~ FvnW Dekeämej keâesueve Ùee [wMe Éeje Deueie
lekeâ nesles nw~ šeFhe 6 Skeâ Deejef#ele Øekeâej nw~ Deewj Fmekeâe GheÙeesie
efkeâS ieS peesÌ[s ceW yeebše peelee nw~
efkeâmeer Yeer ICMP mebosMe kesâ efueS veneR efkeâÙee peelee nw~
18. (b)
27. (b)
4G vesšJeke&â šskeäveesuee@peer ceW LTE (uee@vie šce& FJeesuÙetMeve) JeeÙejuesme
šsyeue keâer Skeâ efmebieue hebefòeâ, efpemeceW Gmemes mecyeefvOele Skeâ efjkeâe@[& neslee
ceevekeâ GheÙeesie efkeâÙee peelee nw~ pees 3G keâer leguevee ceW mesueheâesve Deewj
nw, šheue keânueelee nw~ efjuesMeveue [sšeyesme efmemšce ceW šheume keâe Skeâ
DevÙe mesueguej GhekeâjCeeW kesâ efueS yeÌ{er ngF& vesšJeke&â #ecelee Deewj ieefle
heefjefcele (finite) mesš efjuesMeve FbmšWme keâe ØeefleefveefOelJe keâjlee nw~
Øeoeve keâjlee nw~
efjuesMeve FbmšWme ceW [gefhuekesâš šheume veneR nesles nQ~
19. (d)
28. (c)
IPv6 Skeâ Fbšjvesš Øeesšeskeâe@ue nw pees Fbšjvesš hej ef[JeeFmeeW keâes
DCL keâceeb[ keâe GheÙeesie keâF& Ùetpej [sšeyesme FvJeeÙejceWš ceW [sšeyesme
henÛeeveves kesâ efueS GheÙeesie efkeâÙee peelee nw~ IPv6 S[^sme keâer uecyeeF&
megj#ee keâes ueeiet keâjves kesâ efueS efkeâÙee peelee nw~ Ùen oes Øekeâej kesâ
128-efyešdme nesleer nw~ peyeefkeâ IPv4 S[^sme keâer uecyeeF& 32-efyešdme
DCL keâceeb[ GRANT Deewj REVOKE nw~ REVOKE keâceeb[
nesleer nw~ IPv6 S[^sme kesâ ™he ceW Deeceleewj hej nskeämee[sefmeceue Øee™he
[sšeyesme Dee@ypeskeäš kesâ efueS GheÙeesiekeâlee& Skeämesme DeefOekeâej Ùee
keâe GheÙeesie efkeâÙee peelee nw~
efJeMes<eeefOekeâej nše oslee nw~
20. (a)
Syntax: -
yuetštLe Skeâ efvecve heeJej, ueeskeâue SefjÙee JeeÙejuesme mebÛeej lekeâveerkeâ REVOKE Privilege - name
nw~ Fmekeâe Fmlesceeue mceeš&heâesve, uewheše@he, šwyeuesš, efØebšj, kewâceje On Object - name
ef[JeeFmeeW ceW, [sše keâes š^e@vmeheâj keâjves kesâ efueS efkeâÙee peelee nw~ From {user - name |PUBLIC| role - name}

128 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
29. (d) 38. (d)
Flat File [sšeyesme ceW, meeos hee"Ÿe (Plain Text) HeâeFue keâer ØelÙeskeâ Skeâ š^er efpemeceW ØelÙeskeâ vees[ ceW efyeukegâue MetvÙe Ùee oes efÛeu[^sve nesles nw,
hebefòeâ ceW kesâJeue Skeâ efjkeâe[& neslee nw~ Fve efjkeâe[dme& keâes šwye Ùee hetCe& yeeFvejer š^er keânueelee nw~
DeuheefJejece (Comma) pewmes- meerceebkeâkeâ keâe GheÙeesie keâjkesâ Deueie
efkeâÙee peelee nw~
30. (b)
[sšeyesme mes šsyeue keâes nševes kesâ efueS SQL ceW DROP veecekeâ
keâceeb[ keâe ØeÙeesie efkeâÙee peelee nw~ Fme keâceeb[ keâer ceoo mes Deehe Skeâ
šsyeue keâes mLeeÙeer ™he mes nše mekeâles nw~ Fme keâceeb[ keâe GheÙeesie
keâjves mes šsyeue Deewj Gmekesâ [sše hetjer lejn mes nš peeleer nw, Deewj Fmes
Jeeheme veneR ueeÙee pee mekeâlee nw pewmes- Full Binary Tree
DROP Table Table_name; 39. (b)
ÙeneB table_name Jen šsyeue nw efpemes Deehe nševee Ûeenles nw~ mebbyebOehejkeâ mebkeâejkeâ (Relational operator) keâe GheÙeesie efJeefYeVe
31. (a) mebkeâeÙeeW kesâ yeerÛe leguevee keâjves kesâ efueS efkeâÙee peelee nw~ pewmes
Primary key [sšeyesme šsyeue ceW Heâeru[ Ùee Heâeru[ keâe mebÙeespeve nw mebKÙeelcekeâ meceevelee (5 = 5) leLee Deemeceevelee (4 ≥ 3) Meeefceue nw~
pees šsyeue ceW ØelÙeskeâ efjkeâe[& keâes efJeefMe° ™he mes henÛeeveleer nw~ Ùen 40. (a)
megefveef§ele keâjlee nw efkeâ šsyeue ceW ØelÙeskeâ hebefòeâ ceW ØeeLeefcekeâ kegbâpeer kesâ peye nce Skeâ Keeueer keäÙet ceW Skeâ Ssmes SefueceWš keâes meÛe& keâjles nw pees
Jeneb hej GheefmLele veneR nw lees Ssmee nesves hej DeeGšhegš ‘Deb[jheäuees’
efueS Skeâ Deueie Deewj iewj-MetvÙe ceeve nw; pees [sše Fbšeref«ešer keâes
efØebš nesiee~
yeveeS jKeves ceW ceoo keâjlee nw~ Skeâ šsyeue ceW kesâJeue Skeâ ner
41. (a)
ØeeLeefcekeâ kegbâpeer nes mekeâleer nw~ C Skeâ Øekeâej keâer GÛÛe mlejerÙe Øees«eeefcebie Yee<ee nw, peyeefkeâ Ruby,
32. (a)
VB.Net Deewj C++ Dee@ypeskeäš DeesefjSbš[ s ueQiJespe nw~
heeFLeve Skeâ GÛÛe mlejerÙe, Deeypeskeäš DeesefjSbšs[ Deesheve meesme& Deewj
42. (d)
Interpreted Øees«eeefcebie Yee<ee nw~ Ùen Skeâ General purpose
Øees«eeefcebie ceW hebâkeäMeve vesce, hewjeceeršj efuemš efjšve& šeFhe Ùes meYeer
language nw, efpemekeâe GheÙeesie application development Deewj
hebâkeäMeve ns[j kesâ Yeeie nw~
software development ceW efkeâÙee peelee nw~
43. (a)
33. (a) CSS DeeF&[er mesueskeäšj Skeâ efkeMes<e DeefÉleerÙe SefueceWš efveefo&<š keâjlee
SQL ceW GROUP BY keäuee@pe keâe GheÙeesie keâjkesâ [sše keâes nw peyeefkeâ CSS keäueeme mesueskeäšme& keâe GheÙeesie Sefuecesšdme kesâ mecetn
mecetnerke=âle keâjves kesâ yeeo, keäuee@pe keâe GheÙeesie efJeefMe° efmLeefleÙeeW kesâ keâes efveefo&<š keâjves kesâ efueS efkeâÙee peelee nw~ CSS keâes HTML
DeeOeej hej mecetneW keâes efHeâušj keâjves kesâ efueS efkeâÙee peelee nw~ Ùen [e@keäÙetceWš ceW 3 lejerkeâeW mes peesÌ[e pee mekeâlee nw:
mece«e keâeÙeeX kesâ GheÙeesie keâer Devegceefle oslee nw Deewj kesâJeue Gve mecetneW
Inline - HTML SefueceWš kesâ Deboj mšeFue efkeMes<elee keâe
keâe ÛeÙeve keâjlee nw pees efoS ieS ceeveob[eW keâes hetje keâjles nQ~
GheÙeesie keâjkesâ~
34. (c)
Internal- <heads> DevegYeeie ceW <style> SefueceWš keâe
efJeefYevve Øekeâej kesâ [sše yesme šeFhe–
1. Centralized 2. Distributed
GheÙees ie keâjkesâ~
3. Relational 4. NOSQL External- Skeämešve&ue CSS ÌHeâeFue mes efuebkeâ keâjves kesâ efueS
5. Cloud 6. Object Oriented <link> SefueceWš keâe GheÙeesie keâjkesâ~
7. Hierarchical 8. Network DeleŠ meYeer keâLeve melÙe nQ~
35. (a) 44. (b)
[sšeyesme ceW [sše keâes jes (Row) Deewj keâe@uece (Column) kesâ ™he ceW CSS øesâceJeke&â CSS efveÙeceeW Deewj mšeFue keâe Skeâ hetCe&-ef[peeFve
mšesj efkeâÙee peelee nw~ efkeâÙee ieÙee mesš nw efpemekeâe GheÙeesie Jesye hespeeW keâes mšeFue keâjves keâer
36. (d) Øeef›eâÙee keâes lespe Deewj ceevekeâerke=âle keâjves kesâ efueS keâj mekeâles nw~ Fmekeâe
ASP.NET ceeF›eâesmee@heäš keâcheveer Éeje ef[peeFve leLee efJekeâefmele efkeâÙee GheÙeesie S[Jeebm[ efJepegDeue SefueceWšdme kesâ efueS efkeâÙee peelee nw~ Ùen
ieÙee Skeâ Jesye øesâceJeke&â nw, pees HTML, CSS Deewj JavaScript Ùetpej Fbšjhesâme (UI) kesâ lJeefjle efvecee&Ce ceW meneÙelee keâjlee nw~
keâe Skeâ DeÛÚe SkeâerkeâjCe Øeoeve keâjlee nw~ Dele: keâLeve (i) leLee (ii) ueeskeâefØeÙe CSS øesâceJeke&â ceW yetšmš^whe (Bootstrap), Foundation.
oesveeW melÙe nw~ Deewj Bulma Meeefceue nw~
37. (b) 45. (d)
VB.NET Skeâ Deeypeskeäš DeesefjSbšs[ Yee<ee nw, efpemecebs "double" C++ ceW kebâmeesue mes Skeâue JeCe& keâes heÌ{ves kesâ efueS get() HebâkeäMeve keâe
[eše Øekeâej keâes 8 yeeFš keâe mšesjspe SueeskesâMeve Øeoeve efkeâÙee GheÙeesie efkeâÙee peelee nw, peyeefkeâ DevÙe keâe GheÙeesie SkeâeefOekeâ JeCeeX keâes
peelee nw~ heÌ{ves kesâ efueS efkeâÙee peelee nw~
129 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
46. (c) (i) JesefjSyeue veece kesâJeue De#ej (a-z, A-Z) Debkeâ (0-9), Deewj
yee@šce-Dehe Âef°keâesCe Skeâ Øees«eeefcebie heæefle nw peneB Øees«eece keâe efJekeâeme Deb[jmkeâesj (–) mes yevee nes mekeâlee nw~
efveÛeues mlej kesâ cee@[dÙetue kesâ keâeÙee&vJeÙeve kesâ meeLe Meg¤ neslee nw Deewj (ii) JesefjSyeue veece efkeâmeer Yeer De#ej Deewj Deb[jmkeâesj mes Meg™ nes
Oeerjs-Oeerjs GÛÛe mlejerÙe cee@[dÙetue lekeâ yevelee nw~ Fme Âef°keâesCe ceW mekeâlee nw, uesefkeâve efkeâmeer mhesme Ùee efJeMes<e JeCe& Ùee Debkeâ mes
JÙeefkeäleiele IeškeâeW Ùee keâeÙeeX keâes efJekeâefmele keâjves Deewj efHeâj GvnW Skeâ Meg™ veneR nes mekeâlee nw~
mebhetCe& keâeÙe&›eâce yeveeves kesâ efueS Skeâerke=âle keâjves hej OÙeeve keWâefõle efkeâÙee (iii) JesefjSyeue veece kesâme meWefmeefšJe nesles nw, lees Skeâ JesefjSyeue kesâ
peelee nw~ Úesšs Deewj yeÌ[s De#ejeW keâe celeueye neslee nw~
47. (d) 57. (b)
mšwkeâ, Ssjs Deewj keäÙet meYeer jwefKekeâ [sše mebjÛeveeS nw~ iewj jwefKekeâ Ssjs lelJeeW keâes meceeve šeFhe keâer cesceesjer kesâ Skeâ meefvveefnle yuee@keâ ceW
mecyevOeeW ceW [sše mebjÛevee kesâ GoenjCe pewmes efkeâ š^er Deewj «eeHeâ nesles nw~ meb«enerle keâjlee nw~ FmeefueS nce keân mekeâles nQ efkeâ Ssjs Skeâ kebâšsvej nw,
48. (b) pees meceeve šeFhe kesâ lelJeeW keâes meb«enerle keâjlee nw~
C++ ceW efoÙee ieÙee keâes[ Keb[- 58. (d)
int *ptr = NULL; Shuesš Fvšjvesš keâchÙetefšbie cebs ØeÙeesie efkeâS peeves Jeeues Úesšs-Úesšs Øees«eece
delete ptr; nesles nw~ Fve Øees«eeceeW keâes Skeâ keâchÙetšj mes otmejs keâchÙetšj cebs Fvšjvesš
efoS ieS keâes[ ceW keâesF& Yeer $egefš ve nesves keâer Jepen mes Øees«eece keâes hej š^ebmeheesš& efkeâÙee pee mekeâlee nw~ Shuesš yÙetDej Ùee efkeâmeer peeJee Fvesyeue
meHeâueleehetJe&keâ keâcheeFue Deewj efve<heeefole efkeâÙee peelee nw~ Jesye yeÇeGpej Éeje jve efkeâÙee pee mekeâlee nw~
49. (b) 59. (a)
FvensefjšWme Øees«eecej keâes henues efueKes ieS keâes[ keâes hegve: GheÙeesie keâjves JeeÙejme, š^espeve ne@mexpe Deewj Jee@ce& ogYee&JeveehetCe& mee@heäšJesÙej nQ efpevekeâe
keâer Devegceefle oslee nw~ FmeefueS Fmekesâ GheÙeesie mes yeej-yeej keâes[ GheÙeesie keâchÙetšj efmemšce keâes vegkeâmeeve henBgÛeeves kesâ efueS efkeâÙee peelee
efueKeves keâer DeeJeMÙekeâlee veneR nesleer nw~ nw~ š^espeve ne@me& Skeâ Ssmee Øees«eece nw pees nceueeJej keâes otjmLe mLeeve mes
50. (c) Ùetpej kesâ keâchÙetšj keâes efveÙeefv$ele keâjves keâer Devegceefle oslee nw~
FbšjØesšj meeheäšJesÙej GÛÛe mlejerÙe Yee<ee ceW lewÙeej efkeâS ieS Øeesieece keâes 60. (d)
ceMeerveer Yee<ee ceW heefjJeefle&le keâj Gmes ef›eâÙeebefJele keâjlee nw~ Skeâ [sšeyesme efmemšce ceW, Skeâ kesâvõerÙeke=âle [sšeyesme Deewj [eryeerSceSme
51. (b) Éeje [sše kesâ kesâvõerke=âle efveÙeb$eCe mes [sše kesâ DeveeJeMÙekeâ oesnjeJe mes
OLE keâe hetCe& ™he ‘Deeypeskeäš efuebefkebâie Deewj Fcyesef[bie’ nw~ OLE yeÛee peelee nw~
Skeâ ceeF›eâesmee@heäš keâer [e@keäšÙetceWš kebâheesveWš šskeäveesuee@peer nw~ efpemeceW [sše keâer mJeleb$elee (data independence) :- [sšeyesme efmemšce ceW,
Skeâ mes DeefOekeâ [e@keäÙegceWš leLee ShueerkesâMeve keâes Skeâ meeLe efuebkeâ efkeâÙee [sšeyesme ØeyebOeve ØeCeeueer SefhuekesâMeve Øees«eece Deewj [sše kesâ yeerÛe
peelee nw~ Fbšjhesâme Øeoeve keâjleer nw~
52. (a)
61. (d)
leerj (Arrow), heäueesÛeeš& ceW ØeleerkeâeW keâes peesÌ[les nw, jer[j keâes Øeef›eâÙee WinZip Deewj WinRAR Skeâ Øekeâej keâe Ùetefšefuešer meeheäšJesÙej
ÛejCeeW (Process steps) kesâ efmekeäJeWMe kesâ ceeOÙece mes ieeF[ keâjlee nw~ nw efpevekeâe GheÙeesie heâeFue kebâØesMeve štume kesâ ™he ceW keâjles nQ~
53. (b)
62. (d)
keâchÙetšj keâes[ Ùee Øees«eece keâes[ Skeâ keâchÙetšj Øees«eece yeveeves Jeeues mheeF&JesÙej Skeâ ogYee&Jevee hetCe& mee@heäšJesÙej neslee nw pees keâchÙetšj keâer
efveoxMeeW keâe mecetn nw, efpemes keâchÙetšj Éeje efve<heeefole efkeâÙee peelee nw~ peevekeâejer Skeâ$e keâjlee nw Deewj Fmes cewve-Fve-o-efceef[ue keâes mebÛeeefjle
54. (d) keâjlee nw~
HebâkeäMeve-DeesJejueesef[bie HebâkeäMeve JeemleJe ceW efJeefYeVe keâeÙeeX keâe Skeâ 63. (d)
mesš nw pees Skeâ ner veece kesâ efJeefYeVe keâeÙeeX keâes efve<heeefole keâjves kesâ keâcheeFuej Jen Øees«eece neslee nw pees GÛÛe mlejerÙe Yee<ee cebs efueKes keâes[
efueS GheÙeesie efkeâÙee peelee nw~ pewmes- keâes ceMeerveer Yee<ee cebs Skeâ yeej cebs ner efvemheeefole keâj oslee nw~
void myFun ( )
64. (c)
void myFun (int a)
void myFun (int a, int b)
[s[uee@keâ Skeâ Ssmeer efmLeefle nw efpemeceW ceušer Øees«eeefcebie JeeleeJejCe ceW
55. (c) keâF& Øeef›eâÙeeSB meerefcele mebKÙee ceW mebmeeOeveeW kesâ efueS ØeeflemheOee& keâj
Suieesefjodce kesâ leke&â Megæ efJeJejCe, efJeefMe° efveÙece Deewj MeyoeW ceW mekeâleer nw~ Ùeefo keâesF& Øeef›eâÙee mebmeeOeveeW kesâ efueS DevegjesOe keâjleer nw
JeekeäÙeefJevÙeeme (Syntax) ceW meceefJe° nw~ Deeceleewj hej Skeâ Deewj Gme meceÙe mebmeeOeve GheueyOe veneR nesles nw lees Øeef›eâÙee Øeleer#ee keâer
JeekeäÙeefJevÙeeme ceW efJeefMe° efveÙece Deewj Meyo nesles nQ pees Skeâ efmLeefle ceW ØeJesMe keâjleer nw~ keâYeer-keâYeer Ùen Øeleer#ee Øeef›eâÙee keâYeer Yeer
Suieesefjodce ceW leeefke&âkeâ ÛejCeeW keâes JÙeòeâ keâjles nQ~ JeekeäÙeefJevÙeeme Skeâ DeJemLee keâes yeoueves ceW me#ece veneR nesleer nw~
Yee<ee-keâLeve ceW lelJeeW keâe JÙeekeâjCe, mebjÛevee Ùee ›eâce nw~ 65. (d)
56. (b) ceušeršeefmkebâie efmemšce Skeâ Ssmee kebâhÙetšj efmemšce neslee nw pees Skeâ
Øees«eeefcebie Yee<eeDeeW ceW Skeâ ceevÙe JesefjSyeue veece kesâ efueS efvecveefueefKele meceÙe ceW Skeâ mes DeefOekeâ Ùetpej keâes Skeâ meeLe keâF& Deueie-Deueie
efveÙeceeW keâe heeueve keâjvee ÛeeefnS- šemkeâ keâes hetje keâjves keâer Devegceefle oslee nw~
130 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
66. (b) 1. 53 mes 98 (98-53 = 45)
BIOS, yesefmekeâ Fvehegš DeeGš efmemšce mebef#ehle ™he nw~ Fmekeâe 2. 98 mes 183 (183 – 98 = 85)
GheÙeesie yegefšbie Øeef›eâÙee kesâ meceÙe ne[&JesÙej FefveefMeueeFpesMeve keâjves kesâ 3. 183 mes 37 (183 – 37 = 146)
efueS efkeâÙee peelee nw~
4. 37 mes 122 (122 – 37 = 85)
67. (c)
«eeefheâkeâue meJe&j (Graphical server) efuevekeäme Dee@hejsefšbie efmemšce 5. 122 mes 14 (122 – 14 = 108)
(Linux operating system) keâe meye efmemšce nw pees cee@efvešj hej 6. 14 mes 124 (124 – 14 = 110)
«eeefheâkeäme keâes ØeoefMe&le keâjlee nw Ùen Jen mee@heäšJesÙej nw pees efveÙebef$ele 7. 124 mes 65 (124 – 65 = 59)
keâjlee nw efkeâ keâchÙetšj hej «eeefheâkeäme kewâmes ØeoefMe&le nesles nQ «eeefheâkeâue 8. 65 mes 67 (67– 65 = 2)
meJe&j kesâ efyevee Ùetpej kesâJeue keâceeb[-ueeFve Fbšjhesâme kesâ ceeOÙece mes meYeer cetJeceWšdme keâes peesÌ[les nw-
efuevekeäme efmemšce kesâ meeLe Fbšjwkeäš keâj mekeâlee nw~ Fmes Deeceleewj hej 45+85+146+85+108+110+59+2 = 640
X meJe&j kesâ ™he ceW meboefYe&le efkeâÙee peelee nw~ FmeefueS ns[ cetJeceWš keâer kegâue mebKÙee 640 nw~
68. (d) 74. (b)
mesceeheâesj Skeâ Fefvšpej JesefjSyeue neslee nw efpemekeâe GheÙeesie HDMI keâe hetCe& ™he neF& [sheâerefveMeve ceušerceeref[Ùee Fbšjhesâme nw~
ef›eâefškeâue meskeäMeve keâer mecemÙee keâe nue ‘‘Øeleer#ee’’ Deewj HDMI 1 Dee@ef[ÙeeW leLee 1 Jeeref[ÙeeW mš^ercme keâes nQ[ue keâjlee nw~
‘‘efmeiveue’’ (oes hejceeCeg mebÛeeueve) keâe GheÙeesie keâjkesâ efkeâÙee peelee 75. (c)
nw~ mesceeheâesj keâe GheÙeesie Øeef›eâÙee efmeb›eâesveeFpesMeve kesâ efueS efkeâÙee Ùen mkewâvej leLee efJeMes<e mee@heäšJesÙej keâe meceeÙeespeve nw pees efØebšsš [sše
peelee nw~
Ùee nmleefueefKele [sše keâes ASCII ceW ™heevleefjle keâj oslee nw~ Fmekeâe
69. (a)
GheÙeesie keâeiepeer efjkeâe[& keâes Electric Filling leLee mkewâve Ûeeueeve keâes
keâeWefškeâer (Contiki) Skeâ Deesheve-meesme& Dee@hejsefšbie efmemšce nw efpemes
mebmeeOeve-yeeefOele Fbšjvesš Dee@heâ efLebime (IoT) GhekeâjCeeW kesâ efueS mØes[ Meerš ceW heefjJeefle&le keâjlee nw~
ef[peeFve efkeâÙee ieÙee nw~ keâeWefškeâer keâe GheÙeesie Dekeämej efJeefYeVe IoT 76. (a)
SefhuekesâMeve ceW efkeâÙee peelee nw, pewmes mceeš& nesce ef[JeeFme, meWmej uespej keâe GheÙeesie CD Deewj DVD Drive ceW neslee nw, pees keâchÙetšj
vesšJeke&â Deewj DeewÅeesefiekeâ mJeÛeeueve~ mes [sše heÌ{ves Deewj efueKeves kesâ efueS mLeeveerÙe ef[mkeâ kesâ meeLe efkeâÙee
70. (a) peelee nw~
LeÇs[ (Thread) Skeâ nukeâer Øeef›eâÙee (ueeFšJesš Øeesmesme) nw pees mJeleb$e 77. (d)
™he mes Ùee efkeâmeer yeÌ[er Øeef›eâÙee kesâ Yeeie kesâ ™he ceW Ûeue mekeâleer nw~ IBM-360 meerjerpe Skeâ cesve øesâce keâchÙetšme& keâer meerjerpe nQ pees 1960
LeÇs[dme keâes Skeâ ner Øeef›eâÙee kesâ mebmeeOeveeW keâes meePee keâjves kesâ efueS kesâ oMekeâ kesâ ceOÙe ueeBÛe efkeâÙes ieÙes nQ~ Ùes keâchÙetšj kesâ leermejer heerÌ{er
ef[peeFve efkeâÙee ieÙee nw, efpememes Jes nukesâ nesles nQ Deewj lespeer mes efmJeÛe kesâ Devleie&le Deeles nQ~
keâj mekeâles nQ~ 78. (d)
71. (a) keâchÙetšj keâe yegevf eÙeeoer Deeefke&âšskeäÛej keâe efvecee&Ce pee@ve Jee@ve vÙetcewve
[erceve efkeâmeer efmemšce keâe efvejblej meef›eâÙe efmemšce Øees«eece nw~ Ùen (John Von Neumann) ves efkeâÙee Lee~ Ùen Deeefke&âšskeäÛej Skeâ
efkeâmeer yengGösMeerÙe keâchÙetšj keâe Deehejsefšbie efmemšce Ùee keâchÙetšj mšesj[& Øees«eece DeJeOeejCee hej DeeOeeefjle nw efpemeceW Øees«eece Deewj [sše
Øees«eece neslee nw pees efkeâmeer ØeÙeesòeâe kesâ meerOes efveÙev$eCe ceW jnves kesâ keâes Skeâ Deueie mšesjspe Ùetefveš ceW meb«eefnle efkeâÙee peelee nw efpemes cesceesjer
yepeeÙe yeQkeâ«eeGC[ Øee@mesme (he=‰Yetefce Øeef›eâÙee) kesâ ™he ceW Ûeuelee jnlee keânles nQ~ kebâš^esue Ùetefveš meerheerÙet kesâ Devoj ner ueiee neslee nw pees S
nw~ [erceve F& JesÙej ieefleefJeefOe kesâ efueS Øeefleef›eâÙee osves kesâ meeLe-meeLe Sue Ùet, jefpemšj Deeefo keâes efveÙebef$ele keâjlee nw~
efkeâmeer vesšJeke&â hej DevÙe keâchÙetšjeW mes meceeÙeespeve mLeeefhele keâjves ceW
meneÙelee keâjlee nw~
72. (a)
mebmeeOeve DeeJebšve efmLeefle (Resource allocation state) keâe
GheÙeesie henues mes GheueyOe Deewj Jele&ceeve mebmeeOeveeW keâer GheueyOelee
yeveeS jKeves kesâ efueS efkeâÙee peelee nw~ Skeâ [s[uee@keâ DeJeeF[Wme
SuieesefjLece [eÙevesefcekeâueer ™he mes Ùen megefveef§ele keâjves kesâ efueS
mebmeeOeve DeeJebšve efmLeefle keâer peeBÛe keâjlee nw efkeâ Skeâ heefjhe$e Øeleer#ee
efmLeefle keâYeer ceewpeto veneR nes mekeâleer nw~
73. (a)
FCFS (henues DeeDees henues heeDees) Mes[Ÿeefuebie ceW ef[mkeâ ns[ DevegjesOeeW
keâes Gvekeâer Øeeefhle keâer ›eâce ceW mebmeeefOele keâjlee nw~ Ùeefo ef[mkeâ ns[
Meg™ ceW 53 hej nw Deewj DevegjesOe Fme ›eâce ceW nw- 98, 183, 37,
122, 14, 124, 65, 67 lees ns[ cetJeceWš keâer kegâue mebKÙee
efvekeâeueves kesâ efueS efvecve keâer ieCevee keâjW~ keâchÙetšj (meerheerÙet) keâer mebjÛevee
131 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
79. (b) DeLe&cewefškeâ uee@efpekeâ Ùetefveš (ALU): Ùen ieefCeleerÙe Deewj leeefke&âkeâ
meQkeâÌ[eW Deewj npeejeW ØeÙeesòeâeDeeW nsleg menkeâeefuekeâ ™he mes mebmeeefOele ef›eâÙeeSb keâjlee nw~
DeeBkeâÌ[eW mes me#ece ‘‘cesveøesâce keâbhÙetšj’ Skeâ yeÌ[s Deekeâej Deewj keâerceleer jefpemšj (Registers): Ùes DemLeeÙeer ¤he mes [eše Deewj efveoxMeeW
kebâhÙetšj nw~ Fme keâchÙetšj ceW 32 Ùee 64 efyeš ceeF›eâes Øeesmesmej keâe keâes mšesj keâjlee nw~
ØeÙeesie efkeâÙee peelee nw~ •
cesceesjer Ùetefveš (Memory Unit) Ùen [eše keâes DemLeeÙeer (pewmes
80. (d) RAM ) Ùee mLeeÙeer (pewmes HDD/SSD) ¤he ceW meb«eefnle keâjleer nw~
ef[efpešue efmemšce mebÛeej kesâ efueS ef[efpešue efmeiveue keâe GheÙeesie keâjles • DeeGšhegš Ùetefveš (Output unit): Ùen Øeesmesme efkeâS ieS [eše keâes
nw Sveeuee@ie efmeiveue keâe veneR~ ef[efpešue efmemšce Demelele Jeesušspe heefjCeece kesâ ¤he ceW ØeoefMe&le keâjleer nw~
mlejeW (Deeceleewj hej oes mlej 0 Deewj 1) keâe GheÙeesie keâjkesâ peevekeâejer 87. (b)
mebmeeefOele keâjles nw, efvejblej Jeesušspe mlejeW keâe veneR~ Mb (megabit) - Ùen Fbšjvesš mheer[ keâes oMee&lee nw pewmes-
ef[efpešue efmemšce GÛÛe ieefle kesâ mebÛeeueve kesâ efueS GheÙegòeâ nw, pees Megabit per second
Sveeuee@ie efmemšce hej Gvekesâ ØecegKe ueeYeeW ceW mes Skeâ nw~ MB (Megabyte) - Ùen cesceesjer keâes oMee&leer nw~
81. (c) 1 Byte = 8 bit
ALU (DeLe&cesefškeâ uee@efpekeâ Ùetefveš) kebâhÙetšj Øeesmesmej keâe Skeâ 88. (a)
cenlJehetCe& Ieškeâ nw pees DebkeâieefCeleerÙe ieCeveeSB (pewmes, peesÌ[, Ieševee,meskeâC[jer cesceesjer, Øees«eeceeW Deewj [sše kesâ efueS oerIe&keâeefuekeâ mšesj nw
iegCee, Yeeie) Deewj leeefke&âkeâ mebef›eâÙeeSB (pewmes-AND, OR, NOT) peyeefkeâ cegKÙe cesceesjer Jele&ceeve ceW GheÙeesie ceW Deeves Jeeues Øees«eece Deewj
[sše jKeleer nw~ Ùen efHeâefpekeâue DeeiexveeFpesMeve kesâ Devleie&le Deelee nw~
keâjlee nw~ Ùen CPU kesâ Yeerlej Jeess Yeeie nw pees [sše Øeesmesefmebie kesâ efueS
cegKÙe ™he mes efpeccesoej neslee nw~ efHeâefpekeâue DeeiexveeFpesMeve ceW [sše efyešdme keâes cesceesjer kesâ efJeefYeVe Keb[eW
ceW kewâmes mšesj efkeâÙee peelee nw, Gvekesâ S[^sme kewâmes jKes peeles nw, Deewj
82. (b)
CPU Éeje mebheeefole efkeâÙes peeves Jeeues Ûeej keâeÙe& ›eâceMe: Øeehle keâjvee,
GvnW kewâmes Skeämesme efkeâÙee peelee nw, Ùes meYeer efJeefMe° lejerkeâeW mes
efveOee&efjle efkeâÙee peelee nw~
mhe° keâjvee, kegâMeue-heefjJele&ve leLee heefjCeece Øeoeve keâjvee neslee nw~
89. (d)
83. (a)
kewâMe mce=efle kesâvõerÙe Øeesmesefmebie FkeâeF& (CPU) leLee cegKÙe cesceesjer kesâ
le=leerÙe pesvejsMeve ceeF›eâesØeesmesmej keâe DeefOekeâlece cesceesjer meeFpe 4GB
yeerÛe [eše Devleefjle keâjves kesâ efueS efkeâÙee peelee nw, efpemekeâe GheÙeesie
neslee nw~ yeej–yeej GheÙeesie ceW Deeves Jeeues [sše Deewj efveoxMeeW keâes mšesj keâjves ceW
84. (a) efkeâÙee peelee nw~ Fmemes cegKÙe cesceesjer leLee Øeesmesmej kesâ yeerÛe ieefle
keâchÙetšj ceW POST keâe DeLe& ‘hee@Jej - Dee@ve mesuheâ - šskeämš’ neslee nw~ DeJejesOe otj nes peelee nw, keäÙeeWefkeâ cesceesjer mes [sše heÌ{ves keâer ieefle
Ùen Skeâ Øekeâej keâer Meg™Deeleer Øeef›eâÙee nw pees keâchÙetšj Ùee DevÙe ef[efpešue CPU kesâ Øeesmesme keâjves keâer ieefle mes keâeHeâer cevo nesleer nw~ Ùen leer›e,
ef[JeeFme kesâ Ûeeuet nesves hej nesleer nw~ POST keâe cegKÙe GösMÙe Ùen cenBiee leLee Dehes#eeke=âle Úesše Storage form nw~
megefveef§ele keâjvee nw efkeâ keâchÙetšj kesâ ne[&JesÙej pewmes cesceesjer, Øeesmesmej, 90. (c)
«eeefheâkeäme keâe[& Deewj DevÙe kebâheesveWšdme mener {bie mes keâece keâj jns nw Ùee DRAM keâe hetje veece [eÙevesefcekeâ jQ[ce Skeämesme cesceesjer nw pees [sše mšesj
veneR~ Ùeefo POST kesâ oewjeve keâesF& mecemÙee heeF& peeleer nw, lees keâchÙetšj Skeâ keâjves kesâ efueS GheÙeesie keâer peeleer nw, Fmes Øeefle meskebâ[ keâF& yeej jerøesâMe efkeâÙee
$egefš mebosMe Ùee yeerhe meeGb[ ØeoefMe&le keâj mekeâlee nw~ peevee ÛeeefnS, DevÙeLee Ùen [sše keâes Kees osiee~
85. (a) 91. (a)
Skeâerke=âle heefjheLe (Integrated Circuit) efpemes DeeF&meer, efÛehe Ùee
ceeF›eâesefÛehe Yeer keâne peelee nw~ efmeefuekeâe@ve Oeeleg Éeje efveefce&le nesleer nw
efpeme hej 10 mes 20 š^ebefpemšj ueies nesles nw~ leermejs heerÌ{er kesâ keâchÙetšj
ceW IC's keâe ØeÙeesie efkeâÙee peelee Lee~
86. (c)
Skeâ ef[efpešue keâchÙetšj efmemšce kesâ cegKÙe Ieškeâ efvecveefueefKele nQ-
• Fvehegš Ùetefveš (Input Unit): Ùen [eše keâes keâchÙetšj ceW Enter
keâjveW keâe keâeÙe& keâjlee nw~
• meer heer Ùet (CPU): Ùen keâchÙetšj keâe ceefmle<keâ neslee nw pees [eše Memory Hierarchy
keâes Øeesmesme keâjlee nw~ pewmes - pewmes nce nwjejkeâer ceW še@he mes yee@šce ceW peeles nQ Skeämesme šeFce
CPU kesâ leerve cegKÙe Yeeie nesles nQ- yeÌ{lee peelee nw DeLeJee Skeämesme mheer[ Iešlee peelee nw~
keâvš^esue Ùetefveš (CU): Ùen keâchÙetšj kesâ meYeer efnmmeeW keâes Skeämesme mheer[ kesâ DeeOeej hej keâchÙetšj cesceesjer keâe mener ›eâce -
efveÙebef$ele keâjlee nw~ cewivesefškeâ šshe Dee@efhškeâ ef[mkeâ kewâMe cesceesjer jefpemšme&~
132 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
92. (c)
HeäuewMe cesceesjer Skeâ Øekeâej keâer vee@ve-JeesuesšeFue cesceesjer nw pees
EEPROM kesâ meceeve nesleer nw, keäÙeesefkeâ Fmes Fueskeäš^e@efvekeâ ™he mes
efcešeÙee Deewj hegve: Øees«eece efkeâÙee pee mekeâlee nw~ neueeBefkeâ, HeäuewMe NOR Gate –OR Deewj NOT iesšdme mes efceuekeâj yevee neslee nw~
cesceesjer Deeceleewj hej DeefOekeâ ueeiele ØeYeeJeer nesleer nw, efJeMes<e ™he mes
yeÌ[er cee$ee ceW [sše mšesj keâjves kesâ efueS, keäÙeeWefkeâ Fmes EEPROM
keâer lejn yeeFš oj yeeFš kesâ yepeeS yueekeâes ceW efcešeÙee Deewj efueKee
pee mekeâlee nw~
98. (b)
93. (b)
NOT Gate keâes FvJeš&j kesâ ™he ceW Yeer peevee peelee nw keäÙeeWefkeâ Ùen
yetefueÙeve yeerpeieefCele keâe GheÙeesie ef[efpešue meefke&âš efJeMues<eCe efoS ieS Fvehegš keâe Guše neslee nw~ GoenjCe kesâ efueS, Ùeefo Fvehegš
(Analize) Deewj mejue yeveeves kesâ efueS efkeâÙee peelee nQ Ùen kesâJeue 1 nw lees DeeGšhegš Fmekesâ efJehejerle 0 nesiee~
yeeFvejer vebyej keâe GheÙeesie keâjlee nw~ Fmekesâ kegâÚ efveÙece efvecveefueefKele 99. (d)
nw:- NAND iesš NOR iesš oesveeW keâes ÙetefveJeme&ue iesš ceevee peelee nw,
A+B=B+A efpemekeâe DeLe& nw efkeâ efkeâmeer Yeer ef[efpešue meefke&âš keâes FveceW mes kesâJeue
A.B=B.A Skeâ Øekeâej kesâ iesš keâe GheÙeesie keâjkesâ keâeÙee&efvJele efkeâÙee pee mekeâlee nw~
94. (a) 100. (d)
K-map vecyej efmemšce Ûeej Øekeâej kesâ nesles nQ Deewj Gvekesâ DeeOeej (yesme)
ceW mecetneW keâes oes kesâ IeeleeW (1, 2, 4, 8 Deeefo) ceW yeveeÙee
peelee nw, Deewj Ùes #eweflepe Ùee uebyeJele ™he mes mešs ngS nesves ÛeeefnS~ Deueie-Deueie nesles nQ~
1. yeeFvejer (Binary) mebKÙee keâe DeeOeej 2 neslee nw~
efJekeâCe& mecetn yeveevee mebYeJe veneR neslee, FmeefueS efJekeâCe& keâe@ve&me& keâes
K-map mecetneW ceW mebÙeesefpele veneR efkeâÙee pee mekeâlee~
2. [sefmeceue (Decimal) mebKÙee keâe DeeOeej 10 neslee nw~
95. (a)
3. Dee@keäšue (Octal) mebKÙee keâe DeeOeej 8 neslee nw~
4. nskeämee[sefmeceue (Hexadecimal) mebKÙee keâe DeeOeej 16 neslee nw~
<ees[Me DeeOeejer [nskeämee[sefmeceue] mebKÙee heæefle ceW 0–15 DeLee&led 16
Debkeâes keâe GheÙeesie efkeâÙee peelee nw~ FveceW 0 mes 9 Debkeâ leLee 10 mes 15
keâes A to F DeuHeâeyesš ceW efve™efhele efkeâÙee peelee nw~ nskeämee[sefmeceue
mebKÙee keâes yeeFvejer kesâ Ûeej DebkeâeW kesâ mecetn ceW oMee&Ùee peelee nw~
Dele: efoS ieS uee@efpekeâ meefke&âš kesâ efueS yetefueÙeve SkeämeØesMeve C(A + Fmekeâe DeeOeej 16 nw~
B)DE Øeehle nesiee~ D e c im a l B in a r y H e x a d e c in a l

96. (a) 0 0000 0

x + x'y keâes nue keâjves kesâ efueS 1 0001 1

x.1 + x keâe GheÙeesie keâjW 2 0010 2

x.1 + x'y 3 0011 3

1+y = 1 keâe GheÙeesie keâjW 4 0100 4
= x(1+y) + x'y 5 0101 5
= x+xy + x'y 6 0110 6
= x+y(x+x')
7 0111 7
x+x' = 1 keâe GheÙeesie keâjW
8 1000 8
= x+y.1
9 1001 9
y.1 = y keâe GheÙeesie keâjW
10 1010 A
x+y
11 1011 B
Dele: mener efJekeâuhe (a) nesiee~
12 1100 C
97. (c)
NAND Deewj NOR iesš ÙetveerJeme&ue iesš nw~ pees Basic Gate mes 13 1101 D

efceuekeâj yeveles nw~ 14 1110 E

NAND Gate – AND Deewj NOT iesšdme mes efceuekeâj yevelee nw~ 15 1111 F

133 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
 PRACTICE SET - 3
1. AI computing focus on --------and conventional (a) Platform as a service/Skeâ mesJee kesâ ™he ceW huesšHeâe@ce&
computing focus on --------- and......../AI (b) Place as a service/Skeâ mesJee kesâ ™he ceW mLeeve
keâchÙetefšbie .......... hej OÙeeve kesâefvõle keâjlee nw Deewj (c) Software as a service
heejbheefjkeâ keâchÙetefšbie .......... Deewj .......... hej OÙeeve Skeâ mesJee kesâ ™he ceW mee@HeäšJesÙej
kesâefvõle keâjlee nw~ (d) Infrastructure as a service/Skeâ mesJee kesâ ™he ceW
(a) Data, information, knowledge/[sše, metÛevee, %eeve Fbøeâemš^keäÛej
(b) Information, data, knowledge/metÛevee, [sše, %eeve 7. Which of the following is NOT an application
(c) Knowledge, data, information/%eeve, [sše, metÛevee of Artificial Intelligence?
(d) None of the given options efvecveefueefKele ceW mes keäÙee Deeefš&efHeâefMeÙeue FbšsefuepeWme keâe
efoS ieS efJekeâuheeW ceW mes keâesF& veneR SefhuekesâMeve veneR nw?
2. The delivery of computing services such as data (a) Computer gaming/kebâhÙetšj iesefcebie
storage, servers and databases over the internet (b) Rock system/je@keâ efmemšce
is known as: (c) Natural language processing
keâchÙetefšbie mesJeeSB pewmes [eše mšesjspe, meJe&j Deewj Fbšjvesš vesÛegjue ueQiJespe Øeesmesefmebie
hej [sšeyesme kesâ efJelejCe keâes efkeâme ™he ceW peevee (d) Expert system/Skeämeheš& efmemšce
peelee nw? 8. What is the key difference between supervised
(a) Seed Computing/meer[ keâchÙetefšbie and unsupervised learning?
(b) Advance Computing/S[Jeebme keâchÙetefšbie heÙe&Jesef#ele Deewj DeheÙe&Jesef#ele DeefOeiece (ueefveËie) kesâ
(c) Smart Computing/mceeš& keâchÙetefšbie yeerÛe cegKÙe Deblej keäÙee nw?
(d) Cloud Computing/keäueeG[ keâchÙetefšbie (a) Supervised learning is cheaper than
unsupervised learning./heÙe&Jesef#ele DeefOeiece,
3. What is the common platform for big data
processing?/efvecveefueefKele ceW mes efyeie [sše Øeesmesefmebie kesâ DeheÙe&Jesef#ele DeefOeiece keâer leguevee ceW memlee nw~
(b) Supervised learning requires neural networks,
efueS keâe@ceve huesšheâe@ce& keäÙee nw? while unsupervised learning does not.
(a) Machine learning/ceMeerve ueefveËie heÙe&Jesef#ele DeefOeiece kesâ efueS vÙetjue peeue›eâce (vesšJeke&â)
(b) Java/peeJee keâer DeeJeMÙekeâlee nesleer nw, peyeefkeâ DeheÙe&Jesef#ele DeefOeiece
(c) Hadoop/n[the kesâ efueS veneR~
(d) Relational databases/efjuesMeveue [sšeyesmesme (c) Supervised learning works only with big data,
4. Which of the following is an application of while unsupervised learning does not.
Artificial Intelligence? heÙe&Jesef#ele DeefOeiece kesâJeue yeÌ[s [sše kesâ meeLe keâece keâjlee
efvecveefueefKece ceW mes keâewve-mee Deeefš&efHeâefMeÙeue FbšsefuepeWme nw, peyeefkeâ DeheÙe&Jesef#ele DeefOeiece veneR keâjlee nw~
keâe DevegØeÙeesie nw? (d) Supervised learning uses labelled data, while
(a) It helps to exploit vulnerabilities to secure the unsupervised learning uses unlabelled data.
firm heÙe&Jesef#ele DeefOeiece uesyeue Jeeues [sše keâe GheÙeesie keâjlee
(b) Language understanding and problemsolving nw, peyeefkeâ DeheÙe&Jesef#ele DeefOeiece efyevee uesyeue Jeeues [sše
(Text analytics and NLP) keâe GheÙeesie keâjlee nw~
(c) It helps to deploy applications on the cloud 9. How can you write into HTML output using
(d) More than one of the above JavaScript?/Deehe JavaScript keâe GheÙeesie keâjkesâ
5. What is Arduino Uno? HTML ceW DeeGšhegš kewâmes efueKe mekeâles nw?
Dee[t&Fvees Ùetvees (Arduino Uno) keäÙee nw? (a) Using innerHTML
(a) A 6LoWPAN device
innerHTML keâe GheÙeesie keâjkesâ
Skeâ 6LoWPAN ef[JeeFme (b) Using console.log()
(b) A network/Skeâ vesšJeke&â console.log() keâe GheÙeesie keâjkesâ
(c) A sensor/Skeâ meWmej (c) Using document.write()
(d) A microcontroller document.write() keâe GheÙeesie keâjkesâ
Skeâ ceeF›eâeskebâš^esuej (d) Using window.alert()
6. Which of the following is NOT a cloud window.alert() keâe GheÙeesie keâjkesâ
computing service model? 10. What is the purpose of HTML in a web
efvecveefueefKele ceW mes keâewve mee keäueeG[ kebâhÙetefšbie meefJe&me application?/Jesye SeqhuekesâMeve ceW HTML keâe GodosMÙe
cee@[ue veneR nw? keäÙee nw?
134 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
 (a) To define the structure of web pages (c) Bridge/hegue
Web pages keâer mebjÛevee keâes heefjYeeef<ele keâjvee (d) More than one of the above/GheÙeg&òeâ ceW mes Skeâ mes
(b) To style web pages DeefOekeâ
Web pages keâer mšeFue keâjves kesâ efueS 17. What is the class address of the following IP
(c) To add interactivity to web pages address?
Web pages ceW Devlejef›eâÙeeMeeruelee peesÌ[ves kesâ efueS efvecveefueefKele DeeF&heer S[^sme keâe keäueeme S[^sme keäÙee nw?
(d) More than one of the above 55.10.200.55
GheÙeg&òeâ ceW mes Skeâ mes DeefOekeâ (a) Class D/keäueeme D (b) Class A/keäueeme A
11. Recognize extensions for video files. (c) Class B/keäueeme B (d) Class C/keäueeme C
Jeeref[Ùees heâeFueeW kesâ efueS SkeämešWMeve henÛeeveW~ 18. Real time streaming protocol is used____
(a) .gif (b) .mid JeemleefJekeâ meceÙe mš^erefcebie Øeesšeskeâe@ue keâe GheÙeesie efkeâÙee
(c) .avi (d) .dbf peelee nw______
12. The number of bits in an audio sample is called
(a) to control streaming media servers
Skeâ Dee@ef[Ùees meQheue cebs efyešdme keâer mebKÙee keâner peeleer nw– (b) for establishing and controlling media
(a) Bit depth/efyeš [shLe sessions between endpoints
(b) Bit density/efyeš [Wefmešer (c) to provide real time control of playback of
(c) Audio resolution/Dee@ef[Ùees efj]peesuÙetMeve media files from the server
(d) Audio depth/Dee@ef[Ùees [shLe (d) More than one of the above
19. Which layer of the TCP/IP stack corresponds
13. nesce Mee@efhebie Deewj efJe%eeheve, kebâhÙetšj SefhuekesâMeve keâer to the OSI model transport layer?
efvecveefueefKele ceW mes efkeâme ßesCeer mes mebyebefOele nQ? TCP/IP mšwkeâ keâer keâewve-meer hejle, OSI cee@[ue
(a) ceekexâefšbie (Marketing) š^^evmeheesš& hejle mes cesue Keeleer nw?
(b) mJeemLÙe osKeYeeue (Healthcare) (a) Host-to-host
(c) efMe#ee (Education) (b) Application
(d) mewvÙe (Military) (c) Internet
14. Identify the term from the given options, which (d) More than one of the above/GheÙeg&òeâ ceW mes Skeâ
is a small file or data packet, stored by a DeefOekeâ
website on the client's computer and used by 20. Which of the following technologies allows real-
the websites to store browsing information of time communication over the Internet, such as
the user./veerÛes efoS ieS efJekeâuheeW ceW mes Gme heo voice and video calls, without requiring
(term) keâer henÛeeve keâerefpeS, pees Skeâ Úesšer heâeFue Ùee additional software or hardware beyond a web
[eše hewkesâš nw, efpemes Skeâ JesyemeeFš Éeje keäueeFbš kesâ browser?
keâchÙetšj hej mšesj efkeâÙee ieÙee nw Deewj JesyemeeFšeW Éeje efvecveefueefKele ceW mes keâewve meer lekeâveerkeâ Fbšjvesš hej
efpemekeâe ØeÙeesie Ùetpej keâer yeÇeGefpebie metÛevee keâes mšesj JeemleefJekeâ meceÙe mebÛeej keâer Devegceefle osleer nw, pewmes efkeâ
keâjves nsleg efkeâÙee peelee nw~ Jee@Ùeme Deewj Jeeref[ÙeeW keâe@ue, Jesye yeÇeGpej mes hejs
(a) Firwall/HeâeÙejJeeue (b) Cookies/kegâkeâerpe
Deefleefjòeâ mee@HeäšJesÙej Ùee ne[& JesÙej keâer DeeJeMÙekeâlee kesâ
efyevee?
(c) Spyware/mheeF&JesÙej (d) Trojan/š^espeve
15. Which of the following symbols is used to leave (a) F&cesue/Email (b) FTP
a placeholder that may be automatically filled (c) WEBRTC (d) VoIP
by the search engine later while searching? 21. DeeYeemeer efvepeer heefjheLe (Virtual Private Network)
efvecve ceW mes keâewve-mee efmebyeue Skeâ huesmenesu[j ÚesÌ[ves kesâ keäÙee nw?
efueS GheÙeesie efkeâÙee peelee nw pees yeeo ceW meÛe& Fbpeve Éeje (a) Ùen efkeâmeer mebmLee keâe efvepeer kebâhÙetšj heefjheLe nw, efpemeceW
mJeÛeeefuele ™he mes Yeje pee mekeâlee nw? megotj yew"s ØeÙeeskeälee mebmLee kesâ heefjJes<ekeâ (meJe&j) kesâ ceeOÙece
(a) Asterisk (*)/leejebkeâve efÛevn (*) mes metÛevee Øesef<ele keâj mekeâles nQ
(b) Hyphen (-)/neFheâve (-) (b) Ùen efvepeer Fbšjvesš hej yevee kebâhÙetšj heefjheLe nw, pees
(c) Colon (:)/keâesueve (:) ØeÙeeskeäleeDeesb keâes Deheveer mebmLee kesâ heefjheLe ceW ØeJesMe keâjves
(d) Plus (+)/hueme (+) keâer megefJeOee oslee nw Deewj Øesef<ele keâer pee jner metÛevee keâes
16. Which device is used to connect multiple megjef#ele jKelee nw
devices within the same local area network (c) Ùen Skeâ Ssmee kebâhÙetšj heefjheLe nw, efpemekesâ Éeje ØeÙeeskeälee
(LAN)?/Skeâ ner ueeskeâue SefjÙee vesšJeke&â (LAN) kesâ mesJee ØeyebOekeâ (mee|Jeme ØeesJeeF[j) kesâ ceeOÙece mes kebâhÙeteEšie
Yeerlej keâF& ef[JeeFmeeW keâes peesÌ[ves kesâ efueS efkeâme ef[JeeFme mebmeeOeveeW kesâ meePes Yeb[ej ceW ØeJesMe hee mekeâles nQ,
keâe GheÙeesie efkeâÙee peelee nw? (d) GheÙeg&keäle (a), (b) leLee (c) keâLeveeW ceW mes keâesF& Yeer
(a) Router/jeGšj (b) Switch/eqmJeÛe DeeYeemeer efvepeer heefjheLe keâe mener JeCe&ve veneR nw
135 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
22. Four types of channels used in data (a) An 'extent' is a set of logically contiguous
communication of LAN are twisted pair cable, data blocks allocated for storing a specific
coaxial cable,...............and radio waves: type of information.
LAN kesâ [eše Øes<eCe ceW ØeÙegòeâ nesves Jeeueer Ûeej Øekeâej Skeâ ‘meercee’ leeefke&âkeâ ™he mes meefvveefnle [sše yuee@keâ keâe
keâer ØeCeeefueÙeeB nQ- šdefJemšs[ hesDej kesâyeue (IegceeJeoej Skeâ mesš nw pees Skeâ efJeefMe° Øekeâej keâer peevekeâejer keâes
Ùegice leej), keâesDeefkeämeDeue kesâyeue (mecee#eerÙe leej), meb«enerle keâjves kesâ efueS DeeJebefšle efkeâÙee peelee nw~
................leLee jsef[Ùees lejbieW- (b) 'Segment inheritance' is an attribute inherited
(a) ISDN cable/kesâyeue ISDN from the table space that contains the
segment./‘mesieceWš FvensefjšWme’ mesieceWš Jeeues šsyeue
(b) PSDN cable/kesâyeue PSDN
(c) X-ray waves/ X-efkeâjCe lejbies
mhesme mes efJejemele ceW efceueer Skeâ efJeMes<elee nw~
(c) A 'segment' is a set of extents allocated for a
(d) Fiber optics/HeâeFyej Dee@efhškeäme specific database object, such as a table.
23. Which transmission media provides the highest Skeâ ‘mesieceWš’, Skeâ efJeefMe° [sšeyesme Dee@ypeskeäš kesâ efueS
transmission speed in a network?
keâewve-mee š^ebmeefceMeve ceeref[Ùee efkeâmeer vesšJeke&â ceW GÛÛelej DeeJebefšle efJemleejeW keâe Skeâ mesš nw~ pewmes efkeâ Skeâ leeefuekeâe~
(d) 'Logical space management' is used to track
š^ebmeefceMeve ieefle Øeoeve keâjlee nw? and allocate the extents in a tablespace
(a) Coaxial cable (b) Twisted-pair cable ‘uee@efpekeâue mhesme cewvespeceWš’ keâe GheÙeesie šsyeuemhesme ceW
(c) Optical fiber
efJemleej keâes š^wkeâ Deewj DeeJebefšle keâjves kesâ efueS efkeâÙee
(d) More than one of the above/GheÙeg&keäle ceW mes Skeâ mes
peelee nw~
DeefOekeâ
28. _______are used to speed up searching.
24. Which of the following refers to high-capacity
_____ Keespe keâes lespeer mes ueeves kesâ efueS GheÙeesie efkeâÙee
transmission technologies that transmit data,
voice and video across long distance and at peelee nw~
high speeds using fibre optic cables? (a) Vectors (b) Indixes
efvecveefueefKele ceW mes keâewve-mee efJekeâuhe GÛÛe #ecelee Jeeueer (c) Lists (d) Maps
š^ebmeefceMeve lekeâveerkeâeW keâes meboefYe&le keâjlee nw pees HeâeFyej 29. Columns of a relation are generally referred to
Dee@efhškeâ kesâyeue keâe GheÙeesie keâjkesâ uebyeer otjer Deewj GÛÛe as ______./efkeâmeer efjuesMeve kesâ keâe@uece keâes meeceevÙele:
ieefle hej [sše, Jee@Fme Deewj Jeeref[Ùees keâes š^ebmeefceš keâjleer nw? ______ keâne peelee nw~
(a) Dialup (a) Couple/keâheue (b) Degree/ef[«eer
(b) Public switched telephone network (c) Tuples/šheume (d) Attributes/Sefš^yÙetšdme
(c) Broadband 30. Which of the following is not the utility of
(d) Bandwidth DBMS?/efv ecveefueefK ele ceW mes keâewve DBMS keâer
25. Which of the following is true with regard to GheÙeesefielee veneR nw?
the ping command? (a) Backup (b) Data Loading
efhebie keâceev[ kesâ mecyevOe ceW, efvecveefueefKele ceW mes keâewve- (c) Process Organization
mee melÙe nw? (d) More than one of the above
(a) Ping stands for Packet Internet Generator. 31. An attribute of one table matching the primary
(b) The ping command checks the port level key of another table is called as
connectivity between source destinations Skeâ šsyeue keâe Sefš^yÙetš, pees otmejs šsyeue keâer ØeeFcejer
endpoints. keâer mes cewÛe (efceuelee nes) keâjlee nes, keânueelee nw
(c) Ping summarizes the packet loss and round-
trip delay between two IP endpoints. (a) Foreign key/heâe@jsve keâer
(d) More than one of the above/GheÙeg&òeâ ceW mes Skeâ (b) Secondary key/meskesâv[jer keâer
DeefOekeâ (c) Candidate key/kewâefv[[sš keâer
26. When the mail server sends mail to other mail (d) More than one of the above/GheÙeg&òeâ ceW mes Skeâ mes
servers, it becomes a/an ________. DeefOekeâ
peye cesue meJe&j, DevÙe cesue meJe&jeW keâes cesue Yespelee nw, lees 32. Which of the following statements are FALSE
Jen ______ yeve peevee nw~ about private keys in cryptography?
(a) Peer/heerÙej ef›eâhšes«eeHeâer ceW efvecveefueefKele ceW mes keâewve-mee keâLeve
(b) SMTP client/keäueeFbš SMTP ØeeFJesš keâer (private key) kesâ mebyebOe ceW DemelÙe nQ?
(c) SMTP server/SMTP meJe&j i) It is a key to be given to the public./Ùen heefyuekeâ
(d) Master/ceemšj keâes oer peeves Jeeueer keâer (key) nw~
27. Which of the following statements is NOT true ii) It is a key that opens a secret door./Ùen Jen keâer
about the logical structure of the Oracle (key) nw pees ieghle Éej (secret door) Keesueleer nw~
database?/ Oracle [sšeyesme keâer leeefke&âkeâ mebjÛevee kesâ yeejs iii) This key is also known as a secret key./Fme keâer
ceW efvecveefueefKele ceW mes keâewve-mee keâLeve melÙe veneR nw? (key) keâes meer›esâš keâer (secret key) Yeer keâne peelee nw
136 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
 iv) This key should only be shared with its (a) loop operator/uethe mebkeâejkeâ
generator or the parties authorised to decrypt (b) Control operator/kebâš^esue mebkeâejkeâ
the data./Ùen keâer (key) kesâJeue Fmekesâ Glheeokeâ (c) Case operator/kesâme mebkeâejkeâ
(generator) Ùee [sše keâes ef[ef›eâhš keâjves kesâ efueS (d) Ternary operator/šve&jer mebkeâejkeâ
DeefOeke=âle heeefš&ÙeeW kesâ meeLe MesÙej keâer peeveer ÛeeefnSB 38. What will be the highest index of the array if N
(a) Only i, ii and iii/kesâJeue i, ii Deewj iii is the total number of elements in the array?
(b) All of i, ii, iii and iv/ i, ii, iii Deewj iv meYeer Ssjs keâe GÛÛelece metÛekeâebkeâ keäÙee nes mekeâlee nw Deiej N,
(c) Only iii and iv/ kesâJeue iii Deewj iv Ssjs ceW lelJeeW keâer kegâue mebKÙee nw?
(d) Only i and ii/kesâJeue i Deewj ii (a) N (b) N + 1
33. Which of the following is not the utility of (c) N - 2 (d) N - 1
DBMS? 39. What is an array?/Skeâ Ssjs keäÙee nw?
efvecveefueefKele ceW mes keâewve-meer DBMS keâer GheÙeesefieleeSB (a) Array is a collection of different type of
veneR nQ? elements
I. Backup/yewkeâDehe efJeefYeefVe Øekeâej kesâ lelJeeW keâe Skeâ meb«en Ssjs nw
(b) Array is a collection of dynamically allocated
II. Loading/ueeseE[ie
elements/ieefleMeerue DeeJebefšle lelJeeW keâe Skeâ meb«en Ssjs nw
III. Process organization/Øeef›eâÙee mebie"ve
(c) Array is a collection of different data types
IV. File organization/HeâeFue mebie"ve placed next to each other/Skeâ otmejs kesâ yeieue ceW
(a) I, II and IV only/kesâJeue I, II Deewj IV jKee efJeefYeVe [sše Øekeâej keâe Skeâ meb«en Ssjs nw
(b) I, II and III only/kesâJeue I, II Deewj III (d) Array is a collection of similar type of
(c) I, III and IV only/kesâJeue I, III Deewj IV elements/lelJeeW kesâ meceeve Øekeâej keâe Skeâ meb«en Ssjs nw
(d) None of the above/GheÙeg&keäle ceW mes keâesF& veneR 40. A program has the following code to define a
34. Which of the following is not an example of node./Skeâ Øees«eece ceW vees[ keâes heefjYeeef<ele keâjves kesâ
DBMS? efueS efvecveefueefKele keâes[ neslee nw~
efvecveefueefKele ceW mes keâewve-mee DBMS keâe GoenjCe veneR nw? struct node {
(a) Microsoft access int data;
(b) IBM Db2 struct node* left;
(c) Google struct node* right;
(d) More than one of the above/GheÙeg&keäle ceW mes Skeâ mes }
DeefOekeâ This node type would belong to which type of a
35. The number of attributes in a relation is called data structure?/Ùen vees[ šeFhe efkeâme Øekeâej kesâ [sše
the __________ of the relation. mš^keäÛej mes mecyeefvOele nw~
Skeâ efjuesMeve (Relation) ceW Deefš^yÙetšdme (Attributes) (a) Queues/keâleejeW
keâer mebKÙee, efjuesMeve keâer ________ keânueeleer nw~ (b) Doubly linked list/[yeueer efuebkeä[ efuemš
(a) Degree/ef[«eer (c) Binary tree/yeeFvejer š^er
(b) Domain/[escessve (d) Circular list/mekeg&âuej efuemš
(c) Cardinality/keâeef[&vesefuešer 41. Which of the following statements is TRUE?
(d) Tuyples/šheume efvecveefueefKele mšsšceWš ceW mes keâewve-mee mener nw?
36. A grammar for annotating a document in a way (a) Polymorphic programming can eliminate the
that is syntactically distinguishable from the need for switch logic./hee@ueercee@efhe&âkeâ Øees«eeefcebie efmJeÛe
text, such as HTML, is…………/Skeâ [e@keäÙetceWš keâer uee@efpekeâ keâer DeeJeMÙekeâlee keâes meceehle keâj mekeâleer nw~
Skeâ lejerkesâ mes JÙeeKÙee keâjves kesâ efueS Ssmee JÙeekeâjCe, pees (b) A class is made abstract by declaring that
JeekeäÙe jÛevee kesâ keâejCe šskeämš mes Deueie henÛeevee peelee class virtual. /Gme Jeie& keâes DeeYeemeer Ieesef<ele keâjkesâ Skeâ
nw, pewmes SÛešerSceSue,..........nw~ Jeie& keâes Decetle& yevee efoÙee peelee nw~
(a) Command Language/keâceeb[ ueQiJespe (c) All virtual functions in an abstract base class
(b) Machine Language/ceMeerve ueQiJespe must be declared as pure virtual functions/Skeâ
(c) Markup Language/ceeke&âDehe ueQiJespe meej DeeOeej Jeie& ceW meYeer DeeYeemeer keâeÙeeX keâes Megæ
(d) Style Sheet Language/mšeFue Meerš ueQiJespe DeeYeemeer keâeÙeeX kesâ ™he ceW Ieesef<ele efkeâÙee peevee ÛeeefnS~
37. The conditional operator (? :) is also known (d) Referring to a derived-class object with a base-
as/meØeefleyebOe mebkeâejkeâ (? :) keâes efvecveefueefKele mebkeâejkeâ class handle is dangerous./yesme-keäueeme nQ[ue Jeeues
Yeer keâne peelee nw JÙeglheVe Jeie& Dee@ypeskeäš keâe efpe›eâ keâjvee Kelejveekeâ nw~
137 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
42. In Visual Basic, what will be the result of the 47. A linear data structure in which insertion and
following code?/efJepegDeue yesefmekeâ ceW, efvecveefueefKele deletion operations can be performed from
keâes[ keâe heefjCeece keäÙee nesiee? both the ends is
Skeâ linear data structure, efpemeceW oesveeW efmejeW mes
newValue = CDbl(oldValue)
(a) Conversion of data type to date meefcceueve Deewj efJeueesheve mebÛeeueve efkeâÙee pee mekeâlee nw,
[sše šeFhe keâe efoveebkeâ ceW ™heevlejCe (a) queue
(b) circular queue
(b) Conversion of data type to Boolean
(c) deque
[sše šeFhe keâe yetefueÙeve ceW ™heevelejCe (d) More than one of the above
(c) Conversion of data type to string GheÙeg&òeâ ceW mes Skeâ DeefOekeâ
[sše šeFhe keâe efmš^bie ceW ™heevelejCe 48. How do structures and classes in C++ differ?
(d) Conversion of data type to double C++ ceW, mebjÛeveeSB Deewj keâ#eeSB kewâmes efYeVe nesleer nQ?
[sše šeFhe keâe [yeue ceW ™heevlejCe (a) Structures by default hide every member
43. A/An______ is an integrated development whereas classes do not
environment (IDLE) that comes with Python. ef[]he@âeuš ™he mes mebjÛeveeSb ØelÙeskeâ meomÙe keâes Úgheeleer nQ,
______ Skeâ Skeâerke=âle efJekeâeme heefjJesMe { integrated peyeefkeâ keâ#eeSB veneR nesleer nQ
development environment (IDE)ue nw pees heeFLeve (b) In structures, members are public by default,
kesâ meeLe Deelee nQ whereas, in classes, they are private by
default/mebjÛeveeDeeW ceW, meomÙe ef[]heâe@uš ™he mes
(a) Datagrip/[sšeef«ehe
meeJe&peefvekeâ nesles nQ, peyeefkeâ keâ#eeDeeW ceW Je ef[]heâe@uš ™he
(b) NetBeans/vesšyeervme
mes efvepeer nesles nQ
(c) Visual Studio/efJepegDeue mštef[Ùees
(c) Structures cannot have private memebers,
(d) IDLE whereas classes can have
44. Which tag is used inside an HTML page to mebjÛeveeDeeW ceW efvepeer meomÙe veneR nes mekeâles nQ, peyeefkeâ
define an internal CSS?
Fvšve&ue CSS keâes heefjYeeef<ele keâjves kesâ efueS HTML keâ#eeDeeW ceW ness mekeâles nQ
(d) More than one of the above
hespe kesâ Deboj efkeâme šwie keâe GheÙeesie efkeâÙee peelee nw
GheÙeg&òeâ ceW mes Skeâ DeefOekeâ
(a) <style> (b) <show>
49. What will be the output of the following
(c) <view> (d) <css>
th program fragment?
45. Which of the following gives the n element of efvecveebefkeâle Øees«eece øewâieceWš (output) keâe DeeGšhegš keäÙee
the Array?
efvecveefueefKele ceW mes keâewve-mee Array keâe nJeeB lelJe oslee nw? nesiee?
int i = 10;
(a) array [a];
void main( )
(b) array [n –1];
{ int i = 20;
(c) array [n + 1];
{
(d) More than one of the above/GheÙeg&keäle ceW mes Skeâ mes
int i = 30;
DeefOekeâ printf(“%d, %d”, i, : :i);
46. What is virtual inheritance in C++? }
C++ ceW JeÛeg&Deue Fvensefjšsvme keäÙee neslee nw? }
(a) C++ technique to enhance multiple
inheritance.
(a) 30, 10
ceušerhueme FvnsefjšWme keâes yeÌ{eves kesâ efueS C++ lekeâveerkeâ
(b) 30, 20
nw~ (c) 20, 30
(b) C++ technique to ensure that a private (d) More than one of the above
member of the base class can be accessed
somehow GheÙeg&òeâ ceW mes Skeâ mes DeefOekeâ
C++ lekeâveerkeâ Ùen megefveef§ele keâjleer nw efkeâ DeeOeej Jeie& kesâ 50. Which of the following software is/are also
efvepeer meomÙe lekeâ efkeâmeer lejn mes hengBÛee pee mekesâ~ called language processor?/efvecveefueefKele ceW mes
(c) C++ technique to avoid multiple copies of the efkeâme mee@heäšJesÙej keâes ueQiJespe Øeesmesmej Yeer keâne peelee nw?
base class into children derived class. (a) Spreadsheet software/mhesÇ[Meerš mee@heäšJesÙej
C++ lekeâveerkeâ, pees yeÛÛeeW Éeje JÙeglheVe Jeie& ceW DeeOeej (b) Adware/Ss[JesÙej
Jeie& keâer SkeâeefOekeâ ØeefleÙeeW mes yeÛeves ceW meneÙekeâ nw~ (c) Assembler and compiler/DemeWyeuej Deewj kebâheeFuej
(d) More than one of the above/GheÙeg&keäle ceW mes Skeâ mes (d) Database management system
DeefOekeâ [sšeyesme ceQvespeceWš efmemšce
138 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
51. The use of combination of 1’s and 0’s is a 56. Which language is better for writing structured
feature of which of the following type of code?/structured code efueKeves kesâ efueS keâewve-meer
computer language? Yee<ee yesnlej nw?
‘1’ Deewj ‘0’ keâe mecevJeÙe efvecve ceW mes efkeâme keâchÙetšj (a) PASCAL
Yee<ee keâer efJeMes<elee nw? (b) FORTRAN
(a) COBOL/keâesyee@ue (c) BASIC
(b) High level language/GÛÛe mlejerÙe Yee<ee (d) More than one of the above/GheÙeg&òeâ ceW mes Skeâ
(c) Machine language/ceMeerve Yee<ee DeefOekeâ
(d) PASCAL/heemkeâue 57. Which of the following highly uses the concept
52. If you want to take input of multiple values in flow of an array?
efvecveefueefKele ceW mes keâewve-mee Ssjs keâer DeJeOeejCee keâe
chart we use/Ùeefo Deehe heäueesÛeeš& ceW SkeâeefOekeâ ceeve keâe
DelÙeefOekeâ GheÙeesie keâjlee nw?
Fvehegš uesvee Ûeenles nQ lees efkeâmekeâe GheÙeesie keâjWies?
(a) Binary search tree
(a) Parallelogram /meceevlej ÛelegYeg&pe (b) Scheduling of processes
(b) Diamond /efleÙe&iJeie& (c) Spatial locality
(c) Rectangle /DeeÙele (d) More than one of the above/GheÙeg&keäle ceW mes Skeâ mes
(d) Circle /Je=òe DeefOekeâ
53. In programming languages, one set of names 58. Shuesš keâchÙetefšbie kesâ meboYe& ceW nw–
can be kept different from other sets using (a) peeJee SefhuekesâMeve (b) keâchÙetšj JeeÙejme
Øees«eeefcebie Yee<eeDeeW cebs Fmekeâe GheÙeesie keâjles ngS veeceeW kesâ
(c) Skeâ HeâeÙejJee@ue (d) Skeâ ketâefHeâve
Skeâ mesš keâes DevÙe mesšeW mes Deueie jKee pee mekeâlee nw– 59. Which of the following is not related to a utility
(a) Identifiers/DeeF[WšerheâeÙeme& software?/efvecveefueefKele ceW mes keâewve Skeâ GheÙeesefielee
(b) Namespaces/vescemhesmes]pe (Ùegefšefuešer) mee@HeäšJesÙej mes mebyebefOele veneR nw?
(c) Packages/hewkesâpesme (a) Text editor/šskeämš S[eršj
(d) Directories/[eFjskeäšesjer]pe (b) Antivirus program/SCšerJeeÙejme Øees«eece
54. A sort algorithm works on the following (c) Disk compression software
principle./Skeâ Mee@š& Suieesefjodce efvecveefueefKele efmeæevle ef[mkeâ kebâØesMeve mee@HeäšJesÙej
hej keâeÙe& keâjlee nw~ (d) Railway reservation system
• Find the smallest item in the list, and exchange jsueJes efjpeJexMeve efmemšce
it with the left-most unsorted element,/efuemš ceW 60. Vendor–created program modifications are
meyemes Úesše DeeFšce {tb{s Deewj Fmes uesheäš ceesmš efyevee called ________.
›eâceyeæ SefueceWš kesâ meeLe yeoueW~ JeW[j Éeje GlheVe Øees«eece heefjJele&ve keäÙee keânueelee nw?
• Repeat the process form the first unsorted (a) Patches/hewÛe
element. (b) antivirus/SbšerJeeÙejme
henues DeJeieeake=âle Sefuecesvš mes Øeef›eâÙee keâes oesnjeSb~ (c) holes/nesue
Which of the following sorting algorithms does (d) fixes/efHeâkeäme
it correspond to?/Ùen efvecveefueefKele ceW mes efkeâme 61. "Disk Cleanup Tool" is a _______.
mee@efšËie Suieesefjodce kesâ Deveg™he nw? ‘‘ef[mkeâ keäueerveDehe štue’’ Skeâ _______ nw~
(a) Quick sort/efkeäJekeâ mee@š& (a) Anti-virus/Sbšer-JeeÙejme
(b) Merge sort/cepe& mee@š& (b) Utility/Ùetefšefuešer
(c) Selection sort/efmeueskeäMeve mee@š& (c) Compression Tool/mebheer[ve štue
(d) Desktop Publisher/[smkeâše@he
(d) Insertion sort/FbmeMe&ve mee@š&
62. ......... is the illegal reproduction and
55. Which of the following correctly declares an
distribution of software application.
array in C++?
.......... mee@heäšJesÙej SefhuekesâMeve keâe DeJewOe Glheeove Deewj
efvecveefueefKele ceW mes keâewve-mee C++ ceW Skeâ mejCeer keâes
efJelejCe nw~
mener {bie mes Ieesef<ele keâjlee nw?
(a) Sorting /meewefšbie (b) Piracy /heeFjsmeer
(a) array{10};
(c) Cracker /›ewâkeâj (d) Virus /JeeÙejme
(b) int array;
(c) int array[10]; 63. Which among the following is not a
(d) More than one of the above hardware?/efvecveefueefKele cebs mes keâewve-mee Skeâ
GheÙeg&òeâ ceW mes Skeâ DeefOekeâ ne[&JesÙej veneR nw?
139 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
 (a) Assembler/Demescyeuej (a) Marcian Hoff/ ceeefMe&Ùeve ne@heâ
(b) Printer/cegõkeâ (b) Stanley Major/ mšsveueer cespej
(c) Magnetic Tape/ÛegbyekeâerÙe šshe (c) Linus Torvalds/}eFveme šesjJeeu[dme
(d) VDU terminal/Jeer[erÙet šefce&veue (d) Charles Babbage/ Ûeeume& yewyespe
64. JeÛeg&Deue cesceesjer keâe Deekeâej efveYe&j keâjlee nw─ 71. Which set of necessary conditions causes a
'deadlock' in an operating system?
(a) S[^sme ueeFvme hej (b) [ešeyesme hej
DeeJeMÙekeâ MeleeX keâe keâewve-mee mesš Skeâ Dee@hejsefšbie
(c) ef[mkeâ mhesme hej (d) Ùes meYeer efmemšce ceW ‘[s[uee@keâ keâe keâejCe yevelee nw?
65. In Linux, the terminal I/O characteristics may (a) Blocking send, race condition, hold and wait
be configured using the command:
and RAM overflow/yuee@efkebâie meW[, jsme kebâ[erMeve,
Linux ceW, šefce&veue I/O efJeMes<eleeDeeW keâes keâceeb[ keâe
nesu[ Sb[ Jesš Deewj jwce DeesJejheäuees
GheÙeesie keâjkesâ keâe@efvheâiej efkeâÙee pee mekeâlee nw : (b) Blocking send, race condition cache
(a) ktty (b) ltty incoherency and RAM overflow/yuee@eEkeâie meW[,
(c) itty (d) stty jsme kebâ[erMeve, kewâMe FvekeâesnsjWmeer Deewj jwce DeesJejheäuees
66. BIOS is a type of system software, which is
(c) Mutual exclusion, no preemption, hold and
stored in ____ located on the motherboard.
wait, and circular wait/cÙegÛegDeue Skeämekeäuetpeve, vees
BIOS Skeâ Øekeâej keâe efmemšce mee@heäšJesÙej nw, pees
Øees-FceesMeve, nesu[ Sb[ Jesš Deewj mekeg&âuej Jesš
ceojyees[& hej efmLele ____ ceW mšesj neslee nw~
(d) Mutual exclusion, race condition, cache
(a) Cache memory/kewâMe cesceesjer incoherency and RAM overflow
(b) SRAM/Sme jwce cÙegÛegDeue Skeämekeäuetpeve, jsme efmLeefle, kewâMe Demebieefle Deewj
(c) Read Only Memory (ROM)/jer[ Deesveueer cesceesjer jwce DeesJejheäuees
(d) DRAM/[er jwce 72. The operating system maintains a _______table
67. efuevekeäme ceW efvecveefueefKele ceW mes keâewve-meer HeâeFueW, that keeps track of how many frames have been
ef[JeeFme HeâeFue nesleer nQ, pees efmemšce ne[&JesÙej Jeeues allocated, how many are there and how many
are available./Dee@hejseEšie efmemšce Skeâ _________
IeškeâeW keâes yeHeâ[& Skeämesme Øeoeve keâjleer nw Deewj HeâeFue
efmemšce kesâ ceeOÙece mes ef[JeeFme [^eFJejeW kesâ meeLe mebÛeej leeefuekeâe jKelee nw pees š^wkeâ keâjlee nw efkeâ efkeâleves øesâce
keâer Skeâ efJeefOe Øeoeve keâjleer nw? DeeJebefšle efkeâS ieS nQ, efkeâleves nQ Deewj efkeâleves GheueyOe nQ~
(a) Frame (b) Mapping
(a) Binary/yeeFvejer (b) Image/FceWpe
(c) Page
(c) Block/yuee@keâ (d) Readable/jer[syeue (d) More than one of the above
68. Which system call is used by the operating 73. What causes thrashing to occur?/Thrashing
system to create a new process? efkeâme keâejCe mes nesleer nw?
veF& Øeef›eâÙee yeveeves kesâ efueS Dee@hejsefšbie efmemšce Éeje (a) Excessive paging activity/DelÙeefOekeâ heseEpeie ieefleefJeefOe
efkeâme efmemšce keâe@ue keâe GheÙeesie efkeâÙee peelee nw? (b) Insufficient disk space/DeheÙee&hle ef[mkeâ mLeeve
(a) Fork() (b) Exec() (c) Hardware failures/ne[&JesÙej efJeHeâuelee
(c) Pipe() (d) Open() (d) More than one of the above/GheÙeg&òeâ ceW mes Skeâ mes
69. Which of the following is/are the service(s)
provided by system calls?
DeefOekeâ
74. How many pins does a HDMI type A connector
efvecveefueefKele ceW mes keâewve meer mesJee/mesJeeSB efmemšce keâe@ue
have?/Skeâ HDMI šeFhe A keâveskeäšj ceW efkeâleves efheve
Éeje Øeoeve keâer peeleer nw/nQ?
nesles nw?
Services:/mesJeeSB:
(a) 18 (b) 19
i) Process creation and management/Øeesmesme (c) 25 (d) 20
ef›eâSMeve Deewj cewvepeceWš 75. Which of the following technologies is used in
ii) Device handling (I/O)/ef[JeeFme nQ[efuebie (I/O) bank cheque processing?
iii) Protection/ØeesšskeäMeve
yeQkeâ Ûeskeâ Øeesmesefmebie ceW efvecveefueefKele ceW mes efkeâme
lekeâveerkeâ keâe GheÙeesie neslee nw?
iv) Networking/vesšJeefkebâie
(a) Magnetic Ink Character Recognition (MICR)
(a) Only ii, iii and iv/kesâJeue ii, iii Deewj iv cewivesefškeâ Fbkeâ kewâjskeäšj efjkeâe@efiveMeve
(b) Only i/kesâJeue i (b) Barcode Reader/yeejkeâes[ jer[j
(c) Only i and ii/kesâJeue i Deewj ii (c) Optical Mark Reader (OMR)
(d) All of i, ii, iii and iv/ i, ii, iii Deewj iv meYeer Dee@efhškeâue ceeke&â jer[j
70. Linux was developed by: (d) Optical Character Reader (OCR)
efuevekeäme (Linux) efkeâmekesâ Éeje efJekeâefmele efkeâÙee ieÙee Lee? Dee@efhškeâue kewâjskeäšj jer[j
140 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
76. Which one of the following is used for playing yeoueves kesâ efueS Jele&ceeve Øeef›eâÙee keâer efmLeefle keâes yeÛeeves
video games?/efvecveebefkeâle ceW mes efkeâmekeâe efJeef[Ùees iesce Deewj Skeâ Deueie Øeef›eâÙee keâer efmLeefle keâes yeneue keâjves keâer
(video games) Kesueves kesâ efueS ØeÙeesie efkeâÙee peelee nw? DeeJeMÙekeâlee nesleer nw~ Fme keâeÙe& keâes peevee peelee nw~
(a) Mouse/ceeGme (a) process switch/Øeesmesme efmJeÛe
(b) Trackball/š^wkeâyee@ue (b) task switch/keâeÙe& efmJeÛe
(c) Joystick/pee@Ùeefmškeâ (c) context switch/meboYe& efmJeÛe
(d) More than one of the above
(d) status switch/efmLele efmJeÛe
GheÙeg&òeâ ceW mes Skeâ mes DeefOekeâ
83. CPU on a single chip is called
77. ceeF›eâesØeesmesmejeW kesâ mebyebOe ceW, JeerSueSmeDeeF& (VLSI)
Skeâue efÛehe hej meerheerÙet (CPU) keâes keâne peelee nw
keâe hetCe& ™he keäÙee nw?
(a) microprocessor/ceeF›eâesØeesmesmej
(a) Varying Light-Scale Integration/Jewefjbie ueeFš-
mkesâue Fbšer«esMeve (b) microcontroller/ceeF›eâeskeâvš^esuej
(b) Very Light-Scale Integration/Jesjer ueeFš-mkesâue (c) solid-state device/mewefue[-mšsš Ùegefòeâ
Fbšer«esMeve (d) More than one of the above/GheÙeg&òeâ ceW mes Skeâ mes
(c) Very Large-Scale Integration/Jesjer ueepe&-mkesâue DeefOekeâ
Fbšer«esMeve 84. Which of the following features of a computer
(d) Varying Large-Scale Integration/Jewefjbie ueepe&- determines the capacity of CPU to identify
different memory locations?
mkesâue Fbšer«esMeve
78. Which of the following is NOT a component of
kebâhÙetšj keâe efvecveefueefKele ceW mes keâewve-mee heâerÛej efJeefYeVe
a Turing machine?/efvecveefueefKele ceW mes keâewve šdÙeteEjie cesceesjer mLeeveeW keâer henÛeeve keâjves kesâ efueS CPU keâer
ceMeerve keâe Ieškeâ veneR nw? #ecelee efveOee&efjle keâjlee nw?
(a) Input tape/Fvehegš šshe (a) Size of the data bus/[sše yeme keâe meeFpe
(b) Output tape/DeeGšhegš šshe (b) Size of the address bus/S[^sme yeme keâe meeFpe
(c) Control unit/efveÙeb$eCe FkeâeF& (c) Bandwidth/yeQ[efJe[dLe
(d) More than one of the above (d) Word-length/Je[&-ueWLe
GheÙeg&òeâ ceW mes Skeâ mes DeefOekeâ 85. kebâhÙetšj ceW 'BUS' ________|
79. From which generation of computers IC's were
(a) Skeâ [sše DeeFšce Fbefiele keâjlee nw
started in use?/IC's Fmlesceeue keâjves keâer Meg™Deele
(b) peevekeâejer mebÛeefjle keâjves Jeeues efheâefpekeâue JeeÙej keâe mesš nw
efkeâme heerÌ{er kesâ mebieCekeâ mes ngF&?
(a) 1st (b) 2nd (c) Skeâ S[^sme DeeFšce Fbefiele keâjlee nw
(c) 3rd (d) 4th (d) Dee@hejsefšbie efmemšce ceW ceewpeto heâeFue keâe Skeâ heÙee&Ùe yeve ieÙee nw
80. Which of the following in the basis of computer 86. kebâhÙetšj m›eâervehej keâme&j keâer ieefleefJeefOe kesâ efueS
and holds all of the circuit that ties the efvecveefueefKele ceW mes efkeâme Øekeâej kesâ ceeGme, uespej efkeâjCeeW
different components of the computer system
together?
keâe GheÙeesie keâjles nQ?
efvecveefueefKele ceW mes keâewve-mee kebâhÙetšj keâe cetue nw Deewj (a) Optical/Dee@efhškeâue
meYeer meefke&âš keâes OeejCe keâjlee nw, pees kebâhÙetšj efmemšce (b) Electrical/Fuesefkeäš^keâue
kesâ efJeefYeVe IeškeâeW keâes Skeâ meeLe peesÌ[lee nw? (c) Gyroscopic/peeFjesmkeâesefhekeâ
(a) Hard Disk Drive/ne[& ef[mkeâ [^eFJe (d) Mechanical/cewkesâefvekeâue
(b) Motherboard/ceojyees[& 87. In computer terminology, one terabyte is equal
to......../keâchÙetšj MeyoeJeueer ceW, Skeâ šsjeyeeFš...........kesâ
(c) CPU/meer.heer.Ùet.
yejeyej neslee nw~
(d) Cable/kesâyeue
81. The ALU and control unit together are usually (a) 1024 megabytes/1024 cesieeyeeFšdme
referred to as _______ (b) 1024 bits/1024 efyešdme
S.Sue.Ùet. Deewj keâvš^esue Ùetefveš keâes Skeâ meeLe Deeceleewj (c) 1024 gigabytes/1024 ieerieeyeeFšdme
hej ............... kesâ ™he ceW peevee peelee nw~ (d) 1024 petabytes/1024 hesšeyeeFšdme
(a) Input unit (b) Processor 88. 24 efyešdme kesâ cesceesjer S[^sme jefpemšj (MAR) Jeeuee Skeâ
(c) Storage unit (d) Output unit CPU _____ cesceesjer (yeeFšdme ceW) lekeâ S[^sme keâj
82. Switching the CPU to another process requires
performing a state save of the current process mekeâlee nw~
and a state restore of a different process. This (a) 16 MB (b) 8 KB
task is known as:/CPU keâes Fmekeâer Øeef›eâÙee ceW (c) 16 KB (d) 8 MB
141 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
89. When a process is moved from main memory (a) A+B (b) AB
to the secondary storage, it is called: (c) ABC (d) A + BC
peye Skeâ Øeef›eâÙee keâes cegKÙe cesceesjer mes meskeWâ[jer mšesjspe ceW 95. Boolean algebra can be used
ues peelee nw lees Fmes keâne peelee nw– yetefueÙeve yeerpeieefCele keâe GheÙeesie efkeâÙee pee mekeâlee nw
(a) spooling/mhetefuebie (b) swapping/mJewefhebie (a) for designing the digital computers/ef[efpešue
(c) scheduling/Mes[Ÿetefuebie (d) caching/kewâefMebie keâchÙetšj keâer ef[peeFve kesâ efueS
90. Identify whether the given statements are true (b) in building logic symbols/leke&â ØeleerkeâeW kesâ
or false./efoS ieS keâLeveeW ceW mes mener Ùee ieuele keâLeveeW efvecee&Ce ceW
keâe efveOee&jCe keâerefpeS~ (c) in circuit theory/meefke&âš efmeæeble ceW
(i) Both, DRAM and cache memory have the (d) More than one of the above/GheÙeg&òeâ ceW mes Skeâ
same access speed./DRAM Deewj kewâMe cesceesjer DeefOekeâ
oesveeW keâer Skeämesme ieefle meceeve nesleer nw~ 96. The Boolean expression AB + AB' + A'C + AC
(ii) Both, SRAM and DRAM can be used as is independent of Boolean variable
main memory in a computer system./kebâhÙetšj yetefueÙeve SkeämeØesMeve AB + AB' + A'C + AC yetefueÙeve
efmemšce ceW SRAM Deewj DRAM oesveeW keâes cegKÙe JewefjSyeue _____ hej efveYe&j veneR nw~
cesceesjer kesâ ™he ceW Fmlesceeue efkeâÙee pee mekeâlee nw~ (a) A
(a) (i)-False (ii)-True/(i)-ieuele (ii)-mener (b) B
(b) (i)-True (ii)-True/(i)-mener (ii)-mener (c) C
(c) (i)-True (ii)-False/(i)-mener (ii)-ieuele (d) More than one of the above/GheÙeg&òeâ ceW mes Skeâ mes
(d) (i)-False (ii)-False/(i)-ieuele (ii)-ieuele
DeefOekeâ
97. In Binary Algebra, A + B can be implemented
91. CPU uses fastest memory to store data
by:
retrieved from RAM during a program
execution. What is the name of that memory? yeeFvejer yeerpeieefCele ceW A + B keâes keâeÙe&efvJele efkeâÙee pee
Øees«eece efve<heeove kesâ oewjeve jwce (RAM) mes Øeehle mekeâlee nw:
[sše keâes meb«enerle keâjves kesâ efueS meer.heer.Ùet. (CPU) (a) NAND gates alone/kesâJeue NAND iesš Éeje
meyemes lespe cesceesjer keâe GheÙeesie keâjlee nw~ Gme cesceesjer (b) NOR gates alone/ kesâJeue NOR iesš Éeje
keâe veece keäÙee nw? (c) AND gates alone/kesâJeue AND iesš Éeje
(a) Arthmetic Unit /DeefjLecesefškeâ Ùetefveš (d) Both (a) and (b)/(a) leLee (b) oesveesb Éeje
(b) Associative memory /SmeesefmeSefšJe cesceesjer 98. The NAND gate is AND gate followed by
_______.
(c) Chache memory /kewâMe cesceesjer
NAND iesš AND iesš nw efpeme keâe _________ Éeje
(d) Logic Unit /uee@efpekeâ Ùetefveš
Devegieceve neslee nw~
92. Which of the following memory is used in
digital camera, mobile phone, printer, etc? (a) NOT gate/NOT iesš (b) OR gate/OR iesš
efvecveefueefKele ceW mes keâewve-meer cesceesjer ef[efpešue kewâceje, (c) AND gate/AND iesš (d) NOR gate/NOR iesš
ceesyeeFue Heâesve, efØebšj Deeefo ceW ØeÙeesie keâer peeleer nw? 99. An OR gate has 4 inputs. The number of words
in truth table will be _______./OR iesš ceW 4
(a) EEPROM/F&heerjesce
(b) EPROM/F&heerjesce
Fvehegš nesles nQ~ melÙe leeefuekeâe ceW MeyoeW keâer mebKÙee nesieer
_______
(c) Flash memory/HeäuewMe cesceesjer
(a) 4
(d) Static memory/mšsefškeâ cesceesjer (b) 8
93. What type of memory stores data in a swap file (c) 16
on a hard drive? (d) More than one of the above/GheÙeg&òeâ ceW mes Skeâ mes
efkeâme Øekeâej keâer cesceesjer ne[& [^eFJe hej mJewhe heâeFue ceW DeefOekeâ
[sše meb«enerle keâjleer nw? 100. The Hexadecimal number system consists of
(a) Low memory/uees cesceesjer which of the following symbols ?
(b) Secondary memory/meskeWâ[jer cesceesjer nskeämee[smeerceue mebKÙee ØeCeeueer ceW efvecveefueefKele ceW mes
(c) Virtual memory/JeÛeg&Deue cesceesjer keâewve-mee efveefnle neslee nw ?
(d) RAM/jwce (a) 0 – 7
94. Simplify Z = AB + ABC (b) 0 –9 , A – F
(c) 0 –7 , A – F
Z = AB + ABC keâes mejueerke=âle keâjW– (d) 0 –1 , A – F
142 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
 SOLUTION : PRACTICE SET- 3
ANSWER KEY
1. (c) 11. (c) 21. (b) 31. (a) 41. (a) 51. (c) 61. (b) 71. (c) 81. (b) 91. (c)
2. (d) 12. (a) 22. (d) 32. (d) 42. (d) 52. (a) 62. (b) 72. (a) 82. (c) 92. (c)
3. (c) 13. (a) 23. (c) 33. (d) 43. (d) 53. (b) 63. (a) 73. (a) 83. (a) 93. (c)
4. (b) 14. (b) 24. (c) 34. (c) 44. (a) 54. (c) 64. (a) 74. (b) 84. (b) 94. (b)
5. (d) 15. (a) 25. (c) 35. (a) 45. (b) 55. (c) 65. (d) 75. (a) 85. (b) 95. (d)
6. (b) 16. (b) 26. (b) 36. (c) 46. (c) 56. (a) 66. (c) 76. (d) 86. (a) 96. (b)
7. (b) 17. (b) 27. (b) 37. (d) 47. (c) 57. (c) 67. (c) 77. (c) 87. (c) 97. (d)
8. (d) 18. (b) 28. (b) 38. (d) 48. (d) 58. (a) 68. (a) 78. (d) 88. (a) 98. (a)
9. (c) 19. (a) 29. (d) 39. (d) 49. (a) 59. (d) 69. (d) 79. (c) 89. (b) 99. (c)
10. (a) 20. (c) 30. (c) 40. (c) 50. (c) 60. (a) 70. (c) 80. (b) 90. (a) 100. (b)
SOLUTION
1. (c) 7. (b) Deee|šefHeâefMeÙeue FbšsefuepeWme keâe SefhuekesâMeve :-
AI keâchÙetefšbie %eeve hej OÙeeve kesâefvõle keâjlee nw Deewj heejbheefjkeâ (i) GVele mJeemLÙe mesJee (Advanced helthcare)
keâchÙetefšbie [sše Deewj metÛevee hej OÙeeve kesâefvõle keâjlee nw~ (ii) vesÛegjue uewiJeWpe Øeesmesefmebie (Natural language processing)
2. (d)
(iii) kebâhÙetšj iesefcebie (Computer gaming)
keäueeG[ keâchÙetefšbie Fbšjvesš hej DeeOeeefjle Øeef›eâÙee Deewj keâchÙetšj
SefhuekesâMeve keâe Fmlesceeue nw, pees efyepevesMe SefhuekesâMeve Dee@veueeFve (iv) Skeämeheš& efmemšce (Expert System)
cegnwÙee keâjlee nw Deewj Jesye yeÇeGpej keâe Fmlesceeue keâj Fme lekeâ hengbÛee (v) Sveeefueefmeme SJeb efJepegueeFpesMeve (Analysis & Visualization)
pee mekeâlee nw~ Fbšjvesš hej meJe&jeW ceW peevekeâeefjÙeeB (DevegØeÙeesie, Jesye (vi) YeefJe<ÙeJeeCeer (Predictions)
hespesme, Øees«eece FlÙeeefo) ncesMee Yeb[eefjle jnleer nw~ keäueeG[ (vii) F&-keâe@ceme& (E- Commerce)
keâchÙetefšbie, keâchÙetefšbie keâer Skeâ Mewueer nw efpemeceW ieeflekeâ ™he mes (viii) jesyeesefškeäme (Robotics)
heefjceehe Deewj DeeYeemeer mebmeeOeveeW kesâ Fbšjvesš hej Skeâ mesJee kesâ ™he ceW (ix) meesMeue ceeref[Ùee (Social Media)
GheueyOe keâjeÙee peelee nw~ (x) vesefJeiesMeve (Navigation)
3. (c)
(xi) Dee@šesceesyeeFue (Automobile)
DeheeÛes Hadoop meyemes JÙeehekeâ ™he mes GheÙeesie efkeâÙes peeves Jeeues
8. (d)
[sše huesšheâece& ceW mes Skeâ nw~ Ùen Skeâ Deesheve meesme& øesâceJeke&â nw pees
heÙe&Jesef#ele Deewj DeheÙe&Jesef#ele DeefOeiece (ueefveËie) kesâ yeerÛe cegKÙe Deblej–
hetjs keäuemšj ceW yeÌ[s hewceeves hej [sšemesš kesâ efueS efJeleefjle ØemebmkeâjCe
⇒ heÙe&Jesef#ele (meghejJeeFp[) ueefveËie uesyeue Jeeues [sše keâe GheÙeesie
keâes me#ece yeveelee nw~
4. (b) keâjlee nw, efpemekeâe DeLe& nw efkeâ [sše šwie Ùee uesyeue kesâ meeLe Deelee nw
Deeefš&efHeâefMeÙeue FbšsefuepeWme (AI) ceW keâF& lekeâveerkeâeW keâe meceeJesMe neslee pees cee@[ue keâes Dehesef#ele DeeGšhegš kesâ yeejs ceW metefÛele keâjlee nw,
nw, efpemeceW vesÛegjue uewiJeWpe Øeesmesefmebie (NLP) Deewj hee" efJeMues<eCe GoenjCe kesâ efueS Fcespe ceW henÛeeve kesâ efueS [sše mesš ceW, ØelÙeskeâ
(Text analytics) Meeefceue nw pees ceeveJe Yee<ee keâes mecePeves Deewj ÚefJe Skeâ uesyeue kesâ meeLe DeeSieer pees Ùen Fbefiele keâjsieer efkeâ Fcespe ceW
Øeesmesme kesâ efueS GheÙeesie efkeâS peeles nw~ keâewve meer Jemleg nw (pewmes-‘‘efkeâleeye’’ Ùee ‘‘kebâhÙetšj’’)
5. (d) ⇒ DeheÙe&Jesef#ele (DevemeghejJeeFp[) ueefveËie uesyeue jefnle [sše keâe GheÙeesie
Dee[t&Fvees Ùetvees (Arduino Uno) Skeâ ueeskeâefØeÙe Deesheve-meesme& keâjlee nw, efpemekeâe DeLe& nw efkeâ [sše efkeâmeer Yeer šwie Ùee uesyeue kesâ meeLe veneR
ceeF›eâeskebâš^esuej yees[& nw efpemekeâe GheÙeesie Fueskeäš^e@efvekeäme Øeespeskeäš kesâ Deelee nw cee@[ue Deheves Deehe [sše kesâ Yeerlej hewšve& Deewj mebyebOe Keespeves keâer
efueS efkeâÙee peelee nw~ Fmes Dee[t&Fvees IDE (Fvšer«esšs[ [sJeueheceWš keâesefMeMe keâjlee nw~ GoenjCe- Ùen efyevee peeves efkeâ GveceW keâewve meer JemlegSB nQ,
SveJeeÙejveceWš) keâe GheÙeesie keâjkesâ Øees«eece efkeâÙee ieÙee nw~ meceeve ÚefJeÙeeW keâes Skeâ meeLe mecetefnle keâjlee nw~
6. (b)
keäueeG[ keâchÙetefšbie kesâ leerve cegKÙe meefJe&me cee@[ume nesles nQ, pees Deueie- 9. (c)HTML ceW Javascript keâe GheÙeesie
Deueie Øekeâej keâer mesJeeSb Øeoeve keâjles nQ <html>
(i) Infrastructure as a Service (IaaS) <body>
GoenjCe– Amazon web Services, Microsoft Azure, <script>
Google Cloud Platform. document.write("Hello Rahul")
(ii) Platform as a services (PaaS). </script>
GoenjCe– Google App Engine, Herokee, Microsoft </body>
Azure App Services </html>
(iii) Software as a Service (SaaS) Output:
GoenjCe– Google workspace, Microsoft 365, Salesforce. Hello Rahul
143 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
10. (a) 16. (b)
HTML keâe cegKÙe GösMÙe Jesye hespeeW keâer mebjÛevee keâes heefjYeeef<ele keâjvee Skeâ ner ueeskeâue SefjÙee vesšJeke&â (LAN) kesâ Yeerlej SkeâeefOekeâ GhekeâjCeeW
nw~ Jesye hespe keâes mšeFue keâjves kesâ efueS CSS keâe GheÙeesie efkeâÙee keâes peesÌ[ves kesâ efueS efmJeÛe (Switch) keâe GheÙeesie efkeâÙee peelee nw~
peelee nw~ Jesye hespe ceW Deblejef›eâÙeeMeeruelee peesÌ[ves kesâ efueS peeJeeefm›eâhš efmJeÛe vesšJeke&â ceW efJeefYeVe GhekeâjCeeW keâes Deeheme ceW peesÌ[lee nw Deewj
keâe ØeÙeesie efkeâÙee peelee nw~ [sše hewkesâšdme keâes Gvekesâ iebleJÙe lekeâ mener {bie mes hengbÛeeves ceW ceoo
11. (c) keâjlee nw~
AVI keâe DeLe& Dee@ef[Ùees Jeeref[Ùees FbšjueerJe nw pees 1992 ceW 17. (b)
Microsoft Éeje yeveeÙee ieÙee Skeâ JÙeehekeâ ¤he mes GheÙeesie efkeâÙee IP address Ùeeveer Internet protocol S[dsme, Ùen Skeâ vecyej nw pees
peeves Jeeuee Jeeref[Ùees HeâeFue Øee¤he nw~ AVI HeâeFueeW ceW Skeâ HeâeFue ef[JeeFme keâes vesšJeke&â Deewj ogefveÙeeYej kesâ DevÙe ef[JeeFme mes peesÌ[ves ceW
kebâšsvej ceW Dee@ef[Ùees Deewj Jeeref[Ùees [sše oesveeW Meeefceue nes mekeâles nQ pees ceoo keâjlee nw~ Fbšjvesš ceW Fme IP S[dsme kesâ Éeje ner Deehekesâ
efmeb›eâveeFpe Dee@ef[Ùees-efJeLe Jeeref[Ùees (audio with video) huesyewkeâ keâer ef[JeeFme keâe henÛeevee peelee nw~
Devegceefle oslee nw~ S[dsme keäueeme jWpe
A 1.0.0.0 to 126.255.255.255
.gif- peerDeeFSHeâ (GIF) HeâeFue «eeefHeâkeâue FbšjÛeWpe Heâe@cexš (GIF) ceW
B 128.0.0.0 to 191.255.255.255
menspeer ieF& Skeâ ÚefJe nw~ C 192.0.0.0 to 223.255.255.255
.mid- MID HeâeFue Skeâ ceevekeâ MIDI (cÙetefpekeâue FbmšÍceWš D 224.0.0.0 to 239.255.255.255
ef[efpešue FbšjHesâme) HeâeFue nw efpemekeâe GheÙeesie mebieerle mebuesKeve Deewj E 240.0.0.0 to 254.255.255.255
efceßeCe keâeÙe&›eâceeW kesâ meeLe-meeLe MIDI ne[&JesÙej GhekeâjCeeW Éeje efkeâÙee 18. (b)
peelee nw~ RTSP (Real - Time Streaming Protocol) efvecveefueefKele keâeÙeeX
.dbf- dbf HeâeFue SkeämešWMeve dBase [sšeyesme HeâeFue keâe kesâ efueS GheÙeesie efkeâÙee peelee nw-
ØeefleefveefOelJe keâjlee~ Fme HeâeFue šeFhe keâes 1983 ceW dBASE kesâ • RTSP ceeref[Ùee meJe&j keâes efveÙebef$ele keâjves keâe lejerkeâe Øeoeve keâjlee nw~
meeLe hesMe efkeâÙee ieÙee Lee~ • RTSP keäueeFbšdme Deewj meJe&me& kesâ yeerÛe me$e mesšDehe Deewj ØeyebOeve
12. (a) ceW ceoo keâjlee nw~
ef[efpešue Dee@ef[Ùees mewcheue cebs efyeš [shLe ne[&JesÙej Ùee mee@heäšJesÙej kesâ • RTSP huesyewkeâ keâes JeemleefJekeâ meceÙe ceW efveÙebef$ele keâjves keâer megefJeOee
efkeâmeer efJeMes<e KeC[ keâer mebYeeefJele mešerkeâlee keâe JeCe&ve keâjleer nw pees oslee nw, pewme efkeâ hues, hee@pe, efjJeeFb[ Deewj Heâe@jJe[&~
Dee@ef[Ùees [sše keâes Øeesmesme keâjleer nw~ Deeceleewj hej GheueyOe DeefOekeâ 19. (a)
efyešdme Øeesmesme Jeeues [sše mes heefjCeece mJe™he DeeGšhegš DeefOekeâ DeÛÚe TCP/IP mšwkeâ keâes DOD cee@[ue Yeer keâne peelee nw~ FmeceW Ûeej
neslee nw~ uesÙeme& nesleer nQ Application, Host-to-Host, Internet Deewj
13. (a) Network efpemeceW mes Host-to-Host uesÙej OSI cee@[ue keâer
efJeefYevve ßesCeer ceW keâchÙetšj keâe GheÙeesie - š^ e@vmeheesš& uesÙej mes cesue Keeleer nQ Ùen uesÙej End-to-End mebÛeej keâe
KÙeeue jKeles ngS, Sb[ efmemšce kesâ yeerÛe [sše kesâ efJeÕemeveerÙe Deewj
#es$e GheÙeesie kegâMeue efJelejCe kesâ efueS efpeccesoej nw~
(i) ceekexâefšbie efJe%eeheve, nesce Mee@efhebie 20. (c)
(ii) nsuLekesâÙej [eÙeiveesefmškeâ efmemšce mepe&jer, heâecee& metÛevee WEBRTC Skeâ Deesheve-meesme& lekeâveerkeâ nw pees Jesye yeÇeGpej Deewj
ØeCeeueer, jesieer efveiejeveer ØeCeeueer ceesyeeFue SefhuekesâMeve keâes Jee@Ùeme keâe@ue, Jeeref[Ùees keâe@ue Deewj [sše
meePeekeâjCe pewmes JeemleefJekeâ meceÙe mebÛeej (real-time
(iii) efMe#ee keâchÙetšj DeeOeeefjle efMe#ee communication) keâer Devegceefle osleer nw~ Fmekesâ efueS efkeâmeer
(iv) mewvÙe efcemeeFue kebâš^esue, mewvÙe mebÛeej, mceeš& Deefleefjòeâ mee@HeäšJesÙej Ùee ne[&JesÙej keâer DeeJeMÙekeâlee veneR nesleer,
nefLeÙeej, mewvÙe mebÛeeueve Deewj Ùeespevee keäÙeeWefkeâ Ùen meerOes yeÇeGpej hej keâece keâjlee nw~
(v) keâcÙetefvekesâMeve F&-cesue Ûewefšbie Ùetpevesš Jeeref[ÙeeW keâebefuebie Deeefo~ 21. (b)
14. (b)
ef k eâmeer mebie"ve kesâ otjmLe mLeeve hej eqmLele efvepeer ueeskeâue SefjÙee
kegâkeâerpe Úesšs šskeämš HeâeFume nesles nw efpevnW JesyemeeFšdme GheÙeesiekeâlee& ves š Jeke& â (LAN) mes pegÌ[ves keâe Skeâ megjef#ele lejerkeâe JeÛeg&Deue ØeeFJesš
vesšJeke&â (VPN) nw efpemeceW ketâš uesKeve lekeâveerkeâ Éeje efvepeer
kesâ yeÇeGpej ceW mšesj keâjleer nw~ Ùes HeâeFume JesyemeeFš keâes GheÙeesiekeâlee&
metÛeveeDeesb keâe Deeoeve-Øeoeve keâjves kesâ efueS Fbšjvesš Ùee efkeâmeer
keâer peevekeâejer Deewj ØeeLeefcekeâleeS Ùeeo jKeves ceW ceoo keâjleer nQ~ megjef#ele meeJe&peefvekeâ vesšJeke&â keâe ØeÙeesie efkeâÙee peelee nw~
GoenjCe kesâ efueS Deiej efkeâmeer JesyemeeFš hej uee@efieve keâjles nQ, lees 22. (d)
kegâkeâerpe Deehekeâer uee@efieve peevekeâejer keâes menspe mekeâleer nw leeefkeâ yeej-yeej LAN kesâ [eše Øes<eCe ceW ØeÙegòeâ nesves Jeeueer Ûeej ØeCeeefueÙeeB–efšdJemšs[
uee@efieve ve keâjvee heÌ[s~ hesÙej kesâyeue, keâesSefkeämeDeue kesâyeue, HeâeFyej Deeefhškeâ kesâyeue (leerveeW
15. (a) Yeeweflekeâ mebÙeespeve) leLee jsef[Ùees lejbieW (ceeF›eâesJesye ceeref[Ùee) nw~ Deeefhškeâ
leejebkeâve (*) efmebyeue Skeâ huesmenesu[j ÚesÌ[ves kesâ efueS GheÙeesie efkeâÙee HeâeFyej kesâyeue mebÛeej ceeOÙece keâer veJeervelece lekeâveerkeâ nw efpemeceW [eše
peelee nw, pees yeeo ceW meÛe& Fbpeve Éeje mJeÛeeefuele ™he mes Yeje pee keâes uespej GhekeâjCeeW Éeje keâjesÌ[eW efyešdme Øeefle meskesâC[ keâer ieefle mes
mekeâlee nw~ Yespee peelee nw~
144 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
23. (c) 31. (a)
GheÙeg&keäle meYeer ceW mes HeâeFyej Dee@efhškeâue keâes meyemes DeefOekeâ š^ebmeefceMeve
peye Skeâ šsyeue keâe Skeâ Sefš^yÙetš otmejs šsyeue keâer ØeeFcejer keâer mes
ieefle Jeeuee ceevee peelee nw~ HeâeFyej Dee@efhškeâue š^ebmeefceMeve 1000 efceuelee nw, lees Gmes ‘‘Heâe@jsve keâer’’ keâne peelee nw~ keäÙeeWefkeâ Ùen Skeâ
Mb/s hej Ûeuelee nw~ Fmes 1000BASE-LX keâne peelee nw, peyeefkeâ DevÙe šsyeue keâer kegbâpeer keâes meboefYe&le keâjlee nw, efpemes ØeeFcejer keâer keâne
Fmekesâ efueS IEEE ceevekeâ 802.32 nw~ peelee nw~ Heâe@jsve keâer Gme efjuesMeve keâes yeveeleer nw pees Skeâ šsyeue keâes
24. (c) otmejs šsyeue mes peesÌ[leer nw~ Fmekeâe GheÙeesie efjuesMeveue [sšeyesme ceW [sše
yeÇe@[yeQ[ Skeâ neF&mheer[ Jeeueer Fbšjvesš keâveskeäMeve keâes oMee&lee nw efpemeceW keâes efuebkeâ keâjves kesâ efueS efkeâÙee peelee nw~
efJeefYevve [sše meboYeeX keâes Skeâ meeLe mebÛeeefuele efkeâÙee pee mekeâlee nw~ 32. (d)
Fmekeâe GheÙeesie efJeefYevve GösMÙeeW kesâ efueS efkeâÙee peelee nw, pewmes- Skeâ ØeeFJesš kegâbpeer, efpemes efme›esâš kegâbpeer kesâ ™he ceW Yeer peevee peelee nw,
Fbšjvesš meefHeËâie, Jeeref[ÙeeW mš^erefcebie, Dee@veueeFve iesefcebie Deewj [sše ef›eâhšes«eeheâer ceW Skeâ Ûej nw pees [sše kesâ Sefv›eâhMeve Deewj ef[ef›eâhMeve kesâ
[eGveueeseE[ie~ efueS Skeâ Suieesefjoce kesâ meeLe nw~ Fme kegâbpeer keâes kesâkeue kegâbpeer kesâ
yeÇe@[yeQ[ ceW GÛÛe yeQ[efJe[dLe nesves kesâ keâejCe yeÌ[s meeFpe keâer HeâeFue keâes pevejsšj Ùee [sše keâes ef[ef›eâhš keâjves kesâ efueS DeefOeke=âle heeefš&ÙeeW kesâ meeLe
lespeer mes Deheuees[ Deewj [eGveuees[ efkeâÙee pee mekeâlee nw~ yeÇe@[yewC[ meePee efkeâÙee peevee ÛeeefnS~ Fme Øekeâej keâer kegâbefpeÙeeB meceefcele, Demeceefcele
keâveskeäMeve kesâ efueS efJeefYevve lekeâveerkeâer Øee¤he nes mekeâles nQ~ pewmes- ef›eâhšes«eeheâer ceW cenlkehetCe& Yetefcekeâe efveYeeleer nQ~ FmeefueS keâLeve (iii) Deewj
DSL, kesâyeue HeâeFyej Deewj JeeÙejuesme Deeefo~ (iv) melÙe nQ peyeefkeâ (i) Deewj (ii) DemelÙe nQ~
25. (c) 33. (d)
eEheie keâceeb[ keâe GheÙeesie vesšJeke&â ef[JeeFme keâer GheefmLeefle Deewj mebÛeeueve yewkeâDehe keâe GHeÙeesie yewkeâDehe kesâ ¤he ceW [eryeer keâer Skeâ Øeefle yeveeves kesâ
keâer peeBÛe keâjves kesâ efueS efkeâÙee peelee nw~ Ùen vesšJeke&â keâvesefkeäšefJešer efueS efkeâÙee peelee nw~ ceewpetoe HeâeFue keâes uees[ keâjves kesâ efueS ueeseE[ie
keâer efmLeefle keâer peeBÛe keâjves kesâ efueS GheÙeesieer neslee nw Deewj otjmLe Ùetefšefuešer keâe GheÙeesie efkeâÙee peelee nw~ peyeefkeâ HeâeFue mebie"ve keâe
ef[JeeFme keâes eEheie keâjkesâ Ùen osKelee nw efkeâ keäÙee Jen GheueyOe nw Deewj GheÙeesie HeâeFueeW keâes mLeeveebleefjle keâjves Deewj veÙee Skeämesme heLe yeveeves
efkeâleveer osj ceW Øeefleef›eâÙee oslee nw~ Ùen oes IP Sb[hJeeFbš kesâ yeerÛe hewkesâš kesâ efueS efkeâÙee peelee nw Deewj Øeef›eâÙee mebie"ve keâer keâesF& GheÙeesefieleeSB
neefve Deewj jeGb[-efš^he ef[ues keâe meejebMe Øemlegle keâjlee nw~ veneR nw~
26. (b) 34. (c)
SMTP kesâ Devleie&le peye Skeâ cesue meJe&j otmej cesue meJe&j keâes cesue DBMS kesâ GoenjCe efvecve Øekeâej nw–
Yespelee nw, lees Yespeves Jeeuee meJe&j SMTP keäueeFbš kesâ ™he ceW keâeÙe& 1. MySQL 2. SQL Server
keâjlee nw~ Fmeer meceÙe Øeehle keâjves Jeeuee meJe&j SMTP meJe&j kesâ ™he 3. Microsoft Access 4. SQL ite
ceW keâeÙe& keâjlee nQ Fme Øeef›eâÙee ceW SMTP meJe&j cesue Øeehle keâjves SJeb 5. IBM Bb2
35. (a)
Øeesmesme keâjves keâe keâeÙe& keâjlee nw~
efjuesMeveue [sšeyesme ceW, efkeâmeer efjuesMeve ceW efJeMes<eleeDeeW keâer mebKÙee keâes
27. (b)
efjuesMeve keâer ef[«eer keâne peelee nw~ efjuesMeve keâer ef[«eer GmeceW ceewpeto
GheÙeg&òeâ efJekeâuhe ceW (b) melÙe veneR nw keäÙeeWefkeâ Oracle [sšeyesme ceW efJeMes<eleeDeeW keâer mebKÙee nw~ GoenjCe kesâ efueS Ùeefo 'StudentId',
mesieceWš FvensefjšWme šsyeuemhesme veneR neslee nw~ 'Name' Deewj 'Age' efJeMes<eleeDeeW Jeeuee keâesF& efjuesMeve mšt[Wš nw, lees
uee@efpekeâue mš^keäÛej ceW šsyeuemhesme, mkeâercee Dee@ypeskeäš, [sše yuee@keâ, mšg[Wš efjuesMeve keâer ef[«eer 3 nesieer~
efJemleej Deewj Keb[ Meeefceue nw~ [sšeyesme leeefke&âkeâ ™he mes Skeâ Ùee 36. (c)
DeefOekeâ šsyeuemhesme ceW efJeYeeefpele nw~ ØelÙeskeâ šsyeuemhesme [sše keâes efkeâmeer [e@keäÙetceWš keâer Skeâ lejerkesâ mes JÙeeKÙee keâjves kesâ efueS Ssmee
Yeeweflekeâ ™he mes meb«enerle keâjves kesâ efueS Skeâ Ùee DeefOekeâ [sšeheâeFume JÙeekeâjCe pees JeekeäÙe jÛevee kesâ keâejCe šskeämš mes Deueie henÛeevee
yeveelee nw pees [sšeyesme kesâ [sše keâe ØeefleefveefOelJe keâjlee nw~ peelee nw, ceeke&âDehe ueQiJespe keânueelee nw~ ceeke&âDehe ueQiJespe Skeâ
28. (b) Øekeâej keâe keâchÙetšj ueQiJespe nw, pees šwie keâe ØeÙeesie keâj efkeâmeer
metÛekeâebkeâ (Indixes) Skeâ šsyeue mes [sše kesâ ÛeÙeefvele keâe@uecme keâer [e@keäÙetcesš keâes heefjYeeef<ele keâjlee nw~ Ùen keâchÙetšj kesâ peefšue Yee<ee
Skeâ Øeefle nw pees efkeâmeer Yeer še@efhekeâ keâer Keespe keâes lespeer mes ueeves kesâ keâer Dehes#ee mejue Yee<ee ceW heâeFue keâes Øemlegle keâjlee nw~ HTML
efueS GheÙeesie efkeâÙee peelee nw~ (Hyper text markup language) Deewj XML oes ØecegKe
29. (d) ceeke&âDehe uewiJespe nw~ HTML keâe ØeÙeesie Jesyehespe keâer jÛevee ceW
DBMS cebs Sefš^yÙetš keâes efkeâmeer Yeer Fefvššer kesâ iegCe kesâ mecyevOe cebs efkeâÙee peelee nw~
ØeÙeesie efkeâÙee peelee nw~ Ssmes iegCe pees efkeâmeer Entity keâes Identify 37. (d)
keâjles nw GvnW Sefš^yÙetš keânles nw~ keâchÙetšj Øees«eeefcebie ceW (? :) conditional Dee@hejsšj keâes Skeâ šve&jer
30. (c) (ternary) Dee@hejsšj keânles nw pees efkeâ keâF& Øees«eeefcebie Yee<eeDeeW ceW yesefmekeâ
[sšeyesme cewvespeceWš efmemšce (DBMS) meeceevÙele: [sše yewkeâDehe Deewj meMele& DeefYeJÙeefòeâ kesâ efueS efmebšskeäme (syntax) keâe Yeeie neslee nw~ Fmes
[sše ueesef[bie pewmes keâeÙeeX keâes mebYeeueleer nw, uesefkeâve Øeesmesme šve&jer Ùee meMele& Dee@hejsšj kesâ veece mes peevee peelee nw~
Dee@ieb&veeFpesMeve DBMS keâe cegKÙe GheÙeesie veneR nw Øeesmesme 38. (d)
Dee@ieb&veeFpesMeve Deeceleewj hej Dee@hejsefšbie efmemšce Deewj DevÙe DevegØeÙeesieeW Ssjs meceeve Øekeâej kesâ [sše šeFhe keâe keâueskeäMeve neslee nw efpemes Skeâ
mes mebyebefOele neslee nw~ keâe@ceve veece kesâ Éeje ØeoefMe&le keâjles nw~
145 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
Ùeefo Ssjs ceW SefueceWšeW keâer kegâue mebKÙee N nes lees GÛÛelece metÛekeâebkeâ N 45. (b)
- 1 neslee nw keäÙeeWefkeâ Ssjs ceW SefueceWš, metÛekeâebkeâ (index) 0 mes mšesj Array keâe nJeeB SefueceWš
neslee nw~ array [n –1];
39. (d) peneB hej Array-name Skeämesme veece nww Deewj n Ssjs ceW SefueceWš keâer
Ssjs meceeve Øekeâej kesâ [sše keâe meb«en nw efpemeceW [sše keâes efmekeäJeWefMeÙeue kegâue mebKÙee nw, Array keâer indexing 0 mes mšeš& nesleer nw, FmeefueS
(ueieeleej) jKee peelee nw~ nJeeB SefueceWš keâes peesÌ[ves kesâ efueS nce n-1 keâe GheÙeesie keâjles nQ~
40. (c) 46. (c)
GheÙeg&òeâ Øees«eece Skeâ yeeFvejer š^er [sše mš^keäÛej nw~ C++ Skeâ Ssmeer lekeâveerkeâ keâe GheÙeesie keâjlee nw pees Ùen megefveefMÛele
yeeFvejer š^er Skeâ š^er-šeFhe vee@ve-ueerefveÙej [sše mebjÛevee nw efpemeceW keâjleer nw, efkeâ yesme keäueeme keâe kesâJeue Skeâ GoenjCe ceewpeto nw~ Fme
ØelÙeskeâ hewjWš kesâ DeefOekeâlece oes ÛeeFu[ nesles nw~ yeeFvejer š^er ceW ØelÙeskeâ lekeâveerkeâ keâes JeÛeg&Deue FvensefjšWme keâne peelee nw~ JeÛeg&Deue FvensefjšWme
vees[ ceW [sše lelJe kesâ meeLe Skeâ yeeSb Deewj oeSb meboefYe&le neslee nw~ š^er ceW ceušerheue keâe@heer mes yeÛee peelee nw, FmeceW Skeâ keâe@heer mes meejs
kesâ heoeveg›eâce kesâ Meer<e& hej efmLele vees[ keâes ™š vees[ keâne peelee nw~ efÛeu[^sve keâes Fvensefjš keâj uesles nQ~
DevÙe Ghe-vees[dme jKeves Jeeues vees[ hewjWš vees[ nw~ 47. (c)
Dequeue (Double-ended queue) Skeâ Linear [sše mš^keäÛej
nw, efpemeceW lelJeeW keâes Front leLee Rear oesveeW efmejeW mes add Yeer keâj
mekeâles nw Deewj Remove Yeer keâj mekeâles nQ~
48. (d)
C++ ceW, mš^keäÛeme& Deewj keäueemespe oes Deueie-Deueie lejerkesâ mes [sše mebjÛevee
keâjves kesâ efueS ØeÙegòeâ nesleer nw~ mš^keäÛej [sše keâes «eghe ceW jKeves kesâ efueS
ØeÙegòeâ nesleer nw, uesefkeâve GveceW efJeMes<e HebâkeäMeve veneR nesles nw~ mš^keäÛej ceW,
Skeâ hewjWš vees[ ceW oes ÛeeFu[ vees[ nesles nw, uesheäš ÛeeFu[ Deewj jeFš cescyej ef[Heâe@uš ™he mes meeJe&peefvekeâ (Public) nesles nQ, peyeefkeâ keäuee@mespe ceW
ÛeeFu[~ nwefMebie, vesšJeke&â š^wefheâkeâ kesâ efueS, [sše kebâØesMeve, yeeFvejer Jes ef[Heâe@uš ™he mes efvepeer (Private) nesles nw~ keäuee@mespe [sše kesâ meeLe-meeLe
nerhme lewÙeej keâjvee~ yeeFvejer meÛe& š^er, kegâÚ Ssmes ShueerkesâMeve nw pees efJeMes<e ceWLe[dme keâes Yeer OeejCe keâj mekeâleer nw~
yeeFvejer š^er keâe GheÙeesie keâjles nw~ 49. (a)
41. (a) Fvej yuee@keâ kesâ Deboj, JewefjSyeue i keâes ef[keäuesÙej efkeâÙee Deewj JewuÙet 30
JeÛeg&Deue hebâkeäMeve kesâ meeLe hee@ueerceeefhe&âkeâ Øees«eeefcebie efmJeÛe uee@efpekeâ keâer kesâ meeLe FefveMeueeFpe efkeâÙee peelee nw~
DeeJeMÙekeâlee keâes meceehle keâj mekeâleer nw~ Øees«eecej meceleguÙe leke&â peye printf keâes keâe@ue efkeâÙee peelee nw, lees Ùen Fvej yuee@keâ (pees 30
(equivalent logic) keâjves kesâ efueS JeÛeg&Deue hebâkeäMeve leb$e keâe nw) mes i keâe ceeve efØevš keâjlee nw, Gmekesâ yeeo iueesyeue JewefjSyeue ::i,
GheÙeesie keâj mekeâlee nw, Fme Øekeâej Deeceleewj hej efmJeÛe uee@efpekeâ mes pees efkeâ 10 nw~ :: Dee@hejsšj keâe GheÙeesie iueesyeue JewefjSyeue i lekeâ
pegÌ[er $egefšÙeeW kesâ šeFhe mes yeÛee pee mekeâlee nw~ hengbÛeves kesâ efueS efkeâÙee peelee nw~
42. (d) 50. (c)
CDbl keâe hetje veece keâvJeš& št [yeue nw pees VBA ceW šeFhe neF&-uesJeue ueQiJespe ceW efueKes ieS Øees«eece keâes ceMeerve keâes[ ceW yeoueves
keâveJepe&ve hebâkeäMeve ceW Meeefceue [sše ™heevlejCe hebâkeäMeve ceW mes Skeâ nw~ Jeeues mee@heäšJesÙej keâes ueQiJespe Øeesmesmej Yeer keâne peelee nw~ ueQiJespe
[sše keâes mebmeeefOele (processed) keâjles meceÙe Deehe hetCeeËkeâ mebKÙeeDeeW Øeesmesmej leerve Øekeâej kesâ nesles nw–
keâes oesiegvee keâjves kesâ efueS heefjefmLeefleÙeeW keâe meecevee keâj mekeâles nw~ (i) keâcheeFuej (ii) DemeWyeuej (iii) FbšjØesšj
43. (d) 51. (c)
IDLE (Integrated Development and Learning
ceMeerve Yee<ee keâes efvecve mlejerÙe Yee<ee kesâ veece mes Yeer peevee peelee
Environment) heeFLeve SefhuekesâMeve keâes efJekeâefmele keâjves kesâ efueS
nw~ ceMeerve Yee<ee ceW kesâJeue oes Øeleerkeâ 1 Deewj 0 nesles nQ~ ceMeerve
Skeâ [sef[kesâšs[ huesšHeâece& Ùee mee@HeäšJesÙej nw~ Ùen Skeâ hetCe& Sef[šj nw
Yee<ee kesâ meYeer efveoxMe yeeFvejer mebKÙee 1 Deewj 0 kesâ ™he ceW efueKeer
efpemekeâe GheÙeesie heeFLeve keâes[ yeveeves, mebMeesefOele keâjves Deewj efve<heeoefle
peeleer nQ~
keâjves kesâ efueS efkeâÙee peelee nw~ Fmes Skeâue keâLeveeW keâes efve<heeefole keâjves
52. (a)
kesâ efueS Ùee heeFLeveMesue keâer lejn keâer Fmlesceeue efkeâÙee pee mekeâlee nw~
44. (a) heäuees Ûeeš& Skeâ Øekeâej keâe [eÙe«eece nw pees SuieesefjLece Jeke&â Øeesmesme keâes
HTML ceW, <style> šwie keâe GheÙeesie efkeâmeer efJeefMe° Sefuecesvš efjØespesvš keâjlee nw~
Ùee Jesye hespe kesâ Yeerlej Sefuecesvš kesâ Skeâ mesš kesâ efueS FveueeFve
CSS (kewâmkesâef[bie mueeFue Meeršdme) keâes heefjYeeef<ele keâjves kesâ efueS
efkeâÙee peelee nw~ Ùen yeenjer CSS heâeFue keâer DeeJeMÙekeâlee kesâ
efyevee meerOes meece«eer hej mšeFefuebie efveÙece ueeiet keâjves keâer Devegceefle
oslee nw~ Skeâ mes DeefOekeâ JewuÙet keâes Fvehegš uesves kesâ efueS
146 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
53. (b) 63. (a)
vescemhesme kesâ Éeje Øees«eeefcebie Yee<ee cebs GheÙeesie ngS veeceeW kesâ Skeâ mesš Demescyeuej keâchÙetšj keâe Jen Øees«eece neslee nw pees Demescyeueer Yee<ee ceW
keâes DevÙe mesšeW mes Deueie jKee pee mekeâlee nw~ efueKes ieÙes keâes[ keâes ceMeerveer Yee<ee ceW heefjJeefle&le keâjlee nw~ Ùen
54. (c) keâchÙetšj Øees«eece nw Fmekesâ Deefleefjkeäle meYeer ne[&JesÙej nw~
mesueskeäMeve mee@š& Skeâ mejue mee@efšËie Suieesefjodce nw~ Ùen mee@efšËie 64. (a)
Siueesefjodce Skeâ Fve-huesme leguevee DeeOeeefjle Siueesefjodce nw efpemeceW keâchÙetšj ceW JeÛeg&Deue cesceesjer Øeesmesmej Éeje leye pesvejsš keâer peeleer nw
efuemš keâes oes YeeieeW ceW efJeYeeefpele efkeâÙee peelee nw uesheäš Úesj hej mee@š& peye cegKÙe cesceesjer keâe Deekeâej Øeesmesmej keâer #ecelee mes keâce nes~
efkeâÙee ieÙee Yeeie Deewj jeFš Úesj hej Devemeesšx[ Yeeie~ ØeejcYe ceW, JeÛe&gDeue cesceesjer keâe Deekeâej S[^sme ueeFve Éeje efveOee&efjle neslee nw
mee@š& efkeâÙee ieÙee Yeeie Keeueer neslee nw Deewj efyevee mee@š& efkeâÙee ieÙee Yeeie pewmes–32 S[^sme ueeFve 4 GB keâer JeÛeg&Deue cesceesjer mhesme keâes
hetjer efuemš neslee nw~ efveOee&efjle keâjlee nw hejvleg peneB ef[mkeâ mhesme ceewpeto nw, JeneB Gmekeâer
55. (c) pe¤jle nesleer nw~
C++ ceW, efkeâmeer Ssjs keâes Gmekesâ [sše šeFhe Deewj Ssjs kesâ veece keâes 65. (d)
efveefo&° keâjkesâ, Gmekesâ yeeo Ssjs kesâ Deekeâej kesâ meeLe Jeiee&keâej keâes‰keâ efuevekeäme ceW stty keâceeb[ keâe GheÙeesie šefce&veue ueeFve mesefšbie keâes
Éeje ef[keäuesÙej keâj mekeâles nw~ GoenjCe kesâ efueS, int array[10]; yeoueves Deewj efØebš keâjves kesâ efueS efkeâÙee peelee nw~ Ùen keâceeb[ cetue
56. (a) ™he mes šefce&veue efJeMes<eleeDeeW keâes oMee&lee nw~
PASCAL Skeâ Structured Øees«eeefcebie Yee<ee nw, Fmekeâe GheÙeesie 66. (c)
Structured code efueKeves kesâ efueS efkeâÙee pee mekeâlee nw~ BIOS (Basic Input/Output System) mee@heäšJesÙej ceojyees[& hej
PASCAL ceW efJeefYeVe HebâkeäMevme, Øeesmeerpeme&, Deewj cee@[Ÿetume keâe Skeâ iewj-Jee<heMeerue (non-volatile) ROM (Read Only
GheÙeesie keâjkesâ keâes[ keâes DeÛÚer lejn mes Structured efkeâÙee pee Memory) efÛehe hej meb«enerle neslee nw~ DeeOegefvekeâ keâchÙetšj efmemšce
mekeâlee nw~ peyeefkeâ FORTRAN Yee<ee Jew%eeefvekeâ Deewj DeefYeÙeebef$ekeâ ceW, BIOS meece«eer (Contents) keâes Skeâ heäuewMe cesceesjer efÛehe hej
ieCeveeDeeW kesâ efueS ef[peeFve keâer ieF& nw Deewj BASIC Yee<ee ØeejbefYekeâ meb«enerle efkeâÙee peelee nw leeefkeâ ceojyees[& mes efÛehe keâes nšeS efyevee
Øees«eeceme& kesâ efueS ef[peeFve keâer ieF& nw~ meece«eer (Contents) keâes efheâj mes efueKee pee mekesâ~ Ùen veF&
57. (c) megefJeOeeDeeW keâes peesÌ[ves Ùee yeie (bug) keâes "erkeâ keâjves kesâ efueS BIOS
mLeeefvekeâ Fueekeâe (Spatial Locality) Ssjs keâes DeJeOeejCee keâer mee@heäšJesÙej keâes Deemeeveer mes Dehe«es[ keâjves keâer Devegceefle oslee nw~
DelÙeefOekeâ GheÙeesie keâjlee nw~ Ùen DeJeOeejCee Fme Øekeâej keâer nesleer nw 67. (c)
peye Skeâ Øees«eece efvejblejlee mes efkeâmeer Ssjs kesâ heeme keâece keâjlee nw Deewj efuevekeäme ceW yuee@keâ heâeFueW, ef[JeeFme heâeFue nesleer nQ, pees efmemšce
Gme Ssjs ceW jKeer ieF& [sše keâes efHeâj mes Øeehle keâjlee nw~ Fmemes kewâMe ne[&JesÙej Jeeues IeškeâeW keâes yeheâ[& Skeämesme Øeoeve keâjleer nw Deewj heâeFue
cesceesjer Deewj DevÙe mLeeefvekeâ [sše mebjÛeveeDeeW keâe ueeYe G"eÙee pee efmemšce kesâ ceeOÙece mes ef[JeeFme [^eFJejeW kesâ meeLe mebÛeej keâer Skeâ efJeefOe
mekeâlee nw efpememes Øees«eece keâes keâeÙe&#ecelee yeÌ{leer nw~ Øeoeve keâjleer nw~
58. (a) 68. (a)
Applet Skeâ Úesše peeJee Øees«eece neslee nw, pees yeÇeGpej ceW jve keâjlee heâeske&â efmemšce keâe@ue keâe GheÙeesie Skeâ veF& Øeef›eâÙee yeveeves kesâ efueS
nw~ Ùen HTML ceW included Skeâ Ssmee Øees«eece neslee nw, pees efkeâÙee peelee nw, efpemes ÛeeFu[ Øeesmesme keâne peelee nw, pees Fork()
Dee@hejsefšbie efmemšce SJeb ne[&JesÙej keâes ØeYeeefJele efkeâS efyevee HTML ceW keâe@ue (hewjWš Øeesmesme) keâjves Jeeueer Øeef›eâÙee kesâ meeLe-meeLe Ûeueleer nw Skeâ
veF& ÛeeFu[ Øeesmesme yeveves kesâ yeeo, oesveeW Øeesmesme Fork efmemšce keâe@ue
keâeÙe& keâj mekeâlee nw~
kesâ yeeo Deieues efveoxMe keâes efve<heeefole keâjWies~
59. (d)
69. (d)
efoS ieS efJekeâuheeW ceW efJekeâuhe (d) jsueJes efjpeJexMeve efmemšce Ùetefšefuešer efmemšce keâe@ue Éeje keâF& meskeeSB Øeoeve keâer peeleer nQ~ Ùes nQ-
mee@heäšJesÙej mes mecyeefvOele veneR nw peyeefkeâ Text editor SbšerJeeÙejme Øeef›eâÙee efvecee&Ce Deewj ØeyebOeve, cegKÙe cesceesjer ØeyebOeve, megj#ee, ef[keeFme
Øees«eece Deewj ef[mkeâ kebâØesMeve mee@HeäšJesÙej Ùegefšefuešer mee@HeäšJesÙej nw~ nQ[efuebie (I/O), ÌHeâeFue Skeämesme, efveo&sefMekeâe Deewj HÌ eâeFue efmemšce
60. (a) ØeyebOeve, vesškeefkeâËie, metÛevee jKejKeeke, mebÛeej~
JeW[j Éeje GlheVe Øees«eece heefjJele&ve keâes hewÛe (Patch) keâne peelee nw~ 70. (c)
hewÛe JeemleJe ceW $egefšÙeeB nesleer nQ, efpevnW Úesšs mee@HeäšJesÙej Øees«eece keâer efuevekeäme Skeâ cegÌHeäle, Keguee œeesle Deewj ueeskeâefØeÙe ceušeršeefmkeâbie
meneÙelee mes "erkeâ efkeâÙee peelee nw~ Dee@hejsefšbie efmemšce nw efpemes 17 efmelebyej 1991 keâes efueveme šesjkeeu[dme
61. (b) Éeje efkekeâefmele efkeâÙee ieÙee Lee~ efuevekeäme Skeâ cegÌHeäle Deewj keeÙejme-cegòeâ
ef[mkeâkeäueerveDehe Skeâ GheÙeesefielee (Ùetefšefuešer) mee@heäšJesÙej nw efpemes Dee@hejsefšbie efmemšce nw~ Fmekeâe GheÙeesie heermeer, ceesyeeFue ef[keeFme, meghej
henueer yeej efJeb[espe 98 kesâ meeLe hesMe efkeâÙee ieÙee Lee~ Ùen keâbhÙetšj Deeefo ceW efkeâÙee peelee nw~
GheÙeesiekeâlee&DeeW keâes Gve heâeFueeW keâes nševes keâer Devegceefle oslee nw 71. (c)
efpevekeâer Deye DeeJeMÙekeâlee vener nw~ [s[uee@keâ Skeâ Ssmeer efmLeefle nw peneB oes Ùee oes mes DeefOekeâ Øeef›eâÙeeSb
62. (b) Skeâ-otmejs keâer Øeleer#ee keâj jner nesleer nw~ GoenjCe kesâ efueS, ceeve
mee@heäšJesÙej heeFjsmeer mee@heäšJesÙej keâer DeJewOe keâe@heer yeveeves, efJeleefjle ueerefpeS, nceejs heeme oes Øeef›eâÙeeSB P1 Deewj P2 nQ~ Øeef›eâÙee P1 ceW
keâjves, cee@[erheâeF& keâjves leLee efyevee Devegceefle kesâ GheÙeesie keâjvee nw~ mebmeeOeve R1 nw Deewj mebmeeOeve R2 keâer Øeleer#ee keâj jne nw~ Gmeer meceÙe,
147 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
 Øeef›eâÙee P2 ceW mebmeeOeve R2 nw Deewj mebmeeOeve R1 Øeleer#ee keâj jne nw~ 78. (d)
lees Øeef›eâÙee P1 Deheves mebmeeOeve keâes peejer keâjves kesâ efueS Øeef›eâÙee P1 keâer šÙetefjbie ceMeerve keâes cegKÙele: 7 IeškeâeW kesâ ™he ceW meb«eefnle efkeâÙee
Øeleer#ee keâj jner nw Deewj keâesF& Yeer mebmeeOeve peejer veneR keâj jne nw peelee nw~
FmeefueS, oesveeW mebmeeOeve peejer keâjves kesâ efueS Skeâ otmejs keâer Øeleer#ee 1. DeJemLeeDeeW keâe heefjefcele mecettn
keâj jns nQ~ FmeceW Deveble Øeleer#ee nesleer nw Deewj ÙeneB keâesF& keâece veneR 2. Fvehegš ØeleerkeâeW keâe heefjefcele mecetn
neslee nw Fmes [s[uee@keâ keânles nw~ 3. šshe Øeleerkeâ
4. ØeejefcYekeâ DeJemLee
5. Debeflece DeJemLeeDeeW keâe mecetn
6. Fvehegš kesâ efueS Debeflece ceeke&âj kesâ ™he ceW GheÙeesie efkeâS peeves Jeeuee
Skeâ efjòeâ Øeleerkeâ
7. Skeâ meb›eâceCe Ùee cewefhebie HebâkeäMeve
efkeâmeer Dee@hejsefšbie efmemšce ceW [s[uee@keâ yeveeves kesâ efueS Ûeej keâejCe Dele: keâš^esue Ùetefveš Deewj DeeGšhegš šshe šŸetefjbie ceMeerve kesâ keâcheesvesvš
nesles nw~ veneR nw~
1. cÙegÛegDeue Skeämekeäuetpeve 79. (c)
2. vees Øeer-FceesMeve leermejer heerÌ{er (1964 - 1975) kesâ keâchÙetšme& ceW š^ebefpemšj keâer peien
IC efÛehe (IC - Integrated circuit chip) keâe ØeÙeesie DeejbYe ngDee
3. nesu[ Deewj Jesš
efpememes keâchÙetšj keâe ueIeg™heCe mebYeJe nes mekeâe~ Meg™Deele ceW SSI
4. mekeg&âuej Jesš (Small Scale Integration) leLee yeeo ceW MSI (Medium
72. (a)
Scale Integration) keâe efJekeâeme ngDee~ efpemecebW Skeâ IC efÛehe ceW
Dee@hejseEšie efmemšce cesceesjer øesâcme keâe š^wkeâ jKeves kesâ efueS Skeâ øesâce
mewkeâÌ[es Fueskeäš^eefvekeâ GhekeâjCeeW, pewmes š^ebefpemšj, ØeeflejesOekeâ leLee
šsyeue keâe GheÙeesie keâjlee nw~ øesâce šsyeue ceW Ùen efjkeâe@[& neslee nw efkeâ
kewâhesefmešj keâe efvecee&Ce mecYeJe ngDee~
efkeâleves øeWâce DeeJebefšle efkeâS ieS nw; efkeâleves GheÙeesie ceW nw Deewj efkeâleves
80. (b)
DeeJebšve kesâ efueS GheueyOe nw~ øesâce šsyeue ceW ØelÙeskeâ ØeefJeef° Skeâ
ceojyees[& efkeâmeer Yeer kebâhÙetšj keâe yewkeâyeesve neslee nw pees kebâhÙetšj efmemšce
Yeeweflekeâ cesceesjer øesâce kesâ efueS nesleer nw~
kesâ efJeefYeVe IeškeâeW keâes Skeâ meeLe pees[Ì lee nw~ efpememes keâchÙetšj kesâ otmejs
73. (a)
LeÇweEMeie nesves keâe cegKÙe keâejCe DelÙeefOekeâ hesefpebie ieefleefJeefOe nw~ LeÇewefMebie ef[JeeFme Deeheme ceW keâveskeäš nesles nQ~ Fmes cesve yees[& Ùee efmemšce yees[&
leye neslee nw peye Dee@hejsefšbie efmemšce DeefOekeâ meceÙe hesefpebie ceW JÙeleerle Yeer keâne peelee nw~
keâjlee nw Deewj yengle yeej hespeeW keâes mJewhe keâjlee nw, efpememes efmemšce keâer 81. (b)
Øeesmesmej Skeâ Fbšer«esšs[ Fueskeäš^eefvekeâ meefke&âš neslee nw pees DebkeâieefCeleerÙe,
ØeoMe&ve #ecelee keâce nes peeleer nw~
uee@efpekeâue Fvehegš Deewj yesefmekeâ Fvmš^keäMeve keâes Dee@hejsš keâjlee nw~
74. (b)
82. (c)
HDMI Skeâ Øeemhesefjšer Dee@ef[ÙeeW, Jeeref[Ùees Fbšjhesâme nw pees Skeâ
DemecheerefÌ[le (uncompressed) kebâhÙetšj [sše, Jeeref[Ùees Øeespeskeäšj Skeâ keâe@všskeäš efmJeÛe Skeâ Øeef›eâÙee Ùee LeÇs[ (thread) keâer efmLeefle keâes
ef[efpešue šsueerefJepeve Ùee ef[efpešue Dee@ef[Ùees ef[JeeFme kesâ efueS ef[mhues meb«enerle keâjves keâer Øeef›eâÙee nw leeefkeâ Fmes yeneue efkeâÙee pee mekesâ Deewj
kebâš^esuej pewmes HDMI Deveg™he Œeesle ef[JeeFme mes mecheeref[le yeeo ceW efheâj mes efve<heeove efkeâÙee pee mekesâ~ Ùen keâF& Øeef›eâÙeeDeeW keâes
(compressed) Jeeref[Ùees [sše keâes mecheeref[le Ùee Demecheeref[le keâjlee Skeâ meWš^ue Øeesmesefmebie Ùetefveš (CPU) meePee keâjves keâer Devegceefle oslee nw
nw~ Skeâ HDMI šeFhe A ceW 19 efheve neslee nw~ Deewj Ùen Skeâ ceušeršeefmkebâie Dee@hejsefšbie efmemšce keâer Skeâ DeefveJeeÙe&
75. (a) efJeMes<elee nw~
yeQkeâ Ûeskeâ Øeesmesefmebie ceW cewivesefškeâ Fbkeâ kewâjskeäšj efjkeâefiveMeve (MICR) 83. (a)
lekeâveerkeâ keâe GheÙeesie efkeâÙee peelee nw~ Ùen Skeâ Ssmeer lekeâveerkeâ nw Skeâue efÛehe hej meerheerÙet keâes ceeF›eâesØeesmesmej Yeer keâne peelee nw Ùen Skeâ
efpemekeâe GheÙeesie efJeMes<e mÙeener Deewj hee$eeW keâer ceoo mes omleeJespe keâer efmeefuekeâe@ve efÛehe ceW meefcceefuele neslee nw Deewj keâchÙetšj keâer ØecegKe
ceewefuekeâlee hejer#eCe ceW efkeâÙee peelee nw~ yeQkeâ Ûeskeâ kesâ veerÛes Úhes veew Øeesmesefmebie Ùetefveš neslee nw pees [sše keâes Øeesmesme keâjlee nw Deewj efveoxMe
DebkeâeW keâes MICR keâes[ keâne peelee nw~ oslee nw~
76. (d) 84. (b)
pee@Ùeefmškeâ, š^wkeâyee@ue Deewj ceeGme Ùes meYeer Fvehegš ef[JeeFme nQ efpevekeâe S[^sme yeme keâe meeFpe cesceesjer mLeeveeW keâer henÛeeve keâjves kesâ efueS CPU keâer
GheÙeesie Jeeref[ÙeeW iescme Deewj DevÙe SefhuekesâMevme ceW iesce kebâš^esue Ùee #ecelee efveOee&efjle keâjlee nw DeLee&led S[^sme yeme keâe meeFpe Ùen efveOee&efjle keâjlee
nw efkeâ CPU Éeje efkeâleves S[^sme lekeâ hengbÛee pee mekeâlee nw~ Ùen RAM keâe
kegâÚ efJeefMe° keâeÙeeX keâes kebâš^esue keâjves kesâ efueS efkeâÙee peelee nw~
DeefOekeâlece Deekeâej Yeer efveOee&efjle keâjlee nw~ GoenjCe kesâ efueS Skeâ 20-efyeš
77. (c) S[^sme yeme 220 (1MB) lekeâ hengbÛe mekeâleer nw~
ceeF›eâesØeesmesmej kesâ mebyebOe ceW, Jeer.Sue.Sme.DeeF&. (VLSI) keâe hetCe& ™he 85. (b)
Jesjer uee@pe&-mkesâue Fbšer«esMeve (Very Large - Scale Integration) yeme (Bus) Skeâ keâcÙegefvekesâMeve efmemšce nw pees [sše keâes efJeefYeVe
neslee nw~ Ùen Skeâ lejn keâe Fvšer«esšs[ meefke&âš (IC) neslee nw efpemeceW IeškeâeW ceW š^evmeheâj keâjlee nw~ Ùen peevekeâejer mebÛeefjle keâjves Jeeues
keâeheâer meejs š^ebefpemšj ueies nesles nQ~ efheâefpekeâue JeeÙej keâe mesš nw~
148 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
86. (a) 94. (b) Z = AB + ABC
Dee@efhškeâue ceeGme, ceeGme keâer cetJeceWš keâe helee ueieeves kesâ efueS uespej = AB (1 + C )
keâe GheÙeesie keâjleer nw~ Dee@efhškeâue ceeGme heejcheefjkeâ ceeGme yee@ue, = AB .1
Fueskeäš^escewkesâefvekeâue š^ebme[Ÿetmej kesâ mLeeve hej LED, Dee@efhškeâue meWmej = AB
Deewj ef[efpešue efmebiveue Øeesmesefmebie keâe GheÙeesie keâjlee nw~ 95. (d)
87. (c) yetefueÙeve Deuepesyeje keâe GheÙeesie ef[efpešue Fueskeäš^e@efvekeâ meefke&âšdme,
FkeâeF& [sše ceeheve DeeuesKe efJemleej keâchÙetšj efJe%eeve Deewj meefke&âš efmeæevle ceW efJeMues<eCe efkeâÙee peelee nw~
1 efyeš Skeâue efÉDeeOeejer Debkeâ (0 Ùee 1) Ùen Skeâ uee@efpekeâ keâes[ kesâ ™he ceW Fvehegš Deewj DeeGšhegš keâes jerØespeWš
1 efveyeue 4 efyeš (Skeâ yeeFš keâe DeeOee) keâjves kesâ efueS GheÙeesie efkeâÙee peelee nw, efpememes meefke&âš keâer JÙeehekeâlee
Deewj ØeJe=efòe keâes efJeMuesef<ele efkeâÙee pee mekeâlee nw~ pewmes efkeâ AND,
1 yeeFš 8 efyeš
OR, NOT, NAND, NOR, XOR Deewj XNOR iesšdme pees
1 efkeâueesyeeFš 1024 yeeFš meefke&âš ef[peeFve keâes megefJeOeepevekeâ yeveeles nw~
1 cesieeyeeFš 1024 efkeâueesyeeFš 96. (b)yetefueÙeve SkeämeØesMeve
1 ieerieeyeeFš 1024 cesieeyeeFš AB+AB'+A'C+AC keâes meb#eshe ceW efueKee pee mekeâlee nw pewmes:
1 šsjeyeeFš 1024 ieerieeyeeFš AB + AB' + A'C + AC
1 hesšeyeeFš 1024 šsjeyeeFš ⇒ A(B + B') + A'C + AC
88. (a) ⇒ A(1) + A'C + AC (B + B' = 1) Inverse Law
cesceesjer S[^sme jefpemšj (MAR) Skeâ meerheerÙet jefpemšj neslee nw efpemekeâe ⇒ A + AC + A'C (A+B = B+A) Commutative
keâeÙe& cesceesjer S[^sme keâes mšesj keâjvee neslee nw~ 24 efyešdme kesâ cesceesjer Law
S[^sme jefpemšj (MAR) Jeeuee Skeâ CPU 16 MB cesceesjer (yeeFšdme ⇒ A + C(A + A')
ceW) lekeâ S[^sme keâj mekeâlee nw~ ⇒ A + C(1) (A + A' = 1) Inverse Law
⇒ A+C
89. (b)
mJewefhebie Skeâ Ssmee leb$e (Machanism) nw efpemeceW Skeâ Øeef›eâÙee keâes ÙeneB nce osKe mekeâles nw efkeâ yetefueÙeve JewefjSyeue B keâe keâesF& ØeYeeJe veneR
DemLeeÙeer ™he mes cegKÙe cesceesjer mes meskesâ[jer mšesjspe (ef[mkeâ) ceW mJewhe nw~ ÛeBtefkeâ B efvejblej veneR nw, FmeefueS Gmekeâe keâesF& ØeYeeJe veneR nw~
97. (d)
efkeâÙee pee mekeâlee nw Deewj Gme cesceesjer keâes DevÙe Øeef›eâÙeeDeeW kesâ efueS
yeeFvejer yeerpeieefCele ceW A+B (OR Gate) keâes meeJe&ef$ekeâ iesš NAND
GheueyOe keâjeÙee pee mekeâlee nw~
Deewj NOR Gate Éeje keâeÙee&efvJele efkeâÙee pee mekeâlee nw~
90. (a)
(i) DRAM Deewj kewâMe cesceesjer oesveeW keâer Skeämesme ieefle meceeve veneR
nesleer nw, kewâMe cesceesjer keâer ieefle DRAM keâer Dehes#ee leer›e nesleer nw~
Dele: keâLeve (i) ieuele nw~
98. (a)
(ii) kebâhÙetšj efmemšce ceW SRAM (Static Random Access
NAND (efveiesefšJe AND) iesš Skeâ AND iesš Deewj Gmekesâ
Memory) Deewj DRAM (Dynamic Random Access
yeeo NOT iesš kesâ ™he ceW keâeÙe& keâjlee nw~ Ùen uee@efpekeâue
Memory) oesveeW keâes cegKÙe cesceesjer kesâ ™he ceW Fmlesceeue efkeâÙee pee
Dee@hejsMeve "and" kesâ yeeo efve<esOe kesâ lejerkesâ mes keâeÙe& keâjlee nw
mekeâlee nw~ Dele: keâLeve (ii) mener nw~
Ùeefo oesveeW Fvehegš melÙe nQ lees DeeGšhegš ieuele nw, DevÙeLee
91. (c)
DeeGšhegš melÙe nw~
kewâMe cesceesjer Gme cesceesjer keâe veece nw efpemes meerheerÙet Øees«eece efve<heeove kesâ
99. (c)
oewjeve jwce mes Øeehle [sše keâes meb«enerle keâjves kesâ efueS meyemes lespe cesceesjer OR iesš kesâ Truth table ceW vecyej keâer mebKÙee Fvehegš keâer mebKÙeehej
kesâ ™he ceW GheÙeesie keâjlee nw~ efveYe&j keâjleer nw Ùeefo OR iesš ceW 4 Fvehegš nw, lees Truth table ceW 24
92. (c) = 16 nesieer~
ef[efpešue kewâceje, ceesyeeFue heâesve, efØevšj Deeefo ceW heäuewMe cesceesjer keâe 100. (b)
GheÙeesie efkeâÙee peelee nw~ Ùen cesceesjer Skeâ Øekeâej keâer iewj-Jee<heMeerue efvecve mebKÙee ØeCeeueer cebs keâF& mebKÙee Ùee De#ej Ùee oesveeW ØeÙegòeâ nesles nQ–
(Non-volatile) cesceesjer nw pees yuee@keâ veecekeâ FkeâeFÙeeW ceW [sše efceše
mebKÙee
osleer nw Deewj yeeFš mlej hej [sše keâes efheâj mes efueKeleer nw~ De#ej Ùee mebKÙee DeeOeej
ØeCeeueer
93. (c)
mJewhe HeâeFue (Swap life) keâe GheÙeesie leye efkeâÙee peelee nw peye yeeFvejer (0, 1) 2
efmemšce keâer RAM hetjer lejn mes GheÙeesie ceW nesleer nw~ Dee@hejsefšbie Dee@keäšue (0, 1, 2, 3, 4, 5, 6, 7) 8
efmemšce mJewhe HeâeFue keâes ne[& [^eFye hej yeveelee nw Deewj Fmes JeÛeg&Deue oMeceueJe
cesceesjer kesâ ™he ceW GheÙeesie keâjlee nw~ Ùen Skeâ DemLeeÙeer meceeOeeve neslee (0, 1, 2, 3, 4, 5, 6, 7, 8, 9) 10
([sefmeceue)
nw pees efmemšce keâes DeefOekeâ mcetLe lejerkesâ mes Ûeueeves ceW ceoo keâjlee nw~
uesefkeâve Ùen RAM efpeleveer lespe veneR nesleer nw~ nskeämee[sefmeceue (0, 1, 2,B,3,C, 4, 5, 6, 7, 8, 9, A,
D, E, F)
16

149 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
 PRACTICE SET - 4
1. The intelligent agents senses through ............ efvecveefueefKele ceW mes keâewve-mee yuee@keâÛesve vesšJeke&â,
and take actions through......./yegefæceeve SpeWš Devegceefle jefnle nw Deewj meYeer keâes FmeceW Meeefceue nesves keâer
.......... kesâ ceeOÙece mes cenmetme keâjles nw Deewj ............ kesâ meefJeOee oslee nw?
ceeOÙece mes keâejJeeF& keâjles nw~ (a) Consortium/kebâmeesefš&Ùece (b) Private/ ØeeFJesš
(a) sensors, actuators/meWmeme&, SkeäÙegSšme& (c) Public/ heefyuekeâ (d) Retail/ efjšsue
(b) remote, signals/efjceesš, efmeiveume 5. How many of the following statements in
(c) sensors, actuators and remote, signals regard to Artificial Intelligence (AI) are
correct?/Deeefš&efheâefMeÙeue FbšsefuepeWme (Al) kesâ mebyebOe ceW
meWmeme&, SkeäÙegSšme& leLee efjceesš, efmeiveume
(d) None of the given options efvecveefueefKele ceW mes efkeâleves keâLeve mener nQ?
efoS ieS efJekeâuheeW ceW mes keâesF& veneR 1. Natural language processing is a part of AI.
2. Extremely large date sets that could, when
vesÛegjue ueQiJespe Øeesmesemf ebie Al keâe Skeâ Yeeie nw~
analyzed, reveal useful information and 2. Artificial neural network is a part of AI.
patterns are called Deeefš&efheâefMeÙeue vÙetjue vesšJeke&â Al keâe Skeâ Yeeie nw~
DelÙevle yeÌ[s [sše mesš, pees efJeMues<eCe efkeâS peeves hej 3. Deep learning is a part of AI.
GheÙeesieer peevekeâejer Øekeâš keâj mekeâles nQ Deewj hewšve& keâns [erhe ueefveËie Al keâe Skeâ Yeeie nw~
peeles nQ– (a) 2 (b) 3
(c) 1 (d) 0
(a) Raw data/keâÛÛee [sše 6. Which of the following is NOT an IoT-enabling
(b) Big data/efJeMeeue [sše technology?/efvecveefueefKele ceW mes keâewve meer Skeâ IoT
(c) Fast data/leer›e [sše me#ece lekeâveerkeâ veneR nw?
(d) Confidential data/ieesheveerÙe [sše (a) Geological science/efpeÙeesuee@efpekeâue meeFbme
3. Which of the following statements about (b) Cloud Computing/keâueeG[ keâchÙetšj
artificial intelligence (AI) and machine learning (c) Wireless Sensor Networks
(ML) is FALSE? JeeÙejuesme meWmej vesšJekeäme&
Dee@efš&efheâefMeÙeue FbšsefuepeWme (AI) Deewj ceMeerve ueefveËie (d) Big Data Analytics /efyeie [sše Sveeefueefškeäme
(ML) kesâ yeejs ceW efvecveefueefKele ceW mes keâewve mee keâLeve 7. Which of the following is a cloud computing
DemelÙe nw? type where in the approach is to offer a higher
(a) AI cannot exist without machine learning./ level of abstraction so as to make a cloud easily
ceMeerve ueefveËie kesâ efyevee AI keâe yeves jnvee mebYeJe veneR nw~ programmable?
efvecveefueefKele ceW mes keâewve-mee Skeâ keäueeG[ kebâhÙetefšbie
(b) AI solves tasks that require human
intelligence while ML solves specific tasks šeFhe (cloud computing type) nw, efpemeceW SØeesÛe
bylearning from data and making (approach) GÛÛe mlej keâe Symš^skeäMeve (abstraction)
predictions./ AI Gve šemkeâeW keâes nue keâjlee nw efpevekesâ Øeoeve keâjlee nw leeefkeâ keäueeG[ keâes Deemeeveer mes
efueS ceeveJe yegefæ keâer DeeJeMÙekeâlee nesleer nw peyeefkeâ ML Øees«eecesyeue yeveeÙee pee mekeWâ?
[sše mes meerKekeâj Deewj hetJe& Devegceeve ueieekeâj efJeefMe° (a) Infrastructure as a Service and Software as a
šemkeâeW keâes nue keâjlee nw~ Service/Fbøeâemš^keäÛej Spe S meefJe&me Deewj mee@HeäšJesÙej
(c) Machine learning is considered a subset of Spe Ss meefJe&me
artificial intelligence./ceMeerve ueefveËie keâes (b) Software as a Service/mee@HeäšJesÙej Spe S meefJe&me
Dee@efš&efheâefMeÙeue FbšsefuepeWme keâe meyemesš ceevee peelee nw~ (c) Infrastructure as a Service/ Fbøeâemš^keäÛej Spe S
(d) An ‘intelligent’ computer uses AI to think meefJe&me
like a human and perform tasks on its (d) Platform as a Service/huesšHeâece& Spe S meefJe&me
own,while ML is how a computer system
8. Which of these IoT platforms is provided by
develops its intelligence./FbšsefuepeWme keâchÙetšj Amazon?
ceeveJe keâer lejn meesÛeves Deewj Deheves Deehe šemkeâ keâjves keâs FveceW mes keâewve mee IoT huesšHeâe@ce& Sces]peve Éeje Øeoeve
efueS AI keâe GheÙeesie keâjlee nw, peyeefkeâ ML Ùen nw efkeâ efkeâÙee ieÙee nw?
kewâmes keâchÙetšj efmemšce Deheveer FbšsefuepeWme efJekeâefmele keâjlee nw~ (a) IBM Watson IoT
4. Which of the following blockchain networks (b) AWS IoT Core
are permission less and allow everyone to join (c) Google Cloud IoT
them? (d) Azure IoT Hub
150 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
9. Which of the following statements is true 15. Which language does a browser use to display
regarding machine learning? information from the World Wide Web?
ceMeerve ueefveËie kesâ mebyebOe ceW efvecveefueefKele ceW mes keâewve-mee World Wide Web mes peevekeâejer ØeoefMe&le keâjves kesâ
keâLeve melÙe nw? efueS yeÇeG]pej efkeâme Yee<ee keâe GheÙeesie keâjlee nw?
(a) Machine learning is only used in computer (a) Machine code
vision tasks./ceMeerve ueefveËie keâe GheÙeesie kesâJeue (b) Assembly language
keâhÙetšj efJepeve keâeÙeex ceW efkeâÙee peelee nw~ (c) C++
(b) Machine learning is a subset of artificial (d) None of the above/GheÙeg&òeâ ceW mes keâesF& veneR
intelligence./ceMeerve ueefve&ie ke=âef$ece yegefæceòee keâe Skeâ 16. The topology with highest reliability is
Ghemecetn nw~ GÛÛelece efJeMJemeveerÙelee Jeeueer šesheeruee@peer nw
(c) Machine learning algorithms cannot improve (a) Star/mšej
from experience without human
intervention./ceMeerve ueefveËie SsuieesefjLce ceeveJeerÙe (b) ring/efjbie
nmle#eshe kesâ efyevee DevegYeJe mes yesnlej veneR nes mekeâles~ (c) mesh/peeue
(d) All machine learning models require a large (d) More than one of the above/GheÙeg&òeâ ceW mes Skeâ mes
amount of labelled data to function./meYeer ceMeerve DeefOekeâ
ueefve&ie cee@[ueeW keâes keâeÙe& keâjves kesâ efueS yeÌ[er cee$ee ceW 17. Which layer does the data link layer take
uesyeefuele [sše keâer DeeJeMÙekeâlee nesleer nw~ packets from and encapsulate them into frames
10. Which of the following is an example of a for transmission?
server-side scripting language commonly used [sše eEuekeâ hejle efkeâme hejle mes hewkesâš uesleer nw Deewj GvnW
in web applications?/efvecveefueefKele ceW mes keâewve-mee š^ebmeefceMeve kesâ efueS øesâce ceW meceeefnle keâjleer nQ?
web DevegØeÙeesieeW ceW meeceevÙele: GheÙeesie keâer peeves Jeeueer (a) transport layer
server-side scripting Yee<ee keâe GoenjCe nw? (b) application layer
(a) HTML (c) network layer
(b) CSS (d) More than one of the above
(c) C++ 18. The expansion for MIDI is
(d) None of the above/GheÙeg&òeâ ceW mes keâesF& veneR MIDI kesâ efueS efJemleej nw
11. .WAV file format is used for:/.WAV heâeFue (a) Musical Instrument Digital Interface
heâe@cexš keâe GheÙeesie efvecve kesâ efueS efkeâÙee peelee nw- (b) Musical Instrument Data Interface
(a) sound/OJeefve (b) palette/hewuesš (c) Musical Instructions Digital Interface
(c) animation/SefvecesMeve (d) video/Jeeref[Ùees (d) More than one of the above
19. Which protocol is used to send email over the
12. Which among the following is the fullform of AVI?
Internet?/Fbšjvesš hej F&cesue Yespeves kesâ efueS efkeâme
efvecveefueefKele cebs mes keâewve-mee AVI keâe hegâueheâece& nw?
(a) Audio Visual Interface/Dee@ef[Ùees efJepegDeue Fbšj]hesâme
Øeesšeskeâe@ue keâe GheÙeesie efkeâÙee peelee nw?
(a) FTP
(b) Audio Video Interface/Dee@ef[Ùees Jeeref[Ùees Fbšj]hesâme
(b) SMTP
(c) Audio Video Interleave/Dee@ef[Ùees Jeeref[Ùees FbšjefueJe
(c) HTTP
(d) None of these/Fvecebs mes keâesF& Yeer veneR (d) More than one of the above/GheÙeg&òeâ ceW mes Skeâ mes
13. efvecveefueefKele ceW mes keâewve-mee efJekeâuhe, mejkeâej Deewj DeefOekeâ
ueesieeW kesâ yeerÛe meyemes kegâMeue Deewj meheâue ceeOÙeceeW ceW mes 20. efvecveefueefKele ceW mes keâewve-meer Fbšjvesš mesJee, Fbšjvesš
Skeâ nw Deewj IECT kesâ Éeje Øeehle efkeâÙee peelee nw?
hej heâesve keâe@ue keâjves Deewj Øeehle keâjves keâe lejerkeâe
(a) F&-Dee@efheâme (e-office)
yeleeleer nw?
(b) F&-ceveer (e-money)
(a) F&-cesue (e-mail)
(c) F&-efyepevesme (e-money)
(b) Fbšjvesš efjues Ûewš (Internet Relay Chat)
(d) F&-ieJeveXme (e-govermance)
14. Blowfish is a type of/yueesefheâMe Skeâ Øekeâej keâe nw (c) JeerDeesDeeF&heer (VolP)
(a) Symmetric Encryption Algorithm (d) Ùetpevesš (USENET)
meceefcele Svedef›eâhMeve SuieesefjLece 21. Which of the following terms best describes the
process of interconnecting two or more
(b) Hashing Algorithm/nweEMeie SuieesefjLece
networks to form a single large network?
(c) Digital Signature Algorithm
efvecveefueefKele ceW mes keâewve-mee Meyo Skeâ yeÌ[s vesšJeke&â keâes
ef[efpešue nmlee#ej SuieesefjLece
(d) Asymmetric Encryption Algorithm
yeveeves kesâ efueS oes Ùee oes mes DeefOekeâ vesšJeke&â keâes Deeheme
Demeceefcele Svedef›eâhMeve SuieesefjLece ceW peesÌ[ves keâer Øeef›eâÙee keâe meyemes DeÛÚe JeCe&ve keâjlee nw?
151 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
 (a) Merging/efJeueÙeve (a) User Environment/GheÙeesiekeâlee& heÙee&JejCe
(b) Intranet/Fbšjvesš (b) Batch Environment/yewÛe heÙee&JejCe
(c) Virtualization/JeÛeg&DeueeFpesMeve (c) Time Sharing/meceÙe meePeekeâjCe
(d) Internetworking/Fbšj-vesšJeefkeËâie (d) More than one of the above/GheÙeg&òeâ ceW mes Skeâ DeefOekeâ
22. The network cable which is commonly used to 26. Communication between a computer and a
connect one computer to another computer keyboard involves_____ transmission.
is........... kebâhÙetšj Deewj keâeryees[& kesâ yeerÛe mebÛeej ceW_____ š^emb eefceMeve
.............., meeceevÙele: Skeâ kebâhÙetšj keâes otmejs kebâhÙetšj mes Meeefceue neslee nw~
peesÌ[ves kesâ efueS GheÙeesie efkeâÙee peeves Jeeuee vesšJeke&â (a) Simplex
kesâyeue nw~ (b) Half-dulpex
(a) Crossover cable/›eâemeDeesJej kesâyeue (c) Full-duplex
(b) USB cable/Ùet.Sme.yeer. kesâyeue (d) More than one of the above/GheÙeg&keäle ceW mes Skeâ mes
(c) VGA cable/Jeer.peer.S. kesâyeue DeefOekeâ
(d) Straight-through cable/mšs^š-LeÇt kesâyeue 27. The number of rows in a relation (table) is
called _______ of the relation.
23. Which of the following is an INVALID
transmission mode?
efkeâmeer efjuesMeve (šsyeue) cebs jes keâer mebKÙee keâes efjuesMeve keâer
efvecveefueefKele ceW mes keâewve-mee Skeâ DeceevÙe mebÛeej cees[ nw? _______ keâne peelee nw~
(a) Full-Duplex/Hegâue-[ghueskeäme (a) Degree/ef[«eer (b) Tuples/šheue
(b) Simplex /efmecheueskeäme (c) Attribute/Sefš^yÙetš
(c) Complex/keâe@chueskeäme (d) Cardinality/keâeef[&veefuešer
(d) Half-Duplex /neHeâ-[ghueskeäme 28. The process of reducing data redundancy in a
relational database is called_____.
24. Identity whether the following statements are
true or false.
Skeâ mebyebOe hejkeâ [sšeyesme ceW [sše efj[v[svmeer keâes keâce
henÛeeve keâerefpeS efkeâ efvecveefueefKele keâLeve melÙe nQ Ùee keâjves keâer Øeef›eâÙee keâes keâne peelee nw~
DemelÙe nQ~ (a) Trigger
(b) Normalization
(i) Switching at the network layer on the
(c) Relationship
internet uses the datagram approach to
(d) Data Type
packet switching.
Fbšjvesš hej vesšJeke&â uesÙej hej efmJeÛe keâjvee, hewkesâš 29. What is a collection of interrelated data and a
set of programs to access to those data?
efmJeefÛebie kesâ efueS [sše«eece heæefle keâe GheÙeesie hejmhej mebyeæ [sše Deewj Gme [sše lekeâ heng@Ûeves kesâ
keâjlee nw~ efueS Øees«eecme kesâ Skeâ mesš kesâ Skeâ meb«en keâes keäÙee
(ii) The Internet Protocol version 4 (IPv4) is keâne peelee nw?
the delivery mechanism used by the
TCP/IP models. (a) Computer Network / kebâhÙetšj vesšJeke&â
Fbšjvesš Øeesšeskeâe@ue mebmkeâjCe šermeerheer/DeeF&heer (b) Class /keäueeme
cee@[ue Éeje GheÙeesie efkeâÙee peeves Jeeuee efveie&ce (c) Database Management System
Ùeb$eeJeueer nw~ [sšeyesme cewvespeceWš efmemšce
(iii) IPV4 addresses are represented by 8 bytes. (d) Data Structure /[sše mš^keäÛej
IPV4 heleeW keâes 8 yeeFšdme Éeje oMee&Ùee peelee nw~ 30. Which type of data can be stored in the
database?
(a) i-False, ii-True, iii-True
[sšeyesme ceW efkeâme Øekeâej keâe [sše meb«enerle efkeâÙee pee
i-DemelÙe, ii-melÙe, iii-melÙe
(b) i-True, ii-False, iii-True
mekeâlee nw?
i-melÙe, ii-DemelÙe, iii-melÙe (a) Image oriented data/ÚefJe GvcegKe [sše
(c) i-True, ii-True, iii-False (b) Text, files containing data/hee", [sše Ùegòeâ HeâeFueW
i-melÙe, ii-melÙe, iii-DemelÙe (c) Data in the form of audio or video/Dee@ef[Ùees Ùee
(d) i-False, ii-False, iii-True efJeef[Ùees kesâ ™he ceW [sše
i-DemelÙe, ii-DemelÙe, iii-melÙe (d) More than one of the above/GheÙeg&òeâ ceW mes Skeâ mes
25. Which of the following is a technique that DeefOekeâ
marks the beginning of computer 31. If every non-key attribute is fully dependent on
communications? the primary key, then the relation will be in
efvecveefueefKele ceW mes keâewve-meer lekeâveerkeâ keâchÙetšj mebÛeej Deiej ØelÙeskeâ vee@ve-keâer Sefš^yÙetš hetjer lejn mes ØeeFcejer keâer
keâer Meg™Deele keâes efÛeefÖle keâjleer nw? hej efveYe&j jnlee nw, lees efjuesMeve nesiee
152 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
 (a) First Normal Form (1NF)/ØeLece vee@ce&ue heâe@ce& 38. Which of the following conditions holds TRUE
(1NF) ceW for a queue of fixed size ?
(b) Second Normal Form (2NF) /efÉleerÙe vee@ce&ue heâe@ce& efvecve efmLeefleÙeeW ceW mes keâewve meer efmLeefle Skeâ efveefMÛele
(2NF) ceW Deekeâej keâer keäÙet kesâ efueS mener nw?
(c) Third Normal Form (3NF) /le=leerÙe vee@ce&ue heâe@ce& (a) Both Overflow and Underflow
(2NF) ceW DeesJejHeäuees Deewj Deb[jHeäuees oesveeW
(d) More than one of the above/GheÙeg&òeâ ceW mes Skeâ mes (b) Neither Overflow nor Underflow
DeefOekeâ ve lees DeesJejHeäuees Deewj ve ner Deb[jHeäuees
32. Which of the following is not a feature of DBMS? (c) Underflow/Deb[jHeäuees
efvecveefueefKele ceW mes keâewve-mee DBMS keâer efJeMes<elee veneR nw? (d) Overflow/DeesJejHeäuees
(a) Minimum duplication and redundancy of 39. In which of the following the Data Structures
data/[eše keâe vÙetvelece oesnjeJe Deewj Deeflejskeâ perform an important role?/efvecveefueefKele ceW mes
(b) High-level of security/megj#ee keâe GÛÛe mlej efkeâmeceW [eše mš^keäÛej Skeâ cenlJehetCe& Yetecf ekeâe efveYeeles nQ?
(c) Single-user access only/kesâJeue Skeâue-GheÙeesiekeâlee&
(a) Input device/Fvehegš ef[JeeFme
hengBÛe
(b) Hardware/ne[&JesÙej
(d) More than one of the above/GheÙeg&òeâ ceW mes Skeâ
(c) Program design/Øees«eece ef[peeFve
DeefOekeâ
(d) Logic gate/uee@efpekeâ iesš
33. For designing a normal RDBMS, which of the
following normal forms is considered adequate? 40. Which of the following is a collection of
meeceevÙe RDBMS keâes ef[peeFve keâjves kesâ efueS different elements having similar data type?
efvecveefueefKele ceW mes keâewve-mee meceeve [sše Øekeâej Jeeues
efvecveefueefKele ceW mes keâewve-mee meeceevÙe ¤he heÙee&hle ceevee
efJeefYeVe Sefuecesvšdme keâe meb«en nw?
peelee nw?
(a) Array/DeeJÙetn (b) Structrue/mebjÛevee
(a) 4NF
(b) 3NF (c) Union/ÙetefveÙeve (d) Pointer/hJeeFbšj
(c) 2NF 41. When an object of a derived class is
(d) More than one of the above instantiated, the base class's ____ is called
/GheÙeg&keäle ceW mes Skeâ mes DeefOekeâ implicitly or explicitly to do any necessary
initialisation of the base-class data members in
34. If the decimal number 60 is shown as 2020 in the
the derived-class object.
base B number system, then what will be B?/Ùeefo
peye efkeâmeer JÙeglheVe Jeie& keâer efkeâmeer Jemleg keâes
DeeOeej B mebKÙee heæefle ceW oMeceueJe mebKÙee 60 keâes FvmšeefvšSšs[ efkeâÙee peelee nw, lees yesme keäueeme kesâ
2020 kesâ ™he ceW oMee&Ùee peelee nw, lees B keäÙee nesiee?
............. keâes JÙeglheVe-Jeie& Dee@ypeskeäš ceW yesme-keäueeme [sše
(a) 2 (b) 5
(c) 3 (d) 4
meomÙeeW kesâ efkeâmeer Yeer DeeJeMÙekeâ DeejbYeerkeâjCe keâes keâjves
35. Which command in MySQL is used to list all kesâ efueS efveefnle Ùee mhe° ™he mes keâne peelee nw~
(non-temporary) tables in a given database? (a) inheritor/Fvensefšj
Skeâ efoS ieS [ešeyesme ceW meYeer (iewj-DemLeeÙeer) šsyeueeW (b) constructor/kebâmš^keäšj
keâes metÛeeryeæ keâjves kesâ efueS MySQL ceW keâewve meer (c) initialiser/FefveefMeÙeueeFpej
keâceeb[ ØeÙeesie keâer peeleer nw? (d) destructor/ef[mš^keäšj
(a) DESCRIBE TABLES 42. VB.NET is ________ programming language.
(b) DISPLAY TABALES VB.NET ________ Øees«eeefcebie Yee<ee nw~
(c) VIEW TABLES (a) Object supported/Jemleg meceefLe&le
(d) SHOW TABLES
(b) Object oriented/ue#ÙeesvcegKeer
36. Web Page Written in which language.
Jesye hespe efkeâme Yee<ee ceW efueKee peelee nw? (c) Structured/mebjefÛele
(a) C/C++ (b) FORTRAN (d) None of these/Fvecebs mes keâesF& Yeer veneR
(c) SQL (d) HTML 43. HTML is a ________ language.
37. Which of the following is a valid datatype in HTML efkeâme Øekeâej keâer Yee<ee nw?
JavaScript?/peeJeeefm›eâhš ceW efvecveefueefKele ceW mes keâewve (a) Applet/Sshuesš
mee Skeâ JewOe [sšešeFhe nw? (b) Scripting/efm›eâefhšbie
(a) Float /heäueesš (b) String /efmš^bie (c) Coding/keâesef[bie
(c) Real /efjÙeue (d) Word /Je[& (d) Mark up /ceeke&âDehe

153 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
44. Which of the following symbols is used to (c) High-level language/GÛÛe mlejerÙe Yee<ee
comment in CSS?/CSS ceW keâceWš keâjves kesâ efueS (d) Language which requires interpreter
efvecve ceW mes efkeâme Øeleerkeâ keâe GheÙeesie efkeâÙee peelee nw? Yee<ee efpemes FbšjØesšj keâer DeeJeMÙekeâlee nes
(a) /*Comment*/ 51. Languages which can easily interact with the
(b) <#Comment#> hardware are called:
(c) #Comment ne[&JesÙej kesâ meeLe Deemeeveer mes mebJeeo keâj mekeâleer nQ
<Comment> _________ keânueeleer nQ~
(d) Comment
<Comment> (a) High level languages/GÛÛe mlejerÙe Yee<ee
45. How many types of the array are there in the (b) Low level languages/efvecve mlejerÙe Yee<ee
C++ programming langauge? (c) Middle level languages/ceOÙe mlejerÙe Yee<ee
C++ Øees«eeefcebie Yee<ee ceW Ssjs efkeâleves Øekeâej kesâ nesles nQ? (d) Middle Higher Level Language/ceOÙe GÛÛe
(a) There are three types of arrays mlejerÙe Yee<ee
(b) There are four types of arrays
52. Which symbol represents start or end of flow
(c) There are two types of arrays
(d) More than one of the above/GheÙeg&keäle ceW mes Skeâ mes chart?
DeefOekeâ keâewve mee efÛevn heäueesÛeeš& keâer Meg™Deele Ùee meceeefhle keâes
46. BCD coding scheme uses............bits to code oMee&lee nw?
decimal digits/efyešdme keâes[ keâes oMeceueJe DebkeâeW ceW (a) Oval / Deb[ekeâej
yeermeer[er keâesef[bie mkeâerce keâe GheÙeesie keâjlee nw– (b) Triangle / ef$eYegpe
(a) 4 (b) 8 (c) Square /Jeie&
(c) 16 (d) 32 (d) Rectangle / DeeÙele
47. Which data structure is mainly used for 53. An effective method expressed as a finite list of
implementing the recursive algorithm? well-defined instructions for calculating a
Recursive algorithm keâes ueeiet keâjves kesâ efueS cegKÙe ™he function is called:/efkeâmeer hebâkeäMeve keâer ieCevee kesâ efueS
mes efkeâme data structure keâe GheÙeesie efkeâÙee peelee nw? DeÛÚer lejn mes heefjYeeef<ele efveoxMeeW keâer Skeâ meerecf ele metÛeer kesâ
(a) Queue (b) Stack ™he ceW JÙeòeâ keâer ieF& Skeâ ØeYeeJeer efJeefOe keânueeleer nw-
(c) Binary tree
(d) More than one of the above (a) A algorithm/Skeâ Suieesefjodce
GheÙeg&òeâ ceW mes Skeâ DeefOekeâ (b) A data structure/Skeâ [sše mebjÛevee
48. What is the use of ios::trunc mode? (c) A compiler/Skeâ kebâheeFuej
of ios::trunc cees[ keâe GheÙeesie keäÙee nw? (d) A program/Skeâ Øees«eece
(a) To open a file in input mode 54. Which of the following statements is used to
Fvehegš cees[ ceW Skeâ ]heâeFue Keesuevee make a selection from more than two choices?
(b) To open a file in output mode oes mes DeefOekeâ efJekeâuheeW ceW mes ÛeÙeve keâjves kesâ efueS
DeeGšhegš cees[ ceW Skeâ ]heâeFue Keesuevee efvecveefueefKele ceW mes efkeâme keâLeve keâe ØeÙeesie efkeâÙee peelee nw?
(c) To truncate an existing file to zero (a) if-else
ceewpetoe ]heâeFue keâes MetvÙe hej Úesše keâjvee~ (b) switch
(d) More than one of the above (c) else-if
GheÙeg&òeâ ceW mes Skeâ DeefOekeâ (d) None of these/FveceW mes keâesF& veneR
49. What is the result of the operation 1010 AND 55. What will be the output of the following C++
1100 in binary?/yeeFvejer ceW Dee@hejsMe 1010 AND code?
1100 keâe heefjCeece keäÙee nw? efvecveefueefKele C++ keâes[ keâe DeeGšhegš keäÙee nesiee?
(a) 1000 #include<iostream>
(b) 1110 #include<string>
(c) 100 using namespace std;
(d) More than one of the above/GheÙeg&òeâ ceW mes Skeâ mes int main(int argc, char const *argv[ ])
DeefOekeâ {
50. Assembly language is a– char s1[6]=“Hello”;
Demescyeueer Yee<ee nw, Skeâ– char s2[6]=“World”;
(a) Machine independent language char s3[12]=s1+“ ”+s2;
ceMeerve Fbef[heW[Wš Yee<ee cout<<s3;
(b) Machine dependent language return 0;
ceMeerve ef[heW[Wš Yee<ee }
154 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
 (a) Hello (a) This is a antivirus software
(b) World Ùen Skeâ Sbšer-JeeÙejme mee@HeäšJesÙej nw~
(c) Error (b) It compresses large files into a smaller file
(d) More than one of the above/GheÙeg&òeâ ceW mes Skeâ Ùen yeÌ[er HeâeFueeW keâes Úesšer HeâeFueeW ceW kebâØesme keâjlee nw~
DeefOekeâ (c) it extracts smaller file from larger files/Ùen yeÌ[er
56. Which of the following contains specific rules HeâeFueeW mes Úesšer HeâeFueeW keâes Skeämš^wkeäš keâjlee nw~
and words that express the logical steps of an
(d) It expands smaller files into a large file/Ùen
algorithm?
efvecveefueefKele ceW mes efkeâmeceW efJeefMe° efveÙece Deewj Meyo Úesšer HeâeFueeW keâes yeÌ[er HeâeFueeW ceW SkeämeheQ[ keâjlee nw~
"Miracast" is:/‘‘efcejekeâemš’’ nw–
Meeefceue nQ, pees Suieesefjoce kesâ leeefke&âkeâ ÛejCeeW keâes JÙeòeâ 62.
(a) Wireless Content Streaming Technology
keâjles nQ?
JeeÙejuesme meece«eer mš^erefcebie ØeewÅeesefiekeâer
(a) Programming language/Øees«eeefcebie Yee<ee
(b) Wire Content Streaming Technology
(b) Syntax/efmebšwkeäme JeeÙej kebâšWš mš^erefcebie šskeäveesuee@peer
(c) Programming structure/Øees«eeefcebie mebjÛevee (c) Feature in Chrome browser to cast webpages
(d) Logical chart/leeefke&âkeâ Ûeeš& side by side/JesyehespeeW keâes meeF[-yeeF&-meeF[ keâemš
57. ......... are the words that a programming keâjves kesâ efueS ›eâesce yeÇeG]pej ceW megefJeOee
language has set aside for its own use.
(d) None of these/FveceW mes keâesF& veneR
.............. Jes Meyo nQ efpemeceW Øees«eeefcebie Yee<ee keâes Deheves
63. efvecveefueefKele ceW efmemšce mee@heäšJesÙej keâewve-mee nw?
GheÙeesie kesâ efueS Skeâ lejHeâ jKe efoÙee ieÙee nw~
(a) [ešeyesme Øees«eece (b) Je[& Øeesmesmej
(a) Control words/kebâš^esue Je[&
(c) mØew[Meerš (d) keâcheeFuej
(b) Control structures/kebâš^esue mš^keäÛej
64. Virtual memory is a......./DeeYeemeerÙe cesceesjer nw ........
(c) Reserve words/efjpeJe& Je[&
(a) Volatile memory of unlimited capcity
(d) Reserved keys/efjpeJ[& keâer Demeerefcele #ecelee keâer JeesueešeFue cesceesjer
58. Which of the following refers to the wrapping of (b) Non-volatile memory of unlimited capacity
data and its functionality into a single individual
entity?
Demeerefcele #ecelee keâer iewj JeesueešeFue cesceesjer
efvecveefueefKele ceW mes keâewve-mee [sše Deewj Gmekeâer keâeÙe&#ecelee (c) A technique to execute smaller programs into
larger memory/yeÌ[s cesceesjer ceW Úesšs Øees«eece keâes
keâes Skeâ Skeâue FkeâeF& ceW uehesšves keâes meboefYe&le keâjlee nw?
mebheeefole keâjves keâer lekeâveerkeâ
(a) Modularity
(d) A technique to execute largest programs into
(b) Abstraction
smaller memory/Úesšs cesceesjer ceW yeÌ[s Øees«eece keâes
(c) Encapsulation
(d) More than one of the above/GheÙeg&keäle ceW mes Skeâ mes mebheeefole keâjves keâer Skeâ lekeâveerkeâ
DeefOekeâ 65. The primary objective of a time-sharing
operating system is to/šeFce MesÙeefjbie Deehejsefšbie
59. Illegal copying and distribution of software is-
mee@HeäšJesÙej keâer DeJewOe vekeâue Deewj efJelejCe nw– ØeCeeueer keâe ØeeLeefcekeâ GösMÙe nw?
(a) Copyright/keâe@heerjeFš (a) Avoid thrashing/LeÇwefmebie keâes jeskeâves nsleg
(b) Provide fast response to each user of the
(b) Hacking/nwefkebâie
computer/keâchÙetšj kesâ ØelÙeskeâ GheYeeskeälee keâes õgle
(c) Software Literacy/mee@HeäšJesÙej mee#ejlee
Øeefleef›eâÙee GheueyOe keâjevee
(d) Software piracy/mee@HeäšJesÙej Ûeesjer
(c) Provide fast execution of processes
60. DOS can not retrieve any data from a disk if a
computer virus corrupts the ________ of the ef›eâÙeeDeeW keâes õgle efve<heeove GheueyOe keâjvee
computer. (d) Optimize computer memory usage
Ùeefo keâchÙetšj JeeÙejme keâchÙetšj kesâ ________ keâes keâchÙetšj cesceesjer kesâ Fmlesceeue keâes meJeexòece JejerÙelee
otef<ele (keâjhš) keâj oslee nw lees DOS ef[mkeâ mes [sše keâes 66. The information stored in RAM can be
hegve: Øeehle veneR keâj mekeâlee nw~ checked with the help of______.
RAM ceW meb«eefnle metÛevee keâes ______ keâer ceoo mes
(a) File allocation table/HeâeFue SueeskesâMeve šsyeue
(b) BAT Files/yewš HeâeFue
Ûeskeâ efkeâÙee pee mekeâlee nw~
(c) Root Directory Area/™š [eFjskeäš^er SefjÙee (a) Kernel/keâvexue (b) BIOS/yeeÙeesme
(d) Directory Area/[eÙejskeäš SefjÙee (c) CMOS/meercee@me (d) Hard disk/ne[& ef[mkeâ
61. What is the function of WinZip? 67. efvecveefueefKele ceW mes keâewve Skeâ efuevekeäme ef[mš^eryÙetMeve
efJeveef]pehe (WinZip) keâe keäÙee keâeÙe& nw? (Linux distribution) vener nw?
155 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
 (a) Solus/meesueme (b) Honeycomb/nveerkeâe@cye 72. If a computer system completes n processes in t
(c) Fedora/Hesâ[esje (d) Ubantu/Gyegbšt seconds, then its throughput is _______
processes per second during that interval./Ùeefo
68. What is a deadlock?/[s[uee@keâ keäÙee nw?
(a) Condition where each process is blocked and
keâesF& keâchÙetšj efmemšce n Øeef›eâÙeeDeeW keâes t meskebâ[ ceW hetje
waiting for other to release resources/Jen efmLeefle keâjlee nw,lees Gme Deblejeue kesâ oewjeve Gmekeâe LeÇthegš ........
peneb ØelÙeskeâ Øeesmesme DeJe®æ nes peelee nw Deewj efjmeesme& Øeef›eâÙee Øeefle meWkebâ[ neslee nw~
efjueerpe keâjves kesâ efueS otmejs keâer Øeleer#ee keâjlee nw (a) t/n (b) n + t
(b) Condition where each process is terminated (c) n/t (d) n × t
and started again/Jen efmLeefle peneb ØelÙeskeâ Øeesmesme 73. Which of the following is NOT a type of
interrupt?/efvecveefueefKele ceW mes keâewve-mee Fbšjhš keâe
meceehle neskeâj ogyeeje Ûeeuet neslee nw
(c) Condition where each process is ready to be Øekeâej veneR nw?
executed one by one/Jen efmLeefle peneb ØelÙeskeâ Øeesmesme (a) Hardware interrupt/ne[&JesÙej Fbšjhš
kesâ yeeo Skeâ ØeoefMe&le nesves kesâ efueS lewÙeej jnlee nw (b) Memory interrupt/cesceesjer Fbšjhš
(d) Condition where each process is blocked (c) Software interrupt/mee@HeäšJesÙej Fbšjhš
except the child process/Jen efmLeefle peneb ÛeeFu[ (d) More than one of the above/GheÙeg&òeâ ceW mes Skeâ mes
Øeesmesme keâes ÚesÌ[keâj ØelÙeskeâ Øeesmesme DeJe®æ nes peelee nw DeefOekeâ
69. All of the following are the Process 74. Dumb terminals have terminals and :
management activities handled by the [cye šefce&veue kesâ heeme šefce&veue Deewj _______ neslee nw~
Operating System EXCEPT:
(a) data card/[eše keâe[& (b) RAM/jwce
efvecveefueefKele ceW efkeâmekeâes ÚesÌ[keâj yeekeâer meYeer Dee@hejsefšbie
(c) mouse/ceeGme (d) keyboard/keâeryees[&
efmemšce nQ[ue keâer peeves Jeeueer Øeesmesme cewvespeceWš
75. efvecveefueefKele ceW mes keâewve-mee efØebšj, Skeâ Fbkeâ-efjyeve hej
SefkeäšefJešer (Process management activities) nQ~
efheve ceejkeâj De#ejeW keâes Úehelee nw?
(a) Product purchase, payments, and order/Glheeo
(a) [e@š cewefš^keäme (Dot matrix)
keâer Kejero, Yegieleeve Deewj Dee@[&j
(b) control execution of applications/ShueerkesâMeve kesâ (b) SueF&[er (LED)
efve<heeove keâes efveÙebef$ele keâjvee (c) uespej (Laser)
(c) Synchronisation, communication, and (d) Fbkeâpesš (Inkjet)
deadlock handling for processes/Øeesmesme kesâ efueS 76. Which of the following are types of 3D
efmeb›eâveeFpesMeve, mebÛeej Deewj [s[uee@keâ nQ[efuebie printing?
(d) Control access to shared resources like files, efvecve ceW mes keâewve 3D efØebeEšie kesâ Øekeâej nQ?
memory, I/O, and CPU/HeâeFueeW, cesceesjer, I/O,Deewj (i) Stereolithography (SLA)/mšerefjÙeesefueLees«eeHeâer
CPU pewmes MesÙej efkeâS ieS efjmeesme& kesâ efueS Skeämesme keâes (SLA)
efveÙebef$ele keâjvee (ii) Selective laser sintering (SLS)/mesuesefkeäšJe
70. efvecveefueefKele ceW mes keâewve mee Dee@hejsefšbie efmemšce kesâme uespej eEmešefjbie (SLS)
meWefmeefšJe (Case-Sensitive) neslee nw? (iii) Fused deposition modeling (FDM)/ HeäÙetp[
(i) Ùetefvekeäme (Unix) (ii) efuevekeäme (Linux) ef[heesefpeMeve cee@[eEueie (FDM)
(iii) SceSce-efJeb[espe (MS-Windows) (iv) Digital light process (DLP)/ef[efpešue ueeFš
(a) (i), (ii) Deewj (iii) (b) kesâJeue (i) Deewj (iii) Øeesmesme (DLP)
(c) kesâJeue (i) Deewj (iii) (d) kesâJeue (i) Deewj (ii) (v) PolyJet/hee@ueerpesš
71. The legal right to use software based on (vi) DotMatrix/[e@šcewefš^keäme
specific restrictions is granted via a (a) i, ii, iv and v only /kesâJeue i, ii, iv Deewj v
efJeefMe<š ØeefleyebOe kesâ DeeOeej hej mee@heäšJesÙej keâes ØeÙeesie keâjves (b) i, ii, iii and iv only/kesâJeue i, ii, iii Deewj iv
keâe keâevetveer DeefOekeâej efvecveefueefKele Éeje Devegoòe neslee nw (c) i, iii, iv and v only/kesâJeue i, iii, iv Deewj v
(a) Software privacy policy (d) i, ii, iii, iv and v only/kesâJeue i, ii, iii, iv Deewj v
mee@heäšJesÙej ØeeFJesmeer hee@efuemeer 77. Which computer generation replaced the IC
(b) Software license/mee@heäšJesÙej ueeFmeWsme (integrated circuit) with VLSI (Very Large
(c) Software password manager Scale Intergration) circuit?/efkeâme keâchÙetšj
mee@heäšJesÙej heemeJe[& cewvespej pevejsMeve ves IC (Fbšer«esšs[ meefke&âš) keâes VLSI (Jesjer
(d) Software log/mee@heäšJesÙej uee@ie ueepe& mkesâue Fbšer«esMeve) meefke&âš ceW yeoue efoÙee?
156 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
 (a) Fourth (b) First (c) CPU, I/O and RAM/CPU, I/O Deewj RAM
(c) Second (d) Third (d) CPU and HDD/CPU Deewj HDD
78. Ssmee ceevee peelee nw, efkeâ Fbšjvesš keâes DARPA ves 85. USB stands for...............
efJekeâefmele efkeâÙee Lee~ DARPA keâe hetCe& ™he yeleeSb~ Ùet.Sme.yeer (USB) keâe hetCe& ™he keäÙee nw?
(a) Defense Active Research Projects (a) Uniform serial Bus/Ùetefveheâece& meerefjÙeue yeme
Agent/ef[heWâme SefkeäšJe efjmeÛe& Øeespeskeäšdme SpeWš (b) Uniform Series Bus/Ùetefveheâece& meerjer]pe yeme
(b) Different Advanced Research Projects
(c) Universal Series Bus/ÙetefvemeJe&ue meerjerpe yeme
Agency/ef[heWâme SefkeäšJe efjmeÛe& Øeespeskeäšdme SpeWmeer
(d) Universal Serial Bus/ÙetefveJeme&ue meerefjÙeue yeme
(c) Defense Advanced Research Projects
86. CPU LeÇthegš (throughput) keâes yeÌ{eves kesâ efueS,
Agency/ef[heWâme S[Jeebm[ efjmeÛe& Øeespeskeäšdme SpeWmeer
(d) Defense Advanced Review Projects
efvecveefueefKele ceW mes keâewve meer cesceesjer CPU leLee cesve
Agent/ef[heWâme S[Jeebm[ efjJÙet Øeespeskeäšdme SpeWš cesceesjer kesâ yeerÛe jKeer peeleer nw?
79. Who invented the first microprocessor? (a) Secondary memory/meskeWâ[jer cesceesjer
henues ceeF›eâesØeesmesmej met#ceØekeâcekeâ keâe DeeefJe<keâej (b) Cache memory/kewâMe cesceesjer
efkeâmeves efkeâÙee? (c) Sequential memory/meerkeäJeWefMeÙeue cesceesjer
(a) Vint Cerf /efJebš mes]he&â (d) Auxiliary memory/Dee@ipeguejer cesceesjer
(b) Terence Percival /šsjWme heefme&Jeue 87. Which of the following memories refresh many
times per second?/veerÛes efoS ieS ceW mes keâewvemeer
(c) John Mauchly /pee@ve ceewÛeueer
cesceesjer Øeefle meskebâ[ Deveskeâ yeej veF& yeve peeleer nw?
(d) Ted Holf /šs[ ne@heâ
(a) EPROM/EPROM (b) ROM/ROM
80. SATA Deewj IDE keäÙee nw?
(c) Static RAM /efmLej
(a) heeceše@hme (b) ceojyees[& efvecee&lee
(d) Dynamic RAM /ieefleMeerue
(c) ne[& ef[mkeâ [^eFJe kesâ Øekeâej(d) heäuewMe [^eFJe kesâ Øekeâej 88. FFFF will be the last memory location in a
81. What does the control unit generate to control memory of size/efkeâleves meeFpe kesâ cesceesjer ceW DeeefKejer
other units?/DevÙe units keâes efveÙeefv$ele keâjves kesâ efueS cesceesjer ueeskesâMeve FFFF nesiee?
control unit keäÙee GlheVe keâjleer nw? (a) 16K (b) 32K
(a) Transfer signals (c) 64 K
(b) Command signals (d) More than one of the above/GheÙeg&òeâ ceW mes Skeâ mes
(c) Control signals DeefOekeâ
(d) More than one of the above 89. What is the approximate range of the size of
GheÙeg&òeâ ceW mes Skeâ DeefOekeâ cache memory?
82. The speed of a CPU can measured in ……… kewâMe cesceesjer kesâ Deekeâej keâer Devegceeefvele jWpe keäÙee nw?
CPU keâer ieefle keâes efkeâmeceW ceehee pee mekeâlee nw? (a) Megabytes - gigabytes
(a) Megahertz (MHz)/cesieenš&dpe (MHz) (b) Terabytes - petabytes
(b) Bits per second(Bps)/efyešdme Øeefle meskeWâ[ (Bps) (c) Kilobytes - megabytes
(c) Lux/uekeäme (Lux) (d) Gigabytes - terabytes
90. Which of the following is/are true with respect
(d) Horsepower/ne@me&hee@Jej (Horsepower)
to EEPROM?/ EEPROM kesâ mebyebOe ceW efvecveefueefKele
83. Computer on a single chip is called/Skeâue efÛehe
ceW mes keâewve-mee/mes melÙe nQ/nwb?
hej keâchÙetšj (Computer) keâes keâne peelee nw (i) It is block-wise erasable
(a) microcontroller/ceeF›eâeskeâvš^esuej Ùen yuee@keâ JeeFpe Fjspesyeue nw~
(b) microprocessor/ceeF›eâesØeesmesmej (ii) It is byte-wise erasable
(c) assembler/Smescyeuej Ùen yeeFš JeeFpe Fjspesyeue nw~
(d) More than one of the above/GheÙeg&òeâ ceW mes Skeâ mes (a) Both (i) and (ii)/(i) Deewj (ii) oesveeW
DeefOekeâ (b) Only (ii)/kesâJeue (ii)
84. Which computer components are (c) Only (i)/kesâJeue (i)
interconnected by a system bus? (d) Neither (i) nor (ii)/ve lees (i) Deewj ve ner (ii)
FveceW mes keâewve mes keâchÙetšj Ieškeâ efmemšce yeme (system 91. Almost every computer comes with a small
bus) Éeje Deeheme ceW pegÌ[s ngS nQ? amount of ROM containing_____.
(a) Motherboard and I/O/ceojyees[& Deewj I/O ueieYeie ØelÙeskeâ kebâhÙetšj ceW LeesÌ[er cee$ee ceW ROM nesleer
(b) CPU and memory/CPU Deewj cesceesjer nw, efpemeceW _____ neslee nw~
157 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
 (a) freeware/øeâerJesÙej (d) More than one of the above/GheÙeg&òeâ ceW mes Skeâ mes
(b) boot firmware/yetš Heâce&JesÙej DeefOekeâ
(c) utility software/Ùetefšefuešer mee@HeäšJesÙej 97. The output of a logic gate is '1' when all its
(d) shareware/MesÙejJesÙej inputs are '0'. Then the gate is either
92. In order to read multiple bytes of a row at the efkeâmeer ueeefpekeâ iessš keâe DeeGšhegš '1' nw Ùeefo Fmekesâ
same time, we make use of _______. meYeer Fvehegš '0' nwb~
Skeâ ner meceÙe ceW Skeâ hebefkeäle kesâ keâF& yeeFšdme heÌ{ves kesâ (a) A NAND or an EX–OR Gate
efueS, nce Fmekeâe GheÙeesie keâjles nQ_______ Skeâ NAND Ùee Skeâ EX–OR iesš
(a) Memory extension (b) A NOR or an EX–NOR Gate
(b) Latch Skeâ NOR Ùee Skeâ EX–OR iesš
(c) Shift register
(c) An OR or an EX–NOR Gage
(d) More than one of the above
93. Where is the cache memory located?/kewâMe
Skeâ OR Ùee Skeâ EX–OR iesš
(d) An AND or an EX–OR Gate
(cache) cesceesjer keâneB efmLele nesleer nw?
Skeâ AND Ùee Skeâ EX–OR iesš
(a) RAM/jwce (b) CPU/meer. heer. Ùet.
98. Gate whose output is '0' (zero) only when
(c) CU/meer. Ùet. (d) Monitor/cee@veeršj
inputs are different is called :
94. BCD digits in a Karnaugh map are restricted Jen iesš efpemekeâe DeeGšhegš „0‟ (MetvÙe) neslee nw, kesâJeue
from :
leYeer peye Fvehegš efYeVe nesles nQ, Ùen keânueelee nw :
Skeâ keâeveex ceQhe ceW BCD Debkeâ meerefcele nesles nQ–
(a) XOR (b) XNOR
(a) 0000 through 1100/0000 mes 1100 lekeâ
(c) NOR (d) NAND
(b) 0000 through 1010/0000 mes 1010 lekeâ 99. When does a negative level triggered flip-flop
(c) 1010 through 1110/1010 mes 1110 lekeâ in Digital Electronics changes its state?/ef[efpešue
(d) 1010 through 1111/1010 mes 1111 lekeâ Fueskeäš^e@efvekeäme ceW vekeâejelcekeâ mlej efš^iej eqHeäuehe-Heäuee@he
95. Boolean algebra can be used:
Deheveer efmLeefle keâye yeouelee nw?
yetefueÙeve yeerpeieefCele keâe GheÙeesie efkeâÙee pee mekeâlee nw–
(a) When the clock is Negative/peye IeÌ[er vesiesefšJe nes
(a) For designing the digital computers/designing
the digital computers ceW (b) When the clock is Positive/peye IeÌ[er mekeâejelcekeâ nes
(b) In building logic symbols/building logic (c) When the inputs are all zero/peye meYeer Fvehegš
symbols ceW MetvÙe nes
(c) In circuit theory/circuit theory ceW (d) More than one of the above/GheÙeg&òeâ ceW mes Skeâ mes
(d) More than one of the above/GheÙeg&keäle ceW mes Skeâ mes DeefOekeâ
DeefOekeâ 100. The 15's complement of the hexadecimal
96. The Boolean expression A + BC equals number (B0210)16 is
yetefueÙeve SkeämeØesMeve A + BC _____ kesâ yejeyej nw~ <e‰oMeceJeueerÙe mebKÙee (B0210)16 keâe 15JeeB hetjkeâ
(a) (A' + B) (A' + C) keäÙee nw?
(b) (A + B) (A' + C)
(a) (4FDEF)16 (b) (4FDF0)16
(c) (A + B) (A + C)
(c) (50EF0)/16 (d) (40DE0)16

SOLUTION : PRACTICE SET- 4

ANSWER KEY
1. (a) 11. (a) 21. (d) 31. (b) 41. (b) 51. (b) 61. (b) 71. (b) 81. (c) 91. (b)
2. (b) 12. (c) 22. (a) 32. (c) 42. (b) 52. (a) 62. (a) 72. (c) 82. (a) 92. (b)
3. (a) 13. (d) 23. (c) 33. (b) 43. (d) 53. (a) 63. (d) 73. (b) 83. (a) 93. (b)
4. (c) 14. (a) 24. (c) 34. (c) 44. (a) 54. (b) 64. (a) 74. (d) 84. (c) 94. (b)
5. (b) 15. (d) 25. (c) 35. (d) 45. (c) 55. (c) 65. (b) 75. (a) 85. (d) 95. (d)
6. (a) 16. (c) 26. (a) 36. (d) 46. (a) 56. (a) 66. (b) 76. (d) 86. (b) 96. (c)
7. (a) 17. (c) 27. (d) 37. (b) 47. (b) 57. (c) 67. (b) 77. (a) 87. (d) 97. (b)
8. (b) 18. (a) 28. (b) 38. (a) 48. (c) 58. (c) 68. (a) 78. (c) 88. (c) 98. (b)
9. (b) 19. (b) 29. (c) 39. (c) 49. (a) 59. (d) 69. (a) 79. (d) 89. (c) 99. (a)
10. (d) 20. (c) 30. (d) 40. (a) 50. (b) 60. (a) 70. (d) 80. (c) 90. (b) 100. (a)
158 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
 SOLUTION
1. (a) 7. (a)
Skeâ AI ØeCeeueer keâes leke&âmebiele SpeWš Deewj Gmekesâ heÙee&JejCe kesâ Infrastructure as a Service Deewj Software as a Service
DeOÙeÙeve kesâ ™he ceW heefjYeeef<ele efkeâÙee pee mekeâlee nw~ Skeâ yegefæceeve keäueeG[ keâbhÙetefšbie keâe Skeâ Øekeâej nw efpemekeâe Âef<škeâesCe GÛÛe mlej keâe
SpeWš meWmej kesâ ceeOÙece mes heÙee&JejCe keâes mecePeles nQ Deewj SkeäÙegSšme& Decetle&lee (abstraction) Øeoeve keâjlee nw leeefkeâ keäueeG[ keâes Deemeeveer
kesâ ceeOÙece mes Deheves heÙee&JejCe hej keâeÙe& keâjles nQ~ SDeeF& SpeWš ceW mes Øees«eece efkeâÙee pee mekesâ~
8. (b)
%eeve, efJeÕeeme, Fjeoe Deeefo pewmes- ceeveefmekeâ iegCe nes mekeâles nw~
AWS IoT Core, Fbšjvesš Dee@Heâ efLebime (IoT) ef[JeeFme keâes keäueeG[
2. (b)
mes peesÌ[ves kesâ efueS Amazon Web Services (AWS) Éeje Øeoeve
DelÙeefOekeâ yeÌ[s [sše mesš efpevnW hewšve&, ØeJe=efòeÙeeW Deewj mebIeeW keâes Øekeâš efkeâÙee ieÙee Skeâ huesšHeâe@ce& nw~ Ùen Fbšjvesš mes pegÌ[s ef[JeeFme Deewj
keâjves kesâ efueS keâchÙetšsMeveue ™he mes efJeMues<eCe efkeâÙee pee mekeâlee nw AWS keäueeG[ kesâ yeerÛe megjef#ele, efÉ-efoMeelcekeâ mebÛeej Øeoeve keâjlee
efJeMes<e ™he mes ceeveJe JÙeJenej Deewj yeeleÛeerle mes JÙeòeâ efkeâÙes peeles nw nw, efpememes Deehe keâveskeäšs[ ef[JeeFme mes [sše Skeâ$e, mebmeeefOele,
efpemekesâ GheÙeesie mes GheÙeesieer peevekeâejer Øeehle keâer pee mekeâleer nw~ efJeMues<eCe Deewj keâeÙe& keâj mekeâles nw~ IBM Watson IoT, Google
3. (a) Cloud Deewj Azure IoT Hub pewmes DevÙe efJekeâuhe ›eâceMe: IBM,
ceMeerve ueefveËie Deewj Deeefš&efheâefMeÙeue FbšsefuepeWme kesâ yeejs ceW melÙe keâLeve Google Deewj Microsoft Éeje Øeoeve efkeâS ieS IoT huesšHeâe@ce& nw~
- 9. (b)
1. ceMeerve ueefveËie kesâ efyevee Yeer Deeefš&efheâefMeÙeue FbšsefuepeWme mecYeJe neslee nw~ ceMeerve ueefveËie ke=âef$ece yegefæceòee (AI) keâe Skeâ Ghe#es$e nw~ pees
2. ceMeerve ueefveËie keâes Deeefš&efheâefMeÙeue FbšsefuepeWme keâe meyemesš ceevee keâchÙetšjeW keâes mhe„ ™he mes Øees«eece efkeâS efyevee [sše mes meerKeves Deewj
peelee nw~ DevegYeJe kesâ DeeOeej hej Deheves ØeoMe&ve ceW megOeej keâjves keâer Devegceefle
oslee nw~ ceMeerve ueefveËie Suieesefjoce [sše ceW hewšve& Deewj mebyeOe {tbÌ{les nw
3. FbšsefuepeWme keâchÙetšj ceeveJe keâer lejn meesÛeves Deewj Deheves Deehe
Deewj efheâj Gve hewšveeX keâe GheÙeesie veS [sše hej YeefJe<ÙeJeeefCeÙeeB Ùee
šemkeâ keâjves kesâ efueS AI keâe GheÙeesie keâjlee nw, peyeefkeâ ML Ùen efveCe&Ùe uesves kesâ efueS keâjles nw~
nw efkeâ kewâmes keâchÙetšj efmemšce Deheveer FbšsefuepeWme efJekeâefmele keâjlee nw~ 10. (d)
4. AI Gve šemkeâeW keâes nue keâjlee nw efpevekesâ efueS ceeveJe yegefæ keâer meJe&j meeF[ efm›eâefhšbie ueQiJespe kesâ mevoYe& ceW efoÙes ieÙes efJekeâuhe ceW keâesF&
DeeJeMÙekeâlee nesleer nw peyeefkeâ ML [sše mes meerKekeâj Deewj hetJe& Yeer veneR nw
Devegceeve ueieekeâj šemkeâeW keâes nue keâjlee nw~ (A) HTML Ùen Skeâ ceeke&âDehe ueQiJespe nw~
4. (c) (B) C++ - Ùen Skeâ meeceevÙe GösMÙe Jeeueer Øees«eeefcebie ueQiJespe nw,
heefyuekeâ yuee@keâÛesve iewj-ØeefleyebOeelcekeâ Deewj Devegceefle jefnle nw Deewj uesefkeâve meJe&j meeF[ efm›eâefhšbie kesâ efueS GheÙeesie veneR nesleer nw~
Fbšjvesš Skeämesme keâjves Jeeuee keâesF& Yeer JÙeefòeâ DeefOeke=âle vees[ yeveves kesâ (C) CSS - Ùen Skeâ mšeFue Meerš ueQiJeWpe nw~
efueS yuee@keâÛesve huesšheâece& hej meeFve Fve keâj mekeâlee nw~ Ùen Ùetpeme& 11. (a)
Jele&ceeve Deewj efheÚues efjkeâe@[& osKe mekeâlee nw Deewj ieefleefJeefOeÙeeW keâe WAV keâe hetje veece JesJeheâe@ce& Dee@ef[Ùees heâeFue heâe@cexš (WAVE Ùee
mebÛeeueve keâj mekeâlee nw~ WAV ) nw~ Ùen Skeâ Dee@ef[Ùees heâeFue Øee®he ceevekeâ nw, efpemes IBM
5. (b) Deewj Microsoft Éeje efJekeâefmele efkeâÙee ieÙee nw, pees PC hej Dee@ef[Ùees
Deeefš&efheâefMeÙeue FbšsefuepeWme (AI) ceMeerveeW ceW ceeveJe yegefæ kesâ DevegkeâjCe efyešmš^erce keâes mšesj keâjves kesâ efueS nw~ Ùen ceeF›eâesmee@heäš efJeb[espe
keâes meboefYe&le keâjlee nw, pees Gvns Ssmes keâeÙe& keâjves keâer Devegceefle oslee nw efmemšce hej Demecheeref[le (uncompressed) Dee@ef[Ùees kesâ efueS
GheÙeesie efkeâÙee peeves Jeeuee cegKÙe Øee®he nw~
efpevekesâ efueS Deeceleewj hej ceeveJe yegeæ f keâer DeeJeMÙekeâlee nesleer nw~ AI
12. (c)
ceW ceMeerve ueefveËie, vesÛegjue ueQiJespe Øeesmesefmebie, Deeefš&efheâefMeÙeue vÙetjue Dee@ef[Ùees Jeeref[Ùees FbšjueerJe, ceeF›eâesmee@heäš Éeje efJeb[espe mee@heäšJesÙej kesâ
vesšJeke&â, [erhe ueefveËie Deewj kebâhÙetšj efJepeve pewmes efJeefYeVe Ghe#es$e efueS Jeeref[Ùees kesâ efnmmes kesâ ™he cebs hesMe efkeâÙee ieÙee nw Ùen Skeâ
Meeefceue nw, Deewj FmeceW mJeemLÙe osKeceeue Deewj efJeòe mes ueskeâj ceušerceeref[Ùee kebâšsvej keâe Øee™he nw~ AVI heâeFueeW kesâ heâeFue kebâšsvej
jesyeesefškeäme Deewj mJeeÙeòe JeenveeW lekeâ kesâ #es$eeW ceW DevegØeÙeesie nw~ cebs Dee@ef[Ùees Deewj Jeeref[Ùees oesveeW [sše nes mekeâles nw~
6. (a) 13. (d)
IoT me#ece lekeâveerkeâ Jen lekeâveerkeâ nesleer nw efpemeceW GhekeâjCe Deewj F&-ieJeveXme, Fueskeäš^e@efvekeâ ieJeveXme keâe mebef#ehle ™he nw F&-ieJeveXme keâe
ef[JeeFme Fbšjvesš mes pegÌ[s nesles nQ Deewj Skeâ-otmejs kesâ meeLe [sše keâe leelheÙe& DeeF&F&meeršer (IECT) kesâ DevegØeÙeesie kesâ meeLe mejkeâejer keâece
Deeoeve-Øeoeve keâj mekeâles nQ~ Fve ef[JeeFmeeW ceW meWmej, mee@HeäšJesÙej Deewj keâepe mes nw~
DevÙe lekeâveerkesâ Meeefceue nesleer nQ, pees GvnW [sše Fkeâªe keâjves, 14. (a)
efJeMues<eCe keâjves Deewj Ùetpeme& keâes GheÙeesieer peevekeâejer Øeoeve keâjves ceW yueessefheâMe Skeâ Øekeâej keâe meceefcele Sefv›eâhMeve SuieesefjLece nw~ Fmes yeÇtme
me#ece yeveeleer nw~ MveerÙej Éeje 1993 ceW ef[peeFve efkeâÙee ieÙee Lee Deewj keâF& efmeheâj metš
GoenjCe– keäueeG[ keâchÙetefšbie, JeeÙejuesme meWmej vesšJekeäme&, efyeie [sše Deewj Sefv›eâhMeve GlheeoeW ceW Meeefceue efkeâÙee ieÙee Lee~ Fmekeâe Deekeâej
Sveeefueefškeäme, mceeš& nesce ef[JeeFme Deeefo~ 64 efyeš keâe neslee nw~ meceefcele SuieesefjLece ef›eâhšes«eeheâer ceW efveoxMeeW keâe
159 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
Skeâ mesš nw pees [sše keâes Sefv›eâhš Deewj ef[ef›eâhš keâjves kesâ efueS Skeâ vesšJeke&â kesâ ™he ceW keâeÙe& keâjlee nw FbšjvesšJeefkeËâie Gve JÙeeheej, GlheeoeW
kegbâpeer keâe GheÙeesie keâjlee nw~ Ùen Sefv›eâhMeve keâe meyemes mejue Øekeâej nw Deewj Øeef›eâÙeeDeeW keâes meoefYe&le keâjlee nw~ pees FbšjvesšJeke&â yeveeves Deewj
efpemeceW peevekeâejer keâes mecePeves kesâ efueS kesâJeue Skeâ ieghle kegbâpeer Meeefceue ØeMeeefmele keâjves keâer Ûegveewleer keâes hetje keâjlee nw~
nesleer nw~ 22. (a)
15. (d) ›eâemeDeesJej kesâyeue (Crossover cable) Skeâ ner Øekeâej kesâ oes
Jeu[& JeeF[ Jesye keâes efoKeeves kesâ efueS yeÇeG]pej efJeMes<e ™he mes HTML GhekeâjCeeW keâes Deeheme ceW peesÌ[lee nw~ pewmes–[eršerF&-[eršerF& Ùee [ermeerF&-
(Hypertext Markup Language) keâe GheÙeesie keâjlee nw~ HTML [ermeerF&~
Jesye hespeeW keâes ef[peeFve keâjves Deewj peevekeâejer ØeoefMe&le keâjves kesâ efueS Skeâ 23. (c)
vesšJeke&â ceW mebÛeej cees[, Gme lejerkesâ keâes oMee&les nw efpemekesâ ceeOÙece mes
ceevekeâ ceeke&âDehe Yee<ee nw Deewj yeÇeGpej Fmes heÌ{keâj Jesye hespeeW keâes Ùetpeme& kesâ
Éeje osKeves kesâ efueS Øemlegle keâjlee nw~ [sše vesšJeke&â kesâ efJeefYeVe GhekeâjCeeW Ùee vees[dme kesâ yeerÛe mebÛeeefjle neslee
16. (c) nw~ vesšJeke&â mebÛeej kesâ leerve ØecegKe cees[ nesles nw–
cesMe Skeâ GÛÛelece efJeÕemeveerÙelee Jeeueer šesheesuee@peer nw~ Ùen Skeâ (i) efmechueskeäme cees[
vesšJeke&â šesheesueepeer nw efpemeceW ØelÙeskeâ vees[ keâe DevÙe meYeer vees[dme kesâ (ii) neHeâ-[ghueskeäme cees[
meeLe meerOes keâveskeäš efkeâÙee peelee nw~ Fme šesheesuee@peer ceW ØelÙeskeâ vees[ kesâ (iii) Hegâue-[ghueskeäme cees[
efueS Skeâ mJeleb$e vesšJeke&â heLe neslee nw, efpememes vees[dme Skeâ otmejs mes 24. (c)
meerOes mebJeeo keâj mekeâles nw~ Fme lejn keâer šesheesueespeer efJeMes<e ™he mes (i) Fbšjvesš hej vesšJeke&â uesÙej hej efmJeÛe keâjvee, hewkesâš efmJeefÛebie kesâ
efJeMeeue vesšJekeäme& ceW GheÙeesie keâer peeleer nw, peneB yeÌ[s mebKÙee ceW vees[dme efueS [sše«eece heæefle keâe GheÙeesie keâjlee nw~
nesles nw DeefOekeâlece GheueyOelee Deewj vesšJeke&â ØeoMe&keâ keâer DeeJeMÙekeâlee (ii) Fbšjvesš Øeesšeskeâe@ue Jepe&ve 4 (IPV4) šermeerheer/DeeFheer (TCP/IP)
nesleer nw~ cee@[ue Éeje GheÙeesie efkeâÙee peeves Jeeuee ef[ueerJejer cewkewâefvepce nw~
17. (c) (iii) IPV4 heleeW keâe 32-efyeš Éeje oMee&Ùee peelee nw ve efkeâ 8 yeeFšdme
kebâhÙetšj vesšJeke&â ceW, SefhuekesâMeve uesÙej mes [sše š^ebmeheesš& uesÙej hej Dele: keâLeve (iii) DemelÙe Deewj keâLeve (i) Deewj (ii) melÙe nw~
Yespee peelee nw Deewj mesieceWš ceW heefjJeefle&le nes peelee nw~ efHeâj Fve Keb[es 25. (c)
keâes vesšJeke&â uesÙej hej mLeeveebleefjle keâj efoÙee peelee nQ Deewj FvnW hewkesâš šeFce MesÙeefjbie Skeâ Øeef›eâÙee nw efpemeceW keâF& Ùetpeme& Skeâ ner keâchÙetšj
keâne peelee nw~ efHeâj Fve hewkeâšeW keâes [sšeefuebkeâ uesÙej hej Yespee peelee nw efmemšce Ùee vesšJeke&â keâes meePee ™he ceW GheÙeesie keâjles nw, efpememes meceÙe
peneb GvnW øesâce ceW Svekewâhmeguesš efkeâÙee peelee nw~ efHeâj Fve øesâceeW keâes Deewj mebmeeOeveeW keâe meePee GheÙeesie efkeâÙee pee mekeâlee nw~ Ùen DeefOekeâebMe
efHeâefpekeâue uesÙej ceW mLeeveebleefjle keâj efoÙee peelee nw peneb øesâce efyešdme efJeefYeVe Ùetpeme& kesâ yeerÛe [sše meePee keâjves Deewj meeLe ceW keâece keâjves keâer
keâes heefjJeefle&le nes peeles nw~ megefJeOee Øeoeve keâjlee nw~ šeFce MesÙeefjbie lekeâveerkeâ keâchÙetšj mebÛeej keâer
18. (a) Meg™Deele keâes efÛeefÖle keâjleer nw~
MIDI keâe celeueye nw 'Musical Instrument Digital Interface' 26. (a)
Ùen Skeâ ceevekeâ Øeesšeskeâe@ue nw efpemekeâe GheÙeesie Fueskeäš^eefvekeâ mebieerle efmechueskeäme š^ebmeefceMeve Skeâ Øekeâej keâe š^ebmeefceMeve cees[ nw~ FmeceW [sše
GhekeâjCeeW, kebâhÙetšjeW Deewj DevÙe mebyebefOele ef[JeeFmeeW keâes peesÌ[ves Deewj keâes kesâJeue Skeâ ner efoMee kesâ ceeOÙece mes Yespee pee mekeâlee nw~ DeLee&led
efveÙebef$ele keâjves kesâ efueS efkeâÙee peelee nw~ mebÛeej Ùetefve[eÙejskeäMeveue neslee nw~
19. (b) 27. (d)
Fbšjvesš hej F&cesue Yespeves kesâ efueS SMTP (Simple Mail [sšeyesme kesâ meboYe& cebs keâeef[&veeefuešer keâe@uece cebs efveefnle [sše ceeveeW keâer
Transfer Protocol) keâe GheÙeesie efkeâÙee peelee nw~ SMTP F&cesue efJeefMe­lee keâes meboefYe&le keâjleer nw~ GÛÛe keâeef[&veeefuešer keâe celeueye nw
mebosMeeW keâes Skeâ cesue meJe&j mes otmejs cesue meJe&j lekeâ Yespeves kesâ efueS efkeâ keâe@uece cebs hetjer lejn DeefÉleerÙe cetuÙeeW keâe Skeâ yeÌ[e ØeefleMele
Skeâ ceevekeâ Øeesšeskeâe@ue nw~ F&cesue Øeehle keâjves kesâ efueS POP3 Deewj Meeefceue nw~ keâce keâeef[&veeefuešer keâe celeueye nw efkeâ keâe@uece cebs Fmekeâer
IMAP keâe GheÙeesie efkeâÙee peelee nw~ [sše jWpe cebs yengle mes "Repeats" nw~ efkeâmeer efjuesMeve (šsyeue) keâer
20. (c) mebKÙee keâes efjuesMeve keâer keâeef[&veeefuešer keâne peelee nw~
Jee@Ùeme DeesJej Fbšjvesš Øeesšeskeâe@ue (VoIP) Skeâ Ssmeer lekeâveerkeâ nw pees 28. (b)
Fbšjvesš hej heâesve keâe@ue keâjves Deewj Øeehle keâjves keâer Devegceefle osleer nw~ [sšeyesme meeceevÙeerkeâjCe (Normalization) [sše efjb[[smeer keâes keâce
21. (d) keâjves Deewj [sše DeKeb[lee ceW megOeej keâjves kesâ efueS leLee keâefLele
FbšjvesšJeefkeËâie oes MeyoeW mes efceuekeâj yevee nw~ Fbšj Deewj vesšJeefkeËâie meeceevÙe ™heeW keâer Skeâ ëe=bKeuee kesâ Devegmeej Skeâ efjuesMeveue [sšeyesme
efpemekeâe DeLe& nw hetjer lejn mes Deueie-Deueie vees[dme Ùee mesieceWš kesâ keâes mebjef#ele keâjves keâer Øeef›eâÙee nw~
yeerÛe mebyebOe~ Ùen keâveskeäMeve #es$e FkeâeF& jeGšj Ùee iesšJes kesâ meceeve 29. (c)
Fbšjmesmej GhekeâjCeeW kesâ ceeOÙece mes mLeeefhele keâer peeleer nw~ [sšeyesme cewvespeceWš efmemšce (DBMS) Skeâ efmemšce mee@heäšJesÙej nw efpemekeâer
Ùen FbšjkeâveskeäMeve Dekeämej meeJe&peefvekeâ, efveefpe, JeeefCeefpÙekeâ meneÙelee mes [sšeyesme keâes yeveeÙee Je cewvespe efkeâÙee peelee nw~ DBMS Ùetpej
(Commercial) DeewÅeesefiekeâ Ùee mejkeâejer vesšJeke&â kesâ yeerÛe ceW neslee leLee Øees«eecejeW keâes [sše yeveeves, hegve: Øeehle keâjves (efjš^eFJe), Dehe[sš keâjves
nw~ pees ceOÙeJeleea vesšJeefkeËâie GhekeâjCeeWb mes pegÌ[e nw pees Skeâ efJeMeeue Deewj cewvespe keâjves keâe Skeâ JÙeJeefmLele lejerkeâe nw~
160 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
30. (d) 38. (a)
[sšeyesme cewvespeceWš efmemšce yeveeves keâe keâejCe yeÌ[s [sše keâes mšesj DeesJejheäuees Deewj Deb[jheäuees Skeâ Ssmeer efmLeefle nw peneB Deehe [sše Øekeâej kesâ
keâjvee Lee Deewj Ùes [sše efkeâmeer Yeer ¬he ceW nes mekeâlee nw pewmes FceWpe, efueS efveOee&efjle Deekeâej keâer meercee keâes heej keâjles nw~
šskeämš, Dee@ef[Ùees Ùee efJeef[Ùees HeâeFue Deeefo~ DBMS Ùetpeme& keâes 39. (c)
efkeâmeer Yeer Øee®he kesâ [sše keâes mšesj Deewj Skeämesme keâjves keâer Devegceefle [eše mš^keäÛej efkeâmeer kebâhÙetšj efmemšce ceW [sše keâes mšesj leLee
oslee nw~ JÙeJeefmLele keâjves keâe Skeâ lejerkeâe nw, efpememes efkeâ nce [eše keâe
31. (b) Fmlesceeue Deemeeveer mes keâj mekesâ~ Øees«eece ef[peeFve ceW [eše mš^keäÛej
Ùeefo keâesF& mecyevOe INF ceW nw lees Jen 2NF ceW nesiee Deewj meYeer iewj
cenlJehetCe& Yetefcekeâe efveYeeles nQ~
kegbâpeer efJeMes<eleeSb ØeeLeefcekeâ kebgâpeer hej hetjer lejn keâecee&lcekeâ efveYe&j nw~
40. (a)
32. (c)
meceeve [eše efkeâmceeW Jeeues efYeVe–efYeVe DeJeÙeJeeW keâe meb«enCe DeeJÙetn
DBMS keâe hetje veece Database Management System nw~ Ùen
(Array) keânueelee nw pewmes–integer Ùee string DeeJÙetn keâe GheÙeesie
Skeâ mee@HeäšJesÙej neslee nw, efpemekeâer meneÙelee mes [sšeyesme keâes Create,
meeOeejCeleÙee keâchÙetšj Øees«eece ceW [eše DeeiexveeFpe keâjves kesâ efueS
Delete , Update leLee Manage efkeâÙee peelee nw~ [sšeyesme keâer
efvecveefueefKele efJeMes<eleeSB Fme Øekeâej nw- efkeâÙee peelee nw~
41. (b)
1. [sšeyesme ceW [eše keâes ›eâceyeæ mšesj efkeâÙee peelee nw~
meyemes henues yesme keäueeme kebâmš^keäšj keâes keâe@ue efkeâÙee peelee nw~ peye nce
2. [sšeyesme ceW [sše keâer Security Deewj Privacy keâe ØeyevOe GÛÛe
Skeâ JÙeglheVe (derived) keäueeme Dee@ypeskeäš yeveeles nQ, lees efmemšce
mlej keâe neslee nw~
Fmekesâ kebâmš^keäšj keâes FveJeeFš keâjves keâer keâesefMeMe keâjlee nw uesefkeâve
3. [sšeyesme ceW efkeâmeer Yeer [sše keâe [ghueerkesâš veneR neslee nw DeLee&led
keäueeme JÙeglheVe (derived) nesleer nw FmeefueS henues yesme keäueeme keâes
[sšeyesme Redundancy keâes keâce keâjlee nw~
FefveefMeÙeueeFpe efkeâÙee peevee ÛeeefnS, FmeefueS yeoues ceW yesme keäueeme
4. [sšeyesme keâes Multiple GheÙeesiekeâlee& Skeâ meeLe Skeämesme keâj mekeâles nQ~
kebâmš^keäšj keâes JÙeglheVe keäueeme kebâmš^keäšj mes henues keâe@ue efkeâÙee peelee
5. [sšeyesme ceW keâce mhesme ceW DeefOekeâ [sše mšesj efkeâÙee pee mekeâlee nw~
nw~
33. (b)
3NF Skeâ meeceevÙe efjuesMeveue [sšeyesme keâes ef[peeFve keâjves kesâ efueS 42. (b)
heÙee&hle nw, keäÙeeWefkeâ DeefOekeâebMe leermejer meeceevÙe Heâe@ce& šsyeue efJeueesheve, VB.NET Dee@ypeskeäš DeesefjSvšs[ Øees«eeefcebie Yee<ee nw efpemekesâ ceeOÙece
DeÅeleve Deewj meefcceueve keâer efJemebieefleÙeeW mes cegkeäle jnlee nw~ mes mee@heäšJesÙej ef[peeFve efkeâÙee peelee nw Fmekesâ Devleie&le C++,
JAVA, VB.NET, C#, .NET Deeefo Yee<eeÙeW Deeleer nw~
34. (c)
DeeOeej B mebKÙee 2020 keâes oMeceueJe mebKÙee 60 ceW ™heevlejCe 43. (d)
(2020)B = (60)10 HTML (Hyper Text Markup Language) ceeke&âDehe Øekeâej keâer
2×B3 + 0×B2 + 2×B1 + 0×B0 Yee<ee nw~ HTML Jeu[& JeeF[ Jesye hej Jesye hespespe keâes lewÙeej keâjves
2B3 + 2B kesâ efueS ØeÙegòeâ mee@HeäšJesÙej ueQiJespe nw efpemeceW hypertext leLee
B = 3 jKeves hej hyperlink keâe ØeÙeesie efkeâÙee peelee nQ~
2×33 + 2×3 = 54 + 6 = (60)10 44. (a)
Dele: DeeOeej B = 3 nw~ CSS ceW keâceWš <style> SefueceWš kesâ Devoj jKee peelee nw, Deewj / *
35. (d) mes Meg™ neslee nw Deewj */ hej meceehle neslee nw~ GoenjCe kesâ efueS-
MySQL ceW efkeâmeer efoS ieS [sšeyesme ceW meYeer iewj-DemLeeÙeer šsyeume /* This is a single-line comment */
keâes metÛeer yeæ keâjves kesâ efueS show tables keâceeb[ keâe GheÙeesie keâj 45. (c)
mekeâles nw~ Ùen keâceeb[ Jele&ceeve [sšeyesme ceW meYeer šsyeume keâer efuemš C++ ceW Ssjs oes Øekeâej kesâ nesles nQ–
ØeoefMe&le keâjsiee~ 1. Skeâue DeeÙeeceer Ssjs – Ùen meceeve [sše Øekeâej kesâ SefueceWšmd e keâe
36. (d) meb«en nw, pees cesceesjer kesâ Skeâ meefvveefnle yuee@keâ ceW meb«enerle nesles nQ~
HTML Skeâ ceeke&âDehe uewiJespe nw efpemekeâe GheÙeesie Jesyehespe yeveeves 2. yengDeeÙeeceer Ssjs – Ùen Skeâ meejCeer nw, efpemeceW Fmekesâ SefueceWšdme
Deewj mebjefÛele keâjves ceW efkeâÙee peelee nw~ FmeceW šQime Deewj Sefuecesvšdme kesâ ¤he ceW Skeâ Ùee DeefOekeâ meejCeer nesleer nQ~
keâe GheÙeesie efkeâÙee peelee nw pees Jesye hespe kesâ efJeefYeVe efnmmeeW keâes 46. (a)
heefjYeeef<ele keâjles nw, pewmes nsef[bie, hewje«eeheâ, efuebkeäme, Fcespe Deeefo~ BCD (Binary Coded Decimal) keâe mebef#ehle ™he nw~ FmeceW
37. (b) mechetCe& [sefmeceue mebKÙee keâes yeeFvejer ceW yeoueves keâer yepeeÙe [sefmeceue
peeJeeefm›eâhš ceW meele Øekeâej kesâ [sše šeFhe nw- Null, Undefined, mebKÙee kesâ ØelÙeskeâ Debkeâ keâes Gmekesâ Ûeej DebkeâerÙe yeeFvejer leguÙeebkeâ mes
Boolean, Number, String, Symbol, Object Type script ØeeflemLeeefhele keâj efoÙee peelee nw~ Fmes 4-efyeš yeermeer[er (BCD) keâes[
kegâÚ DevÙe šeFhe keâes Yeer heefjYeeef<ele keâjlee nw~ keâne peelee nw~
161 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
47. (b) 54. (b)
Recursive algorithm keâes ueeiet keâjves kesâ efueS cegKÙe ™he mes oes mes DeefOekeâ efJekeâuheeW ceW mes ÛeÙeve keâjves kesâ efueS efmJeÛe keâLeve keâe
mšwkeâ (Stack) data structure keâe GheÙeesie efkeâÙee peelee nw~ mšwkeâ ØeÙeesie efkeâÙee peelee nw~
Skeâ [sše mš^keâÛej nw pees [sše keâes LIFO kesâ DeeoMee&vegmeej jKelee nw 55. (c)
efoS ieS C++ keâes[ keâe DeeGšhegš S1 DeeSiee keäÙeeWefkeâ Skeâ veF&
Deewj efjkeâme&ve keâe@ume keâes hegMe Deewj hee@he keâjves kesâ efueS GheÙeesieer
efmš^bie S3 yeveeves kesâ efueS oes kewâjskeäšj Ssjs S1 Deewj S2 keâes mebÙeesefpele
neslee nw~ keâjves keâe lejerkeâe mener veneR nw~ C++ oes kewâjskeäšj Ssjs keâes mebÙeesefpele
48. (c) keâjves kesâ efueS std :: string keâe ØeÙeesie efkeâÙee peelee nw~
C++ HeâeFue nQ[efuebie ceW, ios::trunc cees[ keâe GheÙeesie efkeâmeer ceewpetoe 56. (a)
HeâeFue keâes MetvÙe uecyeeF& (Zero Length) lekeâ Úesše keâjves Skeâ Øees«eeefcebie Yee<ee efJeMes<e efveÙeceeW SJeb MeyoeW keâes leeefke&âkeâ ™he mes JÙeòeâ
(Truncate) keâs efueS efkeâÙee peelee nw~ keâjves Jeeueer Skeâ DeewheÛeeefjkeâ Yee<ee nw pees efkeâmeer SuieesefjLece keâes ueeiet keâjves
49. (a) nsleg uee@efpekeâue mšshme keâes GheÙeesieer yeveeleer nw~
yeeFvejer ceW 1010 Deewj 1100 kesâ yeerÛe AND Dee@hejsMeve keâjves hej 57. (c)
heefjCeece 1000 nesiee~ keäÙeeWefkeâ AND Dee@hejsMeve kesâ nj efyeš keâer Deejef #ele Meyo (Reserved Words) Jes Meyo nQ efpevnW Skeâ
Øees«eeefcebie Yee<ee Deheves GheÙeesie kesâ efueS Deueie jKeleer nw~ FvnW efJeMes<e
leguevee keâer peeleer nw, Deewj Deiej oesveeW efyešdme 1 nesles nw, lees heefjCeece
GheÙeesie kesâ efueS efJeefveÙeesefpele efkeâÙee ieÙee nw efpevekeâe GheÙeesie
1 neslee nw, DevÙeLee 0 nesiee~ Variable Names kesâ efvecee&Ce ceW veneR efkeâÙee peelee nw~
1010 58. (c)
AND 1100 FvekewâhmeguesMeve [sše Deewj Gmekeâer keâeÙe& #ecelee keâes Skeâ Skeâue FkeâeF& ceW
1000 uehesšves keâes meboefYe&le keâjlee nw, efpememes Gme [sše keâes meerefcele ¤he mes
50. (b) hengBÛevee Deewj Gmekeâe GheÙeesie keâjvee mebYeJe neslee nw~
Demescyeuej Yee<ee Skeâ ceMeerve hej efveYe&j Yee<ee nw~ Demescyeuej 59. (d)
mee@heäšJesÙej Øees«eece Demescyeueer Ùee efvecvemlejerÙe Yee<ee ceW efueKes ieÙes mee@heäšJesÙej keâer DeJewOe vekeâue Deewj efJelejCe mee@heäšJesÙej Ûeesjer
Øees«eece keâes ceMeerve Yee<ee ceW heefjJeefle&le keâjlee nw~ (Software piracy) nw~ Ùen efkeâmeer mJeeefcelJe Ùee keâevetveer DeefOekeâejeW
51. (b) kesâ efyevee mee@heäšJesÙej keâe DeJewOe ™he mes ØeÙeesie, Øeefleefueefhe yeveeves Ùee
ne[&JesÙej kesâ meeLe Deemeeveer mes mebJeeo keâjves Jeeueer Yee<ee keâes efvecve Jeleefjle keâjves kesâ keâeÙe& keâe JeCe&ve keâjleer nw~
ef
mlejerÙe Yee<ee (Low Level Language) keânles nQ~ Ùes Yee<eeSB Ùee lees 60. (a)
Ùeefo keâchÙetšj JeeÙejme keâchÙetšj kesâ HeâeFue SueeskesâMeve šsyeue keâes
ceMeerveer Yee<eeSB nesleer nwb Ùee Gvekesâ yengle keâjerye keâer Yee<eeSB nesleer nwb~ otef<ele (keâjhš) keâj oslee nw lees DOS ([eme) ef[mkeâ mes [sše keâes hegve:
FveceW yeeFvejer mebKÙee (0 Deewj 1) kesâ efveoxMe meefcceefuele nesles nQ efpevnW Øeehle veneR keâj mekeâlee nw~
keâchÙetšj meerOes ner mecePe Je efve<heeefole keâj mekeâlee nw peyeefkeâ GÛÛe 61. (b)
mlejerÙe Yee<eeDeeW (High Level Languages) Ùee Deb«espeer ceW efoÙes WinZip (efJeveef]pehe) Skeâ efnš kebâØesMeve mee@HeäšJesÙej nw~ Ùen yeÌ[er
ieÙes efveoxMeeW keâes venerb mecePe mekeâlee nw~ HeâeFueeW keâes Úesšer HeâeFueebs ceW kebâØesme keâjlee nw~ Fmekeâer ceoo mes
52. (a) HeâeFume keâes kebâØesme keâjkesâ ef]pehe HeâeFue ceW yeouekeâj ef[mkeâ hej keâeHeâer
mhesme yeÛeeÙee pee mekeâlee nw~
62. (a)
efcejekeâemš GheÙeesiekeâlee&DeeW keâes JeeF&-heâeF& GhekeâjCeeW kesâ yeerÛe GÛÛe
efjpeeuÙetMeve efÛe$eeW Deewj neF& [sefheâvesMeve Jeeref[Ùees kebâšsš meefnle
ceušerceeref[Ùee keâes JeeÙejuesme ™he mes meePee keâjves keâer Devegceefle oslee,
Yeues ner JeeF&-heâeF& vesšJeke&â GheueyOe ve nes~
63. (d)
keâcheeFuej efmemšce mee@HeäšJesÙej nw, pees neF&uesJeue ueQiJespe keâes ceMeerve
ueQiJespe ceW DevegJeeefole keâjkesâ meYeer Øekeâej kesâ Sjj, jWpe efueefceš keâer
peebÛe keâjlee nw leLee Skeâ yeej ceW Skeä]peerkeäÙetMeve kesâ efueS Yespelee nQ
peyeefkeâ, mØes[Meerš, Je[& Øeesmesmej leLee [ešeyesme Øees«eece Ùes meYeer
ShueerkesâMeve mee@HeäšJesÙej nw~
64. (a)
53. (a) JeÛeg&Deue cesceesjer, DeesSme keâe Skeâ cesceesjer ØeyebOeve #ecelee nw, pees
Skeâ ØeYeeJeer efJeefOe kesâ ™he ceW, Suieesefjodce keâes mLeeve Deewj meceÙe ne[&JesÙej Deewj mee@heäšJesÙej keâe GheÙeesie keâjlee nw leLee efpememes keâchÙetšj
meerefcele cee$ee ceW Deewj efkeâmeer hebâkeäMeve keâer ieCevee kesâ efueS DeÛÚer lejn keâes Yeeweflekeâ cesceesjer keâer keâceer kesâ efueS RAM mes [eše mLeeveebleefjle
mes heefjYeeef<ele DeewheÛeeefjkeâ ueQiJespe ceW JÙeòeâ efkeâÙee pee mekeâlee nw~ efkeâÙee pee mekesâ~
162 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
65. (b) ef[efpešue ueeFš Øeesmesme (DLP)
šeFce MesÙeefjbie Deehejsefšbie efmemšce keâe ØeeLeefcekeâ GösMÙe neslee nw efkeâ hee@ueerpesš
Jen keâchÙetšj kesâ ØelÙeskeâ GheYeeskeälee keâes leer›e Øeefleef›eâÙee Øeoeve keâjelee [eÙejskeäš cesšue uespej efmebšefjbie (DMLS)
jns~ Fueskeäš^e@ve yeerce cesefušbie (EBM)
66. (b) 77. (a)
RAM (Random Access Memory) ceW meb«eefnle peevekeâejer keâes Fourth pevejsMeve keâchÙetšj Ssmee keâchÙetšj nw efpemekeâe efJekeâeme
BIOS (Basic Input Output System) keâer meneÙelee mes peeBÛee pee 1971-1980 kesâ ceOÙe ngDee Lee efpemeceW VLSI (Very Large
mekeâlee nw~ Scale Integrated) meefke&âš keâe GheÙeesie efkeâÙee ieÙee nw~ Deewj Fme
67. (b) Øekeâej kesâ meefke&âš ceW ueieYeie 5000 š^ebefpemšj Deewj DeefOekeâ SefueceWš
meesueme (Solous), Hesâ[esje (Fedora), Gyebgšt (Ubuntu) Ùes meYeer nesles nw~
efuevekeäme ef[mš^eryÙetMeve Dee@hejsefšbie efmemšce nw peyeefkeâ nveerkeâe@cye 78. (c)
(Honeycomb) Sb[^eÙe[ (Android) Dee@hejsefšbie efmemšce keâe leermejs DARPA keâe hetCe& ™he 'Defence Advanced Research
Jepe&ve keâe keâes[ vesce nw~ Projects Agency' (ef[heWâme S[Jeebm[ efjmeÛe& Øeespeskeäšdme SpeWmeer)
68. (a) neslee nw~ Ùen Skeâ Decesefjkeâer mejkeâej keâer SpeWmeer nw~ Ùen ØeewÅeesefiekeâer
[s[uee@keâ Skeâ Ssmeer efmLeefle nw peneB Øeesmesme keâe Skeâ mesš DeJe¬æ Deewj efJe%eeve keâer meerceeDeeW keâe efJemleej keâjves kesâ efueS DevegmebOeeve Deewj
(blocked) nes peelee nw keäÙeeWefkeâ ØelÙeskeâ Øeesmesme ceW Skeâ efjmeesme& neslee efJekeâeme heefjÙeespeveeDeeW keâes lewÙeej Deewj ef›eâÙeeefvJele keâjlee nw~ Ssmee ceevee
nw Deewj efkeâmeer DevÙe Øeesmesme Éeje DeefOe«eefnle (acquired) otmejs efjmeesme& peelee nw efkeâ Fbšjvesš keâes DARPA ves efJekeâefmele efkeâÙee Lee~
keâer Øeleer#ee keâjlee nw~ 79. (d)
69. (a) ceeefme&Ùeve ‘šs[ ne@heâ’ keâes ØeLece ceeF›eâesØeesmesmej kesâ DeeefJe<keâejkeâ kesâ ™he
Glheeo keâer Kejero, Yegieleeve Deewj Dee@[&j keâes ÚesÌ[keâj, efoS ieS meYeer ceW peevee peelee nw~ 1971 ceW Fbšsue keâcheveer Éeje ØeLece ceeF›eâesØeesmesmej
efJekeâuhe Øeesmesme cewvespeceWš SefkeäšefJešer Dee@hejsefšbie efmemšce Éeje efveÙebef$ele ‘Fbšsue 4004’ keâe efJekeâeme efkeâÙee ieÙee efpemeves keâchÙetšj kesâ #es$e ceW
efkeâÙes peeles nQ~ ›eâeefvle uee oer~ Fmemes Úesšs Deekeâej kesâ keâchÙetšme& keâe efvecee&Ce mebYeJe
70. (d) ngDee efpevnW ceeF›eâes keâchÙetšj keâne ieÙee~
Ùetefvekeäme Deewj efuevekeäme Dee@hejsefšbie efmemšce kesâme -meWefmeefšJe nesles nw~ 80. (c)
Sce. Sme. efJeb[espe kesâme-mebsefmeefšJe veneR neslee nw~ SATA (Serial Advanced Technology Attachment) [sše keâes
71. (b) keâveskeäš leLee š^evmeheâj keâjleer nw~ Ùen Øeef›eâÙee ne[& ef[mkeâ [^eFJe Deewj
efJeefMe° ØeefleyebOeeW kesâ DeeOeej hej mee@heäšJesÙej kesâ ØeÙeesie keâe keâevetveer keâchÙetšj efmemšce kesâ yeerÛe nesleer nw~ Deewj IDE (Integrated Drive
DeefOekeâej mee@HeäšJesÙej ueeFmeWme kesâ ceeOÙece mes efoÙee peelee nw~ Electronics) keâe cegKÙe keâeÙe& keâchÙetšj ceojyees[& [sše heeLe Ùee yeme
72. (c) Deewj keâchÙetšj ef[mkeâ mšesjspe ef[JeeFme kesâ yeerÛe neslee nw~
LetÇhegš Øeef›eâÙeeDeeW keâer mebKÙee nw pees Øeefle meceÙe FkeâeF& kesâ efve<heeove keâes Dele: SATA Deewj IDE ne[& ef[mkeâ [^eFJe kesâ Øekeâej nw~
hetje keâjleer nw~ Ùeefo keâchÙetšj efmemšce n Øeesmesme keâes t meskeâC[ meceÙe 81. (c)
ceW hetje keâjlee nw~ lees kebâš^esue Ùetefveš Skeâ cenlJehetCe& ne[&JesÙej kebâheesveWš neslee nw pees kebâhÙetšj
hetj e efk eâÙee ieÙee keâgu e Øeesm esm e keâer m e bK Ùee n
kesâ meYeer DevÙe kebâheesveWšdme keâes kewâmes keâe@ceeb[ keâes JÙeòeâ keâjvee nw, Ùen
LetÇhegš · = efveOee&efjle keâjlee nw~ Ùen DevÙe Ùetefveš keâes kebâš^esue keâjves kesâ efueS
Øeesm esm e cesW u eiee m eceÙe t
kebâš^esue efmeieveue (Control Signal) keâe Fmlesceeue keâjleer nw~
73. (b)
82. (a)
ne[&JesÙej Fbšjhš Deewj mee@HeäšJesÙej Fbšjhš oesveeW ner Fbšjhš kesâ Øekeâej meerheerÙet keâer ieefle cesieenšd&pe ceW ceeheer peeleer nw~ keâchÙetšj kesâ Øeesmesmej keâer
nesles nw peyeefkeâ cesceesjer Fbšjhš, Fbšjhš keâe Øekeâej veneR nw~ ieefle keâes ceeheves kesâ efueS nšd&pe FkeâeF& keâe ØeÙeesie efkeâÙee peelee nw~ Ùeefo
74. (d)
Øeesmesmej Éeje efkeâmeer efveoxMe kesâ ef›eâÙeevJeÙeve ceW Skeâ meskeWâ[ keâe meceÙe
Ssmes ef[JeeFme efpeveceW Øeesmesefmebie keâer #ecelee ve nes, [bye šefce&veue
ueielee nw lees Gmekeâer ieefle Skeâ nšd&pe nesieer~
keânueelee nw pewmes keâeryees[&, m›eâerve FlÙeeefo~
83. (a)
75. (a)
Skeâue efÛehe hej keâchÙetšj keâes ceeF›eâeskeâvš^esuej keâne peelee nw, keäÙeeWefkeâ
[e@š cewefš^keäme efhebÇšj Fchewkeäš efØebšj nw pees Skeâ De#ejes keâes efveef§ele
Ùen Skeâ ner efÛehe ceW meerheerÙet, cesceesjer Deewj I/O kebâš^esue keâjves kesâ efueS
mebKÙee ceW efheve Ùee leejeW keâe GheÙeesie keâjkesâ efØebš keâjlee nw~
DevÙe mecyeefvOele ne[&JesÙej keâes Fbšer«es[ keâjlee nw~
76. (d)
84. (c)
3D efØeefšbie kesâ ØecegKe Øekeâej-
efmemšce yeme meerheerÙet, jwce Deewj Fvehegš/DeeGšhegš ef[JeeFme keâes keâveskeäš
mšerefjÙeesefueLees«eeheâer (SLA) keâjleer nw~ FmeceW [sše, S[^sme Deewj efveÙeb$eCe keâer peevekeâejer nesleer nw~
mesuesefkeäšJe uespej efmebšefjbie (SLA) meerheerÙet keâer ieefle Deewj cesceesjer kesâ Deekeâej keâer lejn efmemšce yeme keâer
heäÙetp[ ef[heesefpeMeve cee@[efuebie (FDM) ieefle keâchÙetšj kesâ ØeoMe&ve keâe Skeâ cenòJehetCe& efnmmee nw~
163 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
85. (d) processing unit) cesceesjer kesâ ®he ceW meboefYe&le efkeâÙee peelee nw
USB keâe hetje veece ÙetefvemeJe&ue meerefjÙeue yeme (Universal Serial keäÙeesefkeâ Ùen Deeceleewj hej meer.heer.Ùet. efÛehe kesâ Deboj efmLele neslee nw~
Bus) nw~ efpemekeâe ØeÙeesie nce keâchÙetšj kesâ hesefjhesâjue ef[JeeFme mes kewâMe cesceesjer meer.heer.Ùet. leLee cegKÙe cesceesjer kesâ yeerÛe yeheâj keâe keâece
peesÌ[ves kesâ efueS Fmlesceeue keâjles nw~ hesefjhesâjue ef[JeeFme pewmes–efØebšj, keâjlee nw~ Ùen DelÙevle leer›e cesceesjer nw~
mkewâvej Deewj keâer-yees[& nesles nw~ 94. (b)
86. (b) keâeveex cewhe ceW BCD Debkeâ 0000 mes 1010 lekeâ meerefcele nesles nw~
LeÇthegš Øeesmesme keâer mebKÙee nw pees Øeefle meceÙe FkeâeF& kesâ efve<heeove keâes hetje 95. (d)
keâjleer nw~ yetefueÙeve yeerpeieefCele Skeâ ieefCeleerÙe mebjÛevee nw, pees keâF& Øekeâej keâes
Ùeefo keâchÙetšj efmemšce n Øeesmesme keâes t meskeâC[ meceÙe ceW hetje keâjlee nw~ lees GheÙeesie keâjleer nw–
LeÇth egš =
hetj e efk eâÙee ieÙee Øeesm esm e keâe r keâgu e m ebK Ùee n 1. ef[efpešue kebâhÙetšj kesâ ef[peeFve kesâ efueS
Øeesm esm e keâe s u eiee m eceÙe t 2. lekeâ& ØeleerkeâeW kesâ efvecee&Ce ceW
CPU LeÇthegš (throughput) keâes yeÌ{eves kesâ efueS kewâMe (cache) cesceesjer 3. yeerpeieefCeleerÙe keâeÙeeX keâe efvecee&Ce
CPU leLee cesve cesceesjer kesâ yeerÛe jKeer peeleer nw~ 4. meefke&âš efmeæeble ceW
87. (d) 96. (c)
[eÙeveefcekeâ jwce keâes Øeefle meskesâC[ Deveskeâ yeej efjøesâMe keâjvee heÌ[lee nw~ yetefueÙeve DeuepesyeÇe ceW ef[mš^eryÙetefšJe efveÙece kesâ Devegmeej-
Ùen Skeâ mesceerkeâC[keäšj cesceesjer nw pees efkeâ meerheerÙet Éeje [ejskeäš A + BC = (A+B) (A+C) neslee nw~
Skeämesme keâer peeleer nw~ FmeceW [eše kewâhesefmešj ceW mšesj jnlee nw, efpemekesâ 97. (b)
keâejCe Fmes yeej-yeej efjøesâMe keâjvee heÌ[lee nw~ peyeefkeâ mšwefškeâ jwce ceW NOR Ùee Ex-NOR iesš ceW meYeer Fvehegš MetvÙe osves hej DeeGšhegš
[eše š^ebefpemšj ceW mesJe jnlee nw~ 1 Øeehle neslee nw~
88. (c)
FFFF nskeämee[sefmeceue ueeskesâMeve keâes ØeoefMe&le keâjves kesâ efueS 16 efyeš
Ùee 4 nskeämee[sefmeceue DebkeâeW keâer DeeJeMÙekeâlee nesleer nw~ FmeefueS, 64k
cesceesjer ceW DeeefKejer cesceesjer ueeskesâMeve FFFF nesieer~
89. (c)
kewâMe cesceesjer keâer meeFpe efJeefYeVe ef[JeeFme Deewj efmemšcme hej efveYe&j
keâjleer nw, uesefkeâve meeceevÙele: kewâMe cesceesjer keâs meeFpe keâer jWpe ueieYeie
kegâÚ efkeâueesyeeFš mes ueskeâj cesieeyeeFš lekeâ nes mekeâleer nw~
98. (b)
90. (b)
XNOR iesš Skeâ efJeMes<e ™he mes ef[peeFve efkeâÙee ieÙee uee@efpekeâ iesš nw
EEPROM keâe hetCe& ™he Fuesefkeäš^keâueer Fjspesyeue Øees«eecesyeue jer[-
Deesveueer cesceesjer nw~ EEPROM Ùetpej heefjJele&veerÙe ROM nw pees ef p emeceW kes â Jeue oes Fvehegš Deewj Skeâ DeeGšhegš neslee nw FmeceW peye
Ùetpej keâes mšesj [sše keâes ef[ueerš keâjves Deewj hegve: mšesj keâjves keâer Fvehegš efYeVe nesles nQ leYeer DeeGšhegš MetvÙe Deelee nw~
Devegceefle oslee nw~ EEPROM vee@ve-JeesueešeFue cesceesjer nw efpemeceW
[sše keâes Deueie-Deueie yeeFšdme JeeFpe efcešeÙee pee mekeâlee nw Deewj
hegve: Øees«eece efkeâÙee pee mekeâlee nw~
91. (b)
keâchÙetšj jesce (ROM) ceW yetš Heâce&JesÙej neslee nw efpemeceW keâes[ nesles nQ pees
keâchÙetšj keâes yeleeles nQ efkeâ Gmes Ûeeuet nesves hej keäÙee keâjvee nw~ GoenjCe kesâ 99. (a)
efueS- ne[&JesÙej [eiveesefmškeäme Ûeueevee Deewj Dee@hejsefšbie efmemšce keâes jwce ceW vesiesefšJe uesJeue efš^iej efHeäuehe-Heäuee@he ceW keäuee@keâ Fvehegš Deewj AND iesš
uees[ keâjvee~ yetš Heâce&JesÙej keâes yesefmekeâ Fvehegš DeeGšhegš efmemšce (BIOS) kesâ Fvehegš kesâ yeerÛe NOT iesš ceewpeto neslee nQ Fme Øekeâej peye keäuee@keâ
keâne peelee nw~ vesiesefšJe neslee nw lees vesiesefšJe uesJeue efš^iej efHeäuehe-Heäueehe Deheveer efmLeefle
92. (b) yeoue oslee nw~
Skeâ ner meceÙe ceW Skeâ hebekf eäle kesâ keâF& yeeFšdme heÌ{ves kesâ efueS, uewÛe 100. (a)
(Latch) keâe GheÙeesie keâjles nw~ 15's complement efvekeâeueves kesâ efueS efoS ieS vebyej keâes F (15)
93. (b) mes Ieševee heÌ[lee nw~
kewâMe cesceesjer Skeâ efÛehe DeeOeeefjle keâchÙetšj ef[JeeFme nw pees meer.heer.Ùet. F F F F F
ceW DeeJeMÙekeâ [sše jKeves kesâ efueS Skeâ DemLeeÙeer mšesjspe #es$e kesâ ¬he 15's Complement B 0 2 1 0
ceW keâeÙe& keâjlee nw~ kewâMe cesceesjer keâes Dekeämej CPU (Central (4 F D E F) 16

164 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
 PRACTICE SET - 5
1. In AI, the problem solving using judgmental or (a) Big Data can with neither structured data nor
common-sense part is generally known as ____ unstructured data, but it can only deal with
approach. /AI ceW, efveCe&Ùe Ùee meeceevÙe %eeve Yeeie keâe semi-structured data.
GheÙeesie keâjkesâ mecemÙee keâes nue keâjvee Deeceleewj hej efyeie [sše ve lees mebjefÛele [sše Deewj ve ner DemebjefÛele [sše
peevee peelee nw- kesâ meeLe keâeÙe& keâj mekeâlee nw, uesefkeâve Ùen kesâJeue DeLe&-
(a) Depth-first-search/[shLe heâmš& meÛe& mebjefÛele [sše kesâ meeLe keâeÙe& keâj mekeâlee nw~
(b) Random/ÙeeÂefÛÚkeâ (b) Big Data can deal with unstructured data but
cannot deal with structured data.
(c) Heuristic/¢etefjefmškeâ
efyeie [sše mebjefÛele [sše kesâ meeLe keâeÙe& keâj mekeâlee nw uesekf eâve
(d) Breadth-first-search/yeÇs[dLe heâmš& meÛe&
DemebjefÛele [sše kesâ meeLe keâeÙe& veneR keâj mekeâlee nw~
2. Match OS abstractions in left column to the
(c) Big Data can deal with both structured and
hardware components in right column/yeeSb
unstructured data.
keâe@uece ceW Dees.Sme. Symš^wkeäMeve keâe efceueeve oeSb keâe@uece efyeie [sše mebjefÛele Deewj DemebefÛele [sše oesveeW kesâ meeLe
ceW ne[&JesÙej IeškeâeW mes keâjW~ keâeÙe& (deal) keâj mekeâlee nw~
a. Thread/LeÇs[ 1. Interrupt/Fbšjhš (d) Big Data can deal with structured data but
b. Virtual Address Space 2. Memory/cesceesjer cannot deal with unstructured data.
JeÛeg&Deue S[^sme mhesme efyeie [sše DemebjefÛele [sše kesâ meeLe keâeÙe& keâj mekeâlee nw
c. File System/heâeFue efmemšce 3. CPU/meer.heer.Ùet. uesefkeâve mebjefÛele [sše kesâ meeLe keâeÙe& veneR keâj mekeâlee nw~
d. Signal/efmeiveue 4. Disk/ef[mkeâ 6. Which of the following is an invalid type of IoT
sensor?/efvecveefueefKele ceW mes keâewve-mee IoT meWmej keâe
(a) a – 2, b – 4, c – 3, d – 1
(b) a – 1, b – 2, c – 3, d – 4 DeceevÙe Øekeâej nw?
(c) a – 3, b – 2, c – 4, d – 1 (a) Infrared/Fvøeâejs[
(d) a – 4, b – 2, c – 2, d – 1 (b) Accelerometer/Skeämesuesjesceeršj
3. The auto-tagging feature of Facebook is an (c) Proximity/Øeesefkeämeefcešer
application of ______. (d) Towel/še@Jesue
Hesâmeyegkeâ keâe Dee@šes-šwefiebie HeâerÛej _____ keâe Skeâ 7. The Internet of Things (IoT) describes the
DevegØeÙeesie (application) nw~ network of physical objects referred to as
(a) natural language processing _______ that are embedded with sensors.
vesÛegjue ueQiJespe Øeesmesefmebie Fbšjvesš Dee@Heâ efLebime (IoT), meWmej kesâ meeLe Scyes[s[
(b) robotics/jesyeesefškeäme ______ kesâ ™he ceW meboefYe&le efHeâefpekeâue Dee@ypeskeäš kesâ
(c) Internet of things/Fbšjvesš Dee@Heâ efLebime vesšJeke&â keâe JeCe&ve keâjlee nw~
(d) artificial intelligence/Deeefš&HeâerefmeÙeue FbšsefuepeWme (a) things/efLebime
4. Which of the following is the delivery of (b) intermediate system/Fbšjceeref[Sš efmemšcme
different services through the Internet, (c) components/kebâheesveWšdme
including data storage, servers databases, (d) routers/jeGšme&
networking, and software?
8. k-Means SuieesefjLce Skeâ ____ SuieesefjLce nw~
efvecveefueefKele ceW mes keâewve, Fbšjvesš kesâ ceeOÙece mes [sše
(a) mesceer-meghejJeeFp[ ueefveËie
mšesjspe, meJe&j, [sšeyesme, vesšJeefkeËâie Deewj mee@heäšJesÙej
(b) meghejJeeFp[ ueefveËie
Deeefo kesâ meeLe efJeefYeVe mesJeeDeeW keâer ef[ueerJejer nw?
(c) efjFbheâesme&ceWš ueefveËie
(a) Database Management systems/[sšeyesme
(d) DevemeghejJeeFp[ ueefveËie
cewvespecesvš efmemšce 9. What does the "RFID" stand for, in the context
(b) Artificial Intelligence/ ke=âef$ece yegefæceòee of internet of Things (IoT)?
(c) Cloud computing/ keäueeG[ keâchÙetefšbie Fbšjvesš Dee@heâ efLebime (DeeF&. Dees.šer]) kesâ meboYe& ceW ‘‘Deej.
(d) Computer networking/ keâchÙetšj vesšdJeefkeËâie Sheâ . DeeF&. [er.’’ keâe DeLe& keäÙee nw?
5. Which of the following statements is correct in (a) Radio Frequency Identification
regard to Big Data? jsef[Ùees øeâerkeäJeWmeer DeeF[WefšefheâkesâMeve
efyeie [sše (Big Data) kesâ mebyebOe ceW efvecveefueefKele ceW mes (b) Radio Frequency Internal Device
keâewve-mee keâLeve mener nw? jsef[Ùees ØeâerkeäJeWmeer Fbšjveue ef[JeeFme
165 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
 (c) Real-time Frequency Identification 15. Which of the following operator can be used,
efjÙeue-šeFce øeâerkeäJeWmeer DeeF[xefšefheâkesâMeve when we want to find a specific word and a
(d) Radio Field Integrated Detection synonym for that word in Google Search engine?
jsef[Ùees heâeru[ Fbšer«esšs[ ef[šskeäMeve peye nce ietieue meÛe& Fbpeve ceW keâesF& efJeefMe° Meyo Deewj
10. Which of the following is the correct syntax to Gmekeâe heÙee&ÙeJeeÛeer Keespevee Ûeenles nQ, lees efvecveefueefKele
include a comment in an HTML document? ceW mes efkeâme Dee@hejsšj keâe GheÙeesie efkeâÙee pee mekeâlee nw?
HTML [e@keäÙetceWš ceW keâceWš Meeefceue keâjves kesâ (a) Period/heerefjÙe[ (b) Minus/ceeFveme
efvecveefueefKele ceW mes keâewve mee mener efmebšwkeäme nw? (c) Quotations/keâesšsMevme (d) Tilde/efšu[
(a) /*Comment*/ 16. A _____ topology uses a single connection to
(b) <!--Comment--> connect all devices together.
(c) // _____ šesheesuee@peer, Skeâ ner peesÌ[ (keâveskeäMeve) keâe
(d) //Comment// ØeÙeesie meYeer ÙegefòeâÙeeW (devices) keâes Skeâ meeLe peesÌ[ves
11. Which of the following is a technique to blend kesâ efueS keâjlee nw~
two or more images to form a new image?
Skeâ veF& ÚefJe yeveeves kesâ efueS oes Ùee oes mes DeefOekeâ (a) bus/yeme
ÚefJeÙeeW keâes meefceefßele keâjves keâer lekeâveerkeâ efvecveefueefKele (b) star/mšej
ceW mes keâewve-meer nw? (c) ring/efjbie
(a) Modeling/cee@[efuebie Morphing/cee@efheËâie
(b) (d) More than one of the above/GheÙeg&òeâ ceW mes Skeâ mes
(c) Animating/Sefvecesefšbie (d)
Warping/Jee@efheËie
DeefOekeâ
17. In the OSI model, which layer is responsible
12. Which of the following design tools shows the
for routing and forwarding data packets?/OSI
overall flow of a multimedia presentation?
model ceW, keâewve-meer hejle [sše hewkesâš keâes ™š keâjves
efvecveefueefKele ceW mes keâewve-mee ef[peeFve štue ceušerceeref[Ùee
Øee™he keâe mece«e ØeJeen ØeoefMe&le keâjlee nw? Deewj De«esef<ele keâjves kesâ efueS efpeccesoej nw?
(a) Data Link Layer/[sše eEuekeâ hejle
(a) Link/ efuebkeâ
(b) Transport Layer/š^ebmeheesš& uesÙej
(b) Flow-chart/ heäuees-Ûeeš&
(c) Physical Layer/Yeeweflekeâ hejle
(c) Story board/ mšesjer yees[&
(d) None of the above/GheÙeg&òeâ ceW mes keâesF& veneR
(d) Gantt chart/ iewvš Ûeeš&
18. "Baud" is a unit of ______.
13. Which of the following is NOT the type of e-
Governance? ‘‘yee@[’’ ______ keâer FkeâeF& nesleer nw~
efvecveefueefKele ceW mes keâewve-mee F&-ieJeveXme keâe Øekeâej veneR nw? (a) Wavelength/lejbie owOÙe&
(a) Government-to-Government (G2G) (b) Frequency/DeeJe=efòe
mejkeâej-mes-mejkeâej (G2G) (c) Storage capacity/meb«enCe #ecelee
(b) Government-to-Citizen (G2C) (d) Data transfer rate/[eše mLeeveeblejCe oj
mejkeâej-mes-veeieefjkeâ (G2C) 19. What is the purpose of a subnet mask in
(c) Government-to-Citizen (G2B) TCP/IP networking?/TCP/IP vesšJee\keâie ceW meyevesš
mejkeâej-mes-JÙeJemeeÙe (G2B) ceemkeâ keâe GodosMÙe keäÙee nw?
(d) Employee-to-Government (E2G) (a) To identify the network portion of an IP
keâce&Ûeejer-mes-mejkeâej (E2G) address/ vesšJeke&â kesâ efnmmes keâer henÛeeve keâjves kesâ efueS
14. Which of the following is an example of a G2C Skeâ DeeF&heer helee
(Government to Citizen) e-Governance service? (b) To identify the host portion of an IP
efvecveefueefKele ceW mes keâewve-mee G2C (mejkeâej mes address/efkeâmeer Jemleg kesâ cespeyeeve efnmmes keâer henÛeeve
veeieefjkeâ) F&-ieJeveXme mesJee keâe Skeâ GoenjCe nw? keâjvee DeeF&heer helee
(a) Government-to-Government communication (c) To convert IP addresses into domain
platform/mejkeâej-mes-mejkeâej mebÛeej cebÛe names/DeeF&heer heles keâes heefjJee|lele keâjves kesâ efueS
(b) Secure document exchange for government keâeÙe&#es$e veece
offices/mejkeâej keâeÙee&ueÙeeW kesâ efueS megjef#ele [e@keäÙetceWš (d) More than one of the above/GheÙeg&òeâ ceW mes Skeâ mes
SkeämeÛeWpe (omleeJespe efJeefveceÙe) DeefOekeâ
(c) Digital payment portals for government 20. efvecveefueefKele ceW mes keäÙee Fbšjvesš hej [eše mebÛeej kesâ
employees /mejkeâejer keâce&ÛeeefjÙeeW kesâ efueS ef[efpešue efueS Skeâ peevee-ceevee Øeesšeskeâe@ue nw?
Yegieleeve heesš&ue (a) HTTP (b) SMTP
(d) Online tax filing/Dee@veueeFve šwkeäme HeâeFefuebie (c) SNMP (d) TCP/IP

166 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
21. With respect to TCP/IP, what is the full form of 26. LTE lekeâveerkeâ keâe GheÙeesie efvecve cebs mes efkeâme JeeÙejuesme
TFTP?/šermeerheer/DeeF&heer kesâ mecyevOe ceW, šerSheâšerheer Øeew]ÅeesefieefkeâÙeeW keâer heerÌ{er cebs efkeâÙee peelee nw?
keâe hetCe& ™he keäÙee nw? (a) 3G (b) 2G
(a) Trivial File Transfer Protocol (c) 4G (d) 1G
efš^efJeDeue heâeFue š^ebmeheâj Øeesšeskeâe@ue 27. Which command out of the following is NOT a
(b) Triangular File Transmission Protocol part of a data manipulation language?
š^Qieguej heâeFue š^evmeefceMeve Øeesšeskeâe@ue efvecveefueefKele ceW mes keâewve-mee keâceeb[ [sše nsjhesâj ueQiJespe
(c) Trivial File Transfer Page keâe efnmmee veneR nw?
efš^efJeDeue heâeFue š^ebmeheâj hespe (a) Delete (b) Insert
(d) Triangular File Transfer Protocol (c) Create (d) Update
š^Qieguej heâeFue š^evmeheâj Øeesšeskeâe@ue 28. Microsoft Access [sšeyesme ceW keâewve mee efJekeâuhe ue#Ùe
22. CSMA is a method which was developed to (Dee@ypeskeäš) keâes Fbefiele veneR keâjlee nw?
decrease the chances of collisions when two or (a) mlebYe (šsyeue)
more stations start sending their signals over (b) ™he (heâe@ce&)
the data link layer. What does CSMA stand (c) Yeeie (cee@[dÙetue)
for?
(d) keâeÙe&-he$ekeâ (Jeke&âMeerš)
CSMA Skeâ efJeefOe nw efpemes oes Ùee oes mes DeefOekeâ mšsMeveeW
Éeje [sše efuebkeâ uesÙej hej Deheves efmeiveue Yesspeves Meg™ keâjves 29. Which of the following is not a DBMS
software?/FveceW keâewve-mee DBMS mee@HeäšJesÙej veneR nw?
hej škeâjeJe keâer mebYeeJevee keâes keâce keâjves kesâ efueS
(a) ORACLE/Dee@jskeâue
efJekeâefmele efkeâÙee ieÙee Lee~ CSMA keâe keäÙee DeLe& nw?
(b) SYBASE/meeFyesme
(a) Carrier Sense Multiplexed Access
(c) COBOL/keâesyeesue
kewâefjÙej meWme ceušerhueskeäm[ Skeämesme
(d) SQL Server/SQL meJe&j
(b) Carrier Signal Modulated Access
30. Which of the following is not a feature of
kewâefjÙej efmeiveue cee@[guesšs[ Smmesme DBMS?
(c) Carrier Signal Multiplexed Access efvecveefueefKele ceW mes keâewve DBMS keâer efJeMes<elee veneR nw?
kewâefjÙej efmeiveue ceušerhueskeäme[ Skeämesme (a) Support ACID Property/Sefme[ iegCe keâe meceLe&ve
(d) Carrier Sense Multiple Access
(b) High Level of Security/megj#ee keâe GÛÛe mlej
kewâefjÙej meWme ceušerheue Skeämesme
(c) Single-user Access only/kesâJeue Skeâue-GheÙeesiekeâlee&
23. .........is a device to connect LAN to Internet.
hengBÛe
uewve keâes Fvšjvesš mes peesÌ[ves keâe GhekeâjCe ................nw~
(d) More than one of the above/GheÙeg&òeâ ceW mes Skeâ mes
(a) HTTP/SÛe.šer.šer.heer.
DeefOekeâ
(b) Router/jeGšj
31. In relational database, the data type of values
(c) Bridge/efyeÇpe in each column of a table is called
(d) Switch/efmJeÛe efjuesMeveue [sšeyesme ceW, efkeâmeer šsyeue kesâ njskeâ keâe@uece kesâ
24. The ability to easily add additional users means JewuÙet kesâ [sše šeFhe keâes keäÙee keâne peelee nw?
that a network is:
(a) attribute/Sefš^yÙetš
yeÌ[er Deemeeveer mes Deefleefjòeâ GheÙeesiekeâòee& keâes peesÌ[ mekeâves
(b) domain/[escesve
keâe DeLe& nw efkeâ Jen vesšJeke&â.............. nw~
(c) relation/efjuesMeve
(a) secure/megjef#ele
(d) More than one of the above/GheÙeg&òeâ ceW mes Skeâ mes
(b) dedicated/meceefhe&le
DeefOekeâ
(c) decentralized/efJekesâefvõle 32. Which of the following is not constraint in
(d) scalable/ceeheveerÙe SQL?
25. efvecveefueefKele ceW mes keâewve-meer Fbšjvesš Skeämesme efJeefOe efvecveefueefKele ceW mes keâewve-mee SQLceW constraint veneR nw?
JeeF&-heâeF& (Wi-Fi) lekeâveerkeâ keâe GheÙeesie keâjleer nw, pees (a) Primary key/ØeeLeefcekeâ kegBâpeer
Fueskeäš^e@efvekeâ GhekeâjCeeW keâes Fbšjvesš mes keâveskeäš keâjves Ùee (b) Not null/DeMeòeâ veneR
jsef[Ùees lejbieeW kesâ ceeOÙece mes JeeÙejuesme lejerkesâ mes [sše keâe (c) Union/efceueve
Deeoeve-Øeoeve keâjves ceW me#ece yeveeleer nw? (d) More than one of the above/GheÙeg&òeâ ceW mes Skeâ
(a) ISDN DeefOekeâ
(b) WIFI hotspots/JeeF&heâeF& ne@šmhee@š 33. Which of the following is NOT a type of
(c) Cable/kesâyeue DBMS?/efvecveefueefKele ceW mes keâewve-mee DBMS keâe
(d) Dial-up/[eÙeue-Dehe Øekeâej veneR nw?
167 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
 (a) Relational DBMS (b) Adding a new element to the stack
(b) Object-Oriented DBMS mšwkeâ ceW Skeâ veÙee SefueceWš peesÌ[vee
(c) Sequential DBMS (c) Removing an element from the stack
(d) More than one of the above/GheÙeg&òeâ ceW mes Skeâ mes mšwkeâ mes Skeâ Sefuecebsš keâes nševee
DeefOekeâ (d) Searching a given element in the stack
34. Which of the following is not a function of the mšwkeâ ceW efoS ieS SefueceWš keâes Keespevee
database? 40. Stack is a/mšwkeâ Skeâ :
efvecveefueefKele ceW mes keâewve-mee [sšeyesme keâe keâeÙe& veneR nw? (a) First in Random Out structure
(a) Manipulating data Heâemš& Fve jQ[ce DeeGš mš^keäÛej nw
(b) Security for stored data (b) Last in First Out structure
(c) Analysing code
(d) More than one of the above/GheÙeg&keäle ceW mes Skeâ mes
ueemš Fve Heâmš& DeeGš mš^keäÛej nw
DeefOekeâ (c) First in First Out structure
35. Which of the following MySQL query will
Heâmš& Fve Heâmš& DeeGš mš^keäÛej nw
display all the NAME from the table (d) Last in Last Out structure
STUDENT, which are having maximum five ueemš Fve ueemš DeeGš mš^keäÛej nw
characters and starting with the alphabet 'A'? 41. C++ programmers concentrate on creating
efvecveefueefKele ceW mes efkeâme MySQL query ceW ____ which contain data members and the
STUDENT mes Gve meYeer NAME keâes oMee&Ùee ieÙee nw~ member functions that manipulate those data
members and provide services to clients.
efpeveceW DeefOekeâlece heeBÛe keâjskeäšj nQ Deewj ....... 'A' mes C++ Øees«eecej ......... yeveeves hej OÙeeve keWâefõle keâjles nw
Meg™ nesles nQ? efpemeceW [sše meomÙe Deewj meomÙe hebâkeäMeve nesles nw pees Gve
(a) SELECT NAME FROM STUDENT
WHERE NAME LIKE 'A________';
[sše meomÙeeW ceW nsjhesâj keâjles nw Deewj «eenkeâeW keâes mesJeeS
(b) SELECT NAME FROM STUDENT Øeoeve keâjles nw~
WHERE NAME = 'A_________'; (a) components/keâcheesveWšdme
(c) SELECT NAME FROM STUDENT (b) pseudocode/mÙet[eskeâes[
WHERE NAME = 'A%%%%; (c) classes/keäueemesme
(d) SELECT NAME FROM STUDENT
WHERE NAME LIKE 'A%%%%' (d) objects/Dee@ypeskeäš
36. Which of these is a scripting languages? 42. In VB.NET___is a conversion class with no
FveceW mes keâewve meer efm›eâefhšie Yee<ee nw? possibility for data loss or erroneous result.
VB.NET ceW ______ Skeâ ™heeblejCe ßesCeer nw efpemeceW [sše
(a) Pascal/heemkeâue (b) Perl/heue&
neefve Ùee ieuele heefjCeeceeW keâer keâesF& mebYeeJevee veneR nw~
(c) X86 (d) C#
37. Who invented JavaScript the programming (a) mass conversion/JÙeehekeâ ™heeblejCe
language?/peeJeeefm›eâhš Øees«eeefcebie ueQiJespe keâe DeefJe<keâej (b) Hierarchical transformation/heoeveg›eâefcele
efkeâmeves efkeâÙee Lee? (neFDejeeEkeâkeâue) ®heeblejCe
(a) Brendan Eich/yeÇs[sve F&Ûe (c) Depth conversion/ienvelee ([shLe) ®heeblejCe
(b) Willem Einthoven/efJeuesce FvLeesJeve (d) Narrow conversion/mebkeâerCe& ®heeblejCe
(c) George Eastman /pee@pe& F&mšcewve 43. Which of the following functions is used to
close a file in Python?
(d) Emil Erlenmeyer/Sefceue DeuexvecesÙej efvecveefueefKele ceW mes efkeâme HebâkeäMeve keâe GheÙeesie heeFLeve ceW
38. A queue in which addition as well as deletion of
HeâeFue keâes yebo keâjves kesâ efueS efkeâÙee peelee nw?
elements can take place at both the ends is
(a) empty() (b) discard()
called/Skeâ keäÙet efpemeceW SefueceWš keâes peesÌ[ves kesâ meeLe–
(c) close() (d) end()
meeLe nševee Fmekesâ oesveeW efmejeW hej efkeâÙee pee mekeâlee nw, 44. Which of the following statement is
Gmes keäÙee keâne peelee nw? INCORRECT?
(a) Simple queue/efmebheue keäÙet efvecveefueefKele ceWs mes keâewve-mee keâLeve ieuele nw?
(b) Circular queue/mekeg&âuej keäÙet (a) Angular JS supports the model-view-
(c) Double-ended queue/[yeue–Sb[s[ keäÙet controller (MVC) design pattern but it does
not support the model-view-view model
(d) Priority queue/ØeeÙeesefjšer keäÙet
(MVVM) design pattern.
39. Popping an element from the stack means Sbieguej pesSme (Angular JS), cee@[ue-JÙet-kebâš^esuej
mšwkeâ mes SefueceWš keâe hee@efhebie (nševee) keäÙee neslee nw? (MVC) ef[peeFve hewšve& keâes meheesš& keâjlee nw uesefkeâve Ùen
(a) Sorting the elements in the stack cee@[ue-JÙet-JÙetcee@[ue (MVVM) ef[]peeFve hewšve& keâes
mšwkeâ ceW SefueceWš keâer ÚbšeF& meheesš& veneR keâjlee nw~
168 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
 (b) Window object is the main entry point of a (c) Hash table
client-side JavaScript (d) More than one of the above
/peeJeeefm›eâhš (JavaScript) ceW mejCeer (array) keâe GheÙeg&òeâ ceW mes Skeâ mes DeefOekeâ
GheÙeesie efkeâÙee pee mekeâlee nw~ 48. Which of the following statements is/are correct?
(c) A client side JavaScript code can be efvecveefueefKele ceW mes keâewve-mee/mes keâLeve mener nw/nQ?
embedded within an HTML document. 1. It is not possible to combine two or more files
/keäueeFbš-meeF[ peeJeeefm›eâhš keâes[ keâes HTML [ekeäÙetceWš opening mode in open( ) method./ open( ) efJeefOe
ceW Scyes[ efkeâÙee pee mekeâlee nw~ ceW oes Ùee DeefOekeâ heâeFue opening cees[ keâes mebÙeesefpele
(d) An array can be used in JavaScript keâjvee mecYeJe veneR nw~
/efJeb[es Dee@ypeskeäš, keäueeFbš-meeF[ peeJeeefm›eâhš keâe cegKÙe 2. It is possible to combine two or more files
ØeJesMe efyebog (entry point) nw~ opening mode in open( ) method./ open( ) efJeefOe
45. In C++, for what purpose the ‘‘rank()’’ is used? ceW oes Ùee DeefOekeâ ]heâeFue opening cees[ keâess mebÙeesefpele
C++ ceW ‘‘rank()’’ keâe GheÙeesie efkeâme GösMÙe kesâ efueS keâjvee mecYeJe nw~
efkeâÙee peelee nw? 3. ios::in and ios::out are input and output file
(a) It returns the size of each dimension opening modes respectively./ios::in Deewj
Ùen ØelÙeskeâ DeeÙeece keâe Deekeâej ueewšelee nw ios::out ›eâceMe: Fvehegš Deewj DeeGšhegš ]heâeFue
(b) It returns the maximum number of elements opening cees[ nQ~
that can be stored in the array (a) 1,3
Ùen meejCeer ceW meb«eefnle efkeâS pee mekeâves Jeeues lelJeeW keâer (b) 2,3
DeefOekeâlece mebKÙee ueewšelee nw~ (c) 3 only
(c) It returns the dimension of the specified array (d) More than one of the above/GheÙeg&òeâ ceW mes Skeâ mes
Ùen efveefo&° meejCeer keâe DeeÙeece ueewšelee nw~ DeefOekeâ
(d) More than one of the above/GheÙeg&keäle ceW mes Skeâ mes 49. What will be the output of the following?
DeefOekeâ efvecveebekf eâle keâe DeeGšhegš (output) keäÙee nesiee?
46. What is the difference between delete and int a = 5;
delete[ ] is C ++? cout <<“FIRST” <<(a<<Z) <<“SECOND”;
C ++ ceW delete Deewj delete [ ] kesâ yeerÛe keäÙee Deblej nw? (a) FIRST 52 SECOND
(a) Delete is syntactically correct but delete[] is (b) FIRST 20 SECOND
wrong and hence will give an error if used in (c) SECOND 25 FIRST
any case (d) None of the above/GheÙeg&òeâ ceW mes keâesF& veneR
ef[ueerš JeekeäÙe jÛevee keâer Âef° mes mener nw uesefkeâve ef[ueerš 50. The computer program that converts assembly
[] ieuele nw Deewj FmeefueS efkeâmeer Yeer efmLeefle ceW GheÙeesie language to machine language is called………
keâjves hej Ùen $egefš osiee~ keâchÙetšj keâe Jen ØeÇes«eece pees Demescyeueer Yee<ee keâes
(b) Delete is used to delete normal objects ceMeerveer Yee<ee ceW ™heebleefjle keâjlee nw,..........keânueelee nw~
whereas delete[] is used to delete pointer
objects (a) Complier/keâcheeFuej (b) Interpreter/FbšjhesÇšj
ef[ueerš keâe GheÙeesie meeceevÙe Dee@ypeskeäš keâes nševes kesâ (c) Assembler/Demescyeuej (d) Comparator/keâe@chešj
efueS efkeâÙee peelee nw peyeefkeâ ef[ueerš [] keâe GheÙeesie 51. Which of the following statements best reflects
hJeeBFbšj Deeypeskeäš keâes nševes kesâ efueS efkeâÙee peelee nw~ the feature of assembly language?
(c) Delete is used to delete single object whereas efvecveefueefKele ceW mes keâewve-mee keâLeve DemeWyeueer ueQiJespe
delete[] is used to delete multiple keâer efJeMes<elee keâes meyemes DeÛÚe oMee&lee nw?
(array/pointer of) objects (a) It increases the portability of the code.
ef[ueerš keâe GheÙeesie Skeâue Dee@ypeskeäš keâes nševes kesâ efueS Ùen keâes[ keâer heesš&efJeefuešer keâes yeÌ{elee nw~
efkeâÙee peelee nw peyeefkeâ ef[ueerš [] keâe GheÙeesie Deeypeskeäšme (b) It is what the computer sees and deals with.
(meejCeer/hJeebFšj) kesâ efueS SkeâeefOekeâ keâes nševes kesâ efueS Ùen Jener nw pees keâchÙetšj osKelee nw Deewj Gmemes efvehešlee nw~
efkeâÙee peelee nw~ (c) It is tied to the specifies of the underlying
(d) More than one of the above/GheÙeg&keäle ceW mes Skeâ mes machine./Ùen Debleefve&enf le ceMeerve keâer yeejerekf eâÙeeW mes yebOee nw~
DeefOekeâ (d) One line may involve many low-level
47. Which data structure is used for efficient operations./Skeâ hebefòeâ ceW keâF& efvecve mlejerÙe mebÛeeueve
searching, insertion, and deletion of
elements?/efkeâme [sše mebjÛevee keâe GheÙeesie efkeâÙee peelee Meeefceue nes mekeâles nw~
nw, kegâMeue Keespe, meeqcceueve Deewj lelJeeW keâe efJeueesheve? 52. What does the following symbol represent in a
flow chart?
(a) Stack
(b) Queue
heäuees Ûeeš& ceW efvecveefueefKele Øeleerkeâ keäÙee oMee&lee nw?
169 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
 (a) documenting/[ekeäÙetceWefšbie
(b) coding/keâesef[bie
(c) compiling/keâcheueeFbie
(a) Manual input/cewvegDeue Fvehegš (d) assembling/Smescyeefuebie
(b) Input/Output/Fvehegš/DeeGšhegš 59. The ............ program is used to convert
(c) Document/[e@keäÙetceWš mnemonic code to machine code./........... Øees«eece
(d) Manual operation/cewvegDeue Dee@hejsMeve keâe ØeÙeesie vesceesefvekeâ ketâš keâes ceMeerve ketâš ceW heefjJele&ve kesâ
53. Which of the following properties of an efueS neslee nw~
algorithm ensures that each step of the
(a) Debug/ef[yeie (b) C++
algorithm is properly defined and the actions to
be performed are clearly specified? (c) FORTRAN/Heâesjš^eve (d) Assembler/Demescyeuej
Suieesefjoce kesâ efvecveefueefKele iegCeeW ceW mes keâewve-mee iegCe 60. The first computer virus is:
megefveefMÛele keâjlee nw efkeâ Suieesefjoce kesâ ØelÙeskeâ ÛejCe keâes henuee keâchÙetšj JeeÙejme nw ________ ~
"erkeâ mes heefjYeeef<ele efkeâÙee ieÙee nw Deewj efkeâS peeves Jeeues (a) Creeper/›eâerhej (b) PARAM/hejce
keâeÙeeX keâes megmhe<š {bie mes efveefo&<š efkeâÙee ieÙee nw? (c) The famous/Hesâceme (d) HARLIE/nejueer
(a) finiteness/heefjefcelelee 61. Skeâ Ùegefšefuešer mee@HeäšJesÙej Øees«eece pees cesceesjer kesâ
(b) Effectiveness/ØeYeeJeMeeruelee DeveeJeMÙekeâ øewâiceWšdme keâes henÛeevelee nw Deewj ef[mkeâ mhesMe
(c) Input and Output/Fvehegš Deewj DeeGšhegš keâes hegveJÙe&JeefmLele keâjlee nw leeefkeâ DeehejsMeve F°lece {bie
(d) Definiteness/efveefMÛelelee mes nes mekesâ, keânueelee nw-
54. efvecveefueefKele ceW mes efkeâve [sše ØekeâejeW ceW oMeceueJe ceeve (a) yewkeâDehe (b) ef[mkeâ keäueerveDehe
meefcceefuele nw? (c) ef[mkeâ [erøewâiceWšj (d) ef[mkeâ jermšesj
(a) efoveeBkeâ (b) mebkesâlee#ej (kewâjskeäšj) (e) FveceW mes keâesF& veneR
(c) DemLeeÙeer (heäueesš) (d) hetCeeËkeâ 62. A database that contains tables linked by
55. Python's_____ special variable stores the name common field is called a :
of the currently running Python script or Skeâ DeeBkeâÌ[e mebÛeÙe ([eše yesme) efpemeceW meeceevÙe #es$e
module./heeFLeve keâe _____ mhesMeue yesefjSyeue Jele&ceeve
mes mebueive meejefCeÙeeB meefcceefuele neW, Gmes keâne peelee nw-
ceW Ûeue jner heeFLeve efm›eâhš Ùee cee@[Ùetue kesâ veece keâes
(a) Centralised database/kesâvõerke=âle DeeBkeâÌ[e mebÛeÙe
meb«enerle keâjlee nw~
(b) Flat file database/meheeš HeâeFue DeeBkeâÌ[e mebÛeÙe
(a) name____/ (b) ___module____/
(c) ___name___/ (d) ___name___/ (c) Relational database/mebyebefOele DeeBkeâÌ[e mebÛeÙe
56. A constructor is called whenever (d) Null databasw/MetvÙe (veue) DeeBkeâÌ[e mebÛeÙe
Skeâ constructor keâes keâe@ue (call) efkeâÙee peelee nw, 63. On computer start up, which program locates
peye keâYeer Yeer and load kernel into main memory for
(a) An object is created execution?
Skeâ Dee@ypeskeäš (object) yeveeÙee peelee nw kebâhÙetšj mšeš& Dehe, keâewve mee Øees«eece efve<heeove kesâ efueS
(b) A class is created keâvexue keâes cegKÙe cesceesjer ceW Keespelee nw Deewj uees[ keâjlee nw?
Skeâ keäueeme (class) yeveeÙee peelee nw~ (a) Bootstrap program/yetšmš^whe Øees«eece
(c) A class is declared (b) Start up program/mšeš& Dehe Øees«eece
Skeâ keäueeme (class) keâes declare efkeâÙee peelee nw (c) Boot-first program/yetš-heâmš& Øees«eece
(d) More than one of the above (d) Bootup program/yetšhe Øees«eece
GheÙeg&òeâ ceW mes Skeâ mes DeefOekeâ 64. A computer software that translates source code
57. Source code is available to view, modify and written in a high-level language into a set of
redistribute in-/œeesle keâes[ osKeves, mebMeesefOele keâjves machine language instructions is known as_____.
Deewj hegveefJe&leefjle keâjves kesâ efueS GheueyOe nw– Skeâ keâbhÙetšj mee@ÌHeäškesÙej pees GÛÛe-mlejerÙe Yee<ee ceW
(a) Open source (b) Licensed efueKes ieS œeesle keâes[ keâes ceMeerve Yee<ee efveo&sMeeW kesâ Skeâ
(c) Proprietary mesš ceW Devegkeeefole keâjlee nw, Gmes _____ kesâ ™he ceW
(d) More than one of the above/GheÙeg&keäle ceW mes Skeâ mes peevee peelee nw~
DeefOekeâ (a) compiler/keâcheeFuej
58. The process of writing out computer
(b) operating systems/Dee@hejsefšbie efmemšce
instructions is known as _______
keâchÙetšj efveoxMe efueKeves keâer Øeef›eâÙee keâes _______ keâne (c) firmware/heâce&JesÙej
peelee nw~ (d) device driver/ef[JeeFme [^eFJej

170 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
65. Which of the following is a real time operating 71. Jen mee@heäšJesÙej pees ØeÙeesòeâe kesâ peevekeâejer kesâ efyevee
system?/FveceW mes keâewve Skeâ efjÙeue šeF&ce-Deehejsefšbie Gmekeâer ieefleefJeefOeÙeeW keâes š^wkeâ keâjlee nw, keânueelee nw–
efmemšce nw? (a) JeeÙejme (b) mheeFJesÙej
(a) MS-Windows/MS-efJev[espe (c) ceeueJesÙej (d) Jeece&
(b) Linux/ueeFvekeäme 72. For real time operating systems, interrupt
(c) Unix/Ùetefvekeäme latency should be _______.
(d) DNX JeemleefJekeâ meceÙe Dee@hejseEšie efmemšce kesâ efueS, Fbšjhš
66. Which of the following system software is the uesšWmeer _________ nesveer ÛeeefnS~
operational software installed on the computer (a) Zero
motherboards that help the operating system to (b) Minimal
identify the Flash, ROM, EPROM, EEPROM, (c) Maximum
and memory chips?
(d) More than one of the above
efvecveefueefKele ceW mes keâewve mee efmemšce mee@heäšJesÙej 73. What is a page in paging?/hesepE eie ceW hespe keäÙee nw?
keâchÙetšj ceojyees[& hej mLeeefhele Dee@hejsMeveue mee@heäšJesÙej
(a) A fixed-size block of virtual memory/JeÛeg&Deue
nw pees DeehejseEšie efmemšce keâes heäuewMe ROM, EPROM,
cesceesjer keâe Skeâ efveeqMÛele Deekeâej keâe yuee@keâ
EEPROM Deewj cesceesjer efÛehme keâer henÛeeve keâjves ceW
(b) A fixed-size block of physical memory/Yeeweflekeâ
ceoo keâjlee nw?
cesceesjer keâe Skeâ efveeqMÛele Deekeâej keâe yuee@keâ
(a) Firmware/heâce&JesÙej
(c) A type of memory allocation/cesceesjer DeeJebšve keâe
(b) Device drivers/ef[JeeFme [^eFJej
Skeâ Øekeâej
(c) Programming language translators/Øees«eeefcebie
(d) More than one of the above/GheÙeg&òeâ ceW mes Skeâ mes
ueQiJespe š^evmeuesšj
DeefOekeâ
(d) Utility software/Ùetefšefueefš mee@heäšJesÙej
74. What is the distinctive feature of the FAT32
67. Linux (efuevekeäme) OS ceW efvecveefueefKele ceW mes keâewve-meer file system as compared to NTFS?
heâeFue, Fbšj-Øeesmesme mebÛeej Øeoeve keâjleer nw? NTFS keâer leguevee ceW FAT32 HeâeFue efmemšce keâer
(a) Socket/mee@kesâš efJeefMe° efJeMes<elee keäÙee nw?
(b) Link/efuebkeâ (a) Better compatibility with older systems/hegjeves
(c) Block/yuee@keâ efmemšce kesâ meeLe yesnlej Devegketâuelee (keâchesefšefyeefuešer)
(d) Directory/[eFjskeäšjer (b) Built-in compression capability/Debleefve&efnle
68. Which process checks to ensure that the
components of the computer are operating and
kebâØesMeve kesâheseyf eefuešer (mebheer[ve #ecelee)
connected properly ? (c) Higher secuirty features/DeefOekeâ megj#eelcekeâ iegCe
mebieCekeâ kesâ Ieškeâ "erkeâ lejn mes pegÌ[ ieÙes nw Deewj (d) Larger file size support/yeÌ[s HeâeFue Deekeâej keâe
ØeÛeefuele nes ieÙes nw, Ùes keâewve meer Øeef›eâÙee hejer#eCe meceLe&ve
megefveefMÛele keâjleer nw? 75. An image is composed of/Skeâ Fcespe yeveer nesleer nw–
(a) Booting /yetefšbie (b) Processing /Øeesmesefmebie (a) Pels/hesume mes (b) Pexels/efhekeämesue mes
(c) Saving /yeÛele (d) Editing /mebheeove (c) Dots/[e@šdme mes (d) All of these/Ùes meYeer
69. Grouping and processing all the firm’s 76. The device that converts a physical image into
transactions at one time, is called : a digital one is called:/Jen keâewve-mee GhekeâjCe nw pees
Skeâ ner meceÙe ceW keâcheveer kesâ meYeer uesve-osveeW keâes
mecetnerke=âle SJeb mebmeeefOele keâjvee keânueelee nw: Skeâ Yeeweflekeâ ÚefJe keâes ef[efpešue cebs yeoue oslee nw?
(a) a database management system (a) Scanner/mkewâvej
[ešeyesme cesvespeceWš efmemšce (b) Image Converter/ÚefJe heefjJeòe&keâ
(b) batch processing/yewÛe Øeesmesefmebie (c) Printer/efhebÇšj
(c) a real time system/efjÙeue šeFce efmemšce (d) Recorder/efjkeâe@[&j
(d) on-time system/Dee@ve-šeFce efmemšce 77. Skeâerke=âle heefjheLe kesâ mebyebOe ceW, VLSI keâe hetCe& ¤he keäÙee nw?
70. kebâhÙetšj efmemšce keâes Ûeeuet keâjves kesâ yeeo Gmes Ûeeuet (a) Jesjer[ ueepe& mkesâue Fbšer«esMeve (Varied Large Scale
jKeves kesâ efueS ceeF›eâesØeesmesmej Éeje efvecveefueefKele ceW mes Integration)
efkeâmekeâe GheÙeesie efkeâÙee peelee nw? (b) Jesjer ueepe& mkesâue Fbšer«esMeve (Very Large-Scale
(a) SbšerJeeÙejme Integration)
(b) SefhuekesâMeve mee@heäšJesÙej (c) Jesjer[ ueepe& mkesâue FbšsjesiesMeve (Varied Large-Scale
Interrogation)
(c) ef[JeeFme [^eFJej
(d) Jesjer ueepe& mkesâue FbšjHesâme (Very Large-Scale
(d) BIOS
Interface)
171 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
78. Who began developing the first mechanical (a) clock speed/keäuee@keâ mheer[
computer in 1822? (b) execution speed/SefipekeäÙetMeve mheer[
1822 ceW henuee cewkesâefvekeâue keâchÙetšj efkeâmeves efJekeâefmele (c) spin rate/efmheve jsš
keâjvee Meg™ efkeâÙee Lee? (d) latency speed/uesšWmeer mheer[
(a) Charles Babbage 85. Which of the following statements about
(b) Ada Lovelace information kiosks is/are FALSE?
(c) Herman Hollerith metÛevee efkeâÙeesmkeâ (information kiosks) kesâ mebyebOe ceW
(d) Joseph Marie Jacquard
79. Tabulating machine was the first
efvecveefueefKele ceW mes keâewve-mes keâLeve ieuele nQ?
electromechanical machine developed by: (i) An information kiosks is a computer-like
ØeLece efJeÅegleerÙe meejCeerÙeb$e (leeefuekeâe yeæ Ùeb$e) keâes device designed to provide certain
information to people in public places.
efkeâmeves efJekeâefmele efkeâÙee~ metÛevee efkeâÙeesmkeâ, Skeâ kebâhÙetšj pewmee GhekeâjCe neslee nw,
(a) Herman Hollerith/njceve nesuesjerLe efpemes meeJe&peefvekeâ mLeeveeW hej ueesieeW keâes kegâÚ efveef§ele
(b) Howard Aiken/ne@Je[& Skesâve peevekeâejer Øeoeve keâjves nsleg ef[]peeFve efkeâÙee ieÙee nw~
(c) Blaise pascal/yuesme heemekeâue (ii) Non-interactive kiosks are passive systems
(d) John Napier/peeve vesehf eÙej typically used for advertising in digital
80. An electronic path that connects one part of a signage systems./iewj-FbšjwefkeäšJe (Non-
computer to another is: interactive) efkeâÙeesmkeâ efveef<›eâÙe efmemšce nesles nQ,
Skeâ Fueskeäš^e@evf ekeâ jemlee pees mebieCekeâ kesâ Skeâ Yeeie keâes efpevekeâe GheÙeesie meceevÙele: ef[efpešue meeFvespe
otmejs Yeeie mes peesÌ[lee nw, keânueelee nw: ØeCeeefueÙeeW ceW efJe%eeheve kesâ efueS efkeâÙee peelee nw~
(a) Logic Gate/ueeefpekeâ iesš (a) Only (ii)/kesâJeue (ii)
(b) Serial Port/meerefjÙeue heesš& (b) Both (i) and (ii)/(i) Deewj (ii) oesveeW
(c) Modem/cee@[ce (c) Only (i)/kesâJeue (i)
(d) Bus/yeme (d) Neither (i) nor (ii)/ve lees (i) Deewj ve ner (ii)
81. The read/write line belongs to: 86. Which of the following digital computers was
jer[ (heÌ{es)/jeFš (efueKees) ueeFve efkeâmemes mebyebefOele nw? invented by Howard Aiken?
(a) the data bus/[sše yeme efvecveefueefKele ceW mes efkeâme ef[efpešue kebâhÙetšj keâe DeeefJe<keâej
(b) the control bus/kebâš^esue yeme ne@Je[& Sskesâve (Howard Aiken) ves efkeâÙee Lee?
(c) the address bus/S[^sme yeme (a) ENIAC/SefveSskeâ
(d) CPU bus/meer.heer.Ùeg. yeme (b) Harvard Mark I/neJe&[& ceeke&â I
82. MFLOPS keäÙee nw? (c) Pascaline/heemkeâueeFve
(a) Fmekeâe GheÙeesie CPU keâer efmLeefle keâes ceeheves kesâ efueS (d) Stepped Beckoner/mšsh[ jskeâvej
efkeâÙee peelee nw~ 87. Breaking logical memory into blocks of the
(b) Fmekeâe GheÙeesie CPU keâer ieefle keâes ceeheves kesâ efueS efkeâÙee same size is called :
peelee nw~ leeefke&âkeâ mcejCeMeefòeâ’ meeceeve Deekeâej kesâ Keb[ ceW
(c) Ùen Skeâ mce=efle FkeâeF& (cesceesjer Ùetefveš) nw~
efJeYeeefpele keâjves keâes keäÙee keâne peelee nQ?
(a) Frames /øesâce
(d) Fmekeâe GheÙeesie mce=efle hengBÛe meceÙe (cesceesjer Skeämesme šeFce)
(b) Segments /mesiceWš
keâes ceeheves kesâ efueS efkeâÙee peelee nw~
(c) Packets /hewkesâšdme
83. The register that contains the address of the
next instruction to be executed is called (d) Pages /he=‰
Jen jefpemšj, efpemeceW Deieuee Fvmeš^keäMeve pees SefkeäpekeäÙetš 88. Tera means
Tera keâe DeLe&/celeueye neslee nw
nesves Jeeuee neslee nw Gmekeâe Ss[^sme neslee nw, keânueelee nw
(a) 220
(a) program counter/Øees«eece keâeGvšj (b) 240
(b) instruction register/Fvmeš^keäMeve jefpemšj (c) 230
(c) accumulator/SkeäÙetceguesšj (d) More than one of the above/GheÙeg&òeâ ceW mes Skeâ mes
(d) More than one of the above/GheÙeg&òeâ ceW mes Skeâ mes DeefOekeâ
DeefOekeâ 89. Which of the following memories has the
84. The speed at which an instruction is executed is shortest access time?/efvecve ceW mes keâewve-meer cesceesjer keâe
related directly to a computer's built-in______. meyemes keâce Skeämesme meceÙe nw?
efpeme ieefle mes keâesF& efveoxMe efve<heeefole efkeâÙee peelee nw Jen (a) Cache Memory/kewâMe cesceesjer
meerOes kebâhÙetšj kesâ Debleefve&efnle _____ mes mebyebefOele nesleer nw~ (b) Magnetic Bubble Memory/cewivesefškeâ yeyeue cesceesjer
172 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
 (c) Magnetic Core Memory/cewivesefškeâ keâesj cesceesjer (d) More than one of the above/GheÙeg&keäle ceW mes Skeâ mes
(d) Random Access Memory/jwv[ce Skeämesme cesceesjer DeefOekeâ
90. efvecve ceW mes keâewve mee yuee@keâ ef[JeeFme veneR nw? 96. The Boolean expression x + xy will be equal to
(a) CD ROM (b) RAM yetefueÙeve SkeämeØesMeve x + xy kesâ yejeyej nesiee
(c) Heäuee@heer ef[mkeâ (d) ne[& ef[mkeâ (a) x
(b) y
91. Ùeefo Deehe DeefOekeâ jwce mLeeefhele keâjles nQ, lees ceeF›eâesmee@heäš (c) x+y
efJeb[espe- DeeOeeefjle kebâhÙetšj hej keäÙee Demej nesiee? (d) More than one of the above/GheÙeg&òeâ ceW mes Skeâ mes
(a) Ùen Oeerceer ieefle mes keâece keâjsiee DeefOekeâ
(b) Ùen lespe ieefle mes keâece keâjsiee 97. According to Demorgan's theorem:
(c) Ùen henues pewmee ner keâece keâjsiee [ercee@ie&ve efLeÙeesjce kesâ Devegmeej–
(d) Ùen keâece keâjvee yebo keâj osiee~ (a) A NAND gate is equivalent to negative AND
92. SDRAM ceW 'S' De#ej keâe hetCe& ™he keäÙee nw? gate/Skeâ NAND iesš, vesieefšJe- AND (efJehejerle
AND) iesš kesâ meceeve neslee nw~
(a) Synchronous/efmeb›eâesveme
(b) A NAND gate is equivalent to negative OR
(b) Simple/efmebheue gate./Skeâ NAND iesš, vesieefšJe- OR (efJehejerle
(c) Static/mšsefškeâ OR) iesš kesâ meceeve neslee nw~
(d) Service/meefJe&me (c) A NAND gate is equivalent to NOR gate.
93. Which of the following is the type of Read Only Skeâ NAND iesš, NOR iesš kesâ meceeve neslee nw~
Memory (ROM)?/efvecveefueefKele ceW mes keâewve-mee jer[ (d) A NAND gate is equivalent to negative OR
Deesveueer cesceesjer (ROM) keâe Øekeâej nw? gate./Skeâ NAND iesš, vesieefšJe- OR (efJehejerle
(a) PROM OR) iesš kesâ meceeve neslee nw~
(b) EPROM 98. The NOR gate output will be high if the both
(c) MROM inputs are
(d) More than one of the above/GheÙeg&òeâ ceW mes Skeâ mes Ùeefo oesveeW Fvehegš ______ lees NOR iesš DeeGšhegš
DeefOekeâ (high) nesiee
94. What should be looked at first to find (a) 00 (b) 01
simplified Boolean expression from a (c) 10 (d) 11
Karnaugh map ? 99. In a half-adder circuit, what are the
Skeâ keâejveewHeâ cewhe mes mejueerke=âle JetefueÙeve JÙebpekeâ keâes outputs?/DeOe&-Ùeespekeâ mee|keâš ceW DeeGšhegš keäÙee nw?
Keespeves kesâ efueS meyemes henues keäÙee osKee peevee ÛeeefnS? (a) Sum and Carry
(b) Difference and Borrow
(a) Quads/keäJee[dme (b) Singles/efmebieume
(c) Sum and Difference
(c) Pairs/hesÙeme& (d) Octets/Deeskeäšsšdme
(d) More than one of the above/GheÙeg&òeâ ceW mes Skeâ mes
95. The simplified form of the Boolean expression
(X + Y + XY) (X + Z) is: DeefOekeâ
yetefueÙeve DeefYeJÙeefkeäle (X + Y + XY) (X + Z) keâe 100. The hexadecimal representation of (407)8 is….
mejueerke=âle ¤he nw– (407)8 keâe nskeämee[sefmeceue ceW JeCe&ve nw–
(a) XY + YZ (b) X + YZ (a) (107)16 (b) (701)16
(c) XZ + Y (c) (017) 16 (d) (710)16

SOLUTION : PRACTICE SET- 5

ANSWER KEY
1. (c) 11. (b) 21. (a) 31. (b) 41. (c) 51. (c) 61. (c) 71. (b) 81. (b) 91. (b)
2. (c) 12. (c) 22. (d) 32. (c) 42. (a) 52. (a) 62. (c) 72. (b) 82. (b) 92. (a)
3. (d) 13. (d) 23. (b) 33. (c) 43. (c) 53. (d) 63. (a) 73. (a) 83. (a) 93. (d)
4. (c) 14. (d) 24. (d) 34. (c) 44. (a) 54. (c) 64. (a) 74. (a) 84. (a) 94. (d)
5. (c) 15. (d) 25. (b) 35. (a) 45. (c) 55. (c) 65. (d) 75. (d) 85. (d) 95. (b)
6. (d) 16. (a) 26. (c) 36. (b) 46. (c) 56. (a) 66. (a) 76. (a) 86. (b) 96. (a)
7. (a) 17. (d) 27. (c) 37. (a) 47. (c) 57. (a) 67. (a) 77. (b) 87. (d) 97. (b)
8. (d) 18. (d) 28. (d) 38. (c) 48. (d) 58. (b) 68. (a) 78. (a) 88. (b) 98. (a)
9. (a) 19. (d) 29. (c) 39. (c) 49. (d) 59. (d) 69. (b) 79. (a) 89. (a) 99. (a)
10. (b) 20. (d) 30. (c) 40. (b) 50. (c) 60. (a) 70. (d) 80. (d) 90. (b) 100. (a)
173 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
 SOLUTION
1. (c) 9. (a)
AI ceW, ‘‘¢etefjefmškeâ’’ Skeâ Meyo nw efpemekeâe GheÙeesie efveCe&Ùe Ùee Deej.SHeâ.DeeF&.[er. (RFID) keâe hetje veece jsef[Ùees HeÇâerkeäJeWmeer
meeceevÙe %eeve Yeeie keâe GheÙeesie keâjkesâ mecemÙee keâes nue keâjves kesâ DeeF[WefšefHeâkesâMeve nw~ Ùen Skeâ lekeâveerkeâ nw pees JemlegDeeW, GhekeâjCeeW Ùee
efueS Deeceleewj hej efkeâÙee peelee nw~ JÙeefòeâÙeeW keâer henÛeeve Deewj š^wefkebâie kesâ efueS jsef[ÙeeW lejbieeW keâe GheÙeesie
2. (c) keâjleer nw, Fmes Fbšjvesš Dee@Heâ efLebime (IoT) ceW efJeefYeVe GhekeâjCeeW Deewj
LeÇs[ keâes meer.heer.Ùet. Éeje efveÙebef$ele efkeâÙee peelee nw~ JeÛeg&Deue S[^sme mhesme JemlegDeeW keâes peesÌ[ves Deewj [sše š^ebmeHeâj keâjves kesâ efueS JÙeehekeâ ™he mes
(Ùen JeÛeg&Deue cesceesjer S[^sme keâe Skeâ mesš nw efpemes Skeâ Øeef›eâÙee GheÙeesie efkeâÙee peelee nw~
GheÙeesie keâj mekeâleer nw) cesceesjer cewvespeceWš mes pegÌ[e nw~ 10. (b)
heâeFue efmemšce keâe GheÙeesie ef[mkeâ ØeyebOeve kesâ efueS efkeâÙee peelee nw~ <!-- --> keâceWš šwie keâe GheÙeesie meesme& keâes[ ceW keâceWš [eueves
Fbšjhš Skeâ Øekeâej keâe mebkesâle nw~ kes â ef ueS ef k eâÙee peelee nw~ keâceWš yeÇeGpej ceW ef[mhues veneR neslee nw, Deehe
3. (d) Deheves keâes [ keâes mecePeves kesâ efueS keâceWš keâe GheÙeesie keâj mekeâles nw,
hesâmeyegkeâ ceW Dee@šes-šwefiebie heâerÛej Skeâ Deeefš&efheâefMeÙeue FbšsefuepeWme (A1) pees yeeo ceW meesme& keâes[ keâes Sef[š keâjles meceÙe meneÙelee keâj mekeâlee nw
keâe SefhuekesâMeve nw~ FmeceW mJeÛeeefuele ™he mes Ûesnjs keâer henÛeeve keâjkesâ 11. (b)
šwie keâjves keâe ØemleeJe oslee nw~ cee@efheËâie (Morphing) Skeâ SveercesMeve hebâkeäMeve nw efpemekeâe GheÙeesie
4. (c) efkeâmeer Yeer Øekeâej kesâ Dee@ypeskeäš kesâ Deekeâej keâes Skeâ ™he mes otmejs ™he
keäueeG[ keâchÙetefšbie Skeâ lekeâveerkeâer ØeesÅeesefiekeâer nw efpemeceW Fbšjvesš kesâ ceW yeoueves kesâ efueS efkeâÙee peelee nw~
ceeOÙece mes efJeefYeVe mebmeeOeveeW pewmes efkeâ mšesjspe, meJe&j, vesšJeke&â, 12. (c)
[sšeyesme, mee@heäšJesÙej Deewj keâchÙetefšbie heeJej keâe GheÙeesie efkeâÙee peelee mšesjeryees[& Skeâ ef[peeFve štue nw efpemekeâe GheÙeesie ceušerceeref[Ùee Øemlegefle
nw~ Fmekeâe cegKÙe GösMÙe Ùetpeme& keâes Fve mebmeeOeveeW keâe Fmlesceeue keâjves kesâ FefÛÚle mece«e leke&â, ØeJeen Deewj mebjÛevee keâes efjkeâe@[& keâjves kesâ efueS
kesâ efueS JÙeefòeâiele ef[JeeFmeeW mes keâveskeäš keâjvee nw Deewj mesJeeS Øeoeve efkeâÙee peelee nw~
keâjvee nw~ 13. (d)
5. (c) F&-iekeveXme, keâe DeLe& nw 'Fueskeäš^e@efvekeâ iekeveXme'~ Ùen metÛevee Deewj mebÛeej
efyeie [sše, [sše kesâ yesno yeÌ[s Deewj peefšue mesš keâes meboefYe&le keâjlee nw ØeewÅeesefieefkeâÙeeW (pewmes keeF[ SefjÙee vesškeke&â, Fbšjvesš Deewj ceesyeeFue
efpevnW heejbheefjkeâ [sše ØeyebOeve Deewj efJeMues<eCe štue keâe GheÙeesie keâjkesâ keâbhÙetefšbie) keâe GheÙeesie keâjlee nw~
mebmeeefOele keâjvee Deewj efJeMues<eCe keâjvee cegefMkeâue neslee nw~ efyeie [sše Fmekeâe cetue GösMÙe je<š^erÙe, jepÙe Deewj mLeeveerÙe mlej pewmes efkeefYeVe
mebjefÛele Deewj DemebjefÛele [sše oesveeW kesâ meeLe keâeÙe& (deal) keâj mekeâlee mlejeW hej meYeer, Ùeeveer mejkeâej, veeieefjkeâeW, kÙekemeeÙeeW Deeefo kesâ efueS
nw~ Fmekesâ leerve V heefjYeeef<ele iegCe nw (Volume, Velocity, Øeef›eâÙeeDeeW keâes mejue yeveevee nw~
Variety). F&-iekeveXme DeefvekeeÙe& ™he mes Ûeej Øekeâej kesâ nesles nQ - G2C
6. (d) (Government to Citizens), G2B (Government to
IoT meWmej Jes GhekeâjCe nesles nQ pees Yeeweflekeâ heefjJesMe mes [sše Skeâef$ele Business) G2E (Government to Employees), G2G
keâjles nQ Deewj Gmes Fbšjvesš kesâ ceeOÙece mes meePee keâjles nw~ Ùes meWmej (Government to Government) pees F&-iekeveXme kesâ kÙeehekeâ oeÙejs
efJeefYeVe Øekeâej kesâ nes mekeâles nw pewmes– Fvøeâejs[, Skeämesuesjesceeršj, ceW ef[efpešue FbšjwkeäMeve Deewj meskeeDeeW kesâ efkeefYeVe DeeÙeeceeW keâe
Øeesefkeämeefcešer FlÙeeefo~ šeJesue, IoT meWmej keâe Øekeâej veneR nw~ ØeefleefveefOelke keâjles nQ~
7. (a) 14. (d)
Fbšjvesš Dee@heâ efLebime (IoT) Gve Yeeweflekeâ kemlegDeeW kesâ vesškeke&â keâe G2C (Government to Citizen) F&-ieJeveXme mesJeeSB Jes nesleer nw,
keCe&ve keâjlee nw efpevnW efLebime keâne peelee nw pees Fbšjvesš hej DevÙe pees mejkeâej veeieefjkeâeW keâes meerOes Øeoeve keâjleer nw~ Dee@veueeFve šwkeäme
GhekeâjCeeW Deewj ØeCeeefueÙeeW kesâ meeLe [sše keâes peesÌ[ves Deewj Deeoeve-Øeoeve HeâeFefuebie Skeâ G2C mesJee keâe GoenjCe nw, keäÙeeWefkeâ Ùen mejkeâej Éeje
keâjves kesâ GösMÙe mes meWmej, mee@heäškesÙej Deewj DevÙe ØeewÅeesefieefkeâÙeeW kesâ veeieefjkeâeW keâes oer peeves megefJeOee nw, efpememes Jes Dee@veueeFve keâj (šwkeäme)
meeLe Scyes[s[ nesles nQ~ oeefKeue keâj mekeâles nQ~
8. (d) 15. (d)
k-Means Skeâ Deehemeer mecetn ceW [sše keâes Jeieeake=âle keâjves kesâ efueS peye Deehe ietieue meÛe& Fbpeve ceW keâesF& efJeefMe° Meyo Deewj Gmekeâe heÙee&ÙeJeeÛeer
Skeâ ceMeerve ueefveËie DeuieesefjLce nw, efpemeceW [sše keâes kegâÚ mecetneW ceW Keespevee Ûeenles nQ, lees Deehe ' ' efšu[ (Tilde) Dee@hejsšj keâe GheÙeesie keâj
efJeYeeefpele efkeâÙee peelee nw~ Ùen Skeâ Unsupervised DeuieesefjLce neslee mekeâles nQ~ Ùen Dee@hejsšj Deehekesâ efoS ieS Meyo kesâ heÙee&ÙeJeeÛeer Ùee efceueles-
nw, efpemeceW nceW hetJee&vegceeefvele JeieeakeâjCe keâer DeeJeMÙekeâlee vener nesleer nw~ pegueles MeyoeW keâer Keespe keâjves ceW ceoo keâjlee nw~
Ùen [sše hee@Fšdme keâer efJeefMe° iegCeJeòee ceeheeW keâe GheÙeesie keâjkesâ GvnW 16. (a)
kegâÚ mecetneW ceW efJeYeeefpele keâjlee nw, efpemeceW ØelÙeskeâ mecetn keâe Skeâ yeme šesheeruee@peer, Skeâ ner keâveskeäMeve keâe ØeÙeesie meYeer ef[JeeFmesme keâes
kesâõerÙe efyevog neslee nw~ Skeâ meeLe peesÌ[ves kesâ efueS keâjlee nw~
174 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
17. (d) 25. (b)
OSI cee@[ue ceW [sše hewkesâpe keâes jeGefšbie keâjves Deewj Heâe@Je&ef[bie kesâ efueS JeeF&-heâeF& ne@šmhee@š (WIFI hotspots) Skeâ efheâefpekeâue ueeskesâMeve neslee
vesšJeke&â uesÙej efpeccesoej nesleer nw~ Ùen uesÙej [sše hewkesâpe keâes Skeâ nw efpemekesâ ceeOÙece mes Fbšjvesš keâes Skeämesme efkeâÙee peelee nw pewmes ceesyeeFue,
vesšJeke&â mes otmejs vesšJeke&â ceW Yespeves kesâ efueS ™efšbie Deewj Heâe@Je&ef[bie keâe uewheše@he leLee DevÙe ef[JeeFme ceW Fbšjvesš keâes keâveskeäš keâjkesâ Gmekeâe
keâece keâjleer nw~ GheÙeesie keâj mekeâles nQ~ Ùen jse[f Ùees lejbieeW kesâ ceeOÙece mes Yeer JeeÙejuesme
18. (d) lejerkesâ mes [sše keâe Deeoeve-Øeoeve keâjves ceW me#ece yeveeleer nQ~
Skeâ ef[efpešue mebÛeej Ûewveue hej peevekeâejer kesâ efueS mebÛejCe keâer ieefle keâer 26. (c)
Skeâ FkeâeF&, Deeceleewj hej Øeefle meskesâb[ Øesef<ele peevekeâejer kesâ efyešdme keâer LTE (ueebie šce& FJeesuÙetMeve) ÙetefveJeme&ue ceesyeeFue šsueerkeâcÙegefvekesâMeve
mebKÙee kesâ yejeyej nesleer nw Gmes yee@[ keânles nw yee@[ ces ieefle Øeefle meskeWâ[ efmemšce (UMTS) kesâ efueS efJekeâefmele efkeâÙee ieÙee nw~ LTE 20
efmeiveefuebie IešveeDeeW keâer mebKÙee Fbefiele keâjleer nw~ MHz yeQ[efJe[dLe hej 300 Mbit/s keâer [eGvemš^erce heerkeâ oj Deewj
19. (d) 50 Mbit/s keâer Dehemš^erce heerkeâ oj Øeoeve keâjlee nw~ LTE lekeâveerkeâ
šermeerheer/DeeF&heer vesšJeefkebâie ceW meyevesš ceemkeâ keâe cegKÙe GösMÙe Skeâ keâe GheÙeesie 4G JeeÙejuesme ØeewÅeesefieefkeâÙeeW keâer heerÌ{er ceW efkeâÙee peelee nw~
vesšJeke&â keâes Úesšs-Úesšs Ghe vesšJeke&â ces efJeYeeefpele keâjvee nw~ Ùen 27. (c)
vesšJeke&â keâes ØeYeeJeer {bie mes ØeyeefvOele Deewj megjef#ele yeveeves ceW ceoo ef›eâSš keâceeb[ Skeâ [sše [sefheâefveMeve ueQiJespe keâceeb[ nw Ùen [sše
keâjlee nw~ cewefveheguesMeve keâceeb[ veneR nw~ [sše cewefveheguesMeve keâceeb[ keâe GheÙeesie Gve
20. (d) šyeueeW kesâ [sše ceW nsjhesâj keâjves kesâ efueS efkeâÙee peelee nw pees [sše
TCP/IP keâe hetCe& ™he š^ebmeefceMeve kebâš^esue Øeesšeskeâe@ue/Fbšjvesš [sefheâefveMeve ueQiJespeeW Éeje yeveeF& ieF& nQ~
Øeesšeskeâe@ue nw~ Ùen efveÙeceeW Deewj Øeef›eâÙeeDeeW keâe mecetn nw pees Fbšjvesš 28. (d)
efkeâme Øekeâej keâeÙe& keâjlee nw, Ùen efveCe&Ùe keâjlee nw~ neFhejšskeämš ceeF›eâesmee@heäš Skeämesme [sšeyesme ceW Jeke&âMeerš Deeypeskeäš keâes Fbefiele veneR
š^ebmeheâj Øeesšeskeâe@ue (HTTP) Skeâ ShueerkesâMeve uesÙej mšsšuesme keâjlee nw~
Øeesšeskeâe@ue nw efpemekeâe ØeÙeesie heâeFue š^ebmeheâj ceW neslee nw~ efmebheue cesue 29. (c)
š^evmeheâj Øeesšeskeâe@ue (SMTP) keâe ØeÙeesie F&-cesue Yespeves Deewj Øeehle Data Base Management System ([eryeerSceSme) Skeâ keâchÙetšj
keâjves ceW neslee nw~ efmebheue vesšJeke&â cewvespeceWš Øeesšeskeâe@ue (SNMP) mee@heäšJesÙej SefhuekesâMeve nw, pees GheÙeesiekeâlee& kesâ meeLe mecheke&â keâjlee nw,
vesšJeke&â cewvespeceWš kesâ efueS Skeâ ueeskeâefØeÙe Øeesšeskeâe@ue nw~
pewmes– Dee@jskeâue, meeFyesme, SQL meJe&j peyeefkeâ keâesyeesue Skeâ Øees«eeeEceie
21. (a)
Yee<ee nw~
efš^efJeDeue heâeFue š^ebmeheâj Øeesšeskeâe@ue (šerSheâšerheer) oes šermeerheer/DeeF&heer
30. (c)
ceMeerveeW kesâ yeerÛe heâeFueeW kesâ Deeoeve-Øeoeve kesâ efueS Skeâ mejue
'Single-user Access only' DBMS keâer efJeMes<elee veneR nw~
Øeesšeskeâe@ue nw~ TFTP meJe&j heâeFue Yespeves Deewj Øeehle keâjves kesâ efueS
DBMS keâF& Ùetpeme& keâes Skeâ meeLe [sšeyesme lekeâ hengBÛeves Deewj GmeceW
TFTP keäueeFbš mes keâveskeäMeve keâer Devegceefle osles nQ~
nsjHesâj keâjves keâer Devegceefle oslee nw~ Ùen Skeâ meeLe hengBÛe keâes mebYeeueves
TFTP - Trivial File Transfer Protocol
TCP/IP - Transmission Control Protocol/Internet Deewj keâF& Ùetpeme& kesâ yeerÛe [sše keâer kebâefmemšWmeer Deewj Fbšeref«ešer
Protocol megefveefMÛele keâjves kesâ efueS leb$e Øeoeve keâjlee nw~
22. (d) 31. (b)
kewâefjÙej meWme ceušerheue Skeämesme (CSMA) Skeâ efJeefOe nw efpemes oes Ùee [sšeyesme ceW efkeâmeer šsyeue kesâ njskeâ keâe@uece kesâ JewuÙet kesâ [sše šeFhe keâes
oes mes DeefOekeâ mšsMeveeW Éeje [sše efuebkeâ uesÙej hej Deheves efmeiveue [escesve keâne peelee nw~ [escesve Skeâ [sše kesâ mebYeeefJele ceeveeW keâe mesš
Yespeves Meg™ keâjves hej škeâjeJe keâer mebYeeJevee keâes keâce keâjves kesâ efueS neslee nw, pees efkeâmeer Skeâ efJeefMe° [sše šeFhe kesâ efueS efmLej neslee nw~
efJekeâefmele efkeâÙee ieÙee Lee~ Fmes Gve meYeer ceeveeW keâe mesš keâne peelee nw~
23. (b) 32. (c)
uewve (LAN) keâes Fvšjvesš mes peesÌ[ves keâe GhekeâjCe jeGšj neslee nw SQL ceW constraint Skeâ Øekeâej keâer efJeMes<e efveÙece nesleer nw pees
pees efJeefYeVe kebâhÙetšj vesšJekeâex kesâ yeerÛe [sše hewkesâšdme keâes Yespeves Deewj [sšeyesme ceW [sše keâer JewOelee Deewj megj#ee keâes megefveef§ele keâjves ceW ceoo
Øeehle keâjves kesâ efueS GheÙeesie efkeâÙee peelee nw~ Fmekeâe cegKÙe keâece [sše keâjleer nw~ Ùen [sšeyesme šsyeue ceW [sše kesâ Fvmeš& Deewj Dehe[sš keâjves
keâes Skeâ vesšJeke&â mes otmejs vesšJeke&â ceW mener jemles (LAN Ùee WAN) kesâ efveÙeceeW keâes heefjYeeef<ele keâjleer nw, pewmes efkeâ efkeâmeer keâe@uece keâer JewuÙet
mes hengbÛeevee neslee nw~ Ùetefvekeâ nesveer ÛeeefnS, efkeâmeer keâe@uece keâer JewuÙet Not null nesveer
24. (d) ÛeeefnS, Ùee efkeâmeer keâe@uece keâer JewuÙet efoS ieS MeleeX kesâ Devegmeej nesveer
mkesâuesefyeefuešer keâe celeueye nw efkeâ keâesF& efmemšce, vesšJeke&â, Ùee Øeef›eâÙee ÛeeefnS~ Dele: Union, SQL ceW constraint veneR neslee nw~
yeÌ{leer ngF& cee$ee kesâ meeLe keâece keâjves Ùee efJekeâeme keâes mebYeeueves ceW me#ece 33. (c)
nes~ Ùeefo efkeâmeer vesšJeke&â ceW GheÙeesiekeâlee&DeeW keâes Deemeeveer mes peesÌ[e pee meerkeäJeWefMeÙeue DBMS Skeâ ceevÙelee Øeehle DBMS Øekeâej veneR nw~
mekeâlee nw, efyevee ØeoMe&ve ceW efiejeJeš Ùee hetjs ef[peeFve keâes yeoueves keâer DBMS kesâ meeceevÙe Øekeâej, efjuesMeveue, Dee@ypeskeäš DeesefjSbšs[ Deewj
DeeJeMÙekeâlee kesâ, lees Gmes mkesâuesyeue ceevee peelee nw~ DevÙe pewmes keâer neFefyeÇ[ DBMS nesles nw~
175 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
34. (c) vegkeâmeeve nes mekeâlee nw~ keäÙeeWefkeâ [sše KeesÙee veneR pee mekeâlee nw, mebkeâueve
Ùen DeefOeke=âle GheÙeesiekeâlee&DeeW kesâ [sše keâes Dehe[sš keâjves, meb«enerle mhe° ™heeblejCe efJeefOe Ùee keâeefmšbie Dee@hejsšj kesâ GheÙeesie keâer DeeJeMÙekeâlee kesâ
keâjves, nsjHesâj keâjves Ùee Skeämesme keâjves keâer Devegceefle oslee nw~ ÛetBefkeâ efyevee, ™heeblejCe keâes mhe° ™he mes Ùee heejoMeea ™he mes mebYeeue mekeâles nQ~
[sše keâes leeefuekeâe Øee¤he ceW meb«enerle efkeâÙee peelee nw, FmeefueS [sše veesš- neueeBefkeâ keâes[ pees Skeâ Debleefve&efnle ™heeblejCe keâjlee nw pees Skeâ
lekeâ hengBÛevee Deewj DeeJeMÙekeâ keâeÙe& keâjvee Deemeeve neslee nw~ ™heeblejCe efJeefOe keâes keâe@ue keâj mekeâlee nw Ùee Skeâ keâeefmšbie Dee@hejsšj keâe
35. (a) GheÙeesie keâj mekeâlee nw~ Gvekesâ GheÙeesie keâer DeeJeMÙekeâlee Gve kebâheeFuejeW Éeje
mener heefjCeece Øeehle keâjves kesâ efueS MySQL keäJesjer nesieer~ veneR nesleer nw pees efveefnle ™heeblejCeeW keâe meceLe&ve keâjles nQ~
select name from student where name like 'A––––'; 43. (c)
Ùen keäJesjer šsyeue mšt[Wš mes meYeer veeceeW keâe ÛeÙeve keâjleer nw peneB veece Close() HebâkeäMeve keâe GheÙeesie heeFLeve ceW HeâeFue keâes yebo keâjves kesâ
De#ej 'A' mes Meg® neslee nw Deewj šsyeue ceW "erkeâ heeBÛe De#ej nesles nw~ efueS efkeâÙee peelee nw~
LIKE keäuee@pe ceW Deb[jmkeâesj kewâjskeäšj () Skeâ efmebieue JeeFu[ Deewj 44. (a)
kewâjskeäšj keâes oMee&lee nw FmeefueS mes Meg® nesves Jeeues efkeâmeer Yeer HeâeFve peeJeeefm›eâhš Skeâ yengcegKeer Øees«eeefcebie Yee<ee nw efpemekeâe GheÙeesie Deeceleewj
kewâjskeäšj efmš^bie mes cesue Keelee nw~ hej Jesye [sJeueheceWš ceW efkeâÙee peelee nw~ Ùen JesyemeeFšeW ceW Fvš^wkeäšerefJešer
36. (b) Deewj [eÙeveefcekeâ JÙeJenej peesÌ[ves keâer Devegceefle oslee nw~ peeJeeefm›eâhš ceW
heue& Skeâ efm›eâefhšbie ueQiJespe nw~ Fmekeâe henuee mebmkeâjCe 1987 ceW Ssjs keâe GheÙeesie efkeâÙee pee mekeâlee nw~ efJeb[es Dee@ypeskeäš keäueeFbš-meeF[
Øees«eecej uewjer Jee@ue Éeje yeveeÙee ieÙee Lee~ heue& ceW keâF& ueeskeâefØeÙe peeJeeefm›eâhš keâe cegKÙe ØeJesMe efyevog nw~ Skeâ keäueeFbš meeF[
Ùetefvekeäme megefJeOeeSB Meeefceue nQ~ heemkeâue Skeâ DeefveJeeÙe& Deewj peeJeeefm›eâhš keâes[ keâes HTML [ekeäÙetceWš ceW Scyes[ efkeâÙee pee mekeâlee
Øeef›eâÙeelcekeâ Øees«eeefcebie Yee<ee nw~ Fmes efvekeâuee@me efJeLe& ves 1968–69 ceW nw~ Sbieguej JS, cee@[ue-JÙet-kebâš^esuej (MVC) ef[peeFve hewšve& keâes
ef[peeFve efkeâÙee Lee~ Fmekeâe veece øeâe@meermeer ieefCele%e, oeMe&efvekeâ Deewj meheesš& keâjlee nw Deewj Ùen cee@[ue-JÙet-JÙetcee@[ue (MVVM) ef[peeFve
Yeeweflekeâ efJe%eeveer yuespe heemkeâue kesâ mecceeve ceW jKee ieÙee~ hewšve& keâes Yeer mehees&š& keâjlee nw~
X86 Demescyeueer ueQiJespe keâe Fmlesceeue X86 Jeie& kesâ Øeesmesmej kesâ efueS 45. (c)
Dee@ypeskeäš keâes[ kesâ efueS efkeâÙee peelee nw~ ‘‘rank()’’ HebâkeäMeve Ssjs keâes jQkeâ Ùeeveer efkeâmeer meejCeer keâe DeeÙeece
C# ueQiJespe, C leLee C++ keâe efceefßele ¤he nw~ Ùen Skeâ ceeF›eâesmee@Heäš ef j šve& keâjlee nw~ pewmes–int arr [10] [10] keâer jQkeâ 2 nw~
Øees«eeefcebie Yee<ee nw pees Dee@ypeskeäš DeesefjSbšs[ nw~ 46. (c)
delete keâe GheÙeesie efmebieue Dee@ypeskeäš keâes ef[ueerš keâjves kesâ efueS
37. (a)
yeÇW[sve F&Ûe Skeâ Decesefjkeâer šskeäveesueeefpemš Les~ FvneWves peeJeeefm›eâhš keâÙee peelee nw~ peyeefkeâ delete[ ] keâe Dee@ypeskeäš kesâ Skeâ meeefjCeer
ef
Øees«eeefcebie Yee<ee keâe DeeefJe<keâej efkeâÙee Lee~ Fvekesâ Éeje ceesepf euee (array/pointer) keâes ef[ueerš keâjves kesâ efueS efkeâÙee peelee nw~
heefjÙeespevee, ceesepf euee heâeG[WMeve Deewj ceesefpeuee keâejheesjsMeve keâer men 47. (c)
mLeehevee keâer ieÙeer Deewj Fvnesves ceesefpeuee keâejheesjsMeve kesâ cegKÙe nwMe šsyeue Skeâ Ssmeer [sše mebjÛevee nw pees keâer-JewuÙet hesÙej keâes meb«enerle
lekeâveerkeâer DeefOekeâejer kesâ ™he ceW keâece efkeâÙee nw~ keâjves kesâ efueS GheÙeesie keâer peeleer nw Deewj kegâMeuelee mes Sefuecesvš keâer
meefÛeËie, Fvememe&ve Deewj ef[uesMeve keâes me#ece yeveeleer nw~
38. (c)
48. (d)
[yeue Sb[s[ keäÙet Yeer Skeâ keäÙet [eše mebjÛevee nw efpemeceW oesveeW Úesj mes C++ ceW, peye Deehe fstream, ifstream Ùee ofstream pewmes
(meeceves Deewj heerÚs) Insertion Deewj Deletion efkeâÙee peelee nw~ HeâeFue mš^erce keâe GheÙeesie keâjles nw, lees Deehe efyešJeeFpe OR Dee@hejsšj
39. (c) (1) keâe GheÙeesie keâjkesâ Deesheefvebie cees[ keâes mebÙeesefpele keâj mekeâles nQ~
mšwkeâ ceW hee@efhebie keâe DeLe& efkeâmeer SefueceWš keâes nševee nw, pees kegâÚ ner ios :: in Deewj ios :: out ›eâceMe: Fvehegš Deewj DeeGšhegš HeâeFue
meceÙe henues peesÌ[e ieÙee nw~ Deesheefvebie cees[ nw~
40. (b) ios :: in Skeâ Heäuewie nw efpemekeâe GheÙeesie Ùen Fbefiele keâjves kesâ efueS
mšwkeâ Skeâ linear data mš^keäÛej nw pees [eše Dee@hejsMeve hejheâe@ce& keâjves kesâ efkeâÙee peelee nw efkeâ HeâeFue keâes Fvehegš Dee@hejsMeveeW (HeâeFue mes heÌ{ves)
efueS LIFO (ueemš Fve heâmš& DeeGš) keâes heâe@uees keâjlee nw~ kesâ efueS Keesuee peevee ÛeeefnS~
41. (c) ios :: out Skeâ Heäuewie nw efpemekeâe GheÙeesie Ùen Fbefiele keâjves kesâ efueS
C++ Øees«eecej cegKÙe ™he mes keäueemesme yeveeves hej OÙeeve kesâefvõle keâjles efkeâÙee peelee nw efkeâ HeâeFue keâes DeeGšhegš Dee@hejsMeveeW (HeâeFue ceW
nw efpemeceW [sše meomÙe (Data Members) Deewj meomÙe HebâkeäMeve efueKeves) kesâ efueS Keesuee peevee ÛeeefnS~
(Member Functions) nesles nw pees Gve [sše meomÙeeW ceW nsjHesâj Dele: keâLeve Skeâ mes DeefOekeâ melÙe nesiee~
keâjles nw Deewj «eenkeâeW keâes mesJeeS Øeoeve keâjles nw~ 49. (d)
42. (a) efoÙee ieÙee keâes[
JÙeehekeâ ™heeblejCeeW ceW ceewpetoe Øekeâej kesâ JewuÙet mes Skeâ veS ceeve keâe efvecee&Ce int a = 5;
Meeefceue neslee nw efpemeceW Ùee lees DeefOekeâ ØeefleyebOeelcekeâ ßesCeer nesleer nw Ùee ue#Ùe cout << "FIRST" << (a<<z) << "SECOND",
Øekeâej keâer leguevee ØeefleyebOeelcekeâ ßesCeer nesleer nw Ùee ue#Ùe Øekeâej keâer leguevee ceW Ùeefo Deehe Fme keâes[ keâes SefpekeäÙetš keâjles nw lees error 'cout' was
DeefOekeâ ØeefleyeefOeble meomÙe metÛeer nesleer nw~ ™heeblejCeeW keâes DelÙeeefOekeâ keâjves mes not declarable in this scope DeeÙesiee keäÙeeWefkeâ 'std∷cout' nesvee
[sše neefve veneR nes mekeâleer~ (neueeBefkeâ Gvekesâ heefjCeecemJe™he mešerkeâlee keâe ÛeeefnS~
176 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
50. (c) 60. (a)
keâchÙetšj Demescyeueer Yee<ee cesW efueKes Øees«eeceeW keâes veneR mecePelee nw, Ùenhenuee keâchÙetšj JeeÙejme ›eâerhej nQ~ ›eâerhej keâes 1971 ceW Skeâ ØeebjefYekeâ
cee$e yeeFvejer mebkesâle DeLee&led 0 Deewj 1 Ùeeefve ceMeerveer Yee<ee keâes ner kebâhÙetšj Øees«eecej Deewj MeesOekeâlee& yee@ye Lee@ceme Éeje efJekeâefmele efkeâÙee
mecePelee nw Dele: keâchÙetšj keâe Jen Øees«eece pees Demescyeueer Yee<ee keâes ieÙee Lee~ keâchÙetšj JeeÙejme Skeâ ogYee&JeveehetCe& keâesÌ[ nw pees mJebÙe keâes
ceMeerveer Yee<ee cesW ®heelebefjle keâjlee nw Demescyeuej keânueelee nw~ efkeâmeer DevÙe Øees«eece, keâchÙetšj yetš meskeäšj Ùee omleeJespe ceW keâe@heer
51. (c) keâjkesâ oesnjelee nw Deewj keâchÙetšj kesâ keâece keâjves kesâ lejerkesâ keâes yeoue
DemeWyeueer ueQiJespe Skeâ Øekeâej keâer efvecve mlejerÙe Øees«eeeEceie ueQiJespe nw lee nw~
os
efpemekeâe GösMÙe keâchÙetšj kesâ ne[&JesÙej mes meerOes mebJeeo 61. (c)
(communicate) keâjvee nw~ ceMeerveer Yee<ee kesâ efJehejerle, efpemeceW ef[mkeâ øesâiecesvšsMeve (Disk Fragmentation) Ùetefšefuešer mee@HeäšJesÙej
yeeFvejer Deewj nskeämee[sefmeceue JeCe& (Characters) nesles nw, DemeWyeueer kesâ Devleie&le Deelee nw~ ef[mkeâ kesâ mhesme keâes Dejsvpe keâjves keâer Øeef›eâÙee
keâes ef[mkeâ ef[øeâsiecesvš keânles nw~ ef[mkeâ ef[øewâiecesvšsMeve Øees«eece kesâ
ueQiJespe keâe meyemes DeÛÚe JeCe&ve efJekeâuhe (c) keâjlee nw~ Ùen Debleefve&efnle
Éeje HeâeFueeW keâes hegve: JÙeJeefmLele efkeâÙee peelee nw efpememes ef[mkeâ keâer
ceMeerve keâer yeejerefkeâÙeeW mes yebOee neslee nw~
ieefle leer›e nes peeleer nw~
52. (a)
62. (c)
GheÙeg&òeâ Øeleerkeâ heäueesÛeeš& ceW cewvegDeue Fvehegš keâes oMee&lee nw~ keâeryees[& Skeâ DeeBkeâÌ[e mebÛeÙe ([ešeyesme) efpemeceW meeceeve #es$e mes mebueive
Ùee ef[JeeFme kesâ ceeOÙece mes [sše kesâ cewvegDeue Fvehegš keâes efkeâmeer heâeru[ meejefCeÙeeB meefcceefuele neW, Gmes mebyebefOele DeeBkeâÌ[e mebÛeÙe keâne peelee nw~
Ùee Øeef›eâÙee keâes ÛejCe ceW oMee&lee nw~ GoenjCe- uee@efieve Øeef›eâÙee keâe efjuesMevme [sšeyesme Skeâ Øekeâej keâe [sšeyesme nw pees Skeâ otmejs mes
Jen ÛejCe Meeefceue nw peneB GheÙeesiekeâlee& keâes cewvegDeue ™he mes [sše ope& mebyebefOele [sše efyebogDeeW keâes meb«eefnle keâjlee nw Deewj Gve lekeâ hengBÛe Øeoeve
keâjves kesâ efueS keâne peelee nw~ keâjlee nw~ efjuesMeveue [sšeyesme efjuesMeveue cee@[ue hej DeeOeeefjle nesles
53. (d) nQ, pees leeefuekeâeDeeW ceW [sše keâe ØeefleefveefOelJe keâjves keâe Skeâ menpe,
Suieesefjodce efkeâmeer mecemÙee keâes nue keâjves keâe Skeâ mšshe-yeeF& mšshe meerOee lejerkeâe nw~
Øeef›eâÙee nQ Skeâ mšshe Skeâ Dee@hejsMeve keâes oMee&lee nw~ Suieesefjodce kesâ 63. (a)
efvecve efJeMes<eleeSB nesleer nw~ pewmes- efveef§elelee:- Suieesefjodce keâes efveef§ele yetšmš^whe Jen Øees«eece nw pees mšeš&Dehe kesâ meceÙe Dee@hejsefšbie efmemšce keâes
meceÙe leLee keâce mhesme ceW efueKee pee mekeâlee nw~ FefveefMeÙeueeFpe keâjlee nw~ yetšmš^wefhebie Fvš^keäMeve kesâ Skeâ mesš keâes uees[
54. (c) keâjves keâer Øeef›eâÙee nw peye efkeâmeer kebâhÙetšj keâes henueer yeej mšeš& Ùee yetš
heäueesefšbie hJee@Fbš vecyej jsef[keäme hJee@Fbš ([smeerceue) keâes efjheâj keâjlee nw efkeâÙee peelee nw lees mšeš&Dehe Øeef›eâÙee kesâ meceÙe uees[j henues hee@Jej-
heäueesš ceW oMeceueJe keâe ceeve meefcceefuele nw~ Dee@ve mesuHeâ-šsmš keâjlee nw efpemes POST Yeer keâne peelee nw~ Ùeefo
55. (c) POST meHeâue neslee nw Deewj keâesF& mecemÙee veneR efceueleer nw, lees
heeFLeve ceW _name_ efJeMes<e JesefjSyeue, Jele&ceeve ceW Ûeue jns heeFLeve yetšmš^whe uees[j kebâhÙetšj kesâ Dee@hejsefšbie efmemšce keâes cesceesjer ceW uees[
efm›eâhš Ùee cee@[Ÿetue keâe veece mšesj keâjlee nw~ keâjlee nw~
64. (a)
56. (a)
Constructor keâe cegKÙe GösMÙe Dee@ypeskeäš keâes initialize keâjvee Skeâ keâchÙetšj mee@heäšJesÙej pees GÛÛe mlejerÙe Yee<ee ceW efueKes ieÙes œeesle keâes[&
keâes ceMeerve Yee<ee efveoxMeeW kesâ Skeâ mesš ceW DevegJeeefole keâjlee nw, kebâheeFuej kesâ
neslee nw~ peye Deehe veÙee object create keâjles nw, lees constructor
™he ceW peevee peelee nw~ kebâheeFuej Skeâ Ssmee efmemšce mee@heäšJesÙej DevegJeeokeâ
Deheves Deehe keâe@ue neslee nw~
nw pees œeesle Øees«eeefcebie Yee<ee keâe meceLe&ve keâjlee nw, heâeFueeW keâes heÌ{lee nw,
57. (a)
keâes[ keâe efJeMues<eCe keâjlee nw, ue#Ùe huesšheâe@ce& kesâ efueS GheÙegòeâ Øee™he ceW
meesme& keâes[ keâes osKeves, mebMeesefOele keâjves Deewj hegveefJe&leefjle keâjves kesâ efueS Fmekeâe DevegJeeo keâjlee nw~
keâF& GheeÙe GheueyOe nQ, meyemes ØecegKe nw, Deeshesve meesme& efpemeceW meesme& 65. (d)
keâes[ meeJe&peefvekeâ ¤he mes GheueyOe neslee nw~ efpemes keâesF& Yeer osKe DNX Skeâ RTOS (jerÙeue šeFce Dee@hejsefšbie efmemšce) nw~ pees Skeâ
mekeâlee nw, mebMeesefOele keâj mekeâlee nw, GoenjCe kesâ efueS Linux, Øekeâej keâe Deeshesve meesme& mee@heäšJesÙej nw~
Apache, Libre Office Deeefo~ 66. (a)
58. (b) heâce&JesÙej Skeâ efmemšce mee@heäšJesÙej nw pees keâchÙetšj ceojyees[& hej
keâchÙetšj efveoxMe efueKeves keâer Øeef›eâÙee keâes keâesef[bie keânles nQ~ keâesef[bie mLeeefhele Dee@hejsMeveue mee@heäšJesÙej nw pees Dee@hejseEšie efmemšce keâes heäuewMe
efveoxMeeW keâes yeveeves keâer Øeef›eâÙee nw, efpemes keâchÙetšj JÙeeKÙee keâjkesâ ROM, EPROM, EEPROM Deewj cesceesjer efÛehme keâer henÛeeve
Gmekeâe heeueve keâjlee nw~ keâese[f bie Yee<ee kesâ GoenjCe C, C++, Java keâjves ceW ceoo keâjlee nw~
Deeefo nQ~ 67. (a)
59. (d) mee@kesâš (Socket) heâeFue Skeâ mhesMeue heâeFue nesleer nw efpemekeâe
Demescyeuej Skeâ Ssmee Øees«eece Ùee š^ebmeuesšj nw efpemekeâe ØeÙeesie vesceesefvekeâ GheÙees ie oes Deueie-Deueie Øeesmesme keâes Fbšjkeâveskeäš keâjves kesâ efueS efkeâÙee
ketâš keâes ceMeerve ketâš ceW heefjJele&ve kesâ efueS neslee nw~ peelee nw~ Ùen efuevekeäme OS ceW Fbšj-Øeesmesme mebÛeej Yeer Øeoeve keâjlee nw~
177 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
68. (a) 78. (a)
mebieCekeâ kesâ Ieškeâ "erkeâ lejn mes pegÌ[ ieS nQ Deewj ØeÛeefuele nes ieS nQ, cewkesâefvekeâue keâchÙetšj meJe&ØeLece 1822 ceW Charles Babbage
Ùes yetefšbie Øeef›eâÙee megefveef§ele keâjleer nw~ yetefšbie cetue ™he mes keâchÙetšj Éeje efJekeâefmele efkeâÙee ieÙee Lee~ Ùen Fueskeäš^e@efvekeâ IeškeâeW kesâ
keâes megÛee™ keâjves keâer Øeef›eâÙee nw~ keâchÙetšj keâer cegKÙe cesceesjer Ùee yepeeÙe ueerJej Deewj efieÙej pewmes Ùeebef$ekeâ IeškeâeW mes efveefce&le keâchÙetšj
jQ[ce-Skeämesme cesceesjer (RAM) ceW Dee@hejsefšbie efmemšce keâes uees[ keâjves nQ~
kesâ efueS keâchÙetšj keâer ef›eâÙee keâes yetefšbie keâne peelee nw~ 79. (a)
69. (b) ØeLece efJeÅegleerÙe meejCeer Ùeb$e (leeefuekeâeyeæ Ùeb$e) keâes njceve nesuesjerLe ves
Skeâ ner meceÙe ceW keâcheveer kesâ meYeer uesve-osveeW keâes mecetnerke=âle SJeb efJekeâefmele efkeâÙee~ leeefuekeâe yeæ Ùeb$e Skeâ efieveleer ceMeerve Leer efpemekeâe
mebmeeefOele keâjvee yewÛe Øeesmesefmebie keânueelee nw~ yewÛe Øeesmesefmebie keâe DeLe& GheÙeesie henueer yeej 1890 ceW Decesefjkeâer peveieCevee [sše keâes
efkeâmeer mecetn Ùee keâleej ceW uesve-osve keâe efve<heeove keâjvee neslee nw pees meejCeeryeæ keâjves kesâ efueS efkeâÙee ieÙee Lee~
yeÌ[er cee$ee ceW [sše keâes oesnjeves ÙeesiÙe lejerkesâ mes mebmeeefOele keâjves keâer 80. (d)
Skeâ lekeâveerkeâ nw~ yeme (Bus) ceojyees[& hej yeves megÛeeuekeâ leejeW keâe mecetn nw pees [eše
70. (d) Ùee Fueskeäš^eefvekeâ efmeiveue keâes keâchÙetšj efmemšce kesâ Yeerlej Skeâ mLeeve mes
BIOS keâe hegâue heâece& ‘yesefmekeâ Fvehegš DeeGšhegš efmemšce’ neslee nw Fmes otmejs mLeeve lekeâ ues peelee nw~ Ùen efJeefYeVe GhekeâjCeeW keâes Skeâ meeLe
efmemšce BIOS Ùee PC BIOS Yeer keâne peelee nw~ Ùen ceojyees[& kesâ peesÌ[lee nw~ meerheerÙet leLee keâchÙetšj efmemšce kesâ DevÙe ne[&JesÙej Deewj
meeLe pegÌ[e Skeâ mee@heäšJesÙej neslee nw pees keâchÙetšj efmemšce keâes Ûeeuet hesjerhesâjue ef[JeeFme kesâ yeerÛe efveoxMeeW leLee metÛeveeDeeW keâe Deeoeve-Øeoeve
keâjves kesâ yeeo Gmes Ûeeuet jKeves kesâ efueS PC kesâ ceeF›eâesØeesmesmej Éeje yeme kesâ Éeje neslee nw~
BIOS keâe GheÙeesie efkeâÙee peelee nw~ 81. (b)
71. (b) heÌ{ves/efueKeves keâer ueeFve kebâš^esue yeme mes mecyeefvOele nw Fmekeâe GheÙeesie
Jen mee@heäšJesÙej pees ØeÙeesòeâe kesâ peevekeâejer kesâ efyevee Gmekeâer ieefleefJeefOeÙeeW Ùen efveefo&° kesâ efueS efkeâÙee peelee nw efkeâ keâesF& efJeMes<e Dee@hejsMeve heÌ{ves
keâes š^wkeâ keâjlee nw, mheeFJesÙej keânueelee nw~ Ùee efueKeves kesâ Dee@hejsMeve nw Ùee vener~
72. (b) 82. (b)
efjÙeue-šeFce efmemšcme ceW meceÙe hej cenlJehetCe& IešveeDeeW keâe peJeeye MFLOPS, Million Floating Point Operation Per Second
osves kesâ efueS Fbšjhš uesšWmeer keâes vÙetvelece (Minimal) jKevee DelÙeble keâe mebef#ehle ™he nw~ Ùen heäueesefšbie hJeeFbš ieCevee keâjves kesâ efueS
cenlJehetCe& nw~ GheÙeesie efkeâS peeves Jeeues keâchÙetšj keâer ieefle keâer ceehe nw~ DeLee&led
73. (a) Fmekeâe GheÙeesie CPU (meWš^ue Øeesmesefmebie Ùetefveš) keâer ieefle ceeheves kesâ
hesefpebie Skeâ cesceesjer cewvespeceWš lekeâveerkeâ nw efpemekeâe GheÙeesie JeÛeg&Deue efueS efkeâÙee peelee nw~ meeOeejCele: keâchÙetšj kesâ meerheerÙet Ùee Øeesmesmej keâer
cesceesjer keâes Yeeweflekeâ cesceesjer kesâ Úesšs-Úesšs yuee@keäme ceW efJeYeeefpele keâjves ieefle MIPS (Million of Instruction Per Second) ceW ceehee
kesâ efueS efkeâÙee peelee nw~ FmeceW JeÛeg&Deue cesceesjer kesâ meceeve Deekeâej kesâ peelee nw~ meghej keâchÙetšj keâer ieefle FLOPS (Floating Point
hespespe ceW yeebše peelee nw Deewj Yeeweflekeâ cesceesjer keâes øesâcme ceW efJeYeeefpele Operation Per Second) ceW ceeheer peeleer nw~
efkeâÙee peelee nw~ 83. (a)
74. (a) Skeâ Øees«eece keâeGbšj Øeesmesmej ceW Skeâ jefpemšj neslee nw pees Gme Deieues
FAT32 Skeâ hegjevee HeâeFue efmemšce nw, pees efJeb[espe 95, 98, XP, Fvmeš^keäMeve kesâ S[^sme keâes keâvšsve efkeâÙes jnlee nw efpemes cesceesjer mes
cewkeâ, efuevekeäme Deewj DevÙe ef[JeeFme (pewmes-USB [^eFJe, cesceesjer keâe[&) SefpekeäÙetš keâjvee neslee nw~
kesâ meeLe DeefOekeâ Devegketâuelee (keâchesefšefyeefuešer) Øeoeve keâjlee nw~ 84. (a)
NTFS keâer leguevee ceW FmeceW HeâeFue efmekeäÙeesefjšer, mebheer[ve #ecelee Deewj efpeme ieefle mes Skeâ efveoxMe efvemheeefole efkeâÙee peelee nw Jen meerOes
yeÌ[er HeâeFueeW keâe meceLe&ve meerefcele neslee nw~ keâchÙetšj kesâ Debleefve&efnle keäuee@keâ mheer[ mes mecyeefvOele neslee nw~
75. (d) keä uee@keâ mheer[ keâchÙetšj kesâ Øeesmesmej keâer cee$eelcekeâ ieefle keâes oMee&leer nw
Fcespe metÛevee keâer yeeFvejer efjØepesvešsMeve nesleer nw leLee Ùen hesume, efpemes nšd&pe (Hz) ceW ceehee peelee nw~ Ùen ieefle oMee&lee nw efkeâ Øeesmesmej
efhekeämeue, [e@šdme Deeefo keâs mecetn mes yeveer nesleer nw~ efkeâleveer lespeer mes DeeGšhegš osiee~
76. (a) 85. (d)
mkewâvej Skeâ Fvehegš ef[JeeFme nw efpemekesâ ceeOÙece mes heâeFue keâes mkewâve Ùen Skeâ keâchÙetšj pewmee GhekeâjCe nw pees efJeMes<e ne[&JesÙej, mee@heäšJesÙej
keâjkesâ meerheerÙet lekeâ hengBÛeeÙee peelee nw~ Fmekesâ Éeje Yeeweflekeâ ÚefJe keâes Deewj keâvesefkeäšefJešer efJekeâuheeW keâes efceueelee nw, efpemes meeJe&peefvekeâ mLeeveeW
ef[efpešue cebs yeoue efoÙee peelee nw leeefkeâ meerheerÙet mecePe mekesâ~ hej ueesieeW keâes kegâÚ peevekeâejer Øeoeve keâjves kesâ efueS ef[p] eeFve efkeâÙee
77. (b) ieÙee nw~ iewj-mebJeeoelcekeâ-«eenkeâ efkeâmeer Yeer ieefleefJeefOe keâes keâjves keâer
VLSI keâe hetCe& ™he Very Large-scale integration nw Fmekeâe #ecelee kesâ efyevee m›eâerve hej ØeoefMe&le peevekeâejer Øeehle keâjles nQ~ Fme lejn
GheÙeesie heme&veue keâchÙetšj kesâ ceeF›eâesØeesmesmej ceW, «eeefheâkeâ keâe[& ceW, kesâ efveef<›eâÙe mšQ[ Deeceleewj hej ef[efpešue meeFvespe efmemšce ceW efJe%eeheve
mesue heâesve ceW efÛehe kesâ ™he ceW, leLee DeešesceesyeeFue ceW Scyes[[ Øeesmesmej kesâ efueS GheÙeesie efkeâS peeles nw~ Dele: efoS ieS oesveeW ner efJekeâuhe
Deeefo ceW neslee nw~ mener nw~
178 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
86. (b) 94. (d)
neJe&[& ceeke&â 1 (Harvard Mark I) keâes IBM mJeÛeeefuele Deveg›eâce keâejveewHeâ cewhe (K-map) mes mejueerke=âle yeteuf eÙeve JÙebpekeâ keâes Keespeves kesâ
efveÙebef$ele kewâuekegâuesšj (ASCC) kesâ ™he ceW Yeer peevee peelee nw~ Ùen Skeâ efueS meyemes henues Deeskeäšsšdme (Octets) keâes osKee peelee nw~
ØeejbefYekeâ ef[efpešue keâchÙetšj Ùee efpemes ne@Je[& Skesâve (Howard Aiken) 95. (b)
Éeje ef[peeFve efkeâÙee ieÙee Lee Deewj IBM Éeje 1944 ceW vÙetÙee@ke&â ceW Gvekeâer efoÙes ieÙes DeefYeJÙeefkeäle
Sbef[keâe@š ØeÙeesieMeeueeDeeW ceW yeveeÙee ieÙee Lee~ (X + Y + XY) (X + Z)
87. (d) = X (1 + Y) + Y) (X + Z) 1+Y=1
‘uee@efpekeâue cesceesjer’ meeceeve Deekeâej kesâ yuee@keâ ceW efJeYeeefpele keâjves keâes = (X + Y) (X + Z)
hespespe keâne peelee nw~ hespespe uee@efpekeâue cesceesjer keâes meeceeve Deekeâej kesâ = X + YZ
yuee@keâes ceW efJeYeeefpele keâjlee nw~ hesefpebie Skeâ cesceesjer ØeyebOeve lekeâveerkeâ nw 96. (a)
efpemeceW Øeesmesme S[^sme mhesme keâes Skeâ ner Deekeâej kesâ yuee@keâ ceW leesÌ[ yetefueÙeve SkeämeØesMeve
x+xy
efoÙee peelee nw efpemes hespe keâne peelee nw~ hesefpebie keâe Deekeâej hespees keâer
= x (1 + y) ∵ 1 + y =1
mebKÙee ceW ceehee peelee nw~ = x.1
88. (b)cesceesjer meeFpe heeJej ceW =x
1 KB 1024 bytes 210 97. (b)
1 MB 1024 KB 220 [erceeie&ve ØecesÙe kesâ Devegmeej Skeâ NAND iesš, vesieefšJe OR iesš kesâ
1 GB 1024 MB 230 meceeve neslee nw~
1 TB 1024 GB 240
1 PB 1024 TB 250
1 EB 1024 PB 260
1 ZB 1024 EB 270
1 YB 1024 ZB 280
89. (a)

98. (a)
Ùeefo oesveeW Fvehegš 00 nes lees NOR iesš DeeGšhegš (high) GÛÛe
nesiee~
NOR iesš keâe Truth Table
In p u t O u tp u t
90. (b) 00 1
CD ROM, Heäuee@heer ef[mkeâ, ne[& ef[mkeâ meYeer yueekeâ ef[JeeFme nw~ 01 0
RAM Skeâ ØeeLeefcekeâ cesceesjer nw~ RAM Skeâ Meeš& šce& cesceesjer nw
10 0
FmeceW [eše ncesMee kesâ efueS mšesj veneR neslee~
11 0
CD-ROM keâe DeLe& keâechewkeäš ef[mkeâ jer[ Deesveueer cesceesjer nw~ Fmekeâe
GheÙeesie meskeWâ[jer mšesjspe kesâ efueS efkeâÙee peelee nw~ ne[& ef[mkeâ Ùee NOR Deewj NAND iesš ÙetefveJeme&ue nw~
99. (a)
ne[& [^eFJe keâchÙetšj kesâ efueS ÛegcyekeâerÙe Yeb[ejCe ceeOÙece nw~
neHeâ S[j meefke&âš Skeâ ef[efpešue meefke&âš nw pees oes Skeâ-efyeš yeeFvejer
91. (b)
mebKÙeeDeeW keâe Ùeesie (Sum) Deewj kewâjer (Carry) GlheVe keâjlee nw~ Ùen
Ùeefo Deehe DeefOekeâ jwce Fbmše@ue keâjles nQ lees ceeF›eâesmee@heäš efJeC[espe meefke&âš yeeFvejer Sef[Meve keâe meyemes mejue ™he nw Deewj Fmekeâe GheÙeesie
DeeOeeefjle keâchÙetšj lespeer mes keâece keâjsiee keäÙeeWefkeâ Fmemes ShueerkesâMeve yeeFvejer mebKÙee ØeCeeueer ceW Sef[Meve kesâ efueS efkeâÙee peelee nw~
keâer keâeÙe& #ecelee yeÌ{leer nw~ 100. (a)
92. (a)
SDRAM keâe hetCe& ™he Synchronous Dynamic Random
Access Memory (efmeb›eâesveme [eÙevesefcekeâ jQ[ce Skeämesme cesceesjer) 0 1 1
neslee nw~ Fmekeâer mheer[ keâes cesieenšd&pe ceW ceeheer peeleer nw~ 107
16

93. (d) (407)8 = (100000111)2

jer[ Deesveueer cesceesjer ( ROM) kesâ efJeefYeVe Øekeâej efvecve nw - yeeFvejer mes nskeämee[sefmeceue yeveeves kesâ efueS 4-4 efyeš keâer hesÙeefjbie keâjveer
1. PROM 2. EPROM 3. EEPROM heÌ[leer nw, Ùeefo LSB meeF[ 4 efyeš veneR nesleer nw lees GmeceW 0 mes
4. MROM (Masked Read Only Memory) hewef[bie keâjkesâ kebâhueerš keâjles nw~
179 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
 PRACTICE SET - 6
1. Which one is an example for case based learning? 7. efvecveefueefKele ceW mes keâewve mee Yeejle keâe henuee 3D efØebšs[
/keâewve-mee kesâme DeeOeeefjle ueefveËie keâe Skeâ GoenjCe nw? åÙetcevee@F[ jesyeesš nw–
(a) Decision tree/efveCe&Ùe Je=#e (a) INDRO (b) MANAV
(b) Neural network/lebef$ekeâe vesšJeke&â (c) DAKSH (d) KEMPA
(c) Genetic algorithm/pesvesefškeâ Suieesefjoce 8. IoT GhekeâjCeeW ceW JeeÙejuesme mebÛeej kesâ efueS Deeceleewj hej
(d) k-nearest neighbour/kesâ-efvekeâšlece heÌ[esmeer efkeâme lekeâveerkeâ keâe GheÙeesie efkeâÙee peelee nw?
2. Which of the following programming (a) heâeFyej Dee@efhškeâ (b) yuetštLe
languages is related to AI (Artificial (c) ÙetSmeyeer (d) F&Lejvesš
Intelligence) development? 9. Human resemble robots are called
efvecveefueefKele ceW mes keâewve-meer Øees«eeefcebie ueQiJespe AI ceeveJe pewmes efoKeves Jeeues jesyeesš keâes keâne peelee nw
(Deeefš&efheâefmeÙeue FbšsefuepeWme) [sJeueheceWš mes mebyebefOele nw? (a) Head robot/ns[ jesyeesš
(a) C language/C ueQiJespe (b) Personids/hemeexefve[dme
(b) C++ language/C++ ueQiJespe (c) Humanoids/ÿetcevee@F[dme
(c) Java language/peeJee ueQiJespe (d) Legged robot/hewjJeeues jesyeesš
(d) Prolog language/Øeesuee@ie ueQiJespe 10. Which of the following HTML tags specifies a
3. What is the main principle on which block container for an external (non-HTML)
chain technology is based? application?
yuee@keâÛesve lekeâveerkeâ (blockchain technology) efkeâme efvecveefueefKele ceW mes keâewve-mee HTML šwie (iewj
cegKÙe efmeæeble hej DeeOeeefjle nw? HTML) SefhuekesâMeve kesâ efueS Skeâ kebâšsvej efveefo&°
(a) Decentralisation and cryptography keâjlee nw?
efJekesâvõerkeâjCe Deewj ietÌ{uesefKekeâer (a) <em> (b) <embed>
(b) Centralisation and cryptography (c) <ins> (d) <nav>
kesâvõerÙekeâjCe Deewj ietÌ{uesefKekeâer 11. A frame buffer on a black and white system
(c) Cryptography/ietÌ{uesefKekeâer with one bit per pixel is commonly called:/Skeâ
(d) Mutability/heefjJele&veerÙelee yuewkeâ Sb[ JneFš efmemšce hej Skeâ efyeš Øeefle efhekeämesue kesâ
4. IoTWF architectural committee published 7- meeLe Skeâ øesâce yeheâj keâes Deeceleewj hej keâne peelee nw–
layer IoT architectural reference model in___. (a) grayscale/«esmkesâue (b) pix map/efhekeäme cewhe
IoTWF Deeefke&âšskeäÛejue meefceefle ves _____ ceW 7-uesÙej (c) bitmap/efyešcewhe (d) multi map/ceušer cewhe
IoT Deeefke&âšskeäÛejue jsheâjWme cee@[} ØekeâeefMele efkeâÙee~ 12. Which of the following is not a valid image
(a) 2012 (b) 2010 format?
(c) 2014 (d) 2015 ceevÙe Fcespe heâe@cexš efvecveefueefKele ceW keâewve veneR nw?
5. Which wireless communication technology is (a) tiff (b) gif
commonly used in IoT devices for short-range (c) jpeg (d) mpeg
communication?/Jeâewve-meer JeeÙejuesme mebÛeej lekeâveerkeâ 13. F&-ieJeveXme ceW ef[efpešue omleeJespeeW keâer megj#ee Deewj
Deeceleewj hej Úesšer otjer kesâ mebÛeej kesâ efueS IoT ØeeceeefCekeâlee megefveef§ele keâjves kesâ efueS ØeeÙe: efkeâme
GhekeâjCeeW ceW GheÙeesie keâer peeleer nw? lekeâveerkeâ keâe GheÙeesie efkeâÙee peelee nw?
(a) Bluetooth/yuetštLe (b) Wi-Fi/JeeF&-HeâeF& (a) ef[efmš^yÙetšs[ uespej šskeäveesuee@peer
(c) 4G LTE/4peer SuešerF& (b) ef[efpešue efmeie>sÛeme&
(d) More than one of the above (c) keäueeG[ kebâhÙetefšbie
GheÙeg&òeâ ceW mes Skeâ mes DeefOekeâ
(d) JeÛe&gDeue ØeeFJesš vesšJekeäme&
6. Which of the following is NOT an loT
communication model? 14. Which of the following services allows users to
efvecveefueefKele ceW mes keâewve-mee loT mebÛeej cee@[ue veneR nw? buy and sell products online?/efvecveefueefKele ceW mes
(a) Request Response Model keâewve-meer mesJeeSB, Ùetpeme& keâes Dee@veueeFve Glheeo Kejeroves
efjkeäJesmš efjmheebme cee@[ue Deewj yesÛeves keâer megefJeOee osleer nw?
(b) Publish Subscribe Model (a) Instant messaging/FbmšWš cewmesefpebie
heefyueMe meyme›eâeFye cee@[ue (b) Video conferencing/Jeeref[Ùees keâe@vøesâefmebie
(c) Push Pull Model/hegMe hegue cee@[ue (c) E-commerce/F&-keâe@ceme&
(d) Key-Value Pair Model/keâer-JewuÙet hesÙej cee@[ue (d) Streaming/mš^erefcebie

180 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
15. Which of the following is used to open a new 22. In a digital communication system, if you want
tab on a browser?/yeÇeGpej hej Skeâ veÙee šwye Keesueves to increase noise immunity then we need to
kesâ efueS efvecve ceW mes efkeâmekeâe GheÙeesie efkeâÙee peelee nw ? increase............./Skeâ ef[efpešue mebÛeej leb$e ceW, Ùeefo
(a) Ctrl + T (b) Ctrl + A Deehe OJeefve Øeeflej#ee yeÌ{evee Ûeenles nQ, lees.............keâes
(c) Ctrl + W (d) Ctrl + Y yeÌ{eves keâer DeeJeMÙekeâlee nesleer nw~
16. Which one of the following is not a network (a) Signal repeater/efmeiveue efjheeršj
topology?/efvecveefueefKele ceW mes keâewve-mee Skeâ vesšJeke&â (b) Signal Antenna/efmeiveue Ssvšsvee
šesheesuee@peer veneR nw? (c) Signal power/efmeiveue heeJej
(a) Peer-to-peer (d) Battery power/yewšjer heeJej
(b) Ring
23. What is used by a router to decide the best
(c) Bus
available route the packet can take to reach its
(d) More than one of the above/GheÙeg&òeâ ceW mes Skeâ destination quickly and accurately?/meyemes DeÛÚe
DeefOekeâ GheueyOe ceeie& efveOee&efjle keâjves kesâ efueS jeGšj Éeje keäÙee
17. Name the standards-based point-to-point,
serial interconnect capable of high-bandwidth
ØeÙegòeâ efkeâÙee peelee nw, leeefkeâ hewkesâš Deheves [sefmšvesMeve
transfers, used throughout the computing and lekeâ peuoer Deewj mešerkeâ ™he mes hengbÛe mekesâ?
embedded devices industries, introduced in (a) Encryption table /Sefv›eâhMeve šsyeue
2004./ceevekeâ DeeOeeefjle, hee@Fš
b -št-hee@Fbš meerefjÙeue (b) Hash table /nwMe šsyeue
Fbšjkeâveskeäš keâe veece yeleeFS, pees GÛÛe-yeQ[efJe[dLe (c) Logarithm table /uee@ieefjLce šsyeue
mLeeveevlejCe ceW me#ece nw, efpemekeâe GheÙeesie hetjs keâchÙetefšbie (d) Routing table /jeGefšbie šsyeue
Deewj Scyes[s[ ef[JeeFme GÅeesieeW ceW efkeâÙee peelee nw, efpemes 24. Which of the following communications is the
2004 ceW hesMe efkeâÙee ieÙee Lee~ method of communication between processes
(a) PCI Extended (b) PCI SIG through which they interact with each other for
(c) PCI Express (d) PCI gaining access to shared data and resources?
18. Which of the following is not a component of a efvecveefueefKele ceW mes keâewve-mee mebÛeej, ØekeâceCeeW kesâ yeerÛe
computer network? mebJeeo efJeefOe nw efpemekesâ ceeOÙece mes menYeeefpele [eše Deewj
efvecveefueefKele ceW mes keâewve mee kebâhÙetšj vesšJeke&â keâe Skeâ mebmeeOeveeW keâe DeefYeiele Øeehle keâjves kesâ efueS Skeâ-otmejs
Ieškeâ veneR nw? kesâ meeLe ef›eâÙee keâer peeleer nw?
(a) NIC/Sve.DeeF&.meer. (b) Router/jeGšj (a) Inter-process/ Fbšj-Øeesmesme
(c) Switch/efmJeÛe (d) USB/Ùet.Sme.yeer. [^eFJe (b) Intra-process / Fbšje Øeesmesme
19. Transmission control protocol: (c) Multi process/ ceušer Øeesmesme
ØemeejCe efveÙeb$eCe Øeesšeskeâe@ue– (d) Scheduling process/ efveÙeespekeâ Øeesmesme
(a) is a connection-oriented protocol 25. DNS Fbšjvesš Deeefke&âšskeäÛej ceW keâewve-mee uesÙej
(b) uses a three-way handsake to establish a Øeesšeskeâe@ue nw?
connection
(c) receives data from application as a single (a) Transport/š^evmeheesš& (b) Application/SefhuekesâMeve
stream (c) Data Link/[sše efuebkeâ (d) Network/vesšJeke&â
(d) More than one of the above/GheÙeg&keäle ceW mes Skeâ mes 26. Which among the following deals with exploring
DeefOekeâ appropriate and honest behaviours related to
online environments and digital media?
20. TCP/IP cee@[ue kesâ mebyebOe ceW, UDP keâe hetCe& ™he
efvecveefueefKele ceW mes keâewve mee efJekeâuhe Dee@veueeFve
keäÙee nw?
JeeleeJejCe Deewj ef[efpešue ceeref[Ùee mes mebyebefOele GefÛele
(a) User Data Processing/Ùetpej [sše Øeesmesefmebie
Deewj DeÛÚe JÙeJenej keâe mecevJes<eCe keâjlee nw?
(b) Uni-Directional Processing/Ùetveer-[eÙejskeäMeveue
Øeesmesefmebie (a) Cyber security /meeFyej efmekeäÙeesefjšer
(c) User Datagram Protocol/Ùetpej [sše«eece Øeesšeskeâe@ue (b) Cyber law /meeFyej uee@
(d) Unique Datagram Protocol/Ùetefvekeâ [sše«eece (c) Cyber ethics /meeFyej SefLekeäme
Øeesšeskeâe@ue (d) Cyber safety /meeFyej mesheäšer
21. IMAP protocol is used in: 27. Which one of the following is correct about
IMAP Øeesšeskeâe@ue cebs GheÙeesie efkeâÙee peelee nw– 4GL?/efvecveefueefKele ceW 4 peer Sue kesâ yeejs ceW keäÙee mener nw?
(a) E-mails/F&-cesue (a) A computer brand/Skeâ keâchÙetšj yeÇeB[
(b) Image processing/Fcespe Øeesmesefmebie (b) A software program/Skeâ mee@HeäšJesÙej Øees«eece
(c) Encryption/Sefv›eâhMeve (c) A storage device/Skeâ mšesjspe ef[JeeFme
(d) File transfer/]heâeFue š^ebmeheâj (d) A programming language/Skeâ Øees«eeefcebie Yee<ee
181 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
28. ....... is an object model language standard. 34. What is information about data called?
.......... Skeâ Dee@ypeskeäš cee@[ue ueQiJespe ceevekeâ nw~ [sše kesâ yeejs ceW peevekeâjer keäÙee keânueeleer nw?
(a) Data definition language/[sše [sefheâefveMeve ueQiJespe (a) Teradata (b) Metadata
(b) Data manipulation language (c) Relations
[sše cewveerheguesMeve ueQiJespe (d) More than one of the above/GheÙeg&keäle ceW mes Skeâ mes
(c) Query language/keäJesdjer ueQiJespe DeefOekeâ
35. Identify the output value (ignoring the output
(d) OQL/DeeskeäÙetSue
header) of the MySQL query.
29. The primary characteristic of a key field is that SELECT 6 MOD 20;
it must be:/efkeâmeer keâer efheâu[ keâer ØeeLeefcekeâ efJeMes<elee
MySQL query keâer DeeGšhegš JewuÙet (DeeGšhegš keâes
Ùen nw efkeâ Jen: vepejDeboepe keâjles ngS) keâer henÛeeve keâerefpeS~
(a) a text/šskeämš nes (a) 3 (b) 6
(b) duplicate/[ghueerkesâš nes (c) 20 (d) 2
(c) a name/Skeâ veece nes 36. What is XML stands for?/XML keâe hetje veece nw
(d) unique/efJeefMe<š nes (a) Example markup Language
30. Which of the following is not a function of the Skeämeecheue ceeke&âDehe ueQiJespe
database? (b) Extensible Markup Language
efvecveefueefKele ceW mes keâewve [sšeyesme keâe keâeÙe& veneR nw? SkeämšWefmeyeue ceeke&âDehe ueQiJespe
(a) Managing and manipulating stored (c) X Markup Language/Skeäme ceeke&âDehe ueQiJespe
data/meb«eefnle [sše keâe ØeyebOeve Deewj nsjHesâj keâjvee (d) Extra Modern Link/Skeämš^e cee@[ve& eEuekeâ
(b) Analysing Code/keâes[ keâe efJeMues<eCe 37. What is the correct way of adding comments in
(c) Security for stored data/meb«eefnle [sše keâer megj#ee VBScript?/VBScript ceW efšhheefCeÙeeB peesÌ[ves keâe mener
(d) More than one of the above/GheÙeg&òeâ ceW mes Skeâ mes lejerkeâe keäÙee nw?
DeefOekeâ (a) REM This is the right way to add a comment/
31. In relational database, the number of attributes REM efšhheCeer peesÌ[ves keâe Ùen mener lejerkeâe nw~
of a relation is called the _______ of relation. (b) <!- This is the right way to add a comment.--
efjuesMeveue [sšeyesme ceW, efkeâmeer efjuesMeve kesâ Sefš^yÙetšdme keâer >/ <!- efšhheCeer peesÌ[ves keâe Ùen mener lejerkeâe nw~-->
mebKÙee keâes efjuesMeve keâe ______ keâne peelee nw~ (c) "This is the right way to add a comment./‘‘Ùen
(a) domain/[escesve (b) degree/ef[«eer efšhheCeer peesÌ[ves keâe mener lejerkeâe nw~
(c) cardinality/keâeef[&veefuešer (d) //This is the right way to add a comment.///
(d) More than one of the above/GheÙeg&òeâ ceW mes Skeâ mes efšhheCeer peesÌ[ves keâe mener lejerkeâe nw~
DeefOekeâ 38. Which of the following is a user defined data
32. Which of the following is not a valid aggregate type, which is used to represent a group of data
function?/ efvecveefueefKele ceW mes keâewve-mee JewOe items of different types under a single
aggregate function veneR nw? name?/______ Skeâ ØeÙeesòeâe heefjYeeef<ele [eše efkeâmce
(a) COUNT/efieveleer keâjvee (b) COMPUTE/ieCevee nw efpemekeâe ØeÙeesie Skeâ ner veece kesâ Debleie&le efJeefYevve
(c) SUM/peesÌ[ efkeâmceeW kesâ [eše ceoeW kesâ mecetn keâes efveoefMe&le keâjves kesâ
(d) More than one of the above/GheÙeg&òeâ ceW mes Skeâ
efueS efkeâÙee peelee nw
DeefOekeâ (a) Array/Ssjs (b) Structure/ mebjÛevee
33. In a relational database, what is a primary (c) Function/ hebâkeäMeve (d) Pointer/ hJeeFbšj
key?/efjuesMeveue [sšeyesme ceW ØeeLeefcekeâ kegbâpeer keäÙee nw? 39. What is a stack?/Skeâ mšwkeâ keäÙee nw?
(a) A key used to uniquely identify each record (a) A stack is a non-linear list in which insertion
in a table/efJeefMe<š henÛeeve kesâ efueS GheÙeesie keâer peeves and deletion takes place at the different ends /
mšwkeâ Skeâ iewj-jwefKekeâ metÛeer nw efpemeceW efJeefYeVe efmejeW hej
Jeeueer kegbâpeer leeefuekeâe ceW ØelÙeskeâ efjkeâe@[&
ØeJesMeve Deewj efJeueesheve neslee nw
(b) A key used to establish relationships between
(b) A stack is a non-linear list in which insertion
tables/mLeefhele keâjves kesâ efueS GheÙeesie keâer peeves Jeeueer
and deletion takes place at the one end
kegbâpeer leeefuekeâeDeeW kesâ yeerÛe mebyebOe Skeâ mšwkeâ Skeâ iewj-jwefKekeâ metÛeer nw efpemeceW ØeJesMeve Deewj
(c) A key used to sort records in a table/Skeâ kegbâpeer efJeueesheve Skeâ Deble ceW neslee nw~
efpemekeâe GheÙeesie efjkeâe@[&dme keâes mee@š& keâjves kesâ efueS efkeâÙee (c) A stack is a linear list in which insertion and
peelee nw deletion takes place at the one end
(d) More than one of the above/GheÙeg&òeâ ceW mes Skeâ mes Skeâ mšwkeâ Skeâ jwefKekeâ metÛeer nw efpemeceW ØeJesMeve Deewj
DeefOekeâ efJeueesheve Skeâ ner Deble ceW neslee nw
182 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
 (d) A stack in a linear list in which insertion and (a) Whole program
deletion takes place at the different ends mechetCe& keâeÙe&›eâce oslee nw~
Skeâ mšwkeâ Skeâ jwefKekeâ metÛeer nw efpemeceW efJeefYeVe efmejeW hej (b) Only inside the {} block
ØeJesMeve Deewj efJeueesheve neslee nw kesâJeue {} yuee@keâ kesâ Devoj
40. Which of the following statements is TRUE (c) Inside the main function
with respect to differences between stacks and cegKÙe hebâkeäMeve kesâ Devoj
queues?/mšwkeâ Deewj keäÙet kesâ yeerÛe Deblej kesâ mebyebOe ceW (d) More than one of the above/GheÙeg&keäle ceW mes Skeâ mes
efvecveefueefKele ceW mes keâewve mee keâLeve mener nw? DeefOekeâ
(a) Queues use two ends of the structure but stacks 46. What happens if the following program is
use only one/keäÙet mebjÛevee kesâ oesveeW efmejeW keâe GheÙeesie executed in C and C++?
keâjles nQ uesefkeâve mšwkeâ kesâJeue Skeâ keâe GheÙeesie keâjles nQ Ùeefo efvecveefueefKele Øees«eece C Deewj C++ ceW efve<heeefole
(b) Queues require linked lists but stacks do efkeâÙee peeS, lees keäÙee neslee nw?
not/keäÙet keâes efuebkeä[ efuemš keâer DeeJeMÙekeâlee nesleer nw
#include<stdio.h>
hejvleg mšwkeâ keâes veneR int main(void)
(c) Stacks use two ends of the structure but queues {
use only one/mšwkeâ mebjÛevee kesâ oesveeW efmejeW keâe GheÙeesie int new=5;
keâjles nQ uesefkeâve keäÙet kesâJeue Skeâ keâe GheÙeesie keâjles nQ printf(„„%d‟‟, new);
(d) Stacks require linked lists but queues do }
not/mšwkeâ keâes efuebkeä[ efuemš keâer DeeJeMÙekeâlee nesleer nw (a) Error in C and successful execution in C++
hejvleg keäÙet keâes veneR (b) Error in both C and C++
41. C++ views each file as: (c) Error in C++ and successful execution in C
C++ ØelÙeskeâ heâeFue keâes Fme Øekeâej osKelee nw- (d) More than one of the above
(a) an array/Skeâ Ssjs GheÙeg&keäle ceW mes Skeâ mes DeefOekeâ
(b) a set of records/efjkeâe[& keâe Skeâ mesš 47. Write the output of the following program:/
(c) a sequential stream of bytes efvecveefueefKele Øees«eece keâe DeeGšhegš efueKeW :
yeeFšdme keâer Skeâ Deveg›eâefcekeâ Oeeje int a[] = {1, 2, 3} *p;
(d) a sequential linked list/Skeâ Deveg›eâefcekeâ efuebkeä[ metÛeer (a) Junk value/pebkeâ JewuÙet
42. Which of the following option handles memory (b) 3
management and security checks in .NET (c) Runtime error/jvešeFce $egefš
frame works?/.Net øesâceJeke&â ceW efvecveefueefKele ceW mes
(d) None of the above/GheÙeg&òeâ ceW mes keâesF& veneR
keâewve-mee efJekeâuhe cesceesjer ØeyebOeve Deewj efmekeäÙeesefjšer
48. What will be the output of the following C++
Ûeskeäme keâes mebYeeuelee nw? code?
(a) CTS (b) CLR efvecveefueefKele C++ keâes[ keâe DeeGšhegš keäÙee nesiee?
(c) CT (d) CLS
43. In Web Designing and Publishing, what does #include<iostream>
CSS stand for?/Jesye ef[peeFefvebie Deewj heefyueefMebie ceW using namespace std;
CSS keâe hetCe& ™he keäÙee nw? long factorial (long a)
{
(a) Cascading style systems/kewâmkesâef[bie mšeFue
if (a>1)
efmemšcme return (a * factorial (a+1));
(b) Cascading style sheets/kewâmkesâef[bie mšeFue Meeršdme else
(c) Colorful share sheets/keâuejHegâue MesÙej Meeršdme return(1);
(d) Colorful style systems/keâuejHegâue mšeFue efmemšcme }
44. In Angular JS, _____ module is used to int main( )
initialize an application with controllers? {
Angular JS ceW .......... cee@[Ÿetue keâe ØeÙeesie efveÙeb$ekeâ kesâ long num = 3;
meeLe efkeâmeer SefhuekesâMeve keâes ØeejcYe keâjves kesâ efueS cout <<num<<“!=”<<factorial
efkeâÙee peelee nw? (num);
(a) Controller/kebâš^esuej (b) Expression/SkeämeØesMeve return 0;
(c) Filter/efheâušj }
(d) Application/SefhuekesâMeve (a) 6
45. What is the scope of the variable declared in (b) 24
the user-defined function? (c) Segmentation fault/efJeYeepeve oes<e
GheÙeesiekeâlee& heefjYeeef<ele HebâkeäMeve ceW Ieesef<ele JesefjSyeue keâe (d) More than one of the above/GheÙeg&òeâ ceW mes Skeâ
oeÙeje keäÙee nw? DeefOekeâ
183 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
49. cout in C++ stands for Array, Ssjs keâes Ieesef<ele keâjles meceÙe cesceesjer DeeJebefšle
C++ ceW cout keâe ØeÙeesie efkeâmekesâ efueS neslee nw? keâjlee nw, peyeefkeâ efuebkeä[ metÛeer efuebkeä[ metÛeer ceW Sefuecesvš
(a) Class output (b) Character output keâes peesÌ[ves kesâ meceÙe cesceesjer DeeJebefšle keâjleer nw~
(c) Common outpur (c) Elements can be added to linked lists
(d) More than one of the above indefinitely, while an array will eventually get
GheÙeg&òeâ ceW mes Skeâ mes DeefOekeâ filled or will have to be resized./Sueercesvšdme keâes
50. Ada, BASIC Deewj C/C++ veecekeâ kebâhÙetšj keâer Yee<eeSB efuebkeâ keâer ieF& metefÛeÙeeW ceW Deefveef§ele keâeue lekeâ peesÌ[e pee
efvecveefueefKele ceW mes efkeâme ßesCeer mes mebyebefOele nQ? mekeâlee nw peyeefkeâ Skeâ meejCeer Deblele: Yej peeSieer Ùee
(a) Assembly languages/DemeWyueer ueQiJespe Gmekeâe Deekeâej yeouevee nesiee~
(b) machine languages/ceMeerve ueQiJespe (d) Arrays allow random access to the elements
(c) Functional languages/hebâkeäMeveue ueQiJespe contained within them, a linked list only allows
sequential access to its elements./mejefCeÙeeB Deheves
(d) Procedural languages/Øeesmeerpejue ueQiJespe
51. What is the most common use of 'Shift'
Yeerlej efveefnle Sefuecesvšdme lekeâ ÙeeÂefÛÚkeâ hengBÛe keâer Devegceefle
operation in assembly language programming? osleer nw, Skeâ efuebkeä[ metÛeer kesâJeue Fmekesâ Sueercesvšdme kesâ efueS
DemeWyeueer ueQiJespe Øees«eeefcebie ceW ‘Shift' Dee@hejsMeve keâe Deveg›eâefcekeâ hengBÛe keâer Devegceefle osleer nw~
meyemes Deece GheÙeesie keäÙee nw? 55. Which of the following programming
languages is used for client-side scripting in
(a) Multiply and divide/iegCee Deewj Yeeie keâjvee web programming?
(b) Create one's complement/Skeâ keâe hetjkeâ yeveevee Jesye Øees«eeefcebie ceW keäueeFbš-meeF[ efm›eâeEhšie (client-side
(c) Create two's complement/oes keâe hetjkeâ yeveevee scripting) kesâ efueS efvecve ceW mes keâewve-meer Øees«eeefcebie
(d) Add and subtract/peesÌ[s Deewj IešeSb ueQiJespe (Programming language) keâe GheÙeesie
52. What does a circle in flowchart indicate? efkeâÙee peelee nw?
heäueesÛeeš& ceW Skeâ Je=òe keäÙee oMee&lee nw? (a) JavaScript (b) JSP
(a) Process/Øeesmesme (b) Annotation/SveesšsMeve (c) ASP.NET (d) Python
(c) Connector/keâveskeäšj (d) Terminator/šefce&vesšj 56. Which of the looping statements is/are
53. Which of the following errors is called 'Linker supported by PHP?/uetefhebie mšsšceWš ceW mes keâewve-
Error'?/efvecveefueefKele ceW mes efkeâme $egefš keâes ‘efuebkeâj mee/mes PHP Éeje meceefLe&le nw/nQ?
$egefš’ keâne peelee nw? (i) for loop
(a) The program simply does not do what you (ii) while loop
want it to do. (iii) do-while loop
Øees«eece yeme Jen veneR keâjlee pees Deehe keâjvee Ûeenles nQ~ (iv) foreach loop
(b) It indicates something that must be fixed (a) (i) and (ii) (b) (i), (ii) and (iii)
before the code can be compiled. (c) (i), (ii), (iii) and (iv)
Ùen kegâÚ Ssmee Fbefiele keâjlee nw efpemes keâes[ mebkeâefuele keâjves (d) More than one of the above
mes henues leÙe efkeâÙee peevee ÛeeefnS~ 57. Which of the following is NOT a basic
operation performed on a data
(c) There is something wrong, but not something
that will prevent the code from being structure?/efvecveefueefKele ceW mes keâewve-mee [sše mebjÛevee
compiled/kegâÚ ieÌ[yeÌ[ nw, uesefkeâve Ssmee kegâÚ veneR nw hej efkeâÙee peeves Jeeuee cetue Dee@hejsMeve veneR nw?
pees keâes[ keâes mebkeâefuele nesves mes jeskesâ~ (a) Encryption/Seqv›eâhMeve (b) Deletion/efJeueesheve
(d) Code does not have syntax error, but that (c) Insertion/meeqcceueve
some function or library that is needed cannot (d) More than one of the above
be found./keâes[ ceW efmebšwkeäme Sjdj veneR neslee nw, uesefkeâve GheÙeg&òeâ ceW mes Skeâ mes DeefOekeâ
Ùen efkeâ kegâÚ hebâkeäMeve Ùee ueeFyeÇsjer keâer DeeJeMÙekeâlee nesleer 58. Program in execution is called
nw, Jen veneR efceue mekeâlee nw~ efve<heeove ceW Øees«eece keâes keâne peelee nw
54. With respect to linked lists and arrays, which (a) Function/HebâkeäMeve (b) Process/Øeesmesme
of the following statements is INCORRECT? (c) Compiler/kebâheeFuej (d) Error/Sjj
efuebkeä[ metefÛeÙeeW Deewj mejefCeÙeeW kesâ mecyevOe ceW, efvecveefueefKele ceW 59. Which was the first PC boot sector virus?
mes keâewve-mee keâLeve ieuele nw? efvecve ceW mes keâewve-mee ØeLece heermeer yetš meskeäšj JeeÙejme nw?
(a) Linked list is slower in add and remove, but
(a) Creeper/›eâerhej (b) Payload/hesuees[
faster in get/efuebkeâ keâer ieF& metÛeer peesÌ[ves Deewj Ieševes ceW
Oeerceer nw, uesefkeâve Øeehle keâjves ceW lespe nw~ (c) Bomb/yee@cye (d) Brain/yeÇsve
(b) Array allocates memory at the time of 60. A general term used to refer to virus, worms
declaring the array, while linked list allocates etc. is :
memory at the time of adding elements to the JeeÙejme Jeescme& Deeefo keâe mebkesâle keâjves kesâ efueS ØeÙegòeâ
linked list. nesves Jeeuee meeceevÙe heo nw :
184 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
 (a) Freeware/øeâerJesÙej (b) Spyware/mheeF&JesÙej 68. A/an _______ is required for booting a
(c) Scriptware/mke=âhšJesÙej (d) Malware/cewueJesÙej computer./keâchÙetšj keâer yetefšbie kesâ efueS FveceW mes
61. Which of the following is a computer utility efkeâmekeâer DeeJeMÙekeâlee nesleer nw?
programme?/efvecveefueefKele ceW mes keâewve mee Skeâ (a) Translator/š^ebmeuesšj
keâchÙetšj Ùetefšefuešer Øees«eece nw ? (b) Assembler/Demescyeuej
(a) Inventory control system/FvJeWšjer kebâš^esue efmemšce (c) Compiler/keâcheeFuej
(b) Shareware/MesÙejJesÙej (d) Operating system/Dee@hejsefšbie efmemšce
(c) Package software/hewkesâš mee@HeäšJesÙej 69. The simultaneously processing of two or more
(d) Disk defragmenter/ef[mkeâ ef[øewâie]ceWšj programs by multiple processors, is :
62. Skeâ ner [eše keâes keâF& peieneW hej mesJe (Save) keâjvee SkeâeefOekeâ Øeesmesmej Éeje oes Ùee oes mes DeefOekeâ Øees«eeceeW
keânueelee nw- keâe Skeâ meeLe ØemebmkeâjCe keâjvee _____ nw~
(a) FbšjwkeäMeve (b) kebâkeâjWmeer (a) Multiprogramming/ceušerØees«eeefcebie
(c) efj[v[svmeer (d) FvÙetcejsMeve (b) Multitasking/ceušeršeefmkebâie
63. Choose the compile-time error from the (c) Time sharing/šeFce MesÙeefjbie
following options-/efvecveefueefKele efJekeâuheeW ceW mes (d) Multiprocessing/ceušerØeesmesefmebie
keâcheeFue-šeFce $egefš ÛegefveS- 70. efvecveefueefKele ceW mes keâewve-mee/mes keâLeve DemelÙe nw/nQ?
(a) Logic error/uee@efpekeâ $egefš (i) BIOS Skeâ heâce&JesÙej nw~
(b) Syntax error/efmebšwkeäme $egefš (ii) kewâMe cesceesjer, GheÙeesefielee mee@heäšJesÙej keâe Skeâ
(c) Application error/ShueerkesâMeve $egeš f GoenjCe nw~
(d) Testing error/šsefmšbie $egefš (a) (i) Deewj (ii) oesveeW (b) ve lees (i) ve ner (ii)
64. efvecveefueefKele ceW mes keâewve mee Skeâ Fbšjceeref[Sš efmemšce (c) kesâJeue (i) (d) kesâJeue (ii)
mee@HeäšJesÙej nw efpevekesâ ceeOÙece mes Øees«eecej GÛÛe-mlejerÙe 71. Moving data from one system buffer to the
ueQiJepe Øees«eeefcebie keâes[ (Language Programming process and reading data from the I/O device
to the other buffer may be performed
Code) keâes ceMeerve-mlejerÙe Yee<ee keâes[ ceW heefjJeefle&le
simultaneously in which of the following
keâjles nQ? buffering schemes?
(a) Firmwere/Heâce&JesÙej [sše keâes Skeâ efmemšce yeheâj mes Øeesmesme ceW ues peevee Deewj
(b) Device drivers/ef[JeeFme [^eFJeme& I/O ef[JeeFme mes otmejs yeheâj ceW Skeâ meeLe [sše heÌ{vee
(c) Utilities/Ùetefšefuešerpe efvecveefueefKele ceW mes efkeâme yeheâefjbie mkeâerce ceW efkeâÙee pee
(d) Language translator/ueQiJespe š^ebmeuesšj mekeâlee nw?
65. efuevekeäme Dee@hejsefšbie efmemšce mes mebyebefOele efvecveefueefKele ceW (a) Circular buffering/mekeg&âuej yeheâefjbie
mes keâewve-mee keâLeve ieuele nw? (b) User-level buffering/Ùetpej uesJeue yeheâefjbie
(i) Ùen Skeâ Deeshesve-meesme& Dee@hejsefšbie efmemšce nw~ (c) Double buffering/[yeue yeheâefjbie
(ii) Fmes ceušeršeefmkebâie Deewj ceušerÙetpej Dee@hejsefšbie (d) Single buffering/efmebieue yeheâefjbie
efmemšce oesveeW kesâ ™he ceW Jeieeake=âle efkeâÙee pee 72. Which one of the following is not a real time
operating system?
mekeâlee nw~ efvecveefueefKele ceW mes keâewve-mee Skeâ JeemleefJekeâ meceÙe
(a) (i) Deewj (ii) oesveeW (b) kesâJeue (i) Dee@hejseEšie efmemšce veneR nw?
(c) kesâJeue (ii) (a) RT Linux (b) Palm OS
(d) ve lees (i) Deewj ve ner (ii) (c) VxWorks
66. BIOS which is a part of operating systems of (d) More than one of the above
PC is stored in :/BIOS pees heermeer kesâ Dee@hejseEšie 73. Which of the following system softwares resides
efmemšce keâe Skeâ efnmmee nw, efkeâmeceW meb«eefnle nw– always in main memory?
efvecveebefkeâle ceW mes keâewve-mee efmemšce mee@heäšJesÙej, cesve
(a) RAM/jwce
cesceesjer ceW ncesMee jnlee nw?
(b) Hard Disk/ne[& ef[mkeâ
(a) Loader/uees[j (b) Linker/efuebkeâj
(c) Cache memory/kewâMe cesceesjer
(c) Assembler/Smescyeuej
(d) ROM/jesce
(d) More than one of the above/GheÙeg&òeâ ceW mes Skeâ mes
67. Operating System based on Linux are
DeefOekeâ
efuevekeäme hej DeeOeeefjle Dee@hejsefšbie efmemšce nw:-
74. What type of scheduling is round-robin
(a) Debian/[sefyeÙeve (b) Fedora/hesâ[esje scheduling?
(c) Ubuntu/Gyevleg (d) All of these/Ùes meYeer jeGb[-je@efyeve Mes[Ÿetefuebie efkeâme Øekeâej keâer Mes[Ÿetefuebie nw?
185 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
 (a) Preemptive scheduling/ØeerSefchšJe Mes[Ÿetefuebie 80. The system bus is separated into three
(b) Linear data scheduling/ueerefveÙej [sše Mes[Ÿetefuebie functional groups. Choose the most
appropriate option from the following:
(c) Non-linear data scheduling/vee@ve-ueerefveÙej [sše efmemšce yeme keâes leerve keâeÙee&lcekeâ mecetneW ceW efJeYeeefpele efkeâÙee
Mes[Ÿetefuebie ieÙee nw~ efvecveefueefKele ceW mes meyemes GefÛele efJekeâuhe Ûegevf eS~
(d) Non-preemptive scheduling
(a) Data bus, Address bus and Control bus
/vee@ve-ØeerSefchšJe Mes[Ÿetefuebie
[sše yeme, S[^sme yeme Deewj kebâš^esue yeme
75. Which of the given options best describes the
(b) Star bus, Mesh bus and Data Bus
truthfulness of the following statements?/
efvecveefueefKele ceW mes keâewve-mee efJekeâuhe efvecveefueefKele mšej yeme, cesMe yeme Deewj [sše yeme
(c) Control bus, Data bus and Star bus
keâLeveeW keâer melÙelee keâe meyemes DeÛÚe JeCe&ve keâjlee nw-
kebâš^esue yeme, [sše yeme Deewj mšej yeme
(i) In 1-bit images, each pixel is stored as a
single byte./ efyeš Fcespesme ceW, ØelÙeskeâ efhekeämesue (d) Address bus, Star bus and Mesh bus
keâes Skeâ yeeFš kesâ ™he ceW meb«eefnle efkeâÙee peelee nw~ S[^sme yeme, mšej yeme Deewj cesMe yeme
81. pees Øeesmesmej Deewj DevÙe GhekeâjCeeW kesâ yeerÛe kebâš^eus e efmeiveueeW
(ii) A 1-bit image with resolution 640×480
needs a storage space of 640 + 480 bits./ keâes Øeehle keâjves kesâ efueS GheÙeesie efkeâÙee peelee nw?
640×480 efjpee@uÙetMeve Jeeueer 1-efyeš Fcespe kesâ (a) LCD (b) Joystick
efueS 640×480 efyešdme keâes mšesjspe mhesme keâer (c) MICR (d) Control Bus
82. ALU Deece leewj hej mebkeâeÙeeX (operands) Deewj
DeeJeMÙekeâlee nesleer nw~
(a) (i) - False, (ii) - True (b)(i) - True, (ii) - False heefjCeeceeW keâes mšesj keâjves kesâ efueS Skeâ mebÛeeÙekeâ
(c) (i) - True, (ii) - True (d)(i) - False, (ii) - False (accumulator) keâe GheÙeesie keâjlee nw~ efvecveefueefKele ceW
76. Which of the following looks like an upside- mes keâewve-mee efJekeâuhe mebÛeeÙekeâ keâe mener JeCe&ve keâjlee nw?
down mouse that requires the ball to be rotated (a) jefpemšj (b) cegKÙe cesceesjer
manually with a finger for moving the cursor (c) Øee@mesefmebie Ùetefveš (d) efÉleerÙekeâ cesceesjer
on the computer screen?/efvecveefueefKele ceW mes keäÙee
83. The register that contains the instruction that
Skeâ Gušs ceeGme pewmee efoKelee nw, efpemeceW ueieer yee@ue keâes is being executed is called./SefkeäpekeäÙetš nes jns
Gbieueer mes Iegceekeâj keâme&j keâes kebâhÙetšj m›eâerve hej FOej- Fvmeš^keäMeve keâes jKeves Jeeues jefpemšj keâes keâne peelee nw
GOej IegceeÙee pee mekeâlee nw? (a) accumulator/SkeäÙetceguesšj
(a) Digitiser/ef[efpešeF]pej (b) Light pen/ueeFš hesve (b) program counter/Øees«eece keâeGvšj
(c) Joystick/pee@Ùeefmškeâ (d) Trackball/š^wkeâyee@ue (c) instruction register/Fvmeš^keäMeve jefpemšj
77. ke=âef$ece %eeve efvecveefueefKele ceW mes efkeâmekesâ efueS efJe%eeve (d) More than one of the above/GheÙeg&òeâ ceW mes Skeâ mes
leb$e FbpeerefveÙeefjbie nw? DeefOekeâ
(A) yegefæceòeehetCe& ceMeerveW yeveeves kesâ efueS 84. This bus usually a set of wires that links the
(B) ceeveJe keâer lejn meesÛeves Jeeues keâchÙetšj yeveeves kesâ efueS CPU to the RAM (and to other places). If the
efvecveefueefKele ceW mes keâewve-mee efJekeâuhe mener nw? CPU want to fetch an instruction from a
(a) (A) leLee (B) ceW mes keâesF& veneR particular location in RAM, or want to write
piece of data to a particular location in RAM, it
(b) kesâJeue (A) put the specific location details on this bus.
(c) kesâJeue (B) keâewve-meer yeme (bus) meeceevÙele: leejeW keâes Skeâ mesš nesleer nw
(d) (A) leLee (B) oesveeW pees meerheerÙet (CPU) keâes jwce (RAM) (Deewj DevÙe mLeeveeW)
78. In 1950,____ a mathematician and a computing mes pees[
Ì leer nw? Ùeefo meerheerÙet (CPU) keâes jwce (RAM) ceW
pioneer, proposed the "Imitation test".
1950 ceW, Skeâ ieefCele%e Deewj keâbhÙetefšbie De«eCeer, efkeâmeer efJeMes<e mLeeve mes Skeâ efveoxMe Øeehle keâjvee nw, Ùee jwce
_______ ves “FefcešsMeve šsmš” keâe Øemleeke jKee~ (RAM) ceW efkeâmeer efJeMes<e mLeeve mes Skeâ efveoxMe Øeehle
(a) Alan Turing/Sueve šŸetefjbie
keâjvee nw, Ùee jwce (RAM) ceW efkeâmeer efJeMes<e mLeeve hej keâesF&
(b) Geoffrey Hinton/pÙeesøeâer efnbšve
[sše jeF&š keâjvee nw, lees Ùen Fme yeme (bus) hej efJeefMe°
(c) Tim Berners-Lee/efšce yeve&me&-ueer
mLeeve efJeJejCe Øeoeve efkeâÙee peelee nw~
(d) Vint Cerf/efJebš mehe&â (a) Control Bus/kebâš^esue yeme
79. Which device is a microprocessor based (b) Communication Bus/keâcÙegefvekesâMeve yeme
computing device ? (c) Data Bus/[sše yeme
keâewve-mee GhekeâjCe Skeâ ceeF›eâesØeesmesmej DeeOeeefjle (d) Address Bus/S[^sme yeme
DeefYekeâueve GhekeâjCe nw ? 85. What does CMOS stand for?
(a) Personal Computing/JÙeefòeâiele DeefYekeâueve (heme&veue CMOS keâe hetje veece keäÙee nw?
keâchÙetefšbie) (a) Core Memory Oriented Semiconductor
(b) Mainframe/cesveøesâce keâesj cesceesjer DeesefjSbšs[ mesceer kebâ[keäšj
(c) Workstation/Jeke&âmšsMeve (b) Core Memory Offset Semiconductor
(d) Server/meJe&j keâesj cesceesjer Dee@heâmesš mesceer kebâ[keäšj
186 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
 (c) Capacitive Metal Oxidised Semiconductor (a) Dee@hejsefšbie efmemšce (b) ef[JeeFme [^eFJej
kewâhesefmeefšJe cesšue Dee@keämeerke=âle mesceer kebâ[keäšj (c) ueQiJespe š^ebmeuesšj (d) heâce&JesÙej
(d) Complementary Metal Oxide Semiconductor 93. Which of the following natural elements is the
hetjkeâ Oeeleg Dee@keämeeF[ mesceer kebâ[keäšj primary element in computer chips?
86. To transfer data between internal storage efvecveefueefKele ceW mes keâewve-mee Øeeke=âeflekeâ leòJe, keâchÙetšj
peripheral devices of computer, CPU uses efÛehme ceW ØeeLeefcekeâ leòJe nw?
keâchÙetšj kesâ Fbšve&ue mšesjspe mes hesefjHesâjue ef[JeeFme ceW [sše kesâ (a) Carbon (b) Silicon
nmleeblejCe kesâ efueS, CPU efkeâmekeâe ØeÙeesie keâjlee nw? (c) Iron
(d) More than one of the above/GheÙeg&òeâ ceW mes Skeâ DeefOekeâ
(a) Monitor/cee@efvešj (b) I/O port/ I/O heesš&
94. Find the logic equation for the truth table given:
(c) Processor/Øeesmesmej (d) Modem/cee@[ce efoS ieS šÍLe šsyeue kesâ efueS uee@efpekeâ FkeäsMeve KeespeW–
87. _____ is the process of dividing the disk into
A B Y
track and sector./ _____ , ef[mkeâ keâes š^wkeâ Deewj
0 0 0
meskeäšj ceW efJeYeepeve keâjves keâer Øeef›eâÙee nw~ 1 0 1
(a) Tracing / š^wefkebâie (b) Formatting/Heâecexefšbie 0 1 1
(c) Crashing /›ewâefMebie (d) Alotting /Sueesefšbie 1 1 0
88. In a system with a page size of 4 KB and a (a) Y A B * A B (b) Y A B * A B
physical address space of 64 GB, what is the
(c) Y A B A B (d) Y A B A B
number of bits required for the page offset?/4
95. The dual of a Boolean expression is obtained
KB he=<" Deekeâej Deewj 64 GB Yeeweflekeâ helee mLeeve Jeeues
by:/yetefueÙeve DeefYeJÙeefkeäle keâe Éwle efkeâmekesâ Éeje Øeehle
efmemšce ceW, he=<" Dee@Heâmesš kesâ efueS DeeJeMÙekeâ efyešdme keâer efkeâÙee peelee nw?
mebKÙee keäÙee nw? (a) Interchanging all 0s and 1s
(a) 10 bits/10 efyešdme (b) 12 bits/12 efyešdme (b) Interchanging all 0s and 1s, all + and ‘.’ signs
(c) 14 bits/14 efyešdme (c) Interchanging all 0s and 1s, all + and ‘.’ signs
(d) More than one of the above/GheÙeg&òeâ ceW mes Skeâ mes and complementing all the variables
(d) More than one of the above/GheÙeg&keäle ceW mes Skeâ mes DeefOekeâ
DeefOekeâ 96. The Boolean expression x(x + y) is equal to
89. Which of the following registers is used for yetefueÙeve SkeämeØesMeve x(x + y) yejeyej nw
storage of data, either coming to the CPU or
(a) x (b) y (c) xy
data being transferred by the CPU?/efvecveefueefKele
(d) More than one of the above/GheÙeg&òeâ ceW mes Skeâ mes
ceW mes keâewve-mee jefpemšj [sše kesâ Yeb[ejCe kesâ efueS DeefOekeâ
GheÙeesie efkeâÙee peelee nw Ùee meerheerÙet ceW Dee jne nw Ùee [sše 97. Skeâ NOR iesš yeyyeu[ AND kesâ meceguÙe neslee nw~ Ùen
meerheerÙet Éeje mLeeveevleefjle efkeâÙee pee jne nw? keâLeve efvecve keâe heefjCeece nw~
(a) Program counter (a) [er ceesie&ve efJeefOe (b) OeelekeâjCe efJeefOe
(b) Memory Buffer register
(c) DeJeMees<eCe keâer efJeefOe (d) Jeie&mece efJeefOe
(c) Memory Address register
98. The main function of NOT gate is to:
(d) Accumulator
90. The process of mapping of logical addresses to
‘vee@š (NOT) iesš’ Skeâ ØecegKe keâeÙe& nw:
real physical addresses is known as:/JeemleefJekeâ (a) Stop signal/mebkesâle yeeefOele
(b) Invert input signal/FveJeš& Fvehegš efmeiveue
Yeeweflekeâ heleeW kesâ efueS leeefke&âkeâ helees kesâ ceeveefÛe$eCe keâer
(c) Act as universal gate/JewefÕekeâ iesš ™he ceW keâeÙe&
Øeef›eâÙee kesâ ™he ceW peevee peelee nw- (d) Half input signal/DeeOee Fvehegš efmeiveue
(a) address space identification/S[^sme mLeeve henÛeeve 99. Which of the following is error detection code
(b) addressing modes/S[^sefmebie cees[ used in digital logic?/efvecveefueefKele ceW mes keâewve-mee
(c) address binding/S[^sme yeeFbef[bie ef[efpešue uee@efpekeâ ceW ØeÙegòeâ $egefš henÛeeve keâes[ nw?
(d) address scheme/S[^sme mkeâerce (a) Hamming code/nweEceie keâes[
91. Which of the following is NOT a characteristic of (b) Cyclic redundancy check (CRC)/Ûe›eâerÙe Deeflejskeâ
RAM?/efvecve cebs mes keâewve-meer jwce keâer efJeMes<elee veneR nw? peeBÛe (meerDeejmeer)
(a) Faster/lespe (b) Expensive/cenbiee (c) Checksum Ûeskeâmece
(d) More than one of the above/GheÙeg&òeâ ceW mes Skeâ mes
(c) High power consumption/GÛÛe efyepeueer Kehele
DeefOekeâ
(d) Smaller/Úesše
100. 15th complements of hexadecimal number
92. efvecveefueefKele ceW mes keâewve mee efmemšce mee@heäšJesÙej heäuewMe (A01)16 is :/<ees[Me DeeOeejer (nskeämee[sefmeceue) mebKÙee
[^eFJe, ROM Ùee EPROM hej meb«enerle Skeâ (A01)16 keâe 15Jeeb hetjkeâ nw :
Dee@hejsMeveue mee@heäšJesÙej nw Deewj Fmes OS Éeje henÛeevee (a) (5F0)16 (b) (6EE)16
pee mekeâlee nw? (c) (6E0)16 (d) (5FE)16

187 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
 SOLUTION : PRACTICE SET- 6
ANSWER KEY
1. (d) 11. (c) 21. (a) 31. (b) 41. (c) 51. (a) 61. (d) 71. (c) 81. (d) 91. (d)
2. (d) 12. (d) 22. (c) 32. (b) 42. (b) 52. (c) 62. (c) 72. (b) 82. (a) 92. (d)
3. (a) 13. (b) 23. (d) 33. (a) 43. (b) 53. (d) 63. (b) 73. (a) 83. (c) 93. (b)
4. (c) 14. (c) 24. (a) 34. (b) 44. (d) 54. (a) 64. (d) 74. (a) 84. (d) 94. (c)
5. (d) 15. (a) 25. (b) 35. (b) 45. (b) 55. (a) 65. (d) 75. (d) 85. (d) 95. (b)
6. (d) 16. (a) 26. (c) 36. (b) 46. (c) 56. (c) 66. (d) 76. (d) 86. (b) 96. (a)
7. (b) 17. (c) 27. (d) 37. (a) 47. (d) 57. (a) 67. (d) 77. (d) 87. (b) 97. (a)
8. (b) 18. (d) 28. (d) 38. (b) 48. (c) 58. (b) 68. (d) 78. (a) 88. (b) 98. (b)
9. (c) 19. (d) 29. (d) 39. (c) 49. (b) 59. (d) 69. (d) 79. (a) 89. (b) 99. (d)
10. (d) 20. (c) 30. (b) 40. (a) 50. (d) 60. (d) 70. (d) 80. (a) 90. (c) 100. (d)
SOLUTION
1. (d) (iii) hegMe hegue cee@[ue
kesâme DeeOeeefjle efMe#ee (meeryeerSue) Skeâ mLeeefhele Âef°keâesCe nw efpemekeâe (iv) SkeämekeäuetefmeJe hesÙej cee@[ue
GheÙeesie Gve efJe<eÙeeW ceW efkeâÙee peelee nw peneB Úe$e Deheves %eeve keâes 7. (b)
JeemleefJekeâ ogefveÙee kesâ heefjÂMÙeeW ceW ueeiet keâjles nw, GÛÛe mlej keâer MANAV Yeejle keâe henuee 3D efØebšs[ åÙetcevee@F[ jesyeesš nw~
DevegYetefle keâes yeÌ{eJee osles nQ~ kesâ efvekeâšlece heÌ[esmeer Skeâ mejue Fmekeâe DeeefJe<keâej A-SET š^sefvebie Sb[ efjmeÛe& FbmšeršŸetš kesâ efoJeekeâj
SuieesefjLece nw pees meYeer GheueyOe ceeceueeW keâes meb«enerle keâjlee nw Deewj JewMe Éeje efomecyej 2014 ceW efkeâÙee ieÙee Lee~
meceevelee ceehe kesâ DeeOeej hej veS [sše Ùee ceeceues keâes Jeieeake=âle keâjlee 8. (b)
nw~ Fmekeâe GheÙeesie pÙeeoelej [sše efyebog keâes Jeieeake=âle keâjves kesâ efueS IoT GhekeâjCeeW ceW JeeÙejuesme mebÛeej kesâ efueS Deeceleewj hej yuetštLe
efkeâÙee peelee nw, Fme DeeOeej hej efkeâ Gmekesâ heÌ[esefmeÙeeW keâes kewâmes lekeâveerkeâ keâe GheÙeesie efkeâÙee peelee nw~ yuetštLe yesleej (JeeÙejuesme) mebÛeej
Jeieeake=âle efkeâÙee peelee nw~ kesâ efueÙes Skeâ Øeesšeskeâe@ue nw~
2. (d) 9. (c)
Øeesuee@ie Skeâ leeefke&âkeâ Øees«eeefcebie Yee<ee nw efpemekeâe GheÙeesie ÿetcevee@F[dme jesyeesš Ssmes jesyeesš nesles nQ efpevnW ceeveJe ™he Deewj JÙeJenej
Deeefš&efheâefmeÙeue FbšsefuepeWme Deewj keâchÙetšsMeveue Yee<ee efJe%eeve kesâ efueS kesâ meceeve Deewj vekeâue keâjves kesâ efueS ef[peeFve efkeâÙee ieÙee nw~ Gvekesâ
efkeâÙee peelee nw~ Fmekesâ DevegØeÙeesieeW ceW Øeeke=âeflekeâ Yee<ee keâer mecePe Deewj heeme Deeceleewj hej Skeâ OeÌ[, Skeâ efmej oes neLe Deewj oes hewj nesles nw,
efJeMes<e%e ØeCeeueer pewmes MYCIN Meeefceue nw~ Deewj Jes ceveg<ÙeeW kesâ meceeve keâeÙe& Deewj ieefleefJeefOeÙeeB keâjves ceW me#ece nesles
3. (a) nQ~ Fve jesyeesšeW keâe GheÙeesie Dekeämej DevegmebOeeve, ceveesjbpeve Deewj mesJee
yuee@keâÛesve lekeâveerkeâ Skeâ efJekesâvõerkeâjCe (Decentralization) uespej nw
DevegØeÙeesieeW ceW ceveg<ÙeeW kesâ meeLe yeeleÛeerle keâjves Deewj peefšue keâeÙe& keâjves
pees [sše keâes megjef#ele lejerkesâ mes mšesj keâjlee nw~ FmeceW yuee@keäme keâe
kesâ efueS efkeâÙee peelee nw~
Skeâ Ûesve neslee nw efpemeceW [sše kesâ š^ebpewkeäMeve keâes ef›eâhšes«eeefheâkeâ nwMe
10. (d)
kesâ peefjS mebueive efkeâÙee peelee nw~ yuee@keâÛesve ef›eâhšeskeâjWmeer pewmes efJeefYeVe
HTML šwie <nav> yeenjer (iewj-HTML) SefhuekesâMeve kesâ efueS
#es$ees ceW Fmlesceeue nes jne nw~
Skeâ keâbšsvej efveefo<& š keâjlee nw~ Ùen Skeâ vesefkeiesMeve yeej keâes Yeer
4. (c)
IoTWF Deeefke&âšskeäÛejue meefceefle ves 2014 ceW 7-uesÙej IoT
heefjYeeef<ele keâjlee nw efpemeceW cesvet keâe Skeâ mesš Ùee neFhejefuebkeâ keâe cesvet
Deeefke&âšskeäÛejue jsheâjWme cee@[ue ØekeâeefMele efkeâÙee~ ef veefnle neslee nw~ Fme neFhejefuebkeâ keâes vesefkeiesMeve efuebkeâ Yeer keâne peelee
5. (d)
nw ~
keâce otjer kesâ mebÛeej kesâ efueS IoT GhekeâjCeeW ceW Deeceleewj hej yuetštLe, 11. (c)
JeeF&-HeâeF&, Deewj peerieyeer Deeefo keâe GheÙeesie efkeâÙee peelee nw~ Skeâ efyeš Øeefle efhekeämesue Jeeues yuewkeâ Sb[ JneFš efmemšce hej øesâce yeheâj
6. (d) keâes Deeceleewj hej efyešcewhe kesâ ™he ceW peevee peelee nw~
IoT mebÛeej cee@[ue Jen lejerkeâe nw efpememes loT GhekeâjCe Skeâ otmejs mes 12. (d)
[sše keâe Deeoeve-Øeoeve keâjles nw~ loT mebÛeej cee@[ue efJeefYeVe hejleeW TIFF – šwie Fcespe heâeFue heâe@cexš keâe mebef#ehle ™he nw~
Deewj Øeesšeskeâe@ume hej DeeOeeefjle neslee nw pees Ùen megefveef§ele keâjlee nw efkeâ gif – «eeefheâkeäme FbšjÛeWpe heâe@cexš keâe mebef#ehle ™he nw~
Deueie-Deueie ef[JeeFme Skeâ otmejs kesâ meeLe megjef#ele Deewj ØeYeeJeer ™he Jpeg – pJeeFbš heâesšes«eeefheâkeâ Skeämeheš& keâe mebef#ehle ™he nw~
mes mebJeeo keâj mekesâ~ ØecegKe loT mebÛeej cee@[ue efvecve nw– Mpeg – cegefJebie efhekeäÛej Skeämeheš& «eghe keâe mebef#ehle ™he nw
(i) efjkeäJesmš efjmheebme cee@[ue Ùen Skeâ Dee@ef[Ùees efJeef[ÙeeW heâeFue nw~
(ii) heefyueMe meyme›eâeFye cee@[ue DeLee&le Mpeg Skeâ Fcespe heâeFue veneR nw~
188 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
13. (b) USB drive- USB [^eFJe [sše mšesj keâjves kesâ efueS GheÙeesie efkeâÙee
ef[efpešue efmeivesÛej Skeâ Fueskeäš^e@efvekeâ Øeef›eâÙee nw efpemekeâe GheÙeesie peeves Jeeuee Skeâ ef[JeeFme nw efpemeceW heäuewMe cesceesjer Deewj Skeâ Skeâerke=âle
ef[efpešue omleeJespe, F&cesue, mebosMe Ùee uesve-osve keâes melÙeeefhele Deewj ÙetefveJeme&ue meerefjÙeue yeme (USB) Fbšjhesâme Meeefceue nw~ DeefOekeâebMe
ceevÙe keâjves kesâ efueS efkeâÙee peelee nw~ F&-ieJeveXme ceW ef[efpešue USB HeäuewMe [^eFJe nševes ÙeesiÙe Deewj hegve: efueKeves ÙeesiÙe nesleer nw~
omleeJespeeW keâer megj#ee Deewj ØeeceeefCekeâlee megefveef§ele keâjves kesâ efueS Yeer Ùen Úesšer, efškeâeT Deewj efJeÕemeveerÙe nesleer nw~ Fvekeâe meb«enCe mLeeve
Fme lekeâveerkeâ keâe GheÙeesie efkeâÙee peelee nw~ efpelevee yeÌ[e nesiee Jes Gleveer ner lespeer mes keâece keâjWies~
14. (c) 19. (d)
F&-keâe@ceme& (E-commerce) keâe celeueye nw ‘Fueskeäš^e@efvekeâ keâeceme&’~ TCP Skeâ keâveskeäMeve GvcegKe Øeesšeskeâe@ue nw, pees keâveskeäMeve mLeeefhele
Ùen Skeâ Ssmee ceeOÙece nw efpemeceW Fbšjvesš kesâ peefjS GlheeoeW Deewj keâjves kesâ efueS leerve lejHeâ nQ[Meskeâ keâe GheÙeesie keâjlee nw~ Ùen
mesJeeDeeW keâer Kejero Deewj efye›eâer keâer peeleer nw~ FmeceW Dee@veueeFve SefhuekesâMeve mes Skeâue mšerce kesâ ¤he ceW [sše Øeehle keâjlee nw, efpememes
huesšheâe@ce& keâe GheÙeesie efkeâÙee peelee nw, pewmes efkeâ JesyemeeFš, ceesyeeFue efJeMJemeveerÙe Deewj Dee@[&j keâer ieÙeer ef[ueerJejer megefveefMÛele nesleer nw~
Sshe Deewj meesMeue ceeref[Ùee~ FmeefueS Gòej ceW Skeâ mes DeefOekeâ efJekeâuhe mener nesiee~
15. (a) 20. (c)
Mee@š&keâš ‘keâer’ Gvekesâ keâeÙe& UDP Ùetpej [sše«eece Øeesšeskeâe@ue keâe mebef#ehle ™he nw Ùen Skeâ
Ctrl+T – yeÇeGpej hej Skeâ veÙee šwye Keesueves kesâ efueS keâveskeäMeveuesme keâcÙegefvekesâMeve Øeesšeskeâe@ue nw~
Ctrl+A – meYeer šskeämš keâes Skeâ meeLe mesueskeäš keâjves kesâ efueS 21. (a)
Ctrl+C – mesueskeäš efkeâÙes ngÙes šskeämš keâes keâe@heer keâjves kesâ efueS IMAP F&cesue meJe&j mes TCP/IP keâveskeäMeve kesâ ceeOÙece mes F&-cesue
Ctrl+Y – Deve[t (Undo) efkeâÙes šskeämš keâes ogyeeje ueeves kesâ efueS keâer hegve: Øeeefhle Deewj Yeb[ejCe kesâ efueS ØeÙeesie efkeâÙee peeves Jeeuee
Ctrl+O – henues mes yeveer HeâeFue keâes Deesheve keâjves kesâ efueS Øeesšeskeâe@ue nw~ Ùen OSI cee@[ue hej DeeOeeefjle ShueerkesâMeve uesÙej
Ctrl+S – HeâeFue keâes mesJe keâjves kesâ efueS Øeesšeskeâe@ue nw~
16. (a) 22. (c)
vesšJeke&â šesheesuee@peer Skeâ vesšJeke&â keâer efHeâefpekeâue Deewj uee@efpekeâue Signal power (efmeiveue heeJej), ef[efpešue keâcÙegefvekesâMeve efmemšce ceW
mš^keäÛej keâes oMee&leer nw, efpemeceW vesšJeke&â kesâ ef[JeeFme Deewj Gvekesâ vee@Fpe ØeeflejesOekeâ #ecelee keâes yeÌ{eves kesâ efueS efmeiveue keâer heeJej keâes
FbšjkeâveskeäMeve kewâmes nesles nQ~ Ùen šesheesuee@peer vesšJeke&â ceW [sše keâer Heäuees yeÌ{evee DeeJeMÙekeâ nw~ Skeâ efveef§ele mlej keâer efve‰e (Fidelity) Øeehle
Deewj keâcÙegefvekesâMeve kesâ hewšve& keâes heefjYeeef<ele keâjleer nw Deewj megefveef§ele keâjves kesâ efueS efmeiveue keâer Meefòeâ keâes yeÌ{eÙee peevee ÛeeefnS, Ùen
keâjves ceW ceoo keâjleer nw efkeâ [sše kewâmes Øesef<ele Deewj Øeehle nesiee~ kegâÚ efJeMes<e Øekeâej kesâ cee@[ŸetuesMeve hej efveYe&j keâjlee nw~
ØecegKe šesheesuee@peer pewmes mšej, yeme, efjbie Deewj cesMe šesheesuee@peer Deeefo 23. (d)
nw~ peyeefkeâ Peer-to-Peer Skeâ Øeesšeskeâe@ue nw~ jeGšj Éeje jeGefšbie šsyeue kesâ ceeOÙece mes [sše hewkesâš keâes Gvekesâ
17. (c) FefÛÚle DeeF&heer heles hej De«esef<ele keâjves, vesšJekeâeX kesâ yeerÛe š^wefheâkeâ
heer.meer.DeeF&. SkeämeØesme Skeâ ceevekeâ DeeOeeefjle, hee@Fbš-št-hee@Fbš, ØeyebOeve, keâF& GhekeâjCeeW keâes Skeâ ner Fbšjvesš keâveskeäMeve keâe Devegceefle
meerefjÙeue Fbšjkeâveskeäš nw efpemekeâe GheÙeesie hetjs keâchÙetefšbie Deewj Scyes[s[ osves kesâ efueS efkeâÙee peelee nw~
ef[JeeFme GÅeesieeW ceW efkeâÙee peelee nw~ efpemes 2004 ceW hesMe efkeâÙee ieÙee~ 24. (a)
PCIe keâes PCI-SIG Éeje ØeyebefOele efkeâÙee peelee nw~ PCIe efvecve FbšjØeesmesme mebÛeej Dee@hejsefšbie Éeje Øeoeve efkeâÙee ieÙee leb$e nw pees
keâeÙe& keâjles ceW me#ece nw~ Øeef›eâÙeeDeeW keâes Skeâ-otmejs kesâ meeLe mebJeeo keâjves keâer Devegceefle oslee nw
1. Deblej peesÌ[er Fbšjkeâveskeäš kesâ Skeâ mes 32 uesve keâe GheÙeesie keâjkesâ Fmekes â ceeOÙece mes mebmeeOeveeW lekeâ hengbÛe Øeehle keâj mekeâles nw meeLe ner
mkesâuesyeue, Skeâ meeLe, efÉ-efoMeelcekeâ mLeeveevlejCe~ [s š e meePee keâj mekeâles nQ~
2. GÛÛe DeblejCe oj Øeehle keâjves kesâ efueS uesve keâes mecetnerke=âle keâjvee, 25. (b)
pewmes keâer «eeefheâkeäme S[shšj kesâ meeLe~ DNS keâe hetje veece 'Domain Name System' neslee nw~ Ùen
3. heer.meer.DeeF&. SkeämeØesme 3.0 kesâ meeLe *16 keâveskeäšj hej 32
[es cesve vesce keâes DeeF&heer S[^sme ceW heefjJeefle&le keâjlee nw~
peer.yeer./Sme lekeâ efÉ-efoMeelcekeâ JeQ[efJe[dLe~ OSI cee@[ue keâe hetje veece 'Open System Inter connection'
4. uees-DeesJejns[, uees-uesšWmeer [sše š^ebmeheâj~
nes lee nw~ Fmes ISO ves 1984 ceW efJekeâefmele efkeâÙee Lee Deewj Fme cee@[ue
ceW 7 layers nesleer nw~
5. nesmš efveoxefMele Deewj hee@Fbš-št-hee@Fbš oesveeW mLeeveevlejCe~
(i) Physical layer
6. nesmš ®efšbie kesâ efyevee oes efyevogDeeW kesâ yeerÛe [sše Yespekeâj vesšJeke&â
(ii) Data link layer
JeeleeJejCe keâe DevegkeâjCe keâjvee~ (iii) Network layer
18. (d) (iv) Transport layer
GheÙe&gòeâ efJekeâuhe ceW NIC, Router Deewj Switch Skeâ kebâhÙetšj (v) Session layer
vesšJeefkeËâie ef[JeeFme nw peyeefkeâ USB drive Skeâ [sše mšesjspe (vi) Presentation layer
ef[JeeFme nw~ (vii) Application layer
189 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
Application layer ceW HTTP, FTP, SMTP, NFS pewmes 1. JeCe&veelcekeâ cesše[sše 2. mebjÛeveelcekeâ cesše[sše
Øeesšeskeâe@ue keâe ØeÙeesie efkeâÙee peelee nw~ DNS Fbšjvesš Deeefke&âšskeäÛej ceW 3. ØeMeemeefvekeâ cesše[sše 4. meboYe& cesše[sše
SefhuekesâMeve uesÙej Øeesšeskeâe@ue nw~ 5. meebefKÙekeâerÙe cesše[sše 6. keâevetveer cesše[sše
26. (c) 35. (b)
Cyber ethics (meeFyej veweflekeâlee) kebâhÙetšj mes mecyeefvOele ethics keâe nceWs 6 keâes 20 mes Yeeie osves hej Gmekesâ cee[Ùetue keâer ieCevee keâjveer nw~
Skeâ oeMe&evf ekeâ DeOÙeÙeve (Study) nw~ Ùen Users kesâ Behavior keâes cee[Ùetue Dee@hejsšj (%) efJeYeepeve Dee@hejsMeve keâe Mes<e ueewšeleer nw
keâJej keâjlee nw, leLee kebâhÙetšjeW keâes efkeâme keâece kesâ efueS Program FmeefueS 6 MOD 20, 6 kesâ yejeyej nw keäÙeeWefkeâ 6, 20 mes keâce nw
efkeâÙee ieÙee nw Deewj Ùen efkeâmeer meceepe Ùee JÙeefòeâ keâes kewâmes ØeYeeefJele Deewj 20 ceW meceeve ™he mes efJeYeeefpele veneR neslee nw~
keâjlee nw, Ùes meye FmeceW Meeefceue neslee nw~ 36. (b)
27. (d) XML keâe hetje veece–SkeämšWefmeyeue ceeke&âDehe ueQiJespe (Extensible
4peerSue ÛeewLeer heerÌ{er keâer Skeâ GÛÛe mlejerÙe keâchÙetšj Øees«eeefcebie Yee<ee
Markup Language) nw~ Ùen Skeâ šskeämš-DeeOeeefjle ceeke&âDehe Yee<ee nw
nw~ efpemekeâe GösMÙe ceMeerve Yee<eeDeeW keâes mejue keâjlee nw~ ÛeewLeer heerÌ{er
pees ceevekeâ meeceevÙeerke=âle ceeke&âDehe ueQiJespe (SGML) mes ueer ieF& nw~
keâer Yee<eeSB- SQL, Oracle, Informix 4ac nw~
XML šwie [sše keâer henÛeeve keâjles nw Deewj [sše keâes ØeoefMe&le keâjves kesâ
28. (d)
OQL (Dee@ypesefkeäšJe keäJesjer ueQiJespe) Skeâ Dee@ypeskeäš DeeOeeefjle cee@[ue
ef
ueS GheÙeesie efkeâS peeves Jeeues HTML šwie keâer lejn Fmes kewâmes ØeoefMe&le
ueQiJespe nw, pees keâchÙetšj keâer Deemeeveer mes GheÙeesie keâer peeves Jeeueer efkeâÙee peeS, Ùen efvee|o° keâjves kesâ yepeeÙe [sše keâes mšesj Deewj JÙeJeefmLele
Yee<ee nw~ keâjves kesâ efueS GheÙeesie efkeâÙee peelee nw~
29. (d) 37. (a)
ØeeLeefcekeâ kegbâpeer, efpemes ØeeLeefcekeâ keâer-Je[& keâne peelee nw~ Ùen efjuesMeveue Jeeryeer efm›eâhš yuee@keâ keâceWš keâe meceLe&ve veneR keâjlee nw~ ØelÙeskeâ hebefòeâ
[sšeyesme ceW Skeâ kegbâpeer nw pees ØelÙeskeâ efjkeâe[& kesâ efueS Ùetefvekeâ nw~ Ùen Ùee lees REM Ùee Sheesmš^e@heâer mes Meg® nesveer ÛeeefnS~
Skeâ Ùetefvekeâ identifier nw~ 38. (b)
30. (b) Skeâ mebjÛevee C/C++ ceW Skeâ ØeÙeesòeâe heefjYeeef<ele [eše šeFhe (User
[sšeyesme cegKÙe ®he mes meb«enerle [sše keâe ØeyebOeve Deewj nsjHesâj kesâ efueS define data type) nw, pees Skeâ Ssmeer [sše šeFhe yeveeleer nw efpemekeâe
yeveeÙee ieÙee nw, Deewj Jes Gme [sše keâer megj#ee kesâ efueS megj#ee megefJeOeeSb GheÙeesie Skeâ ner veece kesâ Debleie&le efJeefYevve šeFhe kesâ [sše kesâ mecetn keâes
Øeoeve keâjles nw~ peyeefkeâ keâes[ keâe efJeMues<eCe keâjvee Deeceleewj hej efveoxefMele keâjves kesâ efueS efkeâÙee peelee nw, peyeefkeâ Ssjs (DeeJÙetn) ceW
[sšeyesme keâe keâeÙe& veneR nw~ meceeve Øekeâej kesâ [sše ner mšesj nesles nw~
31. (b) mebjÛevee [sše šeFhe (Structure data type) ceW nce int, float,
efjuesMeveue [sšeyesme ceW efkeâmeer efj uesMeve kesâ Sefš^yÙetšdme keâer mebKÙee keâes char, string Deeefo meYeer Øekeâej kesâ [sše mecetn keâes mšesj keâj mekeâles
efjuesMeve keâe ef[«eer keâne peelee nw~ Fmes efjuesMeve keâer ef[«eer Yeer keâne nw~ Ùen struct keâer-Je[& keâe GheÙeesie keâjlee nw~
peelee nw pees Ùen yeleelee nw efkeâ efjuesMeve ceW efkeâleves Sefš^yÙetšdme nw~ struct variable_name
32. (b) {
Aggregate function [sšeyesme ceW [sše keâes meb«eefnle Deewj Øeesmesme char_name[10];
keâjves kesâ efueS GheÙeesie efkeâÙee peeves Jeeuee Skeâ Øekeâej keâe HebâkeäMeve neslee int pin;
nw~ Fmekeâe GheÙeesie efJeefYeVe Øekeâej kesâ [sše Øeesmesefmebie kesâ efueS efkeâÙee char city[50];
pee mekeâlee nw, pewmes efkeâ peevekeâejer keâes mebKÙeeDeeW kesâ meeLe peesÌ[vee, };
GÛÛelece Deewj vÙetvelece cetuÙe {t{vee, [sše keâer ieCevee keâjvee, FlÙeeefo~ 39. (c)
SQL ceW keâF& Øekeâej kesâ S«eeriesš HebâkeäMevme nesles nw, pewmes SUM, mšwkeâ Skeâ jwefKekeâ [sše mš^keäÛej nw pees Skeâ efJeMes<e ›eâce keâe heeueve
AVG, COUNT, MAX, MIN, Deeefo~ Dele: COMPUTE keâjleer nw efpemeceW Jen Dee@hejsMeve keâes hejheâece& keâjlee nQ Ùen LIFO
Skeâ JewOe S«eeriesš HebâkeäMeve veneR nw~ (ueemš Fve heâmš& DeeGš) Ùee FILO (heâmš& Fve ueemš DeeGš) kesâ
33. (a) efveÙece keâe heeueve keâjlee nw~
efjuesMeveue [sšeyesme ceW, ØeeLeefcekeâ kegbâpeer Jen ‘keâer’ nesleer nw efpemekeâe
GheÙeesie šsyeue ceW, ØelÙeskeâ efjkeâe@[& keâes efJeefMe° ™he mes henÛeeveves kesâ
efueS efkeâÙee peelee nw~
34. (b)
cesše [sše keâe DeLe& nw ``[sše kesâ yeejs ceW [sše''~ 40. (a)
cesše[sše keâes [sše kesâ Skeâ Ùee DeefOekeâ henuegDeeW kesâ yeejs ceW peevekeâejer keäÙet FIFO (heâmš& Fve heâmš& DeeGš) keâes heâe@uees keâjlee nw Ùen keäÙet
Øeoeve keâjves Jeeues [sše kesâ ¤he ceW heefjYeeef<ele efkeâÙee ieÙee nw~ Fmekeâe mebjÛevee kesâ oesveeW efmejeW keâe GheÙeesie keâjlee nw peyeefkeâ mšwkeâ LIFO
GheÙeesie [sše kesâ yeejs ceW yegefveÙeeoer peevekeâejer keâes meejebefMele keâjves kesâ (ueemš Fve heâmemš& DeeGš) keâes heâe@uees keâjlee nw Ùen kesâJeue Skeâ efmejs
efueS efkeâÙee peelee nw~ keâe GheÙeesie keâjlee nw~
190 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
41. (c) 47. (d)
C++ ØelÙeskeâ heâeFue keâes yeeFšdme keâer Deveg›eâefcekeâ Oeeje kesâ ™he ceW efoÙes ieÙes keâLeve ceW C++ ceW efmebšwkeäme keâer Âef° mes Deueie nQ Fmekeâe
osKelee nw~ mš^erce keäueeme kesâ Dee@ypeskeäš yeveekeâj heâeFueW Keespeer peeleer keâejCe Ùen nw:
nw~ mš^erce Dee@ypeskeäšdme kesâ meomÙe hebâkeäMeve heâeFue mš^erce hej ueeiet efkeâS int a[] {1, 2, 3}*p; Skeâ Ssjs a Deewj Skeâ hJee@Fbšj p Ieesef<ele keâjves
pee mekeâles nw~ istream, ostream Deewj iostream ›eâceMe: keâe ØeÙeeme keâj jne nw uesefkeâve Ùen Ssjs DeejcYeerkeâjCe keâes hJee@Fbšj
ifstream, ofstream Deewj fstream mes Øeehle nesles nw~ Iees<eCee kesâ meeLe Deueie lejerkesâ mes peesÌ[ jner nw~
42. (b) int a[]={1, 2, 3} leerve lelJeeW kesâ meeLe Skeâ Ssjs a DeejcYeerkeâjCe
CLR: CLR (Common Language Runtime) .NET Øees«eeceeW keâjlee nw 1,2 Deewj 3*p keâe GösMÙe Skeâ hJee@Fbšj Ieesef<ele keâjvee nw,
kesâ efve<heeove keâe ØeyebOeve keâjlee nw~ CLR cesceesjer ØeyebOeve, DeheJeeo uesefkeâve Fme meboYe& ceW Ssjs DeejcYeerkeâjCe kesâ yeeo *p keâe mLeeve
(exciption) nQ[efuebie, ef[yeefiebie, efmekeäÙeesefjšer Ûeskeäme, LeÇs[ efve<heeove, DeceevÙe nw~
keâes[ efve<heeove, keâes[ megj#ee JesefjefheâkesâMeve keâcheeFuesMeve Deeefo keâjlee efmebšwkeäme mecyevOeer mecemÙee kesâ keâejCe, Øees«eece mebkeâefuele veneR nesiee,
nw~ Deewj mebieueve meceÙe $egefš efceuesieer~ Ùeefo mener Øekeâej mes Ûegvevee nesiee~
43. (b) lees (e) FmeceW mes keâesF& veneR nesiee~
CSS keâe hetCe& ™he kewâmkesâef[bie mšeFue Meeršdme nw~ Ùen Skeâ Ssmeer 48. (c)
uewiJeWpe nw efpemekeâe GheÙeesie HTML pewmeer ceeke&âDehe uewiJeWpe ceW efueKes efoS ieS C++ kesâ keâes[ ceW HebâkeäMeve (a * factorial (a + 1) keâe
ieS [e@keäÙetceWš keâer ØespeWšsMeve keâe JeCe&ve keâjves kesâ efueS efkeâÙee peelee nw~ ØeÙeesie efkeâÙee ieÙee nw, Ùen meeFpe mes DeefOekeâ nesiee Deewj FmeefueS Fme
CSS keâe GheÙeesie HTML Sefuecesvš keâer DeheeaÙejWme keâes kebâš^esue keâjves keâes[ keâe DeeGšhegš efJeYeepeve oes<e (segmentation fault) DeeSiee~
kesâ efueS efkeâÙee peelee nw pewmes efkeâ- Heâe@vš, keâuej, meeFpe Deewj šskeämš Ùeefo efoS ieS keâes[ ceW mener HebâkeäMeve (a*factorial (a–1) keâe ØeÙeesie
keâe mhesme, hespe keâe yewkeâ«eeGb[ keâuej Deewj uesDeeGš~ efkeâÙee peelee nw, lees DeeGšhegš 3! = 6 DeeSiee~
44. (d) 49. (b)
Angular JS peeJeeefm›eâhš DeeOeeefjle Deesheve meesme& øebâš Sb[ Jesye C++ ceW cout keâe GheÙeesie m›eâerve hej DeeGšhegš ØeoefMe&le keâjves kesâ
øesâceJeke&â nw pees efmebieue hespe SefhuekesâMeve kesâ efueS [sJeuehe efkeâÙee ieÙee efueS efkeâÙee peelee nw~ cout ceW c keâe DeLe& kewâjskeäšj nw Deewj DeeGš keâe
Lee~ Angular JS cee@[Ÿetuej Âef°keâesCe keâe meceLe&ve keâjlee nw~ DeLe& DeeGšhegš nw~ Fme Øekeâej cout keâe leelheÙe& kewâjskeäšj DeeGšhegš mes
SefhuekesâMeve cee@[Ÿetue- kebâš^esuej kesâ meeLe Skeâ SefhuekesâMeve keâes nw~
FefveefMeÙeueeFpe keâjves kesâ efueS GheÙeesie neslee nw~ kebâš^esuej cee@[Ÿetue- 50. (d)
kebâš^esuej keâes heefjYeeef<ele (define) keâjves kesâ efueS efkeâÙee peelee nw~ Øeesefmepejue Øees«eeefcebie ueQiJeWpe Skeâ Jesue mš^keäÛe[& Øees«eeefcebie ueQiJespe neslee
45. (b) nw efpemeceW efkeâmeer Øees«eece keâes hetje keâjves kesâ efueS mšsšceWšdme, hebâkeäMeve
Ùetpeme& Éeje heefjYeeef<ele HebâkeäMeve ceW Ieesef<ele JesefjSyeue keâe oeÙeje Jen Deew j keâceeb[dme keâe JÙeJeefmLele ›eâce neslee nw~ C, C++, peeJee,
Yeeie nw, efpemeceW Ùen JesefjSyeue GheÙeesie ceW ueeF& pee mekeâleer nw~ Ùen heemkeâue, Ada, BASIC Deeefo Øees«eeefcebie ueQiJespe Fmekesâ GoenjCe nw~
oeÙeje JesefjSyeue kesâ veece kesâ meeLe Gmekesâ [sše kesâ Øekeâej pewmes– int, 51. (a)
DemeWyeueer ueQiJespe ceW 'Shift' Dee@hejsMeve keâe meyemes Deece GheÙeesie iegCee
float, char Deeefo keâes heefjYeeef<ele keâjlee nw~ Fme oeÙeje ceW JesefjSyeue
Deewj Yeeie keâjvee nw~
keâe Øemeej Deewj veece Meeefceue nesles nQ, pees HebâkeäMeve kesâ yee@[er kesâ Yeerlej
efMeheäš Dee@hejsšj keâe GheÙeesie leye efkeâÙee peelee nw peye Deehe ieefCeleerÙe
ner GheÙeesie efkeâS pee mekeâles nQ~ peye HebâkeäMeve keâes keâe@ue efkeâÙee peelee
mebÛeeueve kesâ efJehejerle leeefke&âkeâ efyešdme mebÛeeueve keâj jns nesles nw~ Fmekeâe
nw, lees Fme oeÙeje keâes JesefjSyeue HebâkeäMeve kesâ yee[er ceW hengBÛeleer nw Deewj GheÙeesie ieefle kesâ efueS efkeâÙee pee mekeâlee nw, oes keâer hee@Jej Jeeues
Gmekesâ GheÙeesie kesâ efueS GheueyOe nesleer nw~ Dee@hejW[ mes [erue keâjves kesâ oewjeve efJeYeepeve/iegCee keâjves kesâ efueS efkeâÙee
Skeâ GoenjCe mes mecePeeles nQ– peelee nw~
int calculate (int x, int y) 52. (c)
{ heäueesÛeeš& ceW Je=òe efÛevn keâes keâveskeäšj kesâ ™he ceW peevee peelee nw,
int result = ++ y; keâveskeäšj keâes heäueesÛeeš& kesâ Skeâ hespe keâes otmejs hespe mes peesÌ[ves kesâ efueS
return result; GheÙeesie efkeâÙee peelee nw~
} 53. (d)
ÙeneB x Deewj y JesefjSyeue calculate HebâkeäMeve kesâ hewjeceeršj nQ, peyeefkeâ Ùes $egefš leye nesleer nw peye mebkeâueve (compilation) kesâ yeeo nce Ctrl
result Skeâ Ieesef<ele JesefjSyeue nw efpemes HebâkeäMeve kesâ Yeerlej ner Ieesef<ele + F9 key (run) keâe GheÙeesie keâjkesâ efJeefYeVe Dee@ypeskeäš heâeFueeW keâes
efkeâÙee ieÙee nw~ cegKÙe Dee@ypeskeäš kesâ meeLe efuebkeâ keâjles nw~ Ùes leye GlheVe ngF& $egefšÙeeB nw
46. (c) peye Øees«eece keâe efve<heeove ÙeesiÙe pevejsš veneR efkeâÙee pee mekeâlee nw~ Ùen
GheÙeg&keäle Øees«eece C ceW Ùen mekeämesmeHegâue jve nesiee efpemeceW JewuÙet efØebš ieuele hebâkeäMeve ØeesšesšeFhe, ieuele ns[j heâeFueeW kesâ keâejCe nes
nesieer, peyeefkeâ C++ ceW kebâheeFue Sjj DeeSiee~ mekeâlee nw~
191 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
54. (a) 64. (d)
efuebkeä[ metÛeer Deewj Ssjs kesâ mecyevOe ceW mšsšceWš Skeâ ieuele nw keäÙeeWefkeâ š^ebmeuesšj Skeâ Øees«eeefcebie ueQiJespe Øeesmesmej nw pees Skeâ keâchÙetšj Øees«eece
efuebkeâ keâer ieF& metÛeer peesÌ[ves Deewj Ieševes ceW Oeerceer (slow) nw uesefkeâve keâes Skeâ ueQiJespe mes otmejer ueQiJespe ceW keâvJeš& keâjlee nw~ Ùen meesme&
Øeehle keâjves ceW lespe nw~ Øees«eece ceW efueKes ieS Øees«eece keâes ueslee nw Deewj Fmes ceMeerve Øees«eece ceW
55. (a) keâvJeš& keâjlee nw~
peeJee efm›eâhš Skeâ ØecegKe Jesye [sJeueheceWš Yee<ee nw efpemes Jesye yeÇeGpeme& pewmes - kebâheeFuej, FbšjØesšj, Demescyeuej~
ceW SkeäpeerkeäÙetš keâjves kesâ efueS ef[peeFve efkeâÙee ieÙee nw~ Ùen Skeâ 65. (d)
keäueeFvš meeF[ efm›eâefhšbie Yee<ee nw~ efuevekeäme Skeâ cegheä]le, Deeshesve meesme& Dee@hejsefšbie efmemšce nw, efpemes GNU
56. (c) pevejue heefyuekeâ ueeFmeWme (GPL) kesâ lenle peejer efkeâÙee ieÙee nw~
uethme (loops) keâe GheÙeesie keâes[ kesâ Skeâ ner yuee@keâ keâes yeej-yeej efuevekeäme Skeâ ceušer Dee@hejsefšbie efmemšce nw efpemekeâe DeLe& nw efkeâ
efve<heeefole keâjves kesâ efueS efkeâÙee peelee nw, peye lekeâ efkeâ Skeâ efveefMÛele SkeâeefOekeâ GheÙeesiekeâlee& Skeâ ner meceÙe ceW cesceesjer/jwce/ShueerkesâMeve Øees«eece
Mele& melÙe nes~ PHP ceW efvecveefueefKele uethe Øekeâej nesles nw~ pewmes efmemšce mebmeeOeveeW lekeâ hengBÛe mekeâles nw~
(i) While loop efuevekeäme Skeâ ceušer-šeefmkebâie DeesSme nw~ Skeâ ceušeršeefmkebâie
(ii) do - while loop Dee@hejsefšbie efmemšce ceW, Skeâ GheÙeesiekeâlee& keâes Skeâ meceÙe ceW Skeâ mes
(iii) for loop DeefOekeâ keâchÙetšj keâeÙe& (pewmes- efkeâmeer ShueerkesâMeve Øees«eece keâe
(iv) foreach loop. mebÛeeueve) keâjves keâer Devegceefle oslee nw Deewj Ûeue jns meYeer Øees«eeceeW keâer
57. (a) peevekeâejer jKelee nw~ Dele: oesveeW ner keâLeve melÙe nw~
[sše mebjÛeveeDeeW hej meeceevÙele: efkeâS peeves Jeeues cetue Dee@hejsMeveeW ceW 66. (d)
meefcceefueve efJeueesheve Deewj Keespe Meeefceue nesles nw~ Sefv›eâhMeve [sše BIOS pees heermeer kesâ Dee@hejseEšie efmemšce keâe efnmmee nw, pees jesce ceW
mebjÛevee keâe Skeâ cetue DeehejsMeve veneR nw yeefukeâ Ùen [sše keâer megj#ee mes meb«eefnle jnlee nw~ jesce Skeâ mLeeF& cesceesjer nw, efpemeceW meb«eefnle [eše Je
mecyeefvOele Skeâ Øeef›eâÙee nw~ metÛeveeSB mJeÙeb ve<š veneR nesleer nw leLee GvnW yeouee Yeer veneR pee
58. (b) mekeâlee~
Øeesmesme Skeâ Øees«eece nw pees Jele&ceeve ceW kebâhÙetšj kesâ CPU Éeje efve<heeefole 67. (d)
efkeâÙee pee jne nw~ FmeceW Øees«eece keâes[ Deewj Gmekeâer Jele&ceeve ieefleefJeefOe [sefyeÙeve, Hesâ[esje leLee Gyevleg Ùes meYeer ueeFveskeäme hej DeeOeeefjle
Meeefceue nw~ peye keâesF& Øees«eece cesceesjer ceW uees[ efkeâÙee peelee nw Deewj Dee@hejsefšbie efmemšce nw~ Dee@hejsefšbie efmemšce kesâ efyevee keâesF& mee@HeäšJesÙej
efve<heeove Meg® neslee nw, lees Ùen Skeâ Øeef›eâÙee yeve peeleer nw~ keâeÙe& veneR keâjlee nw~ Ùen mee@HeäšJesÙej leLee ne[&JesÙej oesveeW mebÛeej keâes
59. (d) cewvespe keâjlee nw~
ØeLece keâchÙetšj JeeÙejme Creeper nw pees mJeÙeb keâes Replicate keâjlee 68. (d)
nw peyeefkeâ ØeLece heermeer yetš meskeäšj JeeÙejme yeÇsve (Brain) keâes keâne keâchÙetšj yetefšbie kesâ efueS Dee@hejsefšbie efmemšce keâer DeeJeMÙekeâlee nesleer
peelee nw~ nw~ keâchÙetšj ON efkeâÙes peeves hej BIOS mJele: ner Dee@hejsefšbie efmemšce
Fme Øekeâej kesâ JeeÙejme yetš meskeäšj ceW efÚheves keâer #ecelee jKeles nQ~ Fme keâer henÛeeve keâj Gmes ROM mes RAM ceW [euelee nw leLee
Øekeâej Ùen JeeÙejme heäuee@heer Ùee ne[& ef[mkeâ kesâ yetš meskeäšj keâes ØeYeeefJele mee@HeäšJesÙej kesâ GheÙeesie kesâ ueeÙekeâ yeveelee nw~ efpemes yetefšbie keânles nw~
keâjlee nw~ 69. (d)
60. (d) ceušerØeesmesefmebie Skeâ Ssmeer Øeef›eâÙee nw pees efmemšce keâes keâF& Øeesmesmej keâer
cewueJesÙej Skeâ meeceevÙe Meyo nw pees efJeefYeVe Øekeâej kesâ FbšÍefmeJe ceoo mes oes Ùee oes mes DeefOekeâ Øees«eeceeW keâer menkeâeefuekeâ ØeefJeefOe keâer
mee@heäšJesÙej keâes meboefYe&le keâjves kesâ efueS efkeâÙee peelee nw~ cewueJesÙej ceW Skeâ meeLe Øeesmesefmebie keâjves keâer Devegceefle osleer nw~
efJeefYeVe JeeÙejme, mheeF& JesÙej, S[JesÙej, š^espeve neme& Jeece& Deeefo 70. (d)
Meeefceue nQ~ yeeÙeesme (BIOS) keâe hetCe& ™he ‘yesemf ekeâ Fvehegš DeeGšhegš efmemšce’ neslee
61. (d) nw~ Fmekeâer ceoo mes ner keâchÙetšj kesâ meYeer kebâheesveWšdme keâeÙe& keâjles nQ~
keâchÙetšj Ùetefšefuešer Øees«eece kesâ Debleie&le efveÙeefcele keâeÙe& efkeâÙes peeles nw~ Fmekesâ yeeÙeesme Skeâ heâce&JesÙej nw~ kewâMe cesceesjer [sše keâes DemLeeÙeer mšesj keâjlee nw
Devleie&le ef[mkeâ ef[øewâieceWšj, ef[mkeâ efkeäueve-Dehe, heâeFue cewvespej, pees ne[&JesÙej Deewj mee@heäšJesÙej oesveeW ceW ceewpeto nes mekeâles nQ uesekf eâve Ùen
SbšerJeeÙejme Je heâeÙejJeeue, keâcØesmeve štume Øees«eece Deeles nQ~ GheÙeesefielee mee@heäšJesÙej keâe Skeâ GoenjCe veneR nw~
62. (c) 71. (c)
Skeâ ner [eše keâes peye keâF& peien hej mesJe efkeâÙee peelee nw lees Skeâ kesâ mLeeve hej [yeue yeheâefjbie, oes ÙeespeveeDeeW Ùee oes yeheâj keâe
efj[v[svmeer (Redundency) keânueelee nw~ GheÙeesie efkeâÙee peelee nw~ Fme Øekeâej kesâ yeheâefjbie ceW, efvecee&lee Skeâ yeheâj
63. (b) keâe Glheeove keâjlee nw peyeefkeâ GheYeesòeâe Skeâ meeLe otmejs yeheâj keâe
peye Deehe efmebšwkeäme keâes efveÙece kesâ Devegmeej veneR efueKeles nw lees GheÙeesie keâjlee nw~ FmeefueS efvecee&lee keâes yeheâj Yejves kesâ efueS Øeleer#ee
keâcheeFuej Fmeces $egefš yeleelee nw Fmes ner keâcheeFue šeFce Sjj keâjves keâer DeeJeMÙekeâlee veneR nQ~ [yeue yeheâefjbie keâes yeheâj mJewefhebie kesâ
keânles nQ~ ™he ceW Yeer peevee peelee nw~
192 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
 77. (d)
ke=âef$ece %eeve ceeveJe yegefæ kesâ DevegmejCe keâes ceMeerveeW ceW meboefYe&le keâjlee
nww~ efpemekeâer meneÙelee mes yegefæceòeehetCe& ceMeerveW Deewj ceeveJe keâer lejn
meesÛeves Jeeues keâchÙetšj yeveeÙes peeles nQ~
78. (a)
Sueve šŸetefjbie Skeâ efyeÇefšMe ieefCele%e, Ùeebef$ekeâ Deewj jwefKekeâ yeesOeMeem$eer
Les pees keâchÙetšj efJe%eeve kesâ efheleecen ceeves peeles nQ~ GvneWves šŸetefjbie
yuee@keâ DeesefjSbšs[– [yeue yeheâj Fme lejn keâece keâjlee nw efveÙeb$ekeâ ceMeerve keâe DeeefJe<keâej efkeâÙee nw~ Sueve šŸetefjbie ves 1950 ceW ‘FefcešsMeve
[sše keâes meb«enerle keâjves kesâ efueS Skeâ yeheâj keâe GheÙeesie keâjlee nw, šsmš’ keâe ØemleeJe jKee Lee~
peyeefkeâ Ùen GÛÛe hejeveg›eâce mlej Éeje efueS peeves keâer Øeleer#ee keâjlee 79. (a)
nw~ efveÛeues mlej kesâ cee@[Ÿetue mes [sše mšesj keâjves kesâ efueS Skeâ Deewj heme&veue keâchÙetšj Skeâ ceeF›eâesØeesmesmej DeeOeeefjle keâchÙetefšbie ef[JeeFme
yeheâj keâe GheÙeesie efkeâÙee peelee nw~ nw~
mš^erce DeesefjSbšs[– ueeFve Skeâ meceÙe I/O ceW, Ùetpeme& Øeef›eâÙee keâes 80. (a)
Fvehegš Ùee DeeGšhegš kesâ efueS efveuebefyele keâjves keâer DeeJeMÙekeâlee veneR [sše yeme, S[^sme yeme Deewj kebâš^esue yeme efmemšce yeme kesâ keâeÙee&lcekeâ mecetn
nesleer nw peye lekeâ efkeâ Øeef›eâÙee [yeue yeheâj mes Deeies veneR Ûeueleer nw~ nw~ keâchÙetšj mes yeves efmemšce yeme keâer Ûeew[Ì eF& meerheerÙet kesâ ieefle keâes
yeeFš– meceÙe hej mebÛeeueve, [yeue yeheâj uecyeeF& kesâ oesiegves kesâ ØeYeeefJele keâjleer nw Ùeefo efmemšce yeme keâer Ûeew[Ì eF& 32 efyeš nw, lees Fmekeâe
Skeâue yeheâj hej keâesF& ueeYe veneR oslee nw~ DeLe& nw efkeâ keâchÙetšj yeme ceW 32 leej nQ~ leelheÙe& Ùen nw efkeâ Øeesmesmej
72. (b) Skeâ meeLe 32 efyeš [eše keâe Deeoeve-Øeoeve keâj mekeâlee nw~
VxWorks, QNX Deewj RT Linux efjÙeue-šeFce Dee@hejsefšbie efmemšce 81. (d)
nw~ peyeefkeâ Palm OS Skeâ ceesyeeFue Dee@hejsefšbie efmemšce nw~ Palm Control Bus keâchÙetšj kesâ meYeer IeškeâeW pewmes- meerheerÙet, cesceesjer,
OS keâes heme&veue ef[efpešue DeefmemšWš (PDAS) kesâ efueS efJekeâefmele Fvehegš, DeeGšhegš FlÙeeefo keâes peesÌ[ves keâe keâeÙe& keâjleer nw~
efkeâÙee ieÙee nw~ 82. (a)
73. (a) ALU keâe hetje veece DeLe&cesefškeâ uee@efpekeâ Ùetefveš (Arithmetic
uees[j Jen efmemšce mee@HeäšJesÙej nw pees ncesMee cegKÙe cesceesjer ceW jnlee nw~ Logic Unit) neslee nw~ Ùen Deeceleewj hej mebkeâeÙeeX (Operands) Deewj
Ùen efve<heeove ÙeesiÙe Øees«eeceeW keâes efve<heeove kesâ efueS cegKÙe cesceesjer ceW heefjCeeceeW keâes mšesj keâjves kesâ efueS Skeâ mebÛeeÙekeâ (accumulator) keâe
uees[ keâjlee nw~ GheÙeesie keâjlee nw~
74. (a)
jefpemšj (Register) Skeâ yengle lespe keâchÙetšj cesceesjer nesleer nw efpemekeâe
jeGb[-je@efyeve Mes[Ÿetefuebie Skeâ Øekeâej keâer ØeerSefchšJe Mes[Ÿeefuebie nw~
ØeÙeesie [eše keâes mšesj keâjves kesâ efueS efkeâÙee peelee nw~
ØeerSefchšJe Mes[Ÿetefuebie ceW Skeâ Øeesmesme keâes CPU mes nšeÙee pee mekeâlee
nw~ Yeues ner Jen DeYeer Ûeue jner nes Deewj efkeâmeer DevÙe Øeesmesme keâes 83. (c)
Fvmeš^keäMeve jefpemšj keâjsvš Fvmeš^keäMeve keâes nesu[ keâjkesâ jKelee nw
CPU keâe GheÙeesie keâjves keâer Devegceefle oer pee mekeâleer nw~ jeGb[ je@efyeve
Mes[Ÿetefuebie ceW ØelÙeskeâ Øeesmesme keâes CPU keâe GheÙeesie keâjves kesâ efueS pemekeâe SefpekeäÙetMeve nes jne neslee nw Øeesmesmej Éeje efkeâmeer efoS ieS
ef
Skeâ efveef§ele meceÙe DeJeefOe (efpemes šeFce mueeFme Ùee keäJeebšce keâne šeFce ceW kesâJeue Skeâ ner Fvmeš^keäMeve keâes SefpekeäÙetš efkeâÙee peelee nw~
peelee nw) oer peeleer nw~ Ùen jefpemšj Gme Fvmeš^keäMeve keâes keâvš^esue Ùetefveš ceW peeves mes henues
75. (d) mšesj keâjkesâ jKelee nw~
1 efyeš keâe DeLe& nw efkeâ ØelÙeskeâ efhekeämesue keâes Skeâue efyeš DeLee&led 0 Ùee 84. (d)
1 kesâ ™he ceW meb«enerle efkeâÙee peelee nw~ S[^ s me yeme leejes keâe Skeâ mecetn nw pees meerheerÙet keâes cegKÙe cesceesjer mes
640×480 efjpee@uÙetMeve Jeeueer 1 efyeš Fcespe kesâ efueS peesÌ[lee nw Deewj Fmekeâe GheÙeesie cegKÙe cesceesjer ceW S[^sme keâer henÛeeve
640 480 keâjves kesâ efueS efkeâÙee peelee nw~
3 7 .5 K B mhesme keâer DeeJeMÙekeâlee nesieer~
8 1024 85. (d)
Dele: GheÙeg&òeâ keâLeve DemelÙe nw~ CMOS keâe hetje veece keâe@efchueceWšjer cesšue Dee@keämeeF[ mesceerkebâ[keäšj
76. (d) nw~ CMOS Skeâ lejn keâer cesceesjer efÛehe nesleer nw pees efkeâ ceojyees[& hej
š^wkeâyee@ue ceeGme keâe Skeâ efJekeâuhe nw~ Ùen Gušs ceeGme keâer lejn ueieer nesleer nw Deewj Skeâ yewšjer keâer ceoo mes Ûeueleer nw~ Fme yewšjer keâes
efoKelee nw, Deewj yee@ue keâes Deheveer GbieefueÙeeW mes Iegceekeâj Fmekeâe ØeÙeesie CMOS mesue Yeer keânles nw CMOS keâes efjÙeue šeFce keäuee@keâ veece
keâjles nQ~ FmeceW ceeGme keâer lejn efkeäuekeâ keâjves kesâ efueS Skeâ Ùee mes Yeer peeveles nw~ CMOS efÛehe ceW nceejs keâchÙetšj keâer Date Deewj
DeefOekeâ yešve nesles nQ~ š^wkeâyee@ue ceW š^wkeâyee@ue keâer ieefle keâer efoMee Deewj time keâer mesefšbime save nesleer nw~ peye keâchÙetšj keâes yevo keâjles nw
ieefle keâes mecePeves kesâ efueS jesueme& Deewj meWmej keâe GheÙeesie efkeâÙee leye Yeer mesJe jnleer nw keäÙeeWefkeâ CMOS efÛehe Skeâ yewšjer keâer ceoo mes
peelee nw~ Ûeue jner nesleer nw~
193 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
86. (b) 94. (c)
keâchÙetšj kesâ Fbšve&ue mšesjspe mes hesefjhesâjue ef[JeeFme ceW [sše kesâ A B Y
nmleeblejCe kesâ efueS meerheerÙet Éeje I/O heesš& keâe ØeÙeesie efkeâÙee peelee nw~ 0 0 0
meerheerÙet cegKÙe cesceesjer leLee heefjOeerÙe GhekeâjCeeW kesâ ceOÙe [sše š^ebmeheâj 1 0 1
keâer Devegceefle Øeoeve keâjlee nw~ 0 1 1
Øeesmesmej keâes meWš^ue Øeesmesmej Ùetefveš (meerheeÙet) kesâ veece mes Yeer peevee 1 1 0
peelee nw efpemes keâchÙetšj keâe ceefmle<keâ Yeer keânles nw~ A' = 1
87. (b) A=0
ef[mkeâ keâes š^wkeâ Deewj meskeäšj ceW efJeYeeefpele keâjves keâer Øeef›eâÙee keâes
Y AB A B
‘Heâe@cexefšbie’ keâne peelee nw~ peye keâesF& ef[mkeâ efvecve mlejerÙe Øee™he mes
95. (b)
iegpejleer nw, lees Fmes š^wkeâ Deewj meskeäšj ceW efJeYeeefpele efkeâÙee peelee nw~ yetefueÙeve DeefYeJÙeefkeäle keâe Éwle Deemeeveer mes ÙeesieeW Deewj GlheeoeW keâes
88. (b)
Deeheme ceW yeouekeâj Deewj 0 kesâ meeLe-meeLe 1 keâes Deeheme ceW yeouekeâj
hespe Dee@Heâmesš keâer mebKÙee efveOee&efjle keâjves kesâ efueS nceW hespe Deekeâej kesâ
Øeehle efkeâÙee pee mekeâlee nw~
DeeOeej hej efyešdme keâer mebKÙee keâer ieCevee keâjveer nesieer~
96. (a)
hespe Deekeâej- 4 KB yetefueÙeve SkeämeØesMeve
1 KB = 1024 yeeFšdme
x(x+y)
4 1024 = 4096 yeeFšdme = x.x + xy ∵ x.x = x
hespe Dee@Heâmesš efyešdme keâer mebKÙee- = x+xy
hespe Dee@Heâmesš efyešdme keâer mebKÙee = log2 (hespe Deekeâej) = x (1 + y) ∵ 1 + y =1
hespe Dee@Heâmesš efyešdme keâer mebKÙee = log2 (4096) = x.1
4096 = 212 FmeefueS log2 (4096) = 12 =x
97. (a)
FmeefueS, hespe Dee@Heâmesš kesâ efueS DeeJeMÙekeâ efyešdme keâer mebKÙee 12
Skeâ NOR iesš yeyyeu[ AND iesš kesâ meceleguÙe neslee nw Ùen [er
efyešdme nw~
ceesie&ve efJeefOe keâe heefjCeece nesles nQ~
89. (b)
cesceesjer yeheâj jefpemšj (MBR) cesceesjer [sše jefpemšj (MDR) kesâ
™he ceW Yeer peevee peelee nw~ Fmekeâe GheÙeesie [sše Yeb[ejCe kesâ efueS
efkeâÙee peelee nw Ùen meerheerÙet ceW efmLele Skeâ jefpemšj neslee nw~
90. (c)
S[^sme yeeFbef[bie Skeâ S[^sme mhesme mes otmejs S[^sme mhesme ceW cewefhebie keâer
Øeef›eâÙee nw~ leeefke&âkeâ S[^sme efve<heeove kesâ oewjeve meer.heer.Ùet. Éeje GlheVe 98. (b)
Skeâ S[^sme nw, peyeefkeâ efheâefpekeâue S[^sme cesceesjer Ùetefveš ceW mLeeve keâes NOT iesš, efpemes FvJeš&j kesâ ™he ceW Yeer peevee peelee nw, Skeâ uee@efpekeâ
meboefYe&le keâjlee nw (efpemes cesceesjer ceW uees[ efkeâÙee peelee nw~) leeefke&âkeâ iesš nw pees yeeFvejer Fvehegš keâes Gueš oslee nw~
S[^sme Sce.Sce.Ùet. Ùee efJeMes<e ™he mes S[^sme š^ebmeuesMeve Ùetefveš Éeje 99. (d)
š^bemeuesMeve mes iegpejlee nw~ Fme Øeef›eâÙee keâe DeeGšhegš GheÙegòeâ ef[efpešue uee@efpekeâ ceW $egefš kesâ henÛeeve kesâ efueS efvecve keâes[ keâe
efheâefpekeâue S[^sme Ùee jwce ceW keâes[/[sše keâe mLeeve nw~ GheÙeesie efkeâÙee peelee nw~
91. (d) nwefcebie keâes[- $egefšÙeeW keâer henÛeeve Deewj megOeej kesâ efueS GheÙeesie efkeâÙee
Úesše (Smaller) jwce keâer efJeMes<eleeDeeW mes keâesF& mecyevOe veneR nw peelee nw~
peyeefkeâ lespe, cenbiee leLee GÛÛe efyepeueer Kehele Deeefo RAM keâer Ûeskeâmece- [sše š^ebmeHeâj kesâ oewjeve $egefšÙeeW keâer henÛeeve kesâ efueS ØeÙeesie
efJeMes<eleeSb nw~ neslee nw~
92. (d) meeFefkeäuekeâ efj[b[Wmeer Ûeskeâ- Yeer [sše $egefšÙeeW keâer henÛeeve kesâ efueS
heâce&JesÙej Skeâ Øekeâej keâe efmemšce mee@heäšJesÙej neslee nw pees heäuewMe Skeâ ØeYeeJeer lejerkeâe nw~
[^eFJe, ROM Ùee EPROM ceW Fveefyeuš neslee nw~ Ùen Dee@hejsefšbie 100. (d)
efmemšce Éeje henÛeevee peelee nw~ nskeämee[sefmeceue ceW DeefOekeâlece mecYeJe ef[efpeš FFF nesieer Dele–15th
93. (b) complement efvekeâeueves kesâ efueS efoS ieS vebyej keâes F mes Ieševee
kebâhÙetšj efÛehe Øeeke=âeflekeâ lelJe efmeefuekeâe@ve mes yeveleer nw, efpemes efJeMes<e heÌ[lee nw~
Øekeâej kesâ Øeef›eâÙeeDeeW mes lewÙeej efkeâÙee peelee nw~ Ùen efÛehe Skeâ FFF
efmeefuekeâe@ve cewšsefjÙeue hej Úehes peeles nQ Deewj Fme hej efJeefYevve Øekeâej kesâ – A01
Fueskeäš^e@efvekeâ mebkesâlekeâ Deewj meefke&âš yeveeS peeles nQ efpevekeâe GheÙeesie 5FE
kebâhÙetšj ØeesmeseEmeie kesâ efueS efkeâÙee peelee nw~ = (5FE)16

194 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
 PRACTICE SET - 7
1. Which delivery mode is an example of a cloud 6. Which of the following is NOT a type of an IoT
computing environment that provides users security threat?/efvecveefueefKele ceW mes keâewve-mee Skeâ
with a web based e-mail service?/keâewve-mee IoT efmekeäÙeesefjšer LeÇsš keâe Øekeâej veneR nw?
efJelejCe cees[ keäueeG[ keâchÙetefšbie JeeleeJejCe keâe Skeâ (a) Social engineering/meesMeue FbpeerefveÙeefjbie
GoenjCe nw pees GheÙeesiekeâlee&DeeW keâes Jesye DeeOeeefjle F&- (b) Ransomware/jwvemeceJesÙej
cesue mesJee Øeoeve keâjlee nw? (c) Man-in-the-middle/cewve-Fve-o-efceef[ue
(a) Software as a service/meeHeäšJesÙej-Spe-S-meefJe&me (d) Social networking /meesMeue vesšJeefke&âbie
(b) Platform as a service/huesšHeâece&-Spe-S-meefJe&me 7. Which of the following is NOT an application
(c) Computing as a service/keâchÙeÙetefšbie-Spe-S-meefJe&me of the IoT?/efvecveefueefKele ceW mes keâewve-mee IoT keâe
(d) Infrastructure as a service SefhuekesâMeve veneR nw?
Fvøeâemš^keäÛej-Spe-S-meefJe&me (a) Smart healthcare/mceeš& nsuLekesâÙej
2. Another name for lazy learning algorithm is: (b) Smart vehicles/mceeš& Jnerkeâume
ues]peer ueefveËie SuieesefjLce keâe otmeje veece nw– (c) Smart pollution control/mceeš& hee@uÙetMeve kebâš^esue
(a) K-Nearest Neighbor/kesâ efveÙejsmš vesFyej (d) Smartweed/mceeš&Jeer[
(b) Regression/efj«esMeve 8. SDeeF& (AI) SefhuekesâMevme keâes ueeiet keâjves kesâ efueS oer
(c) Classification/keäueeefmeefheâkesâMeve ieF& Yee<eeDeeW ceW mes keâewve meer Yee<ee Deeceleewj hej GheÙeesie
(d) Neural Networks/vÙetjue vesšJekeäme& veneR keâer peeleer nw?
3. Which of the following is a DISADVANTAGE (a) Python (b) LISP (c) Perl (d) PROLOG
of Artificial Intelligence? 9. Algorithms are tested by
ke=âef$ece yegefæceòee (Artificial Intelligence) keâe Suieesefjoce keâe hejer#eCe ______Éeje efkeâÙee peelee nw~
efvecveefueefKele ceW mes keâewve-mee Skeâ vegkeâmeeve nw? (a) Steps /mšshe (b) Data/[sše
(a) It never sleeps, so it is available 24 × 7/ Ùen (c) Information/metÛevee (d) Programs/Øees«eece
keâYeer veneR meesleer, FmeefueS Ùen ÛeewyeermeeW Iebšs GheueyOe 10. Which HTML tag is used to define information
jnleer nw~ about a document?/efkeâmeer omleeJespe kesâ yeejs ceW
(b) It reduces human error. peevekeâejer keâes heefjYeeef<ele keâjves kesâ efueS efkeâme HTML
Ùen ceeveJeerÙe $egefš keâes keâce keâjleer nw~ šwie keâe GheÙeesie efkeâÙee peelee nw?
(c) It is fast./ Ùen lespe nw~ (a) <html> (b) <meta>
(d) It cannot duplicate human creativity. (c) <head> (d) <details>
Ùen ceeveJe jÛeveeMeeruelee keâer vekeâue veneR keâj mekeâleer~ 11. Which of the following is NOT true about PDF
4. In IoT, a/an ______ is a device that detects or file format?/PDF heâeFue heâecexš kesâ yeejs ceW
measures a specific physical quantity and efvecveefueefKele ceW mes keâewve-mee mener veneR nw?
converts it into another form, usually electrical (a) The format is ubiquitous./Øee®he meJe&JÙeeheer nw
pulses. (b) It works on any operating system.
IoT ceW, _____ Skeâ ef[JeeFme nw pees Skeâ efJeefMe° Ùen efkeâmeer Yeer Dee@hejsefšbie efmemšce hej keâece keâjlee nw
Yeeweflekeâ jeefMe keâe helee ueieeleer nw Ùee ceeheleer nw Deewj Fmes (c) It is a proprietary standard
otmejs ¤he ceW, meecevÙele: Fuesefkeäš^keâue heume ceW ¤heebleefjle Ùen Skeâ ceeefuekeâevee ceevekeâ nw
keâjleer nw~ (d) It integrates non-text elements.
(a) router/jeGšj (b) sensor/meWmej
Ùen iewj-hee" SueerceWš keâes Skeâerke=âle keâjlee nw~
12. Multimedia can contain-
(c) gateway/iesšJes (d) actuator/SkeäÛegSšj ceušerceeref[Ùee ceW nes mekeâlee nw/ mekeâles nQ-
5. Which of the following is an example of an IoT (a) graphics, animation, video, music and voice
protocol used for device communication? «eeefheâkeäme, SveercesMeve, Jeeref[Ùees, mebieerle Deewj DeeJeepe
efvecveefueefKele ceW mes keâewve-mee ef[JeeFme mebÛeej kesâ efueS (b) only numeric-type data
GheÙeesie efkeâS peeves Jeeues IoT Øeesšeskeâe@ue keâe Skeâ kesâJeue [eše De#ejebkeâerÙe
GoenjCe nw? (c) numeric, text and picture data
(a) HTTP De#ejebkeâerÙe, hee"dÙe Deewj efhekeäÛej [eše
(b) FTP (d) databases that in turn contain other databases
(c) MQTT creating a massive date collection
(d) More than one of the above [ešeyesme efpemeceW efheâj ye=nled [eše Skeâ$eCe me=efpele
GheÙeg&òeâ ceW mes Skeâ mes DeefOekeâ [ešeyesme neslee nw
195 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
13. Which of the following is not a benefit of e- (a) SvJesuehme (envelopes) (b) efyevme (bins)
governance? (c) hewkesâšdme (Packets) (d) uesyeume (labels)
efvecveefueefKele ceW mes keäÙee F&-ieJeveXme keâe ueeYe veneR nw? 19. Identify the communication protocol which
(a) Expanded reach of government establishes a dedicated and direct connection
mejkeâej keâe efJemle=le DeefYeiece between two communication devices. This
(b) Low transparency/keâce heejoefMe&lee protocol defines how two devices will
(c) Direct participation of constituents authenticate each other and establish a direct
IeškeâeW keâer ØelÙe#e Yeeieeroejer link between them to exchange data.
Gme keâcÙegefvekesâMeve Øeesšeskeâe@ue keâer henÛeeve keâerefpeS pees
(d) Increased convenience/JeefOe&le megefJeOee
oes keâcÙegefvekesâefšbie ef[JeeFme kesâ yeerÛe Skeâ [sef[kesâšs[ Deewj
14. Which of the following is NOT a primary type
of e-commerce model?/efvecveefueefKele ceW mes keâewve mee [eÙejskeäš keâveskeäMeve mLeeefhele keâjlee nw~ Ùen Øeesšeskeâe@ue
F&-keâe@ceme& cee@[ue keâe ØeeLeefcekeâ Øekeâej veneR nw? Ùen yeleelee nw efkeâ Ùes oesveeW ef[JeeFme efkeâme Øekeâej Skeâ
(a) B2B (b) B2C otmejs keâes DeLesevf škesâš keâjWies Deewj [eše SkeämeÛeWpe keâjves
(c) C2D (d) C2B kesâ efueS Deheves yeerÛe Skeâ [eÙejskeäš efuebkeâ mLeeefhele keâjWies~
15. In the context of web browsing, the purpose of (a) PPP/heer heer heer (b) SMTP/Sme Sce šer heer
a 'bookmark' is that you –––––. (c) TELNET/šsuevesš (d) FTP/Sheâ šer heer
Jesye yeÇeGef]pebie kesâ meboYe& ceW, ‘yegkeâceeke&â’ keâe GösMÙe Ùen nw 20. efvecveefueefKele ceW mes keâewve mee keâLeve HTTPS kesâ yeejs ceW
efkeâ Deehe ______ ~ DemelÙe nw?
(a) Save and organize specific websites so that (a) Ùen cewve-Fve-o-efceef[ue Dešwkeâ kesâ megj#ee megefveef§ele
you can visit them frequently
efJeefMe„ JesyemeeFšeW keâes mesJe Deewj JÙeJeefmLele keâj mekeWâ keâjlee nw~
leeefkeâ Deehe Gve hej yeej-yeej pee mekeWâ (b) Sefv›eâhMeve kesâ GheÙeesie kesâ keâejCe, HTTPS keâe GheÙeesie
(b) Small application can plugin, that allow keâjves Jeeues oes nesmšeW kesâ yeerÛe mebÛeej megjef#ele neslee nw~
facility you to view some certain type of (c) Ùen HTTP mes pÙeeoe megjef#ele nw~
content in your web browser/Úesšer SefhuekesâMeve (d) Fmekeâe GheÙeesie efJeòeerÙe uesve-osve kesâ efueS veneR efkeâÙee pee
keâes hueie-Fve keâj mekeWâ, pees Deehekeâes Jesye yeÇeGpej ceW kegâÚ mekeâlee nw~
efveÙele Øekeâej keâer meece«eer osKeves keâer megefJeOee oW 21. Which of the following TCP/IP protocols is
(c) Save an image from a website to your used for transferring electronic mail messages
computer/Skeâ JesyemeeFš mes Deheves keâchÙetšj hej Skeâ from one machine to another?
Fcespe mesJe keâjs mekeWâ efvecveefueefKele ceW mes efkeâme TCP/IP Øeesšeskeâe@ue keâe
(d) Visit the websites you have recently visited GheÙeesie Fueskeäš^e@efvekeâ cesue mebosMeeW (electronic mail
Fve JesyemeeFšeW hej pee mekeWâ efpevns Deeheves neue ner ceW messages) keâes Skeâ ceMeerve mes otmejer ceMeerve ceW š^evmeheâj
osKee nw keâjves kesâ efueS efkeâÙee peelee nw?
16. What is the name given to the act of gaining (a) FTP (b) SMTP
illegal entry to computer files through remote (c) SNMP (d) RCP
terminals or microcomputers? 22. A............is a basic unit of communication over
otjmLe šefce&veueeW Ùee ceeF›eâeskeâchÙetšjeW kesâ ceeOÙece mes a digital network./Skeâ............Skeâ ef[efpešue vesšJeke&â
keâchÙetšj heâeFueeW ceW DeJewOe ØeJesMe Øeehle keâjves kesâ keâeÙe& hej mebÛeej keâer Skeâ yegevf eÙeeoer FkeâeF& nesleer nw~
keâes keäÙee veece efoÙee ieÙee nw? (a) switch/efmJeÛe
(a) Hacking/nwefkebâie (b) access points/Skeämesme hee@Fbš
(b) Decoding/ef[keâesef[bie (c) data packet/[sše hewkesâš
(c) Beating the system/efmemšce keâes ceele osvee (d) router/jeGšj
(d) More than one of the above/GheÙeg&òeâ ceW mes Skeâ mes 23. Which type of cable has high bandwidth
DeefOekeâ supports high data transfer rate, signals can
travel longer distances and electromagnetic
17. What is the term for an endpoint of an
noise cannot affect the cable, however
interprocess communication flow across a
expensive. Identify the transmission media.
computer network?/keâchÙetšj vesšJeke&â hej Deblej-Øeef›eâÙee
efkeâmeer Øekeâej kesâ kesâyeue keâer yeQ[efJe[dLe DeefOekeâ nesleer nw Jen
mebÛeej ØeJeen kesâ meceeheve efyebog kesâ efueS keäÙee Meyo nw?
(a) Port (b) Pipe
neF& [eše š^ebmeheâj jsš keâes meheesš& keâjlee nw, Gmekesâ efmeiveue
(c) Socket keâeheâer otjer lekeâ peeles nQ Deewj Gmekeâer Fueskeäš^ecs ewivesešf keâ OJeefve
(d) More than one of the above kesâyeue keâes ØeYeeefJele veneR keâjleer nw, leLeeefhe Ùen cenbieer nesleer
18. peye keâesF& ef[JeeFme otmejs ef[JeeFme hej mebosMe Yespeves keâe nw~ š^ebmeefceMeve ceeref[Ùee keâer henÛeeve keâerefpeS~
ØeÙeeme keâjlee nw, lees [sše keâes Fbšjvesš hej ØeyebOeveerÙe (a) Coaxial Cable (b) Optical Fiber
____ kesâ ]Heâe@ce& ceW Yespee peelee nw~ (c) Twisted Pair Cable (d) Cat 6 Cable
196 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
24. In which data transmission mode can two devices efvecveebefkeâle ceW mes efkeâme SQL keâceeb[ keâe efkeâmeer šsyeue
either send data or receive data but not both at kesâ Skeâ Ùee Skeâ mes DeefOekeâ jes (rows) kesâ Sefš^yÙetš
the same time?/FveceW mes efkeâme [sše š^ebmeefceMeve cees[ ceW JewuÙet keâes yeoueves kesâ efueS ØeÙeesie efkeâÙee peelee nw?
oes ef[JeeFme Ùee lees [sše Yespe mekeâles nQ Ùee Øeehle keâj mekeâles (a) Update/Dehe[sš (b) Insert/Fvemeš&
nQ uesefkeâve oesveeW Skeâ meceÙe hej veneR?
(c) Alter/Dee@ušj
(a) Complex/keâe@cheuewkeäme
(d) More than one of the above/GheÙeg&òeâ ceW mes Skeâ mes
(b) Simplex/efmecheuewkeäme
DeefOekeâ
(c) Half duplex/neHeâ [ghuewkeäme
32. If we have not specified ASC or DESC after an
(d) Full duplex/Hegâue [ghuewkeäme SQL ORDER BY clause, which of the following
25. efvecveefueefKele ceW mes efkeâme Fbšjvesš Skeämesme efJeefOe keâes is used by default?
‘efmJeÛ[ ueeFve (switched line)' Yeer keâne peelee nw? Ùeefo nceves SQL ORDER BY keäuee@pe kesâ yeeo ASC
(a) mesšsueeFš (Satellite) Ùee DESC keâes efveefo&° veneR efkeâÙee nw, lees efvecveefueefKele
(b) [eÙeue-Dehe ueeFve (Dial-up line) ceW mes keâewve-mee ef[]heâe@uš ™he mes GheÙeesie efkeâÙee pelee nw?
(c) ueerp[ ueeFve (Leased line) (a) DESC (b) ASC
(d) ISDN (c) There is no default value/keâesF& default value
26. Identify the term, which is an unauthorized veneR
real-time interception or monitoring of private (d) More than one of the above/GheÙeg&òeâ ceW mes Skeâ
communication between two entities over a
network. DeefOekeâ
Gme heo keâer henÛeeve keâerefpeS, pees Skeâ vesšJeke&â hej oes 33. Which normal form ensures that every non-
JÙeefòeâÙeseb kesâ yeerÛe kesâ efvepeer Jeelee&ueehe keâes DeveeefOeke=âle prime attribute in a table is fully functionally
™he mes jerÙeue-šeFce Fbšjmeshš Ùee cee@veeršj keâjlee nw~ dependent on the primary key?/keâewve-mee meeceevÙe
(a) Eavesdropping/FJme[^eefhebie ™he Ùen megefveeqMÛele keâjlee nw efkeâ leeefuekeâe ceW ØelÙeskeâ
(b) Phishing/efheâefMebie iewj-ØeOeeve efJeMes<elee ØeeLeefcekeâ kegbâpeer hej hetjer lejn
(c) Snooping/mvetefhebie keâeÙee&lcekeâ ™he mes efveYe&j nw?
(d) Cyberstalking/meeFyejmšeefkebâie (a) First Normal Form (1NF)/henuee meeceevÙe ™he (1
27. The code that relational database management NF)
systems use to perform their data base task is (b) Second Normal Form (2NF)/otmeje meeceevÙe ™he
referred to as:/Jen keâes[ efpemekeâe GheÙeesie [sšeyesme (2 NF)
še@mkeâ keâjves kesâ efueS efjuesMeveue [sšeyesme cewvespeceWš (c) Third Normal Form (3NF)/leermeje meeceevÙe ™he (3
efmemšce keâjlee nw Jen keâewve-mee nw? NF)
(a) QBE (b) SQL (d) More than one of the above/GheÙeg&òeâ ceW mes Skeâ mes
(c) OLAP (d) Sequel Server DeefOekeâ
28. Commonly used abbreviation SQL in computer 34. The DBMS acts as an interface between_____ and
science stands for?/keâchÙetšj efJe%eeve ceW Deeceleewj hej _____of an enterprise class system.
Fmlesceeue efkeâÙee peeves Jeeuee mebef#ehle veece SmekeäÙetSue keäÙee nw? DBMS Skeâ SbšjØeeFpe-keäueeme efmemšce kesâ _____Deewj
(a) System Query Language/ efmemšce keäJesjer Yee<ee _____kesâ yeerÛe Skeâ FbšjHesâme kesâ ¤he ceW keâeÙe& keâjlee nw~
(b) Search Query Language/meÛe& keäJesjer Yee<ee (a) data, the DBMS
(c) Structured Query Language/mš^keäÛe[& keäJesjer Yee<ee (b) database application, the database
(d) Single Query Language/Skeâue keäJesjer Yee<ee (c) the user, the software
29. In RDBMS data is stored in/RDBMS ceW [sše (d) More than one of the above/GheÙeg&keäle ceW mes Skeâ mes
keâneB meb«eefnle neslee nw~ DeefOekeâ
(a) Trees (b) Lists 35. Using join, which of the following MySQL
(c) Tables (d) Networks query is almost equivalent to:
30. Which command is used to remove a relation pJeebFve keâe ØeÙeesie keâjles ngS, efvecveefueefKele ceW mes
from an SQL?/Sme. keäÙet. Sue. mes mebyebOe nševes kesâ keâewve mee MySQL query efvecveefueefKele kesâ ueieYeie
efueS efkeâme keâceeb[ keâe GheÙeesie efkeâÙee peelee nw? meceleguÙe nw?
(a) Drop table SELECT NAME, MARKS FROM STUDENT,
(b) Delete RESULT WHERE STUDENT.ROLL=
(c) Purge RESULT.ROLL;
(d) More than one of the above (a) SELECT NAME, MARKS FROM
31. Which of the following SQL commands is used STUDENT JOIN RESULT;
to change the attribute values of one or more (b) SELECT NAME, MARKS FROM
rows in a table? STUDENT EQUI JOIN RESULT;
197 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
 (c) SELECT NAME, MARKS FROM (a) Acts as an input/output channel between
STUDENT NATURAL JOIN RESULT; processes/Øeef›eâÙeeDeeW kesâ yeerÛe Skeâ Fvehegš/DeeGšhegš
(d) SELECT NAME, MARKS FROM Ûewveue kesâ ™he ceW keâece keâjleer nw
STUDENT, RESULT; (b) As an intermediary to store information like
36. ____ efJeefOe keâe GheÙeesie meeceevÙele: [sše keâer Fbšeref«ešer text, graphics, images works.
(Integrity) keâes JesjerHeâeF& keâjves kesâ efueS efkeâÙee peelee nw~ šskeämš, «eeefheâkeäme, Fcespe pewmeer metÛeveeDeeW keâes meb«enerle
(a) [gefhuekesâMeve (Duplication) keâjves kesâ efueS ceOÙemLe kesâ ™he ceW keâece keâjleer nw
(b) nwefMebie (Hashing) (c) Acts as an intermediary between the operating
(c) keâcØesMeve (Compression) system and the hardware/Dee@hejseš
f bie efmemšce Deewj
(d) kewâefMebie (Caching) ne[&JesÙej kesâ yeerÛe ceOÙemLe kesâ ™he ceW keâece keâjleer nw
(d) Works as a locator where the details of files
37. In Visual Basic, what is the scope of static
are stored/Skeâ ueeskesâšj kesâ ™he ceW keâece keâjleer nw peneb
variable?/efJepegDeue yesemf ekeâ ceW mšwefškeâ JewefjSyeue keâe
mkeâeshe keäÙee nesiee? heâeFueeW keâe efJeJejCe meb«enerle efkeâÙee peelee nw
41. In C#, which of the following class is used to
(a) Data stored in variable is used to redimension an monitor the files on your system by
array/JewefjSyeue ceW meb«enerle [sše keâe GheÙeesie efkeâmeer Ssjs keâes programming?/C# ceW efvecve ceW mes efkeâme keäueeme keâe
efheâj mes DeJeueeskeâve keâjves kesâ efueS efkeâÙee peelee nw~ GheÙeesie Øees«eeefcebie Éeje Deehekesâ efmemšce keâer heâeFueeW hej
(b) Data stored in variable is available within efveiejeveer jKeves kesâ efueS efkeâÙee peelee nw?
procedure.
(a) FileSystemWatcher Class
JewefjSyeue ceW meb«enerle [sše Øeef›eâÙee kesâ Yeerlej GheueyOe nw~ (b) FileSystemMonitor Class
(c) Data stored in variable is retained (c) FileWatcher Class
JewefjSyeue ceW meb«enerle [sše keâes yejkeâjej jKee peelee nw~ (d) SystemWatcher Class
(d) Data stored in variable is reset. 42. .NET framework was designed and developed
JewefjSyeue ceW meb«enerle [sše jermesš nes peelee nw~ by .........../ .NET ØesâceJeke&â ..............Éeje ef[peeFve Deewj
38. Which statement best describes the concept of efJekeâefmele efkeâÙee ieÙee Lee~
encapsulation?/keâewve-mee keâLeve SvekewâhmeguesMeve keâer (a) ceeF›eâesmee@heäš(Microsoft) (b) IBM
DeJeOeejCee keâe meyemes DeÛÚe JeCe&ve keâjlee nw? (c) Deesjkesâue (Oracle) (d) ietieue (Google)
(a) When a class inherits from another class, it 43. Which of the following border classes does
inherits both the states and methods of that W3.CSS NOT provide?
class./peye Skeâ keäueeme otmejs keäueeme mes efJejemele ceW efvecveefueefKele ceW mes keâewve-mee yee@[j& Jeie& (border class)
efceuelee nw, lees Jen Gme keäueeme kesâ mšsšdme Deewj cesLe[ W3.CSS Øeoeve veneR keâjlee nw?
oesveeW keâes Øeehle keâjlee nw~ (a) W3-border-top (b) W3-border-left
(b) Grouping the commonalities and creating (c) W3-border-right (d) W3-border-center
classes that can describe their differences 44. In Google's AngularJS, what does MVC stand
from other classes./meceeveleeDeeW keâe mecetn yeveevee for?
Deewj Ssmes keäueeme yeveevee pees DevÙe keäueemeeW mes Gvekesâ ietieue kesâ Sbieguej pesSme ceW, MVC keâe hetCe& ™he keäÙee nw?
DeblejeW keâe JeCe&ve keâj mekeWâ~ (a) Model-variable-controller
(c) The process of an object controlling outside cee@[ue-JesefjSyeue-kebâš^esuej
access to its internal data. (b) Model-view-container/cee@[ue-JÙet-kebâšsvej
efkeâmeer Jemleg keâer Øeef›eâÙeeDeeW pees Gmekesâ Deebleefjkeâ [sše lekeâ (c) Micro-variable-constant/ceeF›eâes-JesefjSyeue-keâebmšWš
yeenjer hengBÛe keâes efveÙebef$ele keâjleer nw~ (d) Model-view-controller/cee@[ue-JÙet-kebâš^esuej
(d) The collection of methods that an objects 45. Which one of the following is the correct
implements that can be called by other definition of the „„is_array();‟‟ function in
objects./efJeefOeÙeeW keâe meb«en pees Skeâ Jemleg ueeiet keâjlee nw C++?/efvecveefueefKele ceW mes keâewve-meer C++ ceW
efpemes DevÙe JemlegDeeW Éeje yegueeÙee pee mekeâlee nw~ „„is_array();‟‟ HebâkeäMeve keâer mener heefjYee<ee nw?
39. LIFO order is used in which of the following (a) It checks that the specified variable is of the
data structures?/efvecveefueefKele ceW mes efkeâme [sše array or not. /Ùen peeBÛe keâjlee nw efkeâ efveefo&° Ûej keâe
mebjÛevee ceW LIFO Dee@[&j keâe GheÙeesie efkeâÙee peelee nw? nw Ùee veneR~
(a) Queue/keäÙet (b) Linked list/efuebkeä[ efuemš (b) It checks that the specified array is of single
(c) Trees/š^erpe (d) Stack/mšwkeâ dimension or not. /Ùen peeBÛe keâjlee nw efkeâ efveefo&°
40. Special files define devices for the system or are meejCeer Skeâue DeeÙeece Jeeueer nw Ùee veneR
temporary files created by processes. FIFO is a (c) It checks that the array specified is of multi-
special types of file, which –––––./efJeMes<e heâeFueW, dimension or not. /Ùen peeBÛe keâjlee nw efkeâ efveefo&°
efmemšce kesâ efueS GhekeâjCeeW keâes heefjYeeef<ele keâjleer nQ Ùee mejCeer yeng-DeeÙeece Jeeueer nw Ùee veneR~
Øeef›eâÙeeDeeW Éeje yeveeF& ieF& DemLeeÙeer heâeFueW nesleer nQ~ heâerheâes (d) More than one of the above/GheÙeg&keäle ceW mes Skeâ mes
(FIFO) Skeâ efJeMes<e Øekeâej keâer heâeFue nw, pees .......~ DeefOekeâ
198 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
46. What is the value of „p‟ in the following C++ (c) Program/Øees«eece
code snippet?/efvecveefueefKele C++ keâes[ efmvehesš ceW „p‟ (d) More than one of the above
keâe ceeve keäÙee nw? GheÙeg&òeâ ceW mes Skeâ mes DeefOekeâ
1. #include <iostream> 50. All members of a structure in C+ + are _____
2. usingnamespacestd; by default.
3. int main() C+ + ceW, structure kesâ meYeer meomÙe ef[heâe@uš
4. { (default) ™he mes _____ nesles nQ~
5. int p; (a) Public
6. bool a = true; (b) Private
7. bool b = false; (c) Protected
8. int x = 10; (d) More than one of the above
9. int y = 5; GheÙeg&òeâ ceW mes Skeâ mes DeefOekeâ
10. p = ((x | y) + (a + b));
51. Which of the following is used to store date and
11. cout << p;
time with milliseconds and time
12. return 0;
zone?/efvecveefueefKele ceW mes efkeâmekeâe GheÙeesie efceueermeskebâ[
13. }
(a) 12 (b) 16 Deewj meceÙe peesve kesâ meeLe efoveebkeâ Deewj meceÙe keâes
(c) 2 meb«enerle keâjves kesâ efueS efkeâÙee peelee nw?
(d) More than one of the above (a) int (b) date
GheÙeg&keäle ceW mes Skeâ mes DeefOekeâ (c) float (d) timestamp
47. #include <stdio.h> 52. A series of instructions written by a programmer
int main() according to a given set of rules or conventions is
{ called………../efoÙes ieÙes efveÙece kesâ DeeOeej hej Ùee hejcheje
int i = 5, j = 10, k = 15; kesâ DeeOeej hej Øees«eecej Éeje efueKes ieÙes efveoxMeeW keâer ëe=K
b euee
printf(\"%d\", sizeof(k/=i+j)); keâes ........... keânles nw~
printf(\"%d\", k); (a) Syntax/efmebšwkeäme (b) A Byte/Skeâ yeeF&š
return 0; (c) A Set/Skeâ mesš (d) Macro/cew›eâes
}
Assume size of an integer as 4 bytes. What is
53. efvecveefueefKele ceW mes keâewve-mee SuieesefjLece keâe «eeefheâkeâue
the output of above program?/ceeve ueerefpeS efkeâ ØeefleefveefOelJe nw?
hetCeeËkeâ keâe Deekeâej 4 yeeFšdme nw~ Ghejesòeâ Øees«eece keâe (a) Øees«eeefcebie (Programming)
DeeGšhegš keäÙee nw? (b) mee@heäšJesÙej (Software)
(a) 2 1 (b) 4 1 (c) heäuees Ûeeš& (Flow chart)
(c) 4 15 (d) mÙet[eskeâes[ (Pseudocode)
(d) More than one of the above 54. Which of the following enables us to pass data
GheÙeg&òeâ ceW mes Skeâ mes DeefOekeâ between a program and a class?
48. Which one of the following is the correct Øees«eece Deewj keäueeme kesâ yeerÛe [eše keâes Debleefjle keâjvee
definition of “is_array( );” function in C++? efvecveefueefKele kesâ keâejCe mebYeJe neslee nw
efvecveueefKele ceW mes keâewve-meer ‘is_array( );’ keâer mener (a) Functions/ heâueve (b) Properties/ iegCe
heefjYee<ee C++ ceW keâeÙe& keâjlee nw? (c) Procedures/ Øeef›eâÙee (d) Variables/ Ûej
(a) It checks that the specified variable is of the 55. A/An_____is a step by-step procedure, which
array or not/Ùen peeBÛelee nw efkeâ efveefo&° JesefjSyeue Ssjs defines a set of instructions to be executed in a
keâe nw Ùee veneR certain order to get the desired output.
(b) It checks that the specified array is of single A/An ________ Skeâ ÛejCe-oj-ÛejCe Øeef›eâÙee nw, pees
dimension or not/Ùen peeBÛelee nw efkeâ efveefo&° meejCeer JeebefÚle DeeGšhegš Øeehle keâjves kesâ efueS Skeâ efveef§ele ›eâce
Skeâue DeeÙeece keâer nw Ùee veneR ceW efve<heeefole nesves Jeeues efveoxMeeW kesâ Skeâ mesš keâes
(c) It checks that the specified array is of multi- heefjYeeef<ele keâjlee nw~
dimension or not (a) order/›eâce (b) algorithm/SuieesefjLce
(d) More than one of the above (c) sequence/Deveg›eâce (d) protocol/Øeesšekeâe@ue
GheÙeg&òeâ ceW mes Skeâ DeefOekeâ 56. Which function should we use to sort the array
49. Group of instructions that directs a computer in natural order?
is called. Øeeke=âeflekeâ ›eâce ceW mejCeer keâes mee@š& keâjves kesâ efueS nceW
keâchÙetšj keâes efoMee osves Jeeues instructions kesâ mecetn efkeâme HebâkeäMeve keâe GheÙeesie keâjvee ÛeeefnS?
keâes keâne peelee nw? (a) natcasesort () (b) casesort ()
(a) Memory/cesceesjer (c) naturalsort ()
(b) Storage/mšesjspe (d) More than one of the above

199 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
57. Which of the following is an advantage of using 63. Which of the following is not the part of a
arrays?/efvecveefueefKele ceW mes keâewve-mee Ssjs keâe GheÙeesie compiler?/keâewve keâcheeFuej keâe Yeeie veneR nw–
keâjves keâe ueeYe nw? (a) Semantic Analyzer/mescewefvškeâ SveeueeFpej
(a) Constant time insertion and deletion (b) Code Generator/keâes[ pevejsšj
efvejblej meceÙe ØeefJeeq<š Deewj efJeueesheve (c) Lexical Analyzer/uesefkeäpekeâue SveeueeFpej
(b) Ability to store elements of different data (d) Linker/efuevkeâj
types/efJeefYevve [sše ØekeâejeW kesâ lelJeeW keâes meb«enerle keâjves 64. A computer program that converts an
keâer #ecelee assembly language program into equivalent
(c) Random access to elements using an index machine language program is called
Fb[skeäme keâe GheÙeesie keâjkesâ lelJeeW lekeâ ÙeeÂeqÛÚkeâ hengBÛe Skeâ keâchÙetšj Øees«eece, pees Smescyueer Yee<ee (assembly
(d) More than one of the above language) kesâ Øees«eece keâes meceleguÙe ceMeerve Yee<ee
GheÙeg&òeâ ceW mes Skeâ mes DeefOekeâ (machine language) kesâ Øees«eece ces yeoue oslee nw, Gme
58. What does X stand for in document formatting Øees «eece keâes keâne peelee nw
language "XML"?/[e@keäÙetceWš heâe@cexefšbie ueQiJespe (a) Compiler/keâcheeFuej (b) Assembler/Smescyeuej
"XML" ceW X mes keäÙee DeeMeÙe nw? (c) linker/efuevkeâj
(a) Expandable/Fkeämhewv[yeue (d) More than one of the above/GheÙeg&òeâ ceW mes Skeâ mes
(b) Executive/FipeskeäÙetefšJe DeefOekeâ
(c) Extensible/Fkeämšsefvmeyeue 65. Palm operating system is an example of _____.
(d) None of these/FveceW mes keâesF& veneR heece Dee@hejsefšbie efmemšce ........ keâe GoenjCe nw~
59. Which of the following is not an example of (a) multiuser/multitasking
utility software?/efvecveebefkeâle ceW mes keâewve Ùetefšefuešer ceušerÙetpej/ceušeršeefmkebâie
(GheÙeesefielee) mee@HeäšJesÙej keâe Øekeâej veneR nw? (b) single-user/multitasking
(a) Anti-virus/SbšerJeeÙejme
efmebieue-Ùetpej/ceušeršeefmkebâie
(c) single-user/single tasking
(b) Backup Software/yewkeâDehe mee@HeäšJesÙej
efmebieue-Ùetpej/efmebieue šeefmkebâie
(c) Browser/yeÇeG]pej (d) real time/efjÙeue šeFce
(d) Disk tools/ef[mkeâ štume 66. The process of starting a computer by initiating
60. Which one of the following is not a function of through hardware such as a button press, or by
the Operating System ? a software command is called..............
efvecveefueefKele ceW keäÙee Dee@hejsefšbie efmemšce keâe keâeÙe& veneR nw? ne[&JesÙej kesâ ceeOÙece mes Meg® keâjves keâer Øeef›eâÙee pewmes-
(a) Resource Management/meeOeve ØeyebOeve yešve Øesme, Ùee mee@heäšJesÙej keâceeb[ Éeje keâchÙetšj Meg®
(b) File Management/heâeFue ØeyebOeve keâjves keâer Øeef›eâÙee keânueeleer nw–
(c) Networking/vesšJeefkeËâie (a) Restoring/jermšesefjbie (b) Booting/yetefšbie
(d) Processor Management/Øeesmesmej ØeyebOeve (c) Operating/Dee@hejsefšbie (d) Resetting/jermesefšbie
61. Anti-virus softwere must be regularly updated 67. Ubuntu, Mint and Fedora are versions of
else:-/Sbšer- JeeÙejme mee@heäšJesÙej keâes efveÙeefcele ™he mes Gyeblet (Ubuntu), efcebš (Mint) Deewj hesâ[esje (Fedora)
Dehe[sš efkeâÙee peevee ÛeeefnS Jejvee:- FveceW mes efkeâmekesâ mebmkeâjCe (versions) nw?
(a) Linux/efuevekeäme
(a) New viruses wouldn’t be recognized
(b) Apple MAC OS X/Sheue cewkeâ DeesSme Skeäme
veS JeeÙejme %eele veneR nes heeÙeWies
(c) Windows 10/efJeb[espe 10
(b) None of these/FveceW mes keâesF& Yeer veneR
(d) MS DOS/SceSme [e@me
(c) Software will become corrupt 68. With respect to operating systems, which of the
mee@heäšJesÙej keâjhš nes peeSiee following is NOT a valid process state?
(d) Both of these/Ùes oesveeW Dee@hejsefšbie efmemšce kesâ mebyebOe ceW efvecveefueefKele ceW mes keâewve
62. Adobe Premiere, Apple iMovie and Microsoft Skeâ JewOe Øeef›eâÙee efmLeefle veneR nw?
Windows Movie Maker2 are examples of:/Adobe (a) Ready (b) Waiting
premiere, Apple iMovie Deewj Microsoft Windows (c) Running (d) Starving
Movie Maker2 Fmekesâ GoenjCe nw- 69. Which component of operating system provides
(a) Presentation software/ØespeWšsMeve mee@heäšJesÙej the user interface to interact with the kernel
(b) Digital camera software/ef[efpešue kewâceje and hardware?/Dee@hejsefšbie efmemšce keâe keâewve-mee
mee@heäšJesÙej Ieškeâ keâvexue Deewj ne[&JesÙej kesâ meeLe Fbšjwkeäš keâjves kesâ
(c) Video editing software/Jeeref[Ùees Sef[efšbie mee@heäšJesÙej efueS Ùetpej Fbšjhesâme Øeoeve keâjlee nw?
(d) Graphics software/«eeefheâkeäme mee@heäšJesÙej (a) Device driver/ef[JeeFme [^eFJej
(b) Processor/Øeesmesmej
200 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
 (c) Shell/mesue following is/are examples of optical input
(d) Register/jefpemšj devices?/Dee@efhškeâue Fvehegš ef[JeeFme kebâhÙetšj keâes
70. On systems where there are multiple operating Fvehegš kesâ œeesle kesâ ™he ceW ueeFš keâe GheÙeesie keâjves keâer
system, the decision to load a particular one is Devegceefle oslee nw~ efvecveefueefKele ceW mes keâewve-mee
done by _______. Dee@efhškeâue Fvehegš ef[JeeFme keâe GonejCe nw?
Gve ØeCeeefueÙeeW hej peneb keâF& Deehejsefšbie efmemšce nesles nQ, (i) Scanner/mkewâvej
efkeâmeer efJeMes<e keâes uees[ keâjves keâe efveCe&Ùe _______ Éeje (ii) MICR
efkeâÙee peelee nw (a) Only (i)/kesâJeue (i)
(a) Process control block (b) Neither (i) nor (ii)/ve lees (i) Deewj ve ner (ii)
(b) File control block
(c) Only (ii)/kesâJeue (ii)
(c) Boot loader
(d) More than one of the above (d) Both (i) and (ii)/(i) Deewj (ii) oesveeW
71. An error in a computer is also knows as 77. As per classification which cannot be called
keâchÙetšj ceW $egefš keâes Fme ™he ceW Yeer keâne peelee nw– “Computer”?
JeieeakeâjCe kesâ Devegmeej efkeâmes ‘keâchÙetšj’ veneR keâne pee
(a) debug/[eryeie
mekeâlee nw?
(b) bug/yeie
(a) Workstations (b) Mainframe
(c) cursor/keâme&j (c) Minicomputer (d) Ubuntu
(d) none of these/FveceW mes keâesF& veneR 78. Who developed the 3D printing technology?
72. ______ Also refers to legitimate software that efvecveefueefKele ceW mes 3D efØebefšbie lekeâveerkeâ keâes efkeâmeves
monitor your data for commercial purposes efJekeâefmele efkeâÙee?
like advertising?
(a) Charles Babbage/Ûeeume& yewyespe
______, JewOe mee@heäšJesÙej keâes Yeer meboefYe&le keâjlee nw pees
(b) Charles Hull/Ûeeume& nue
efJe%eeheve pewmes JÙeeJemeeefÙekeâ GösMÙeeW kesâ efueS Deehekesâ [sše
(c) Scott Crump/mkeâe@š ›eâche
keâes cee@efvešj keâjlee nw~
(d) Emanuel Sachs/SceevegSue mewkeäme
(a) Spyware/mheeFJesÙej
79. Which types of computer are used in hospitals
(b) Jailbreaking/pesueyeÇsefkebâie like ECG and DIALYSIS?
(c) Man-in-the-Middle attacks efkeâme Øekeâej kesâ keâchÙetšme& keâe GheÙeesie efÛeefòeâmeeueÙeeW ceW
cewve-Fve-o-efceef[ue Dešwkeâ F&.meer.peer., Deewj [eÙeeefueefmeme kesâ efueS neslee nw?
(d) Phishing/ef]heâefMebie (a) Digital/[erefpešue (b) Hybrid/neFefyeÇ[
73. Which of the following is not an operating
(c) Analog/Sveeuee@ie
system?
efvecveebefkeâle ceW mes keâewve-mee Dee@hejsefšbie efmemšce (d) Microcomputer/ceeF›eâeskeâchÙetšj
(operating system) veneR nw? 80. For which of the following is an interrupt
mechanism NOT required?/efvecveefueefKele ceW mes efkeâmekesâ
(a) Linux/efuevekeäme
efueS Fbšjhš cewkesâefvepce keâer DeeJeMÙekeâlee veneR nw?
(b) Windows/efJev[espe
(a) When programs request a system call to be
(c) Oracle/Deesjskeâue performed by the operating system
(d) More than one of the above/GheÙeg&òeâ ceW mes Skeâ mes peye Øees«eece Dee@hejsefšbie efmemšce Éeje efmemšce keâe@ue keâjves
DeefOekeâ keâe DevegjesOe keâjles nw~
74. Who proposed the spiral model? (b) To give the user better control over the
mheeFjue cee@[ue keâe ØemleeJe efkeâmeves efoÙee? computer/GheÙeesiekeâlee& keâes keâchÙetšj hej yesnlej efveÙeb$eCe
(a) Barry Boehm osves kesâ efueS~
(b) Pressman (c) To allow the processes to manage shared
(c) Royce data/Øeef›eâÙeeDeeW keâe meePee [sše ØeyebefOele keâjves keâer
(d) More than one of the above Devegceefle osves kesâ efueS~
75. Printing-device resolutions are measured (d) To handle mismatch between CPU and device
in/efhebÇefšbie-ef[JeeFme efjpee@uÙetMeve keâes efkeâme Øekeâej mes speeds/meer.heer.Ùet. Deewj ef[JeeFme keâer ieefle kesâ yeerÛe
ceehee peelee nw? Demeblegueve keâes mebYeeueves kesâ efueS~
(a) Dots per inch /[e@šdme hej FbÛe 81. Which bus is used to specify memory locations
(b) Bits per inch /efyešdme hej FbÛe for the data being transferred?/[sše š^ebmeheâj keâjves
(c) Pictures per inch /efhekeäÛeme& hej FbÛe kesâ efueS cesceesjer ueeskesâMeve efveefo&° keâjves kesâ efueS efkeâme
(d) Images per inch /Fcespesme hej FbÛe yeme keâe GheÙeesie efkeâÙee peelee nw?
76. Optical input devices allow computers to use (a) Control bus/kebâš^esue yeme (b) Data bus/[sše yeme
light as a source of input. Which of the (c) Address bus/S[^sme yeme (d) I/O bus/yeme

201 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
82. Which of the following CPU registers contains the kewâMes Deewj cesve cesceesjer efyepeueer yebo efkeâS peeves hej Deheves
address of the next instruction to be executed?/ lelJeeW keâes Kees osles nQ, Jes keânueeles nw:
efvecveefueefKele ceW mes efkeâme CPU jefpemšj ceW efve<heeefole efkeâS (a) Dynamic/[eÙeveeefcekeâ
peeves Jeeues Deieues Fbmš^keäMeve keâe S[^sme neslee nw? (b) Static/mšsefškeâ
(a) Accumulator/SkeäÙegceguesšj (c) Volatile/JeesueešeFue
(b) Memory address register/cesceesjer S[^sme jefpemšj (d) Non-volatile/vee@ve JeesuešeFue
(c) Memory buffer register/cesceesjer yeheâj jefpemšj 88. What is a segment base in
(d) Program counter/Øees«eece keâeGbšj segmentation?/efJeYeepeve ceW Keb[ DeeOeej keäÙee nw?
83. The register which holds the address of (a) The starting address of a segment in physical
location of memory to and from which data are memory/Yeeweflekeâ cesceesjer ceW efkeâmeer Keb[ keâe ØeejbefYekeâ
to be transferred is known as/Jen jefpemšj, efpemeceW helee
cesceesjer kesâ mLeeve keâe helee neslee nw peneB mes Ùee peneB lekeâ (b) The starting address of a segment in virtual
memory/JeÛeg&Deue cesceesjer ceW Skeâ mesieceWš keâe ØeejbefYekeâ
[sše mLeeveebleefjle efkeâÙee peeve neslee nw, keânueelee nw helee
(a) index register/Fv[skeäme jefpemšj (c) The ending address of a segment in physical
(b) memory address register/ cesceesjer Ss[^sme jefpemšj memory/Yeeweflekeâ cesceesjer ceW efkeâmeer Keb[ keâe Debeflece helee
(c) memory buffer register/ cesceesjer yeheâj jefpemšj (d) More than one of the above/GheÙeg&òeâ ceW mes Skeâ mes
(d) More than one of the above/GheÙeg&òeâ ceW mes Skeâ mes DeefOekeâ
DeefOekeâ 89. Which of the following registers holds the
84. The basic computation unit of the Central contents of data or instruction read from, or
Processing Unit (CPU) is known as? written in memory?/efvecveefueefKele ceW mes keâewve-mee
meWš^ue Øeesmesefmebie Ùegefveš (meer.heer.Ùet) keâer cetue mebieCevee jefpemšj cesceesjer mes heÌ{s ieS Ùee cesceesjer ceW efueKes ieS [sše
FkeâeF& keâes keäÙee keânles nQ? Ùee efveoxMe keâe keâvšsvš jKelee nw?
(a) Core/keâesj (a) Memory Buffer Register/cesceesjer yeheâj jefpemšj
(b) Processor/Øeesmesmej (b) Memory Address Register/cesceesjer S[^sme jefpemšj
(c) Random Access Memory (RAM) (c) Index Register/Fv[skeäme jefpemšj
jwC[ce Skeämesme cesceesjer (jwce) (d) Program Counter/Øees«eece keâeGbšj
(d) Disc/ef[mkeâ 90. Which of the following statements about
85. UNIVAC I henuee meeceevÙe-GösMÙe Jeeuee Fueskeäš^e@evf ekeâ PROM is true?
ef[efpešue kebâhÙetšj Lee, efpemes mebÙegòeâ jepÙe Decesefjkeâe ceW PROM kesâ yeejs ceW FveceW mes keâewve mes keâLeve mener nQ?
keâe@heexjsš DevegØeÙeesieeW kesâ efueS ef[peeFve efkeâÙee ieÙee Lee~ (i) It is a sequential access memory.
UNIVAC keâe hetCe&™he keäÙee nw? Ùen Skeâ meerkeäJeWefMeÙeue Skeämesme cesceesjer nw~
(a) Universal Automatic Computer (ii) It is a magnetic memory.
(ÙetefveJeme&ue Dee@šescesefškeâ kebâhÙetšj) Ùen Skeâ ÛegbyekeâerÙe cesceesjer nw~
(b) United Automatic Computer (iii) It is a non-volatile memory.
(ÙetveeFšs[ Dee@šescesefškeâ kebâhÙetšj) Ùen Skeâ vee@ve-JeesuesšeFue cesceesjer nw~
(c) Universal Automatic Calculator (a) (i) and (iii)/(i) Deewj (iii)
(ÙetefveJeme&ue Dee@šescesefškeâ kewâuekegâuesšj) (b) Only (ii)/kesâJeue (ii)
(d) Universal Asynchronous Computer (c) Only (iii)/kesâJeue (iii)
(ÙetefveJeme&ue Deefmeb›eâesveme kebâhÙetšj) (d) (ii) and (iii)/(ii) Deewj (iii)
86. The program instructions are represented in 91. efvecveefueefKele ceW mes efkeâme cesceesjer keâes kegâÚ meceÙe Deblejeue
binary and stored in the _______ from which hej efvejblej efjøesâMe keâjves keâer DeeJeMÙekeâlee nesleer nw?
they are fetched, decoded and executed by the (a) kewâMe cesceesjer (b) meskeWâ[jer cesceesjer
CPU. (c) SRAM (d) DRAM
Øees«eece kesâ efveoxMeeW keâes yeeFvejer ceW oMee&Ùee ieÙee nw Deewj 92. 'Nibble' in computer terminology is also called___.
_____ ceW meb«enerle efkeâÙee ieÙee nw efpemeceW mes Jes meerheerÙet keâchÙetšj MeyoeJeueer ceW ‘efveyeue’ (Nibble) keâes ____ Yeer
Éeje Øeehle, ef[keâes[ Deewj efve<heeefole efkeâS ieS nQ~ keâne peelee nw~
(a) memory (b) memory and chip (a) Half bit /DeeOee efyeš (b) Byte /yeeFš
(c) chip (d) control unit
(c) Half byte /DeeOee yeeFš (d) Bit /efyeš
87. Cache and main memory will loose their
contents when the power is off. They are____ . 93. In memory mapped I/O
cesceesjer-cewh[ ceW efkeâS ieS I/O
202 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
 (a) the I/O devices and the memory share the peye Fvehegš ceeve Deueie-Deueie neslee nw, lees efvecve ceW mes
same address space/ I/O ef[JeeFme Deewj cesceesjer Skeâ efkeâme uee@efpekeâ iesš keâe DeeGšhegš 0 neslee nw~
ner heles keâes meePee keâjles nQ (a) OR
(b) the I/O devices have a separate address space/ (b) XNOR
I/O GhekeâjCeeW keâe Skeâ Deueie helee neslee nw (c) XOR
(c) the memory and I/O devices\ have an (d) NAND
associated address space/cesceesjer Deewj I/O 98. The numbers of inputs and outputs in a half
GhekeâjCeeW ceW Skeâ mecyeæ helee mLeeve neslee nw adder circuit, respectively, are:
(d) More than one of the above/GheÙeg&òeâ ceW mes Skeâ DeeOes Ùeespekeâ meefke&âš ceW ›eâceMe: Fvehegš Deewj DeeGšhegš
DeefOekeâ keâer mebKÙee nw-
94. Find the logic equation for the truth table (a) 2 and 1/2 Deewj 1
given: (b) 4 and 2/4 Deewj 2
efoS ieS šÎLe šsyeue kesâ efueS uee@efpekeâ FkeäJesMeve KeespeW – (c) 1 and 1/1 Deewj 1
A B Y (d) 2 and 2/2 Deewj 2
0 0 0 99. What is De Morgan‟s theorem used for in
0 1 1 digital logic?/ ef[efpešue leke&â ceW [er cee@ie&ve ØecesÙe keâe
1 0 0 GheÙeesie efkeâme efueS efkeâÙee peelee nw?
1 1 1
(a) Simplifying Boolean expressions/yetefueÙeve
(a) Y AB * A B (b) Y AB AB
DeefYeJÙeefòeâÙeeW keâes mejue yeveevee
(c) Y AB * B (d) Y B (b) Implementing NAND gates/NAND iesšdme keâe
95. If represents XOR Gate in (Boolean algebra) keâeÙee&vJeÙeve
and A B = C, then B C equals to: (c) Performing binary addition/yeeFvejer peesÌ[ keâjvee
Ùeefo yetueerÙe yeerpeieefCele Boolean algebra ceW , (d) More than one of the above/GheÙeg&òeâ ceW mes Skeâ mes
XOR iesš keâes efve™efhele keâjlee nw Deewj A B = C, lees DeefOekeâ
B C efkeâmekesâ yejeyej nw? 100. Which characteristic of IC in Digital Circuits
(a) 1 (b) A represents a function of the switching time of
(c) A' (d) 0 a particular transistor?
96. If x is a Boolean variable, then (((x')')')' will be ef[efpešue meefke&âš ceW IC keâer keâewve meer efJeMes<elee efkeâmeer
Deiej x yetefueÙeve JewefjSyeue nw, lees (((x')')')' nesiee efJeMes<e š^ebefpemšj kesâ efmJeÛeve meceÙe kesâ Skeâ meceejesn keâe
(a) x' ØeefleefveefOelJe keâjleer nw?
(b) x (a) Fan - out
(c) x + x' (b) Fan - in
(d) More than one of the above/GheÙeg&òeâ ceW mes Skeâ mes (c) Propagation delay
DeefOekeâ (d) More than one of the above
97. Which of the following logic gates outputs 0
when the input values are different?

SOLUTION : PRACTICE SET- 7

ANSWER KEY
1. (a) 11. (c) 21. (b) 31. (a) 41. (a) 51. (d) 61. (a) 71. (b) 81. (c) 91. (d)
2. (a) 12. (a) 22. (c) 32. (b) 42. (a) 52. (a) 62. (c) 72. (a) 82. (d) 92. (c)
3. (d) 13. (b) 23. (b) 33. (b) 43. (d) 53. (c) 63. (d) 73. (c) 83. (b) 93. (a)
4. (b) 14. (c) 24. (c) 34. (b) 44. (d) 54. (b) 64. (b) 74. (a) 84. (a) 94. (d)
5. (c) 15. (a) 25. (b) 35. (c) 45. (a) 55. (b) 65. (c) 75. (a) 85. (a) 95. (b)
6. (d) 16. (a) 26. (a) 36. (b) 46. (e) 56. (a) 66. (b) 76. (d) 86. (a) 96. (b)
7. (d) 17. (c) 27. (b) 37. (c) 47. (c) 57. (c) 67. (a) 77. (d) 87. (c) 97. (b)
8. (c) 18. (c) 28. (c) 38. (c) 48. (a) 58. (c) 68. (d) 78. (b) 88. (a) 98. (d)
9. (b) 19. (a) 29. (c) 39. (d) 49. (c) 59. (c) 69. (c) 79. (b) 89. (a) 99. (d)
10. (c) 20. (d) 30. (a) 40. (a) 50. (a) 60. (c) 70. (c) 80. (c) 90. (c) 100. (c)

203 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
 SOLUTION
1. (a) 7. (d)
huesšHeâece&-Spe-S-meefJe&me keâes Skeâ mesJee kesâ ™he ceW cebÛe keâes ‘‘Dee@ve- IoT (Fbšjvesš Dee@heâ efLebime) ken lejerkeâe nw pees efyevee efkeâmeer ceevekeerÙe
ef[ceeb[ mee@heäšJesÙej’’ kesâ ™he ceW Yeer peevee peelee nw~ Ùen Skeâ nmle#eshe kesâ vesškeke&â ceW DevÙe GhekeâjCeeW kesâ meeLe mebÛeej keâj mekeâlee nw~
mee@heäšJesÙej efJelejCe cee@[ue nw, efpemeceW mesJeeDeeW keâes keäueeG[ mesJee IoT ceW, ef[keeFme Skeâ vesškeke&â ceW pegÌ[s nesles nQ~ mceeš& nsuLekesâÙej
Øeoelee Éeje nesmš efkeâÙee peelee nw~ Ùes mesJeeSb Fbšjvesš hej Debeflece SefhuekesâMeve, mceeš& keenve SefhuekesâMeve Deewj mceeš& Øeot<eCe efveÙeb$eCe
GheÙeesiekeâlee&DeeW kesâ efueS GheueyOe nesleer nw, FmeefueS Debeflece IoT kesâ DevegØeÙeesie nQ~
GheÙeesiekeâlee&DeeW keâes Fve mesJeeDeeW lekeâ hengBÛeves kesâ efueS Deheves GhekeâjCeeW 8. (c)
hej keâesF& mee@heäšJesÙej mLeeefhele keâjves keâer DeeJeMÙekeâlee veneR nesleer~ GheÙeg&òeâ oer ieF& Yee<eeDeeW ceW, Perl keâe GheÙeesie Deeceleewj hej AI kesâ
GheÙeesiekeâlee&DeeW keâer DeØelÙeeefMele mebKÙee keâes mebYeeueves Deewj F&-cesue efueÙes vener efkeâÙee peelee nw~ LISP Deewj PROLOG oes Yee<eeSb nQ
mesJeeDeeW hej ueesÌ[ keâjves kesâ efueS keâF& F&-cesue Øeoelee meeHeäšJesÙej-Spe- efpevekeâe JÙeehekeâ ™he mes AI kesâ efueÙes GheÙeesie efkeâÙee peelee nw Deewj
S-meefJe&me (SaaS) keâe GheÙeesie keâjkesâ Deheveer mesJeeSb Øeoeve keâjles nw~ Python keâe GheÙeesie Yeer AI ceW efkeâÙee peelee nw~
2. (a) 9. (b)
kesâ efveÙejsmš vesFyej (KNN) keâes ues]peer ueefveËie SuieesefjLce Yeer keâne Suieesefjoce keâe hejer#eCe [sše keâe GheÙeesie keâjkesâ efkeâÙee peelee nw leeefkeâ
peelee nw keäÙeeWefkeâ peye nce Fme SuieesefjLce keâes ØeefMe#eCe [sše keâer Ùen megefveef§ele efkeâÙee pee mekesâ efkeâ Jes mener {bie mes keâece keâjles nQ Deewj
Deehetefle& keâjles nQ, lees SuieesefjLce Kego keâes efyeukegâue Yeer ØeefMeef#ele veneR Dehesef#ele heefjCeece osles nQ~ Suieesefjoce ceW efJeefYeVe [sše mesš Fvehegš
keâjlee nw~ keâjkesâ, Deehe Fmekesâ JÙeJenej keâe efvejer#eCe keâj mekeâles nQ Deewj Fmekeâer
3. (d) mešerkeâlee,o#elee Deewj Megælee keâes melÙeeefhele keâj mekeâles nQ~
SDeeF& kesâ heâeÙeos megkÙekeefmLele keâjvee, meceÙe keâer yeÛele keâjvee, hetkee&«eneW 10. (c)
keâes Kelce keâjvee Deewj oesnjeS peeves keeues keâeÙeeX keâes mkeÛeeefuele keâjvee HTML ceW <head> šwie keâe GheÙeesie [e@keäÙetceWš kesâ cegKÙe Yeeie keâes
nw, SDeeF& kesâ keâejCe 24x7 keâer GheueyOelee keâYeer veneR ®keâleer nw heefjYeeef<ele keâjves kesâ efueS efkeâÙee peelee nw efpemeceW [e@keäÙetceWš mes
ceevekeerÙe $egefš keâes keâce keâjleer nw keäÙeeWefkeâ Ùen yengle lesÌpe nw~ ndeefve- mecyeefvOele cesše[sše neslee nw~ Fme šwie ceW DevÙe ØecegKe SefueceWš nes
cenbiee keâeÙee&vJeÙeve mebYeeefkele ceeveke veewkeâjer neefve Yeekevee Deewj mekeâles nw~ pewmes- <head>, <meta>, <link>, <style> Deeefo
jÛeveelcekeâlee keâer keâceer pewmeer ÛeerpeW nQ Deewj Ùen ceeveke jÛeveelcekeâlee keâer 11. (c)
vekeâue veneR keâj mekeâlee nw~ PDF heâeFue heâe@cexš efkeâmeer keâe ceeefuekeâevee ceevekeâ veneR nw~
4. (b)
PDF keâe hetje veece heesšxyeue [e@keäÙetceWš heâe@cexš nw Fmes Adobe Éeje
DeeF&Deesšer ceW meWmej Skeâ GhekeâjCe nw pees Skeâ efJeefMe° Yeeweflekeâ cee$ee
efJekeâefmele efkeâÙee ieÙee nw~ PDF heâeFueW Skeâ efveef§ele uesDeeGš ceW Skeâ
keâe helee ueieelee nw Ùee ceehelee nw Deewj Fmes otmejs ¤he ceW, Deeceleewj hej
[e@keäÙetceWš Øemlegle keâjleer nw pees efJeefYeVe Øees«eeceeW, ne[&JesÙej Deewj
efJeÅegle heume ceW heefjJeefle&le keâjlee nw~ meWmej Éeje ØeeflemLeeefhele peevekeâejer
keâes ceveg<ÙeeW Deewj ceMeerveeW Éeje Deueie efkeâÙee pee mekeâlee nw~ meWmej ves Dee@hejsefšbie efmemšce ceW Fmekeâe DevegJeeo keâjleer nw~ Ùen Ùetpeme& keâes Skeâ
efkeâmeer Yeer efmLeefle ceW [sše Skeâ$e keâjvee mebYeJe yevee efoÙee nw~ ner [e@keäÙetceWš ceW efJeefYeVe FcespeeW, heâe@vš Deewj šskeämš heâe@cexš keâe
5. (c)
GheÙeesie keâjves keâer Devegceefle oslee nw~
MQTT (Message Queuing Telemetry Transport) Skeâ 12. (a)
lightweight Deewj publish subscribe DeeOeeefjle messaging ceušerceeref[Ùee Skeâ ceeOÙece neslee nw efpemekesâ Éeje efJeefYevve Øekeâej keâer
Øeesšeskeâe@ue nw, pees IoT ef[JeeFmeeW kesâ yeerÛe mebÛeej kesâ efueS yengle ner peevekeâeefjÙeeW keâes efJeefJeOe Øekeâej kesâ ceeOÙeceeW pewmes- šskeämš, Deeef[Ùees,
ueeskeâefØeÙe nw~ «eeef h eâkeäme, Sveer ces M eve, Jeer e f [ Ùees Deeef o keâe meb Ùeespeve keâj oMe&keâeW lekeâ
HTTP Deewj FTP Yeer Øeesšeskeâe@ue nw, uesefkeâve Ùes IoT Specific veneR hengbÛeeÙee peelee nw~ ceušerceeref[Ùee ceW «eeefheâkeäme, SveercesMeve, Jeeref[Ùees,
nw, yeefukeâ meeceevÙe Jesye Deewj HeâeFue š^ebmeHeâj kesâ efueS GheÙeesie efkeâS mebieerle Deewj DeeJeepe nes mekeâleer nw~
peeles nw~ 13. (b)
6. (d) F&-ieJeveXme keâe ueeYe ‘keâce heejoefMe&lee’ veneR nw~ yeefukeâ, F&-ieJeveXme keâe
IoT (Internet of Things) efmekeäÙeesefjšer LeÇsš Jes mebYeeefJele KelejW nw Skeâ ØecegKe GösMÙe heejoefMe&lee yeÌ{evee neslee nw, efpememes veeieefjkeâeW kesâ
pees IoT ef[JeeFme Deewj vesšJeke&â keâes ØeYeeefJele keâj mekeâles nw~ IoT efueS mejkeâejer Øeef›eâÙeeDeeW keâes mecePevee Deewj Gve lekeâ hengBÛe Deemeeve nes
efmekeäÙeesefjšer LeÇsšdme keâF& Øekeâej kesâ nesles nw~ pewmes– mekesâ~ F&-ieJeveXme kesâ ueeYeeW ceW mejkeâej keâe efJemle=le DeefYeiece, IeškeâeW keâer
(i) meesMeue FbpeerefveÙeefjbie ØelÙe#e Yeeieeroejer Deewj JeefOe&le megefJeOee Meeefceue nesles nw~
(ii) cewve-Fve-o-efceef[ue 14. (c)
(iii) jwvemeceJesÙej Fueskeäš^e@efvekeâ keâe@ceme& Ùee F&-keâe@ceme&, Skeâ JÙeJemeeÙe cee@[ue nw pees
(iv) efmveefhebâie JÙeJemeeÙe Deewj GheYeesòeâeDeeW keâes Dee@veueeFve Kejeroves Ùee yesÛeves keâer
(v) ef[efveÙeue Dee@Heâ meefJe&me (DoS) megefJeOee oslee nQ~ Ún ØecegKe F&-keâe@ceme& JÙeJemeeÙe cee@[ue nw~
204 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
1. Business to Consumer 23. (b)
2. Business to Business HeâeFyej Dee@efhškeâue kesâyeue ceW keâesSefkeämeÙeue Deewj šdeJf emšs[ heshej keâer leguevee
3. Business to Government ceW yengle uecyeer otjer lekeâ efmeiveue Yespeves keâer #ecelee nesleer nw~ FmeceW yengle
4. Business to Business to Consumer DeefOekeâ ieefle mes metÛevee ues peeves keâer #ecelee neslee nw~
5. Consumer to Consumer 24. (c)
6. Consumer to Business neheâ [ghuewkeäme, [sše š^e@meefceMeve ceW efkeâmeer ef[JeeFme ceW [sše Yespe
15. (a)
mekeâles nw, Ùee Øeehle keâj mekeâles nw~ oesveeW keâeÙe& Skeâ meceÙe hej veneR keâj
Jeu[& JeeF[ Jesye (WWW) kesâ meboYe& ceW, yegkeâceeke&â Skeâ ÙetefveHeâe@ce& mekeâles nw~
efjmeesme& DeeF[WefšHeâeÙej (URI) nw efpemes yeeo ceW hegveØee&efhle kesâ efueS
pewmes- Jeekeâer še@keâer Deeefo~
efJeefYeVe mšesjspe Øee¤heeW ceW meb«enerle efkeâÙee peelee nw~ yegkeâceeke&â JesyemeeFšeW
25. (b)
keâes menspeves Deewj JÙeJeefmLele keâjves keâe Skeâ Meeveoej lejerkeâe nw leeefkeâ
[eÙeue-Dehe-ueeFve, Fbšjvesš Skeämespe keâjves keâer Skeâ efJeefOe nw Ùen
Deehe GvnW efHeâj mes osKe mekeWâ~ keâveskeäMeve cee@[ce keâer meneÙelee mes mLeeefhele efkeâÙee peelee nw~ Ùen efmJeÛ[
16. (a)
ueeFve kesâ veece mes Yeer peevee peelee nw~
otjmLe šefce&veueeW Ùee ceeFkeâes keâchÙetšjeW kesâ ceeOÙece mes keâchÙetšj HeâeFueeW
26. (a)
ceW DeJewOe ØeJesMe Øeehle keâjves kesâ keâeÙe& keâes nwefkebâie keâne peelee nw~ nwefkebâie FJme[^eefhebie Skeâ Ssmeer Øeef›eâÙee nw efpemeceW efkeâmeer vesšJeke&â hej oes
Skeâ DeJewOe ieefleefJeefOe nw pees efkeâmeer DevÙe kesâ efmemšce ceW DeveeefOeke=âle JÙeefòeâÙeeW kesâ yeerÛe nes jner yeeleÛeerle keâes DeveeefOeke=âle ™he mes megvee Ùee
Skeämesme keâjves keâe ØeÙeeme keâjleer nw~ Fbšjmeshš efkeâÙee peelee nw, efJeMes<e ™he mes jerÙeue šeFce ceW~
17. (c)
27. (b)
mee@kesâš (Socket) vesšJeke&â cesb oes lejHeâe mebÛeej efuebkeâ keâe Skeâ Debeflece SQL keâe hetje veece mš^keäÛe[& keäJesjer ueQiJespe nw~ SQL Skeâ Øees«eeefcebie
efyebog (End point) nw~ TCP uesÙej mee@kesâš mes pegÌ[s heesš& vebyej keâe ueQiJespe nw efpemekeâe GheÙeesie efjuesMeveue [sšeyesme ØeyebOeve ØeCeeueer ceW
GheÙeesie keâjkesâ Gme SefhuekesâMeve keâer henÛeeve keâj mekeâleer nw efpemes [sše meb«enerle [sše kesâ meeLe mebÛeej keâjves kesâ efueS efkeâÙee peelee nw~
Yespee peevee nw~ 28. (c)
18. (c) SQL (Structured query language) Skeâ [sšeyesme Øees«eeefcebie
peye Skeâ GhekeâjCe (ef[JeeFme) efkeâmeer DevÙe GhekeâjCe (ef[JeeFme) keâes Yee<ee nw efpemes [sšeyesme ØeyebOeve ØeCeeueer ceW DeeBkeâÌ[eW kesâ ØeyebOeve kesâ efueS
mebosMe Yespeves keâe ØeÙeeme keâjlee nw lees [sše ØeyebOeveerÙe hewkesâš kesâ ™he ceW yeveeÙee ieÙee nw~ Ùen cetuele: efjuesMeveue SuepesyeÇe hej DeeOeeefjle Yee<ee
Fbšjvesš hej Yespee peelee nw ØelÙeskeâ hewkesâš keâes Skeâ heesš& vebyej efoÙee nw~
peelee nw pees Fmes Gmekesâ Fb[hJeeFbš efyebog (End Point) mes peesÌ[e peelee 29. (c)
nw~ RDBMS Skeâ DBMS nw pees Skeâ efjuesMeveue [sšeyesme keâe ØeyebOeve
19. (a) keâjlee nw~ Skeâ mebyebOehejkeâ [sšeyesme šsyeue ceW [sše meb«enerle keâjlee nw~
keâchÙetšj vesšJeefkeËâie ceW hee@Fbš Øeesšeskeâe@ue Skeâ [sše efuebkeâ uesÙej mebÛeej šsyeue keâes mlecYeeW ceW JÙeJeefmLele efkeâÙee peelee nw Deewj ØelÙeskeâ mlecYe Skeâ
Øeesšeskeâe@ue nw- oes ceeieex kesâ yeerÛe meerOes efyevee efkeâmeer nesmš Ùee efkeâmeer Øekeâej keâe [sše (hetCeeËkeâ, JeemleefJekeâ mebKÙee, Je[& efmš^bie, efoveebkeâ,
DevÙe vesšJeefkeËâie kesâ Ùen uethe ef[šskeäMeve DeeLesefvškesâMeve š^ebmeefceMeve ......) meb«enerle keâjlee nw~
Sefv›eâhMeve Deewj [sše keâcØesMeve Øeoeve keâj mekeâlee nw~ 30. (a)
20. (d) SQL ceW [^e@he šsyeue (Drop table) efjuesMeve keâer mebhetCe& mebjÛevee keâes
'HTTPS' neFhej šskeämš š^ebmeheâj Øeesšeskeâe@ue efmekeäÙeesj keâe mebef#ehle ef[ueerš keâj oslee nw~ peyeefkeâ hepe& (Purge) Gme šsyeue keâes ef[ueerš
™he nw Ùen Ùetpej kesâ yeÇeGpej leLee Skeâ JesyemeeFš mes nesves Jeeues [sše keâjlee nw efpemes oesyeeje Øeehle veneR efkeâÙee pee mekeâlee nw~
š^ebmeheâj leLee keâcÙegefvekesâMeve keâes efmekeäÙeesj keâjlee nw~ Ùen 'HTTP' mes 31. (a)
pÙeeoe megjef#ele nw leLee Ùen [sše keâes efmekeäÙeesj keâjves kesâ efueS Sbef›eâhMeve SQL ceW UPDATE keâceeb[ keâe ØeÙeesie efkeâmeer šsyeue kesâ Skeâ Ùee Skeâ mes
keâe GheÙeesie keâjlee nw~ Fmekeâe GheÙeesie efJeòeerÙe uesvesosve ceW efkeâÙee peelee DeefOekeâ rows kesâ Sefš^yÙetš JewuÙet keâes yeoueves kesâ efueS efkeâÙee peelee nw~
nw~ 32. (b)
21. (b) Ùeefo SQL ORDER BY keäuee@pe kesâ yeeo ASC Ùee DESC keâes
SMTP (efmebheue cesue š^ebmeheâj Øeesšeskeâeue) Skeâ vesšJeke&â Øeesšeskeâe@ue nw efveefo&° veneR efkeâÙee nw, lees ef[Heâe@uš ™he mes ASC keâe GheÙeesie efkeâÙee
efpemekeâe GheÙeesie Fueskeäš^e@efvekeâ cesue mebosMeeW keâes Skeâ ceMeerve mes otmejer ceMeerve peelee nw~
ceW š^evmeheâj keâjves kesâ efueS efkeâÙee peelee nw~ 33. (b)
22. (c) meskeâC[ veece&ue Heâece& (2NF) keâe efveÙece megefveef§ele keâjlee nw efkeâ šsyeue
Data Packet ([sše hewkesâš) [sše hewkesâš efmebieue hewkesâpe ceW yeves [sše ceW ØelÙeskeâ iewj ØeOeeve (Non-prime) efJeMes<elee hetjer lejn mes ØeeLeefcekeâ
keâer Skeâ FkeâeF& nw pees efkeâmeer efoS ieÙes vesšJeke&â heLe kesâ meeLe š^sJesue kegBâpeer hej keâeÙee&lcekeâ ™he mes efveYe&j nes~ 2NF ceW, šsyeue keâes henues
keâjlee nw~ [sše hewkesâš keâe GheÙeesie Fbšjvesš Øeesšeskeâe@ue ØemeejCe ceW [sše meeceevÙe ™he (1NF) ceW nesveer ÛeeefnS Deewj meYeer DeebefMekeâ efveYe&jleeSB
kesâ efueS efkeâÙee peelee nw~ meceehle keâjveer nesleer nw~
205 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
34. (b) HeâeFueW Øeef›eâÙeeDeeW kesâ yeerÛe Fvehegš/DeeGšhegš Ûewveue kesâ ¤he ceW keâeÙe&
DBMS Skeâ FbšjØeeFpe-keäueeme efmemšce kesâ [sšeyesme SefhuekesâMeve Deewj keâjleer nQ~ pewmee efkeâ veece mes mebkesâle efceuelee nw, Ùen GheÙeesiekeâlee& Ùee
[sšeyesme kesâ yeerÛe Skeâ FbšjHesâme kesâ ¤he ceW keâeÙe& keâjlee nw~ efkeâmeer DevÙe ef[JeeFme Éeje HeâeFueeW kesâ DevegjesOe Deewj Øeefleef›eâÙee kesâ ›eâce
35. (c) keâes yeveeS jKelee nw~
keäJesjer– 41. (a)
Select name, marks from student, result where C# ceW FileSystemWatcher keäueeme keâe GheÙeesie efmemšce keâer
student.Roll = result.Roll; HeâeFueeW Deewj [eÙejskeäšjerpe hej efveiejeveer jKeves kesâ efueS efkeâÙee peelee
Ùen keäJesjer Úe$e Deewj heefjCeece leeefuekeâe mes ›eâceMe; veece Deewj Debkeâ nw~
keâe@uece Øeehle keâjleer nw, peneB Úe$e ceW jesuevecyej keâe@uece heefjCeece ceW 42. (a)
jesuevecyej keâe@uece kesâ yejeyej nw~ .NET mee@heäšJesÙej SefhuekesâMeve keâes efJekeâefmele keâjves kesâ efueS Skeâ
keäJesjer keâe efJeMues<eCe– cetue keäJesjer kesâ meyemes vepeoerkeâ efJekeâuhe (c) nw âceJeke&â nw, pees ceeF›eâesmee@heäš keâcheveer Éeje ef[peeFve Deewj efJekeâefmele
øes
Úe$e mes veece, Debkeâ vesÛegjue pJee@Fve heefjCeece, Ùeefo Úe$e Deewj heefjCeece efkeâÙee ieÙee nww~ Fmekeâe henuee yeerše mebmkeâjCe 2000 ceW peejer efkeâÙee
kesâ yeerÛe meceeve veece Jeeues keâesF& DevÙe keâe@uece veneR nw lees Skeämeefhuemeerš ieÙee Lee~
pJee@Fve keâe GheÙeesie keâjvee ÛeeefnS Fmekeâe GheÙeesie Jesye, efJeb[espe, heâesve kesâ efueS SefhuekesâMeve efJekeâefmele
36. (b) keâjves kesâ efueS efkeâÙee peelee nw~
nwefMebie keâe GheÙeesie [sše keâer Fbšeref«ešer keâes melÙeeefhele keâjves kesâ efueS 43. (d)
efkeâÙee peelee nw~ nwefMebie Skeâ Øeef›eâÙee nw efpemeceW [sše keâes Skeâ efHeâkeäm[ W3.CSS efvecveefueefKele yee@[&j keäueeme Øeoeve keâjlee nw~
meeFpe kesâ Ùetefvekeâ DeeGšhegš (nwMe) ceW heefjJeefle&le efkeâÙee peelee nQ Deiej W3-border - efkeâmeer Sefuecesvš ceW yee@[&j peesÌ[lee nw~
[sše ceW keâesF& Yeer yeoueeJe neslee nw, lees Gmekeâe nwMe JewuÙet yeoue peelee W3- border-top - efkeâmeer Sefuecesvš ceW Meer<e& (top) yee@[&j
nw, efpememes [sše keâer DeKeb[lee (Integrity) keâer peebÛe keâer pee mekeâleer peesÌ[lee nw~
nw~ W3-border-right - efkeâmeer Sefuecesvš ceW oeÙeeB (Right) yee@[&j
37. (c) peesÌ[lee nw~
efJepegDeue yesefmekeâ ceW Skeâ mšwefškeâ JewefjSyeue ceewpeto jnlee nw Deewj Deheves W3-border-bottom - efkeâmeer Sefuecesvš ceW efveÛeuee (bootom)
meyemes efjmeWš JewuÙet keâes yejkeâjej jKelee nw~ Deieueer yeej peye Deehekeâe keâes[ yee@[&j peesÌ[lee nw~
Øeef›eâÙee keâes keâe@ue keâjlee nw, lees JewefjSyeue keâes hegve: ØeejbYe veneR efkeâÙee peelee W3-border-left - efkeâmeer Sefuecesvš ceW yeeÙeeB (Left) yee@[&j
nw Deewj Ùen DeYeer Yeer veJeervelece ceeve (recent value) jKelee nw efpemes peesÌ[lee nw~
Deeheves DemeeFve efkeâÙee nw~ heefjYeeef<ele keäueeme Ùee cee@[Ÿetue kesâ peerJevekeâeue kesâ W3-border-o - meYeer yee@[&j keâes nšelee nw~
efueS Skeâ efmLej JewefjSyeue ceewpeto jnlee nw~ W3-border-center- yee@[&j keäueeme W3.CSS-Øeoeve veneR keâjlee~
38. (c) 44. (d)
GheÙeg&òeâ mšsšceWš ceW meyemes DeÛÚe SvekewâhmeguesMeve keâe JeCe&ve efJekeâuhe ietieue kesâ Sbieguej pesSme ceW, MVC keâe hetCe& ™he ‘cee@[ue-JÙet-
(c) keâjlee nw~ kebâš^esuej’ neslee nw~ Ùen Skeâ mee@HeäšJesÙej Deeefke&âšskeäÛej hewšve& nw, pees
SefhuekesâMeve kesâ efJeefYeVe efnmmeeW keâes Deueie-Deueie keâjlee nw~ pewmes-
SvekewâhmeguesMeve [sše Deewj efJeefOeÙeeW keâes Skeâ efmebieue Ùetefveš ceW
cee@[ue (Model) [sše Deewj efyepevesme uee@efpekeâ keâes mebYeeuelee nw~ JÙet
(Wrapping) yeb[ue keâjves kesâ efJeÛeej keâe JeCe&ve keâjlee nw pees Gme
(View) Ùetpej FbšjHesâme (UI) keâes efoKeelee nw~ kebâš^esuej
[sše hej Skeâ FkeâeF& kesâ Yeerlej keâece keâjles nw, pewmes- peeJee ceW Skeâ (Controller) cee@[ue Deewj JÙet kesâ yeerÛe mecevJeÙe yejlee nw, Ùetpej
keäueeme, Fme DeeJeOeejCee keâe GheÙeesie Dekeämej Deebleefjkeâ ØeefleefveefOelJe Ùee Fvehegš keâes Øeesmesme keâjlee nw Deewj cee@[ue keâes Dehe[sš keâjlee nw~
efkeâmeer Dee@ypeskeäš keâer efmLeefle keâes yeenj mes efÚheeves kesâ efueS Yeer efkeâÙee 45. (a)
peelee nw~ C++ ceW ‘‘is_array();’’ HebâkeäMeve keâe GheÙeesie Ùen Ûeskeâ keâjves kesâ
39. (d) efueS efkeâÙee peelee nw efkeâ efoÙee ieÙee ceeve Ssjs mes mebyebefOele nw Ùee veneR~
mšwkeâ Skeâ Ssymš^wkeäš [sše šeFhe nw pees Deeceleewj hej Skeâ Ùee DeefOekeâ 46. (e)
Øees«eeefcebie ueQiJespe ceW GheÙeesie efkeâÙee peelee nw~ mšwkeâ Skeâ LIFO (ueemš Fve efoS ieS C++ keâes[ ceW kebâheeFue keâjles meceÙe Sjj
heâemš& DeeGš) [sše mebjÛevee nw~ efpemekeâe DeLe& nw efkeâ SefueceWš pees Debeflece usingnamespacestd nesiee~
ceW [euee ieÙee nw Gmes henues yeenj efkeâÙee peeSiee~ 47. (c)
40. (a) Sizeof (k/=i+j), sizeof Dee@hejsšj kesâ Devoj SkeämeØesMeve keâe
efJeMes<e HeâeFueW, efmemšce Ùee Øeef›eâÙeeDeeW Éeje yeveeF& ieF& DemLeeÙeer cetuÙeebkeâve veneR efkeâÙee peelee nw~ Sizeof Dee@hejsšj Sizeof (int)
HeâeFueeW kesâ efueS GhekeâjCeeW keâes heefjYeeef<ele keâjleer nQ~ efJeMes<e HeâeFueW ueewšelee nw keäÙeeWefkeâ SkeämeØesMeve keâe heefjCeece Skeâ hetCeeËkeâ nesiee~ ÛetBefkeâ
meeceevÙele: leerve Øekeâej keâer HeâerHeâes (Heâmš&-Fve,Heâmš&-DeeGš), yuee@keâ SkeämeØesMeve keâe cetuÙeebkeâve veneR efkeâÙee peelee nw, FmeefueS k keâe ceeve
Deewj kewâjskeäšj nQ~ HeâerHeâes HeâeFueeW keâes heeFhe Yeer keâne peelee nw~ HeâerHeâes veneR yeouee peeSiee~
206 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
48. (a) 60. (c)
C++ ceW, ‘is-array’ Skeâ mšQ[[& šscheuesš ueeFyeÇsjer HebâkeäMeve nw, pees vesšJeefkeËâie Dee@hejsefšbie efmemšce keâe cegKÙe keâeÙe& veneR nw~ Dee@hejsefšbie
Skeâ šeFhe keâer Skeâ Ssjs nesves keâer peeBÛe keâjlee nw~ Ùeefo efkeâmeer šeFhe kesâ efmemšce kesâ cegKÙe keâeÙe& efjmeesme& cewvespeceWš, heâeFue cewvespeceWš, Øeesmesmej
JesefjSyeue keâe šeFhe Ûeskeâ keâjvee nw efkeâ Jen Skeâ Sjs nw Ùee veneR, lees cewvespeceWš, cesceesjer cewvespeceWš Deeefo nQ~
‘is-array’ HebâkeäMeve keâe GheÙeesie keâj mekeâles nQ~ 61. (a)
49. (c) Sbšer JeeÙejme keâes efveÙeefcele ¤he mes Dehe[sš keâjvee ÛeeefnS Fmemes
keâchÙetšj keâes efoMee osves Jeeues efveoxMeeW kesâ mecetn keâes Øees«eece keâne peelee keâchÙetšj ceW Deeves Jeeues veÙes JeeÙejme keâe helee Ûeue mekesâiee~ Fmemes
nw~ nceejs keâchÙetšj ceW mebjef#ele HeâeFueeW Je DevÙe [eše keâes keâesF& vegkeâmeeve
50. (a) veneR nesiee~
C++ ceW, Structure kesâ meYeer meomÙe ef[Heâeuš ™he mes heefyuekeâ 62. (c)
(Public) neslee nw~ efJeb[espe cetJeerceskeâj ceeF›eâesmee@heäš Éeje ef[mekebâefšvÙet[ Jeeref[Ùees Sef[efšbie
51. (d) mee@heäšJesÙej Øees«eece nw~ Fmes henueer yeej 14 efmelecyej 2000 keâes
šeFcemšwche (timestamp) keâe GheÙeesie efceueer meskebâ[ Deewj meceÙe efJeb[espe hej Deewj 25 Dekeäštyej 2001 keâes efJeb[espe Skeämeheer hej
peesve kesâ meeLe efoveebkeâ Deewj meceÙe keâes meb«enerle keâjves kesâ efueS efkeâÙee Fbmšeue efkeâÙee ieÙee Lee~
peelee nw~ iMovie MacOS, iOS Deewj iPadOS ef[JeeFme kesâ efueS Apple
52. (a) Inc Éeje efJekeâefmele Skeâ ØeerFbmše@u[ Jeeref[Ùees Sef[efšbie ShueerkesâMeve nw~
efoÙes ieÙes efveÙece kesâ DeeOeej hej Ùee hejcheje kesâ DeeOeej hej Øees«eecej Ùen cetue ™he mes 1999 ceW cewkeâ OS 8 ShueerkesâMeve kesâ ™he ceW peejer
Éeje efueKes ieÙes efveoxMeeW keâer ëe=bKeuee keâes efmebšwkeäme keânles nw~ efkeâÙee ieÙee Lee, pees henues heâeÙejJeeÙej me#ece GheYeesòeâe cewkeâ cee@[ue,
53. (c) DeeF&cewkeâ [erJeer kesâ meeLe yeb[ue efkeâÙee ieÙee Lee~
heäueesÛeeš& Skeâ SuieesefjLece keâe DeejsKeerÙe ØeefleefveefOelJe neslee nw, Ùen Adobe Premiere, Adobe systems Éeje efJekeâefmele Skeâ hetJe&
efkeâmeer keâeÙe& keâes nue keâjves kesâ efueS ÛejCe-oj-ÛejCe Âef°keâesCe neslee Jeeref[Ùees Sef[šj mee@heäšJesÙej Lee~ Fmes henueer yeej 1991 ceW uee@vÛe
nw~ efkeâÙee ieÙee Lee, Deewj Fmekeâe Deefvlece mebmkeâjCe 2002 ceW peejer efkeâÙee
54. (b) ieÙee~ Fmes Abode Premiere Pro (2003 ceW hesMe efkeâÙee ieÙee) Éeje
Øees«eece ceW Properties, Dee@ypeskeäšdme DeesefjSvšs[ Øees«eeefcebie (oops) yeoue efoÙee ieÙee Lee, pees Adobe premiere keâe Skeâ veÙee mebmkeâjCe
Yee<eeDeeW ceW Skeâ efJeMes<e Øekeâej keâe Jeie& meomÙe (sort member) nw, pees Lee~
Skeâ #es$e Deewj Skeâ efJeefOe (method) kesâ yeerÛe keâeÙe&#ecelee ceW ceOÙeJeleea nw 63. (d)
Properties keâes heÌ{ves Deewj efueKeves kesâ efueS efmebšwkeäme heâeru[ kesâ meceeve keâcheeFuej–Ùen Skeâ š^ebmeuesšj neslee nw pees GÛÛe mlejerÙe Yee<ee keâes
nw uesefkeâve Properties heÌ{ves Deewj efueKeves keâe DevegJeeo ‘‘iesšj’’ Deewj efvecve mlejerÙe / ceMeerveer Yee<ee ceW yeoue osleer nw~
‘‘mesšj’’ efJeefOe mes keâeue efkeâÙee peelee nw~ keâcheeFuej kesâ Yeeie–
55. (b)
SuieesefjLce (algorithm) Skeâ ÛejCe-oj-ÛejCe Øeef›eâÙee nw, pees JeebefÚle
DeeGšhegš Øeehle keâjves kesâ efueS Skeâ efveef§ele ›eâce ceW efve<heeefole nesves
Jeeues efveoxMeeW kesâ Skeâ mesš keâes heefjYeeef<ele keâjlee nw~
56. (a)
PHP ceW HebâkeäMeve natcasesort() 'natural order' Suieesefjoce keâe
GheÙeesie keâjkesâ Skeâ Ssjs keâes mee@š& keâjlee nw~ meYeer ceeve Deheveer cetue
kegbâpeerÙee@ jKeles nw~ HebâkeäMeve kesâme-FvemeWmeefšJe nesles nw~
57. (c)
Ssjs Skeâ ner Øekeâej kesâ [sše šeFhe keâes mšesj keâjlee nw~ Ssjs Fb[skeäme kesâ
ceeOÙece mes meerOes Deewj peefuo Skeämesme keâer Devegceefle oslee nw, Deewj efkeâmeer
Sefuecesvš keâes Skeâ efveOee&efjle Fb[skeäme hej hengÛee mekeâlee nw~
58. (c)
[e@keäÙegceWš heâe@ce&sefšbie uewiJespe "XML" ceW X keâe DeeMeÙe Fkeämšsefvmeyeue
neslee nw Deewj Fmekeâe hetCe& ™he Extensible Markup Language
neslee nw~ GheÙeg&òeâ efÛe$e mes mhe° nw efkeâ efuebkeâj keâcheeFuej keâe Yeeie veneR nw~
59. (c) 64. (b)
yeÇeGpej ShueerkesâMeve mee@HeäšJesÙej keâe Øekeâej nw peyeefkeâ SvšerJeeÙejme, Smescyeuej Skeâ Øees«eece nw pees DemeWyeueer Yee<ee keâes ceMeerve Yee<ee ceW yeouelee
yewkeâDehe mee@HeäšJesÙej, ef[mkeâ štume, ef[mkeâ keäueervej, [sše mebheer[ve nw, pees efkeâmeer efveoxMe (instruction) keâes Skeâ ner meceÙe hej ™hebeleefjle
meYeer Ùetefšefuešer (GheÙeesefielee) mee@HeäšJesÙej keâe Øekeâej nw~ (translates) Deewj efve<heeefole (executes) keâjlee nw~
207 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
65. (c) 76. (d)
heece DeesSme (ieevexš DeesSme kesâ ™he ceW Yeer peevee peelee nw) 1996 ceW Dee@efhškeâue Fvehegš ef[JeeFme kebâhÙetšj keâes Fvehegš kesâ œeesle (source)
JÙeefòeâiele ef[efpešue meneÙekeâeW (heer[erS) kesâ efueS Meg® ceW heece, Fbkeâ kesâ ™he ceW ØekeâeMe keâe GheÙeesie keâjves keâer Devegceefle oslee nQ~ mkewâvej
Éeje efJekeâefmele Skeâ yebo ceesyeeFue Dee@hejsefšbie efmemšce nw~ heece Deewj cewivesefškeâ Fbkeâ kewâjskeäšj efjkeâe@efiveMeve (MICR) Dee@efhškeâue
Dee@hejsefšbie efmemšce efmebieue-Ùetpej efmebieue-šemkeâ Dee@hejsefšbie efmemšce keâe Fvehegš ef[JeeFme kesâ GoenjCe nw~
Skeâ GoenjCe nw, keäÙeeWefkeâ Skeâ Dee@hejsefšbie efmemšce pees efmebieue Ùetpej 77. (d)
keâes Skeâ meceÙe ceW kesâJeue Skeâ ner keâeÙe& keâjves keâer Devegceefle oslee nw,
Jeke&âmšsMeve, cesveøesâce leLee efceveerkeâchÙetšj, keâchÙetšj kesâ Øekeâej nQ
efmebieue-Ùetpej efmebieue-šeefmkebâie Dee@hejsešf bie efmemšce keânueelee nw~ efpevekeâe GheÙeesie ›eâceMe: Jew%eeefvekeâ, FbpeerefveÙeefjbie ShueerkesâMeve keâeÙeeX ceW,
66. (b) yeQkeâeW keâcheefveÙeesb leLee Ùee$eer Deej#eCe ceW efkeâÙee peelee nw peyeefkeâ Gyegvlet
yetefšbie (Booting) Skeâ Ssmeer Øeef›eâÙee nw efpememes efkeâmeer Yeer keâchÙetšj (Ubuntau) Dee@hejsefšbie efmemšce nw pees keâchÙetšj ne[&JesÙej keâes
keâes Meg™ keâjles nw~ Fmes ne[&JesÙej Éeje, Skeâ yešve Øesme keâjkesâ Ùee
efveÙebef$ele keâjlee nw meeLe ner ShueerkesâMeve mee@heäšJesÙej keâes huesšheâece&
mee@heäšJesÙej keâceeb[ Éeje Meg™ efkeâÙee pee mekeâlee nw~
GheueyOe keâjlee nw~
67. (a)
78. (b)
Gyeblet, efcebš, Hesâ[esje, efuevekeäme kesâ mebmkeâjCe nw~
3D efØebefšbie Ùee Sef[efšJe cewvÙeg hewâkeäÛeefjbie CAD cee@[ue mes ef$e-
efuevekeäme Ùetefvekeäme pewmee Skeâ ØeÛeeueve lev$e nw~ Ùen Deeshesve meesme&
mee@HeäšJesÙej DeLeJee cegòeâ œeesle mee@HeäšJesÙej keâe meyemes meHeâue leLee meyemes DeeÙeeceer Jemleg keâe efvecee&Ce nw~ Fmes efJeefYevve Øeef›eâÙeeDeeW ceW efkeâÙee peelee
ueeskeâefØeÙe mee@HeäšJesÙej nw~ nw efpemeceW meece«eer keâes keâchÙetšj efveÙeb$eCe kesâ lenle pecee efkeâÙee peelee nw,
68. (d) peesÌ[e peelee nw Ùee "esme yeveeÙee peelee nw~ 3D efØeefšbie keâer DeJeOeejCee
Dee@hejsefšbie efmemšce kesâ mebyebOe ceW efvecve ceW mes (Ready) (lewÙeej), 1984 ceW Ûeeume& nue (Charles Hull) Éeje hesMe keâer ieF& Leer~ yeeo
(Waiting) (Fvlepeej) (Running) (Ûeuevee) Ùes meye Dee@hejsefšbie ceW GvneWves 3D efmemšce kebâheveer keâer men-mLeehevee keâer, efpemeves 3D
efmemšce mes mebyebefOele JewOe Øeef›eâÙee efmLele nw, hejvleg mšejefJebie efØebefšbie lekeâveerkeâ kesâ efJekeâeme ceW cenlJehetCe& Yetefcekeâe efveYeeF&~
(Starving) Fmemes mebyebefOele veneR nw~ 79. (b)
69. (c) neFefyeÇ[ keâchÙetšj Skeâ keâchÙetefšbie ØeCeeueer nw pees Sveeuee@ie Deewj
mesue Skeâ Dee@hejsefšbie efmemšce keâe Ieškeâ nw pees GheÙeesiekeâlee& kesâ meeLe ef[efpešue keâchÙetšj kesâ keâebyeervesMeve mes yeveeÙee peelee nw~ efJeMes<e ØeÙeespeve
Fbšjwkeäš keâjlee nw~ mesue Dee@hejsefšbie efmemšce ceW Skeâ Ùetpej Fbšjhesâme nw neFefyeÇ[ keâchÙetšj keâe GheÙeesie ne@efmhešue, heâeÙej mšsMeve, SÙejhuesve
pees mebyebefOele keâeÙeeX keâes keâjves kesâ efueS Ùetpej mes keâF& lejn kesâ keâceeb[ Deewj heâesjWefmekeâ uewye ceW efkeâÙee peelee nw~
keâes mJeerkeâej keâjlee nw~ 80. (c)
70. (c) Fbšjhš cewkesâefvepce ceW Øeef›eâÙeeDeeW keâes [sše meePee keâjves kesâ efueS
yetš uees[j (Boot loader) kebâhÙetšj kesâ Ûeeuet nesves Ùee hegve: ØeejbYe Devegceefle keâer DeeJeMÙekeâlee veneR nw~
nesves hej Dee@hejsefšbie efmemšce keâes uees[ Deewj ØeejbYe keâjves kesâ efueS Fbšjhš Skeâ Ssmeer Iešvee nw pees Gme ›eâce keâes yeoue osleer nw efpemeceW Øeesmesmej
efpeccesoej neslee nw~ efpeve efmemšcme ceW keâF& Dee@hejWefšbie efmemšce nesles nQ,
efveoxMeeW keâes efve<heeefole keâjlee nw~ Skeâ ®keâeJeš keâer Ùeespevee yeveeF& pee mekeâleer
JeneB yetš uees[j Ùetpeme& keâes Ùen Ûegveves keâe efJekeâuhe oslee nw efkeâ efkeâme
Dee@hejsefšbie efmemšce keâes uees[ keâjvee nw~ nw~ (efJeMes<e ™he mes Jele&ceeve ceW Ûeue jns keâeÙe&›eâce Éeje DevegjesOe efkeâÙee
71. (b)
ieÙee~) Ùee DeefveÙeesefpele (Ssmeer Iešvee kesâ keâejCe pees Jele&ceeve ceW Ûeue jns
keâchÙetšj keâer $egefšÙeeW keâes yeie keânles nQ, leLee keâchÙetšj keâer $egefšÙeeW keâes keâeÙe&›eâce mes mecyeefvOele nes Yeer mekeâleer nw Deewj veneR Yeer)~
ottj keâjves keâes ef[yeie keânles nw~ 81. (c)
72. (a) S[^sme yeme efpemekeâe GheÙeesie efheâefpekeâue S[^sme efveefo&° keâjves kesâ efueS
mheeFJesÙej Skeâ efJe%eeheve pewmes JÙeeJemeeefÙekeâ GösMÙeeW kesâ efueS Deehekesâ efkeâÙee peelee nw~ peye Skeâ Øeesmesmej Ùee [er.Sce.S. me#ece ef[JeeFme keâes
[sše keâer efveiejeveer keâjves Jeeuee mee@heäšJesÙej nw~ cesceesjer ueeskesâMeve keâes heÌ{ves Ùee efueKeves keâer DeeJeMÙekeâlee nesleer nw, lees
73. (c) Ùen Gme cesceesjer ueeskesâMeve keâes S[^sme yeme ceW efveefo&° keâjlee nw (heÌ{ves
Deesjskeâue Skeâ [sšeyesme mee@HeäšJesÙej keâcheveer nw, pees [sšeyesme ØeyevOeve Ùee efueKeves kesâ efueS JewuÙet keâes [sše yeme hej Yespee peelee nw)
efmemšce lewÙeej keâjleer nw, Ùen keâesF& Dee@hejsefšbie efmemšce veneR nw~ 82. (d)
74. (a) Øees«eece keâeGbšj (PC) Skeâ jefpemšj nw pees Deeies efve<heeefole nesves Jeeues
yewjer yeesnce (Barry Boehm) ves 1986 ces mheeFjue cee@[ue keâe efveoxMe kesâ cesceesjer S[^sme keâe ØeyebOeve keâjlee nw~ Øees«eece keâeGbšj keâes
ØemleeJe efkeâÙee Lee~ Ùen mee@HeäšJesÙej efJekeâeme Øeef›eâÙee cee@[ue nw pees Fbmš^keäMeve keâeGbšj, Fbmš^keäMeve hee@Fbšj, Fbmš^keäMeve S[^sme jefpemšj Ùee
ef[peeFve Deewj ØeesšesšeFhe kesâ lelJeeW keâes ÛejCeeW ceW oMeelee& nw~ meerkeäJeWme jefpemšj kesâ ™he ceW Yeer peevee peelee nw~
75. (a) 83. (b)
efØebefšbie ef[JeeFme keâe efjpee@uÙetMeve [e@šdme hej FbÛe (DPI) ceW ceehee cesceesjer S[^sme jefpemšj Skeâ efJeMes<e Øekeâej keâe jefpemšj nw efpemeceW [sše
peelee nQ Ùen DeeGšhegš efjpee@uÙetMeve nw leLee heâesšes«eeheâ leLee Fcespe kesâ Deewj efveoxMe keâe cesceesjer S[^sme neslee nw~ MAR keâe cegKÙe keâeÙe&
Fvehegš efjpee@uÙetMeve keâes PPI (efhekeämeue hej FbÛe) ceeheles nw~ efve<heeove ÛejCe ceW cesceesjer mes efveoxMe Deewj [sše lekeâ hengBÛelee nw~
208 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
84. (a) ef[JeeFme keâer cesceesjer Deewj jefpemšj keâes S[^sme ceeveeW kesâ efueS cewhe
CPU (meWš^ue Øeesmesefmebie Ùetefveš) keâe cetue Yeeie ‘‘keâesj’’ keânueelee nw~ keâesj efkeâÙee peelee nw; FmeefueS cesceesjer S[^sme, efHeâefpekeâue jwce kesâ Skeâ
Jen FkeâeF& nw pees meYeer efveoxMeeW keâes Øeesmesme keâjleer nw, pewmes ieCevee keâjvee, efnmmes Ùee I/O ef[JeeFme keâer cesceesjer Deewj jefpemšj keâes meboefYe&le keâj
[sše keâes ØeyebefOele keâjvee Deewj DevÙe Øeef›eâÙeeDeeW keâes efveÙebef$ele keâjvee~ mekeâlee nw~
85. (a) 94. (d)
UNIVAC keâe hetCe& ™he ÙetefveJeme&ue Dee@šescesefškeâ keâchÙetšj nw Ùen
efoS ieS šÎLe šsyeue keâe uee@efpekeâ FkeäJesMeve Y B nw~
henuee meeceevÙe GösMÙe Jeeuee Fueskeäš^e@efvekeâ ef[efpešue nw efpemes J.
95. (b)
Presper Eckert Deewj pee@ve ceewÛeueer kesâ vesle=lJe ceW FbpeerefveÙejeW keâer Skeâ
efoÙee ieÙee
šerce Éeje efJekeâefmele efkeâÙee ieÙee Lee efpemes mebÙegòeâ jepÙe Decesefjkeâe ceW
A B =C
keâe@heexjsš DevegØeÙeesieeW (Application) kesâ efueS ef[peeFve efkeâÙee ieÙee Deewj B C
Lee~
86. (a) =B (A B) C=A B
keâchÙetšj ceW keâF& Øekeâej keâer cesceesjer nesleer nw efpemeceW Øees«eece Fvmeš^keäMeve = B (B A)
yeeFvejer kesâ ™he ceW mebefÛele neslee nw Deewj Ùener CPU kesâ Éeje [erkeâes[ = (B B) A B B=0
Deewj hesâÛe neslee nw~ =0 A
87. (c) =A
kewâMes Deewj cesve (ØeeFcejer) cesceesjer efyepeueer yebo efkeâS peeves hej Deheves 96. (b)
kebâšWš keâes Kees osles nw, FvnW JeesueešeFue keânles nQ~ kewâMes cesceesjer Skeâ Ùeefo x Skeâ yetefueÙeve JewefjSyeue nw, lees x' Gmekeâe NOT neslee nw, oes
Úesšs Deekeâej keâer DeefmLej kebâcÙetšj cesceesjer nw pees Øeesmesmej ceW GÛÛe ieefle yeej NOT keâe ØeÙeesie keâjves hej x'' keâe ceeve x nesiee~ leerve yeej
[sše Skeämesme Øeoeve keâjleer nw~ kebâhÙetšj keâer cegKÙe cesceesjer jwce NOT keâe ØeÙeesie keâjves hej x''' keâe ceeve x' nesiee Deewj Ûeej yeej
(RAM) keâes keâne peelee nw~ Ùen DemLeeF& cesceesjer nesleer nw DeLee&le NOT keâe ØeÙeesie keâjves hej x'''' keâe ceeve x nesiee~
FmeceW mšesj [eše keâchÙetšj yebo nesves hej ef[ueerš nes peelee nw~ FmeefueS (((x')')')' = x
88. (a) 97. (b)
mesieceWšsMeve ceW ØelÙeskeâ mesieceWš keâe Skeâ yesme S[^sme neslee nw pees efveefo&° XNOR uee@efpekeâ iesš keâer melÙelee meejCeer
keâjlee nw efkeâ Yeeweflekeâ cesceesjer ceW mesieceWš keâneB mes Meg® neslee nw~ Fme peneB Y AB AB
yesme S[^sme keâe GheÙeesie mesieceWš kesâ Yeerlej efkeâmeer Yeer mLeeve kesâ Yeeweflekeâ
S[^sme keâer ieCevee keâjves kesâ efueS efkeâÙee peelee nw~
89. (a)
cesceesjer yeheâj jefpemšj, cesceesjer mes heÌ{s ieS Ùee cesceesjer ceW efueKes ieS
[sše Ùee efveoxMe keâe keâvšsvš jKelee nw~
90. (c)
PROM keâe hetCe& ™he Øees«eecesyeue jer[ Deesveueer cesceesjer nw~ PROM Dele: peye Fvehegš Skeâ-otmejs mes efYeVe neWies, lees DeeGšhegš 0 nesiee
Skeâ cesceesjer efÛehe nw efpeme hej kesâJeue Skeâ yeej [sše jeFš efkeâÙee pee 98. (d)
mekeâlee nw~ Fme efÛehe ceW [sše mLeeÙeer ™he mes mšesj neslee nw Fmes yeeo Skeâ DeeOee Ùeespekeâ keâes XOR iesš kesâ ™he ceW Yeer peevee peelee nw keäÙeeWekf eâ
ceW ef[ueerš Ùee jeFš veneR efkeâÙee pee mekeâlee~ PROM Skeâ vee@ve- XOR keâes Ùeesie kesâ Glheeove (produce) kesâ efueS oesveeW Fvehegš hej
JeesueešeFue cesceesjer nw, FmeefueS kebâhÙetšj efmemšce ceW hee@Jej mehueeF& ueeiet efkeâÙee peelee nw~ DeeOee Ùeespekeâ kesâJeue oes efyešdme (A Deewj B) pees[Ì
Dee@heâ nesves hej Yeer [sše megjef#ele jnlee nw~ mekeâlee nw~ neheâ Ùeespekeâ ceW oes Fvehegš (A Deewj B) Deewj oes DeeGšhegš
91. (d)
(S Deewj C) nesles nQ~
DRAM keâe hetCe& ™he [eÙevesefcekeâ jQ[ce Skeämesme cesceesjer nw~ [sše keâes Ùeef o neheâ Ùeespekeâ kesâ Fvehegš ceW kewâjer nw, lees Ùen Fmes DeveosKee keâj
yeveeÙes jKeves kesâ efueS Fmes ueieeleej jerøesâMe keâjves keâer DeeJeMÙekeâlee os i ee Deewj kesâJeue A Deewj B efyešdme peesÌ[lee nw~ Fmekeâe celeueye nw efkeâ
nesleer nw, veneR lees Ùen [sše keâes Kees osiee~ yeeFvejer peesÌ[ Øeef›eâÙee hetCe& veneR nw Deewj FmeefueS Fmes DeeOee Ùeespekeâ
keâne peelee nw~
DRAM, SRAM mes Oeerceer nesleer nw~
99. (d)
SRAM keâes yeej-yeej jerøesâMe keâjves keâer DeeJeMÙekeâlee veneR nesleer nw~ [er cee@ie&ve kesâ ØecesÙe keâe GheÙeesie cegKÙele: yetefueÙeve DeefYeJÙeefòeâÙeeW keâes
DRAM, SRAM keâer leguevee ceW memleer nw~ mejue yeveeves kesâ efueS efkeâÙee peelee nw~ Fmekesâ DeueeJee, Ùen ØecesÙe
92. (c) NAND Deewj NOR iesšdme kesâ keâeÙeeW& keâes ueeiet keâjves ceW Yeer meneÙekeâ
DeeOee yeeFš (4 bit) keâes Skeâ efveyeue (Nibble) keâne peelee nw~ neslee nw~ Dele: mener Gòej (d) nesiee~
keâchÙetšj ceW [sše keâer meyemes Úesšer Ùetefveš keâes efyeš (yeeFvejer ef[efpeš) 100. (c)
keâne peelee nw~ 8 efyeš keâes Skeâ yeeFš keâne peelee nw~ Øemeej efJeuebye (Propagation delay) efkeâmeer efJeMes<e š^ebefpemšj Ùee
93. (a) MOSFET kesâ efmJeefÛebie meceÙe kesâ Skeâ HebâkeäMeve keâe ØeefleefveefOelJe
cesceesjer-cewh[ I/O cegKÙe cesceesjer Deewj I/O ef[JeeFme oesveeW keâes meePee keâjlee nw~ Øemeej efJeuebye (Propagation delay) uee@efpekeâ meefke&âš keâer
keâjves kesâ efueS meceeve S[^sme mhesme keâe GheÙeesie keâjlee nw~ I/O ieefle efveOee&efjle keâjves ceW ceoo keâjlee nw~
209 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
 PRACTICE SET - 8
1. .......... are benefited by cloud computing facility 6. Messaging protocols like MQTT are frequently
in market oriented cloud architecture. used within IoT applications. What does
yeepeej GvcegKe keäueeG[ Deeefke&âšskeäÛej ceW keäueeG[ MQTT stand for?/MQTT pewmes cewmesefpebie Øeesšeskeâe@ue
keâchÙetefšbie megefJeOee mes .......... ueeYeeefvJele nesles nQ~ keâe GheÙeesie ØeeÙe: IoT DevegØeÙeesieeW ceW efkeâÙee peelee nw~
(a) Cloud service provider only MQTT keâe hetCe& ™he keäÙee nw?
kesâJeue keäueeG[ mesJee Øeoelee (a) Message Queue Tentative Transport
(b) Cloud users and brokers only cewmespe keäÙet šWšefšJe š^ebmeheesš&
kesâJeue keäueeG[ GheÙeesiekeâlee& Deewj oueeue (b) Mail Queue Transit Transfer
(c) Cloud service providers, cloud users and cesue keäÙet š^ebefpeš š^ebmeHeâj
brokers/keäueeG[ mesJee Øeoelee, keäueeG[ GheÙeesiekeâlee& (c) Message Queue Telemetry Transport
Deewj oueeue cewmespe keäÙet šsueercesš^er š^ebmeheesš&
(d) Mail Queue Towards Transfer
(d) Cloud service providers, authentication server
and brokers
cesue keäÙet šgJe[&dme š^ebmeHeâj
7. Which of the following points are true about
keäueeG[ mesJee Øeoelee, ØeceeCeerkeâjCe meJe&j Deewj oueeue artificial intelligence?/efvecveefueefKele ceW mes keâewve-mee/mes
2. Which among the following options is NOT efyebog Deeefš&efHeâefMeÙeue Fbšes uf epeWme kesâ mebyebOe ceW melÙe nQ?
true with regard to NLP?/SveSueheer kesâ mebyebo ceW
Points:/efyebog:
efvecveefueefKele ceW mes keâewve-mee efJekeâuhe mener vener nw? i) Artificial intelligence is a field that aims to
(a) NLP is predictable/SveSueheer ØelÙeeefMele nw make humans more intelligent./Deeefš&efHeâefMeÙeue
(b) NLP may require more keystrokes/SveSueheer keâes FbšsefuepeWme Skeâ Ssmeer Heâeru[ nw, efpemekeâe GösMÙe ceveg<Ùe
DeefOekeâ keâermš^eskeäme keâer DeeJeMÙekeâlee nes mekeâleer nw~ keâes DeefOekeâ yegefæceeve yeveevee nw~
(c) It is very time-efficient/Ùen yengle meceÙe kegâMeue nw ii) Artificial intelligence is a field that aims to
(d) NLP helps computers to communicate with improve the operating system./Deeefš&efHeâefMeÙeue
humans in their languages FbšsefuepeWme Skeâ Ssmeer Heâeru[ nw, efpemekeâe GösMÙe
SSueheer keâchÙetšjeW keâes Gvekeâer Yee<eeDeeW ceW ceveg<Ùe kesâ meeLe Dee@hejsefšbie keâes GVele keâjvee nw~
mebJeeo keâjves ceW ceoo keâjlee nw~ iii) Artificial intelligence is a field that aims to
3. Which among the following is/are required develop intelligent machines./Deeefš&efHeâefMeÙeue
functions in an Arduino sketch or a program? FbšsefuepeWme Skeâ Ssmeer Heâeru[ nw, efpemekeâe GösMÙe Fbšus eerpeWš
efvecveefueefKele ceW mes keâewve Skeâ Arduino mkesâÛe Ùee ceMeerveeW keâes efJekeâefmele keâjvee nw~
Øees«eece ceW DeeJeMÙekeâ keâeÙe& nw/nQ? iv) Artificial intelligence is a field that aims to
A. setup () manage databases./Deeefš&efHeâefMeÙeue FbšsefuepeWme Skeâ
B. loop () Ssmeer, efpemekeâe GösMÙe [sšeyesme keâes cewvespe keâjvee nw~
(a) Only B/kesâJeue B (b) Only A/kesâJeue A v) Machine learning is a branch of artificial
(c) Neither A nor B/ve lees A Deewj ve ner B intelligence./ceMeerve ueefveËie, Deeefš&efHeâefMeÙeue FbšsefuepeWme
(d) Both A and B/A Deewj B oesveeW keâer Skeâ MeeKee nw~
4. The evolution of IoT started with the first (a) Only iii and v/kesâJeue iii Deewj v
connected network called ________. (b) Only ii, iii and iv/kesâJeue ii, iii Deewj iv
IoT keâe efJekeâeme _____ veecekeâ henues keâveskeäšs[ vesšJeke&â (c) Only i, ii and iv/ kesâJeue i, ii Deewj iv
mes Meg® ngDee Lee~ (d) Only i and iv/kesâJeue i Deewj iv
(a) ARPANET/Dejheevesš (b) TCP/šermeerheer 8. Which of the following is NOT an application
of Microcontroller?/efvecveefueefKele ceW mes keâewve-mee
(c) Iot/DeeF&Deesšer (d) SMTP/SmeScešerheer
ceeF›eâeskebâš^esuej keâe SefhuekesâMeve veneR nw?
5. Which of the following is a subfield of
(a) LED/SueF&[er
AI?/efvecveefueefKele ceW mes keâewve-mee AI keâe Ghe#es$e nw?
(b) Store room/mšesj ™ce
(a) Machine Learning/ceMeerve uee\veie
(c) Fire alarm/HeâeÙej Deueece&
(b) Robotics/jesyeesefškeäme
(d) Microwave oven/ceeF›eâesJesJe DeesJeve
(c) Natural Language Processing
9. Which of the following is a physical thing,
Øeeke=âeflekeâ Yee<ee ØemebmkeâjCe (NLP) appearing on an Ethernet or some wire?
(d) More than one of the above efvecveefueefKele ceW mes keâewve-meer Skeâ Yeeweflekeâ Ûeerpe nw, pees
GheÙeg&òeâ ceW mes Skeâ mes DeefOekeâ F&Lejvesš Ùee efkeâmeer leej hej efoKeeF& osleer nw?
210 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
 (a) Internet/Fbšjvesš (b) Packet/hewkesâš 16. A computer virus is a software program which
(c) Datagram/[sše«eece (d) Database/[sšeyesme has the essential ability to
10. Which of the following is a markup language? keâchÙetšj JeeÙejme Skeâ mee@heäšJesÙej Øees«eece nw, efpemeceW
efvecveefueefKele ceW mes keâewve-meer Skeâ ceeke&â Dehe Yee<ee nw? DeeJeMÙekeâ #ecelee nesleer nw
(a) HTML (b) Python (a) damage data/[sše keâer #eefle keâjves keâer
(c) Java (d) PHP (b) damage program/Øees«eece keâer #eefle keâjves keâer
11. What is used to set the starting and ending (c) clone itself/mJeÙeb keâe keäueesve yeveeves keâer
points of an animation? (d) More than one of the above/GheÙeg&òeâ ceW mes Skeâ mes
SveercesMeve kesâ Meg®Deeleer Deewj Deble efyevog mesš keâjves kesâ DeefOekeâ
efueS keäÙee ØeÙeesie efkeâÙee peelee nw? 17. Which type of network shares the
(a) Key frames/keâer-Øesâcme communication channel among all the
(b) Graphic symbols/«eeefheâkeâ Øeleerkeâ machines?/efkeâme Øekeâej keâe vesšJeke&â meYeer ceMeerveeW kesâ
(c) Scenes/ÂMÙe yeerÛe mebÛeej Ûewveue meePee keâjlee nw?
(d) Blank frames/Keeueer øesâce (a) Broadcast network
12. Special programs used to create multimedia (b) Multicast network
presentations are called: (c) Unicast network
ceušerceeref[Ùee ØemlegleerkeâjCe me=efpele keâjves kesâ efueS ØeÙegòeâ (d) More than one of the above
Øees«eece keânueelee nw- 18. Which of the following denotes the
(a) authoring programs/mebuesKeve Øees«eece interconnection of a set of devices capable of
communication?/efvecveefueefKele ceW mes keâewve mee mebÛeej
(b) graphics programs/«eeefheâkeäme Øees«eece
ceW me#ece ef[JeeFmeeW kesâ mesš keâe FbšjkeâveskeäMeve nw?
(c) Utility program/Ùetefšefuešer Øees«eece
(a) Network /vesšJeke&â (b) Channel /Ûewveue
(d) UI program/Ùet.DeeF& Øees«eece
(c) Medium /ceeref[Ùece (d) Bus /yeme
13. Which of the following is not an E-
Government? 19. The layers of the TCP/IP protocol are:
efvecveefueefKele ceW mes keâewve-mee F&-ieJeve&ceWš veneR nw? TCP/IP Øeesšeskeâe@ue keâer uesÙej nw–
(a) Business-to-Business (B2B) (a) transport layer and network layer
(b) Government-to-Government (G2G) š^ebmeheesš& uesÙej Deewj vesšJeke&â uesÙej
(c) Government-to-Citizen (G2C) (b) application layer, data link layer, transport
(d) Government-to-Business (G2B) layer and network layer/ShueerkesâMeve uesÙej, [sše
14. Which of the following is NOT a common type efuebkeâ uesÙej, š^ebmeheesš& uesÙej Deewj vesšJeke&â uesÙej
of E-Commerce model?/efvecveefueefKele ceW mes keâewve- (c) data link layer, and network layer
mee F&-keâe@ceme& cee@[ue keâe meeceevÙe Øekeâej veneR nw? [sše efuebkeâ uesÙej, š^ebmeheesš& uesÙej Deewj vesšJeke&â uesÙej
(a) Business-to-Consumer (B2C) (d) application layer, data link layer, transport
JÙeJemeeÙe mes GheYeesòeâe (yeer2meer) layer, network layer and hardware layer
(b) Consumer-to-Business (C2B) ShueerkesâMeve uesÙej, [sše efuebkeâ uesÙej, š^ebmeheesš& uesÙej,
GheYeesòeâe mes JÙeJemeeÙe (meer2yeer) vesšJeke&â uesÙej Deewj ne[& JesÙej uesÙej
(c) Consumer-to-Consumer (C2C) 20. efvecveefueefKele ceW mes efkeâme-mee/mes keâLeve melÙe nw/nQ?
GheYeesòeâe-mes-GheYeesòeâe (meer2meer) (i) IPv4 keäueeme-A S[^sme, vesšJeke&â ID kesâ efueS ØeLece 8
(d) More than one of the above efyešdme keâe GheÙeesie keâjlee nw~
GheÙeg&òeâ ceW mes Skeâ mes DeefOekeâ (ii) IPv4 keäueeme-C S[^sme, nesmš ID kesâ efueS Debeflece 8
15. Which of the following is NOT a guideline for a efyešdme keâe GheÙeesie keâjlee nw~
good form fill-in design?
efvecveefueefKele ceW mes keâewve Skeâ DeÛÚs heâe@ce& efheâue Fve (a) kesâJeue (i) (b) ve lees (i) ve ner (ii)
ef[peeFve kesâ efueS efoMee-efveoxMe veneR nw? (c) (i) Deewj (ii) oesveeW (d) kesâJeue (ii)
21. What is the primary function of FTP (File
(a) Give immediate feedback about errors
Transfer Protocol)?
$egefšÙeeW kesâ yeejs ceW lelkeâeue Øeefleef›eâÙee oW~ FTP (heâeFue š^ebmeheâj Øeesšeskeâe@ue) keâe ØeeLeefcekeâ keâeÙe&
(b) Allow users to enter any value in a field
keäÙee neslee nw?
Ùetpej keâes efkeâmeer heâeru[ ceW keâesF& ceeve ope& keâjves oW~
(c) Have group and sequence of fields logically (a) Browsing websites/JesyemeeFš yeÇeGpe keâjvee
leeefke&âkeâ ™he mes heâeru[ keâe mecetn Deewj ›eâce jKeW~ (b) Sending emails/F&-cesue Yespevee
(d) Make sure that required fields are clearly (c) Transferring files between computers/keâchÙetšjeW
marked/megefveef§ele keâjW efkeâ DeeJeMÙekeâ heâeru[ mhe° ™he kesâ yeerÛe heâeFueW š^ebmeheâj keâjvee
mes efÛeefÖle nQ~ (d) Video streaming/Jeeref[Ùees mš^erefcebie keâjvee
211 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
22. ueeskeâue SefjÙee vesšJeke&â (LAN) ceW, efvecveefueefKele ceW mes Emp (Id, Name, Deptld), Dept (ld, Name) keâe Skeâ
efkeâmekeâe GheÙeesie Ùen megefveef§ele keâjves kesâ efueS meyemes mkeâercee ceeve ueW~ Ùeefo Emp šsyeue ceW 10 efjkeâe[& Deewj
DeefOekeâ efkeâÙee peelee nw efkeâ [sše hewkesâš keâes Gmekesâ MAC efJeYeeie šsyeue ceW 5 efjkeâe[& nQ, lees heefjCeece ceW efkeâleveer
S[^sme kesâ DeeOeej hej mener ef[JeeFme hej kegâMeueleehetJe&keâ hebefòeâÙeeB ØeoefMe&le nesieer efvecveefueefKele SQL keäJesjer?
De«eef<ele efkeâÙee ieÙee nw? Select * From Emp, Dept
(a) uesÙej 3 efmJeÛe (Layer 3 Switch) (a) 15 (b) 5 (c) 10 (d) 50
(b) jeGšj (Router) 28. ………allows searching for information and
computing derived information.
(c) efyeÇpe (Bridge) .............peevekeâejer kesâ efueS Keespe Deewj Øeehle peevekeâejer
(d) nye (Hub) keâer keâchÙetefšbie keâjves keâer megefJeOee oslee nw~
23. Identify the switching technique in which the
message is sent in one go, but it is divided into (a) Data Definition language/[sše [sefheâefveMeve ueQiJespe
smaller pieces, and they are sent individually. (b) Data manipulation language
The pieces are given a unique number and [sše cewveerheguesMeve ueQiJespe
addresses to identify their order at the (c) Query language/keäJesjer ueQiJespe
receiving end. (d) OQL/DeeskeäÙetSue
Gme efmJeÛe lekeâveerkeâ keâer henÛeeve keâerefpeS efpemeceW Skeâ 29. Which of the following options specify how
yeej ceW cewmespe Yespee peelee nw, efkebâleg Gmes Úesšs-efnmmeeW ceW many instances of an entity relate to one
efJeYeeefpele efkeâÙee peelee nw, Deewj GvnW Deueie-Deueie Yespee instance of another entity?
peelee nw~ Gve efnmmeeW keâes Skeâ Devet"e vebyej Deewj S[^sme efvecveefueefKele ceW mes keâewve mee efJekeâuhe efveefo<& š keâjlee nw
efoÙee peelee nw leeefkeâ Øeehlekeâòee& keâer Deesj mes Gvekesâ ›eâce efkeâmeer Sbefššer keâer efkeâleveer DeJemLeeSB efkeâmeer DevÙe Sbefššer
(Dee[&j) keâer henÛeeve keâer pee mekesâ~ kesâ Skeâ DeJemLee mes mebyebefOele nw?
(a) Message Switching/cewmespe efmJeefÛebie (a) Redundancy/efj[bve[Wmeer (b) Ordinality/Dee@e[ f v& eweuf ešer
(b) Packet Switching/hewkesâš efmJeefÛebie (c) Atomicity/Sšesefceefmešer (d) Cardinality/keâeef[v& eweuf ešer
(c) Binary Switching/yeeFvejer efmJeefÛebie 30. Which forms have a relation that contains
information about a single entity?
(d) Circuit Switching/meefke&âš efmJeefÛebie
efkeâve ™heeW ceW Skeâ mebyebOe nw efpemeceW Skeâ FkeâeF& kesâ yeejs ceW
24. In which communication mode, data can be
transmitted in both directions at same time? peevekeâejer nw?
efkeâme mebÛeej kesâ Øekeâej ceWs [eše keâe mebÛejCe Skeâ meceÙe ceW (a) 4NF (b) 3NF
oesveeW efoMeeDeeW ceW mebYeJe neslee nw? (c) 5NF
(d) More than one of the above
(a) Simplex/efmebhueskeäme 31. To retrieve information from a database, which
(b) Full duplex/hetCe& [dÙethueskeäme of the following SQL commands is used?
(c) Half duplex/DeOe& [dÙethueskeäme efkeâmeer [sšeyesme mes metÛevee keâes efvekeâeueves kesâ efueS efvecveebekf eâle
(d) Multiplex/ceušerhueskeäme ceW mes efkeâme keâceeb[ keâe ØeÙeesie efkeâÙee peelee nw?
25. efvecveefueefKele ceW mes keâewve-meer mebmLee, Yeejle ceW Skeâ (a) Display/ef[mheues (b) Show/Mees
Fbšjvesš mesJee Øeoelee nw (ISP) veneR nw? (c) Select/mesueskeäš
(a) HSBC/SÛe.Sme.yeer.meer. (d) More than one of the above/GheÙeg&òeâ ceW mes Skeâ mes
(b) BSNL/yeer.Sme.Sve.Sue. DeefOekeâ
32. Which of the following is true about the
(c) TATA Communications/šeše keâcÙegefvekesâMevme
HAVING clause?/HAVING KeC[ kesâ yeejs ceW,
(d) MTNL/Sce.šer.Sve.Sue.
efvecveefueefKele ceW mes keâewve-mee melÙe nw?
26. GPRS is basically the standard-bearer of:
(a) Similar to the WHERE clause but is used for columns
yegefveÙeeoer ™he mes GPRS efkeâmekeâe Skeâ ceevekeâ Jeenkeâ
rather than groups/keäuee@pe kesâ meceeve uesekf eâve Fmekeâe GheÙeesie
(standard-bearer) nw?
mecegneW kesâ yepeeÙe keâ@euece kesâ efueÙes efkeâÙee peelee nw~
(a) 2.5G technology/2.5peer lekeâveerkeâ (b) Similar to WHERE clause but is used for rows
(b) 3G technology /3peer lekeâveerkeâ rather than columns/keäuee@pe kesâ meceeve uesekf eâve Fmekeâe
(c) 4G technology4peer lekeâveerkeâ GheÙeesie keâe@uece kesâ yepeeÙe hebefòeâÙeeW kesâ efueS efkeâÙee peelee nw~
(d) 2G technology /2peer lekeâveerkeâ (c) Similar to WHERE clause but is used for
27. "Assume a schema of Emp (Id, Name, Deptld), groups rather than rows/keäuee@pe kesâ meceeve uesefkeâve
Dept (ld, Name). If there are 10 records in the hebefòeâÙeeW kesâ yepeeÙe mecetneW kesâ efueS efkeâÙee peelee nw~
Emp table and 5 records in the Dept table, then
(d) More than one of the above/GheÙeg&òeâ ceW mes Skeâ
how many rows will be displayed in the result
of the following SQL query? DeefOekeâ
212 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
33. Which SQL command is used to add new rows 40. Which of the following conditions correctly
to a database table?/[sšeyesme leeefuekeâe ceW veF& check the underflow condition in a queue?/efvecve
hebeqòeâÙeeB peesÌ[ves kesâ efueS efkeâme SQL keâceeb[ keâe GheÙeesie efmLeefleÙeeW ceW mes keâewve meer efmLeefle keäÙet ceW Debb[jHeäuees keâer
efkeâÙee peelee nw efmLeefle keâes mener {bie mes peebÛeleer nw?
(a) ADD/peesÌ[W (b) CREATE/yeveeSB (a) front = –1 (b) rear = 1
(c) INSERT/meeqcceefuele keâjW (c) rear = size (d) front = size
41. What type of error is 'use of undeclared
(d) More than one of the above/GheÙeg&òeâ ceW mes Skeâ mes
variables'?/‘DeIeesef<ele JewefjSyeue keâe GheÙeesie’ efkeâme
DeefOekeâ Øekeâej keâer $egefš nw?
34. _____is a set of one or more attribute(s) taken
(a) Run-time/jve-šeFce (b) Exception/DeheJeeo
collectively to uniquely identify a record.
_____efkeâmeer efjkeâe@[& keâes efJeefMe° ¤he mes henÛeeveves kesâ (c) Logical/leeefke&âkeâ
efueS meecetefnkeâ ¤he mes ueer ieF& Skeâ Ùee DeefOekeâ (d) Compile-time/kebâheeFue šeFce
42. Which of the following assembly includes the core
efJeMes<eleeDeeW keâe Skeâ mesš nw~ set of .NET common exception types, data types
(a) Primary key (b) Foreign key and numerous other fundamental building
(c) Superkey blocks?/efvecveefueefKele ceW mes efkeâme DemeWyeueer ceW .NET
(d) More than one of the above/GheÙeg&keäle ceW mes Skeâ mes keâe@ceve SkeämeshMeve šeFhme, [sše šeFhme Deewj DevÙe cetueYetle
DeefOekeâ efyeefu[bie yuee@keäme keâe keâesj mesš Meeefceue nw?
35. The smaller unit of information about a record (a) mscorlib.dll and System.dll
in a database in called a: (b) System.Data.dll
Skeâ [sšeyesme ceW jskeâe@[& kesâ yeejs ceW peevekeâejer keâer meyemes (c) System.Web.dll
Úesšer F&keâeF& keâes keânles nQ : (d) System.Configuration.dll
(a) Cell/mesue (b) Field/heâeru[ 43. Which CSS selector is used to specify a
particular unique element?
(c) Record/jskeâe@[& (d) Query/keäJesjer
efvecveefueefKele ceW mes efkeâme CSS mesueskeäšj keâe GheÙeesie
36. _________ is one reason for problems of data
efkeâmeer efJeMes<e DeefÉleerÙe DeJeÙeJe (unique element) keâes
integrity./ _________DeebkeâÌ[e MegefÛelee keâer mecemÙeeDeeW
efJeefveefo&° keâjves kesâ efueS efkeâÙee peelee nw?
keâe Skeâ keâejCe nw
(a) Class selector/keäueeme mesueskeäšj
(a) Data redundancy/Heâeuelet [sše
(b) Type selector/šeFhe mesueskeäšj
(b) Data inconsistency/DeeOeej meece«eer keâer Demebieleer
(c) Universal selector/ÙetefveJeme&ue mesueskeäšj
(c) Security constraints/megjef#elelee keâe ØeefleyebOe (d) ID selector/ ID mesueskeäšj
(d) Unauthorized access of data/DeeOeej meece«eer keâe 44. Style definitions are normally saved in
DeJesOe ØeJesMe external_____./mšeFue [sefHeâefveMevme meeceevÙele: yeenÙe
37. Which of the following is the right way to _____ceW mesJe nesles nw~
reverse a string in VBScript? (a) .txt files (b) .js files
efvecveefueefKele ceW mes keâewve-mee VBScript ceW Skeâ efmš^bie (c) .css files (d) .script files
keâes Guešves keâe mener lejerkeâe nw? 45. Which of the following statements is true about
(a) document.write("Right way:" & strReverse("Hello")) the new and malloc?
(b) document.write("Right way:" & stringReverse("Hello")) vÙet Deewj cee@ueeskeâ kesâ yeejs ceW efvecveefueefKele ceW mes keâewve-
(c) document.write("Right way:" &stringRev("Hello")) mee/mes keâLeve melÙe nw/nQ?
(d) document.write("Right way:" & InstrRev("Hello")) I. The ‘new’ is a type of operator while
38. A measure of the amount of memory needed ‘malloc’ is a kind of function.
for an algorithm to execute is called: `vÙet' Skeâ Øekeâej keâe Dee@hejsšj nw, peyeefkeâ `cee@ueeskeâ'
Skeâ Suieesefjodce keâes efve<heeefole keâjves kesâ efueS DeeJeMÙekeâ Skeâ Øekeâej keâe HebâkeäMeve nw~
cesceesjer keâer cee$ee keâe Skeâ ceehe keânueelee nw– II. The ‘new’ invokes a constructor, whereas
(a) time efficiency/meceÙe o#elee ‘malloc’ does not invoke the constructor.
(b) functional efficiency/keâeÙee&lcekeâ o#elee
`vÙet' Skeâ kebâmš^keäšj keâes Deecebef$ele keâjlee nw,
(c) space efficiency/mhesme o#elee
peyeefkeâ `cee@ueeskeâ' kebâmš^keäšj keâes Deecebef$ele veneR
keâjlee nw~
(d) amortised efficiency/heefjMeesefOele o#elee
III. The ‘malloc’ returns void pointer and also
39. In a Queue, an end at which new elements are needed to typecast whereas ‘new’ returns
added is known as/Skeâ keäÙet kesâ Deble ceW peneB hej veS required pointer./`cee@ueeskeâ' MetvÙe hJee@Fbšj
Sefuecebsš peesÌ[s peeles nQ, efkeâme ™he ceW peevee peelee nw? ueewšelee nw Deewj Gmes šeFhekeâemš keâjves keâer Yeer
(a) Top/ še@he (b) Rear /efjÙej DeeJeMÙekeâlee nesleer nw, peyeefkeâ `vÙet' efjšve& kesâ efueS
(c) Bottom/yee@šce (d) Front /Øebâš hJee@Fbšj keâer DeeJeMÙekeâlee nesleer nw~
213 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
 (a) Only I/kesâJeue I (a) Compiler/keâcheeFuej (b) Interpreter/FbšjØesšj
(b) Both I and II/I Deewj II oesveeW (c) Assembler/Smescyuej
(c) Both II and III/II Deewj III oesveeW (d) Microprocessor/ceeF›eâesØeesmesmej
(d) More than one of the above 52. Programme that duplicate the functionality of
GheÙeg&keäle ceW mes Skeâ mes DeefOekeâ one system on another system is known as
46. The C++ code which causes abnormal pees Øees«eece Skeâ efmemšce kesâ hebâkeäMeve keâes otmejs efmemšce
termination/behaviour of a program should be hej vekeâue keâjsiee, GvnW keäÙee keânles nQ?
written under ______ block. (a) Emulators/ScÙeguesšme&
C++ keâes[, pees efkeâmeer Øees«eece kesâ DemeeceevÙe (b) Simulators/efmecÙeguesšme&
meceeheve/JÙeJenej keâe keâejCe yevelee nw, Gmes yuee@keâ kesâ (c) Evaluators/FJewuÙegSšme&
Debleie&le efueKee peevee ÛeeefnS~ (d) PCB/heerÊ meerÊ yeerÊ
(a) Catch (b) Throw (c) Try 53. An activity diagram models the ____ that an
(d) More than one of the above object performs and the order in which it
GheÙeg&keäle ceW mes Skeâ mes DeefOekeâ performs them./Skeâ ieefleefJeefOe DeejsKe .......... keâes
47. Which of the following is a pillar of OOP?/ cee@[ue keâjlee nw pees Skeâ Jemleg keâjlee nw Deewj efpeme ›eâce
efvecveefueefKele ceW mes keâewve OOP keâe Skeâ mlebYe nw? ceW Jen GvnW keâjlee nw~
(a) Inheritance (b) Encapsulation (a) actions/ef›eâÙee (b) attributes/iegCe
(c) Abstraction (c) states/mšsšme
(d) More than one of the above (d) state transitions/mšsš š^ebefpeMevme
GheÙeg&òeâ ceW mes Skeâ mes DeefOekeâ 54. What are the list of coded instructions called
48. Which of the following can be used to create an keâes[s[ efveoxMeeW keâer metÛeer keâes keâne peelee nw~
abstract class in the C++ programming (a) Algorithm/SuieesefjLece
language?/C++ programming Yee<ee ceW Skeâ Decetle&
(b) Computer Language/keâchÙetšj Yee<ee
Jeie& yeveeves kesâ efueS efvecveefueefKele ceW mes efkeâmekeâe GheÙeesie
(c) Computer Program/keâchÙetšj Øees«eece
efkeâÙee pee mekeâlee nw?
(d) None of These/FveceW mes keâesF& veneR
(a) By using the pure virtual function in the class
55. In any language sequential flow of the
keâ#ee ceW Megæ JeÛeg&Deue hebâkeäMeve keâe GheÙeesie keâjkesâ statement is default, Apart from sequential
(b) By declaring a virtual function in the base there are types of flow of execution available
class/DeeOeej keâ#ee ceW JeÛeg&Deue hebâkeäMeve Ieesef<ele keâjkesâ which are?/efkeâmeer Yeer Yee<ee ceW keâLeve keâe Deveg›eâefcekeâ
(c) By declaring the virtual keyword afterward ØeJeen ef[heâe@uš neslee nw, Deveg›eâefcekeâ kesâ DeueeJee
the class declaration/keâ#ee ef[keäuesjsMeve kesâ yeeo efve<heeove kesâ ØeJeen kesâ Øekeâej GheueyOe nesles nQ pees nQ?
JeÛeg&Deue keâerJe[& Ieesef<ele keâjkesâ A. Conditional/kebâ[erMeveue
(d) More than one of the above/GheÙeg&òeâ ceW mes Skeâ B. Looping/uetefhebie
DeefOekeâ (a) Only A/kesâJeue A (b) Only B/kesâJeue B
49. A computer program consists of (c) Neither A nor B/ve lees A Deewj ve ner B
keâchÙetšj Øees«eece ceW neslee nw (d) Both A and B/A Deewj B oesveeW
(a) System flowchart/efmemšce heäueesÛeeš& 56. What are scripting languages?
(b) Program flowchart/Øees«eece heäueesÛeeš& efm›eâeEhšie keäÙee nQ?
(c) Algorithms written in computer language/ (a) The programming languages that pre decide
keâchÙetšj keâer Yee<ee ceW efueefKele algorithms the web page content/Øees«eeefcebie Yee<eeÙes pees Jesye hespe
(d) More than one of the above keâer meece«eer keâes henues mes leÙe keâjleer nw~
GheÙeg&òeâ ceW mes Skeâ mes DeefOekeâ (b) The programming languages that are simpler
50. In C+ +, all members of a class are ______ by and offer same protection/Øees«eeefcebie Yee<eeÙes pees
default./C+ + ceW, class kesâ meYeer meomÙe (members) mejue nw Deewj meceeve megj#ee Øeoeve keâjleer nw~
ef[heâe@uš ™he mes ______ nesles nQ~ (c) The programming languages that trade off
(a) Public (b) Private simplicity for protection/Øees«eeefcebie Yee<eeÙeW pees
(c) Protected megj#ee kesâ efueS mejuelee keâe lÙeeie keâjleer nw~
(d) More than one of the above (d) More than one of the above/GheÙeg&òeâ ceW mes Skeâ mener
GheÙeg&òeâ ceW mes Skeâ mes DeefOekeâ 57. In a binary search tree, which subtree of a
51. Which of the following translates the assembly node contains elements that are greater than
language into machine code?/efvecveefueefKele ceW mes the node’s value?/yeeFvejer meÛe& š^er ceW, keâewve-mee
keâes[eblejCe Yee<ee (Smescyueer ueQiJespe) keâe Ùeb$e ketâš GheJe=#e Skeâ vees[ ceW Ssmes lelJe nesles nQ pees vees[ kesâ ceeve
(ceMeerve keâes[) ceW DevegJeeo keâewve keâjlee nw? mes DeefOekeâ?
214 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
 (a) Left subtree/yeeÙeeb GheJe=#e 65. What is not true about GNU operating system?
(b) Right subtree oeÙeeb GheJe=#e GNU Dee@hejseEšie efmemšce kesâ mecyevOe ceW keäÙee mener veneR nw?
(c) Both subtrees/oesveeW GheJe=#e (a) Its full form is 'GNU's Not Unix'
(d) More than one of the above/GheÙeg&òeâ ceW mes Skeâ mes Fmekeâe Hegâue Heâe@ce& ‘GNU's Not Unix’ nw
DeefOekeâ (b) It was started by Richard Stallman
58. XML is designed to _______ and _______ data. Fmekeâer Meg®Deele efjÛe[& mšeuecewve ves keâer Leer
Select the best pair of answers from the (c) It's an open source software
following options. Ùen Skeâ Deeshesve meesme& mee@HeäšJesÙej nw
XML kesâ [eše keâes _______Deewj _______kesâ efueS (d) It is not compatible with Unix
ef[peeFve efkeâÙee peelee nw~ veerÛes efoS ieS efJekeâuheeW ceW mes Ùen Unix kesâ meeLe keâe@chewefšyeue veneR nw
Gòej kesâ mener Ùegice keâe ÛeÙeve keâerefpeS~ 66. What is called the procedure for transfer of
(a) design, transport/ef[peeFve, š^ebmeheesš& system file to Memory (RAM) in Computer?
(b) store, design/mšesj, ef[peeFve keâchÙetšj ceW efmemšce HeâeFue keâes cesceesjer (jwce) ceW
(c) store, transport/mšesj, š^ebmeheesš& mLeeveebveleefjle keâjves keâer Øeef›eâÙee keâes keâne peelee nw?
(d) format, design/heâecexš, ef[peeFve (a) Processing/Øeesmesefmebie (b) Formatting/heâe@cexefšbie
59. efvecve ceW mes keâewve mee GheÙeesefielee mee@heäšJesÙej veneR nw? (c) None of these/Fveces mes keâesF& veneR
(a) SbšerJeeÙejme (b) ef[mkeâ ef[øesâieceWšsšj (d) Booting/yetefšbie
(c) ]heâeFue ØeyebOekeâ (d) veesšhew[ 67. Which one of the following is not true?
60. Which of the following is a DBMS software ? efvecveefueefKele ceW mes keâewve-mee melÙe veneR nw?
efvecveefueefKele ceW mes keâewve Skeâ DBMS meeheäšJesÙej nw? (a) Kernel remains in the memory during the
(a) Access/Skeämesme (b) Excel/Skeämesue entire computer session/keâvexue hetjs keâchÙetšj me$e kesâ
(c) Word/Je[& oewjeve cesceesjer ceW jnlee nw~
(b) Kernel is made of various modules which can
(d) Power Point/hee@Jej hJeeFbš
not be loaded in running operating system/
61. A malware that secretly collects information
about users without their consent is called:-
keâvexue efJeefYeVe cee@[Ùd etue mes yevee neslee nw efpemes Ûeue jns
Skeâ cewueJesÙej pees ieghle ™he mes GheÙeesiekeâlee&DeeW kesâ yeejs Dee@hejsefšbie efmemšce ceW uees[ veneR efkeâÙee pee mekeâlee nw~
ceW Gvekeâer menceefle kesâ efyevee peevekeâejer Skeâ$e keâjlee nw, (c) Kernel is the first part of the operating system
to load into memory during booting/keâvexue
keânueelee nw:-
yetefšbie kesâ oewjeve cesceesjer ceW uees[ nesves Jeeuee Dee@hejsefšbie
(a) Spyware/mheeF&JesÙej(b) Virus/JeeÙejme efmemšce keâe henuee Yeeie nw~
(c) Bootware/yetšJesÙej (d) Adware/Ss[JesÙej (d) More than one of the above/Ghejeskeäle ceW mes Skeâ mes
62. Software package which provides DeefOekeâ~
advertisements is called?/ efJe%eeheve GheueyOe 68. Which of the following software rearranges
keâjeves Jeeuee mee@HeäšJesÙej hewkesâpe keäÙee keânueelee nw? files so that all parts of the files are next to each
(a) Spam/mhewce (b) Adware/S[JesÙej other?/efvecveefueefKele ceW mes keâewve-mee mee@heäšJesÙej,
(c) Spyware/mheeF&JesÙej (d) Malware/cee@ueJesÙej heâeFueeW keâes hegveJÙe&JeefmLele, keâjlee nw leeefkeâ heâeFueeW kesâ
63. In operating system/compiler parlance, RTL meYeer Yeeie Skeâ-otmejs kesâ yeieue ceW neW?
stands for/Dee@hejsefšbie efmemšce ceW kebâheeFuej kesâ meboYe& (a) Adobe Acrobat/S[esye S›eâesyewš
ceW, RTL keâe hetCe& ™he nw~ (b) Disk Cleanup/ef[mkeâ keäueerveDehe
(a) Run-Time Library (b) Real-Time Load
(c) Disk defragmenter/ef[mkeâ [erøesâieceWšj
(c) Register Transistor Logic
(d) Random Time Locks (d) Skype/mkeâeFhe
64. A computer program that converts a high-level 69. Which of the following options is/are NOT a
language program into an equivalent machine function of an operating system?
language program is called efvecveefueefKele ceW mes keâewve-mee efJekeâuhe Skeâ Dee@hejsefšbie
Skeâ keâchÙetšj Øees«eece, pees GÛÛe-mlejerÙe Yee<ee efmemšce keâe HebâkeäMeve veneR nw?
(machine language) kesâ Øees«eece keâes ceMeerve Yee<ee (i) Process management/ Øeesmesme cewvespeceWš
(machine language) kesâ meceleguÙe Øees«eece ceW yeouelee (ii) User interface/ Ùetpej FbšjHesâme
nw, Gmekeâes keâne peelee nw~ (iii) Memory management/cesceesjer cewvespeceWš
(a) assembler/Smescyeuej (b) compiler/keâcheeFuej (iv) Translating a high-level language source
(c) loader/uees[j code into a machine-level code
(d) More than one of the above/GheÙeg&òeâ ceW mes Skeâ mes Skeâ GÛÛe-mlejerÙe Yee<ee œeesle keâes[ keâe ceMeerve-mlejerÙe
DeefOekeâ keâes[ ceW DevegJeeo keâjvee
215 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
 (a) I and ii only/i Deewj ii kesâJeue 76. Shift key and Print Screen key in a computer
(b) ii, iii and iv only/ii, iii Deewj iv kesâJeue keyboard are known as/kebâhÙetšj keâeryees[& ceW efMeHeäš
(c) iv only/iv kesâJeue Deewj efØebš m›eâerve keâerpe keâes keäÙee keânles nQ?
(d) i, ii and iv only/i, ii Deewj iv kesâJeue (a) Special purpose keys/mhesMeue hehe&me keâerpe
70. _____ is used to shift processes so they are (b) Standard keys/mšw[[& keâerpe
contiguous, and all free memory is in one block. (c) Navigation keys/vesefJeiesMeve keâerpe
_____ keâe GheÙeesie Øeef›eâÙeeDeeW keâes mLeeveevleefjle keâjves (d) Function keys/HebâkeäMeve keâerpe
kesâ efueS efkeâÙee peelee nw leeefkeâ Jes meefVeefnle neW, Deewj meYeer 77. Example of super computer is/meghej keâchÙetšj keâe
cegòeâ cesceesjer Skeâ yuee@keâ ceW neW~ GoenjCe nw-
(a) Fragmentation (b) Compaction (a) ›esâ-2/CRAY-2
(c) External Fragmentation (b) ›esâ SkeämeSceheer-24/CRAY XMP-24
(d) More than one of the above/GheÙeg&òeâ ceW mes Skeâ (c) eflevns-2/ Tianhe-2
DeefOekeâ (d) Ghejeskeäle meYeer/ all of above
71. The removal of errors from computer software 78. The first mechanical computer designed by
is called/keâchÙetšj mee@heäšJesÙej ceW mes $egefšÙeeW keâes nševee Charles Babbage was called?
keânueelee nw- Ûeeume& yewyespe Éeje ef[peeFve efkeâÙee ieÙee henuee Ùeebef$ekeâ
kebâhÙetšj efkeâme veece mes peevee peelee nw?
(a) Interpreting/FbšjØesefšbie (b) Translating/š^ebmeuesefšbie
(a) Analytical Engine/Sveeefueefškeâue Fbpeve
(c) Debugging/[eryeefiebie (d) Compiling/keâcheeFefuebie
(b) Processor/Øeesmesmej
72. The application in java, which is used for
sending small application to run at client side (c) Calculator/kewâuekegâuesšj
is............. (d) Abacus/Deyeskeâme
..............,peeJee ceW Skeâ SefhuekesâMeve nesleer nw, efpemekeâe 79. The first computer which provided storage :
GheÙeesie keäueeFbš meeF[ hej Úesšs ShueerkesâMeve keâes Yespeves henuee keâchÙetšj efpemeceW meb«en (storage) Lee _____
Deewj GvnW Ûeueeves (jve keâjves) kesâ efueS efkeâÙee peelee nw~ (a) EDSAC (b) EDVAC
(c) MARK‐I (d) ACE
(a) Socket/mee@kesâš (b) Applets/Shuesšdme 80. The minimum power consumption happens in
(c) Threads/LeÇs[dme (d) Streams/mš^ercme the case of:
73. A software that runs on a computer hardware efkeâme heefjefmLeefle cebs vÙetvelece efyepeueer keâer Kehele nesleer nw–
and serves as a platform for other softwares to (a) Sleep/efveõe cebs
run is called (b) Hibernate/neFyejvesš
keâchÙetšj ne[&JesÙej hej Ûeueves Jeeuee Skeâ mee@heäšJesÙej pees (c) All of them consumes same amount of power
otmejs mee@heäšJesÙej keâes Ûeueeves kesâ efueS huesšheâece& keâe keâece Thej meYeer efyepeueer keâer meceeve cee$ee keâe GheÙeesie keâjles nQ
keâjlee nw, keânueelee nw (d) Shutdown/keâchÙetšj yebo keâjves hej
(a) system software/efmemšce mee@heäšJesÙej 81. The ________ controls communications for the
(b) operating software/Dee@hejsefšbie efmemšce entire computer system./________mebhetCe& mebieCekeâ
(c) application software/SsefhuekesâMeve mee@heäšJesÙej JÙeJemLee keâe mebÛeej efveÙebef$ele keâjlee nw
(d) More than one of the above/GheÙeg&òeâ ceW mes Skeâ mes (a) ALU /SSueÙet
DeefOekeâ (b) Semiconductor /DeOe&Ûeeuekeâ
74. Which of the following is NOT a software (c) Motherboard /ceoj yees[&
development requirement?/efvecveefueefKele ceW mes (d) Coprocessor /mebmeeOekeâ
keâewve-meer mee@HeäšJesÙej efJekeâeme DeeJeMÙekeâlee veneR nw? 82. efvecve ceW mes keâewve BIOS keâer Yetecf ekeâe keâe JeCe&ve keâjlee nw?
(a) Functional requirements/keâeÙee&lcekeâ DeeJeMÙekeâleeSB (a) ieeflekeâ, DevÙeesvÙeef›eâÙee Jesye meJe&j ShueerkesâMeveeW kesâ me=peve
(b) System requirements/efmemšce DeeJeMÙekeâleeSB ceW Fmekeâe ØeÙeesie neslee nw~
(c) Physical requirements/Meejerefjkeâ DeeJeMÙekeâleeSB (b) Ùen Skeâ Øees«eece nw pees ROM mes efve<heeefole neslee nw peye
(d) More than one of the above/GheÙeg&òeâ ceW mes Skeâ mes keâchÙetšj Ûeeuet neslee nw~
DeefOekeâ (c) [eše keâes «eeHeâerÙe ¤he mes efve¤efhele keâjves kesâ efueS
75. DeeOegefvekeâ efØebšj keâer ieefle keâes ceeheves kesâ efueS efvecveefueefKele ceW Fmekeâe ØeÙeesie neslee nw~
(d) ceesyeeFue nmle-Oeeefjle ef[JeeFmeeW kesâ efueS Ùen Skeâ Demelele
mes keâewve-meer FkeâeF& keâe ØeÙeesie efkeâÙee peelee nw?
Dee@hejsefšbie efmemšce nw~
(a) De#ej Øeefle efceveš (cpm)
83. A storage device used to compensate the
(b) hebefòeâ Øeefle efceveš (lpm) difference in flow of data is known as
(c) he=‰ Øeefle efceveš (ppm) [sše kesâ ØeJeen ceW Deblej keâer YejheeF& kesâ efueS GheÙeesie keâer
(d) Meyo Øeefle efceveš (wpm) peeves Jeeueer mšesjspe ef[JeeFme keâes keäÙee keâne peelee nw?
216 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
 (a) main memory/cegKÙe efceceesjer 89. Direct Memory Access (DMA) is a technique
(b) auxiliary memory/meneÙekeâ efceceesjer where in the CPU:/[eÙejskeäš cesceesjer Skeämesme Skeâ
(c) buffer/yeheâj pewmeer lekeâveerkeâ nw efpemeceW meer.heer.Ùet.-
(d) More than one of the above/GheÙeg&òeâ ceW mes Skeâ mes (a) transfers data to I/O
DeefOekeâ Fvehegš/DeeGšhegš kesâ efueS [sše mLeeveevlejCe
84. Which of the following is the core of the Linux (b) transfers data to the disk drive
system, manages the CPU, memory, and peripheral ef[mkeâ [^eFJe kesâ efueS [sše š^evmeheâj keâjvee
devices, and is the lowest level of the OS? (c) is idle and transfer takes place through a
efvecve ceW mes keâewve-mee efuevekeäme efmemšce keâe keâesj nw, network/vesšJeke&â kesâ Éeje [sše š^evmeheâj kesâ efueS
meerheerÙet, cesceesjer Deewj hesefjhesâjue ef[JeeFme keâe ØeyebOeve efveef<›eâÙe nw~
keâjlee nw, Deewj Dees Sme keâe efvecvelece mlej nw? (d) is idle and does not play any role in data
(a) Bootloader (b) Desktop environment transfers/Ùen efveef<›eâÙe nw Deewj [sše š^evmeheâj ceW keâesF&
(c) Kernel (d) Daemons Yetefcekeâe veneR efveYeelee nw~
85. efvecveefueefKele Ùegice efoS ieS nw– 90. Which of the following is not true about
(A) JeeF& HeâeF& – cee@[sce EPROM?/efvecveefueefKele ceW mes keâewve EPROM kesâ yeejs ceW
(B) ›eâesce – kesâyeue mener veneR nw–
(C) HeâeFue – ne[& [^eFJe (a) Random access memory/jwC[ce Skeämesme cesceesjer
(D) ÛeeefpeËie – kesâyeue (b) Erasable programmable read only memory
efvecveefueefKele ceW mes keâewve mee Ùegice Mes<e mes efYeVe nw? efcešves Jeeuee Øees«eece jer[ Deeveueer cesceesjer
(c) Non-volatile memory/veeve-JeesueešeFue cesceesjer
(a) (C) leLee (D) (b) (A) kesâJeue
(d) Sequential access memory/›eâceevegmeej cesceesjer
(c) (B) kesâJeue (d) (C) kesâJeue
91. Identify whether the given statements are true
86. Which of the following CPU registers is used to
store data and intermediate results produced or false./efoS ieS keâLeveeW kesâ mener Ùee ieuele nesves keâe
by the ALU? efveOee&jCe keâerefpeS~
efvecveefueefKele ceW mes efkeâme CPU jefpemšj keâe GheÙeesie, (i) SDRAM is known as Synchronous DRAM,
[sše Deewj ALU Éeje GlheVe efkeâS ieS ceOÙeJeleea and it is faster than the general DRAM./
heefjCeeceeW keâes meb«enerle keâjves kesâ efueS efkeâÙee peelee nw? SDRAM keâes efmeb›eâesveme DRAM kesâ ™he ceW peevee
(a) Program counter/Øees«eece keâeGbšj peelee nw Deewj Ùen meeceevÙe DRAM mes DeefOekeâ les]pe
(b) Memory address register/cesceesjer S[^sme jefpemšj nesleer nw~
(c) Accumulator/SkeäÙegceguesšj (ii) SRAM is faster than DRAM, but it requires
continuous refreshing./SRAM, DRAM mes
(d) Instruction register/Fbmš^keäMeve jefpemšj
87. The amount of memory (RAM or ROM) is DeefOekeâ les]pe nesleer nw, uesefkeâve Fmes ueieeleej efjøesâMe
measured in : keâjves keâer DeeJeMÙekeâlee nesleer nw~
cesceesjer keâer cee$ee ______ jwce Ùee jesce (RAM or (a) (i)-True, (ii)-False/(i)-mener, (ii)-ieuele
ROM) ceW ceehee peelee nw: (b) (i)-True, (ii)-True/(i)-mener, (ii)-mener
(a) bytes/yeeFšdme (b) bits/efyešdme (c) (i)-False, (ii)-True/(i)-ieuele, (ii)-mener
(c) megabytes/cesieeyeeFšdme (d) megabits/cesieeefyešdme (d) (i)-False, (ii)-False/(i)-ieuele, (ii)-ieuele
88. Consider a system with a total physical 92. efvecveefueefKele ceW mes efkeâme ne[&JesÙej Ieškeâ keâes Yeb[ejCe
memory of 8 GB and total virtual memory of FkeâeF& (storage unit) kesâ ™he ceW Yeer ceevee peelee nw,
16 GB. If the system is using 6 GB of physical neueebefkeâ Fmekeâer Yeb[ejCe #ecelee (storage capacity)
memory and 10 GB of virtual memory, how
much memory is being swapped out?/Skeâ yengle keâce nesleer nw?
efmemšce hej efJeÛeej keâjW efpemeceW kegâue Yeeweflekeâ cesceesjer 8 (a) jefpemšj (b) kebâš^esue Ùetefveš (CU)
peeryeer Deewj kegâue JeÛeg&Deue cesceesjer 16 peeryeer nw~ Ùeefo (c) [eše yeme (d) SSueÙet (ALU)
efmemšce 6 peeryeer Yeeweflekeâ cesceesjer Deewj 10 peeryeer JeÛeg&Deue 93. In various devices, _____ are used to overcome
the difference in data transfer speed.
cesceesjer keâe GheÙeesie keâj jne nw, lees efkeâleveer cesceesjer mJewhe efJeefYeVe GhekeâjCeeW ceW, [sše š^^ebmeheâj ieefle ceW Devlej keâes
keâer pee jner nw? otj keâjves kesâ efueS _____ keâe GheÙeesie efkeâÙee peelee nw~
(a) 2 GB/2 peeryeer (a) multiple buses
(b) 4 GB/4 peeryeer (b) buffer registers
(c) 6 GB/6 peeryeer (c) speed-enhancing circuitries
(d) More than one of the above/GheÙeg&òeâ ceW mes Skeâ mes (d) More than one of the above/GheÙeg&òeâ ceW mes Skeâ
DeefOekeâ DeefOekeâ
217 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
94. What does a Quad in a K-map represent ? (a) AND (b) XOR
K-map ceW Skeâ Quad keäÙee oMee&lee nw? (c) NOR (d) XNOR
(a) Difference/Deblej (b) Sum/Ùeesie 98. Ex-OR HebâkeäMeve Øeehle keâjves kesâ efueÙes vÙetvelece efkeâleves
(c) Product/iegCeveHeâue (d) Don't care/[eWš kesâÙej NAND iesš keâer DeeJeMÙekeâlee nesleer nw?
95. The Boolean expression (A.B)' is equivalent to: (a) 4 (b) 3
yetueerÙe JÙebpekeâ (Boolean expression) (A.B)' efkeâmekesâ (c) 2 (d) 5
meceleguÙe nw? 99. The logic gate that provides high output for
(a) A'.B' (b) A+B' same input is:
(c) A.B' (d) A'+B' uee@efpekeâ iesš, pees meceeve Fvehegš kesâ efueS GÛÛe DeeGšhegš
96. In two-valued Boolean algebra, the maximum Øeoeve keâjlee nw, nw–
number of Boolean function for two variables (a) NOT
will be/oes ceeve Jeeues yetefueÙeve DeuepesyeÇe ceW 2 (b) X-NOR
JewefjSyeume kesâ efueS DeefOekeâlece yetefueÙeve hebâkeäMeve (c) XOR
(Boolean function) keâer mebKÙee nesieer (d) More than one of the above/GheÙeg&keäle ceW mes Skeâ mes
(a) 8 (b) 12 DeefOekeâ
(c) 16 100. What are the basic gates in MOS logic family?
(d) More than one of the above/GheÙeg&òeâ ceW mes Skeâ mes Sce. Dees. Sme. uee@efpekeâ heefjJeej ceW yegevf eÙeeoer Éej keäÙee nQ?
DeefOekeâ (a) NAND and NOR
97. Which of the following logic gates shows output (b) AND and OR
1 when value of input is different?
(c) NAND and OR
efvecveefueefKele ceW mes keâewve mee leee|keâkeâ iesš, Fvehegš cetuÙeeW
(d) More than one of the above
kesâ efYevve nesves hej 1 Glheeove (DeeGšhegš) oMee&lee nw?

SOLUTION : PRACTICE SET- 8

ANSWER KEY
1. (c) 11. (a) 21. (c) 31. (c) 41. (d) 51. (c) 61. (a) 71. (c) 81. (c) 91. (a)
2. (a) 12. (a) 22. (a) 32. (c) 42. (a) 52. (a) 62. (b) 72. (b) 82. (b) 92. (a)
3. (d) 13. (a) 23. (b) 33. (c) 43. (d) 53. (a) 63. (a) 73. (b) 83. (c) 93. (b)
4. (a) 14. (b) 24. (b) 34. (c) 44. (c) 54. (c) 64. (b) 74. (c) 84. (c) 94. (c)
5. (d) 15. (b) 25. (a) 35. (b) 45. (d) 55. (d) 65. (d) 75. (c) 85. (c) 95. (d)
6. (c) 16. (d) 26. (a) 36. (a) 46. (c) 56. (b) 66. (d) 76. (a) 86. (c) 96. (c)
7. (a) 17. (a) 27. (d) 37. (a) 47. (d) 57. (b) 67. (b) 77. (d) 87. (c) 97. (b)
8. (b) 18. (a) 28. (c) 38. (c) 48. (a) 58. (c) 68. (c) 78. (a) 88. (b) 98. (a)
9. (b) 19. (d) 29. (d) 39. (b) 49. (c) 59. (d) 69. (c) 79. (a) 89. (d) 99. (b)
10. (a) 20. (c) 30. (a) 40. (a) 50. (b) 60. (a) 70. (b) 80. (d) 90. (d) 100. (a)
SOLUTION
1. (c) peelee nw~ setup() hebâkeäMeve ØelÙeskeâ hee@JejDehe Ùee Deeef[&vees yees[& kesâ
yeepeej GvcegKe keäueeG[ Deeefke&âšskeäÛej ceW, keäueeG[ keâchÙetefšbie megefJeOee mes jermesš kesâ yeeo kesâJeue Skeâ yeej Ûeuelee nw~
keäueeG[ mesJee Øeoelee, keäueeG[ GheÙeesiekeâlee& Deewj oueeue ueeYeeefvJele nesles nw~ loop ()– loop() keâe GheÙeesie setup() kesâ yeeo efkeâÙee peelee nw,
2. (a) hebâkeäMeve loop() keâes cegKÙe keâeÙe&›eâce ceW yeej-yeej efve<heeefole efkeâÙee
SveSueheer (NLP) keâe celeueye vesÛegjue ueQiJespe Øeesmesefmebie nw, pees peelee nw~ Ùen yees[& keâes leye lekeâ efveÙebef$ele keâjlee nw peye lekeâ efkeâ yees[ &
Deeefš&efheâefMeÙeue FbšsefuepeWme keâe Skeâ efnmmee nw~ Fme lekeâveerkeâ keâe GheÙeesie yebo Ùee jermesš ve nes peeÙes~
ceMeerveeW Éeje ceeveJe keâer Yee<eeDeeW keâes mecePeves, efJeMues<eCe keâjves, nsjhesâj 4. (a)
keâjves Deewj JÙeeKÙee keâjves kesâ efueS efkeâÙee peelee nw~ SveSueheer keâchÙetšj keâes Fbšjvesš Deewj IoT keâer Glheefòe 1962 ceW, pes.meer.Deej. ef[HeWâme
ceveg<ÙeeW kesâ meeLe Gvekeâer Yee<eeDeeW ceW mebJeeo keâjves ceW ceoo keâjlee nw~ Ùen S[Jeebm[ efjmeÛe& Øeespeskeäšdme SpeWmeer (DARPA) kesâ ØecegKe efueefkeäuešj
yengle meceÙe kegâMeue nw~ SveSueheer keâes DeefOekeâ keâer-mš^eskeäme keâer DeeJeMÙekeâlee ves keâchÙetšjeW kesâ Skeâ Fbšjkeâveskeäšs[ mesš kesâ Skeâ iewuesefkeäškeâ vesšJeke&â
nes mekeâleer nw~ SveSueheer DeØelÙeeefMele nw~ keâer keâuhevee keâer, Gmekesâ yeeo 1969 ceW S[Jeebm[ efjmeÛe& Øeespeskeäšdme
3. (d) SpeWmeer vesšJeke&â (ARPANET) ceW efJekeâefmele ngF&~
setup() – mkesâÛe Meg® nesves hej setup() hebâkeäMeve keâes keâe@ue efkeâÙee 5. (d) AI kesâ cegKÙe Ghe#es$e-
peelee nw~ JewefjyeSue keâes FefveefMeÙeueeFpe keâjves, cees[ keâes efheve keâjves, ceMeerve ueefveËie
ueeF&yeÇsjer keâe GheÙeesie Meg® keâjves Deeefo kesâ efueS Fmekeâe GheÙeesie efkeâÙee [erhe ueefveËie
218 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
 jesyeesefškeäme 12. (a)
vÙetjue vesšJeke&â Dee@Leefjbie Øees«eece GÛÛe-mlejerÙe kebâhÙetšj Øees«eece nw efpevnW kebâhÙetšj
Øeeke=âeflekeâ Yee<ee ØemebmkeâjCe Deewj DeeOeeefjle š^sefvebie, FbšjsefkeäšJe ØemlegeflekeâjCe Deewj ceušerceeref[Ùee yeveeves kesâ
DeevegJebefMekeâ Suieesefjæ efueS ef[peeFve efkeâÙee ieÙee nw, Dee@Leefjbie Øees«eece efÛeÖeW kesâ ™he ceW
6. (c) Øemlegle efkeâÙes peeves Jeeues keâceeC[ keâes š^ebmeuesš keâjlee nw~
MQTT keâe hetCe& ™he ‘cewmespe keäÙet šsueercesš^er š^ebmeheesš&’ neslee nw~ Ùen 13. (a)
Skeâ ueeFšJesš, heefyueMe-meym›eâeFye vesšJeke&â Øeesšeskeâe@ue nw, efpemes cegKÙe efyepevesme-šg-efyepevesme (B2B) keâe celeueye JÙeJemeeÙeeW kesâ yeerÛe uesve-osve Ùee
™he mes Úesšs meWmej Deewj ceesyeeFue ef[JeeFmeeW kesâ efueS ef[peeFve efkeâÙee mebyebOeeW mes nw, pees F&-ieJeve&ceWš cee@[ue veneR nw~ F&-ieJeve&ceWš ceW mejkeâejer
ieÙee nw, pees vÙetvelece yeQ[efJeL[ Deewj keâce Tpee& Kehele keâe GheÙeesie mebmLeeDeeW Deewj DevÙe mecetneW, pewmes veeieefjkeâeW (G2C), DevÙe mejkeâejeW
keâjles nw~ Fmekeâe GheÙeesie Dekeämej IoT ceW efkeâÙee peelee nw~ (G2G) Ùee JÙeJemeeÙeeW (G2B) kesâ yeerÛe yeeleÛeerle Meeefceue nw~
7. (a) 14. (b)
ke=âef$ece yegefæceòee keâes Skeâ Ssmes #es$e kesâ ™he ceW heefjYeeef<ele efkeâÙee ieÙee GheYeesòeâe mes JÙeJemeeÙe (C2B) F&-keâceme& cee@[ue keâe šeheF veneR nw~
nw efpemekeâe GösMÙe Ssmeer yegefæceeve ceMeerveW efkekeâefmele keâjvee nw pees F&-keâceme& kesâ meeceevÙe cee@[ue ceW efvecveefueefKele Meeefceue nw~
ceveg<ÙeeW kesâ meceeve keâece keâj mekesâb Deewj hengbÛe mekesâb~ DeleŠ efyebog (iii) 1. JÙeJemeeÙe mes GYeesòeâe (B2C)
melÙe nw~ 2. GheYeesòeâe mes GYeesòeâe (C2C)
ke=âef$ece yegefæceòee keâer cegKÙe MeeKeeSB nQ:- 3. JÙeJemeeÙe mes JÙeJemeeÙe (B2B)
keâbhÙetšj efkeÌpeve, efkeMes<e%e ØeCeeueer, jesyeesefškeäme, ÌHeâÌpeer uee@efpekeâ, ceMeerve 15. (b)
ueefveËie, [erhe ueefveËie, vesÛegjue ueQiJespe Øeesmesefmebie Deeefo~ FmeefueS efyebog heâe@ce& keâes efheâue keâjves kesâ efueS kegâÚ efveÙece nesles nw~ heâe@ce& keâes ef[peeFve
(v) Yeer melÙe nw peyeefkeâ efyebog (i), (ii) Deewj (iv) ke=âef$ece yegefæceòee keâjles meceÙe heâe@ce& heâeru[ keâes Fme Øekeâej efoMee-efveoxMe efoÙes peeles nw efkeâ
keâe mešerkeâ efkekejCe veneR nQ~ keâesF& heâeru[ Keeueer jns lees heâe@ce& meyeefceš ve nes Deewj vecyej Jeeues
8. (b) heâeru[ ceW efmehe&â vecyej ner ope& efkeâÙee pee mekesâ, F&cesue heâeru[ ceW efmehe&â
ceeF›eâeskebâš^esueme& kesâ efJeefYeVe #es$eeW ceW SefhuekesâMeve keâer Skeâ efJemle=le Jewefue[ cesue ope& nes Ùeefo heâeru[ Ùee cesue heâeru[ ceW keâesF& Deewj JewuÙet
ëe=bKeuee nw~ efoÙes peeÙes lees heâeru[ Sjj cewmespe oW~
(i) Scyes[s[ efmemšce :- JeeefMebie ceMeerve ceeF›eâesJesye DeesJeve Deewj 16. (d)
Dee@šescesefškeâ kebâš^esue efmemšce~ keâchÙetšj JeeÙejme Skeâ mee@HeäšJesÙej Øees«eece nw pees [sše keâes #eefle hengÛelee
(ii) jesyeesefškeäme nw, mJebce keâe keäueesve yevee mekeâlee nw Deewj Øees«eece keâer #eefle keâjlee nw~
(iii) IoT 17. (a)
(iv) kebâpÙetcej Fueskeäš^e@efvekeäme yeÇe[keâe@mš vesšJeke&â ceW, metÛevee Skeâ vesšJeke&â kesâ meYeer mšsMeveeW keâes Yespeer
(v) Dee@šesceesefšJe peeleer nw peyeefkeâ ceušerkeâe@mš vesšJeke&â ceW [sše Ùee metÛevee vesšJeke&â ceW
(vi) Fb[efmš^Ùeue Dee@šescesMeve mšsMeveeW kesâ Skeâ mecetn keâes Yespeer peeleer nw Ùetefvekeâe@mš vesšJeke&â ceW metÛevee
(vii) cesef[keâue ef[JeeFme kesâJeue efJeefMe° mšsMeve keâes Yespeer peeleer nw~ vesšJeke&â keâe yeÇeb[keâe@mš
(viii) HeâeÙej Deueece& Ss[^sme vesšJeke&â keâe Debeflece efveefo&° Ss[^ms e nw~
(ix) LED 18. (a)
9. (b) vesšJeke&â efJeefYeVe ef[JeeFmeeW keâe FbšjkeâveskeäMeve neslee nw pees efkeâ [sše Ùee
hewkesâš [sše keâer Skeâ FkeâeF& nw pees efkeâmeer vesšJeke&â, pewmes F&Lejvesš Ùee Fveheâe@cexMeve keâes MesÙej keâjves kesâ hehe&pe mes Skeâ otmejs mes pegÌ[s jnles nw~
efkeâmeer DevÙe JeeÙe[& mebÛeej ØeCeeueer hej Øemeeefjle nesleer nw~ hewkesâš Skeâ 19. (d)
yeÌ[s mebosMe Ùee HeâeFue kesâ Úesšs Keb[ nesles nQ efpevnW Deueie-Deueie Yespee Øeesšeskeâe@ue kesâ TCP/IP metš keâes uesÙejeW (Ùee uesJeue) kesâ meboYe& ceW
peelee nw Deewj iebleJÙe hej efHeâj mes peesÌ[e peelee nw~ FveceW mLeeveebleefjle mecePee pee mekeâlee nw~ Ùen DeebkeâÌ[e (Figure) TCP/IP Øeesšeskeâe@ue
efkeâÙee pee jne [sše Deewj hewkesâš keâes Gmekesâ iebleJÙe lekeâ ™š keâjves kesâ keâer hejlees keâes oMee&lee nw~ Thej mes uesÙej kesâ veece, ShueerkesâMeve uesÙej,
efueS efveÙeb$eCe peevekeâejer oesveeW Meeefceue nQ~ š^ebmeheesš& uesÙej, vesšJeke&â uesÙej, vesšJeke&â Fbšjhesâme uesÙej Deewj ne[&JesÙej
10. (a) nw~ TCP/IP ef[heâeFve keâjlee nw efkeâ metÛevee Øes<ekeâ mes efjmeerJej lekeâ
HTML (Hypertext Markup Language) Jesye hespe Deewj Jesye kewâmes peeleer nw~
DeeOeeefjle She yeveeves ceW Fmlesceeue nesves Jeeueer Skeâ ceeke&âDehe Yee<ee nw~ Fmekeâe
GheÙeesie efkeâmeer JesyemeeFš keâer yegefveÙeeoer mebjÛevee yeveeves kesâ efueS efkeâÙee peelee
nw, peyeefkeâ Python, Java, Php GÛÛe Øees«eeefcebie Yee<ee nw~
11. (a)
SveercesMeve Deewj efheâuce efvecee&Ce ceW Skeâ keâer-øesâce Skeâ [^eFbie Ùee Mee@š
neslee nw pees efkeâmeer Yeer mcetLe š^ebefpeMeve kesâ ØeejcYe Deewj meceeefhle
efyevogDeeW keâes heefjYeeef<ele keâjlee nw~
219 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
vesšJeke&â Fbšjhesâme uesÙej efkeâmeer Yeer efuebkeâ uesÙej Øeesšeskeâe@ue ns[j keâes 27. (d)
peesÌ[ves Ùee nševes kesâ efueS efpeccesoej nw pees mebosMe keâes Gmekesâ iebleJÙe Emp šsyeue ceW 10 efjkeâe@[& nw ›eâceMe: Id, Name Deewj DeptId
lekeâ hengBÛeeves kesâ efueS DeeJeMÙekeâ nw~ vesšJeke&â S[ehšj ef[JeeFme Deewj Dept šsyeue ceW 5 efjkeâe@[& nw Id Deewj Name, Ùeefo nce oesveeW
[^eFJej vesšJeke&â S[ehšj keâe[& keâes efveÙebef$ele keâjlee nw~ Skeâ vesšJeke&â šsyeue mes Skeâ meeLe [sše efvekeâeuevee Ûeenles nw lees Skeâ SQL keäJesjer
Fbšjhesâme Deeceleewj hej vesšJeke&â S[ehšj mes pegÌ[e neslee nw~ heâe@Ùej keâjveer nesieer~
20. (c) Select * From Emp, Dept
IPv4 keâe hetCe& ™he Fbšjvesš Øeesšeskeâe@ue Jepe&ve 4 nw~ peye keâesF& Yeer Fme keäJesjer keâes efve<heeefole keâjves hej rows keâe cartesian product
GhekeâjCe Fbšjvesš keâe GheÙeesie keâjlee nw, lees Gmes Skeâ Ùetefvekeâ IP neslee nw peneB henues šsyeue kesâ hebefòeâÙeeW keâe otmejs šsyeue kesâ hebefòeâÙeeW mes
S[^sme efoÙee peelee nw~ pewmes - 192.168.0.1 iegCeebkeâ neslee nw DeLee&led 10×5=50 rows
IPv4 ceW DeeF& heer S[^sme 32 bits keâe neslee nw~ Ùen keäueeme - A 28. (c)
S[^sme vesšJeke&â ID kesâ efueS ØeLece 8 efyešdme leLee keäueeme- C S[^sme, keäJesjer ueQiJespe peevekeâejer kesâ efueS Keespe Deewj Øeehle peevekeâejer keâer
nesmš ID kesâ efueS Debeflece 8 efyešdme keâe GheÙeesie keâjlee nw~ kebâhÙetefšbie keâjves keâer megefJeOee Øeoeve keâjleer nw Ùen Skeâ [sšeyesme
21. (c) Øees«eeefcebie Yee<ee nw pewmes- SQL
heâeFue š^ebmeheâj Øeesšeskeâe@ue (FTP) Skeâ ceevekeâ mebÛeej Øeesšeskeâe@ue nw 29. (d)
efpemekeâe GheÙeesie keâchÙetšj heâeFueeW keâes Fbšjvesš kesâ ceeOÙece mes Skeâ keâe@ef[&vewefuešer Ùen efveefo&° keâjlee nw efkeâ efkeâmeer Sbefššer keâer efkeâleveer
mLeeve mes otmejs mLeeve hej mLeeveebleefjle keâjves kesâ efueS efkeâÙee peelee nw~ DeJemLeeSb efkeâmeer DevÙe Sbefššer kesâ Skeâ DeJemLee mes mebyebeOf ele nw~
22. (a) 30. (a)
efmJeÛe Skeâ vesšJeke&â ef[JeeFme nw efpemekeâe GheÙeesie vesšJeke&â keâes Deueie- Ùeefo efkeâmeer mebyebOe ceW iewj-legÛÚ yeng-cetuÙe efveYe&jleeSb vener nw, lees Jen
Deueie meyevesšJeke&â ceW efJeYeeefpele keâjves kesâ efueS efkeâÙee peelee nw~ efpevnW 4NF ceW neslee nw~ Ùen megefveef§ele keâjlee nw efkeâ ØelÙeskeâ efjkeâe@[& ceW kesâJeue
meyevesš Ùee LAN mesieceWš keâne peelee nQ Ùen MAC S[^sme kesâ DeeOeej Skeâ FkeâeF& keâer peevekeâejer nesleer nw, efpememes [sše ceW DeveeJeMÙekeâlee Ùee
hej LAN mesieceWš kesâ yeerÛe hewkesâš keâes efHeâušj keâjves Deewj De«esef<ele efJemebieefle vener nesleer~
keâjves kesâ efueS efpeccesoej nw~ 31. (c)
23. (b) [sšeyesme mes metÛevee efvekeâeueves kesâ efueS SQL ceW Select keâceeb[ keâe
hewkesâš efmJeefÛebie Skeâ efmJeefÛebie lekeâveerkeâ nw efpemeceW mebosMe Skeâ yeej ceW ØeÙeesie efkeâÙee peelee nw~ Ùen keâceeb[ [sšeyesme mes [sše keâes heÌ{ves Deewj
Yespee peelee nw, uesefkeâve Fmes Úesšs šgkeâÌ[eW ceW efJeYeeefpele efkeâÙee peelee nw Jeeheme ueeves kesâ efueS ØeÙeesie efkeâÙee peelee nw~ pewmes-
Deewj GvnW Deueie-Deueie Yespee peelee nw~ mebosMe Úesšs šgkeâÌ[eW ceW Select * From employees;
efJeYeeefpele nes peeles nw efpevnW hewkesâš keâne peelee nw Deewj hewkesâš keâes Øeehle FmeceW employees veecekeâ šsyeue mes meYeer keâe@uece Deewj hebefòeâÙeeB
keâjves Jeeues Úesj hej Gvekesâ ›eâce keâer henÛeeve keâjves kesâ efueS Skeâ mesueskeäš nes jner nw~
efJeefMe° mebKÙee oer peeleer nw~ 32. (c)
24. (b) HAVING keäuee@pe, WHERE keäuee@pe keâer lejn [sšeyesme mes [sše
keâcÙegefvekesâMeve (mebÛeej) Ûewveue leerve Øekeâej kesâ nesles nw- efHeâušj keâjves kesâ efueS ØeÙeesie neslee nQ, uesekf eâve WHERE keäuee@pe keâe
(1) efmecheueskeäme (Simplex) – Fme DeJemLee ceWs [eše mebÛejCe GheÙeesie jeW keâes efHeâušj keâjves kesâ efueS efkeâÙee peelee nw peyeefkeâ
meowJe Skeâ efoMee ceW neslee nw DeLee&led nce Deheveer metÛeveeSb Yespe HAVING keäuee@pe keâe GheÙeesie «egehf ebie Deewj S«eeriesMeve HebâkeäMeve kesâ meeLe
mekeâles nw, Øeehle venerW keâj mekeâles~ GROUP by mšsšceWš kesâ efueS efkeâÙee peelee nw~
(2) Deæ& [dÙethueskeäme (Half Duplex) – Fme DeJemLee ceW [eše 33. (c)
mebÛejCe oesvees efoMeeDeeW ceW neslee nw efkeâvleg Skeâ meceÙe ceW Skeâ ner [sšeyesme šsyeue ceW veF& hebefòeâÙeeB peesÌ[ves kesâ efueS SQL keâceeb[
efoMee cesW [eše mebÛejCe neslee nw~ DeLee&led nce Deheveer metÛeveeDeeW keâes INSERT keâe GheÙeesie efkeâÙee peelee nw~
Skeâ ner meceÙe ceW Ùee lees Yespe mekeâles nQ Ùee Øeehle keâj mekeâles nw~ 34. (c)
(3) hetCe& [dÙethueskeäme (Full Duplex)– Fme DeJemLee ceW [eše mebÛejCe `meghej keâer' efkeâmeer efjkeâe@[& keâes efJeefMe° ¤he mes henÛeeveves kesâ efueS meecetenf keâ
oesveeW efoMeeDeeW ceW mebYeJe neslee nw DeLee&led nce Skeâ ner meceÙe ceW ¤he mes ueer ieF&, Skeâ Ùee DeefOekeâ efJeMes<eleeDeeW keâe Skeâ mesš nw~
metÛeveeSb Yespe Yeer mekeâles nw Deewj Øeehle Yeer keâj mekeâles nQ~ 35. (b)
25. (a) Skeâ [sšeyesme ceW efjkeâe@[& kesâ yeejs ceW peevekeâejer keâer meyemes Úesšer FkeâeF&
SÛe.Sme.yeer.meer. (HSBC) mebmLee Yeejle ceW efJeosMeer yeQefkebâie mebmLee nw~ keâes heâeru[ keânles nQ~
peyekeâer BSNL, TATA, MTNL Yeejle ceW ISP mesJee Øeoeve keâjleer nw 36. (a)
26. (a) DeeBkeâÌ[e Deeflejbkeâlee (Data Redundancy) DeebkeâÌ[e MegefÛelee keâer
peerheerDeejSme cetue ™he mes 2.5 peer lekeâveerkeâ keâe ceevekeâ Jeenkeâ nw~ mecemÙeeDeeW keâe Skeâ keâejCe nw~ efkeâmeer [sše keâe yeej-yeej oesnjeJe ner
Ùen hewkesâš efmJeÛ[ Øekeâej keâe vesšJeke&â nw efpemeceW efyeefuebie kegâue [sše efj[b[svmeer keânueelee nw~ Ùen Skeâ [sšeyesme Ùee [sše mšesjspe
mLeeveebleefjle [sše hej efveYe&j keâjleer nw~ Ùen Deheves GheÙeesiekeâlee&DeeW keâer lekeâveerkeâ kesâ Yeerlej yeveeF& ieF& Skeâ Mele& nw efpemeceW [sše keâe Skeâ ner
Fbšjvesš hej meerOee keâveskeäMeve efJekeâefmele keâjves keâer megefJeOee oslee nw~ Yeeie oes Deueie-Deueie peieneW hej neslee nw~
220 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
37. (a) 44. (c)
VBScript ceW efkeâmeer efmš^bie keâes efjJeme& keâjves kesâ efueS nceW Skeâ efmš^bie mšeFue [sefHeâefveMevme meeceevÙele: yeenÙe .css HeâeFueeW ceW mesJe nesles nw~ Ùes
Deewj efjJeme& keâe hebâkeäMeve ÛeeefnS~ yeenjer HeâeFueW HTML [e@keäÙetceWš mes efuebkeâ keâer peeleer nw, efpememes efkeâ Skeâ
Syntax– ner .css HeâeFue keâes keâF& HTML hespeeW hej ueeiet efkeâÙee pee mekesâ~
strReverse(string) 45. (d)
Example– vÙet Deewj cee@ueeskeâ oesveeW ner C++ Deewj C programming language ceW
<script> [eÙeveeefcekeâ cesceesjer keâe DeeJebšve keâjves kesâ efueS GheÙeesie keâer peeleer nQ~
text = "Hello Rahul" vÙet C++ keâe keâer-Je[& nw Deewj Ùen Dee@hejsšj Dee@ypeskeäš kesâ efueS cesceesjer
document.write(strReverse(text))
DeeJebefšle keâjlee nw Deewj Gmekeâe kebâmš^keäšj keâe@ue keâjlee nw~ Fmekeâe
</script>
Outout–
GheÙeesie keâjles meceÙe Deeypeskeäš kesâ [sše šeFhe kesâ veece kesâ meeLe vÙet kesâ
Hello Rahul yeeo [sše kesâ meeLe keâesueve (:) Deewj Gmekesâ yeeo efveefo&° efkeâÙee ieÙee
38. (c) [sše kesâ efueS ef[Heâe@u[ keâebmš^keäšj keâe GheÙeesie keâj mekeâles nQ~
Skeâ Suieesefjodce keâes efve<heeefole keâjves kesâ efueS DeeJeMÙekeâ cesceesjer keâer cee@ ueeskeâ C Øees«eeefcebie ueQiJespe ceW Skeâ mšQ[[& ueeFyeÇsjer HebâkeäMeve nw, pees
cee$ee keâe Skeâ ceehe mhesme o#elee Ùee mhesme peefšuelee keânueelee nw~ [eÙeveeefcekeâ cesceesjer keâe DeeJebšve keâjlee nw~ Ùen kesâJeue cesceesjer keâe
39. (b) DeeJebšve keâjlee nw, uesefkeâve keâesF& keâebmš^keäšj keâe@ue veneR keâjlee nw Deewj
keäÙet Skeâ efueefveÙej [sše mš^keäÛej nw peneB henues SefueceWš keâes Skeâ Úesj Ùen Skeâ Void hJee@Fbšj ueewšelee nw efpemes Deehe efkeâmeer Yeer [sše šeFhe
mes Fvmeš& efkeâÙee peelee nw Fmes efjÙej (Rear) keânles nw leLee efpemes otmejs ceW šeFhekeâemš keâj mekeâles nQ~
Úesj hej nšeÙee (delete) peelee nw Gmes øebâš (Front) keânles nw~ 46. (c)
40. (a) keâes[ pees Øees«eece kesâ DemeeceevÙe meceeheve keâer Deesj ues peelee nw Gmes š^eF&
keäÙet ceW Deb[jheäuees keâer efmLeefle keâes mener {bie mes peeBÛeves kesâ efueS front yuee@keâ kesâ lenle efueKee peevee ÛeeefnS~
= –1 keâe GheÙeesie keâjles nw~ 47. (d)
41. (d) Dee@ypeskeäš DeesefjSbšs[ Øees«eeefcebie kesâ cegKÙe mlebYe-
peye nce efkeâmeer Ssmes JewefjSyeue kesâ ceeve keâes Skeämesme keâjles nw pees Inheritance
Abstraction
ef[heâeFve veneR efkeâÙee ieÙee nes lees keâcheeFue šeFce Sjj Deeleer nw Ùee
Encapsulation and
peye Deehe efmebšwkeäme keâes mener Øekeâej mes veneR efueKeles nw~ keâcheeFue
Polymorphism
šeFce Sjj kegâÚ Ssmee Fbefiele keâjleer nw efpemes keâes[ keâcheeFue keâjves mes 48. (a)
henues "erkeâ keâjvee ÛeeefnS Lee~ Fve meYeer Sjj keâe helee keâcheeFuej Éeje C++ ceW, keäueeme keâerJe[& keâe GheÙeesie keâjkesâ Deewj Skeâ Megæ JeÛeg&Deue
ueieeÙee peelee nw Deewj Fme Øekeâej FvnW keâcheeFue-šeFce Sjj kesâ ™he ceW (Pure virtual) HebâkeäMeve Ieesef<ele keâjkesâ Skeâ Decetle& Jeie& (abstract
peevee peelee nw~ class) yevee mekeâles nQ~ Skeâ Megæ JeÛeg&Deue HebâkeäMeve JeÛeg&Deue keâerJe[&
42. (a) keâe GheÙeesie keâjkesâ Ieesef<ele efkeâÙee peelee nw Deewj Decetle& Jeie& ceW Fmekeâe
mscorlib.dll and system.dll Fme Demescyeueer ceW .NET keâe@ceve keâesF& FchueerceWšsMeve veneR neslee nw~
Skeämeshmeve (DeheJeeo) šeFhme, [sše šeFhme Deewj DevÙe cetueYetle efyeefu[bie 49. (c)
yuee@keäme Deeefo keâe keâesj mesš (core set) Meeefceue neslee nw~ keâchÙetšj Øees«eece ceW, keâchÙetšj keâer Yee<ee ceW efueefKele Suieesejf Lece nesles nw~
system.Data.dll: FmeceW 90 meJe&j [sše Øeoelee (server data 50. (b)
provider) kesâ meeLe ADO.NET kesâ efueS [sše kebâšsvej keäueemesme C++ ceW, Class kesâ meYeer members (Ùeeveer keâer [sše ceWyeme& Deewj
Meeefceue neslee nQ~ HebâkeäMeve ceWyeme&) private nesles nw~
System.web.dll: Core ASP.NET Classes Meeefceue nw efpemeceW 51. (c)
Jesye heâece& yeveeves jepÙe keâe ØeyebOeve keâjves megj#ee mebYeeueves FlÙeeefo nw~ DemeWyeuej Skeâ Øees«eece nw pees DemeWyeueer ueQiJespe keâes ceMeerve ceW heefjJeefle&le
System.Configuration.dll: keâmšce mesefšbie meefnle web keâjlee nw~ Ùen DemeWyeueer keâes[ mes cetue keâceeb[ Deewj Dee@hejsMeve ueslee nw
configration heâeFue ceW keâe@efvheâiejsMeve peevekeâejer keâes Read/write Deewj GvnW yeeFvejer keâes[ ceW heefjJeefle&le keâjlee nw efpemes Øeesmesmej Éeje
keâjves kesâ efueS keäueemesme Meeefceue nw~ henÛeevee pee mekeâlee nw~
43. (d) 52. (a)
ID mesueskeäšj efkeâmeer efJeefMe° Sefuecesvš keâes mesueskeäš keâjves kesâ efueS (1) ScÙeguesšme& (Emulators)– Skeâ efmemšce Éeje otmejs efmemšce
HTML Sefuecesvš keâer ID Sš^eryÙetš keâe GheÙeesie keâjlee nw~ efkeâmeer hespe kesâ vekeâue keâjves kesâ efueS yevee Øees«eece
kesâ Yeerlej efkeâmeer Sefuecesvš keâer ID Ùetveerkeâ nesleer nw, FmeefueS ID (2) efmecÙeguesšme& (Simulators)– keâchÙetšj iescme keâes ef›eâÙeeefvJele
mesueskeäšj keâe GheÙeesie DeeF&[er mesueskeäšj keâe GheÙeesie Skeâ efJeefMe° keâjves Jeeuee Øees«eece
DeeF&[er Jeeues Sefuecesvš keâes mesueskeäš keâjves kesâ efueS Sefuecesvš keâer (3) FJewuÙegSšme& (Evaluators)– keâchÙetšj kesâ #ecelee ØeoMe&ve
DeeF&[er kesâ yeeo Skeâ nwMe (#) kewâjskeäšj efueKeW~ keâes ceeheves nsleg~
221 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
 (4) heerÊ meerÊ yeerÊ– efØebšs[ meefke&âš yees[& (Printed Circuit Ùetpej keâes Fmekeâe helee veneR Ûeuelee~ S[JesÙej Skeâ mee@HeäšJesÙej
Board) pees keâchÙetšj ceW ØeJeen heLe (Pathway) yeveelee nw~ ShueerkesâMeve nw pees efkeâ Øees«eece kesâ Ûeueles meceÙe S[Ješ&šeFpe ef[mhues
53. (a) keâjles nQ~ Ùes hee@he-Dehe cesvÙet kesâ Éeje Ss[ ØeoefMe&le keâjlee nw~
ieefleefJeefOe DeejsKe (Activity diagram) cetue ™he mes Skeâ ieefleefJeefOe 62. (b)
mes otmejer ieefleefJeefOe ceW ØeJeen keâe ØeefleefveefOelJe keâjves kesâ efueS Skeâ heäuees efJe%eeheve GheueyOe keâjeves Jeeuee mee@HeäšJesÙej hewkesâpe S[JesÙej
Ûeeš& nw~ ieefleefJeefOe keâes efmemšce kesâ mebÛeeueve kesâ ™he ceW JeefCe&le efkeâÙee (Adware) keânueelee nw~
pee mekeâlee nw~ Skeâ ef›eâÙee (action) Skeâ ieefleefJeefOe ceW keâeÙe&#ecelee keâer 63. (a)
RTL keâe hetCe& ™he ‘jve šeFce ueeFyeÇsjer’ nw ‘‘ceeF›eâesmee@heäš jve-šeFce
Skeâ Demelele FkeâeF& keâe ØeefleefveefOelJe keâjleer nw~ pees DevÙe ieefleefJeefOe
vees[dme mes efveÙeb$eCe Deewj [sše ØeJeen keâes efveefo&° keâjleer nw~ ieefleefJeefOe ceW ueeFyeÇsjer ceeF›eâesmee@heäš efJeb[espe Deehejsefšbie efmemšce kesâ efueS, ™efšve
Øeoeve keâjlee nw~’’
ef›eâÙeeSb leye Meg® nesleer nw peye meYeer Fvehegš Melex hetjer nesleer nQ~
64. (b)
54. (c) keâcheeFuej Skeâ Ssmee Øees«eece neslee nw pees neF& uesJeue ueQiJesue ceW efueKes
Ssmeer Øeef›eâÙee efpemeceW keâchÙetšj Éeje, Gmekeâer #ecelee kesâ Devegmeej JeebefÚle ieÙes keâes[ keâes ceMeerve uesJeue ueQiJespe ceW yeouelee nw~
keâeÙe& keâjeves nsleg Skeâ efveefMÛele lekeâveerkeâ Je ›eâce ceW efveoxMe efoÙes peeles 65. (d)
nQ, leeefkeâ keâchÙetšj Éeje Fve efveoxMeeW keâe Devegheeueve keâjekeâj JeebefÚle GNU Deehejsefšbie efmemšce Skeâ Deeshesve meesme& meeheäšJesÙej nw~ Fmekeâer
keâeÙe& mebheVe efkeâÙee pee mekesâ, keâchÙetšj Øees«eeefcebie keânueeleer nw~ Meg™Deele 1983 ceW efjÛe[& mšeuecewve ves keâer Leer~ Fmekeâe hetje veece
55. (d) GNU's Not UNIX nw~ Ùen veece UNIX mes efYeVelee efoKeeves kesâ
efkeâmeer Yeer Yee<ee ceW efveÙeb$eCe mebjÛeveeSB (control structure) leerve ueS jKee ieÙee nw~ Fmekeâe efJekeâeme GNU Project kesâ Debleie&le keâer
ef
Øekeâej keâer nesleer nw– ieF& nw~ Ùen meYeer Ùetpeme& kesâ efueS øeâer GheueyOe nw~ Ùen UNIX kesâ
Deveg›eâefcekeâ– ef[heâe@uš cees[ meceeve nw leLee UNIX kesâ meeLe keâe@chewefšyeue Yeer nw~ Fme Øekeâej mes
ÛeÙeve Ùee kebâ[erMeveue– efveCe&ÙeeW Deewj MeeKeeDeeW ceW yebšves kesâ efueS efJekeâuhe (d) ieuele nw~
66. (d)
GheÙeesie efkeâÙee peelee nw~ keâchÙetšj ceW efmemšce HeâeFue keâes cesceesjer jwce (Random Access
oesnjeJe – uetefhebie kesâ efueS GheÙeesie efkeâÙee peelee nw~ Memory) ceW mLeeveebleefjle keâjves keâer Øeef›eâÙee keâes yegefšbie (Booting)
56. (b) keâne peelee nw
efm›eâefhšbie uewiJeWpe, Jes uewiJeWpe nQ pees mece=æ Ùetpej FbšjHesâme megefJeOeeDeeW 67. (b)
kesâ meeLe mejue nQ uesefkeâve peeJee kesâ meceeve megj#ee Øeoeve keâjleer nw~ keâvexue henuee Øees«eece nw pees Dee@hejsefšbie efmemšce (OS) uees[ nesves hej
57. (b) cesceesjer ceW uees[ neslee nw Deewj meeLe ner Ùen OS Ûeueves lekeâ cesceesjer ceW
yeeFvejer meÛe& š^er mes efkeâmeer vees[ kesâ jeGš meyeš^er ceW Ssmes Sefuecesvš nesles jnlee nw~ keâvexue OS keâe cegKÙe Yeeie nw pees mebmeeOeveeW kesâ ØeyebOeve kesâ
nw pees Gme vees[ kesâ ceeve mes DeefOekeâ nesles nw~ efueS efpeccesoej nw, keâF& Øeef›eâÙeeDeeW keâes mebmeeOeveeW keâe GheÙeesie keâjves
58. (c) Deewj efJeefYeVe Øeef›eâÙeeDeeW keâes mesJeeSB Øeoeve keâjves keâer Devegceefle oslee nw~
XML keâes [sše mšesj Deewj š^ebmeheesš& keâjves kesâ efueS ef[peeFve efkeâÙee ieÙee~ keâvexue cee@[Ÿetue keâes jve-šeFce (Ùeeveer henues mes Ûeue jns OS) ceW uees[
XML Skeâ ceeke&âDehe ueQiJespe nw pees [e@keäÙetceWš keâes Ssmes Heâe@cexš ceW Svkeâes[ Deewj Deveuees[ efkeâÙee pee mekeâlee nw~
keâjves kesâ efueS efveÙece heefjYeeef<ele keâjleer nw pees ceeveJe hee"veerÙe Deewj ceMeerve 68. (c)
peye Ùetpej Deheves keâchÙetšj efmemšce ceW kegâÚ SefhuekesâMevme Fbmše@ue
hee"veerÙe oesveeW nes~ Fmes [sše keâes mšesj Deewj Ùen š^ebmeheesš& keâjves kesâ efueS
keâjlee nw Ùee yeÌ[er mebKÙee ceW HeâeFueW nšelee (Delete) nw lees Fmes
ef[peeFve efkeâÙee ieÙee nw Deewj Ùen [e@keäÙetceWš kesâ Yeerlej lelJeeW keâes heefjYeeef<ele ef[mkeâ øesâiceWšsMeve keânles nQ~ Fmeer kesâ keâejCe HeâeFueW ef[mkeâ kesâ efJeefYevve
keâjves kesâ efueS šwie keâe GheÙeesie keâjlee nw~ YeeieeW ceW efyeKej peeleer nw Deewj keâF& šgkeâÌ[eW (Parts) ceW yeBš peeleer nw~
59. (d) efpememes cesceesjer kesâ kegâÚ mhesme (Space) DevegheÙeesieer
veesšhew[ šskeämš S[eršj kesâ ™he ceW GheÙeesie efkeâÙee peelee nw~ peyeefkeâ (Unused/unutilized) nes peeleer nw~ Fme mecemÙee mes yeÛeves nsleg
SbšerJeeÙejme, ef[mkeâ ef[øesâicesšsšj leLee heâeFue ØeyebOekeâ GheÙeeseif elee Ùetpej ef[mkeâ [erøesâiceWšsMeve keâe GheÙeesie keâjlee nw pees ef[mkeâ hej HeâeFueeW
(Utility) mee@heäšJesÙej nw~ keâes meefvveefnle mLeeveeW hej hegveJÙe&JeefmLele (Rearrange) keâjves ceW ceoo
60. (a) keâjlee nw Deewj ef[mkeâ kesâ DevegheÙeesieer mhesme keâes yeÛeekeâj ef[mkeâ kesâ
Microsoft Access Skeâ DBMS mee@heäšJesÙej nw~ DBMS kesâ kegâÚ ØeoMe&ve ceW megOeej keâjlee nw~
Deewj GoenjCe- Mq SDL, PostqreSQL, SQL Server Deeefo~ 69. (c)
61. (a) Dee@hejsefšbie efmemšce Skeâ efmemšce mee@heäšJesÙej nw pees keâchÙetšj ne[&JesÙej
mheeFJesÙej ceeueJesÙej keâe Skeâ Øekeâej nw pees keâchÙetšj hej Deewj mee@heäšJesÙej mebmeeOeveeW keâes cewvespe keâjlee nw~
GheÙeesiekeâlee&DeeW kesâ menceefle kesâ efyevee Fbmše@ue efkeâÙee peelee nw Deewj Dee@hejsefšbie efmemšce kesâ cegKÙe keâeÙe&:
Gvekesâ yeejs ceW metÛeveeSB Skeâ$e keâjlee nw~ mheeFJesÙej keâer GheefmLeefle Øeesmesme cewvespeceWš, cesceesjer cewvespeceWš, ef[JeeFme cewvespeceWš, heâeFue
Deeceleewj hej Ùetpej mes efÚheer jnleer nw~ JeeÙejme Skeâ keâchÙetšj Øees«eece nw cewvespeceWš, efmekeäÙeesefjšer, Ùetpej Fbšjhesâme, vesšJeefkeËâie pee@ye Mes[Ÿetefuebie
pees Deheveer Devegefueefhe (Execute) keâj mekeâlee nw Deewj GheÙeesiekeâlee& keâer Deeefo keâeÙe& keâjlee nw, peyeefkeâ keâcheeFuej GÛÛe mlejerÙe Yee<ee ceW efueKes
Devegceefle kesâ efyevee Skeâ keâchÙetšj keâes meb›eâefcele keâj mekeâlee nw Deewj keâes[ keâes ceMeerve Yee<ee ceW Skeâ yeej ceW ner efve<heeefole keâj oslee nw~
222 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
70. (b) 80. (d)
kebâhewkeäMeve (Compaction) keâe GheÙeesie Øeef›eâÙeeDeeW keâes mLeeveevleefjle keâchÙetšj Meš [eGve keâjves mes meerheerÙet leLee cee@veeršj mes mecyeefvOele
keâjves kesâ efueS efkeâÙee peelee nw leeefkeâ Jes meefVeefnle neW, Deewj meYeer cegòeâ meYeer ef[JeeFmeW yevo nes peeleer nw leLee hee@Jej mehueeF& mLeefiele nes peeleer
cesceesjer Skeâ yuee@keâ ceW neW~ Ùen GheÙeesie efkeâS peeves Jeeues cesceesjer Keb[eW nw~ efpememes efyepeueer keâer vÙetvelece Kehele nesleer nw peyeefkeâ mueerhe leLee
keâe Skeâ meeLe jKeves kesâ efueS cesceesjer ceW efjòeâ mLeeve keâes keâce keâjlee nw~ neFyejvesš Deeefo cebs meYeer ef[JeeFmeW yevo vener nesleer~
Ùen cesceesjer ØeyebOeve keâe cenlJehetCe& efnmmee neslee nw pees cesceesjer kesâ mener 81. (c)
GheÙeesie Deewj ØeoMe&ve keâes megefveef§ele keâjves ceW ceoo keâjlee nw~ ceojyees[& (Mother Board) mebhetCe& kebâhÙetšj efmemšce keâe mebÛeej
71. (c) efveÙebef$ele keâjlee nw~ Ùen hueeefmškeâ keâe yevee heermeeryeer (PCB-Printed
[eryeefiebie - keâchÙetšj mee@HeäšJesÙej ceW mes $egefšÙeeW keâes nševee~ Circuit Board) neslee nw~ Ùen keâchÙetšj keâe cegKÙe hešue (Main
keâcheeFefuebie - GÛÛe Yee<ee kesâ Øees«eece keâes efvecve Yee<ee (ceMeerveer Board) neslee nw~
Yee<ee) ceW yeouevee~ 82. (b)
š^ebmeuesefšbie - Skeâ Yee<ee kesâ Øees«eece keâes otmejer Yee<ee kesâ Øees«eece ceW BIOS keâe mebef#ehle veece Basic Input Output System nw~ Ùen
yeouevee~ Skeâ Øees«eece nw pees ROM mes leye efve<heeefole neslee nw~ peye keâchÙetšj
FbšjØesefšbie - Øees«eece keâes Skeâ-Skeâ ueeFve heÌ{vee leLee $egefš Øeehle keâes Ûeeuet efkeâÙee peelee nw~
keâjvee~ 83. (c)
72. (b) [sše keâer ØeJeen ceW Devlej keâer YejheeF& kesâ efueS GheÙeesie keâer peeves Jeeueer
Shuesš Skeâ peeJee Øees«eece nw efpemes Jesye hespe ceW Scyes[ efkeâÙee pee mšesjspe ef[JeeFme keâes yeHeâj keâne peelee nw~ Fmekeâe GheÙeesie [sše ØeJeen
mekeâlee nw~ Ùen Jesye yeÇeG]pej kesâ Devoj Ûeuelee nw Deewj keäueeFbš meeF[ keâes mLeeveebleefjle keâjves kesâ efueS efkeâÙee peelee nw, efpememes [sše ØeJeen ceW
hej keâece keâjlee nw~ Applets Ùee Object šwie keâe GheÙeesie keâjkesâ Devlej keâes efveJeeefjle efkeâÙee pee mekeâlee nw Deewj megÛee™ ™he mes Øeesmesefmebie
Skeâ HTML hespe ceW Skeâ Shuesš Scyes[ efkeâÙee peelee nw Deewj Jesye efkeâÙee pee mekeâlee nw~
meJe&j hej nesmš efkeâÙee peelee nw~ 84. (c)
73. (b) Kernel Skeâ keâchÙetšj mee@heäšJesÙej nw pees efkeâ OS (DeesSme) keâe Skeâ
Dee@hejsefšbie efmemšce keâchÙetšj ne[&JesÙej hej ÛeuevesJeeuee Skeâ mee@HeäšJesÙej cenòJehetCe& Yeeie neslee nw~ Ùen keâchÙetšj kesâ mee@heäšJesÙej Deewj ne[&JesÙej
nw pees otmejs mee@HeäšJesÙej keâes Ûeueeves kesâ efueS HeäuesšHeâece& keâe keâece kesâ yeerÛe bmebÛeej keâe keâeÙe& keâjlee nw~ keâvexue Skeâ keâesj keâe@cheesveWš neslee
keâjlee nw~ nw Deewj Fmekeâe hetjs efmemšce hej keâCš^esue neslee nQ~ keâvexue (kernel)
74. (c) cegKÙe ™he mes leerve Øekeâej kesâ nesles nQ -
mee@HeäšJesÙej efJekeâeme ceW meeceevÙele: efHeâefpekeâue efjkeäJeejcesvš keâer (i) Monolithic kernel
DeeJeMÙekeâlee veneR nesleer nw~ keäÙeeWefkeâ Ùes pÙeeoe lej ne[&JesÙej Ùee (ii) Micro kernel
Fbøeâemš^keäÛej mes mecyeefvOele nesleer nw~ (iii) Hybrid kernel
75. (c) 85. (c)
DeeOegefvekeâ eEØešj keâer ieefle keâes ceeheves kesâ efueS he=‰ Øeefle efceveš JeeF& HeâeF& – cee@[sce
(Page per minute – PPM) FkeâeF& keâe ØeÙeesie efkeâÙee peelee nw~ ›eâesce – kesâyeue
76. (a) HeâeFue – ne[& [^eFJe
kebâhÙetšj keâer yees[& ceW efMeheäš Deewj efhebÇš m›eâerve keâerpe keâes mhesMeue hehe&me ÛeeefpeËie – kesâyeue
keâerpe keâne peelee nw~ Ghejesòeâ Ùegice ceW ›eâesce DevÙe meYeer Ùegice mes efYeVe nw keäÙetbefkeâ ›eâesce Skeâ
77. (d) Jesye yeÇeGpej neslee nw~ kesâyeue mes Gmekeâe keâesF& cesue veneR nw~
›esâ-2, ›esâ SkeämeSceheer-24 SJeb efleDeevns-2 meghej keâchÙetšj kesâ GoenjCe nw~ 86. (c)
78. (a) kebâhÙetšj ceW meyemes Úesšer Deewj meyemes lespe cesceesjer pees cesve cesceesjer keâe
Analytical Engine (efJeMues<eCeelcekeâ Fbpeve) keâes henuee keâchÙetšj Yeeie veneR nesleer nw, jefpemšj cesceesjer keânueeleer nw~ SkeäÙegceguesšj jefpemšj
ceevee peelee nw, efpemes 19JeeR Meleeyoer ceW efyeÇefšMe DeeefJe<keâejkeâ Ûeeume& keâe GheÙeesie, [sše Deewj ALU Éeje GlheVe efkeâS ieS ceOÙeJeleea
yewyespe Éeje ef[peeFve efkeâÙee ieÙee Lee~ Fmekesâ ef[peeFve ceW Skeâ SSueÙet heefjCeeceeW (Intermediate results) keâes mšesj keâjves kesâ efueS efkeâÙee
(DeefjLecesefškeâ uee@efpekeâ Ùetefveš) Deewj yegefveÙeeoer Øees«eeceWefškeâ ØeJeen peelee nw~
efveÙeb$eCe keâe ØeÙeesie efkeâÙee ieÙee Lee~ Fmes hebÛe keâe[ex keâe GheÙeesie keâjkesâ meer.heer.Ùet. ceW GheÙeesie nesves Jeeues jefpemšj– SkeäÙegceguesšj, [eše
Øees«eece efkeâÙee ieÙee Lee~ jefpemšj, S[^sme jefpemšj, Øees«eece keâeGbšj, cesceesjer [eše jefpemšj,
79. (a) Fb[skeäme jefpemšj, cesceesjer yeheâj jefpemšj, Fbmš^keäMeve jefpemšj~
Fueskeäš^e@efvekeâ ef[ues mšesjspe Dee@šescewefškeâ kewâuekegâuesšj (EDSAC) keâes 87. (c)
kewâefcyeÇpe ÙetefveJeefme&šer ieefCeleerÙe ØeÙeesieMeeuee ceW yeveeÙee ieÙee Lee~ efkeâmeer ef[JeeFme ceW cesceesjer (RAM Ùee ROM) keâer cee$ee keâes cegKÙele:
EDSAC henuee JÙeeJeneefjkeâ pevejue hehe&pe mšesj Øees«eece Fueskeäš^e@efvekeâ ieerieeyeeFš (GB) Ùee cesieeyeeFš (MB) ceW ceehee peelee nw~ Dele:
keâchÙetšj Lee~ Fmekeâe Gòej efJekeâuhe (c) Sce.yeer. nesiee~
223 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
88. (b) 95. (d)
Fme efmemšce keâer Yeeweflekeâ cesceesjer 8GBnw Deewj JeÛeg&Deue cesceesjer 16GB yetueerÙe JÙebpekeâ (A.B) kesâ meceleguÙe JÙebpekeâ keâes Keespeves kesâ efueS De
nw~ Ùeefo efmemšce 6GB Yeeweflekeâ cesceesjer Deewj 10GB JeÛeg&Deue cesceesjer Morgan's Theorem keâe GheÙeesie keâjles nw~ De Morgan kesâ
keâe GheÙeesie keâj jne nw, lees mJewhe keâer ieF& cesceesjer keâer cee$ee keâe helee Devegmeej (A.B) = A'+B'
ueieeves kesâ efueS nceW FmeefueS (A.B) keâe mener meceleguÙe efJekeâuhe (d) A'+B' nQ~
JeÛeg&Deue cesceesjer keâe GheÙeesie – Yeeweflekeâ cesceesjer keâe GheÙeesie 96. (c)
= 10GB – 6GB = 4GB oes ceeve Jeeues yetefueÙeve DeuepesyeÇe ces, Ùeefo n yesefjSyeume nw, lees
Fme Øekeâej mJewhe keâer ieF& cesceesjer 4GB nw~
DeefOekeâlece yetefueÙeve HebâkeäMeve keâer mebKÙee 2 nesleer nw~
n
2

89. (d)
ÙeneB n = 2 nw, FmeefueS DeefOekeâlece yetefueÙeve HebâkeäMeve keâer mebKÙee nesieer–
DMA keâe hetCe& ™he ‘[eÙejskeäš cesceesjer Skeämesme’ nw~ DMA keâchÙetšj 2

keâer jwce mes meer.heer.Ùet. keâe GheÙeesie efyevee keâjW Øeesmesefmebie keâjkesâ keâchÙetšj 2
2
= 24 = 16
kesâ otmejs Yeeie ceW [sše keâe š^evmeheâj keâj oslee nw~ Dele: oes ceeve Jeeues yetefueÙeve DeuepesyeÇe ceW 2 yesefjSyeume kesâ efueS
90. (d) DeefOekeâlece yetefueÙeve HebâkeäMeve keâer mebKÙee 16 nesieer~
EPROM, ØeeFcejer cesceesjer kesâ Devleie&le Deeves Jeeues mLeeF& cesceesjer 97. (b)
(ROM) keâe Skeâ Øekeâej nw~ Fmes jwC[ceueer Skeämesme efkeâÙee pee mekeâlee XOR uee@efpekeâ iesš Fvehegš cetuÙeeW kesâ efYeVe nesves hej DeeGšhegš 1 oslee
nw~ Fmes veeve-JeesueešeFue cesceesjer Yeer keânles nQ~ FmeceW hejeyewieveer efkeâjCeeW nw~ oes Fvehegš A leLee B kesâ efueS XOR keâe DeeGšhegš
keâer meneÙelee mes hegjeves Øees«eece keâes veÙes Øees«eece mes efjhuesme efkeâÙee pee Y A B A B
mekeâlee nw, peyeefkeâ efÉleerÙekeâ cesceesjer ›eâceevegmeej cesceesjer nw, efpemekeâe
GoenjCe cewivesefškeâ šshe nw~
91. (a)
Sme[erDeejSSce (SDRAM) keâes efmeb›eâesveme [erjwce kesâ ™he ceW peevee peelee
nw, pees meeceevÙe [erjwce (DRAM) Deewj F&[erDees (EDO) jwce mes lespe nw,
pees Oeerjs-Oeerjs heermeer keâe ceevekeâ cesceesjer keâe@efvh] eâiejsMeve yeve ieÙee nw~
SmeDeejSSce (SRAM) keâe DeLe& mšwefškeâ jQ[ce Skeämesme cesceesjer nw~ Fmes
Fuesefkeäš^keâ Ûeepe& mes efjøesâMe keâjves keâer pe®jle veneR nw~ Ùen [erjwce mes lespe nw
keäÙeeWefkeâ meer.heer.Ùet. keâes SmeDeejSSce mes [sše Skeämesme keâjves kesâ efueS Fblepeej 98. (a)
veneR keâjvee heÌ[lee nw~ Dele: efoS ieS keâLeve ceW (i) melÙe nw leLee (ii) Ex-OR HebâkeäMeve Øeehle keâjves kesâ efueÙes vÙetvelece 4 NAND iesš keâer
DemelÙe nw~ DeeJeMÙekeâlee nesleer nw~ NAND leLee NOR iesš ÙetefveJeme&ue efyeefu[bie
92. (a) yueekeâ keânueeles nQ keäÙeeWefkeâ Ùes efkeâmeer Yeer Øekeâej kesâ keâchÙetšj HebâkeäMeve
jefpemšj cesceesjer keâchÙetšj efmemšce keâe meyemes lespe Deewj SkeämehesefvMeJe (Logic gate) kesâ efvecee&Ce ceW me#ece nQ~
cesceesjer nw~ Fmekeâer [sše mšesjspe #ecelee keâce nesleer nw~ 99. (b)
93. (b) uee@efpekeâ iesš ceW meceeve Fvehegš kesâ efueS X-NOR iesš GÛÛe DeeGšhegš
efJeefYeVe GhekeâjCeeW ceW, [sše š^^ebmeheâj ieefle ceW Devlej keâes otj keâjves kesâ Øeoeve keâjlee nw~
efueS Buffer registers keâe GheÙeesie efkeâÙee peelee nw~ Ùen efkeâmeer
kebâhÙetšj Ùee ceeF›eâesØeesmesmej efmemšce ceW [sše keâes DemLeeÙeer ™he mes mšesj
keâjves Deewj Øeesmesefmebie kesâ oewjeve Fmekeâes DeÛÚer lejn mes ØeyebefOele keâjves
kesâ efueS ØeÙeesie efkeâÙee peelee nw~
94. (c)
A B O u tp u t
K-map ceW Skeâ Quad iegCeveheâue keâes oMee&lee nw~ 0 0 1
0 1 0
1 0 0
1 1 1

100. (a)
MOS (Metal Oxide Semiconductor) uee@efpekeâ heefjJeej Deheves
mebÛeeueve kesâ efueS MOSFET ef[JeeFme keâe GheÙeesie keâjlee nw~
NAND Deewj NOR yesefmekeâ iesš nQ pees DeefOekeâebMe ef[efpešue meefke&âš
kesâ efvecee&Ce ceW ØeÙeesie nesles nw~
224 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
 PRACTICE SET - 9
1. What is an auto-associative network? 5. Which of the following is not an IoT platform?
Dee@šes-SmeesefmeSefšJe vesšJeke&â keäÙee nw? efvecveefueefKele ceW mes keâewve-mee IoT huesšHeâe@ce& veneR nw?
(a) A neural network that contains no loops (a) Amazon Web Services
Skeâ lebef$ekeâe vesšJeke&â efpemeceW keâesF& uethe veneR nw~ (b) Microsoft Azure
(b) A neural network that contains feedback (c) Flipkart
Skeâ lebef$ekeâe vesšJeke&â efpemeceW heâer[yewkeâ neslee nw~ (d) More than one of the above
(c) A neutral network that has only one loop 6. What is the purpose of using WoT (Web of
Things) in IoT?
Skeâ lešmLe vesšJeke&â efpemeceW kesâJeue Skeâ uethe neslee nw~
IoT ceW WoT (Jesye Dee@heâ efLebime) keâe GheÙeesie keâjves keâe
(d) A single layer feed-forward neural network
with pre-processing/Skeâ efmebieue uesÙej heâer[-heâejJe[&
GösMÙe keäÙee nw?
vÙetjue vesšJeke&â hetJe& ØemebmkeâjCe kesâ meeLe (a) To increase the cost/ ueeiele yeÌ{evee
2. In artificial intelligence, which among the (b) To increase usability and interoperability
following agents describes high quality ØeÙeespÙelee (usability) Deewj DeblejØeÛeeueveerÙelee
behaviour (degree of happiness)
(interoperability) keâes yeÌ{evee
Deeefš&efheâefMeÙeue FbšsefuepeWme ceW efvecve ceW mes keâewve-mee SpeWš
GÛÛe iegCeJeòee keâe JeCe&ve keâjlee nw? (c) To increase the security/ megj#ee yeÌ{evee
(d) To reduce the complexity of application
(a) goal-based agents/ue#Ùe-DeeOeeefjle SpeWšdme
SefhuekesâMeve keâer peefšuelee keâes keâce keâjvee
(b) simple reflex agents/efmebheue efjheäueskeäme SpeWšdme
7. The robotic process automation (RPA), also
(c) utility-based agents/Ùetefšefuešer DeeOeeefjle SpeWšdme known as _______, uses automation
(d) agents that keep track of the world technologies to mimic back-office tasks of
SpeWš pees ogefveÙee keâe š^wkeâ jKeles nQ human employees, such as extracting data,
3. With reference to variables scope in Arduino, filling in forms and moving files.
which of the following statements is/are jesyeesefškeâ Øeesmesme Dee@šescesMeve (RPA), efpemes _______
correct? Yeer keâne peelee nw, efpemeceW ceeveJe keâceÛeeefjÙeeW (human
Deeef[&vees (Arduino) ceW JewefjSyeue mkeâeshe kesâ meboYe& ceW employee) kesâ [sše Skeämeš^skeäš keâjves, Heâe@ce& Yejves Deewj
efvecveefueefKele ceW mes keâewve mee/mes keâLeve mener nw/nQ? HeâeFueeW keâes mLeeveebleefjle keâjves pewmes yewkeâ-Dee@efHeâme keâeÙeeX
A. Variables that are declared inside a function keâe DevegkeâjCe keâjves kesâ efueS Dee@šescesMeve šskeäveesuee@peer keâe
or block are local variables./JewefjSyeume pees GheÙeesie neslee nw~
efkeâmeer hebâkeäMeve Ùee yuee@keâ kesâ Devoj Ieesef<ele efkeâS (a) hardware robotics/ne[&JesÙej jesyeeseš f keäme
peeles nQ ueeskeâue JewefjSyeue nesles nQ~ (b) software robotics/mee@HeäšJesÙej jesyeesefškeäme
B. Variables that are declared outside of all
(c) shareware/MesÙejJesÙej
functions are global variables.
meYeer hebâkeäMeve kesâ yeenj Ieesef<ele JewefjSyeue iueesyeue (d) firmware/Heâce&JesÙej
JewefjSyeue nesles nQ~ 8. A device that when exposed to a physical
phenomenon such as temperature,
(a) Both A and B/A Deewj B oesveeW displacement, force, etc., produces a
(b) Only A/kesâJeue A proportional output signal is/are called:
(c) Only B/kesâJeue B _________ Jen ef[JeeFme nw, pees leeheceeve efJemLeeheve,
(d) Neither A nor B/ve lees A Deewj ve ner B yeue FlÙeeefo pewmeer Yeeweflekeâ Iešvee kesâ mebheke&â ceW Deeves hej
4. In IoT, a/an _____ is a device that converts Deevegheeeflekeâ DeeGšhegš efmeiveue (proportional output
energy into motion. signal) GlheVe keâjlee nw~
IoT ceW, ______ Skeâ ef[JeeFme nw pees Tpee& keâes ieefle ceW (a) timers/šeFcej
heefjJeefle&le keâjleer nw~ (b) memory/cesceesjer
(a) router/jeGšj (b) gateway/iesšJes (c) actuator/SkeäÛegSšj
(c) actuator/SkeäÛegSšj (d) sensor/meWmej (d) sensors/meWmej
225 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
9. Which machine learning model is most 14. Which of the following is an example of a B2C
effective for natural language processing tasks E-Commerce website?/efvecveefueefKele ceW mes keâewve
in sentiment analysis of digital financial B2C F&-keâe@ceme& JesyemeeFš keâe GoenjCe nw?
reviews?
ef[efpešue efJeòeerÙe meceer#eeDeeW kesâ YeeJe efJeMues<eCe ceW (a) Alibaba/Deueeryeeyee
Øeeke=âeflekeâ Yee<ee ØemebmkeâjCe keâeÙeeX kesâ efueS keâewve-mee (b) Amazon/Deces]peve
ceMeerve ueefveËie cee@[ue meyemes ØeYeeJeer nw? (c) Google/ietieue
(a) Decision Trees/efveCe&Ùe Je=#e (d) More than one of the above/GheÙeg&òeâ ceW mes Skeâ mes
(b) K-Nearest Neighbours (KNN) DeefOekeâ
K-efvekeâšlece heÌ[esmeer (KNN) 15. Which of the following statements about Bcc in
(c) Naïve Bayes/veeFJe yesÙeme e-mail is false?/F&-cesue ceW Bcc kesâ yeejs ceW
(d) LSTM (Long Short-Term Memory) efvecveefueefKele ceW mes keâewve-mee keâLeve DemelÙe nw?
LSTM (uee@vie Mee@š&-šce& cesceesjer) vesšJeke&â (a) The address entered in the Bcc field can be
10. In an HTML page, the <a> tag difines a forwarded./Bcc heâeru[ ceW [eues ieS S[^sme keâes
hyperlink, and its ________attribute specifies heâe@jJe[& efkeâÙee pee mekeâlee nw~
the URL of the page the link goes to. (b) When you enter e-mail addresses in the Bcc
Skeâ HTML hespe ceW, <a> šwie neFhej efuebkeâ keâes field of a message, those addresses are not
heefjYeeef<ele keâjlee nw, Deewj Fmekeâer .............efJeMes<eleeSB visible to e-mail recipients./peye Deehe efkeâmeer mebosMe
Gme he=‰ kesâ URL keâes efveefo&° keâjleer nw efpeme hej efuebkeâ kesâ Bcc heâeru[ ceW F&-cesue S[^sme [eueles nQ, lees Jes S[^sme
peelee nw~ F&-cesue Øeehlekeâlee&DeeW keâes efoKeeF& veneR osles nQ~
(a) link (b) Href (c) For security and privacy reasons, it is best to
(c) Img (d) path use the Bcc feature when sending e-mail
11. Which image file format has lossless image files messages to a large number of people.
meaning that they do not need to compress or megj#ee Deewj ieesheveerÙelee keâejCeeW mes, yeÌ[er mebKÙee ceW ueesieeW
lose any image quality or information keâes F&-cesue mebosMe Yespeles meceÙe Bcc megefJeOee keâe GheÙeesie
(although there are options for compression), keâjvee meyemes DeÛÚe neslee nw~
allowing for very high-quality images but also
larger file sizes? (d) Recipients will receive the message, but will
efkeâme Fcespe heâeFue Øee®he ceW oes<ejefnle Fcespe heâeFueW nw, not be able to see the address listed in the Bcc
field./Øeehlekeâlee& mebosMe Øeehle keâjWies, uesefkeâve Bcc heâeru[
efpemekeâe DeLe& nw efkeâ GvnW efkeâmeer Yeer Fcespe iegCeJeòee Ùee
peevekeâejer keâes mebheerefÌ[le keâjves Ùee Keesves keâer DeeJeMÙekeâlee ceW metÛeeryeæ S[^sme veneR osKe heeSies~
veneR nw (neuee@efkeâ mebheer[ve kesâ efJekeâuhe nQ), yengle GÛÛe 16. PSTN is an example of ____ network./PSTN
iegCeJeòee Jeeueer FcespeeW kesâ efueS Devegceefle oslee nw, uesefkeâve vesšJeke&â keâe Skeâ GoenjCe ........ nw~
yeÌ[s heâeFue Deekeâej Yeer? (a) circuit switching/meefke&âš efmJeefÛebie
(a) GIF (b) JPEG (b) optical switching/Dee@efhškeâue efmJeefÛebie
(c) PNG (d) TIFF (c) asynchronous transfer mode switching/
12. Which of the following are used for combing Sefmeb›eâesveme š^ebmeheâj cees[efmJeefÛebie
different kinds of media formats and deliver (d) packet switching/hewkesâš efmJeefÛebie
them as multimedia contents? 17. Which of the following networks extends a
efvecveefueefKele ceW mes efkeâmekeâe GheÙeesie efJeefYeVe Øekeâej kesâ private network across public networks?
ceeref[Ùee Øee™heeW keâes mebÙeesefpele keâjves Deewj GvnW efvecveefueefKele ceW mes keâewve-mee vesšJeke&â meeJe&peefvekeâ
ceušerceeref[Ùee meece«eer kesâ ™he ceW efJeleefjle keâjves kesâ efueS vesšJeke&â ceW Skeâ efvepeer vesšJeke&â keâe efJemleej keâjlee nw?
efkeâÙee peelee nw? (a) virtual private network
(a) Multimedia authoring tools (b) local area network
(b) Device drivers (c) enterprise private network
(c) Scanners (d) More than one of the above
(d) Media Players 18. Which of these is NOT a switching techinques?
13. ______Fueskeäš^e@evf ekeâ mebieerle JeeÅeÙeb$eeW kesâ yeerÛe metÛevee efvecveefueefKele cebs mes keâewve Skeâ efmJeefÛebie lekeâveerkeâ veneR nw?
Øemeeefjle keâjves kesâ efueS Skeâ ØeCeeueer nw~ (a) Circuit Switching/meefke&âš efmJeefÛebie
(a) Musical Instrument Digital Interchange
(b) Data Switching/[eše efmJeefÛebie
(b) Musical Instrument Digital Interface
(c) Packet Switching/hewkesâš efmJeefÛebie
(c) Musical Instrument Digital Interaction
(d) Musical Instrument Data Interface (d) Message Switching/cesmespe efmJeefÛebie

226 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
19. In OSI network architecture, the routing is D. Access Point iv. Directs network traffic
performed by: Skeämesme hee@Fbš vesšJeke&â š^wefHeâkeâ keâes efveoxefMele
Dees.Sme.DeeF&. vesšJeke&â Dee@efke&âšskeäÛej ceW routing keâjlee nw~
DeeOeeefjle neslee nw: Options/efJekeâuhe:
(a) Network layer/vesšJeke&â uesÙej Éeje (a) A-iv, B-ii, C-iii, D-i
(b) Data link layer/[eše efuebkeâ uesÙej Éeje (b) A-iv, B-iii, C-i, D-ii
(c) Transport layer/š^ebmeheesš& uesÙej Éeje (c) A-iii, B-i, C-iv, D-ii
(d) Session layer/mesmeve uesÙej Éeje (d) A-i, B-iv, C-ii, D-iii
25. The main reason to encrypt a file is to :
20. What type of protocol is HTTP?
HTTP efkeâme Øekeâej keâe Øeesšeskeâe@ue nw?
Skeâ heâeFue keâes ketâš keâjves keâe cegKÙe keâejCe :
(a) Stateful (a) reduce its size/Gmekesâ Deekeâej keâes keâce keâjves kesâ efueS
(b) Stateless (b) secure it for transmission/Gmekesâ mebÛejCe keâes
(c) Transfer protocol megjef#ele keâjves kesâ efueS
(d) More than one of the above (c) prepare it for backup/yewkeâDehe lewÙeej keâjves kesâ efueS
21. _______ is the most important/powerful (d) include it in the startup sequence/mšeš&-Dehe ›eâce
computer in a typical network. ceW meefcceefuele keâjves kesâ efueS
_______Skeâ efJeefMe° vesšJeke&â ceW meyemes cenlJehetCe&/ 26. What is the device that converts signals of one
MeefòeâMeeueer mebieCekeâ nw kind to signals of a difference kind known as?
(a) Network client /[smkeâše@he Skeâ Øekeâej kesâ efmeiveume keâes efJeefYeVe Øekeâej kesâ efmeiveume
(b) Network client /vesšJeke&â keäueebFš
ceW heefjJeefle&le keâjves Jeeues ef[JeeFme keâes keäÙee keânles nQ?
(a) Transistor/š^ebefpemšj
(c) Network server /vesšJeke&â meJe&j
(b) Resistor/jefpemšj
(d) Network station /vesšJeke&â mšsMeve
(c) Transducer/ š^ebme[Ÿetmej
22. efvecveefueefKele ceW mes keâewve mes keâLeve mener nQ?
(d) Controller/kebâš^esuej
(i) GSM ceesyeeFue, [sše Deewj Jee@Ùeme oesveeW kesâ mebÛejCe
27. What does the term "IITTP 404 Error" signify?
(transmission) keâe meceLe&ve keâjles nQ~
"IITTP 404 $egefš (Sjj)’’ Meyo keäÙee oMee&lee nw?
(ii) CDMA ceesyeeFue ceW «eenkeâ keâer peevekeâejer ns[mesš
(a) The server is overloaded and cannot process
Ùee heâesve ceW meb«eefnle keâer peeleer nw~ the request/meJe&j DeefleYeeefjle (DeesJejuees[) nw Deewj
(a) kesâJeue (i) (b) (i) Deewj (ii) oesveeW DevegjesOe mebmeeefOele veneR keâj mekeâlee
(c) ve lees (i) Deewj ve ner (ii) (d) kesâJeue (ii) (b) The webpage is temporarily unavailable/Jesyehespe
23. What does the acronymn LAN refer to? DemLeeÙeer ™he mes DevegheueyOe nw
LAN efkeâmekeâe mebef#ehle ™he mevoefYe&le keâjlee nw? (c) The requested resource could not be found on
(a) Local Area Network/ueeskeâue SefjÙee vesšJeke&â the server/meJe&j hej DevegjesefOele mebmeeOeve veneR efceue mekeâe
(b) Least Accessible Network/ueermš SskeämesefmeJeue vesšJeke&â (d) The connection to the server is not secure/meJe&j
mes keâveskeäMeve megjef#ele veneR nw
(c) Least Area Network/ueermš SefjÙee vesšJeke&â
28. ...............is a language for the specification of
(d) Local Accessible Network/ueeskeâue SskeämesefmeJeue procedures for the retrieval (and sometimes
vesšJeke&â also modification) of information from a
24. Match the following network devices with their database./ [ešeyesme mes peevekeâejer keâes hegve: Øeehle (Deewj
purposes: keâYeer keâYeer [sšeyesme ceW megOeej) keâjves kesâ efueS efkeâme
efvecveefueefKele vesšJeke&â GhekeâjCeeW keâe Gvekesâ GösMÙeeW mes Yee<ee keâe GheÙeesie efkeâÙee peelee nw?
efceueeve keâerefpeS: (a) High Level Language/neF& uesJeue ueQiJespe
(Device/GhekeâjCe) (Purpose/GösMÙe)
(b) SQL/Sme.keäÙet.Sue.
A. Router/jeGšj i. Extends Wi-Fi coverage
(c) Query Language/keäJesjer ueQiJespe
JeeF&-HeâeF& keâJejspe yeÌ{elee nw (d) 4GL/4peer.Sue.
B. Switch/efmJeÛe ii. Connects devices/GhekeâjCeeW
29. The row of the table is known as
keâes keâveskeäš keâjlee nw:
leeefuekeâe keâer hebefòeâ keânueeleer nw
C. Modem/cee@[sce iii. Converts digital signal
(a) record/efjkeâe@[& (b) field/heâeru[
ef[efpešue efmeiveueeW keâes
heefjJeefle&le keâjlee nw (c) table/šsyeue (d) relation/mebyebOe

227 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
30. The top level of the hierarchy consists of (c) Primary key/ØeeLeefcekeâ kegbâpeer
_______ each of which can contain______. (d) Composite primary key/mecemle ØeeLeefcekeâ kegbâpeer
heoeveg›eâce kesâ Meer<e& mlej ceW _______ nesles nQ efpeveceW mes 36. Which of the following is NOT an example of
ØelÙeskeâ ceW _______ nes mekeâles nQ~ DBMS?
(a) Catalogs, Schemas efvecve cebs mes keâewve-meer DBMS keâe Skeâ GoenjCe veneR nw?
(b) Schemas, Catalogs (a) SQL Server/ SQL meJe&j
(c) Environment, Schemas
(b) MySQL/ceeF&SmekeäÙetSue
(d) More than one of the above
31. Which of the following SQL commands is used (c) Microsoft Outlook/ceeF›eâesmee@heäš DeeGšuegkeâ
to modify the structure of a table? (d) Microsoft Access/ceeF›eâesmee@heäš Skeämesme
efvecveebefkeâle ceW mes efkeâme SQL keâceeb[ (command) keâe 37. What is the official name of JavaScript?
ØeÙeesie efkeâmeer šsyeue kesâ mš^keäÛej (structure) keâes peeJeeefm›eâhš (JavaScript) keâe DeeefOekeâeefjkeâ veece keäÙee nw?
yeoueves kesâ efueS ØeÙeesie efkeâÙee peelee nw? (a) ECMAScript/F&meerSceSefm›eâhš
(a) Alter (b) Livescript/ueeFJeefm›eâhš
(b) Modify
(c) Javascript/peeJeeefm›eâhš
(c) Update
(d) Wirescript/JeeÙejefm›eâhš
(d) More than one of the above/GheÙeg&òeâ ceW mes Skeâ mes
DeefOekeâ 38. Which among the following is the key
difference between javascript and
32. The SQL statement java?/efvecveefueefKele cebs mes peeJeeefm›eâhš Deewj peeJee kesâ
SELECT ROUND (65.726, –1) FROM DUAL yeerÛe cegKÙe Deblej keäÙee nw?
prints
(a) All of these/meYeer efJekeâuhe
SQL keâLeve SELECT ROUND (65.726, –1)
FROM DUAL; efØevš (b) Javascript interpreter is inbuilt into the
browser
(a) 70
peeJeeefm›eâhš FbšjØesšj yeÇeG]pej ceW Fveefyeuš neslee nw~
(b) garbage
(c) Javascript can be combined directly with
(c) 726 HTML/peeJeeefm›eâhš meerOes SÛešerSceSue kesâ meeLe peesÌ[e
(d) More than one of the above/GheÙeg&òeâ ceW mes Skeâ pee mekeâlee nw
DeefOekeâ (d) Javascript language is simpler than Java
33. Which of the following is a disadvantage of peeJeeefm›eâhš Yee<ee peeJee keâer leguevee cebs mejue nw
using a distributed database
system?/efvecveefueefKele ceW mes keâewve-mee efJeleefjle [sšeyesme 39. Stacks and queues are:/mšwkeâ Deewj keäÙet keäÙee nw?
efmemšce keâe GheÙeesie keâjves keâe vegkeâmeeve nw? (a) primitive data structures/efØeefceefšJe [sše mš^keäÛeme&
(a) Improved data accessibility/yesnlej [sše hengBÛe (b) Data types /[sše šeFhme
(b) Increased data security/yeÌ{er ngF& [sše megj#ee (c) Non-linear data structures
(c) Data inconsistency/[sše Demebielelee vee@ve ueerefveÙej [sše mš^keäÛeme&
(d) More than one of the above/GheÙeg&òeâ ceW mes Skeâ mes (d) Non-primitive data structures
DeefOekeâ vee@ve efØeefceefšJe [sše mš^keäÛeme&
34. Which of the following commands is correct to 40. Identify the CORRECT declaration of double
delete the values in the relation teaches? dimensioned array :
mebyebOe efmeKeeves Jeeues ceeveeW keâes nševes kesâ efueS (a) int arr[2,2]; (b) int arr[2][2];
efvecveefueefKele ceW mes keâewve-mee keâceeb[ mener nw? (c) int arr[2][3][4]; (d) int *arr[10];
(a) Delete from teaches. /efmeKeelee mes nšeSB 41. The name given to variables, classes, methods,
(b) Delete from teaches where Id = ‘Null’; /Jeneb mes etc. is called:/JewefjSyeume, keäueemesme, efJeefOeÙeeW Deeefo
nšeSb peneb DeeF&[er = ‘MetvÙe’; keâes efoÙee ieÙee veece keânueelee nw–
(c) Remove table teaches: /leeefuekeâe nševee efmeKeelee nw~ (a) declaration/Iees<eCee (b) operator/mebÛeeefuekeâe
(d) More than one of the above/GheÙeg&keäle ceW mes Skeâ mes (c) identifier/henÛeevekeâlee& (d) constructor/efvecee&lee
DeefOekeâ 42. In ASP.NET, each session uses a unique _____
35. _______ is an invalid type of database key. bits identifier./ASP.NET ceW, ØelÙeskeâ me$e Skeâ Ùetevf ekeâ
_______ [sšeyesme keâer keâe Skeâ DeJewOe ™he nw~ .........efyešdme DeeF[svšerheâeÙej keâe GheÙeesie keâjlee nw~
(a) Structured primary key/mebjefÛele ØeeLeefcekeâ kegbâpeer (a) 60 (b) 180
(b) Atomic Primary key/Sše@efcekeâ ØeeLeefcekeâ kegbâpeer (c) 120 (d) 30

228 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
43. Consider the following assignment for a List L./ kesâ efueS efkeâme keâerJe[& (Key word) keâe GheÙeesie efkeâÙee
Skeâ efuemš L kesâ efueS efvecveefueefKele DemeeFvecebsš hej peelee nw?
efJeÛeej keâerefpeS~
(a) extends
L = [10, 20, 30, 40, 50, 60]
(b) inherits
Which print statement option will display the
content in the following way?/ efvecveefueefKele ceW mes (c) implements
keâewve mee efØebš mšsšceWš veerÛes efoS ieS DeeGšhegš keâes (d) More than one of the above
oMee&Siee? GheÙeg&òeâ ceW mes Skeâ mes DeefOekeâ
[60, 10, 20, 30, 40, 50] 48. Which of the following statements is correct
(a) print(L[-1] + L [1:]) about the C++ programming language?
(b) print(L[-1] + L [: len (L) - 1]) C++ programming Yee<ee kesâ yeejs ceW efvecveefueefKele
(c) print(L[len (L) -1] + L [1: len (L)]) ceW mes keâewve-mee keâLeve mener nw?
(d) print(L[-1], L [1:]) (a) In C++, both the static and dynamic types
44. What do all classes in the W3.CSS framework checking are allowed.
begin with?
C++ efmLej Deewj ieefleMeerue oesveeW Øekeâej keâer pee@Ûe keâer
W3.CSS øesâceJeke&â ceW meYeer keäueeme efkeâmemes Meg® nesles nw?
Devegceefle nw~
(a) File names/HeâeFue vescme (b) class- (b) In C++, member function are allowed to be of
(c) w3- (d) .css the type const.
45. Which of the following statements is completely C++ meomÙe hebâkeäMeve keâes Const Øekeâej kesâ nesves keâer
true? Devegceefle nw~
efvecveefueefKele ceW mes keâewve-mee/mes keâLeve hetCe&le: melÙe nw/ nQ? (c) In C++, dynamic checking is allowed.
I. In an object-oriented programming C++ ceW, ieefleMeerue pee@Ûe keâer Devegceefle nw~
language, all the function calls are resolved
at compile-time./Dee@ypeskeäš-DeesefjSbšs[ Øees«eeefcebie (d) More than one of the above/GheÙeg&òeâ ceW mes Skeâ
Yee<ee ceW, meYeer HebâkeäMeve keâe@ue keâes mebkeâueve-meceÙe DeefOekeâ
hej nue efkeâÙee peelee nw~ 49. If a semicolon is not used at the end of the
statement, what message will be displayed by
II. In a procedure programming language, all
C++?
the function calls are resolved at compile-
time./Skeâ Øeef›eâÙee Øees«eeefcebie Yee<ee ceW, meYeer Ùeefo keâLeve kesâ Deble ceW semicolon keâe GheÙeesie veneR
HebâkeäMeve keâe@ue keâes mebkeâueve-meceÙe hej nue efkeâÙee efkeâÙee peelee nw, lees C++ Éeje keâewve-mee statements
peelee nw~ ØeoefMe&le efkeâÙee peeSiee?
(a) Only II/kesâJeue II (a) Semicolon missing
(b) Only I/kesâJeue I (b) Statement missing
(c) Error in statements
(c) Both I and II/I Deewj II oesveeW
(d) None of the above/GheÙeg&òeâ ceW mes keâesF& veneR
(d) More than one of the above
50. In C++, what does a class hold?
GheÙeg&keäle ceW mes Skeâ mes DeefOekeâ
C++ ceW, class kesâ Devoj keäÙee neslee nw?
46. Which of the following features must be
supported by any programming language to (a) Array
become a pure object-oriented programming (b) Data
language? (c) Data and functions
Megæ Dee@ypeskeäš-DeesefjSbšs[ Øees«eeefcebie Yee<ee yeveves kesâ (d) More than one of the above/GheÙeg&òeâ ceW mes Skeâ mes
efueS efkeâmeer Yeer Øees«eeefcebie Yee<ee Éeje efvecveefueefKele ceW mes DeefOekeâ
efkeâme efJeMes<elee keâe meceLe&ve efkeâÙee peevee ÛeeefnS? 51. Which of the following software is used to
(a) Encapsulation translate high-level language source codes into
(b) Inheritance machine codes?/efvecve ceW mes efkeâme mee@heäšJesÙej keâe
(c) Polymorphism GheÙeesie GÛÛe mlejerÙe Yee<ee Œeesle keâes[ keâes ceMeerve keâes[
(d) More than one of the above ceW DevegJeeo keâjves kesâ efueS efkeâÙee peelee nw?
GheÙeg&keäle ceW mes Skeâ mes DeefOekeâ
(a) Compiler/kebâheeFuej (b) Assembler/DemeWyeuej
47. Which keyword is used in Java to implement
inheritance?/Java ceW inheritance keâes ueeiet keâjves (c) Adware/Ss[JesÙej (d) Spyware/mheeF&JesÙej

229 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
52. Which of the following prefix expressions is 58. A graphic representation of the sequence of
obtained on converting the infix expression A* steps needed to solve a programming problem
(B – C) ? is called a :
FefvHeâkeäme SkeämeØesMeve A* (B – C) keâes heefjJeefle&le keâjves Skeâ Øees«eeefcebie ØeMve kesâ meceeOeeve kesâ efueS Skeâ
mes efvecve ceW mes keâewve meer ØeerefHeâkeäme SkeämeØesMeve Øeehle keâer DeeuesKeerÙe efve™heCe kesâ ›eâce kesâ ÛejCeeW keâes keäÙee keâne
peeleer nw? peelee nw?
(a) A B C * – (b) – A * B C (a) Program flowchart/Øees«eece HeäueesÛeeš&
(c) * – A B C (d) * A – BC (b) Step chart /mšshe Ûeeš& (ÛejCe yeæ Ûeeš&)
53. Computation logic can be represented visually (c) Rule diagram /™ue [eÙe«eece (efveÙece efÛe$e)
by using/Computation logic keâes efkeâmekesâ GheÙeesie mes
(d) Program graph/ Øees«eece «eeHeâ
efoKeeÙee pee mekeâlee nw?
59. A(n) .......... program is one that is ready to run
(a) Visual Basic/efJepegDeue yeefmekeâ and does not need to be altered in any way.
(b) Lompro/ueecØees Øees«eece pees js[er št jve Deewj efpemekeâes efkeâmeer Yeer Øekeâej mes
(c) Flow chart/ØeJeen efÛe$e ™heeblejCe keâer DeeJeMÙekeâlee veneR nQ, .............~
(d) VI editor/VI mebheeokeâ (a) interpreter (b) high level
54. How many pointers are contained as data (c) COBOL (d) executable
members in the nodes of a circular, doubly 60. _________ means that their source code is not
linked list of integers with five nodes? available.
heeBÛe vees[dme kesâ meeLe Skeâ ieesueekeâej, [yeue efuebkeä[ _________ keâe leelheÙe& nw efkeâ Gvekeâe Œeesle ketâš
hetCeeËkeâeW keâer efuemš kesâ vees[dme ceW [sše meomÙeeW kesâ ™he ceW GheueyOe veneR nw~
efkeâleves hee@Fbšme& nesles nw? (a) Fire ware/heâeÙej JesÙej (b) Free ware/øeâer JesÙej
(a) 15 (b) 8
(c) Free fall/øeâer heâeue (d) Firm ware/heâce& JesÙej
(c) 5 (d) 10
61. A computer virus is a/an ________, which
55. Which of the following refers to an object replicates by inserting copies of itself.
hiding its attributes behind its operation?
Skeâ keâchÙetšj JeeÙejme, Skeâ________nw pees Ùen Deheveer
efvecveefueefKele ceW mes keâewve Deheves mebÛeeueve kesâ heerÚs Deheveer
ØeefleefueefheÙeeB efveJesefMele keâj Øeefleke=âefle neslee nw~
efJeMes<eleeDeeW keâes efÚheeves Jeeueer Skeâ Deeypeskeäš keâes
meboefYe&le keâjlee nw? (a) Software /mee@HeäšJesÙej
(a) Polymorphism/heeueer cee@ef]he&âp]ce (b) Malware /cewueJesÙej
(b) Encapsulation/SvkewâhmeguesMeve (c) Application/ShueerkesâMeve
(c) Inheritance/Fvnsefjšsvme (d) System file/efmemšce HeâeFue
(d) Class/keäueeme 62. Malicious software is any program or file that
is harmful to a computer user. Which of the
56. Which among the following doesn’t come following is malicious software?
under OOP concept?
oes<ehetCe&/otef<ele mee@]HeäšJesÙej keâesF& Yeer Ssmee Øees«eece Ùee
efvecveefueefKele ceW mes keâewve Dees.Dees.heer. DeJeOeejCee kesâ ]HeâeFue neslee nw pees kebâhÙetšj GheÙeesiekeâlee& kesâ efueS
Debleie&le veneR Deelee nw? neefvekeâejkeâ neslee nw~ efvecve ceW mes keâewve mee Skeâ
(a) Data hiding/[sše efÚheevee oes<ehetCe&/otef<ele mee@]HeäšJesÙej nw?
(b) Platform independent/huesšheâece& mJeleb$e (a) Malware/ceeueJesÙej
(c) Message Passing/mebosMe heeefmebie (b) Nero Burning ROM/veerjes yeefve&ie jesce
(d) More than one of the above/GheÙeg&òeâ ceW mes Skeâ mener (c) Bonjour yeesvpegj
57. What is Booth’s algorithm used for?/yetLe (d) CCleaner/meerkeäueervej
SuieesefjLece keâe GheÙeesie efkeâme efueS efkeâÙee peelee nw?
63. efvecveefueefKele ceW mes keâewve mee FbšjØesšj (interpreter)
(a) Binary to decimal conversion keâe iegCe vener nw?
yeeFvejer mes oMeceueJe ™heeblejCe (a) Skeâ FbšjØesšj nj SkeäpeerkeäÙetMeve ceW FbšjØesš keâjves kesâ
(b) Decimal to binary conversion efueS ØelÙeskeâ meesme& ueeFve keâes ueslee nw
oMeceueJe mes yeeFvejer ™heeblejCe (b) FbšjØesšj kebâheeFuej keâer leguevee ceW Oeerces nesles nQ
(c) Binary multiplication/yeeFvejer iegCeve (c) FbšjØesšj cetue ™he mes DevegJeeokeâ nQ
(d) More than one of the above
(d) FbšjØesšj œeesle heâeFue ueslee nw Deewj Skeâ Dee@ypeskeäš
GheÙeg&òeâ ceW mes Skeâ mes DeefOekeâ ]heâeFue yeveelee nw
230 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
64. A computer program that translates high-level (i) Process creation and management/ Øeesmesme
language program into machine language
program statement-by-statement is called ef›eâSMeve Sb[ cewvespeceWš
Skeâ keâchÙetšj Øees«eece, pees GÛÛe-mlejerÙe Yee<ee Øees«eece (ii) Device handling (I/O)/ ef[JeeFme nQ[efuebie (I/O)
keâe keâLeve-oj-keâLeve ceMeerve Yee<ee Øees«eece ceW DevegJeeo (iii) Protection/ØeesšskeäMeve
keâjlee nw, keânueelee nw
(iv) Networking/vesšJeefkeËâie
(a) Compiler/keâcheeFuej
(b) loader/uees[j (a) I only/kesâJeue i
(c) interpreter/FvšjØeeršj (b) i and ii only/kesâJeue i Deewj ii
(d) More than one of the above/GheÙeg&òeâ ceW mes Skeâ mes (c) i, ii, iii and iv/i, ii, iii Deewj iv
DeefOekeâ
(d) ii, iii and iv only/kesâJeue ii, iii Deewj iv
65. For text files to signify the end of line, Unix
uses _________ and Windows uses_______ for 70. Which of the following is a type of operating
the same purpose. Note that the values system?/efvecveefueefKele ceW mes keâewve Dee@hejseEšie efmemšce
indicated within parenthesis are in hex.
šskeämš HeâeFue kesâ efueS hebeòf eâ kesâ Deble keâes Fbefiele keâjves kesâ keâe Skeâ Øekeâej nw?
efueS, Ùetefvekeäme .............. keâe GheÙeesie keâjlee nw Deewj (a) Real-time operating system
efJeC[espe Gmeer GösMÙe kesâ efueS .............. keâe GheÙeesie (b) Embeded operating system
keâjlee nw~ OÙeeve oW efkeâ keâes…keâ ceW oMee&S ieS ceeve nskeäme (c) Network operating system
ceW nw~
(d) More than one of the above/GheÙeg&òeâ ceW mes Skeâ mes
(a) (0A); (0D + 0A)
(b) (0D); (0D + 0A) DeefOekeâ
(c) (0A + 0D); (0D + 0A) 71. Debug IOS term denoting
(d) (0A); (0A) [eryeie IOS Megæ keâe DeLe& nw?
66. Jen keâewve-mee Øees«eece nw pees Øees«eeceeW keâes cesceesjer ceW jKelee
(a) Error correction process
nw Deewj GvnW efve<heeefole keâjves kesâ efueS lewÙeej keâjlee nw?
(b) Writing of instructions in developing a new
(a) Demescyeuej (b) kebâheeFuej
program
(c) uees[j (d) cew@›eâes Øeesmewmej
(c) Fault detection in equipment
67. When a computer virus attaches itself to
another computer program, it is known as –––. (d) Determining useful life
peye Skeâ kebâhÙetšj JeeÙejme Kego keâes efkeâmeer DevÙe kebâhÙetšj 72. Which of the following is a routine in operating
Øees«eece ceW mebueive keâjlee nw, lees Fmes .......... kesâ ™he ceW systems that loads an object program and
peevee peelee nw~ prepares it for execution?
(a) Risky program/efjmkeâer Øees«eece Dee@hejsefšbie efmemšce ceW efvecveefueefKele ceW mes keâewve-mee
(b) Trojan horse/š^espeve ne@me& ™šerve nw pees efkeâmeer Dee@ypeskeäš Øees«eece keâes uees[ keâjlee nw
(c) Host program/nesmš Øees«eece Deewj Gmes efve<heeove nsleg lewÙeej keâjlee nw?
(d) Backward proram/yewkeâJe[& Øees«eece
(a) Linker/efuebkeâj (b) Loader/uees[j
68. What is compaction?
mebIeveve keäÙee nw? (c) Compiler/keâcheeFuej (d) Assembler/Demescyeuej
(a) A technique for overcoming internal 73. Which of the following is not a system tool?
fragmentation efvecveebefkeâle ceW mes keâewve-mee efmemšce štue (system tool)
(b) A paging technique
veneR nw?
(c) A technique for overcoming external
fragmentation (a) Scandisk/mkewâve-ef[mkeâ
(d) More than one of the above
(b) Format/heâe@jcewš
69. Which of the following services is/are provided
by system calls? (c) Folder/heâesu[j
efvecveefueefKele ceW mes keâewve-meer mesJee, efmemšce keâe@ue (d) More than one of the above/GheÙeg&òeâ ceW mes Skeâ mes
(system calls) Éeje Øeoeve keâer peeleer nw/nQ? DeefOekeâ
231 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
74. What is the main difference between 79. The first version of Unix was developed by:
verification and validation in software Ùetefvekeäme keâe ØeLece mebmkeâjCe __ Éeje efJekeâefmele efkeâÙee~
testing?/mee@HeäšJesÙej hejer#eCe ceW melÙeeheve Deewj
(a) Ken Thompson/kesâve Lee@chemeve
JewOeerkeâjCe kesâ yeerÛe cegKÙe Deblej keäÙee nw?
(a) Verification ensures that the software is bug- (b) Presper Eckert/Øesmhej Skeâš&
free, while validation ensures that it meets the (c) J.W. Mauchly/pes.[yuÙet.ceewÛeueer
requirements./ melÙeeheve Ùen megefveeqMÛele keâjlee nw efkeâ
(d) Herman Hollerith/njceve nesuesefjLe
mee@HeäšJesÙej yeie-cegòeâ nw, peyeefkeâ JewOeerkeâjCe Ùen megefveeqMÛele
80. Identify whether the given statements are true
keâjlee nw efkeâ Ùen DeeJeMÙekeâleeDeeW keâes hetje keâjlee nw or false./henÛeeveW efkeâ efoS ieS keâLeve mener nw Ùee ieuele~
(b) Verification is done before coding, while
(i) The capability of a computer to perform
validation is done after coding./ melÙeeheve henues different kinds of works with the same
efkeâÙee peelee nw keâeseE[ie kesâ yeeo JewOeerkeâjCe efkeâÙee peelee nw, accuracy and efficiency is termed as
peyeefkeâ JewOeerkeâjCe keâeseE[ie kesâ yeeo efkeâÙee peelee nw 'diligence'./Skeâ ner mešerkeâlee Deewj #ecelee kesâ meeLe
(c) Verification checks if the software is built efJeefYeVe Øekeâej kesâ keâeÙeeX keâes keâjves kesâ efueS
right, while validation checks if the right keâchÙetšj keâer #ecelee keâes heefjßece keâne peelee nw~
software is built./ melÙeeheve peeBÛelee nw efkeâ keäÙee (ii) The versatility property ensures that a
mee@HeäšJesÙej mener lejerkesâ mes yeveeÙee ieÙee nw, peyeefkeâ computer does not feel any fatigue or lack
of concentration./yengcegKeer ØeefleYee Ùee megefveef§ele
JewOeerkeâjCe Ùen peeBÛelee nw efkeâ keäÙee mener mee@HeäšJesÙej
yeveeÙee ieÙee nw keâjleer nw efkeâ keâchÙetšj keâes keâesF& Lekeâeve Ùee
Skeâe«elee keâer keâceer cenmetme ve nes~
(d) More than one of the above/GheÙeg&òeâ ceW mes Skeâ mes
(a) (i)-True, (ii)-True (b) (i)-False, (ii)-False
DeefOekeâ
(c) (i)-True, (ii)-False (d) (i)-False, (ii)-True
75. Printing speed of laser printers is measured 81. Processor is mounted on _________.
in/uespej efØebšj keâer efØebefšbie ieefle keâes ceeheves keâer FkeâeF&
Øeesmesmej ________ hej Deejesefhele efkeâÙee peelee nw~
keäÙee nesleer nw?
(a) Motherboard/ceojyees[&
(a) Lines per page/hebefòeâÙeeb
Øeefle he=‰ (b) Keyboard/keâeryees[&
(b) Characters per hour/JeCe& Øeefle Iebše (c) ROM/jesce
(c) Characters per line/JeCe& Øeefle hebefkeäle (d) RAM/jwce
(d) Pages per minute/he=‰ Øeefle efceveš 82. Accumulator is an integral component of
76. The arrow keys, Home Key, End Key, Page Up SkeäÙetceguesšj .......... keâe Skeâ meceekeâefuele Ieškeâ nw–
and Page Down keys in a computer keyboard (a) CPU/meer.heer.Ùet.
are classified as
(b) Hard Disk/ne[& ef[mkeâ
kebâhÙetšj keâeryees[& ceW Sjes keâerpe, nesce keâer, Sb[ keâer, hespe
(c) RAM/jwce
Dehe Deewj hespe [eGve keâerpe keâes efkeâme ßesCeer ceW jKeles nQ?
(d) Cache memory/kewâMe cesceesjer
(a) Function keys/HebâkeäMeve keâerpe
83. MIPS is a computer performance measurement
(b) Special purpose keys/mhesMeue hehe&me keâerpe method for rate of instruction execution per
(c) Standard keys/mšQ[[& keâerpe unit time. What is its full form?
Øeefle FkeâeF& meceÙe DevegosMe efve<heeove keâer oj kesâ efueS,
(d) Navigation keys/vesefJeiesMeve keâerpe
MIPS Skeâ kebâhÙetšj keâeÙe& ØeoMe&ve ceeheve efJeefOe nw~
77. Yeejle keâe meyemes MeefòeâMeeueer meghej kebâhÙetšj ØelÙet<e’ Fmekeâe hetCe& ®he keäÙee nw?
IITM (YeejleerÙe G<CekeâefšyebOeerÙe ceewmece efJe%eeve
(a) Master instruction per second
mebmLeeve) _____ceW mLeeefhele efkeâÙee ieÙee nw~ ceemšj Fbmš^keäMebme hej meskebâ[
(a) nwojeyeeo (b) ®Ì[keâer
(b) Memory instruction per second
(c) keâevehegj (d) hegCes
ceemšj Fbmš^keäMebme hej meskebâ[
78. nce&ve nesuesefjLe ves Deheves šsyeguesefšbie efmemšce ceW hetCe&lee
(c) Metric instruction per second
Øeehle keâer Deewj Ùen ceMeerve efJekeâefmele keâer-
cesefš^keâ Fbmš^keäMebme hej meskebâ[
(a) Sveeefueefškeâue Fbpeve (b) meWmeme šsyeguesšj (d) Million instruction per second
(c) šsyeguesMeve Fbpeve (d) GheÙeg&òeâ ceW mes keâesF& veneR efceefueÙeve Fbmš^keäMebme hej meskebâ[
232 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
84. Intel 8085 microprocessor is of ____ 89. In IT, the method for updating the main
generation. memory as soon as a word is removed from the
Fvšsue 8085 ceeF›eâesØeesmesmej ______ pesvejsMeve keâe nw~ cache is called/kewâMe ceW mes Je[& keâes nšeles ner cegKÙe
(a) first/ØeLece
cewceesjer keâes Deöleve (Update) keâjves keâer efJeefOe keâes keäÙee
keânles nw?
(b) second/efÉleerÙe
(a) Write – through/jeFš-LeÇt
(c) third/le=leerÙe
(b) Write- back/jeFš-yewkeâ
(d) More than one of the above/GheÙeg&òeâ ceW mes Skeâ mes
DeefOekeâ (c) Protected-write/Øeesšskeäšs[-jeFš
85. Which of the following semiconductor devices (d) Cache-write/kewâMe-jeFš
can act as a simple switch?/efvecveefueefKele ceW mes 90. Which of the following is/are the major type(s)
keâewve-mee DeOe&Ûeeuekeâ GhekeâjCe Skeâ meeOeejCe efmJeÛe kesâ of computer chips?/efvecveefueefKele ceW mes keâewve mes
™he ceW keâeÙe& keâj mekeâlee nw? keâchÙetšj efÛehme kesâ cegKÙe Øekeâej nQ?
(a) Diode/[eÙees[ (b) Transistor/š^ebefpemšj (a) Primary memory chip/ØeeFcejer cesceesjer efÛehe
(c) Capacitor/mebOeeefj$e (d) Resistor/ØeeflejesOeer (b) Microprocessor chip/ceeF›eâesØeesmesmej efÛehe
86. With reference to "Instructions", which of the (c) a and b both/a Deewj b oesveeW
following options is incorrect? (d) None of these/FveceW mes keâesF& veneR
‘‘ efveoxMe (Instructions)’’ kesâ meboYe& ceW efvecveefueefKele 91. efvecveefueefKele ceW mes efkeâme ßesCeer keâer RAM keâes efvejblej
ceW mes efJekeâuhe ieuele nw? efjøesâMe keâjves keâer DeeJeMÙekeâlee nesleer nw?
(a) The code required to direct the computer to (i) DRAM
perform a discrete action/kebâhÙetšj keâes ef[m›eâerš (ii) SDRAM
SkeäMeve kesâ efueS efveoxefMele keâjves nsleg DeeJeMÙekeâ keâes[~ (a) ve lees (i) Deewj ve ner (ii) (b) kesâJeue (i)
(b) Given by a computer program to a computer
(c) kesâJeue (ii) (d) (i) Deewj (ii) oesveeW
processor. An order has been placed/efkeâmeer kebâhÙetšj
Øees«eece Éeje kebâhÙetšj Øeesmesmej keâe efoÙee ieÙee Skeâ Dee@[&j~ 92. Which of the following statements related to
primary memory of a computer is
(c) A collection of software application specially INCORRECT?
designed to execute specific tasks/efJeefMe­ šemkeâ keâchÙetšj keâer ØeeLeefcekeâ cesceesjer mes mebyebefOele efvecveefueefKele
SkeäpeerkeäÙetš keâjves kesâ efueS efJeMes<e ™he mes ef[]peeFve efkeâS ceW mes keâewve mee keâLeve ieuele nw~
ieS mee@HeäšJesÙej ShueerkesâMeve keâe keâueskeäMeve~
(a) RAM is a component of Arithmetic Logic
(d) Step which is a single operation of the Unit (ALU)/RAM DebkeâieefCeleerÙe leke&â FkeâeF&
processor and is to be executed by the
(ALU) keâe Skeâ Ieškeâ nw~
processor/ÛejCe, pees Øeesmesmej keâe efmebieue Dee@hejsMeve nw
Deewj Øeesmesmej Éeje SkeäpeerkeäÙetš efkeâÙee peevee nw~ (b) The CPU interacts directly with the primary
memory./CPU ØeeLeefcekeâ cesceesjer kesâ meeLe meerOes
87. Which of the following is not used as secondary
storage ?
Fbšjwkeäš keâjlee nw~
efvecveefueefKele ceW efkeâmekeâe efÉleerÙekeâ (meskeWâ[jer) Yeb[ejCe (c) Random Access Memory (RAM) is a volatile
primary memory./jQ[ce Skeämesme cesceesjer (jwce) Skeâ
kesâ ™he ceW GheÙeesie veneR efkeâÙee peelee nw ?
DeefmLej ØeeLeefcekeâ cesceesjer nw~
(a) Semi-conductor memory/DeOe&-Ûeeuekeâ cesceesjer (d) ROM is a non-volatile primary memory./
(b) Magnetic disks/ÛegcyekeâerÙe ef[mkeâ ROM (jesce) Skeâ vee@ve JeesueešeFue ØeeLeefcekeâ cesceesjer nw~
(c) Magnetic drums/ÛegcyekeâerÙe [^cme 93. Memory in which any location can be reached
(d) Magnetic tapes/ÛegcyekeâerÙe šshe in a fixed amount of time after specifying its
address is called
88. A computer system generally has a memory
storage to store large amounts of data Jen cesceesjer, efpemekesâ efkeâmeer ueeskesâMeve hej Gme ueeskesâMeve
permanently. Which of the following options keâes yeleeves kesâ yeeo Skeâ efveef§ele meceÙe ceW hengBÛee pee
represents the storage space capacity that is mekeâlee nw, keânueeleer nw
equivalent to 16 GB?
(a) Sequential Access Memory/efmekeäJesefvMeÙeue Skeämesme
Skeâ kebâhÙetšj efmemšce ceW meeceevÙele: yeÌ[er cee$ee ceW [sše
cesceesjer
keâes mLeeÙeer ™he mes mšesj keâjves kesâ efueS cesceesjer mšesjspe
nesleer nw~ efvecveefueefKele ceW mes keâewve-mee efJekeâuhe mšesjspe (b) Random Access Memory/jQ[ce Skeämesme cesceesjer
mhesme #ecelee keâe ØeefleefveefOelJe keâjlee nw? (c) Secondary Memory/meskesâv[jer cesceesjer
(a) 214 KB (b) 220 KB (d) More than one of the above/GheÙeg&òeâ ceW mes Skeâ mes
(c) 220 MB (d) 214 MB DeefOekeâ
233 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
94. Simplify :/keâes mejueerke=âle keâjW– (d) decoder/[erkeâes[j
98. Which of the following expressions represents
Z = A +B +C D
logical AND gate?
(a) Z A BC D (b) Z AB CD FveceW mes keâewve mee JÙebpekeâ leke&âmebiele AND gate keâes
(c) Z A B C D (d) Z A B C D
JÙeòeâ keâjlee nw–
(a) A+B (b) A/B
95. In Boolean algebra, A.(A+B) is logically
equivalent to: (c) A>B (d) A.B

yetueerÙe yeerpeieefCele (Boolean algebra) ceW A.(A+B) 99. Identify the Boolean Gate, which represents the
following truth table:
leeefke&âkeâ ™he mes efkeâmekesâ meceleguÙe (logically
Gme yetefueÙeve iesš (Boolean Gate) keâer henÛeeve
equivalent) nw?
keâerefpeS, pees efvecveefueefKele melÙe meejCeer (truth table)
(a) B (b) A.B
keâes efve™efhele keâjlee nwŠ
(c) A+B (d) A
A B Output
96. Simplified Boolean function of Boolean
function F = A'C + A'B + AB'C + BC is 0 0 1
yetefueÙeve hebâkeäMeve (Boolean function) 0 1 1
F = A'C + A'B + AB'C + BC keâe mejueerke=âle 1 0 1
yetefueÙeve hebâkeäMeve nw 1 1 0
(a) F = C + A'B (a) XOR
(b) F = A'B + B'C (b) NOR
(c) F = BC +A' B (c) NAND
(d) More than one of the above/GheÙeg&òeâ ceW mes Skeâ mes (d) OR
DeefOekeâ 100. How many AND gates are required to
97. A digital circuit has 3 input lines, 1 enable line construct a 4 - bit parallel multiplier if four 4 -
and 8 output lines. This circuit will be bit parallel binary adders are given?
called:/Skeâ ef[efpešue meefke&âš ceW 3 Fvehegš ueeFveW, 1 Ùeefo Ûeej 4 efyeš meceeblej efÉDeeOeejer Ùeespekeâ efoS ieS nQ,
me#ece ueeFve Deewj 8 DeeGšhegš ueeFveW nesleer nQ~ Fme lees 4 efyeš meceeblej iegCekeâ kesâ efvecee&Ce kesâ efueS efkeâleves
meefke&âš keâes keâne peeSiee- AND iesšeW keâer DeeJeMÙekeâlee nesieer?
(a) multiplexer/ceušerhueskeämej (a) Four 2 - input AND gates
(b) encoder/Fvekeâes[j (b) Eight 2 - input AND gates
(c) Sixteen 2 - input AND gates
(c) demultiplexer/[erceušerhueskeämej
(d) More than one of the above

SOLUTION : PRACTICE SET- 9

ANSWER KEY
1. (b) 11. (d) 21. (c) 31. (a) 41. (c) 51. (a) 61. (b) 71. (a) 81. (a) 91. (d)
2. (c) 12. (a) 22. (b) 32. (a) 42. (c) 52. (d) 62. (a) 72. (b) 82. (a) 92. (a)
3. (a) 13. (b) 23. (a) 33. (c) 43. (b) 53. (c) 63. (a) 73. (c) 83. (d) 93. (b)
4. (c) 14. (d) 24. (a) 34. (a) 44. (c) 54. (d) 64. (c) 74. (c) 84. (b) 94. (d)
5. (c) 15. (a) 25. (b) 35. (a) 45. (a) 55. (b) 65. (a) 75. (d) 85. (b) 95. (d)
6. (b) 16. (a) 26. (c) 36. (c) 46. (d) 56. (b) 66. (c) 76. (d) 86. (c) 96. (a)
7. (b) 17. (a) 27. (c) 37. (a) 47. (a) 57. (c) 67. (b) 77. (d) 87. (a) 97. (d)
8. (d) 18. (b) 28. (c) 38. (a) 48. (d) 58. (a) 68. (c) 78. (b) 88. (d) 98. (d)
9. (d) 19. (a) 29. (a) 39. (d) 49. (d) 59. (d) 69. (c) 79. (a) 89. (b) 99. (c)
10. (b) 20. (b) 30. (a) 40. (b) 50. (c) 60. (b) 70. (d) 80. (b) 90. (c) 100. (c)
234 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
 SOLUTION
1. (b) me#ece nw~ Ùen GvnW meceÙe ëe=bKeuee [sše Ùee Øeeke=âeflekeâ Yee<ee mes pegÌ[s
Dee@šes-SmeesefmeSefšJe vÙetjue vesšJeke&â heâer[ heâejJe[& vesš nw~ efpevnW yewkeâ keâeÙeeX kesâ efueS efJeMes<e ™he mes GheÙeesieer yeveelee nw, peneB meboYe&
ØeeshesiesMeve Ùee Fmeer lejn keâer meerKeves keâer Øeef›eâÙeeDeeW keâe GheÙeesie keâjkesâ cenlJehetCe& nw~ YeeJevee efJeMues<eCe ceW, (LSTM) DevÙe cee@[ueeW keâer
vesšJeke&â Fvehegš Deewj DeeGšhegš kesâ yeerÛe henÛeeve ceeveefÛe$eCe keâe leguevee ceW Yee<ee keâer peefšueleeDeeW keâes yesnlej {bie mes mebYeeue mekeâles nw,
Devegceeve ueieeves kesâ efueS ØeefMeef#ele efkeâÙee peelee nw~ Skeâ Dee@šes JeekeäÙeeW Deewj omleeJespeeW ceW YeeJevee keâer yeejerefkeâÙeeW keâes hekeâÌ[ mekeâles nw~
SmeesefmeSefšJe vesšJeke&â keâer ØecegKe efJeMes<elee Fvehegš Deewj DeeGšhegš kesâ 10. (b)
yeerÛe Skeâ DeeÙeeceer DeÌ[Ûeve nw~ SÛešerSceSue hespe ceW href Sš^eryÙetš Gme hespe keâe URL efveefo&°
2. (c) (specifies) keâjleer nw efpeme hej efuebkeâ peelee nw Ùeefo href Sš^eryÙetš
Ùetefšefuešer DeeOeeefjle SpeWšdme keâF& efJekeâuhe ceW mes meJeexòece efJekeâuhe ceewpeto veneR nesiee, lees <a> Sbkeâj šwie neFhej efuebkeâ veneR nesiee~
Ûegveves ceW ceoo keâjlee nw~ Ùes SpeWš Skeâ GÛÛe GheÙeesefielee hebâkeäMeve 11. (d)
yeveeS jKeles nQ efpemes SpeWš yeenjer ØeoMe&ve ceehe kesâ DeeOeej hej TIFF keâe hetje veece šwie Fcespe heâeFue heâecexš nw~ šwie keâer ieF& ÚefJe
DeefOekeâlece keâjves keâe ØeÙeeme keâjlee nw~ heâeFue mJe™he oes<ejefnle Fcespe heâeFueW nw, efpemekeâe DeLe& nw efkeâ GvnW
3. (a) efkeâmeer Yeer ÚefJe iegCeJeòee Ùee peevekeâejer keâes mebheerefÌ[le (keâcØesm[) keâjves
Deeef[&vees (Arduino) ceW JewefjyeSue mkeâeshe kesâ meboYe& ceW, oesveeW ner keâLeve Ùee Keesves keâer DeeJeMÙekeâlee veneR nw~
mener nw~ pees JewefjSyeue efkeâmeer hebâkeäMeve Ùee yuee@keâ kesâ Devoj Ieesef<ele keâjles 12. (a)
nw GvnW ueeskeâue JewefjSyeue keânles nw~ pees JewefjyeSue hebâkeäMeve kesâ yeenj ceušerceeref[Ùee Dee@Leefjbie štue ceW GheueyOe efJeefYeVe mee@heäšJesÙej štume keâer
Ieesef<ele efkeâS peeles nw GvnW iueesyeue JewefjSyeue keânles nw~ ceoo mes efJeefYeVe Øekeâej keâer ceeref[Ùee meece«eer pewmes šskeämš, Dee@ef[ÙeeW keâes
4. (c) metÛevee keâer Skeâ Oeeje kesâ ™he ceW Fkeâªe keâjves keâer Skeâ Øeef›eâÙee nw, Ùen
DeeF&.Dees.šer. ceW, SkeäÛegSšj Skeâ Ssmeer ef[JeeFme nw pees meWmej kesâ [sJeuehej keâes šskeämš Dee@ef[ÙeeW, Jeeref[Ùees, «eeefheâkeäme Deewj SefvecesMeve keâes
ceeOÙece mes efkeâmeer Yeer Svepeea keâes ieefle ceW heefjJeefle&le keâjleer nw~ efceueekeâj FbšjsefkeäšJe ØespeWšsMeve yeveeves ceW me#ece yeveelee nw~
SkeäÛegSšj IoT ceW ef[JeeFmeeW keâes otjmLe efmLeefleÙeeW mes efveÙebef$ele keâjves keâe 13. (b)
keâeÙe& keâjleer nw efpememes GheÙeesiekeâlee& efJeefYevve meWmej [sše hej DeeOeeefjle
efveCe&Ùe ues mekeâlee nw Deewj otjmLe mLeeve mes ef[JeeFme keâes efveÙebef$ele keâjves mebieerle kesâ efueS Devleje°^erÙe ceevekeâ keâes meboefYe&le keâjves kesâ efueS Fmekeâe
keâer megefJeOee efceueleer nw~ GheÙeesie keâjlee nw~ Ûetbefkeâ Ùen keâchÙetšj mebieerle keâeÙe&›eâce efmeb›eâesveeFpe Deewj
5. (c)
DevÙe Fueskeäš^e@efvekeâ efmeiveue keâe Deeoeve-Øeoeve keâjlee nw~
Amazon Web Services, Microsoft Azure Deewj Salesforce 14. (d)
keäueeG[ kebâhÙetefšbie IoT mesJeeSb Øeoeve keâjles nQ~ peyeefkeâ Filp kart Øeceg K e B2C F&-keâe@ceme& JesyemeeFš nw- Amazon, Wal-Mart,
Zappos, Alibaba and shapify.
Skeâ F&-keâeceme& JesyemeeFš nw pees ceekexâefšbie keâer megefJeOee Øeoeve keâjleer nw~ 15. (a)
6. (b) yueeFb[ keâeye&ve keâe@heer mebosMe Yespeves Jeeues keâes DevÙe Øeehlekeâlee&DeeW mes
WoT (Jesye Dee@heâ efLebime) Skeâ Ssmee øesâceJeke&â nw pees IoT GhekeâjCeeW ceW
yeermeermeer heâeru[ ceW ope& efkeâS ieS JÙeefòeâ keâes efÚheeves keâer Devegceefle osleer
Jesye lekeâveerkeâeW Deewj ceevekeâeW keâes ueeiet keâjkesâ Deewj IoT ef[JeeFme nw~ peye Deehe yeermeermeer heâeru[ ceW Skeâ F&cesue S[^sme [eueles nQ, lees
mesJeeDeeW keâes ceevekeâerke=âle keâjkesâ Fbšjvesš Dee@heâ efLebime (IoT) keâe Fmekeâe celeueye nw efkeâ Deehekesâ Éeje Yespes pee jns F&cesue keâer Skeâ Øeefle
efJemleej keâjlee nw~ IoT ceW WoT keâe GheÙeesie keâjves keâe GösMÙe mebÛeej
Gme S[^sme hej Yeer Yespeer peeSieer, uesefkeâve F&cesue Øeehle keâjves Jeeuee keâesF&
keâes mejue yeveevee Deewj ØeÙeespÙelee (Usability) Deewj DeblejØeÛeeueveerÙelee
Yeer JÙeefòeâ yeermeermeer heâeru[ ceW S[^sme vener osKe heeSiee~ peye keâesF& F&cesue
(interoperability) keâes yeÌ{evee nw~
7. (b)
De«esef<ele (Forwarded) efkeâÙee peelee nw, lees mebosMe kesâ meeLe To Deewj
jesyeesefškeâ Øeesmesme Dee@šescesMeve (RPA), efpemes mee@HeäšJesÙej jesyeesefškeäme CC heâeru[ ceW meYeer kesâ S[^sme Yeer De«esef<ele (forwarded) efkeâS peeles
Yeer keâne peelee nw, efpemeceW ceeveJe keâceÛeeefjÙeeW (human employee) nQ~ yeermeermeer (Bcc) heâeru[ ceW jKes ieÙes S[^sme De«esef<ele
kesâ [sše Skeämeš^skeäš keâjves, Heâe@ce& Yejves Deewj HeâeFueeW keâes mLeeveebleefjle (forwarded) veneR efkeâS peeles nQ~
keâjves pewmes yewkeâ-Dee@efHeâme keâeÙeeX keâe DevegkeâjCe keâjves kesâ efueS 16. (a)
Dee@šescesMeve šskeäveesuee@peer keâe GheÙeesie neslee nw~ Skeâ meeJe&peefvekeâ efmJeÛe efkeâÙee ieÙee šsueerheâesve vesšJeke&â ogevf eÙee Yej ceW GheÙeesie
8. (d) efkeâÙes peeves Jeeues šsueerheâesve vesšJeke&â keâe mebÙeespeve nw, efpemeceW šsueerheâesve
meWmej Ssmes GhekeâjCe nw pees Yeeweflekeâ JeeleeJejCe ceW heefjJele&veeW keâes helee ueeFveW, heâeFyej Dee@efhškeâ kesâyeue, efmJeefÛebie kesâvõ, mesueguej vesšJeke&â, Ghe«en
ueieeles nQ Deewj ceeheles nw~ Fvekeâe GheÙeesie DeewÅeesefiekeâ mJeeÛeeueve, GheYeesòeâe Deewj kesâyeue efmemšce Meeefceue nw~ Skeâ PSTN Ùetpeme& keâes Skeâ-otmejs keâes
Fueskeäš^e@efvekeäme Deewj efÛeefkeâlmee GhekeâjCeeW meefnle efJeefYeVe Øekeâej kesâ DevegØeÙeesie ueQ[ueeFve šsueerheâesve keâe@ue keâjves oslee nw~
ceW efkeâÙee peelee nw~ meefke&âš efmJeefÛebie Skeâ otjmebÛeej vesšJeke&â keâes ueeiet keâjves keâe Skeâ lejerkeâe
meeceevÙe Øekeâej kesâ meWmej :– nw efpemeceW oes vesšJeke&â vees[ vees[dme mebÛeej keâjves mes henues vesšJeke&â kesâ
šschejsÛej meWmej, ØesMej meWmej, heespeerMeve meWmej Øee@efkeämeefcešer meWmej ceeOÙece mes Skeâ meceefhe&le mebÛeej Ûewveue (meefke&âš) mLeeefhele keâjles nw~
Deeefo~ 17. (a)
9. (d) Skeâ JeÛeg&Deue ØeeFJesš vesšJeke&â (VPN) Skeâ meeJe&peefvekeâ vesšJeke&â ceW Skeâ
LSTM (Long Short-Term Memory) Ùes Skeâ Øekeâej kesâ jerkeâjbš efvepeer vesšJeke&â keâe efJemleej keâjlee nw, Deewj Ùetpeme& keâes meePee Ùee meeJe&peefvekeâ
vÙetjue vesšJeke&â (RNN) nw pees Deveg›eâce YeefJe<ÙeJeebCeer mecemÙeeDeeW vesšJeke&â hej [sše Yespeves Deewj Øeehle keâjves ceW mecePe yeveelee nw pewmes efkeâ Gvekesâ
(Sequence prediction problems) ceW ›eâce efveYe&jlee meerKeves ceW kebâhÙetefšbie ef[JeeFme meerOes efvepeer vesšJeke&â mes peg[ Ì s ngS neW~
235 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
18. (b) Ùen Sjj leye GlheVe nesleer nw peye yeÇeGpej efpeme Jesye hespe keâes Keespe
vesšJeke&â efmJeÛe Skeâ keâchÙetšj vesšJeefkeËâie ef[JeeFme nw pees iebleJÙe ef[JeeFme hej jne nw neslee nw~ Jen meJe&j hej GheueyOe veneR neslee nw~
[sše Øeehle keâjves, Øeef›eâÙee keâjves Deewj De«esef<ele keâjves kesâ efueS GheÙeesie keâer 28. (c)
peeleer nw~ meefke&âš efmJeefÛebie, hewkesâš efmJeefÛebie, cesmespe efmJeefÛebie Skeâ efmJeefÛebie
keäJesdjer ueQiJespe Skeâ [sšeyesme Øees«eeefcebie Yee<ee nw, efpemes efjuesMeveue [sšeyesme
lekeâveerkeâ nw peyeefkeâ [eše efmJeefÛebie vener~ cewvespeceWš efmemšce Ùee mecyevOehejkeâ [sšeyesme cewvespeceWš efmemšce ceW DeekeâÌ[eW
19. (a) kesâ ØeyevOeve kesâ efueS yeveeÙee ieÙee nw~ Fmekesâ oeÙejs ceW DeebkeâÌ[eW hej ØeMve
OSI keâe efJemle=le ™he Deesheve efmemšce FbšjkeâveskeäMeve nQ Ùen 7 uesÙej (keäJesjer), DeeBkeâÌ[eW keâes Dehe[sš, ØeÙeesiekeâlee& efvecee&Ce Deewj ™heeblejCe Deewj
Dee@efke&âšskeäÛej nw~ [sše Sskeämesme kebâš^esue Meeefceue nw~
vesšJeke&â uesÙej OSI cee@[ue keâer leermejer uesÙej nw~ 29. (a)
vesšJeke&â uesÙej hej ™efšbie (Routing) Deewj uee@efpekeâue S[^sefmebie keâeÙe& leeefuekeâe keâer hebefòeâ efjkeâe[& keânueeleer nw~ efjuesMeveue [ešeyesme kesâ meboYe& ceW
keâjlee nw~ Row Single DeeFšce keâe ØeefleefveefOelJe keâjlee nw~
20. (b) 30. (a)
HTTP Skeâ Stateless Øeesšeskeâe@ue nw, efpemekeâe DeLe& nw efkeâ keäueeFbš [sšeyesme cewvespeceWš efmemšce ceW, Skeâ kewâšuee@ie (Catalogs) Skeâ GÛÛe-
mes meJe&j keâes Yespee ieÙee ØelÙeskeâ DevegjesOe Skeâ mJeleb$e uesve-osve kesâ ®he mlejerÙe mebjÛevee nesleer nw efpemeceW keâF& mkeâerceepe (Schemas) nes mekeâles
ceW ceevee peelee nw, efpemeceW efheÚues DevegjesOeeW keâer keâesF& peevekeâejer Ùee nQ~ ØelÙeskeâ mkeâercee ceW efJeefYeVe [sšeyesme Dee@ypeskeäšdme pewmes šsyeume, yÙetpe
cesceesjer veneR nesleer nw~ Deewj Øeesefmepej Meeefceue nesles nw~
21. (c) 31. (a)
vesšJeke&â meJe&j, Skeâ efJeefMe­ vesšJeke&â ceW meyemes cenlJehetCe&/MeefòeâMeeueer šsyeue kesâ mš^keäÛej keâes yeoueves kesâ efueS SQL ceW ALTER veecekeâ
mebieCekeâ nw~ vesšJeke&â meJe&j keâes vesšJeke&â mebmeeOeveeW keâe ØeyebOeve keâjves keâceeb[ keâe ØeÙeesie efkeâÙee peelee nw~ Fme keâceeb[ keâer ceoo mes Deehe veS
Deewj vesšJeke&â mesefšbie ceW keäueeFbš kesâ ™he ceW peeves Jeeues DevÙe keâchÙetšjeW keâe@uece peesÌ[ mekeâles nw, ceewpetoe keâe@uece keâes yeoue mekeâles nQ, Ùee šsyeue
keâer mesJeeSB Øeoeve keâjves kesâ efueS ef[peeFve efkeâÙee ieÙee nw~ mebjÛevee ceW DevÙe yeoueeJe keâj mekeâles nw~
22. (b) 32. (a)
GSM keâe DeLe& iueesyeue efmemšce heâe@j ceesyeeFue keâcÙegefvekesâMeve nw~ Ùen SQL ceW, ROUND HebâkeäMeve keâe GheÙeesie efkeâmeer mebKÙee keâes
Skeâ ef[efpešue mesueguej lekeâveerkeâ nw efpemekeâe GheÙeesie ceesyeeFue Jee@Ùeme oMeceueJe mLeeveeW keâer efveefo&„ mebKÙee lekeâ hetCeeËkeâ keâjves kesâ efueS efkeâÙee
Deewj [sše mesJeeDeeW keâes Øemeeefjle keâjves kesâ efueS efkeâÙee peelee nw~ peelee nw~ efoS ieS SQL keäJesjer ceW ROUND HebâkeäMeve keâe ØeÙeesie
CDMA keâe celeueye keâes[ ef[Jeerpeve ceušerheue Skeämesme nw~ CDMA nesves mes mebKÙee 65.726 keâes 10 kesâ efvekeâšlece iegCekeâ ceW hetCeeËefkeâle
DeeOeeefjle GhekeâjCeeW keâes efmece keâe[& keâer DeeJeMÙekeâlee vener nesleer nw, keâjsieer~ Dele: heefjCeece 70 nesiee~
Ùen ESN (Fueskeäš^e@efvekeâ meerefjÙeue vecyej) keâe GheÙeesie keâjlee nw~ 33. (c)
CDMA ceesyeeFue ceW, «eenkeâ keâer peevekeâejer Gmekesâ ns[mesš Ùee heâesve efJeleefjle [sšeyesme efmemšce keâe GheÙeesie keâjves keâe ØecegKe vegkeâmeeve [sše
ceW meb«enerle (save) keâer peeleer nw~ Dele: efoS ieS oesveeW ner keâLeve mener Demebielelee nw~ efJeleefjle [sšeyesme efmemšce ceW efJeefYeVe mLeeveeW hej [sše neslee
nw~ nw, efpememes [sše Demebielelee keâer mecemÙeeSB GlheVe nes mekeâleer nw Ùeefo [sše
23. (a) efmeb›eâveeFpesMeve Deewj keâe@efvmemšWmeer keâes "erkeâ mes ØeyeefvOele veneR efkeâÙee peeS~
Sue S Sve (LAN) keâe hetCe& ™he ueeskeâue SefjÙee vesšJeke&â nw, Fmekeâer 34. (a)
jWpe ueieYeie 2 efkeâceer. lekeâ nesleer nw~ [sšeyesme ceW Delete keâceeb[ mes efkeâmeer šsyeue kesâ ceeveeW keâes [erefueš keâj
24. (a) mekeâles nQ~
mener efceueeve- Delete from table-name
(Device/GhekeâjCe) (Purpose/GösMÙe) Delete from teaches;
FmeceW teaches veece keâer šsyeue keâes Delete efkeâÙee ieÙee nw~
A. jeGšj iv. vesšJeke&â š^wefHeâkeâ keâes efveoxefMele
35. (a)
keâjlee nw~ mebjefÛele ØeeLeefcekeâ kebgâpeer [sšeyesme keâer Skeâ DeJewOe ™he nw~ Skeâ mebjefÛele
B. efmJeÛe ii. GhekeâjCeeW keâes keâveskeäš keâjlee nw: ØeeLeefcekeâ kebgâpeer Skeâ leeefuekeâe ceW oes Ùee oes mes DeefOekeâ mlecYeeW keâes efceueekeâj
C. cee@[sce iii. ef[efpešue efmeiveueeW keâes yeveeF& peeleer nw~ Fmekeâe GheÙeesie mlecYeeW kesâ mebÙegòeâ nesves hej leeefuekeâe ceW ØelÙeskeâ
heefjJeefle&le keâjlee nw hebefòeâ keâes efJeefMe­ ™he mes henÛeeveves kesâ efueS efkeâÙee pee mekeâlee nw~
D. Skeämesme hee@Fbš i. JeeF&-HeâeF& keâJejspe yeÌ{elee nw~ 36. (c)
25. (b) ceeF›eâesmee@heäš DeeGšuegkeâ, Sce Sme Dee@efheâme hewkesâpe keâe Skeâ
heâeFue Fbef›eâhš, mebJesoveMeerue [sše meefnle heâeFueeW keâes megjef#ele ShueerkesâMeve nw efpemekeâe DBMS mes keâesF& mecyevOe vener nw~ peyeefkeâ
™he mes Yespeves kesâ efueS GvnW Svkeâes[ keâjves keâe Skeâ lejerkeâe nw~ SQL meJe&j, MySQL, MS Access Deeefo meYeer [sšeyesme mes
26. (c) mecyeefvOele keâeÙe& keâjves kesâ efueS nesles nw~
Skeâ Øekeâej kesâ efmeiveue keâes efJeefYeVe Øekeâej kesâ efmeiveue ceW heefjJeefle&le 37. (a)
keâjves Jeeues ef[JeeFme keâes š^ebme[Ÿetmej keânles nw~ peeJeeefm›eâhš (JavaScript) keâe JeemleefJekeâ veece F&meerSceS-efm›eâhš
27. (c) (ECMA Script) nw~ Ùen Skeâ keâchÙetšj Øees«eeefcebie Yee<ee nw~ cegKÙele:
HTTP 404 Sjj keâe DeLe& nw efkeâ ‘‘meJe&j hej DevegjesefOele mebmeeOeve keäueebSš meeF[ cebs yesJe hespe kesâ efvecee&Ce ØeÙegòeâ neslee nw~ Fmekeâe efvecee&Ce
veneR efceue mekeâe’’ 1995 ceW yeÇW[ve F&Ûe Éeje efkeâÙee ieÙee Lee~
236 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
38. (a) 1. keäueemespe Deewj Dee@ypeskeäšdme
peeJeeefm›eâhš Deewj peeJee kesâ yeerÛe cegKÙe Devlej efvecveefueefKele nw~ 2. FvensefjšWme
S.N. Javascript Java 3. hee@ueercee@efHe&âpece
1. Ùen Skeâ SbšjØesš keâer peeves – Ùen kebâheeFue keâer peeves 4. FvekeâwhmeguesMeve
Jeeueer Øees«eeefcebie Yee<ee nw~ Jeeueer Øees«eeefcebie Yee<ee nw~ 47. (a)
2. Ùen Dee@ypeskeäš DeeOeeefjle – Ùen Dee@ypeskeäš DeeOeeefjle peeJee ceW FvnsefjšWme keâes ueeiet keâjves kesâ efueS extends keâerJe[& keâe
efm›eâefhšbie ueQiJespe nw~ Øees«eeefcebie ueQiJespe nw~ GheÙeesie efkeâÙee peelee nw~
3. peeJeeefm›eâhš heâeFue ceW heâeFue – peeJee Øees«eece ceW heâeFue 48. (d)
SkeämešWMeve ‘‘.js’’ nw~ SkeämešWMeve ‘‘.java’’ nw~ C++ cegKÙe ¤he mes static types keâer peeBÛe keâe GheÙeesie keâjlee nw,
4. peeJeeefm›eâhš keâes keâce cesceesjer – peeJee Øees«eece DeefOekeâ ef p emekeâe DeLe& nw efkeâ keâcheeFue-šeFce hej types keâer peevekeâejer keâer
keâer DeeJeMÙekeâlee nesleer nw~ cesceesjer keâe GheÙeesie keâjlee nw~peeBÛe keâer peeleer nw~ neueeBefkeâ C++ dynamic _ cast Deewj typeid
39. (d) pewmes leb$eeW keâe GheÙeesie keâjkesâ kegâÚ dynamic types keâer peeBÛe keâjlee
ØeerefceefšJe [sše šeFhe ceW yetefueÙeve, kewâj (char), yeeFš, Meeš&, Fbš nw~ Dele: C++ static types Deewj dynamic types keâer peeBÛe oesveeW
(int), ueebie, heäueesš leLee [yeue FlÙeeefo Meeefceue nw peyeefkeâ vee@ve keâe meceLe&ve keâjlee nw~
ØeerefceefšJe [sše šeFhe ceW keäueemespe, Fbšjhesâme, Ssjs, mšwkeâ, keäÙet C++ ceW nce efkeâmeer Member function keâes Const ef[keäuesÙej keâj
(queus) Deeefo Meeefceue nw~ mekeâles nw~ C++ ceW dynamic_cast, typeid, virtual functions
40. (b) Deeefo kesâ ceeOÙece mes runtime (dynamic) checking mebYeJe nw~
Éer DeeÙeeceer Ssjs keâe mener ef[keäuesjsMeve int arr[2][2]; nw~ meejCeer arr 49. (d)
ceW 2 heefòeâÙeeB nw, efpemeceW ØelÙeskeâ hebefòeâ ceW 2 ØeefJeef°ÙeeB (mlecYe) nesleer C++ ceW, keâes[ yuee@keâ kesâ Deble ceW peye mesecf ekeâesueve (;) keâe GheÙeesie veneR
nw~ ef
k eâÙee peelee nw, lees C++ Éeje keâesF& Yeer mšsšceWš ØeoefMe&le veneR efkeâÙee peelee
41. (c) nw ~ Ùen Skeâ $egefš nes mekeâleer nw Deewj keâes[ keâ@cheeFue veneR nes mekeâlee nw,
DeeF[WefšheâeÙej JewefjSyeue, hebâkeäMeve, keäueemesme, cesLe[, mš^keäÛej Deeefo Ùeefo Ssmee keâes[ keâ@cheeFuej Éeje mJeerkeâej veneR efkeâÙee ieÙee nw~
pewmeer Fefvšefšpe keâes efoÙee ieÙee veece nw~ Skeâ henÛeevekeâlee& 50. (c)
(identifier) DeuheâevÙetcesefjkeâ JeCeeX (characters) keâe Skeâ mebÙeespeve C++ ceW, Class kesâ Devoj [sše Deewj HebâkeäMeve oesveeW nes mekeâles
(combination) neslee nw, Ùen efmehe&â Deuheâeyesš (a,b,...z) Ùee nw~ [sše Class keâer efJeMes<elee keâe ØeefleefveefOelJe keâjlee nw, peyeefkeâ
DeC[jmkeâesj mes Meg® neslee nw~ Ùen Øees«eece kesâ efve<heeove kesâ oewjeve HebâkeäMeve keäueeme kesâ meeLe keâece keâjves kesâ lejerkeâeW keâes heefjYeeef<ele
efkeâmeer FkeâeF& keâes henÛeeveves kesâ efueS Skeâ Ùetefvekeâ veece osves kesâ efueS keâjles nw~
yeveeS ieS nw~ 51. (a)
42. (c) GÛÛe mlejerÙe Yee<ee ceW efueKes ieS Øees«eece keâes ceMeerve keâes[ ceW DevegJeeo
mesMeve Skeâ Ùetefvekeâ DeeF[svšerheâeÙej Éeje DeeF[sšerheâeF& efkeâÙee peelee nw~ keâjves kesâ efueS kebâheeFuej keâe GheÙeesie efkeâÙee peelee nw~ Ùen Skeâ ner yeej
Ùen Skeâ 120 efyešdme keâe DeeF[svšerheâeÙej neslee nw~ mesMeve ceW hetjs Øees«eece keâe DevegJeeo keâjlee nw~ Skeâ yeej mebkeâefuele, DevegJeeefole
DeeF[svšerheâeÙej keâe helee ueieeves kesâ efueS mesMeve ID Øee@hešea keâe Øees«eece heâeFue keâes meerOes keâchÙetšj Éeje GheÙeesie efkeâÙee pee mekeâlee nw
GheÙeesie efkeâÙee peelee nw~ Deewj Ùen mJeleb$e ™he mes efve<heeove ÙeesiÙe nw~
43. (b) 52 . (d)
(L[–1] + L [:len(L)–1]) Øeerefheâkeäme SkeämeØesMeve Jen SkeämeØeMesve neslee nw efpemeceW Dee@hejsšj,
efpemeceW L[–1] efuemš kesâ DeeefKejer SefueceWš keâes oMee&lee nw, pees 60 nw~ Dee@hejWš mes henues SkeämeØesMeve ceW Øekeâš neslee nw~
[L[–1]] Fmekeâe DeLe& nw efkeâ Fmes Skeâ efuemš kesâ ™he ceW oMee&Ùee ieÙee A* (B – C)
nw [60] = * A (B – C)
L[:len(L)–1] efuemš kesâ henues SefueceWš mes ueskeâj DeeefKejer mes Skeâ = * A (–BC)
keâce SefueceWš lekeâ keâer meyeefuemš oslee nw, pees [10,20,30,40,50] nw = * A –BC
53. (c)
Fme lejn (L[–1] + L [:len(L)–1]) keâe heefjCeece [60] + ØeJeen efÛe$e (Flow-chart) keâe ØeÙeesie keâjkesâ, Computational
[10,20,30,40,50] nesiee, pees [60,10,20,30,40,50] keâer yejeyej nw~
Logic keâes efoKeeÙee pee mekeâlee nw~ ØeJeen efÛe$e Skeâ Øekeâej mebÙeesefpele
44. (c) efÛe$e nw pees SuieesefjLece keâes ØeoefMe&le keâjlee nw~ ØeJeen efÛe$e ceW ØeÙegòeâ
W3.CSS øesâceJeke&â ceW meYeer keäueeme ‘w3-’ mes Meg® nesleer nw~ GoenjCe kesâ nesves Jeeueer Deeke=âefleÙeeB
efueS– W3-container, W3-button, W3-padding Deeefo~ Fme
lejerkesâ mes W3.CSS kesâ keäueeme veece Ùetefvekeâ Deewj kebâefHeäuekeäš-øeâer jnles nQ~ → ØeJeen jsKee
45. (a) → (Øeesmesme)
keâLeve-II mener nw keäÙeeWefkeâ Øees«eeefcebie ueQiJespe ceW meYeer HebâkeäMeve keâe@ue keâes → (efØehejsMeve)
mebkeâueve meceÙe hej nue efkeâÙee peelee nw~ → (ef[efMepeve)
46. (d)
→ (šefce&veue)
Megæ Dee@ypeskeäš DeesefjSbšs[ Øees«eeefcebie Yee<ee yeveves kesâ efueS GmeceW
efvecveefueefKele efJeMes<eleeSB nesveer ÛeeefnS– → (Fvehegš/DeeGšhegš)

237 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
54. (d) 63. (a)
ØelÙeskeâ vees[ ceW oes hee@Fbšme& nesles nQ lees 5 vees[dme kesâ efueS, [yeue FbšjØesšj Skeâ keâchÙetšj Øees«eece nw Ùen meesme& keâes[ keâes DevegJeeefole
efuebkeä[ efuemš ceW ome hee@Fbšme& neWies~ keâjlee nw~ Skeâ FbšjØesšj ØelÙeskeâ SkeäpeerkeäÙetMeve ceW FbšjØesš keâjves kesâ
[yeue efuebkeä[ efuemš Skeâ efuebkeâ keâer ieF& [sše mebjÛevee nesleer nw efpemeceW efueS ØelÙeskeâ meesme& ueeFve keâes ueslee nw~
64. (c)
Deveg›eâefcekeâ ™he mes efuebkeâ efkeâS ieS efjkeâe[& keâe Skeâ mesš neslee nw
FvšjØesšj Skeâ keâchÙetšj Øees«eece neslee nw pees neF& uesJeue ueQiJespe ceW
efpemes vees[dme keâne peelee nw~ ØelÙeskeâ vees[ ceW leerve heâeru[ nesles nw~ oes efueKes ieÙes keâes[ keâes ueeFve yeeF& ueeFve ceMeerve ueQiJespe ceW yeouelee nw~
efuebkeâ heâeru[ Deewj Skeâ [sše heâeru[~ Ùeefo efkeâmeer Øekeâej keâer keâesF& Sjj Deeleer nw lees Jen peye lekeâ Gmekeâes
55. (b) "erkeâ veneR keâj ueslee nw~ Deeies veneR yeÌ{lee nw~
SvkewâhmeguesMeve Deheves mebÛeeueve kesâ heerÚs Deheveer efJeMes<eleeDeeW keâes efÚheeves 65. (a)
Jeeueer Skeâ Deeypeskeäš keâes meboefYe&le keâjlee nw~ ØelÙeskeâ Dee@hejsefšbie efmemšce kesâ efueS efYeVe-efYeVe šskeämš HeâeFue Heâe@jcesš
56. (b) neslee nw~ pewmes– Unix, Windows Deeefo~
huesšHeâece& mJeleb$elee (Platform independent) Dee@ypeskeäš-DeesefjSvšs[ Unix Dee@hejsefšbie efmemšce, Skeâ šskeämš ueeFve Ùee hebefòeâ kesâ Deble kesâ
Øees«eeefcebie (OOP) keâer DeJeOeejCee veneR nw~ OPP keâer DeJeOeejCeeDeeW ceW efueS efJeefYeVe LF kewâjskeäšj (JeCe&) pewmes \n, 0A Ùee 10 Deeefo keâe
[sše Úgheevee (SvkewâhmeguesMeve), cewmespe heeefmebie, FvensefjšWme, Deewj GheÙeesie keâjles nw; peyeefkeâ Windows Dee@hejsefšbie efmemšce CR leLee
hee@ueercee@efHe&âpce Meeefceue nQ~ LF oesveeW kesâ Deveg›eâce kewâjskeäšj (CR + LF) keâe GheÙeesie keâjlee nw
57. (c) pew mes - \r + \n, 0D + 0A DeLeJee 13 ± 10~
yetLe SuieesefjLece keâe GheÙeesie yeeFvejer ceefušhueskesâMeve kesâ efueS efkeâÙee 66. (c)
uees[j Dee@hejsefšbie efmemšce keâe Skeâ Yeeie neslee nw pees keâchÙetšj
peelee nw~
Starting kesâ meceÙe Øees«eece keâes cesceesjer ceW uees[ keâjlee nw leLee Øees«eece
58. (a)
keâes SkeäpeerkeäÙetMeve kesâ efueS lewÙeej keâjlee nw~
Skeâ Øees«eeefcebie ØeMve kesâ meceeOeeve kesâ efueS Skeâ DeeuesKeerÙe efve™heCe kesâ 67. (b)
›eâce kesâ ÛejCeeW keâes ‘Øees«eece HeäueesÛeeš& (Program Flowchart)’ keâne š^espeve ne@me& Ùee š^espeve Skeâ Ssmee Øees«eece nw pees efoKeves ceW lees mener
peelee nw~ HeäueesÛeeš& efkeâmeer oer ieF& mecemÙee kesâ efueS Skeâ meceeOeeve DevegYeJe neslee nw, hejvleg Ùeefo Fmes ÛeueeÙee peelee nw lees Fmekesâ ØeYeeJe
cee@[ue efoKeelee nw~ FmeceW yengle meejs Symbols keâe Fmlesceeue efkeâÙee YeÙebkeâj nesles nw~ Fmekeâe Fmlesceeue Skeâ nwkeâj (Hacker) efkeâmeer
peelee nw pees efkeâ Program kesâ Flow keâes oMee&les nQ~ Ùen peefšue heemeJe[& keâes leesÌ[ves kesâ efueS keâj mekeâlee nw~ Ùen ne[& ef[mkeâ kesâ meejs
(Complex) Øeef›eâÙeeDeeW keâes mecePeves ceW Ùetpej keâer ceoo keâjlee nw~ [sše (Data) Deewj Øees«eece keâes efceše oslee nw~
59. (d) 68. (c)
Jen Øees«eece pees js[er št jve Deewj efpemekeâer efkeâmeer Yeer Øekeâej mes mebIeveve (Compaction) Skeâ cesceesjer ØeyebOeve lekeâveerkeâ nw efpemekeâe
™heeblejCe keâer DeeJeMÙekeâlee veneR nw, efve<heeove ÙeesiÙe (executable) GheÙeesie yeenjer efJeKeb[ve (External fragmentation) keâes otj keâjves
keânueelee nw~ Ùen Skeâ keâes[ nw pees meeceevÙe leewj hej ceMeerve Yee<ee keâes kesâ efueS efkeâÙee peelee nw~ FmeceW DeeJebefšle cesceesjer yuee@keâeW keâes Fme lejn
mes mLeeveebleefjle efkeâÙee peelee nw efkeâ meejer Keeueer cesceesjer keâes Skeâ yeÌ[s
mevoefYe&le keâjlee nw, pees cetue efveoxMeeW keâe mesš nw efpemes keâchÙetšj
yuee@keâ ceW mecesefkeâle efkeâÙee pee mekesâ, efpememes yeÌ[er cesceesjer DeeJebšveeW keâes
ne[&JesÙej ceW efve<heeefole keâjlee nw~ Deemeeveer mes hetje efkeâÙee pee mekesâ~
60. (b) 69. (c)
øeâer JesÙej, mee@heäšJesÙej keâes GheÙeesiekeâlee& efve:Megukeâ GheÙeesie keâj mekeâles nw efmemšce keâe@ue efkeâmeer Øees«eece kesâ efueS Dee@hejsefšbie efmemšce (OS) kesâ
leLee Fmes [eGveuees[ keâjves keâer meercee veneR nesleer DeLee&led Fmes keâF& yeej meeLe Fbšjwkeäš keâjves keâe Skeâ lejerkeâe nw~ Ùen kebâchÙetšj Øees«eece kesâ efueS
[eGveuees[ keâjkesâ GheÙeesie ceW ueeÙee pee mekeâlee nw~ øeâer JesÙej ceW OS keâvexue mes mesJee keâe DevegjesOe keâjves keâe Skeâ Øees«eecesefškeâ lejerkeâe nw~
ØeefleyevOe ueieevee mee@heäšJesÙej kesâ cee@efuekeâ hej efveYe&j keâjlee nw~ Fmekesâ efmemšce keâe@ue Éeje Øeoeve keâer peeves Jeeueer mesJeeSB-
DeueeJee øeâerJesÙej mee@heäšJesÙej kesâ meeLe meesme& keâes[ GheueyOe veneR neslee (i) Øeesmesme ef›eâSMeve Sb[ cewvespeceWš (ii) ef[JeeFme nw[efuebie (I/O)
DeLee&led Ùen keäueesp[ meesme& mee@heäšJesÙej nw~ (iii) ØeesšskeäMeve (iv) vesšJeefkeËâie
61. (b) (v) cesve cesceesjer cewvespeceWš (vi) heâeFue cewvespeceWš
Skeâ keâchÙetšj JeeÙejme, Skeâ cewueJesÙej (Malware ) nw pees Deheveer 70. (d)
Ùes meYeer efJekeâuhe Dee@hejsefšbie efmemšce kesâ efJeefYeVe Øekeâej nw~
ØeefleefueefheÙeeB efveJesefMele keâj Øeefleke=âefle neslee nw~ cewueJesÙej Skeâ oess<ehetCe&
(Malacious) mee@HeäšJesÙej nw, pees GheÙeesiekeâlee& keâer peevekeâejer kesâ efyevee efjÙeue šeFce Dee@hejsefšbie efmemšce- Ùen mebJesoveMeerue SefhuekesâMeveeW kesâ efueS
keâchÙetšj efmemšce ceW Iegmekeâj Øees«eece mes ÚsÌ[ÚeÌ[ keâjlee nw Ùee Gmes ef[peeFve efkeâÙee ieÙee nw, peneB lJeefjle Øeefleef›eâÙee keâer DeeJeMÙekeâlee nesleer nw~
vegkeâmeeve hengbÛeelee nw~ cewueJesÙej kesâ ØecegKe JeeÙejme Jee@ce&, š^espeve neme&,vesšJeke&â Dee@hejsefšbie efmemšce- Ùen vesšJeke&â kesâ ceeOÙece mes keâchÙetšjeW
mheeFJesÙej Deeefo cewueJesÙej kesâ GoenjCe nQ~ kesâ yeerÛe mebmeeOeveeW keâe ØeyevOeve keâjlee nw Deewj meePee keâjlee nw~
62. (a) Scyes[s[ Dee@hejsefšbie efmemšce- Ùen efJeMes<e GhekeâjCeeW mes mebueive neslee
efoÙes ieÙes efJekeâuhe ceW mes ‘ceeueJesÙej’ (Malware) Skeâ oes<ehetCe& nw, pewmes mceeš&Heâesve, šerJeer Deewj DevÙe Fueskeäš^eefvekeâ ef[JeeFme~
mee@HeäšJesÙej nw pees GheÙeesiekeâlee& kesâ peevekeâejer kesâ efyevee keâchÙetšj mes 71. (a)
mebJesoveMeerue peevekeâejer Ûegje mekeâlee nw Deewj Oeerjs-Oeerjs keâchÙetšj keâes keâchÙetšj ceW Deeves Jeeueer keâefceÙeeW keâes henÛeevevee leLee Gvekeâes otj keâjves
Oeercee keâj oslee nw~ keâer Øeef›eâÙee keâes ef[yeefiebie keâne peelee nw~
238 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
72. (b) 82. (a)
uees[j Skeâ mšerve nw pees efkeâmeer Dee@ypeskeäš Øees«eece keâes uees[ keâjlee nw SkeäÙetceguesšj meer.heer.Ùet. (Central Processing Unit) keâe Skeâ
Deewj Gmes efve<heeove kesâ (Execution) efueS lewÙeej keâjlee nw~ Ùen Skeâ meceekeâefuele Ieškeâ nw~
Ssmee ™šerve nw pees cesceesjer DeeJebšve, efuebkeâ, mLeeveeblejCe Deewj ueesef[bie 83. (d)
pewmeer ieefleefJeefOeÙeeW kesâ efueS efpeccesoej nw~ MIPS keâe hetCe& ¬he ‘efceefueÙeve Fbmš^keäMebme hej meskebâ[’ neslee nw~ Ùen
73. (c) Skeâ ceeheob[ nw efpemekeâe GheÙeesie kebâhÙetšj Ùee Øeesmesmej keâer Øeesmesefmebie
Heâesu[j, efmemšce štue veneR nw, keäÙeeWefkeâ Heâesu[j Skeâ HeâeFue meb«enCe ieefle keâes ceeheves kesâ efueS efkeâÙee peelee nw~
keâe {e@Ûee nw Deewj Ùen efkeâmeer Yeer efJeMes<e efmemšce štue keâes ØeeflemLeeefhele 84. (b)
veneR keâjlee nw~ Fbšsue 8085 ceeF›eâesØeesmesmej otmejs pesvejsMeve keâe nw~ Ùen 1976 ceW
74. (c) uee@vÛe efkeâÙee ieÙee Lee Deewj Ùen 8-efyeš Øeesmesefmebie #ecelee kesâ meeLe Deelee
JewefjefHeâkesâMeve Ùen Ûeskeâ keâjves keâer Øeef›eâÙee nw efkeâ mee@HeäšJesÙej efyevee nw~
efkeâmeer yeie kesâ Deheves ue#Ùe keâes Øeehle keâjlee nQ~ Ùen megefveefMÛele keâjves 85. (b)
keâer Øeef›eâÙee nw efkeâ efJekeâefmele efkeâÙee ieÙee Glheeo mener nw Ùee veneR, š^ebefpemšj Skeâ DeOe&Ûeeuekeâ GhekeâjCe nw efpemekeâe GheÙeesie efJeÅegle mebkesâleeW
peyeefkeâ Jesefue[sMeve Ùen Ûeskeâ keâjves keâer Øeef›eâÙee nw efkeâ mee@HeäšJesÙej Deewj Meefòeâ keâes yeÌ{eves Ùee efmJeÛe keâjves kesâ efueS efkeâÙee peelee nw~
Glheeo mener nw Ùee veneR Ùee otmejs MeyoeW ceW Glheeo ceW GÛÛe mlejerÙe š^ebefpemšj DeeOegefvekeâ Fueskeäš^e@efvekeäme kesâ yegefveÙeeoer efvecee&Ce Keb[eW ceW mes
DeeJeMÙekeâleeSb nw~ Ùen Glheeo kesâ melÙeeheve keâer peeBÛe keâjves keâer Øeef›eâÙee Skeâ nw~
nw Ùeeveer Ùen peeBÛelee nw efkeâ nce pees efJekeâefmele keâj jnW nw Jen mener š^ebefpemšj oes Øekeâej kesâ nesles nw yeeFheesuej pebkeäMeve š^ebefpemšj Deewj
Glheeo nw Ùee veneR~ heâeru[-Fhesâkeäš š^ebefpemšj~ efÉOegÇJeer pebkeäMeve š^ebefpemšj oes P-N
75. (d) pebkeäMeveeW kesâ oes Deueie-Deueie efJevÙeemeeW pewmes N-P-N Ùee P-N-P kesâ
uespej efØebšj keâer efØebefšbie ieefle ceeheves keâer FkeâeF& he=‰ Øeefle efceveš ie"ve mes Øeehle neslee nw~ Fme Øekeâej kesâ š^ebefpemšj ceW, yeveves Jeeues leerve
(PPM) nesleer nw~ #es$eeW keâes Glmepe&keâ, meb«eenkeâ Deewj DeeOeej Ùee ceOÙe #es$e kesâ veece mes
76. (d) peevee peelee nw~
keâchÙetšj keâer yees[& ceW Sjes keâerpe, nesce keâer, Sb[ keâer, hespe Dehe Deewj 86. (c)
hespe [eGve keâerpe keâes vesefJeiesMeve keâerpe keâer ßesCeer ceW jKee peelee nw~ efveoxMe kesâ meboYe& ceW efoÙes ieÙes efJekeâuhe ceW (c) ieuele nw keäÙeeWefkeâ efveoxMe kesâ
77. (d) meboYe& ceW SkeäpeerkeäÙetš keâjves kesâ efueS efJeMes<e ™he mes ef[heâeFve efkeâS ieS
Yeejle keâe meyemes MeefòeâMeeueer meghej kebâhÙetšj ‘ØelÙeg<e’ IITM mee@heäšJesÙej ShueerkesâMeve keâe keâueskeäMeve keâe GheÙeesie veneR neslee nw, yeefukeâ
(YeejleerÙe G<Ce keâefšyebOeerÙe ceewmece efJe%eeve mebmLeeve ) hegCeW ceW Fmekeâe GheÙeesie cegKÙele: keâchÙetšj Øees«eeefcebie ceW efoS ieS efveoxMeeW keâes
mebmLeeefhele efkeâÙee ieÙee nw~ ØelÙet<e Yeejle keâe meyemes lespe meghej JÙeeKÙeeve Deewj SkeäpeerkeäÙetš keâjves kesâ efueS efkeâÙee peelee nw~
kebâhÙetšj nw~ 87. (a)
Fme meghej kebâhÙetšj keâer neF& hejheâeceXme kebâhÙetefšbie (HPC) #ecelee 6.8 cewivesefškeâ ef[mkeâ, cewivesefškeâ [^cme SJeb cewivesefškeâ šshe meskesâv[jer mšesjspe
hesše Heäuee@hme nw, pees cee$e Skeâ meskesâC[ ceW keâF& Dejye ieCeveeÙeW keâj ef[JeeFme nw peyeefkeâ mesceerkeâv[keäšj cesceesjer ØeeFcejer cesceesjer nw Ùen cesceesjer
mekeâlee nw~ efceefnj Yeer Skeâ meghej kebâhÙetšj nw pees Fmeer mebmLee Éeje Skeâ ef[efpešue Fueskeäš^e@efvekeâ [sše mšesjspe ef[JeeFme nw, efpemes Dekeämej
yeveeÙee ieÙee Lee~ keâchÙetšj cesceesjer kesâ ™he ceW GheÙeesie efkeâÙee peelee nw efpemes Skeâ Skeâerke=âle
78. (b) meefke&âš (IC) hej mesceerkebâ[keäšj Fueskeäš^e@efvekeâ GhekeâjCeeW kesâ meeLe
meWmeme šsyeguesšj Decesefjkeâve Jew%eeefvekeâ nce&ve nesuesefjLe Éeje efJekeâefmele keâeÙee&efvJele efkeâÙee peelee nw~
ceMeerve nw~ Ùen ceMeerve Decesefjkeâe ceW peveieCevee ceW menÙeesie kesâ efueS 88. (d)
1890 ceW yeveeÙeer ieÙeer Leer~ 1 GB = 1024 MB
79. (a) 16 GB = (1024×16) MB
Ùetefvekeäme keâe ØeLece mebmkeâjCe kesâve Lee@chemeve (Ken Thompson) Éeje 16 GB = 16384 MB
efJekeâefmele efkeâÙee ieÙee~ = 16384 MB
80. (b) 16384 MB = 2×2×2×2×2×2×2×2×2×2×2×2×2×2
yengcegKeer ØeefleYee (Versatility)– yengcegKeer ØeefleYee Skeâ keâchÙetšj 16384 MB = 214 MB
89. (b)
keâer #ecelee keâes meceeve mešerkeâlee Deewj o#elee kesâ meeLe efJeefYeVe Øekeâej kesâ kewâMe ceW mes Je[& keâes nšeles ner cegKÙe cesceesjer keâes Deöleve keâjves keâer
keâeÙeeX keâes keâjves kesâ efueS meboefYe&le keâjleer nw~
efJeefOe keâes jeFš-yewkeâ keânles nw~ jeFš-yewkeâ [eše mšesj keâjves keâer efJeefOe
heefjßece (Diligence)– keâchÙetšj Skeâ ner efmLejlee Deewj mešerkeâlee
nw efpemeceW nj yeej heefjJele&ve kesâ yeeo [eše kewâMe ceW efueKee peelee nw
kesâ meeLe ueeKeeW keâeÙe& Ùee ieCevee keâj mekeâlee nw~ Ùen efkeâmeer Yeer Lekeâeve
Ùee Skeâe«elee keâer keâceer cenmetme veneR keâjlee nw~ Dele: oesveeW ner keâLeve peyeefkeâ cegKÙe cesceesjer ceW Ùen kegâÚ efveefMÛele meceÙeevlejeue Ùee efveefMÛele
DemelÙe nw~ MeleeX kesâ lenle efueKee peelee nw~
81. (a) 90. (c)
Øeesmesmej ceojyees[& hej Deejesefhele efkeâÙee peelee nw~ ceojyees[& keâchÙetšj keâe ØeeFcejer cesceesjer efÛehe leLee ceeF›eâesØeesmesmej efÛehe keâchÙetšj efÛehme kesâ
cegKÙe ne[&JesÙej keâcheesvesvš neslee nw pees meYeer DevÙe ne[&JesÙej keâcheesvesvš cegKÙe Øekeâej nw~ ØeeFcejer cesceesjer, meWš^ue Øeesmesefmebie Ùetefveš mes pegÌ[e
keâes peesÌ[lee nw Deewj Øeesmesmej keâes Gvekesâ keâece kesâ efueS keâvš^esue jnlee nw~ ØeeLeefcekeâ cesceesjer Úesšs YeeieeW ceW yešer nesleer nw efpevnW
keâjlee nw~ ueeskesâMeve Ùee mesue keânles nw~
239 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
91. (d)
Skeâ DRAM mšesjspe mesue Fme ceeÙeves ceW ieefleMeerue nw efkeâ kewâhesefmešj mes
Ûeepe& ueerkeâ keâer YejheeF& kesâ efueS Fmes nj kegâÚ efceueer meskebâ[ ceW efjøesâMe keâjves
Ùee Skeâ veÙee Fueskeäš^e@efvekeâ Ûeepe& osves keâer DeeJeMÙekeâlee nesleer nw~
Sme[erDeejSSce (SDRAM) efÛehme ceW, ØelÙeskeâ efÛehe ceW cesceesjer keâes yeQkeâeW
ceW efJeYeeefpele efkeâÙee peelee nw pees meceeveeblej ceW efjøesâMe nesles nQ, Deewj meceÙe
keâer yeÛele keâjles nQ~ Dele: oesveeW ner ßesCeer keâer RAM keâes efvejblej efjøesâMe
keâjves keâer DeeJeMÙekeâlee nesleer nw~
92. (a)
jwce (RAM) Skeâ ØeeLeefcekeâ cesceesjer keâe Ieškeâ nw RAM, ALU keâe
Skeâ kebâheesvesš veneR nw~ ØeeLeefcekeâ cesceesjer Skeâ JeesueešeFue cesceesjer nesleer ef[keâes[j meefke&âš leYeer keâeÙe& keâjlee nw peye Fvesyeue efheve (E) pÙeeoe nes~
nw Deewj keâchÙetšj keâer cegKÙe cesceesjer nesleer nw Deewj Fmes DemLeeÙeer S0, S1 Deewj S2 leerve Deueie-Deueie Fvehegš nw Deewj D0, D1, D2, D3,
D4, D5, D6, D7 Dee" DeeGšhegš nQ~
(Temporary) cesceesjer Yeer keânles nQ~
98. (d)
93. (b) AND iesš Skeâ Ssmeer leeefke&âkeâ Ùegefkeäle nw efpemeceW oes DeLeJee oes mes
jQ[ce Skeämesme cesceesjer keâe GheÙeesie [sše kesâ efJeefYeVe YeeieeW mes yeejerkeâer mes DeefOekeâ efveJesMeer efmeiveue leLee kesâJeue Skeâ efveie&le efmeiveue (out put
hengBÛeves kesâ efueS efkeâÙee peelee nw, efpemeceW efkeâmeer Yeer [sše yeeFš keâes signal) neslee nw~ oes efveJesMeer efmeiveue A leLee B leLee Skeâ efveie&le
meerOes Ùee efyevee efkeâmeer efJeefMe­ ›eâce kesâ Skeämesme efkeâÙee pee mekeâlee nw~ efmeiveue Y nw~ AND iesš efvecve Øekeâej ØeoefMe&le efkeâÙee peelee nw~
94. (d)

Z = A +B+C D

Fmekeâe yegefueÙeve JÙebpekeâ A.B = Y nw efpemes A AND B equal Y

A + B .C D B C B .C heÌ{e peelee nw~
AND gate kesâ efueS
A . B .C D
Y = A.B
A. B C D
oes input kesâ efueS–
AND Gate Truth Table–
95. (d)
efoÙee ieÙee SkeämeØesMeve
A.(A + B)
= A.A + AB (  A.A = A)
= A + AB
= A (1 + B) (  1 + B = 1)
=A OR gate kesâ efueS– Y = A + B (A or B)
96. (a)
NOT gate kesâ efueS– Y = A
yetefueÙeve HebâkeäMeve
99. (c)
F = A'C + A'B + AB'C + BC
NAND iesš ef[efpešue uee@efpekeâ meefke&âš ceW Skeâ efJeMes<e Øekeâej keâe
= A'C + A'B + AB'C + BC (1+A) ∵1+A=1
= A'C + A'B + AB'C + ABC + BC uee@efpekeâ iesš nw~ NAND iesš ÙetefveJeme&ue iesš nw~ Fmekeâe celeueye nw
= A'C + A'B + AC (B' + B) + BC ∵ B' + B = 1 efkeâ meYeer yegefveÙeeoer iesš pewmes AND, OR Deewj NOT iesš keâes
= A'C + A'B + AC + BC NAND iesš keâe GheÙeesie keâjkesâ yeveeÙee pee mekeâlee nw~ NAND
= A'B + C (A' + A) + BC ∵ A' + A = 1 ies š NOT-AND iesš keâe mebÙeespeve nw~
= A'B + C (1 + B) ∵1+B=1 NAND iesš Truth Table–
= C + A'B A B Output
97. (d) 0 0 1
meefke&âš keâes AND Deewj NAND uee@efpekeâ iesšdme kesâ meeLe ef[peeFve 0 1 1
efkeâÙee ieÙee nw~ Ùen 3 yeeFvejer Fvehegš ueslee nw Deewj Dee" DeeGšhegš 1 0 1
ceW mes Skeâ keâes meef›eâÙe keâjlee nw~ Gmes 8 ueeFve ef[keâes[j meefke&âš keâes 1 1 0
Dee@keäšue ef[keâes[j, yeeFvejer Yeer keâne peelee nw~ ef[keâes[j– efpemeceW n 100. (c)
Fvehegš neslee nw leLee DeefOekeâlece 2n DeeGšhegš ueeFvme nesleer nw~ 4 efyeš meceeblej ceušerhueeÙej yeveeves kesâ efueS 4 efyeš hewjsueue yeeFvejer
AND gate keâe ØeÙeesie Active high decoder heefjheLe ceW efkeâÙee S[j kesâ meeLe-meeLe 16, 2-Fvehegš AND iesš keâer DeeJeMÙekeâlee
peelee nw~ nesieer~ AND iesš DeebefMekeâ Glheeo Øeehle keâjves ceW ceoo keâjlee nw
NAND gate keâe ØeÙeesie Active low decoder heefjheLe ceW efkeâÙee peyeefkeâ hewjsueue S[j keâe GheÙeesie DeebefMekeâ GlheeoeW keâes peesÌ[ves kesâ efueS
peelee nw~ efkeâÙee peelee nw~
240 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
 PRACTICE SET - 10
1. What is the form of Fuzzy logic? 7. Which of the following is not major time
heâpeer uee@efpekeâ keâe ™he keäÙee nw? management skill?
(a) Two-valued logic/oes cetuÙeJeeve leke&â efvecveefueefKele ceW mes keâewve-mee ØecegKe meceÙe ØeyebOeve
(b) Crisp set logic/kegâjkegâje mesš leke&â keâewMeue veneR nw?
(c) Many-valued logic/yeng cetuÙeJeeve leke&â (a) Acuity/kegâMee«elee
(d) Binary set logic/yeeFvejer mesš leke&â
(b) Goal setting/ue#Ùe efveOee&jCe
2. In terms of machine learning, the correct full
(c) Procrastination/efJeuecyeve
form of ROC curve is:/ceMeerve ueefveËie kesâ meboYe& ceW,
ROC curve keâe mener hegâue heâe@ce& nw– (d) Planning/efveÙeespeve
(a) Receiver Operating Characteristic curve 8. Who among the following is one of the Co-
(b) Revised Operating Characteristic curve founder or the Arduino Project?
(c) Recall Operation Characteristic curve efvecveefueefKele ceW mes keâewve Dee[t&FveeW Øeespeskeäš (Arduino
(d) Represent Operating Characteristic curve Project) kesâSkeâ men-mebmLeehekeâ nQ?
3. Who has created LISP, the Programming (a) Massimo Banzi/ceeefmmecees yebpeer
Language for Artificial Intelligence?
(b) Time Berners-Lee/efšce yeve&me&-ueer
Deeefš&efHeâefMeÙeue FbšsefuepeWme kesâ efueS Øees«eeefcebie Yee<ee,
(c) Jack Ma/pewkeâ cee
LISP keâes efkeâmeves efJekeâefmele efkeâÙee?
(d) Elone Musk/Sueve cemkeâ
(a) Grace Hopper/«esme ne@hej
9. Which of the following is not an example of an
(b) John McCarthy/pee@ve cewkeâeLeea
IoT device?
(c) Charles Bachman/Ûeeume& yeeÛecewve
efvecveefueefKele ceW mes keâewve-mee IoT ef[JeeFme keâe GoenjCe
(d) Leslie Lamport/uesmueer uewcheesš&
veneR nw?
4. What is the full form of NLP in artificial
intelligence? (a) Fitness tracker/efHeâšvesme
š^skeâj
Deeefš&efheâefMeÙeue FbšsefuepeWme ceW NLP keâe hetCe& ™he keäÙee nw? (b) Desktop computer/[smkeâše@he kebâhÙetšj
(a) Natural Level Processing/vesÛegjue uesJeue Øeesmesefmebie (c) Smart thermostat/mceeš& jseføeâpejsšj
(b) Natural Language Plan/vesÛegjue ueQiJespe hueeve (d) Smart thermostat/mceeš& Leceexmšsš
(c) Number Language Processing 10. Identify the attribute value in the following
vebyej ueQiJespe Øeesmesefmebie HTML statement.
(d) Natural Language Processing efvecveefueefKele HTML keâLeve ceW efJeMes<elee (Sefšy^ Ùetš)
vesÛegjue ueQiJespe Øeesmesefmebie veece keâer henÛeeve keâjW~
5. Which layer is used for wireless connection in <p align = "left">final examination </p>
IoT devices?
(a) left (b) <p> and </p>
IoT GhekeâjCeeW ceW JeeÙejuesme keâveskeäMeve kesâ efueS efkeâme
(c) align (d) final examination
hejle keâe GheÙeesie efkeâÙee peelee nw? 11. Which of the following is a connectivity
(a) Application layer standard for transferring digital instrument
(b) Network layer data?/efvecveefueefKele ceW mes keâewve-mee ef[efpešue GhekeâjCe
(c) Data link layer
[sše mLeeveebleefjle keâjves kesâ efueS Skeâ keâvesefkeäšefJešer
(d) More than one of the above
6. Which of the following is NOT an application ceevekeâ nw?
of IoT?/efvecveefueefKele ceW mes keâewve-mee IoT keâe (a) MIDI (b) MCI
SefhuekesâMeve veneR nw? (c) Real Audio (d) AAC
(a) Arduino/Dee[t&Fvees 12. Which of these is a valid audio file format? /
(b) Smart plug/mceeš& hueie Fvecebs mes keäÙee Skeâ JewOe Dee@ef[Ùees heâeFue heâe@cexš nw?
(c) Smart home/mceeš& nesce (a) .vob (b) .flv
(d) Smart grid/meceeš& ef«e[ (c) .png (d) .aiff
241 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
13. What is the full form of PNG in the computer 18. Technologies like ATM, SONET and Frame
image format? Relay are used by :
kebâhÙetšj ÚefJe Øee™he ceW heer .Sve.peer. keâe hetCe& ™he ATM, SONET Deewj Frame Relay pewmeer lekeâveerkeâeW
keäÙee nw? keâe GheÙeesie efkeâmekesâ Éeje efkeâÙee peelee nw:
(a) Printable Network Graphic (a) LAN (b) PAN
efØevšyesue vesšJeke&â «eeefheâkeâ (c) WAN (d) MAN]
(b) Printable New Graphical/efØevšsyeue vÙet «eeefheâkeâue 19. Which layer of the internet architecture model
is responsible for routing packets between
(c) Port Natural Graphics/heesš& vewÛegjue «eeefheâkeäme
networks?
(d) Portable Network Graphics
Fbšjvesš Deeefke&âšskeäÛej cee@[ue keâer efkeâme uesÙej kesâ ceeOÙece
heesšxyeue vesšJeke&â «eefeheâkeäme
mes, vesšJekeâeX kesâ yeerÛe hewkesâšeW keâer ™efšbie keâer peeleer nw?
14. E-commerce has _________ scope than
E-Business or Digital Business. (a) Data link layer/[sše efuebkeâ uesÙej
F& keâe@ceme& ceW F&-efyepevesme Ùee ef[efpešue efyepevesme keâer (b) Network layer/vesšJeke&â uesÙej
leguevee ceW _____ iegbpeeFMe nw~ (c) Transport layer/š^ebmeheesš& uesÙej
(a) Higher (d) Application layer/SefhuekesâMeve uesÙej
(b) Narrower
20. In computer network, what is the size of IP
(c) Wider
address in IPv4?
(d) More than one of the above
15. Which of the following options use differenct keâchÙetšj vesšJeke&â kesâ IPv4 ceW IP S[^sme keâe meeFpe
tools to mine e-mail addresses from different efkeâlevee neslee nw?
sources and web sites? (a) 8 bits/8 efyeš
efvecveefueefKele ceW mes keâewve mee efJekeâuhe efJeefYeVe œeesleeW
(b) 16 bits/16 efyeš
(meewme&ce) Deewj Jesye meeFšeW ceW F&-cesue S[^sme Keespeves kesâ
(c) 32 bits/32 efyeš
efueS efJeefYeVe šÍume keâe GheÙeesie keâjlee nw?
(a) Spammer/mhewcej (d) More than one of the above/GheÙeg&òeâ ceW mes Skeâ mes
(b) Trasher/š^sMej DeefOekeâ
(c) Phisher/efheâMej 21. In computing ____ is a network security system
that monitors and controls incoming and
(d) Mailer/cesuej
outgoing network traffic based on
16. Which of following refers to the process of predetermined security rules.
improving the site’s visibility when people search
for products or services related to business in keâchÙetefšbie ceW, ............. Skeâ vesšJeke&â megj#ee ØeCeeueer nw,
Google, Bing, and other search engines? pees hetJe& efveOee&efjle megj#ee efveÙeceeW kesâ DeeOeej hej Deeves
peye ueesie ietieue (Google), efyebie (Bing) Deewj DevÙe Jeeues Deewj yeenj peeves Jeeues vesšJeke&â š^wefHeâkeâ keâer efveiejeveer
meÛe& FbpeveeW ceW JÙeJemeeÙe mes mebyebefOele GlheeoeW Ùee mesJeeDeeW Deewj efveÙeb$eCe keâjlee nw~
keâer Keespe keâjles nQ lees efvecveefueefKele ceW mes keâewve-mee, (a) Cookie/kegâkeâer (b) Spam/mhewce
meeFš keâer ÂMÙelee (Visibility) ceW megOeej keâer Øeef›eâÙee keâes
(c) Firewall/HeâeÙejJee@ue (d) Spyware/mhes JesÙej
meboefYe&le keâjlee nw?
(a) Ant Colony Optimization 22. Which of the following statements is/are
FALSE/efvecveefueefKele ceW mes keâewve mes keâLeve ieuele nQ?
Sbš keâe@ueesveer Dee@eqhšceeFpesMeve
(b) Search Engine Optimization (i) The full form of SIM used in mobile phones
meÛe& Fbpeve Dee@efhšceeFpesMeve is Subscriber Identity Module.
(c) Swarm Optimization/ mJewce& Dee@eqhšceeFpesMeve ceesyeeFue heâesve ceW ØeÙegòeâ efmece (SIM) keâe hetCe& ™he
(d) Linear Optimization/ ueerefveÙej Dee@efhšceeFpesMeve meyme›eâeFyej DeeF[Wefššer cee@[Ÿetue (Subscriber
17. What type of transmission is involved in Identity Module) nw~
communication between a computer and a (ii) The size of micro and nano SIM cards is the
keyboard? same./ceeF›eâes Deewj vewvees efmece keâe[& keâe Deekeâej
keâchÙetšj Deewj keâeryees[& kesâ yeerÛe mebÛeej ceW efkeâme Øekeâej yejeyej neslee nw~
keâe š^ebmeefceMeve Meeefceue nw? (a) Neither (i) nor (ii)/ve lees (i) Deewj ve ner (ii)
(a) Half-duplex
(b) Both (i) and (ii)/(i) Deewj (ii) oesveeW
(b) Full-duplex
(c) Simplex (c) Only (ii)/kesâJeue (ii)
(d) More than one of the above (d) Only (i)/kesâJeue (i)
242 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
23. F&Lejvesš keâe[& (Ethernet Card) Skeâ Ssmee vesšJeke&â 29. Which of the following is NOT a valid
S[e@hšj nw, efpemekeâe GheÙeesie JeeÙe[& vesšJeke&â (Wired Relational Operation?/efvecveefueefKele ceW mes keâewve mee
Network) keâes mLeeefhele keâjves kesâ efueS efkeâÙee peelee nw~ Skeâ ceevÙe efjuesMeveue Dee@hejsMeve veneR nw?
(a) CARTESIAN PRODUCT
Fmes ------------ kesâ ™he ceW Yeer peevee peelee nw~
(b) INTERSECTION
(a) vesšJeke&â FbšjHesâme keâe[& (b) HeâeFyej Dee@efhškeäme (c) UNION
(c) yuetštLe keâe[& (d) JeeF&-HeâeF& keâe[& (d) DELETE
24. What is the size of MAC address in computer 30. Which of the following is correct according to
network?/keâchÙetšj vesšJeke&â ceW MAC address keâe the technology deployed by DBMS?
DBMS Éeje lewveele lekeâveerkeâ kesâ Devegmeej efvecveefueefKele
meeFpe efkeâlevee neslee nw?
ceW mes keâewve-mee mener nw?
(a) 32 bits/32 efyeš
(a) Pointers are used to maintain transactional
(b) 16 bits/16 efyeš integrity and consistency/hJeebFšme& keâe GheÙeesie
(c) 48 bits/48 efyeš uesveosve mebyebOeer DeKeb[lee Deewj efmLejlee yeveeS jKeves kesâ
(d) More than one of the above/GheÙeg&òeâ ceW mes Skeâ mes efueS efkeâÙee peelee nw~
DeefOekeâ (b) Cursors are used to maintain transactional
25. Which of the following internet access methods integrity and consistency/keâme&j keâe GheÙeesie
relatively involves a large setup fee and uesveosve mebyebOeer DeKeb[lee Deewj efmLejlee yeveeÙes jKeves kesâ
expensive equipment upfront? efueS efkeâÙee peelee nw~
efvecveefueefKele ceW mes efkeâme Fbšjvesš Skeämesme efJeefOe ceW (c) Locks are used to maintain transactional
Dehes#eeke=âle Skeâ yeÌ[e mesšDehe, Megukeâ SJeb cenbies GhekeâjCe integrity and consistency/uesve-osve mebyebOeer DeKebGlee
Deewj efmLejlee yeveeS jKeves kesâ efueS leeues keâe GheÙeesie
Meeefceue nw?
efkeâÙee peelee nw
(a) Cable modem/kesâyeue cee@[sce (d) More than one of the above/GheÙeg&òeâ ceW mes Skeâ mes
(b) Dial up/[eÙeue Dehe DeefOekeâ
(c) DSL 31. Which of the following SQL keywords is used
(d) Satellite/mewšsueeFš to display data from a table based on certain
26. DeveieeF[s[ š^ebmeefceMeve ceeref[Ùee (unguided pattern?
efvecveebefkeâle ceW mes efkeâme SQL keâerJe[& (keywords) keâe
transmission media) ceW efvecveefueefKele ceW mes efkeâme
ØeÙeesie efkeâmeer hewšve& hej DeeOeeefjle šsyeue mes [sše keâes
efJeefOe keâe GheÙeesie efkeâÙee peelee nw? oMee&ves/efoKeeves kesâ efueS neslee nw?
(a) Coaxial cable/mecee#e kesâyeue (a) IN
(b) Optical fibre cable/Dee@efhškeâue heâeFyej kesâyeue (b) LIKE
(c) Twisted pair cable/JÙeeJeefle&le Ùegice kesâyeue (c) BETWEEN
(d) Infrared/DeJejòeâ (d) More than one of the above/GheÙeg&òeâ ceW mes Skeâ mes
27. Which one of the following refers to the DeefOekeâ
technique used for verifying the integrity of the 32. _____ command makes the updates performed
by the transaction permanent in the database.
message?
_____ keâceev[ transaction Éeje efkeâS ieS Dehe[sš keâe
efvecveefueefKele ceW mes keâewve-mee mebosMe keâer DeKeb[lee
[sšeyesme ceW mLeeÙeer yeveelee nw~
(Fbšeref«ešer) keâes melÙeeefhele keâjves kesâ efueS ØeÙegòeâ keâer (a) ROLLBACK
peeves Jeeueer lekeâveerkeâ keâes meboefYe&le keâjlee nw? (b) COMMIT
(a) Protocol/Øeesšeskeâe@ue (c) TRUNCATE
(b) Digital signature/ef[efpešue efmeivesÛej (d) More than one of the above/GheÙeg&òeâ ceW mes Skeâ
DeefOekeâ
(c) Message Digest/ef[ef›eâhMeve Ssuieesejf Lce
33. The private key in asymmetric key
(d) Message Digest/cewmespe [eFpesmš cryptography is kept by
28. What is the full form of DDL? asymmetric key cryptography ceW, private key
[er.[er.Sue. keâe hegâueheâece& keäÙee nw? efkeâmekesâ Éeje jKeer peeleer nw?
(a) Dynamic Data Language/[eÙevesefcekeâ [sše ueQiJespe (a) sender/Øes<ekeâ
(b) Data Definition Library/[sše [sefheâefveMeve ueeFyeÇsjer (b) receiver /Øeehlekeâlee&
(c) sender and receiver/Øes<ekeâ Deewj Øeehlekeâlee&
(c) Data Definition Language/[sše [sefheâefveMeve ueQiJespe
(d) More than one of the above/GheÙeg&òeâ ceW mes Skeâ
(d) Dynamic Data Library/[eÙevesefcekeâ [sše ueeFyeÇsjer
DeefOekeâ
243 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
34. The user IDs can be added or removed using (c) It is a relational database that is designed for
which of the following fixed roles? query and analysis rather than for transaction
efvecveefueefKele ceW mes efkeâme efveefMÛele Yetefcekeâe keâe GheÙeesie processing./Ùen Skeâ efjuesMeveue [sšeyesme nw efpemes
keâjkesâ GheÙeesiekeâlee& DeeF&[er keâes peesÌ[e Ùee nšeÙee pee uesveosve ØemebmkeâjCe kesâ yepeeÙe keäJesjer Deewj efJeMues<eCe kesâ
mekeâlee nw? efueS ef[peeFve efkeâÙee ieÙee nw~
(a) db_sysadmin (d) They are usually in third normal form
(b) db_accessadmin Jes Deeceleewj hej leermejs meeceevÙe ™he ceW nesles nw~
(c) db_securityadmin 38. Which programming language is developed by
(d) More than one of the above/GheÙeg&keäle ceW mes Skeâ mes James Gosling?/pescme ieesefmuebie Éeje efkeâme Øees«eeefcebie
DeefOekeâ ueQwiJespe keâes efJekeâefmele efkeâÙee ieÙee?
35. What is a database?/[sšeyesme keäÙee nw? (a) ASP. Net/Ss Sme heer. vesš (b) Java/peeJee
(c) PHP/Heer SÛe heer (d) C #/meer #
(a) Organized collection of information that
39. In the field of computing, what does VRML
cannot be accessed, updated and
stand for?/keâchÙetefšbie kesâ #es$e ceW, VRML keâe DeLe&
managed/metÛevee kesâ mebieef"le meb«en lekeâ hebngÛe DeÅeleve
keäÙee neslee nw?
Deewj ØeyebOeve vener efkeâÙee pee mekeâlee nw~ (a) Visual Reality Machine Language
(b) Organized collection of data or information efJepegDeue efjSefuešer ceMeerve ueQiJespe
that can be accessed, updated and managed/ (b) Virtual Reality Machine Language
[sše Ùee metÛevee keâe mebieef"le meb«en efpemes Skeämesme Dehe[sš JeÛeg&Deue efjSefuešer ceMeerve ueQiJespe
Deewj ØeyebefOele efkeâÙee pee mekeâlee nw~ (c) Visual Reality Mark Up Language
(c) Organized collection of data that cannot be efJepegDeue efjSefuešer ceeke&â Dehe ueQiJespe
updated/Ssmes [sše keâe mebieef"le meb«en efpemes DeÅeleve (d) Virtual Reality Mark Up Language
veneR efkeâÙee pee mekeâlee nw~ JeÛeg&Deue efjSefuešer ceeke&â Dehe ueQiJespe
(d) More than one of the above/GheÙeg&keäle ceW mes Skeâ mes 40. Which element would get first deleted from the
stack?/efvecve ceW mes keâewve mee SefueceWš mšwkeâ ceW mes henues
DeefOekeâ
ef[ueerš nesiee?
36. Architecture of database management can be (a) The element in the middle of the stack
viewed as: mšwkeâ kesâ yeerÛe keâe SefueceWš
[sšeyesme ØeyevOeve keâer mebjÛevee efkeâme Øekeâej mes osKeer pee (b) Any specified element/keâesF& efveefo&<š SefueceWš
mekeâleer nw? (c) The element at the bottom of the stack
(a) Two levels /oes mlejeW mšwkeâ kesâ veerÛes keâe SefueceWš
(b) Four levels /Ûeej mlejeW hej (d) The element at the top of the stack
mšwkeâ kesâ Meer<e& keâe SefueceWš
(c) Three levels /leerve mlejeW hej
41. For which of the following non-graphic
(d) One level /Skeâ mlej hej character is escape sequence '\t' used in C++
37. Which of the following statements is NOT true language?/C++ Yee<ee cebs, efkeâme vee@ve-«eeef]heâkeâ keâwjskeäšj
with respect to data warehouses? nsleg '\t' Smkesâhe meerkeäJeWme keâe ØeÙeesie efkeâÙee peelee nw?
[sše JesÙejneGme kesâ mecyevOe ceW efvecveefueefKele ceW mes keâewve- (a) Carriage return/kewâefjpe efjšve&
mee keâLeve melÙe veneR nw? (b) Vertical tab/Ješeakeâue šwye
(a) They must put data from disparate sources (c) Horizontal tab/ne@efjpee@všue šwye
into a consistent format/GvnW Deueie-Deueie œeesleeW (d) Backslah/yewkeâmuewMe
mes [sše keâes Skeâ megmebiele Øee®he ceW jKevee ÛeeefnS~ 42. In C#, a variable name can start with
______and _______only/C# ceW, Skeâ JewefjSyeue vesce
(b) It has data that gives information about a
efmehe&â ............Deewj ...........kesâ meeLe Meg® nes mekeâlee nw,
particular subject instead of about a
(a) digit, white space character
company's ongoing operations./FmeceW [sše neslee
(b) alphabet; digit
nw pees kebâheveer kesâ Ûeue jns mebÛeeueve kesâ yepeeÙe efkeâmeer (c) alphabet; underscore
efJeMes<e efJe<eÙe kesâ yeejs ceW peevekeâejer oslee nw~ (d) underscore, digit

244 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
43. Observe the following flowchart and find the 47. What is the access specifier used to make
output. members of a class accessible only within the
efvecveefueefKele heäueesÛeeš& keâe DeJeueeskeâve keâjW Deewj Gmekeâe same package?/efkeâmeer class kesâ member keâes kesâJeue
DeeGšhegš yeleeSb~ Gmeer hewkesâpe kesâ Yeerlej ner hengBÛe ÙeesiÙe yeveeves kesâ efueS
efkeâme Skeämesme mhesefmeHeâeÙej keâe GheÙeesie efkeâÙee peelee nw?
(a) private
(b) public
(c) package-private
(d) More than one of the above
GheÙeg&òeâ ceW mes Skeâ mes DeefOekeâ
48. Which feature of OOP is indicated by the
following code?
OOP keâer keâewve-meer efJeMes<elee efvecveefueefKele keâes[ Éeje
(a) 180 (b) 120 Fbefiele keâer ieF& nw?
(c) 100 (d) 160 class student{int marks;};
44. What is the act of defining a problem; class topper: public student{int age; topper(int
determining the cause of the problem; age) {this.age=age;}};
identifying prioritising and selecting (a) Encapsulation and inheritance
alternatives for a solution; and implementing SvekewâhmeguesMeve Deewj FvensefjšWMe
an appropriate solution know as?
(b) Inheritance and polymorphism
efkeâmeer mecemÙee keâes heefjYeeef<ele keâjves, mecemÙee keâe keâejCe
JebMeeveg›eâce Deewj yeng™helee
efveOee&efjle keâjves, meceeOeeve kesâ efueS efJekeâuhees keâer henÛeeve
(c) Polymorphism/yeng™helee
keâjves, ØeeLeefcekeâlee osves Deewj ÛeÙeve keâjves; leLee Skeâ
(d) More than one of the above/GheÙeg&òeâ ceW mes Skeâ
DeefÛele meceeOeeve keâes ef›eâÙeeefvJele keâjves kesâ keâeÙe& keâes
keäÙee keâne peelee nw? DeefOekeâ
49. Which shortcut key is used to compile and run
(a) Communication skill/mebÛeej keâewMeue
the program in C++?
(b) Independence skill/mJeleb$elee keâewMeue C++ ceW Øees«eece keâes mebkeâefuele Deewj Ûeueeves kesâ efueS efkeâme
(c) Problem-solving skill/mecemÙee meceeOeeve keâewMeue Me@eš&keâš kegBâpeer keâe GheÙeesie efkeâÙee peelee nw?
(d) Leadership skill/vesle=lJe keâewMeue (a) Alt+F9
45. What will happen if in a C++ program, a class (b) Alt+F5
has no name?
(c) Ctrl+F9
Ùeefo C++ Øees«eece ceW efkeâmeer keäueeme keâe keâesF& veece veneR
(d) More than one of the above/GheÙeg&òeâ ceW mes Skeâ
nw, lees keäÙee nesiee?
DeefOekeâ
(a) It is not even allowed in C++
50. The number of access specifiers in class of C++ is
C++ ceW Yeer Fmekeâer Devegceefle veneR nw
C++ kesâ class ceW, access specifiers keâer mebKÙee nw
(b) It will not have the constructor
FmeceW kebâmš^keäšj vener nesiee (a) 2
(c) It will not have the destructor (b) 3
FmeceW efJeOJebmekeâ vener nesiee (c) 4
(d) More than one of the above/GheÙeg&keäle ceW mes Skeâ mes (d) More than one of the above
DeefOekeâ GheÙeg&òeâ ceW mes Skeâ mes DeefOekeâ
46. The programming language that has the ability 51. _______ helps in converting programming
to create new data types is called: language to machine language.
Jen Øees«eeefcebie language efpemeceW veS [sše Øekeâej yeveeves Øees«eeefce&ie Yee<ee keâes ceMeerveer Yee<ee ceW yeoueves kesâ efueÙes
keâer #ecelee nesleer nw, keânueeleer nw– GheÙeesieer nw~
(a) Overloaded (a) Operating system/Dee@hejsefšbie ØeCeeueer
(b) Encapsulated
(b) Device driver/ef[JeeFme [^eFJej
(c) Extensible
(d) More than one of the above (c) Compiler/keâcheeFuej
GheÙeg&keäle ceW mes Skeâ mes DeefOekeâ (d) Linker/efuebkeâj
245 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
52. What is the type of the expression 2+3*4? 58. Why do we need to translate an algorithm into
SkeämeØesMeve 2+3*4 keâe Øekeâej keäÙee nw? a programming code?
(a) Prefix Expression/Øeerefheâkeäme SkeämeØesMeve nceW Suieesefjoce keâes Øees«eeefcebie keâes[ ceW š^ebmeuesš keâjves keâer
(b) Infix Expression /Fefvheâkeäme SkeämeØesMeve DeeJeMÙekeâlee keäÙeeW nesleer nw?
(c) Priority Expression/ØeÙeesefjšer SkeämeØesMeve (a) So it can be made into a story
(d) Postfix Expression /heesmšefheâkeäme SkeämeØesMeve leeefkeâ Ùen mšesjer ceW yeve mekesâ
53. Which among the following is/are benefits of
(b) So a computer can understand it
flowchart?/efvecveefueefKele ceW mes keâewve heäueesÛeeš& kesâ
ueeYe nw/nQ leeefkeâ kebâhÙetšj Fmes mecePe mekeWâ
A. Makes Communication Better (c) So it can be converted in to a flowchart/
mebÛeej keâes yesnlej yeveelee nw leeefkeâ Ùen HeäueesÛeeš& ceW heefjJeefle&le nes mekesâ
B. Effective Analysis/ØeYeeJeer efJeMues<eCe (d) So it can be converted back to algorithm again
C. Simplifies the Logic/leke&â keâes mejue keâjlee nw leeefkeâ Ùen efHeâj mes Suieesefjoce ceW heefjJeefle&le nes mekesâ
(a) Both C and B/C Deewj B oesveeW 59. Error in program is called:
(b) Both A and C/A Deewj C oesveeW Øees«eece ceW $egefš keâes keäÙee keâne peelee nw?
(c) Both A and B/A Deewj B oesveeW
(a) Bug/yeie (b) Debug/[eryeie
(d) All of the options/FveceW mes meYeer
54. What name is given to a program in execution? (c) Virus/JeeÙejme (d) Noise/vee@Fme
efve<heeove ceW Øees«eece keâes keäÙee veece efoÙee peelee nw? 60. Direct X is a :
(a) Process/Øeesmesme (b) Data Load/[sše uees[ [eÙejskeäš X Skeâ :
(c) Program/Øees«eece (d) Mutex/cÙetšskeäme (a) Computer part/mebieCekeâ keâe Yeeie nw~
55. Modern computers follow a set of instructions (b) a user interface/Skeâ ØeÙeesòeâe Fbšjhesâme nw~
to perform any task. These instructions can be
better known as./DeeOegefvekeâ keâchÙetšj efkeâmeer Yeer keâeÙe& (c) operating system/ØeÛeeueve ØeefJeefOe nw~
keâes keâjves kesâ efueS efveoxMeeW kesâ Skeâ mecetn keâe heeueve (d) software that drives graphic software mee@heäšJesÙej
keâjles nQ~ Fve efveoxMeeW keâes meeceevÙele: keäÙee keâne peelee nw? nw pees efkeâ «ee@efheâkeâ mee@heäšJesÙej keâe mebÛeeueve keâjlee nw
(a) Commands /keâceeb[dme 61. The legal right to use a software based on
(b) Programs /Øees«eecme specific restrictions is granted via ________.
(c) Language /ueQiJespe mee@heäšJesÙej Fmlesceeue keâjves keâe keâevetveer DeefOekeâej pees efkeâ
(d) Guidelines /ieeF[ueeFvme
kegâÚ yebOeve hej DeeOeeefjle nw ____ Éeje efoÙee peelee nw~
56. heeFLeve Øees«eeefcebie ueQiJespe kesâ yeejs ceW efvecveefueefKele ceW mes
keâewve mee/mes keâLeve mener nw/nQ? (a) Software privacy policy/mee@heäšJesÙej ieesheveerÙelee
(i) Ùen OOP keâe@vmes° keâes meheesš& keâjlee nw~ veerefle
(ii) Ùen Skeâ uees uesJeue (low level) Øees«eeefcebie Yee<ee nw~ (b) Software licence/mee@heäšJesÙej ueeFmeWme
(a) ve lees (i) Deewj ve ner (ii) (c) Software Ltd. Policy/mee@heäJesÙej efueefcešs[ veerefle
(b) (i) Deewj (ii) oesveeW (d) Software guide/mee@heäJesÙej ieeF&[
(c) kesâJeue (ii)
62. In a computer, the utility programs and
(d) kesâJeue (i) operating systems are the examples of ______.
57. Which of the following statements is correct
about the class?
kebâhÙetšj ceW Ùetefšefuešer Øees«eece Deewj Dee@hejsefšbie efmemšce --
Class kesâ yeejs ceW, efvecveefueefKele ceW mes keâewve-mee keâLeve - kesâ GoenjCe nQ~
mener nw? (a) programming languages/Øees«eeefcebie ueQiJeWpe
(a) An object is an instance of its class. (b) system software/efmemšce mee@heäšJesÙej
Skeâ Jemleg Deheves Jeie& keâe Skeâ GoenjCe nw~
(c) application software/SeqhuekesâMeve mee@heäšJesÙej
(b) A class is an instance of its object.
Skeâ Jeie& Deheveer Jemleg keâe Skeâ GoenjCe nw~ (d) customised software/keâmšceeFp[ mee@heäšJesÙej
(c) An object is the instance of the data type of 63. efvecveefueefKele ceW mes keâewve mee Skeâ Dee@veueeFve Ûewš
that class./Skeâ Dee@ypeskeäš Gme Jeie& kesâ [sše Øekeâej keâe mee@heäšJesÙej veneR nw?
GoenjCe nw~
(a) Fbšjvesš efjues Ûewš (b) ietieue še@keâ
(d) More than one of the above/GheÙeg&òeâ ceW mes Skeâ
DeefOekeâ (c) muewkeâ (d) S[yuÙetSme

246 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
64. Select the true statement for compiler. (a) Paging
Compiler kesâ efueS melÙe keâLeve keâe ÛeÙeve keâerefpeS~ (b) Overlays
(a) The input of the compiler is source program. (c) Segmentation
(b) It translates the source code into object code (d) More than one of the above
as a whole. 69. Which of the following is NOT a function of an
(c) The output of the compiler is object code. operating system?/ efvecveefueefKele ceW mes keâewve-mee Skeâ
(d) More than one of the above/GheÙeg&òeâ ceW mes Skeâ Dee@hejsefšbie efmemšce keâe keâeÙe& veneR nw?
DeefOekeâ (a) Security/megj#ee
65. ...........involves traversing the entire file system,
(b) Memory management/cesceesjer cewvespeceWš
marking everything that can be accessed.
efvecveefueefKele ceW mes efkeâmeceW, pees Yeer HeâeFue/Heâesu[j (c) File management/heâeFue cewvespeceWš
Skeämesme efkeâÙee pee mekeâlee nw Gmes ceeke&â keâjles ngS, hetjs (d) Control over user performance
HeâeFue efmemšce mes iegpejvee heÌ[lee nw? GheÙeesiekeâlee& kesâ ØeoMe&ve hej efveÙeb$eCe
(a) Index pointer/Fb[skeäme hee@Fbšj 70. Which of the following is NOT a memory
management technique used by operating
(b) Garbage collection/keâÛeje Skeâef$ekeâjCe
systems?/efvecveefueefKele ceW mes keâewve-meer Dee@hejseEšie
(c) File system/HeâeFue efmemšce
efmemšce Éeje GheÙeesie keâer peeves Jeeueer cesceesjer ØeyebOeve
(d) Stack pointer/mšwkeâ hee@Fbšj
lekeâveerkeâ veneR nw?
66. If a computer has more than one processor
then it is known as- (a) Paging/heseEpeie
Ùeefo keâchÙetšj ceW Skeâ mes DeefOekeâ Øeesmesmej nQ lees Fmes (b) Segmentation/efJeYeepeve
______kesâ ™he ceW peevee peelee nw~ (c) Fragmentation/efJeKeb[ve
(a) Uniprocessor/ÙetveerØeesmesmej (d) More than one of the above/GheÙeg&òeâ ceW mes Skeâ mes
(b) Multiprocessor/ceušerØeesmesmej DeefOekeâ
(c) Multithreaded/ceušerLeÇs[s[ 71. The purpose of the program counter register is
(d) Multiprogramming/ceušerØees«eeefcebie to/Øees«eece keâeGbšj jefpemšj keâe GösMÙe nw~
(a) keep a count of the number of executing
67. Which of the following statements about an
programs
operating system is FALSE?
efvecveefueefKele ceW mes keâewve mee keâLeve Dee@hejsefšbie efmemšce efve<heeefole keâeÙe&›eâceeW keâer mebKÙee keâer ieCevee keâjvee
(b) hold the address of the next instruction
kesâ yeejs ceW ieuele nw? Deieues efveoxMe keâe helee jKevee
(a) It ensures that computer system components (c) keep a count of the control registers
like hard disk and RAM never crash or
malfunction.
efveÙeb$eCe jefpemšjeW keâer efieveleer jKevee
(d) hold the current executing instruction
Ùen megefveef§ele keâjlee nw efkeâ ne[&ef[mkeâ Deewj jwce pewmes
Jele&ceeve efve<heeove efveoxMe keâes nesu[ keâjvee
keâchÙetšj efmemšce Ieškeâ keâYeer Yeer ›ewâMe Ùee Kejeye ve nes~
72. efvecve ceW mes keâewve Skeâ Øees«eeefcebie mee@heäšJesÙej nw?
(b) It works as a resource manager.
(a) ef[mkeâ keäueerveDehe (b) efJeb[espe
Ùen Skeâ efjmeesme& cewvespej kesâ ™he ceW keâeÙe& keâjlee nw~
(c) ef[mkeâ [søesâieÇceWšj (d) efJe]pegDeue yesefmekeâ
(c) It provides efficient and fair sharing of
hardware resources among users and or 73. Software patch is defined as _____
programs. mee@HeäšJesÙej hewÛe keâes _____ kesâ ™he ceW heefjYeeef<ele efkeâÙee
Ùen GheÙeesiekeâlee&DeeW Deewj Ùee Øees«eece kesâ yeerÛe ieÙee nw
ne[&JesÙej efjmeesmexme keâe kegâMeue Deewj efve<he#e (a) Daily or routine Fix
meePeekeâjCe Øeoeve keâjlee nw~ (b) Required or Critical Fix
(d) It hides details of hardware resources from (c) Emergency Fix
programmers and other users. (d) More than one of the above
Øees«eecej Deewj DevÙe GheÙeesiekeâlee&DeeW mes ne[&JesÙej mebmeeOeveeW 74. Which of the following is a software
keâe efJeJejCe Úgheelee nw~ development life cycle model?/efvecveefueefKele ceW mes
68. _______method is used to map logical keâewve-mee mee@HeäšJesÙej efJekeâeme peerJeve Ûe›eâ cee@[ue nw?
addresses of variable length onto physical (a) Waterfall model/Pejvee cee@[ue
memory. (b) Agile model/SpeeFue cee@[ue
_______ efJeefOe keâe GheÙeesie Yeeweflekeâ mce=efle hej Ûej (c) Spiral model/mee|heue cee@[ue
uecyeeF& kesâ leeefke&âkeâ heles keâes cewhe keâjves kesâ efueS efkeâÙee (d) More than one of the above/GheÙeg&òeâ ceW mes Skeâ mes
peelee nw~ DeefOekeâ
247 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
75. How do you cancel the print jobs which are in (a) Input unit/Fvehegš Ùetefveš
queue in windows?/efJeb[es]pe ceW keäÙet ceW heÌ[s efØebš (b) System bus /efmemšce yeme
keâeÙeeX keâes Deehe kewâmes jö keâjles nQ? (c) ALU /S.Sue.Ùet. (ALU)
(a) Double click the printer icon and highlight (d) Primary memory /ØeeLeefcekeâ cesceesjer
the print job you want to cancel > right click
and select cancel 82. "For computer, world consists of zeros and
efØebšj DeeFkeâve hej [yeue efkeäuekeâ keâjW Deewj Gme efØebš ones only. To store the zeros and ones,........... is
placed inside a processor:
keâeÙe& keâes neFueeFš keâjW efpemes Deehe jö keâjvee Ûeenles nQ keâchÙetšj keâer ogefveÙee MetvÙe Deewj Skeâ mes efveefce&le nw~ Fve
> jeFš efkeäuekeâ keâjW Deewj keQâefmeue keâe ÛeÙeve keâjW
(b) Once in the print queue, you cannot cancel
MetvÙe Deewj Skeâ keâes Yeb[eefjle keâjves kesâ efueS Øeesmesmej kesâ
the print jobs/Skeâ yeej efØebš keäÙet ceW Deeves peeves hej, Deboj..............ueieeÙee peelee nw~
Deehe efØebš keâeÙeeX keâes jö veneR keâj mekeâles nQ (a) I/O device/Ùegefòeâ I/O
(c) The printer must be restarted (b) Instruction set/efveoxMe mecetn
efØebšj keâes hegve: Ûeeuet keâjvee nesiee (c) Transistor/š^ebefpemšj
(d) Disconnect the printer cable (d) Main Memory/cegKÙe mce=efle
efØebš kesâJeue nše keâj Deueie keâj oW 83. Which of the following are the two valid types
76. Ctrl, shift and alt are called of Instruction Set Architectures?
Ctrl, Shift Deewj Alt keânueeles nQ efvecveefueefKele ceW mes keâewve mes Fbmš^keäMeve mesš Deeefke&âšskeäÛej
(a) Adjustment keys/S[pemšceQš keâerpe kesâ oes ceevÙe Øekeâej nw?
(b) Function keys/hebâkeäMeve keâerpe (a) CISK and RISK/CISK Deewj RISK
(c) Modifier keys/cee@[erheâeÙej keâerpe (b) CISC and RISC/CISC Deewj RISC
(d) Alphanumeric keys/SuheâevÙetcewefjkeâ keâerpe (c) CISC and RISK/CISC Deewj RISK
77. efvecveefueefKele ceW mes keâewve Skeâ 2018 ceW mLeeefhele Yeejle (d) CISS and RISS/CISS Deewj RISS
keâe meyemes lespe meghej keâchÙetšj nw? 84. The most common addressing technique
(a) DeeefolÙe (b) men<e& T employed by a CPU is
(c) TIFR - Cray XC30 (d) ØelÙet<e CPU Éeje efveÙeesefpele meyemes Deece Ss[^sefmebie lekeâveerkeâ nw
78. Arithmometer was invented by/DeefjLeceesceeršj (a) direct
keâe...........Éeje DeeefJe<keâej efkeâÙee ieÙee Lee~ (b) indirect
(a) Evanglista Torricelli/ SJeebiesefuemlee šesjermesueer (c) immediate
(b) Charles Xavier Thomas/Ûeeume& pesefJeÙej Lee@ceme (d) More than one of the above/GheÙeg&òeâ ceW mes Skeâ
(c) Edward Teller/S[Je[& šsuej DeefOekeâ
85. Which of the following is designed to provide
(d) Gustav Tauschek/iegmleeJe leeGMeskeâ
high scalability and fault tolerance, including
79. A microprocessor is made of millions of: automatic data replication?
Skeâ ceeF›eâesØeesmesmej ome ueeKe (efceefueÙeve) ............. mes efvecveefueefKele ceW mes keâewve-mee mJeÛeeefuele [sše Øeefleke=âefle
efveefce&le neslee nw~ meefnle GÛÛe mkesâuesefyeefuešer Deewj oes<e menveMeeruelee Øeoeve
(a) Registers/jefpemšme& keâjves kesâ efueS ef[peeFve efkeâÙee ieÙee nw?
(b) Transistors/š^ebefpemšme& (a) HDFS/SÛe[erSheâSme
(c) Microchips/ceeF›eâesefÛehme (b) DAS (Direct Attached Storages)/[erSSme
(d) Program counter/Øees«eece keâeGbšj ([eÙejskeäš DešwÛ[ mšesjspe)
80. What was the first university based attempt to (c) NAS (Network - Attached Storage)/SveSSme
build a computer?
(vesšJeke&â-DešwÛ[ mšesjspe)
kebâhÙetšj yeveeves keâe henuee efJeÕeefJeÅeeueÙe-DeeOeeefjle
(d) Local File System/ueeskeâue heâeFue efmemšce
ØeÙeeme keäÙee Lee?
86. Which among the following is/are types of
(a) Stanford University/mšwveheâes[& efJeÕeefJeÅeeueÙe microcontrollers in embedded system?
(b) Harvard University/neJe&[& efJeÕeefJeÅeeueÙe efvecveefueefKele ceW mes keâewve-mee/mes Scyes[s[ efmemšce ceW
(c) Iowa State University/DeeÙeesJee mšsš efJeÕeefJeÅeeueÙe ceeF›eâeskebâš^esuej kesâ Øekeâej nQ?
(d) University of Pennsylvania A. ARM microcontroller/ARM ceeF›eâeskebâš^esuej
hesveefmeuJesefveÙee efJeÕeefJeÅeeueÙe B. MRP microcontroller/MRP ceeF›eâeskebâš^esuej
81. What resides on the motherboard and connects
(a) Neither A nor B/ve lees A Deewj ve ner B
the CPU to the other components on the
motherboard ? (b) Only B/kesâJeue B
ceojyees[& ceW Jen keäÙee neslee nw pees meerheerÙet keâes ceojyees[& (c) Only A/kesâJeue A
kesâ DevÙe IeškeâeW mes peesÌ[lee nw? (d) Both A and B/A Deewj B oesveeW
248 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
87. Which of the following has the smallest storage 94. What kind of codes does K-maps adjacent cells
capacity ? hold?
efvecveefueefKele ceW mes efkeâmeceW meyemes keâce Yeb[ejCe #ecelee K-cewhme kesâ DeemeVe mesueeW ceW efkeâme Øekeâej kesâ keâes[ nesles
nesleer nw ? nQ?
(a) Zip disk/efpehe ef[mkeâ (a) Plane binary /huesve yeeFvejer
(b) Hard disk/ne[& ef[mkeâ (b) Hamming code /nwefcebie keâes[
(c) Floppy disk/heäuee@heer ef[mkeâ (c) Cyclic Redundancy Code (CRC)
(d) Data cartridge/[eše keâeefš&pe meeFefkeäuekeâ efj[b[Wmeer keâes[(CRC)
88. 10 nibbles are equal to _________ bits. (d) Gray code /«es keâes[
10 efveyeume ............. efyeš kesâ yejeyej neslee nw~ -
95. In Boolean algebra (A . A ) + A = ?
(a) 60 (b) 80
-
(c) 20 (d) 40 yetefueÙeve yeerpeieefCele ceW (A . A ) + A = ? keâe ceeve %eele
89. Which of the following is an example of keâerefpeS?
Electrically-Erasable Programmable Read-Only
Memory?/efvecve ceW mes keâewve Fueskeäš^erkeâueer Fjspesyeue (a) 0 (b) 1
Øees«eecesyeue jer[ Deesveueer cesceesjer keâe Skeâ GoenjCe nw? (c) A (d) A
(a) Flange/heäueWpe (b) Fury/heäÙetjer 96. The expression Y=AB+BC+AC shows the
_____ operation.
(c) Flash/heäuewMe (d) FRAM/SheâDeejSSce
DeefYeJÙeefòeâ Y=AB+BC+AC_______ Dee@hejsMeve keâes
90. Which type of memory is mainly used to
synchronise with a high-speed CPU and to oMee&leer nw~
improve its performance? (a) EX-OR
neF&-mheer[ meerheerÙet kesâ meeLe efmeb›eâesveeFpe keâjves Deewj (b) SOP
Fmekesâ ØeoMe&ve keâes yesnlej yeveeves kesâ efueS cegKÙe ™he mes (c) POS/j
efkeâme Øekeâej keâer cesceesjer keâe GheÙeesie efkeâÙee peelee nw? (d) More than one of the above/GheÙeg&òeâ ceW mes Skeâ
(a) Tertiary memory/šsjefšSjer cesceesjer DeefOekeâ
(b) Cache memory/kewâMe cesceesjer 97. Which gate has the output low, only when both
the inputs are high?
(c) Secondary memory/meskebsâ[jer cesceesjer oesveeW Fvehegšdme kesâ GÛÛe nesves kesâ yeeo Yeer efkeâme iesš keâe
(d) Primary memory/ØeeFcejer cesceesjer DeeGšhegš efvecve nesiee?
91. A plug and play storage device that simply (a) NOR (b) OR
plugs in the port of a computer is : (c) NAND (d) AND
Skeâ plug Deewj play mšesjs]pe ef[JeeFme pees efkeâ kebâhÙetšj 98. efvecveefueefKele ceW mes efkeâmes ÙetefveJeme&ue iesš keâne peelee nw~
kesâ heesš& ceW Deemeeveer mes ueieeÙee peelee nw~ (a) NAND (b) AND
(a) Flash drive/heäuewMe [^eFJe (c) XOR (d) OR
(b) Compact disk/keâe@cheskeäš ef[mkeâ 99. Identify the Boolean expression from the given
(c) Hard disk/ne[& ef[mkeâ options, which is equivalent to the Logic
(d) Digital Versatile Disk/ef[efpešue JemexšeFue ef[mkeâ Circuit Diagram.
efoS ieS efJekeâuheeW ceW mes Gme yetueerÙe JÙebpekeâ (Boolean
92. efvecveefueefKele ceW mes keâewve-mee CPU keâe Skeâ Fbšer«esšs[ expression) keâer henÛeeve keâerefpeS, pees uee@efpekeâ meefke&âš
kebâheesveWš nw Deewj meeceevÙele: Øees«eece efve<heeove kesâ oewjeve [eÙe«eece (Logic Circuit Diagram) kesâ meceleguÙe nesŠ
[eše Deewj S[^sme keâes mšesj keâjves kesâ efueS GheÙeesie efkeâÙee
peelee nw?
(a) Arithmetic logic unit/DeLe&cesefškeâ uee@efpekeâ Ùetefveš
(b) Register/jefpemšj
(c) Control unit/kebâš^esue Ùetefveš (a) (A + B').C' + D (b) A.B' + C'.D
(d) Secondary memory/meskeWâ[jer cesceesjer (c) A+B'.C'+D (d) (A.B' + C').D
93. The cost of storing a bit is minimum in 100. Which of the following logic gates is called
Skeâ efyeš keâes mšesj keâjves keâe vÙetvelece KeÛe& ______ ceW universal gate?
neslee nw~ efvecveebefkeâle ceW mes keâewve-mee uee@efpekeâ iesš, ÙetefveJeme&ue iesš
(a) cache/kewâMe
keânueelee nw?
(a) AND
(b) register/jefpemšj (b) OR
(c) magnetic tape/cewivesefškeâ šshe (c) NAND
(d) More than one of the above/GheÙeg&òeâ ceW mes Skeâ mes (d) More than one of the above/GheÙeg&òeâ ceW mes Skeâ mes
DeefOekeâ DeefOekeâ
249 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
 SOLUTION : PRACTICE SET- 10
ANSWER KEY
1. (c) 11. (a) 21. (c) 31. (b) 41. (c) 51. (c) 61. (b) 71. (b) 81. (b) 91. (a)
2. (a) 12. (d) 22. (c) 32. (b) 42. (c) 52. (b) 62. (b) 72. (d) 82. (c) 92. (b)
3. (b) 13. (d) 23. (a) 33. (b) 43. (a) 53. (d) 63. (d) 73. (c) 83. (b) 93. (c)
4. (d) 14. (b) 24. (c) 34. (b) 44. (c) 54. (a) 64. (d) 74. (d) 84. (d) 94. (d)
5. (c) 15. (a) 25. (d) 35. (b) 45. (c) 55. (b) 65. (b) 75. (a) 85. (a) 95. (c)
6. (a) 16. (b) 26. (d) 36. (c) 46. (c) 56. (d) 66. (b) 76. (c) 86. (c) 96. (b)
7. (c) 17. (c) 27. (d) 37. (d) 47. (c) 57. (a) 67. (a) 77. (d) 87. (c) 97. (c)
8. (a) 18. (c) 28. (c) 38. (b) 48. (a) 58. (c) 68. (c) 78. (b) 88. (d) 98. (a)
9. (b) 19. (b) 29. (d) 39. (d) 49. (c) 59. (a) 69. (d) 79. (b) 89. (c) 99. (a)
10. (a) 20. (c) 30. (c) 40. (d) 50. (b) 60. (d) 70. (c) 80. (c) 90. (b) 100. (c)
SOLUTION
1. (c) 8. (a)
heâpeer uee@efpekeâ yeng cetuÙeJeeve leke&â keâe Skeâ ™he nw efpemeceW Ûej keâe ceeefmmecees yebpeer Dee[t&Fvees Øeespeskeäš (Arduino Project) kesâ men-
melÙe ceeve 0 Deewj 1 kesâ yeerÛe keâesF& Yeer JeemleefJekeâ mebKÙee nes mebmLeehekeâes ceW mes Skeâ nQ~
mekeâleer nw~ Arduino Skeâ Deesheve-meesme& Fueskeäš^e@efvekeäme huesšHeâece& nw pees GheÙeesie
2. (a) ceW Demeeveer ne[&JesÙej Deewj mee@HeäšJesÙej hej DeeOeeefjle nw~
Receiver Operating Characteristic curve (ROC curve), 9. (b)
Skeâ «eeefheâkeâue huee@š nw pees yeeFvejer keäueeefmeheâeÙej efmemšce keâer [smkeâše@he keâchÙetšj Skeâ heejbheefjkeâ keâchÙetefšbie ef[JeeFme nw efpemekeâe
vewoeefvekeâ #ecelee keâes efoKeelee nw~ keäÙeeWefkeâ Fmekeâer YesoYeeJe meercee efJeefJeOe GheÙeesie cegKÙe ™he mes Fbšjvesš yeÇeGefpebie, SefhuekesâMeve Ûeueeves Deewj
nw~ iesefcebie pewmes keâeÙeeX kesâ efueS efkeâÙee peelee nw~ FmeceW DevÙe ef[JeeFme kesâ
3. (b) meeLe mJeeÙelle ™he mes [sše meePee keâjves kesâ efueS ef[peeFve efkeâS ieS
(LISP-List Processing) Fmekeâe efJekeâeme 1959 ceW pee@ve cewkeâeLeea meceeve Øekeâej kesâ meWmej Ùee keâvesefkeäšefJešer megefJeOeeSB veneR nw~
Éeje Deeefš&efHeâefMeÙeue FbšsefuepeWme kesâ GheÙeesie kesâ efueS efkeâÙee ieÙee~ Ùen 10. (a)
HebâkeäMeveue Øees«eeefcebie ueQiJespe nw~ Fmekeâe GheÙeesie iewj meebefKÙekeâer [eše <p align = "left" > final examination </p> ceW align
kesâ Øeesmesefmebie kesâ efueS efkeâÙee peelee nw~ Sefš^yÙetš nw Deewj left Fmekeâe ceeve nw~ align Sefš^yÙetš keâe GheÙeesie
4. (d) šskeämš kebâšsvš keâes mebjsefKele (align) keâjves kesâ efueS neslee nw~
NLP ke=âef$ece yegefæceòee (Artificial Intelligence) keâe Skeâ Ieškeâ 11. (a)
(Component) nw efpemekeâe hetCe& ¤he Natural Language MIDI keâe hetje veece cÙetefpekeâue FbmšÍceWš ef[efpešue Fbšjhesâme nw~
Processing neslee nw~ Ùen ceeveJe Éeje mecePeves, yeesueves Je efueKeves ef[efpešue FbmšÍceWš [sše š^ebmeefceš keâjves kesâ efueS Skeâ keâvesefkeäšefJešer
keâes mecePeves Jeeuee keâchÙetšj keâe Skeâ Øees«eece nw efpemes Øeeke=âeflekeâ Yee<ee ceevekeâ nw~
(Natural Language) keâne peelee nw~ 12. (d)
5. (c) .aiff (Audio interchange file format) Skeâ JewOe Dee@ef[Ùees
IoT ef[JeeFmeeW ceW JeeÙejuesme keâveskeäMeve kesâ efueS [sše efuebkeâ uesÙej heâeFue heâe@cexš nw peyeefkeâ .vob, .flv Deewj .png Dee@ef[Ùees heâeFue
(Data link layer) keâe GheÙeesie efkeâÙee peelee nw~ Ùen uesÙej Yeeweflekeâ heâe@cexš vener nw~
JeeÙejuesme ÛewveueeW kesâ ceeOÙece mes mebÛeej keâer Øeesšeskeâe@ue Deewj lekeâveerkeâeW 13. (d)
keâes mebYeeueleer nw~ keâchÙetšj ÚefJe Øee™he kesâ mecyevOe ceW heer.Sve.peer. (PNG) keâe hetCe& ™he
6. (a) heesšxyeue vesšJeke&â «eeefheâkeäme neslee nw~
Fbšjvesš Dee@heâ efLebime (IoT) kesâ efJeefYeVe GÅeesieeW ceW keâF& DevegØeÙeesie nw, 14. (b)
efpeveceW mceeš& nesce, mceeš& efmešer, mceeš& ef«e[, Smesš š^wefkebâie, mceeš& F& - keâeceme& keâe oÙeje F&-efyepevesme Ùee ef[efpešue efyepevesme keâer leguevee ceW
hueie Deeefo Meeefceue nw, peyeefkeâ Dee[t&Fvees (Arduino) Skeâ Deesheve- Meb k eâje (Narrower) F&-keâeceme& kesâJeue Dee@veueeFve efye›eâer Deewj Kejero
meesme& Fueskeäš^e@efvekeäme huesšheâe@ce& nw efpemeceW ne[&JesÙej Deewj mee@heäšJesÙej hej keWâefõle nw,peyeefkeâ F&-efyepevesme FmeceW DevÙe Dee@veueeFve JÙeeheeefjkeâ
oesveeW Ieškeâ Meeefceue nw~ ieefleefJeefOeÙeeb Yeer Meeefceue nesleer nQ pewmes efkeâ efJeheCeve, «eenkeâ, meneÙelee,
7. (c) Deewj Deebleefjkeâ JÙeeheeefjkeâ Øeef›eâÙeeSB~
ØecegKe meceÙe ØeyebOeve keâewMeueeW ceW mes efJeuecyeve (Procrastination) 15. (a)
meceÙe ØeyebOeve keâe keâewMeue veneR nw, yeefukeâ Ùen meceÙe ØeyebOeve ceW yeeOee mhewce mes leelheÙe& yeÌ[er cee$ee ceW DeØeehÙe Ùee DeJeebefÚle mebosMeeW keâes Yespeves
[eueves Jeeuee Skeâ vekeâejelcekeâ JÙeJenej nQ yeekeâer efJekeâuhe, pewmes ue#Ùe kesâ efueS Fueskeäš^e@efvekeâ cewmesefpebie efmemšce kesâ GheÙeesie mes nw~ Fmekeâes
efveOee&jCe, kegâMee«elee Deewj efveÙeespeve, meceÙe ØeyebOeve kesâ cenlJehetCe& Yespeves JeeueeW keâes mhewcej keâne peelee nw~ mhewcej Jesye meeFšeW ceW F&-cesue
keâewMeue nw~ S[^sme Keespeves kesâ efueS efJeefYeVe štume keâe GheÙeesie keâjles nw~
250 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
16. (b) 23. (a)
SEO keâe DeLe& nw meÛe& Fbpeve Dee@efhšceeFpesMeve nw, Deewj Ùen Jen F&Lejvesš keâe[& Skeâ Ssmee vesšJeke&â S[e@hšj nw, efpemekeâe GheÙeesie JeeÙe[&&
Øeef›eâÙee nw efpemekeâe GheÙeesie efkeâmeer JesyemeeFš keâer lekeâveerkeâer vesšJeke&â keâes mLeeefhele (Install) keâjves kesâ efueS efkeâÙee peelee nw~ Fmes
keâe@efvheâiejsMeve meece«eer Øeemebefiekeâlee Deewj efuebkeâ ueeskeâefØeÙelee keâes vesšJeke&â FbšjHeâsme keâe[& (NIC) kesâ ™he ceW Yeer peevee peelee nw~
Devegkegâefuele keâjves kesâ efueS efkeâÙee peelee nw~ 24. (c)
17. (c) keâchÙetšj vesšJeke&â ceW MAC (Media Access Control) S[^sme keâe
kebâhÙetšj Deewj keâer yees[& keâer yeerÛe mebÛeej efmechueskeäme (Simplex) neslee meeFpe 48 efyeš neslee nw~ Fmekeâe DeLe& nw efkeâ MAC address keâes
nw keäÙeeWefkeâ [sše kesâJeue Skeâ efoMee ceW yenlee nw~ keâeryees[& kebâhÙetšj keâes Deeceleewj hej 12 nskeämee[sefmeceue vecyeme& (DeLee&led 6 yeeFšdme) kesâ ™he
kebgâpeerhešue mš^eskeâ Yespelee nw, uesefkeâve kebâhÙetšj keâer yees[& keâes [sše Jeeheme ceW efueKee peelee nw, pewmes efkeâ
00: 1A:2B:3C:4D:5E
veneR Yespelee~
25. (d)
18. (c)
mewšsueeFš (Satelite) Skeâ ceMeerve nesleer nw efpemes ceeveJe kesâ Éeje
JeeF[ SefjÙee vesšJeke&â (WAN) Éeje ATM, SONET Deewj Frame Debleefj#e ceW he=LJeer keâer keâ#ee ceW mLeeefhele efkeâÙee peelee nw pees efyevee ™kesâ
Relay pewmeer lekeâveerkeâeW keâe GheÙeesie efkeâÙee peelee nw~
ÛeejeW Deesj Ûekeäkeâj ueieeleer nw~ mewšsueeFš keâe GheÙeesie keâcÙegefvekesâMevme,
øesâce efjues Skeâ ceevekeâerke=âle JeeF[ SefjÙee vesšJeke&â (WAN) lekeâveerkeâ nw vesšJeefkeËâie, yeÇe@[keâeefmšbie Deewj DevÙe keâeceeW kesâ efueS Yeer efkeâÙee peelee
pees Skeâ hewkesâš efmJeefÛebie heæefle keâe GheÙeesie keâjkesâ ef[efpešue otjmebÛeej nw~ mewšsueeFš vesšJeke&â yengle meejs veesšdme mes efceuekeâj yevee neslee nw pees
ÛewveueeW keâer Yeeweflekeâ Deewj [sše efuebkeâ hejleeW keâes efveoea° keâjleer nw~ he=LJeer hej Skeâ hJeeFbšdme mes otmejs hJeeFbšdme hej mebÛeej keâer megefJeOee
Jewve (WAN) lekeâveerkeâ, Sefmeb›eâesveme š^ebmeHeâj cees[ (ATM) Skeâ Øeoeve keâjlee nw~ Ùen Fbšjvesš Skeämesme efJeefOe ceW Skeâ yeÌ[e mesšDehe,
š^ebmeHeâj cees[ nw~ efmJeefÛebie Deewj š^ebmeefceMeve kesâ efueS pees Megukeâ SJeb cenbies GhekeâjCe Meeefceue nw~
kegâMeueleehetJe&keâ Deewj ueÛeerues {bie mes peevekeâejer keâes mesume (Cells) ceW 26. (d)
JÙeJeefmLele keâjlee nw~ DeveieeF[s[ š^ebmeefceMeve ceere[f Ùee ceW DeJejòeâ (Infrared) keâe GheÙeesie
efmeb›eâesveme Dee@efhškeâue vesšJeefkeËâie (SONET) Skeâ ceevekeâerke=âle efkeâÙee peelee nw~ DeveieeF[s[ š^ebmeefceMeve ceeref[Ùee Jen ceeOÙece nw efpemeceW
ef[efpešue mebÛeej Øeesšeskeâe@ue nw efpemekeâe GheÙeesie HeâeFyej Dee@efhškeâ [sše keâes š^ebmeefceš keâjves kesâ efueS keâesF& efheâefpekeâue ceeOÙece (pewmes
ceeOÙece mes uebyeer otjer hej yeÌ[er cee$ee ceW [sše mebÛeeefuele keâjves kesâ efueS kesâyeue) veneR neslee~ FmeceW [sše keâes Jee@Ùejuesme ™he ceW Yespee peelee nw~
efkeâÙee peelee nw~ 27. (d)
mebosMe keâer DeKeb[lee keâes melÙeeheve kesâ efueS meyemes GheÙegòeâ lekeâveerkeâ
19. (b)
‘‘cewmespe [eFpesmš’’ nw~ cewmespe [eFpesmš Skeâ nwMe JewuÙet GlheVe keâjlee
vesšJeke&â uesÙej keâe cegKÙe keâeÙe& hewkesâš ™efšbie Deewj S[^sefmebie neslee nw~
nw pees mebosMe kesâ mechetCe& [sše keâe meejebMe neslee nw~ Ùeefo mebosMe ceW
peye [sše hewkesâš Skeâ vesšJeke&â mes otmejs vesšJeke&â ceW Ùee$ee keâjlee nw~ lees
keâesF& Yeerr heefjJele&ve neslee nw lees GlheVe nwMe JewuÙet yeoue peeSieer, efpememes
Ùen vesšJeke&â uesÙej kesâ Éeje ™š efkeâÙee peelee nw~ vesšJeke&â uesÙej ceW IP Øeehlekeâlee& Ùen megefveef§ele keâj mekeâlee nw efkeâ mebosMe ceW keâesF& ÚsÌ[ÚeÌ[
Deewj DevÙe Øeesšeskeâe@ue nesles nQ pees hewkesâš keâes mener iebleJÙe lekeâ hengBÛeeves veneR ngF& nw~
kesâ efueS ceeie& efveOee&jCe keâe keâece keâjles nw~ Ùen uesÙej Skeâ meesme& mes 28. (c)
iebleJÙe lekeâ kesâ jemles keâe efveOee&jCe keâjleer nw Deewj Fme keâeÙe& ceW jeGšj SQL kesâ meboYe& ceW, [sše [sefheâefveMeve Ùee [sše efJeJejCe ueQiJespe
keâer meneÙelee neslee nw~ (DDL) [sšeyesme Dee@ypeskeäš pewmes- šsyeue, Fb[skeäme Deewj
20. (c) GheÙeesiekeâlee&DeeW keâes yeveeves Deewj mebMeeseOf ele keâjves kesâ efueS Skeâ efmebšwkeäme
IPv4 ceW, IP S[^sme keâe meeFme 32 efyeš neslee nw~ efpemes Deeceleewj hej nw~ DDL mšsšceWš [sše mebjÛeveeDeeW keâes heefjYeeef<ele keâjves kesâ efueS
oMeceueJe vecyej kesâ ™he ceW efueKee peelee nw~ Ùen 4 yeeFš kesâ yeeFvejer keâchÙetšj Øees«eeefcebie ueQiJespe kesâ meceeve nw, efJeMes<e ™he mes [sšeyesme
vecyej keâe ØeefleefveefOelJe keâjlee nw~ pewmes 192 .166.1.1 Skeâ IPv4 mkeâercee~
S[^sme nw~ 29. (d)
21. (c) oes šsyeue kesâ yeerÛe efjuesMeve efvekeâeueves kesâ efueS nce ÙetefveÙeve,
keâchÙetefšbie ceW, HeâeÙejJee@ue Skeâ vesšJeke&â megj#ee ØeCeeueer nw, pees efkeâ hetJe& FvšjmeskeäMeve, keâešxefmeÙeve Øees[keäš Øeef›eâÙee keâe ØeÙeesie RDBMS ceW
efveOee&efjle megj#ee efveÙeceeW kesâ DeeOeej hej Deeves Jeeues (Fvekeâefcebie) Deewj keâjles nw peyeefkeâ DML ceW efkeâmeer Yeer [sše keâes ef[efueš keâjves keâer
yeenj peeves Jeeues (DeeGšieesFbie) vesšJeke&â š^wefHeâkeâ keâer efveiejeveer Deewj Gmes Øeef›eâÙee kesâ efJe<eÙe ceW peevekeâejer Øeehle keâjles nw~
efveÙebef$ele keâjlee nw~ 30. (c)
22. (c) uee@keäme (Locks) DBMS ôeje GheÙeesie efkeâS peeves Jeeues leb$e nQ pees
ceesyeeFue heâesve ceW ØeÙegòeâ efmece keâe hetCe& ™he meyme›eâeFyej DeeF[Wefššer [sše lekeâ hengbÛe keâes efveÙebef$ele keâjles nw~ uee@keäme keâe GheÙeesie keâjkesâ,
cee@[Ÿetue nw~ ceeF›eâes efmecekeâe[& jsieguej efmecekeâe[& keâe Úesše ™he nw Deewj DBMS megefveefMÛele keâjlee nw efkeâ Skeâ ner meceÙe ceW keâF& uesve-osve Skeâ
vewvees efmecekeâe[& keâe Deekeâej meyemes Úesše neslee nw Dele: keâLeve (ii) ner [sše keâes mebMeesefOele veneR keâj mekeâles, efpememes [sše keâer Fbefšef«ešer
ieuele nw~ Deewj kebâefmemšWmeer yeveer jnleer nw~
251 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
31. (b) 38. (b)
SQL ceW LIKE keâerJe&[ keâe ØeÙeesie efkeâÙee peelee nw efkeâmeer hewšve& hej Java pescme ieesefmuebie Éeje efJekeâefmele Skeâ Øees«eeefcebie ueQiJespe nw~ Fmekeâe
DeeOeeefjle šsyeue mes [sše keâes oMee&ves kesâ efueS~ Ùen Meyo Where GheÙeesie ceesyeeFue SefhuekesâMeve, [smkeâše@he SefhuekesâMeve leLee Jesye
keäuee@pe kesâ meeLe GheÙeesie efkeâÙee peelee nw leeefkeâ Deehe efJeefMe° hewšve& kesâ ef[peeFefvebie ceW back-end kesâ efueS efkeâÙee peelee nw peyeefkeâ C# Skeâ
meeLe cesue Keeles ngS [sše keâes mesueskeäš keâj mekeâles nw~ mebieCekeâerÙe Øees«eece Yee<ee nw~ Fmekeâe efvecee&Ce cee›eâesmee@heäš ves efkeâÙee Lee
GoenjCe- Select * from employees Where name LIKE leLee ASP.Net Skeâ Jesye SefhuekesâMeve ShueerkesâMeve øesâceJeke&â nw,
'A%'
efpemekeâe efvecee&Ce SJeb efJeheCeve ceeF›eâesmee@heäš Éeje Øees«eecej keâes
Fme keäJesjerr ceW employees šsyeue mes Jes hebefòeâÙeeb mesueskeäš nes
[eÙeveeefcekeâ Jesye mee@heäšJesÙej, Jesye SefhuekesâMeve SJeb Jesye mesJeeÙeW efveefce&le
jner nw efpeveceW keâce&Ûeejer keâe veece 'A' mes Meg™ neslee nw~
32. (b)
keâjves kesâ Devegceefle nsleg efkeâÙee ieÙee nw~
COMMIT keâceeb[ š^ebpewkeäMeve (Transaction) Éeje efkeâS ieS PHP–jemeceme uesj[ehe&â (Rasmus lerdorf) Éeje efJekeâefmele
Dehe[sš keâes [sšeyesme ceW mLeeÙeer yeveelee nw~ š^ebpewkeäMeve kesâ meYeer keâchÙetšj Yee<ee nw~ Ùen Skeâ efm›eâefhšbie Yee<ee nw, pees cetuele:
[sšeyesme keâeÙe& keâes COMMIT keâjves kesâ yeeo, Gvekesâ heefjCeece mLeeÙeer [eÙeveeefcekeâ Jesye hespeeW keâes yeveeves kesâ efueS ef[peeFve keâer ieF& Leer~
™he mes meHeâueleehetJe&keâ [sšeyesme ceW mebefÛele nesles nw~ Fmekeâe GheÙeesie 39. (d)
[sšeyesme keâeÙeeX keâes megjef#ele Deewj efveYe&j yeveeves kesâ efueS efkeâÙee peelee nw, JeerDeejSceSue (JeÛeg&Deue efjÙeefuešer ceeke&âDehe ueQiJespe Ùee JeÛeg&Deue
efpememes [sšeyesme keâer keâchewefšefyeefuešer Deewj [sše megj#ee megefveef§ele nesleer efjÙeefuešer cee@[efuebie ueQiJespe) Skeâ Øees«eeefcebie Yee<ee nw, efpemes ceeke&â hesme
nw~
33. (b)
Deewj šesveer hesefjme Éeje efJekeâefmele efkeâÙee ieÙee Lee, Ùen «eeefHeâkeâue
Asymmetric key cryptography ceW Private cewmespe Øeehlekeâlee& ef[mhues kesâ efueS 3D JemlegDeeW keâe JeCe&ve keâjlee nw~
(Receiver) Éeje jKeer peeleer nw~ Fmekeâe GösMÙe Ùen megefveefMÛele 40. (d)
keâjvee nw efkeâ kesâJeue FefÛÚle Øeehlekeâlee& ner cewmespe keâes mecePe mekesâ~ mšwkeâ Skeâ linear data mš^bkeäÛej nw pees [eše Dee@hejsMeve hejheâece&
34. (b) keâjves kesâ efueS Skeâ particular sequential Dee@[&j heâeuees keâjlee nw~
megj#ee kesâ meeLe-meeLe, pewmee efkeâ veece mes helee Ûeuelee nw, mšwkeâ ceW meJe&ØeLece Meer<e& keâe SefueceWš ef[ueerš neslee nw keäÙeeWefkeâ Ùen
db_accessadmin Yetefcekeâe Skeämesme keâes Yeer mebYeeueleer nw~
LIFO (Last in first out) keâes heâe@ueeW keâjlee nw~
db_sysadmin efmemšce ØeMeemekeâ keâes meboefYe&le keâjlee nw~ pewmee efkeâ
41. (c)
veece mes helee Ûeuelee nw, db_securityadmin FmeceW megj#ee
megefveefMÛele keâjves Jeeues [sše lekeâ hengBÛeves keâer Devegceefle oslee Ùee C++ Yee<ee cebs '/t' keâe ØeÙeesie ne@efjpee@všue šwye mhesme kesâ efueS efkeâÙee
DemJeerkeâej keâjvee Meeefceue nw~ peelee nw~
35. (b) 42. (c)
[sšeyesme mebjefÛele peevekeâejer Ùee [sše keâe Skeâ mebieef"le meb«en nw, pees C# Øees«eeefcebie Yee<ee ceW JewefjSyeue vesce efmehe&â DebiesÇspeer kesâ De#ejeW
Deeceleewj hej kebâhÙetšj efmemšce ceW Fueskeäš^e@efvekeâ ¤he mes meb«enerle neslee (Alphabets A, B, C.......Z) Ùee a, b, c......z, DeLeJee
nw~ Skeâ [sšeyesme keâes Deeceleewj hej [sšeyesme ØeyebOeve ØeCeeueer Éeje Deb[jmkeâesj ( _ ) kesâ meeLe Meg® nes mekeâlee nw~
efveÙebef$ele efkeâÙee peelee nw~
36. (c)
JewefjSyeue vesce ceW efkeâmeer white space character (space, tab
[sšeyesme ØeyebOeve keâer mebjÛevee leerve mlejeW mes efceuekeâj yeveer nesleer nw, pees Deeefo) keâer Devegceefle veneR nw~
Fme Øekeâej nQ~ kegâÚ JewOe JewefjSyeue vesce – _Vikas45, Vikas_45, VIKAS_m
(i) Deevleefjkeâ mlej (Internal Level)- Fme mlej ceW [sšeyesme kesâ Fve meYeer JewefjSyeue vesce keâer Devegceefle nw
Yeeweflekeâ meb«enCe keâer mebjÛevee keâe JeCe&ve keâjlee nw~ kegâÚ DeJewOe JewefjSyeue pees efkeâ C# leLee C Ùee C++ ceW ceevÙe veneR nw
(ii) efJeÛeej mebyebOeer mlej (Conceptual Level)- Fme mlej ceW hetCe& pewmes- 45 Vikas,
[sšeyesme keâer mebjÛevee nesleer nw~ Ùen mlejeW kesâ ceOÙe peevekeâejer kesâ
@Vikas
™heevlejCe keâer Øeef›eâÙee nesleer nw~
- Vikas_ 45
(iii) yeenjer mlej (External Level)- Fme mlej ceW [sše JÙeefòeâiele
GheÙeesiekeâlee& Éeje GheÙeesie ceW ueeÙee peelee nw~ Ùen [sšeyesme kesâ Gme 43. (a)
Yeeie keâe JeCe&ve keâjlee nw, pees GheÙeesiekeâlee& kesâ efueS GheÙeesieer neslee nw~ efoÙes ieÙes HeäueesÛeeš& ceW JewefjSyeue A keâes 100 Deewj S keâes 0 mes
37. (d) mšeš& efkeâÙee peelee nw
[sše JesÙejneGme Skeâ efjuesMeveue [sšeyesme nw efpemes uesveosve ØemebmkeâjCe 1. Ûetbefkeâ A Meg® ceW 100 nw Deewj Ùen 20 mes yeÌ[e nw FmeefueS nce
kesâ yepeeÙe keäJesjer Deewj efJeMues<eCe kesâ efueS ef[peeFve efkeâÙee ieÙee nw~ No yeÇebÛe kesâ Deboj yuee@keâ efvemheeefole veneR keâjles nw~
FmeceW Deeceleewj hej uesve-osve [sše mes Øeehle Ssefleneefmekeâ [sše neslee nw, 2. Fmekesâ yeÛeeÙe nce A kesâ ceeve keâes S ceW peesÌ[les nw, efpememes S
uesefkeâve FmeceW DevÙe œeesleeW mes [sše Meeefceue nes mekeâlee nw~ efkeâmeer
100 nes peelee nw
mebie"ve keâes keâF& œeesleeW mes [sše keâes mecesefkeâle (consolidated) keâjves
ceW me#ece yeveelee nw~ 3. ef Heâj nce A mes 40 Iešeles nw, efpememes Ùen 60 nes peelee nw~
mšsšceWš Ûeej ieuele nw keäÙeeWefkeâ Fmekeâe [sše JesÙejneGme mes keâesF& 4. efHeâj kebâ[erMeve Ûeskeâ hej peeles nw efkeâ keäÙee A 20 mes yeÌ[e nw Ùee
mecyevOe veneR nw~ yejeyej nw? neB Ùen nw (60, 20 mes yeÌ[e nw)
252 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
5. efheâj mes nce No yeÇebÛe kesâ Devoj yuee@keâ efvemheeefole veneR keâjles nw, Private- ØeeFJesš kesâ ™he ceW efkeâÙes ieÙes keäueeme cescyeme& keâes keäueeme kesâ
uesefkeâve nce A kesâ ceeve keâes S ceW peesÌ[les nw, efpememes S Deye Devoj mes ner Skeämesme efkeâÙee pee mekeâlee nw~ Fmes keäueeme keâer yeenj
160 nes peelee nw~ efkeâmeer HebâkeäMeve kesâ Éeje [eÙejskeäš Skeämesme veneR efkeâÙee pee mekeâlee nw~
6. efHeâj nce A mes efHeâj mes 40 Iešeles nw, efpememes Ùen 20 nes peelee nw~ Protected- mebjef#ele Skeämesme ceesef[HeâeÙej keâer ØeeFJesš Skeämesme
7. nce Jeeheme kebâ[erMeve Ûeskeâ hej peeles nw efkeâ keäÙee A 20 mes yeÌ[e ceesef[HeâeÙej keâer lejn meceeve neslee nw, Fmes Yeer keäueeme kesâ yeenj Skeämesme
Ùee yejeyej nw, neB (20, 20 kesâ yejeyej nQ) veneR efkeâÙee pee mekeâlee nw~
8. Fme yeej Yeer nce No yeÇebÛe kesâ yevoj yuee@keâ efvemheeefole veneR keâjles 51. (c)
nw, uesefkeâve nce A kesâ ceeve keâes S ceW pees[les nw, efpememes S Deye keâcheeFuej Jen Øees«eece nw pees GÛÛe mlejerÙe Yee<ee ceW efueKeW keâes[ keâes
180 nes peelee nw~ ceMeerveer Yee<ee ceW Skeâ yeej ceW š^ebmeuesš keâj oslee nw~
9. efHeâj nce A mes 40 Iešeles nw, efpememes Ùen –20 nes peelee nw~ 52. (b)
10. Deye A 20 mes DeefOekeâ Ùee yejeyej veneR nw, FmeefueS nceves No peye nce Skeâ DebkeâieefCele SkeämeØesmeve efueKeles nw~ lees oes Dee@hejsC[dme kesâ
yeÇebÛe ceW Øeesmesme keâjles nw~ ceOÙe Skeâ Deehejsšj keâe ØeÙeesie efkeâÙee peelee nw~ Ssmes SkeämeØesMeve keâes
11. nce S keâe ceeve DeeGšhegš keâjles nw, pees 180 nw Deewj Øees«eece Fveefheâkeäme keânles nw~
yebo nes peelee nw~ GoenjCe-
FmeefueS HeäueesÛeeš& keâe DeeGšhegš 180 nesiee~
44. (c)
efkeâmeer mecemÙee keâes heefjYeeef<ele keâjves, Gmekeâe keâejCe efveOee&efjle keâjves,
meceeOeeve kesâ efJekeâuheeW keâer henÛeeve keâjves, ØeeLeefcekeâlee osves Deewj GefÛele
meceeOeeve keâes ef›eâÙeeefvJele keâjves keâer Øeef›eâÙee keâes mecemÙee meceeOeeve 53. (d)
(Problem-solving) keâewMeue keâne peelee nw~ Ùen Øeef›eâÙee ÛejCeyeæ heäuees Ûeeš& Skeâ Øekeâej keâe efhekeäšesefjÙeue [eÙe«eece neslee nw pees
lejerkesâ mes mecemÙee keâes mecePeves, meceeOeeve kesâ efJekeâuheeW hej efJeÛeej keâjves Suieesefjodce Jeke&â Øeesmesme keâes efjØespeWš keâjlee nw~
Deewj meyemes GheÙegkeäle meceeOeeve keâes ueeiet keâjves hej DeeOeeefjle nesleer nw~ heäuees Ûeeš& kesâ ueeYe–
45. (c) 1. heäuees Ûeeš& kesâ ceeOÙece mes yesnlej Suieesefjodce Jeke&â Øeesmesme mLeeefhele
C++ ceW, Ùeefo efkeâmeer keäueeme keâe keâesF& veece veneR nw, lees Ùen keâes[ efkeâÙee pee mekeâlee nw~
keâcheeFue veneR nesiee~ Skeâ keäueeme keâe veece Gmekeâer henÛeeve nesleer nw 2. heäuees Ûeeš& kesâ ceeOÙece mes mecemÙee keâes ØeYeeJeer Ì{bie mes efJeMuesef<ele
Deewj Fmekeâe GheÙeesie Gmekesâ yeeo ceW Gmekeâer efvecee&Ce kesâ efueS efkeâÙee keâj mekeâles nw~
peelee nw~ FmeefueS Skeâ keäueeme kesâ veece kesâ efyevee keâes[ keâes keâcheeFue 3. heäuees Ûeeš& kesâ ceeOÙece mes uee@efpekeâ keâes mejue lejerkesâ mes Øemlegle efkeâÙee
veneR efkeâÙee pee mekeâlee nw~ pee mekeâlee nw~
46. (c) heäuees Ûeeš& kesâ neefve–
SkeämešWefmeyeue Jen Øees«eeefcebie ueQiJespe nw efpemeceW veS [sše Øekeâej yeveeves 1. heäuees Ûeeš& šeFce kebâpÙetefcebie neslee nw~
keâer #ecelee nesleer nw~ 2. heäuees Ûeeš& ceW yeÇebefÛebie Deewj uetehf ebie keâes efjØeWpesš keâjvee keâef"ve neslee nw~
47. (c) 54. (a)
ØeeFJesš ceesef[HeâeÙej efveefo&° keâjlee nw efkeâ cescyej keâes kesâJeue Deheveer Øeesmesme, Skeâ kebâhÙetšj Øees«eece keâe GoenjCe nw efpemes efve<heeefole efkeâÙee
keäueeme ceW ner Skeämesme efkeâÙee peelee nw hewkesâpe ØeeFJesš ceesef[HeâeÙej efveefo&° pee jne nw~ FmeceW Øees«eece keâes[ Deewj Fmekeâer ieefleefJeefOe Meeefceue nw~
keâjlee nw efkeâ meomÙe keâes kesâJeue Deheves hewkesâpe kesâ Yeerlej ner Skeämesme Skeâ Øeesmesme efve<heeove kesâ keâF& LesÇs[dme mes yeveer nes mekeâleer nw pees Skeâ
efkeâÙee pee mekeâlee nw Deewj Fmekesâ DeueeJee keâner veneR~ meeLe efveoxMeeW keâes efve<heeefole keâjleer nw~
48. (a) 55. (b)
efoS ieS keâes[ ceW Object-Oriented programming (OOP) keâer DeeOegefvekeâ keâchÙetšj efkeâmeer Yeer keâeÙe& keâes keâjves kesâ efueS efveoxMeeW kesâ Skeâ
efJeMes<eleeDeeW ceW mes SvekewâhmeguesMeve (Encapsulation) Deewj FvensefjšWme mecetn keâe heeueve keâjles nQ, Fve efveoxMeeW keâes meeceevÙele: Øees«eece keâne
(Inheritance) keâes Fbieefle keâjlee nw~ peelee nw~ Øees«eece Skeâ keâchÙetšj keâer Yee<ee nw pees keâchÙetšj keâes mejue
49. (c) yeveeves kesâ efueS lewÙeej efkeâÙee peelee nw, Deewj keâchÙetšj hej keâece keâjves
C++ ceW Øees«eece keâes mebkeâefuele Deewj Ûeueeves kesâ efueS Me@eš&keâš kegBâpeer kesâ efueS mee@HeäšJesÙej FbpeerefveÙej Éeje kegâÚ Ssmes Øees«eece lewÙeej efkeâS peeles
'Ctrl+F9' keâe GheÙeesie efkeâÙee peelee nw~ nw, pees nceejs keâchÙetšj mes mecyeefvOele keâeÙe& keâjves ceW Øees«eece kesâ veece mes
50. (b) peeves peeles nw~
C++ ceW, Class keâes leerve Øekeâej mes Skeämesme efkeâÙee pee mekeâlee nw~ 56. (d)
Public- Public kesâ ™he ceW declare efkeâÙes ieÙes [sše cescyeme& Deewj heeFLeve Skeâ meeceevÙe keâeÙeeX kesâ efueS GheÙegòeâ neF&uesJeue ueQiJespe nw
cescyej HebâkeäMeve keâer efkeâmeer Yeer otmejs keäueeme Deewj HebâkeäMeve kesâ Éeje leLee Ùen OOP (Deeypeskeäš DeesefjSbšs[ Øees«eeefcebie Yee<ee) keâebmeshš hej
Skeämesme efkeâÙee pee mekeâlee nw~ keâeÙe& keâjlee nw~
253 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
57. (a) 65. (b)
keäueeme (class) Dee@ypeskeäš yeveeves kesâ efueS Skeâ yuetefØebš Ùee šscheuesš efkeâmeer Yeer HeâeFue/Heâesu[j efpemes Skeämesme efkeâÙee peelee nw, Gmes ceeke&â
nw~ Ùen Gme keäueeme mes mebyebefOele JemlegDeeW keâer mebjÛevee Deewj JÙeJenej keâjles ngS hetjs HeâeFue efmemšce mes iegpejves keâer Øeef›eâÙee keâÛeje ØeyebOeve
keâes heefjYeeef<ele keâjlee nw~ Skeâ Dee@ypeskeäš Skeâ keäueeme keâe GoenjCe nw (Garbage Collection) keânueeleer nw~ keâÛeje Skeâ$eerkeâjCe mJeÛeeefuele
Deewj Jen keäueeme ceW heefjYeeef<ele efJeMes<eleeDeeW Deewj efJeefOeÙeeW keâes Øeehle mce=efle ØeyebOeve keâe Skeâ Øekeâej nw~ Ùen Gme mce=efle keâes hegve: Øeehle keâjves
keâjlee nw~ keâe ØeÙeeme keâjlee nw efpemes Øees«eece Éeje DeeJebefšle efkeâÙee ieÙee Lee,
58. (c) uesefkeâve Deye Fmes meboefYe&le veneR efkeâÙee peelee nw - efpemes keâÛeje Yeer keânles
Suieesefjoce keâes Øees«eeefcebie keâes[ ceW š^ebmeuesš keâjves keâer DeeJeMÙekeâlee nw nw~
leeefkeâ kebâhÙetšj Fmes mecePe mekeWâ~ 66. (b)
59. (a) Ùeefo keâchÙetšj ceW Skeâ mes DeefOekeâ Øeesmesmej nw lees Fmes ceušerØeesmesmej kesâ
keâchÙetšj [sše Ùee Øees«eece ceW $egefš (Error) keâes yeie (Bug) keâne peelee ™he ceW peevee peelee nw~ oes Ùee oes mes DeefOekeâ Øeesmesmej Éeje oes Ùee
nw~ mee@heäšJesÙej yeie efkeâmeer keâchÙetšj Øees«eece Ùee efmemšce ceW Skeâ $egefš, DeefOekeâ Øees«eece keâe meeLe-meeLe Øeesmesefmebie ceušer Øeesmesefmebie Ùee hewjsueue
oes<e, efJeheâuelee Ùee ieueleer nw efpemekesâ keâejCe Ùen ieuele Ùee DeØelÙeeefMele Øeesmesefmebie keânueelee nw~ Fmemes keâeÙe& mecheeove keâjves keâer oj ceW Je=efæ
heefjCeece GlheVe keâjlee nw Ùee Devehesef#ele lejerkesâ mes JÙeJenej keâjlee nw~ yeie nesleer nw~
keâes nševee (otj keâjvee) [eryeie keâne peelee nw~ 67. (a)
60. (d) keâLeve (a) DemelÙe nw keäÙeeWefkeâ Dee@hejsefšbie efmemšce Skeâ Ssmee efmemšce
Direct X, ceeF›eâesmee@heäš huesšheâece& hej ceušerceeref[Ùee, efJeMes<e ™he mes mee@heäšJesÙej nw pees GheÙeesiekeâleeDeeW leLee keâchÙetšj ne[&JesÙej kesâ yeerÛe
iesefcebie Deewj Jeeref[Ùees mes mecyebefOele keâeÙeeX keâes mebYeeueves kesâ efueS Fbšjhesâme keâe keâeÙe& keâjlee nw leLee Fvekesâ yeerÛe cesceesjer cewvespeceWš efjmeesme&
ceeF›eâesmee@heäš Éeje efJekeâefmele SefhuekesâMeve Øees«eeefcebie Fbšjhesâme (API) cewvespej kesâ ™he ceW keâeÙe& keâjlee nw~ Dee@hejsefšbie efmemšce Ùetpej Ùee
keâe Skeâ meb«en nw~ Ùen [sJeueheme& keâes «eeefheâkeäme keâe[&, meeGb[ keâe[& Øees«eecej mes ne[&JesÙej mebmeeOeveeW (Resources) kesâ efJeJejCe keâes Yeer
Deewj Fvehegš ef[JeeFme pewmes ne[&JesÙej IeškeâeW kesâ meeLe Fbšjwkeäš keâjves kesâ Úgheelee nw~
efueS štue Deewj hebâkeäMeve keâe Skeâ mesš Øeoeve keâjlee nw~ 68. (c)
61. (b) mesiecesšsMeve Skeâ cesceesjer cewvespeceWš lekeâveerkeâ nw pees JewefjSyeue uebyeeF& kesâ
mee@heäšJesÙej ueeFmeWme Skeâ omleeJespe nw pees kegâÚ MeleeX kesâ DeOeerve Ùee uee@efpekeâue S[^sme keâes efHeâefpekeâue cesceesjer hej cewhe keâjleer nw~ ØelÙeskeâ
efyevee efkeâmeer Mele& kesâ mee@heäšJesÙej ceWs GheÙeesie Deewj efJelejCe kesâ efueS mesieceWš keâer uebyeeF& Deueie-Deueie nesleer nw, ØelÙeskeâ mesieceWš keâer uebyeeF&
keâevetveer ™he mes yeeOÙekeâejer efoMee efveoxMe Øeoeve keâjlee nw~ efkeâmeer Deueie Deueie GheÙegòeâ nesleer nw pene Øees«eece kesâ efJeefYeVe efnmmeeW Ùee
mee@heäšJesÙej hej efveÙeceeW kesâ Devegmeej mLeeefhele keâevetveer DeefOekeâej efJeefYeVe Øekeâej kesâ [sše kesâ efueS Deueie-Deueie cee$ee ceW cesceesjer keâer
mee@heäšJesÙej keâe@heerjeFš keânueelee nw~ keâe@heerjeFš Oeejkeâ keâer Devegceefle DeeJeMÙekeâlee nesleer nw~
kesâ efyevee keâe@heerjeFš mee@heäšJesÙej keâe ØeÙeesie, Gmekeâe efJelejCe Ùee 69. (d)
GmeceW heefjJele&ve keâjvee mee@heäšJesÙej heeFjsmeer (Software Piracy) Dee@hejsefšbie efmemšce Ùetpej Deewj ne[&JesÙej kesâ yeerÛe Skeâ Fbšjhesâme nw~
keânueelee nw~ Dee@hejsefšbie efmemšce Skeâ mee@heäšJesÙej nw pees heâeFue cewvespeceWš, cesceesjer
62. (b) cewvespeceWš, efmekeäÙeesefjšer, Øeesmesme cewvespeceWš, pee@ye Mes[Ÿetefuebie Deeefo keâeÙe&
efmemšce mee@heäšJesÙej keâchÙetšj Øees«eeceeW keâe Skeâ mesš nw efpemes efmemšce keâjlee nw peyeefkeâ GheÙeesiekeâlee& kesâ ØeoMe&ve hej efveÙeb$eCe Dee@hejsefšbie
mebmeeOeveeW keâes ØeyebefOele keâjves kesâ efueS ef[peeFve efkeâÙee ieÙee nw~ Ùen efmemšce keâe keâeÙe& veneR nw~
Ssmeer heâeFueeW Deewj Ùetefšefueefš Øees«eeceeW keâe Skeâ meb«en nw pees 70. (c)
keâchÙetšj efmemšce keâes DevÙe ne[&JesÙej kesâ meeLe megÛee™ ™he mes øesâieceWšsMeve Skeâ cesceesjer ØeyevOeve mecemÙee nw,ve efkeâ Skeâ lekeâveerkeâ~
Ûeueeves kesâ efueS efpeccesoej nw~ efmemšce mee@heäšJesÙej DevÙe mee@heäšJesÙej
kesâ keâece keâjves kesâ efueS Skeâ huesšheâece& kesâ ™he ceW keâeÙe& keâjlee nw, 1. hesefpebie- Ùen Skeâ cesceesjer ØeyevOeve lekeâveerkeâ nw efpemeceW cesceesjer keâes
pewmes SbšerJeeÙejme mee@heäšJesÙej, Ùetefšefuešer Øees«eece, Dee@hejsefšbie efmemšce Úesšs-Úesšs hespeeW ceW efJeYeeefpele efkeâÙee peelee nw Deewj Ùes hespe efJeefYeVe
FlÙeeefo~ mLeeveeW hej efmLele nes mekeâles nQb Fmemes cesceesjer keâer DeJemebjÛevee keâes
63. (d) ØeyeefvOele keâjvee Deemeeve nes peelee nw~
Fbšjvesš efjues Ûewš, ietieue še@keâ, muewkeâ Deeveuee@Fve (IRC) Ûewš 2. Segmentation - Ùen Yeer Skeâ cesceesjer ØeyevOeve lekeâveerkeâ nw
mee@heäšJesÙej nw hejvleg AWS (Amazon Web Services) Skeâ efpemeceW cesceesjer keâes Deueie-Deueie mesiebceWšsMeve ceW efJeYeeefpele efkeâÙee
keäueeG[ huesšheâece& nw~ peelee nw, pewmes efkeâ keâes[, [sše Deewj mšwkeâ~
64. (d) mesiebceWšsMeve keâes[ Deewj [sše kesâ efJeefYeVe ØekeâejeW keâes Skeâ meeLe jKeves
keâ@cheeFuej Skeâ mee@HeäšJesÙej neslee nw pees efkeâmeer Øees«eeefcebie Yee<ee ceW efueKes
keâer megefJeOee Øeoeve keâjlee nw~
ieS œeesle keâes[ keâes ceMeerve keâes[ ceW yeouelee nw, efpemes kebâhÙetšj mecePe
mekeâlee nw~ keâ@cheeFuej Fvehegš kesâ ™he ceW efueKes ieS œeesle Øees«eece keâes øesâieceWšsMeve Skeâ lekeâveerkeâ veneR nw yeefukeâ Skeâ mecemÙee nw pees hesefpebie
ueslee nw Deewj DeeGšhegš ceW Dee@ypeskeäš keâes[ kesâ ™he ceW meboefYe&le Deewj mesieceWšsMeve pewmes cesceesjer ØeyevOeve lekeâveerkeâeW mes mecyeefvOele nes
keâjlee nw~ mekeâleer nw~
254 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
71. (b) 81. (b)
Øees«eece keâeGbšj keâchÙetšj Øeesmesmej ceW Skeâ meerheerÙet jefpemšj neslee nw~ ceojyees[& ceW ‘efmemšce yeme (System bus)’ neslee nw pees meerheerÙet keâes
efpemeceW cesceesjer mes efve<heeefole nesves Jeeues Deieues efveoxMe keâe helee neslee ceojyees[& kesâ DevÙe IeškeâeW mes peesÌ[lee nw~ Skeâ Bus keâe keâchÙetšj ceW
nw~ Ùen keâeÙeeX keâes lespeer mes efve<heeove kesâ meeLe-meeLe Jele&ceeve efve<heeove celeueye neslee nw Skeâ jemlee efpememes efkeâmeer Yeer Circuit ceW Skeâ
efyevog keâes š^wkeâ keâjves kesâ efueS DeeJeMÙekeâ Skeâ ef[efpešue keâeGbšj nw~ Component otmejs kesâ meeLe pegÌ[lee nw~ efkeâmeer Yeer Bus keâe Speed
72. (d) keâes cesieenšd&pe (MHz) ceW ceehee peelee nw~
keâchÙetšj mee@heäšJesÙej keâes efJekeâefmele keâjves ceW GheÙeesie keâer peeves Jeeueer 82. (c)
Yee<ee keâes Øees«eeefcebie ueQiJespe keâne peelee nw~ efJepegDeue yesefmekeâ leLee šyeex keâchÙetšj kesâ efueS mebmeej MetvÙe Deewj Skeâ mes ner efveefce&le nw~ Fve MetvÙe
C++ keâer meneÙelee mes Øees«eeefcebie mee@heäšJesÙej efJekeâefmele efkeâÙee peelee nw~
Ùee Skeâ keâes Yeb[eefjle keâjves kesâ efueS processor kesâ Devoj š^ebefpemšj
73. (c)
ueieeÙee peelee nw~ keâchÙetšj ceW meejer ieCeveeSb 0 Deewj 1 kesâ ceeOÙece mes
mee@HeäšJesÙej hewÛe (Patch) Skeâ Deeheelekeâeueerve megOeej (Emergency
Fix) nw pees efkeâmeer Yeer YesodÙelee keâe meecevee nesves hej DeØeÛeefuele
ner hetCe& keâer peeleer nw~
mebmkeâjCe hej keâece keâjlee nw~ 83. (b)
CISC (Complex Instruction Set Computing) Deewj RISC
74. (d)
Jeešjheâe@ue cee@[ue, meefhe&ue cee@[ue Deewj SpeeFue cee@[ue leerveeW (Reduced Instruction Set Computing) oes ØecegKe Øeesmesmej
mee@HeäšJesÙej efJekeâeme ueeFHeâ Ûe›eâ cee@[ue nw~ Deeefke&âšskeäÛej nw, efpevekeâe GheÙeesie kebâhÙetšj Øeesmesmeme& kesâ ef[peeFve ceW
75. (a) efkeâÙee peelee nw~ Fve oesveseb ceW cegKÙe Deblej efveoxMeeW (Instructions) keâer
efJeb[espe kesâ keäÙet ceW heÌ[s efhebÇš keâeÙe& keâes jö keâjves kesâ efueS meJe&ØeLece peefšuelee Deewj Øeesmesefmebie jCeveerefleÙeeW ceW nw~
efØebš DeeFkeâve hej [yeue efkeäuekeâ keâjW Deewj efpeve pee@yme keâes Deehe jö 84. (d)
keâjvee Ûeenles nw Gmes neF&ueeFš keâjW lelhe§eele jeFš efkeäuekeâ keâjkesâ CPU S[^^sefmebie lekeâveerkeâ kebâhÙetšj kesâ mebie"ve ceW GheÙeesie nesves Jeeues lejerkeâeW
keQâefmeue keâe ÛeÙeve keâjW~ keâes metefÛele keâjleer nw pees mebie"ve kesâ CPU Éeje cesceesjer mes [sše Deewj
76. (c) Fbmš^keäMevme keâes hengBÛeeves kesâ efueS ØeÙegòeâ nesles nw~ CPU Éeje efveÙeesepf ele
hebâkeäMeve keâer : F1..................F12 meyemes Deece S[^sefmebie lekeâveerkeâ efvecveefueefKele nes mekeâleer nw-
SuheâevÙetcewefjkeâ keâer : A......Z, 0.......9 (i) Direct Addressing
cee@ef[heâeÙej keâer : Ctrl, Alt, Shift (ii) Indirect Addressing
S[pesmšceWš keâer : hebâkeäMeve keâer, Sjes keâer leLee Ssmeer keâer efpememes (iii) Immediate Addressing
yeÇeFšvesme Deeefo keâes Adjust keâjles nQ~ (iv) Register Addressing
77. (d) (v) Indexed Addressing
ØelÙet<e Yeejle keâe meyemes lespe meghej keâchÙetšj nw~ ØelÙet<e Fbef[Ùeve FbmšeršŸetš 85. (a)
Dee@Heâ š^e@efhekeâue cewš^esuee@peer (IITM) hegCes Deewj vesMeveue meWšj Heâe@j ceeref[Ùece HDFS (Hadoop Distributed File System) keâes efJeMes<e ™he mes
jWpe Jesoj Heâesjkeâemš (NCMRWF) veesS[e ceW meHeâue nesves Jeeuee meghej GÛÛe mkesâuesefyeefuešer Deewj heâe@uš še@uejWme (oes<e - menveMeeruelee) kesâ
keâchÙetšj nw~ Ùen peveJejer 2018 ceW mLeeefhele efkeâÙee ieÙee~ Ùen Yeejle keâe efueS ef[peeFve efkeâÙee ieÙee nw~ Ùen mJeÛeeefuele [sše Øeefleke=âefle kesâ
henuee ceušerhesšeHeäueehme ßesCeer keâe meghej keâchÙetšj nw~ Ùen 6.8 hesšeHeäueehme ceeOÙece mes keâece keâjlee nw, efpemeceW [sše keâer keâF& keâe@efheÙeeB Deueie-
keâer ieefle mes ieCevee keâjves ceW me#ece nw~ Deueie veesšdme hej jKeer peeleer nw~ Fmemes Ùen megefveef§ele neslee nw efkeâ
78. (b)
Ùeefo keâesF& vees[ hesâue nes peeS, leye Yeer efmemšce keâece keâjlee jnsiee~
DeefjLeceesceeršj keâe DeeefJe<keâej 1820 ceW Ûeeume& pesefJeÙej Leeceme [er
86. (c)
keâesueceej Éeje efkeâÙee ieÙee~ Ùen ØeLece ef[efpešue cewkesâefvekeâue
ceeF›eâeskebâš^esuej Skeâ Úesše keâce ueeiele Jeeuee Deewj mJeÙeb efveefnle
kewâuekegâuesšj Lee~
keâchÙetšj-Dee@ve-S-efÛehe nw efpemes Scyes[s[ efmemšce kesâ ™he ceW GheÙeesie
79. (b)
Skeâ ceeF›eâesØeesmesmej ueeKeeW š^ebefpemšme&, [eÙees[ Deewj kewâheeefmešme& Deeefo efkeâÙee pee mekeâlee nw~ Scyes[s[ efmemšce ceW ARM ceeF›eâeskebâš^esuej keâe
mes yevee neslee nw, efpemes ceeF›eâesefÛehe, ceeF›eâesØeesmesmej Ùee meerheerÙet kesâ veece Øekeâej nw~ ARM keâe DeLe& S[Jeebme DeejDeeFSmemeer (efj[Ÿetme
mes peevee peelee nw~ Fbmš^keäMeve mesš keâchÙetšj) ceMeerve nw~ Ùen ef[efpešue Scyes[s[ efmemšce
80. (c) keâer ogefveÙee ceW meyemes ueeskeâefØeÙe ceeF›eâeskebâš^esuej Øees«eeefcebie nw~
kebâhÙetšj yeveeves keâe henuee efJeÕeefJeÅeeueÙe-DeeOeeefjle ØeÙeeme DeeÙeesJee 87. (c)
mšsš efJeÕeefJeÅeeueÙe ceW efkeâÙee ieÙee Lee~ 1939 mes 1942 kesâ yeerÛe, mšesjspe ef[JeeFme mšesjspe #ecelee
pee@ve efJebmeWš Sševeemee@Heâ Deewj Gvekesâ meneÙekeâ efkeäueHeâes[& yesjer ves efpehe ef[mkeâ – 100 MB, 250 MB
efceuekeâj Sševeemee@Heâ-yesjer kebâhÙetšj (ABC) keâe efvecee&Ce efkeâÙee~ Ùen ne[& ef[mkeâ – 128 GB – 2 TB
henuee Fueskeäš^e@efvekeâ ef[efpešue kebâhÙetšj Lee, efpemeves DeeOegefvekeâ kebâhÙetšjeW heäuee@heer ef[mkeâ – 1.44 MB
kesâ efJekeâeme keâer veeRJe jKeer~ [sše keâe@efš^&pe – 36 GB Minimum
255 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES
88. (d) 95. (c)
Skeâ efveyeume ceW 4 efyeš neslee nw~ Dele: 10 efveyeume ceW 4×10=40 yetefueÙeve JÙebpekeâ kesâ Devegmeej-
efyeš neWies~ (i) A . Ā = 0
89. (c) (ii) A .1 = 1
heäuewMe cesceesjer (Flash memory) keâchÙetšj SJeb DevÙe ef[efpešue Ùeb$eeW (iv) A 0 = A
ceW ØeÙegòeâ nesves Jeeueer Skeâ Øekeâej keâer Fueskeäš^erkeâueer Fjspesyeue Øees«eecesyeue
(v) A 1 = 1
jer[ Deesveueer cesceesjer (E-EPROM) nw, pees efJeÅegle Meefòeâ kesâ ve jnves
(vi) A . 1 = A
hej Yeer yeveer jnleer nw~ Ùen cesceesjer kebâhÙetšj ceW ØeÙegòeâ hesve [^eFJe,
ef[efpešue kewâcejeW SJeb ef[efpešue GlheeoeW ceW ØeÙegòeâ cesceesjer keâe[& Deeefo (vii) A Ā = 1
kesâ ™he ceW yengleeÙele ceW ØeÙeesie keâer pee jner nw~ Ùen Skeâ Øekeâej keâe Dele: A . Ā A 0 A
F&F&Øeesce (EEPROM) nw efkeâvleg Fmes yeÌ[s-yeÌ[s YeeieeW (yuee@keäme) ceW A
efcešeÙee (Fjspe) Deewj Øees«eece efkeâÙee pee mekeâlee nw peyeefkeâ meeOeejCe 96. (b)
F&F&Øeesce keâes Skeâ-Skeâ yeeFš keâjkesâ ner efcešeÙee Deewj Øees«eece efkeâÙee SOP keâe celeueye neslee nw ‘‘Sum of Products’’ Ùen Skeâ yetefueÙeve
peelee nw~ Fme keâejCe Fme hej DeebkeâÌ[e efueKeves ceW Dehes#eeke=âle keâce SkeämeØesMeve keâe Skeâ Øekeâej neslee nw efpemeces befJeefYeVe yetefueÙeve ceeveeW kesâ
meceÙe ueielee nw~ mecetneW keâes peesÌ[keâj Skeâ mebÙeesefpele yeteuf eÙeve SkeämeØesme yeveeÙee peelee nw~
90. (b) SOP yetefueÙeve SkeämeØesme keâe GoenjCe
kewâMe cesceesjer Skeâ yengle ner GÛÛe ieefle Jeeueer mesceerkebâ[keäšj cesceesjer nw Y = AB + BC + AC
pees meerheerÙet (CPU) keâer ieefle keâes yeÌ{e osleer nw~ Ùen CPU Deewj 97. (c)
cegKÙe cesceesjer kesâ yeerÛe Skeâ yeheâj (buffer) kesâ ™he ceW keâeÙe& keâjlee oesveeW Fvehegš kesâ GÛÛe nesves kesâ yeeo Yeer NAND iesš keâe DeeGšhegš
nw~ Fmekeâe GheÙeesie [sše Deewj Øees«eece kesâ Gve efnmmeeW keâes jKeves kesâ efvecve nesiee~
efueS efkeâÙee peelee nw pees CPU Éeje meyemes DeefOekeâ yeej GheÙeesie efkeâS DeLee&led
peeles nQ~
91. (a)
heäuewMe [^eFJe Skeâ ceevekeâ šeFhe A USB keâveskeäMeve keâe ØeÙeesie keâjles
nw pees GvnW Skeâ JÙeefòeâiele keâchÙetšj hej Skeâ heesš& ceW hueeefiebie keâjves
keâer Devegceefle oslee nw, uesefkeâve DevÙe Fbšjhesâme kesâ efueS [^eFJe Yeer
ceewpeto nw~
92. (b)
98. (a)
jefpemšj keâchÙetšj cesceesjer keâe Skeâ Øekeâej nw efpemekeâe GheÙeesie meerheerÙet
Éeje legjble GheÙeesie efkeâS pee jns [sše Deewj efveoxMeeW keâes legjble mJeerkeâej
(Accept) keâjves, mšesj keâjves Deewj š^ebmeHeâj keâjves kesâ efueS efkeâÙee
peelee nw~ meerheerÙet Éeje GheÙeesie efkeâS peeves Jeeues jefpemšjeW keâes Dekeämej NAND iesš keâes Deeceleewj hej ‘‘ÙegefveJeme&ue’’ iesš kesâ ™he ceW Jeieeake=âle
Øeesmesmej jefpemšj keâne peelee nw leLee jefpemšj meerheerÙet keâe Skeâ efkeâÙee peelee nw keäÙeeWefkeâ NAND iesš mes leerveeW AND, OR, NOT
Fbšer«esšs[ kebâheesveWš nw~ keâes yeveeÙee pee mekeâlee nw~
93. (c) 99. (a)
cewivesefškeâ šshe ceW efyeš keâes mšesj keâjves keâer ueeiele vÙetvelece nesleer nw~
cewivesefškeâ šshe keâF& Øekeâej kesâ [sše kesâ efueS Yeeweflekeâ Yeb[ejCe
ceeOÙece nw~ mee@efue[ mšsš ef[mkeâ [^eFJe meefnle mšesjspe ceeref[Ùee kesâ
DeeOegefvekeâ ™heeW kesâ efJehejerle, Fmes Skeâ Sveeuee@ie meceeOeeve kesâ ™he Fme uee@efpekeâ meefke&âš [eÙe«eece keâe DeeGšhegš (A+B').C'+D nw~
ceW ceevee peelee nw~ 100. (c)
94. (d) ÙetefveJeme&ue iessš Skeâ Ssmee uee@efpekeâ iesš nw efpemekeâe meneÙelee mes nce
«es keâes[ efmekeäJeWMe kesâJeue Skeâ yeeFvejer efyeš keâes yeouelee nw keäÙeeWefkeâ nce DevÙe meYeer uee@efpekeâ iesšdme keâe DevegkeâjCe keâj mekeâles nw~ Fmekeâe
yeeFvejer kesâ efJehejerle efmekeäJesMe ceW Skeâ vebyej mes Deieues lekeâ peeles nw celeueye nw efkeâ nce ÙetefveJeme&ue iesš keâe GheÙeesie keâjkesâ efkeâmeer Yeer
Fmekeâe DeLe& nw efkeâ S[pesmeWš mesue kesâJeue Skeâ efyeš Ùee yetefueLeve uee@efpekeâ HebâkeäMeve keâes yevee mekeâles nw~ efvecveefueefKele ceW mes NAND iesš
JewefjSyeue kesâ Éeje Deueie nesieer~ Ùen Jener nw pees nceW uee@efpekeâ hebâkeäMeve ÙetefveJeme&ue iesš kesâ ™he ceW peevee peelee nw DeLee&led NAND iesš keâes
kesâ DeeGšhegš keâes JÙeJeefmLele keâjves ceW DeeJeMÙekeâ nw leeefkeâ nce meceevelee ceoo mes nce NOT, AND, OR, NOR Deewj DevÙe uee@efpekeâ iesšdme
osKe mekesâ~ keâe DevegkeâjCe keâj mekeâles nw~
256 YCT

CLICK HERE — FOR JOIN FREE STUDY MATERIAL & TEST

SERIES