Handout 1

STET COMPUTER
SCIENCE
JANAK BATCH
CLASS-1
INTRODUCTION
JANAK BATCH BIHAR STET PAPER-2( COMUTER SCIENCE) (6 PM) DAY-1
TODAY TARGET
Syllabus Discussion
PREVIOUS YEAR PAPER ANALYSIS

Unit 1: Digital Logic

Data and number systems;Binary, Octal and Hexa decimal representation and their
conversions ;BCD,ASCII, EBDIC, Gray codes and their conversions; Signed binary number
representation with 1’s and 2’s complement methods, Binary arithmetic. Venn diagram,
Boolean algebra; Various Logic gates-their truth tables and circuits; Representation in SOP and
POS forms; Minimization of logic expressions by algebraic method, Kmap method
Combinational circuits-Adder and Subtractor circuits;Applications and circuits of Encoder
,Decoder, Comparator ,Multiplexer, De-Multiplexe rand Parity Generator. Memory
Systems:RAM ,ROM, EPROM, EEROM, Design of combinational circuits-using ROM,
Programming logic devices and gate arrays. (PLAs and PLDs) Sequential Circuits-Basic
memory element-S-R, J-K,D and T Flip Flops, various types of Registers and counters and their
design,Irregular counter, State table and state transition diagram,sequential circuits design
methodology. Different types of A/D and D/A conversion techniques. Logic
familiesTTL,ECL,MOS and CMOS, their operation and specifications.
Uniit =1
Introduction to Data Representation and Number System: Introduction to Decimal, Binary,
Octal, Hexadecimal number system, Conversation of number from one number system to
another number system (like Decimal to Binary etc.), Binary Arithmetic: - Addition (Simple
Method, Using 1’s Complement, Using 2’sComplement method), Subtraction (Simple
Method), Multiplication (Simple Method), Division (Simple Method) Different Codes
Representation of Error Detection Codes: Parity Bit Method, Checksum Method,
Representation of Error Correction Code: Hamming Code, Alphanumeric Codes: ASCII, EBCDIC,
Excess – 3 Code, BCD Addition Method, Gray Code: Gray to Binary Conversion, Binary to Gray
Conversion Introduction to Ideal Microcomputer, An Actual Microcomputer: CPU, Address
Bus, Data Bus, Control Bus, Memory: RAM - SRAM, DRAM, ROM - PROM, EPROM, UVEPROM,
EEPROM, History of Microprocessor, Microcontroller (Application Only), Addressing
Techniques, Introduction To Digital Electronics, Logic Gates: Inverter, OR Gate, AND Gate,
NOR Gate, NAND Gate, EX-OR Gate, EX-NOR Gate, De’Morgan’s Theorems Universal Gates
(Only for Logic Conversion), K-Map Simplifications, Pair, Quad, Octet (upto 4 variables) Don’t
Care Condition, Arithmetic Logic Unit: Half Adder, Full Adder, Binary Adder,2’s Complement
Adder Subtractor
Unit 3:Programming and data structure
Data, Entity, Information, Difference between Data and Information, Data type , Build in data type, Abstract data type, Definition of data
structures, Types of Data Structures: Linear and Non-Linear Data Structure, Introduction to Algorithms: Definition of Algorithms,
Difference between algorithm and programs, properties of algorithm, Algorithm Design Techniques, Performance
Analysis of Algorithms, Complexity of various code structures, Order of Growth, Asymptotic Notations. Definition, Single and
Multidimensional Arrays, Representation of Arrays: Row Major Order, and Column Major Order, Derivation of Index Formulae for 1-D,2-
D Array Application of arrays, Sparse Matrices and their representations. Recursion: recursion in C, example of recursion, Tower of Hano
Problem, simulating recursion, Backtracking,, recursive algorithms, principles of recursion. Array Implementation and Pointer
Implementation of Singly Linked Lists, Doubly Linked List, Circularly Linked List, Operations on a Linked List. Insertion, Deletion,
Traversal, Polynomial Representation and Addition Subtraction & Multiplications of Single variable. Abstract Data Type, Primitive
Stack operations: Push & Pop, Array and Linked Implementation of Stack in C, Application of stack: Prefix and Postfix Expressions,
Evaluation of postfix expression, Iteration and RecursionPrinciples of recursion, Tail recursion, Removal of recursion Problem solving
using iteration and recursion with examples such as binary search, Fibonacci numbers, and Hanoi towers. Operations on Queue:
Create, Add, Delete, Full and Empty, Circular queues, Array and linked implementation of queues in C, Dequeue and Priority Queue.
Concept of Searching, Sequential search, Index Sequential Search, Binary Search. Concept of Hashing & Collision resolution Techniques
used in Hashing. Insertion Sort, Selection Sort, Bubble Sort, Heap Sort, Comparison of Sorting Algorithms, Sorting in Linear Time:
Counting Sort and Bucket Sort. Terminology used with Graph, Data Structure for Graph Representations: Adjacency Matrices,
Adjacency List, Adjacency. Graph Traversal: Depth First Search and Breadth First Search, Connected Component. Basic terminology
used with Tree, Binary Trees, Binary Tree Representation: Array Representation and Pointer (Linked List) Representation, Binary Search
Tree, Complete Binary Tree, A Extended Binary Trees, Tree Traversal algorithms: Inorder, Preorder and Postorder, Constructing Binary
Tree from given Tree Traversal, Operation of Insertion, Deletion, Searching & Modification of data in Binary Search Tree. Threaded Binar
trees, Huffman coding using Binary Tree, AVL Tree and B Tree
STET
COMPUTE
R SCIENCE Unit 4:Algorithms
Algorithm Analysis, Time Space Tradeoff, Asymptotic Notations,
Conditional asymptotic notation, Removing condition from the conditional
asymptotic notation, Properties of big-Oh notation. Recurrence equations,
Solving recurrence equations, Analysis of linear search, Divide and
Conquer: General Method, Binary Search, Finding Maximum and Minimum,
Merge Sort. General Method, Multistage Graphs, All-Pair shortest paths,
Optimal binary search trees. General Method, 8-Queens problem,
Hamiltonian problem. Connected Components, Spanning Trees,
Biconnected components, Introduction to NP Hard and NP-Completeness
Introduction to OS – its functional behavior and responsibilities, Need for some of monitor / command
interpreter, Types of operating systems, System structure, Hierarchical and layered organization of OS, I/O
methods and interrupt structure. Process definition, Process states and state transitions, Parallel
processes and constructs, Process interaction, Operating system kernel, Data structures for processes and
resources, Context switching, Process control primitives, Process scheduling. The determinacy problem,
Mutual exclusion, Semaphores, Process synchronization, Conditional critical regions and monitors, Inter-
process communication, Deadlock problem and its solutions. Memory management concepts,
Relocation, Linking, Multiprogramming with fixed partitions, Swapping, Variables partitions, Overlays,
Virtual memory, Segmentation, Paging, Storage allocation strategies, Load control and thrashing
Organization of file and I/O subsystems, Directory management, Basic file system, file descriptors, File
manipulation, File organization methods, Management of auxiliary storage space, Command language and
file system utilities, I/O subsystems, Programmed I/O, DMA, Interrupt driven I/O, Recovery procedures.
Protection and Security: Safeguards, Penetration, Access and Information flow control, Protection
problems, Formal models of protection.
Unit 6:Database Management System

Introduction to Database, components and structure of DBMS – logical structure – the 3
level architecture and mapping among them. Comparison between traditional file based
system and DBMS. Advantages and drawbacks of DBMS. Relational Model - What is
relational model, Relational key constraints – candidate key, primary key, foreign key.ER
Model – entities, attributes, relationship, and cardinality. Entity types, Entity sets Attributes
and Keys Relationship types, Relationship Sets, converting ER diagram to relational tables.
Database Schema Database Anomalies, CODD Rules and Normalization theory, 1 NF, 2 NF, 3
NF and BCNF. Introduction to transaction and concept of concurrency control. Transaction
and system concepts, desirable properties of transactions, transaction support in SQL.
Concurrency control techniques, the locking protocol, serializable schedules, locks, 2 phase
commit. Techniques, concurrency control based on timestamp ordering
Unit 7:Computer Network

Introduction to Data Communication and Computer Network, Network Topologies,
classification of computer network, Parallel & Serial Transmission, Transmission Models,
Transmission Channel, Data Rate, Bandwidth Signal Encoding Schemes, Data Compression,
Transmission Impairments, Layering and Design Issues, OSI Model and TCP/ IP model. Data
Link Layer: Need for Data Link Control, Frame Design Consideration, Flow Control & Error
Control. MAC sublayer, contention based and polling based MAC protocols. Network Layer:
Routing, Congestion control, Internetworking principles, Internet Protocols (IPv4, packet
format, Hierarchal addressing sub netting, ARP, PPP), Bridges, Routers. Classless IP address.
Datalink Layer: Process to process communication. Socket meaning and socket address.
Upward and downwards multiplexing. UDP and TPDU. Application Layer: HTTP, FTP, Telnet,
SMTP, SNMP
Unit 8: Software Engineering

Introduction to Software Engineering: Characteristics, Emergence of Software Engineering,
Software Metrics & Models, Process & Product Metrics. Software Life Cycle Models: Waterfall
Prototype and Spiral Models and their Comparison. Software Project Management: Size
Estimation- LOC and FP Metrics, Cost Estimation-Delphi and Basic COCOMO, Introduction to
Halstead’s Software Science, Staffing Level Estimation- Putnam’s Model. Software
Requirements Specification: SRS Documents, their Characteristics and Organization.
Software Design: Classification, Software Design Approaches, Function Oriented Software
Design, Structured Analysis- Data flow Diagrams and Structured Design, Introduction to
Object Oriented Design. Coding and Testing of Software: Unit Testing, Block Box Testing,
White Box Testing, Debugging, Program Analysis Tools, System Testing. Software Reliability
and Quality Assurance: Reliability Metric- Musa’s Basic Model. Software Quality Assurance:
ISO 9000 and SEI CMM and their Comparison. Software Maintenance: Maintenance Process
Models and Reverse Engineering, Estimation of Maintenance Costs
Unit 9: Object Oriented Programming Review of Fundamentals

of Procedural Programming, Class and Objects, Data
Abstraction, Information Hiding & Encapsulation, Constructors,
destructors, and object creation, Name space and references ,
Class Methods , Methods Overloading , Inheritance ,
Polymorphism , Abstract Classes, Abstract Methods , Exceptions
, Exception Handling
Unit 10: Web-Based Application Development
Internet Basics, Introduction to Web Development, Node.js

and Git, HTML, CSS, JQuery, JavaScript and HTTP (forms),
Sessions and HTTP, Javascript & Document Object Model –
DOM, Extensible Markup Language – XML, Document Type
Definition - DTD Dreamweaver, PHP HyperText PreProcessor -
PHP SQL & MySQL, Integrating PHP and MySQL,Database
Interaction
Unit 11: Theory of Computation
Introduction; Alphabets, Strings and Languages; Automata and Grammars, Deterministic finite Automata (DFA)-Formal
Definition, Simplified notation: State transition graph, Transition table, Language of DFA, Non-deterministic finite Automata
(NFA), NFA with epsilon transition, Language of NFA, Equivalence of NFA and DFA, Minimization of Finite Automata,
Distinguishing one string from other. Regular expression (RE) , Definition, Operators of regular expression and their
precedence, Algebraic laws for Regular expressions, Kleen’s Theorem, Regular expression to FA, DFA to Regular expression,
Arden Theorem, Non Regular Languages, Pumping Lemma for regular Languages . Application of Pumping Lemma, Closure
properties of Regular Languages, Decision properties of Regular Languages, FA with output: Moore and Mealy machine,
Equivalence of Moore and Mealy Machine, Applications and Limitation of FA. Context free grammar (CFG) and Context
Free Languages (CFL): Definition, Examples, Derivation ,Derivation trees, Ambiguity in Grammer, Inherent ambiguity,
Ambiguous to Unambiguous CFG, Useless symbols, Simplification of CFGs, Normal forms for CFGs: CNF and GNF, Closure
properties of CFLs, Decision Properties of CFLs: Emptiness, Finiteness and Memership, Pumping lemma for CFLs. Push
Down Automata (PDA): Description and definition, Instantaneous Description, Language of PDA, Acceptance by Final state,
Acceptance by empty stack, Deterministic PDA, Equivalence of PDA and CFG, CFG to PDA and PDA to CFG, Two stack PDA
Turing machines (TM): Basic model, definition and representation, Instantaneous Description, Language acceptance by TM,
Variants of Turing Machine, TM as Computer of Integer functions, Universal TM, Church’s Thesis, Recursive and recursively
enumerable languages, Halting problem, Introduction to Undecidability, Undecidable problems about TMs. Post
correspondence problem (PCP), Modified PCP, Introduction to recursive function theory
Unit 12:Internet of Things
Definitions and Functional Requirements - Motivation - Architecture - Web 3.0 View of IoT - Ubiquitous IoT
Applications - Four Pillars of IoT - DNA of IoT -The Toolkit Approach for End-user Participation in the
Internet of Things. Middleware for IoT: Overview -Communication middleware for IoT - IoT Information
Security. Protocol Standardization for IoT - Efforts - M2M and WSN Protocols - SCADA and RFID
Protocols- Issues with IoT Standardization - Unified Data Standards -Protocols -IEEE 802.15.4 - BACNet
Protocol Modbus - KNX - ZigbeeNetwork layer - APS layer –Security. Web of Things versus Internet of
Things - Two Pillars of the Web - Architecture standardization for WoT Platform Middleware for WoT -
Unified Multitier WoT Architecture - WoT Portals and Business Intelligence. Cloud of Things: Grid/SOA and
Cloud Computing - Cloud Middleware - Cloud Standards - Cloud Providers and Systems - Mobile cloud
Computing - The Cloud of Things Architecture. Industrial Internet of Things - Introduction to Industrial
Internet of Things - Industrie 4.0 - Industrial Internet of Things (IIoT) - IIoT Architecture - Basic Technologies
- Applications and Challenges - Security and Safety - Introduction to Security and Safety -Systems Security -
Network Security - Generic Application Security - Application Process Security and Safety - Reliable-and-
Secure-by-Design IoT Applications - Run-Time Monitoring - The ARMET Approach - Privacy and
Dependability The Role of the Internet of Things for Increased Autonomy and Agility in Collaborative
Production Environments -Resource Management in the Internet of Things: Clustering, Synchronization and
Software Agents. Applications - Smart Grid -Electrical Vehicle charging
Unit 13:Artificial Intelligence
INTRODUCTION TO Al AND PRODUCTION SYSTEMS: Introduction to AI-Problem formulation, Problem

Definition -Production systems, Control strategies, Search strategies. Problem characteristics, Production
system characteristics - Specialized productions system- Problem solving methods – Problem graphs,
Matching, Indexing and Heuristic functions -Hill ClimbingDepth first and Breath first, Constraints
satisfaction – Related algorithms, Measure of performance and analysis of search algorithms.
REPRESENTATION OF KNOWLEDGE: Game playing – Knowledge representation, Knowledge representation
using Predicate logic, Introduction to predicate calculus, Resolution, Use of predicate calculus, Knowledge
representation using other logic-Structured representation of knowledge. KNOWLEDGE INFERENCE:
Knowledge representation -Production based system, Frame based system. Inference – Backward chaining,
Forward chaining, Rule value approach, Fuzzy reasoning – Certainty factors, Bayesian TheoryBayesian
Network-Dempster – Shafer theory. PLANNING AND MACHINE LEARNING: Basic plan generation systems
– Strips -Advanced plan generation systems – K strips - Strategic explanations - Why, Why not and how
explanations. Learning- Machine learning, adaptive Learning. EXPERT SYSTEMS: Expert systems –
Architecture of expert systems, Roles of expert systems – Knowledge Acquisition – Meta knowledge,
Heuristics. Typical expert systems – MYCIN, DART, XOON, Expert systems shells.
Unit 14: Fundamental of E-Commerce
Introduction to Electronic Commerce: Introduction of commerce, Electronic commerce

framework, electronic commerce and media convergence, the anatomy of e-commerce
application. The Network for Electronic Commerce: Need of network, market forces
influencing the I-way, components of I-way, network access equipment, and global
information distribution network. The Internet as a Network Infrastructure: Introduction,
the Internet terminology, NSFNET: Architecture and Components, Internet governance: The
Internet Society.
Network Security & Firewalls: Client-Server network security, security threats in client-server, firewalls and network security,
data & message security, encrypted documents and electronic mail. Electronic Commerce & World Wide Web:
Introduction, architectural framework for electronic commerce, WWW as an architecture, security in the web. Consumer
Oriented Electronic Commerce: Introduction, consumer oriented application, mercantile process models, mercantile models
from the consumer’s perspective, mercantile models from the merchant’s perspective. Electronic Payment Systems:
Introduction, types of electronic payment system, digital token based electronic payment systems, smart cards and electronic
payment systems, credit cards systems, Threat on electronic payment system. Inter-organizational Commerce & Electronic
Data Interchange: Introduction, EDI application in business, EDI: legal, security, and privacy issues, EDI and electronic
commerce. The Corporate Digital Library: Introduction, dimensions of electronic commerce systems, types of digital
documents, Issues behind document infrastructure, corporate data warehouses.
Unit 15: Multimedia
Definition - Classification - Multimedia application -Multimedia Hardware - Multimedia

software - CDROM - DVD. Multimedia Audio: Digital medium - Digital audio technology -
sound cards - recording - editing - MP3 - MIDI fundamentals - Working with MIDI - audio file
formats - adding sound to Multimedia project. Multimedia Text: Text in Multimedia -
Multimedia graphics: coloring - digital imaging fundamentals - development and editing - file
formats - scanning and digital photography. Multimedia Animation: Computer animation
fundamentals - Kinematics - morphing - animation s/w tools and techniques. Multimedia
Video: How video works - broadcast video standards - digital video fundamentals – digital
video production and editing techniques - file formats. Multimedia Project: stages of
project - Multimedia skills - design concept - authoring - planning and costing –Multimedia
Team. Multimedia-looking towards Future: Digital Communication and New Media,
Interactive Television, Digital Broadcasting, Digital Radio, Multimedia Conferencing
Unit 15: Multimedia
Definition - Classification - Multimedia application -Multimedia Hardware - Multimedia

software - CDROM - DVD. Multimedia Audio: Digital medium - Digital audio technology -
sound cards - recording - editing - MP3 - MIDI fundamentals - Working with MIDI - audio file
formats - adding sound to Multimedia project. Multimedia Text: Text in Multimedia -
Multimedia graphics: coloring - digital imaging fundamentals - development and editing - file
formats - scanning and digital photography. Multimedia Animation: Computer animation
fundamentals - Kinematics - morphing - animation s/w tools and techniques. Multimedia
Video: How video works - broadcast video standards - digital video fundamentals – digital
video production and editing techniques - file formats. Multimedia Project: stages of
project - Multimedia skills - design concept - authoring - planning and costing –Multimedia
Team. Multimedia-looking towards Future: Digital Communication and New Media,
Interactive Television, Digital Broadcasting, Digital Radio, Multimedia Conferencing
Consider two binary numbers A = 110001 and B

= 001100. What is the result of (A AND B) OR
(NOT A AND NOT B)?
(A)000010
(B) 110001
(C) 001100
(D) 111101
Which of the following is a self-complementing binary code,

where adjacent codes differ in only one bit position?
BCD
ASCII
Gray
Code
EBCDIC
How many bits are used to represent a single

decimal digit in Gray Code?
(A) 4 bits
(B) 8 bits
(C) 16 bits
(D) 10 bits
A binary-to-gray code converter is an example

of:
(A) Encoder
(B) Decoder
(C) Comparator
(D) Multiplexer
Which statement accurately describes a Programmable Logic Device (PLD)?
(A) PLDs can only be programmed once and cannot be reconfigured.

(B) PLDs are used exclusively for memory storage in digital circuits.
(C) PLDs allow for both input and output programming to implement custom
logic functions.
(D) PLDs consist of only AND gates and do not include OR gates.
Which of the following applications is a typical use of

microcontrollers in the field of home automation?
(A) Satellite communication

(B) Air traffic control
(C) Temperature and lighting control
(D) Space exploration
What does the term "harvard architecture" refer to in the context

of microcontrollers?
(A) A type of microcontroller with high processing speed

(B) A microcontroller architecture that uses a separate memory
space for instructions and data
(C) A microcontroller with advanced addressing modes
(D) A microcontroller with a large number of I/O ports
What is the primary purpose of using Don't Care conditions in

Karnaugh Map simplification?
(A) To mark cells that should not be included in the simplification

process
(B) To indicate cells that have an undefined logic value
(C) To identify cells that are already in their simplest form
(D) To mark cells with special logic functions
De Morgan's First Theorem states that the complement of a

___________ of variables is equal to the of their individual
complements
(A) AND, OR
(B) OR, AND
(C) NAND, NOR
(D) NOR, NAND
The hexadecimal number F4 is equivalent to which binary

number?
(A) 11111001
(B) 11110100
(C) 11111100
(D) 11111010
When converting a binary number to Gray Code, what is the result

of XORing the most significant bit (MSB) of the binary number
with the next bit?
(A) The MSB of the Gray Code

(B) The LSB of the Gray Code
(C) The XOR of all the bits in the binary number
(D) The XOR of all the bits in the Gray Code
In an ideal microcomputer, what is the purpose of the clock or

oscillator circuit?
(A) Providing power to the microcomputer

(B) Displaying time and date information
(C) Generating timing signals to synchronize operations
(D) Cooling the microcomputer components
What is the worst-case time complexity of Binary Search for an

array of size "n"?
(A) O(log n)
(B) O(n)
(C) O(n log n)
(D) O(1)
The minimum number of edges in a spanning tree of a connected

graph with "n" vertices is:
(A) n
(B) n - 1
(C) n + 1
(D) n(n-1)/2
Which property of dynamic programming is particularly useful for

solving Optimal Binary Search Tree problems?
(A) Optimal substructure

(B) Greedy choice property
(C) Divide and Conquer
(D) Linear programming
The Floyd-Warshall algorithm is a popular method for solving the

All-Pair Shortest Paths problem. What is the time complexity of
the Floyd-Warshall algorithm for a graph with "n" vertices?
(A) O(n)
(B) O(n log n)
(C) O(n^2)
(D) O(n^3)
What is the time complexity of the Divide and Conquer algorithm

for finding the maximum and minimum elements in an array of
size "n"?
(A) O(n)
(B) O(log n)
(C) O(n log n)
(D) O(n^2)
In multistage graphs, what is the property of optimality?
(A) The shortest path between any two stages is the one with
the fewest edges
(B) The shortest path between any two stages is the one with
the lowest total cost
(C) The shortest path between any two stages is the one with
the highest total cost
(D) The shortest path between any two stages is the one with
the most vertices
Which of the following is not a common example of an abstract

data type?
(A) Stack
(B) Integer
(C) Queue
(D) List
Which traversal technique is used to visit each node of a linked

list exactly once?
(A) Preorder traversal

(B) Inorder traversal
(C) Postorder traversal
(D) Linear traversal
In pointer implementation of linked lists, which operation can be

performed in constant time (O(1)) when inserting or deleting
nodes?
(A) Inserting at the beginning

(B) Inserting at the end
(C) Inserting at a specific position
(D) Deleting a specific node
Which representation is best suited for matrices with a small

number of non-zero elements in each row and column?
(A) Triplet representation

(B) Compressed sparse row (CSR) format
(C) Compressed sparse column (CSC) format
(D) Array representation
Which of the following representations is most suitable for

efficient row-wise traversal of a sparse matrix?
(A) Triplet representation

(B) Compressed sparse row (CSR) format
(C) Compressed sparse column (CSC) format
(D) Array representation
In computer graphics, arrays can be used to store pixel values for

images. Which type of array would be suitable for this purpose?
(A) 1-D array

(B) 2-D array
(C) 3-D array
(D) 4-D array
For a 2-D array represented in row-major order, the index

formula to access the element at row "i" and column "j" using
the base address "B" is:
(A) Index = B + (i * n + j)
(B) Index = B + ( j * n + i)
(C) Index = B + (i + j)
(D) Index = B + (i * m + j)
The Banker's algorithm is an example of a deadlock:
(A) Avoidance algorithm

(B) Detection algorithm
(C) Prevention algorithm
(D) Termination algorithm
The concept of monitors was introduced by:
(A) Edsger Dijkstra

(B) Alan Turing
(C) Tim Berners-Lee
(D) Linus Torvalds
Priority Scheduling involves assigning a priority value to each

process. Which scheduling algorithm is closely related to this
concept?
(A) FCFS
(B) SJN
(C) Multilevel Queue Scheduling
(D) First-Come, First-Served (FCFS)
The resource matrix is a data structure used in deadlock

detection algorithms to:
(A) Represent resource allocation

(B) Represent the execution order of processes
(C) Represent the execution history of processes
(D) Represent the priority of processes
The term "race condition" in parallel programming refers to:
(A) A competition between processes to terminate first

(B) A competition between processes to access shared
resources
(C) A situation where a process is stuck in a loop
(D) A situation where processes are running sequentially
The need for a command interpreter arises because:
(A) Hardware cannot execute programs directly

(B) All programming languages require an interpreter
(C) Software cannot run on hardware
(D) Users prefer typing commands over using GUIs
The term "multi-user" in an OS context refers to:

(A) An OS that can execute multiple programs simultaneously
(B) An OS that supports multiple users working on the same

machine
(C) An OS that can only run on multiple computers
(D) An OS with a graphical user interface
____________ offers the ability to query the data and insert,

alter, and delete tuples.
(A) Transaction Control Language (TCL)

(B) Data Control Language (DCL)
(C) Data Definition Language (DDL)
(D) Data Manipulation Language (DML)
Which of the following is a database?
(A) MySQL
(B) Informix
(C) SQL Server
(D) All of the above
Which of the following is a database?
(A) MySQL
(B) Informix
(C) SQL Server
What do you mean by one to many relationships?
(A) Many teachers may have many classes

(B) One class may have many teachers
(C) One teacher can have many classes
(D) Many classes may have many teachers
In general, a file is basically a collection of all related _.
(A) Rows & Columns

(B) Database
(C) Fields
(D) Records
Which of the following refers to the number of attributes in a

relation?
(A) Row
(B) Degree
(C) Column
A report generator is used to
(A) Update file

(B) Print file on paper
(C) Both of the above
(D) None of the above
A large computer information system maintains many

different computer files. Which amongst them is called
a perpetual file?
(A) Specialized File

(B) Master File
(C) Log File
(D) Update File
Subnetting allows for:
(A) Faster data transmission

(B) Improved error control
(C) Efficient use of IP addresses
(D) Increased network security
Upward multiplexing involves:
(A) Combining multiple data streams into one

(B) Distributing data to different physical channels
(C) Separating data into smaller units
(D) Reordering data packets
Process-to-process communication involves

communication between:
(A) Different network layers

(B) Different devices on the same network
(C) Devices using different protocols
(D) Processes on different devices
The HTTP protocol is used for:
(A) Email communication

(B) File transfers
(C) Web browsing
(D) Remote terminal access
The term HTTP stand for:
(A) Hyper Terminal Tracing Program

(B) Hypertext Tracing Program
(C) Hypertext Transfer Protocol
(D) Hypertext Tracing Protocol
The maximum length (in bytes) of an IPv4 datagram is:
(A) 32
(B) 256
(C) 1024
(D) 65535
Which software life cycle model is based on iterative

prototyping?
(A) Waterfall model
(B) Spiral model
(C) Agile model
(D) Prototype model
In the context of software project management, what

is LOC an acronym for?
(A) Line of Change

(B) Level of Complexity
(C) Lines of Code
(D) List of Components
In the context of software project management, what

is LOC an acronym for?
(A) Line of Change

(B) Level of Complexity
(C) Lines of Code
(D) List of Components
The Cost Estimation technique that involves expert

judgments and consensus is called:
(A) COCOMO
(B) Delphi Method
(C) Waterfall Model
(D) Prototype Model
ISO 9000 and SEI CMM are both frameworks related to:
(A) Software testing

(B) Software documentation
(C) Software quality assurance and process
improvement
(D) Software design principles
Which type of maintenance involves adding new

features to existing software?
(A) Corrective Maintenance

(B) Perfective Maintenance
(C) Adaptive Maintenance
(D) Preventive Maintenance
The framework that provides guidelines for achieving

consistent and high-quality software is:
(A) COCOMO
(B) ISO
(C) Delphi Method
(D) Agile Manifesto
Which maintenance process involves documenting the

software's structure and functionality?
(A) Reverse Engineering

(B) Preventive Maintenance
(C) Perfective Maintenance
(D) Adaptive Maintenance
What is the term for defining multiple methods in a

class with the same name but different parameters?
(A) Overriding
(B) Overloading
(C) Inheriting
(D) Inheritance
What is the main advantage of using abstract classes over interfaces?
(A) Abstract classes can have multiple inheritance, unlike interfaces

(B) Interfaces can have constructors, while abstract classes cannot
(C) Abstract classes can provide default implementations of methods
(D) Interfaces allow for private access modifiers, unlike abstract classes
What is the main purpose of using namespaces in

programming?
(A) To provide data encapsulation

(B) To organize code into logical groups
(C) To define abstract classes
(D) To handle exceptions
What is the term for creating a new class that inherits

properties and behaviors from an existing class?
(A) Polymorphism
(B) Encapsulation
(C) Abstraction
(D) Derivation
What is the primary purpose of an interface in OOP?
(A) To provide a blueprint for creating objects

(B) To define a set of methods that must be
implemented by implementing classes
(C) To define constructors for classes
(D) To create static methods
What is the term for a variable that references an

instance of a class?
(A) Property
(B) Method
(C) Object
(D) Constructor

Handout 1

Uploaded by

Copyright:

Available Formats

You might also like

Handout 1

Uploaded by

Document Information

Original Description:

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Handout 1

Uploaded by

Copyright:

Available Formats

STET COMPUTER

PREVIOUS YEAR PAPER ANALYSIS

Unit 1: Digital Logic

Unit 3:Programming and data structure

Unit 6:Database Management System

Unit 7:Computer Network

Unit 8: Software Engineering

Unit 9: Object Oriented Programming Review of Fundamentals

Unit 10: Web-Based Application Development

Internet Basics, Introduction to Web Development, Node.js

Unit 12:Internet of Things

Unit 13:Artificial Intelligence

INTRODUCTION TO Al AND PRODUCTION SYSTEMS: Introduction to AI-Problem formulation, Problem

Unit 14: Fundamental of E-Commerce

Introduction to Electronic Commerce: Introduction of commerce, Electronic commerce

Unit 15: Multimedia

Definition - Classification - Multimedia application -Multimedia Hardware - Multimedia

Unit 15: Multimedia

Definition - Classification - Multimedia application -Multimedia Hardware - Multimedia

Consider two binary numbers A = 110001 and B

Which of the following is a self-complementing binary code,

How many bits are used to represent a single

A binary-to-gray code converter is an example

Which statement accurately describes a Programmable Logic Device (PLD)?

(A) PLDs can only be programmed once and cannot be reconfigured.

Which of the following applications is a typical use of

(A) Satellite communication

What does the term "harvard architecture" refer to in the context

(A) A type of microcontroller with high processing speed

What is the primary purpose of using Don't Care conditions in

(A) To mark cells that should not be included in the simplification

De Morgan's First Theorem states that the complement of a

The hexadecimal number F4 is equivalent to which binary

When converting a binary number to Gray Code, what is the result

(A) The MSB of the Gray Code

In an ideal microcomputer, what is the purpose of the clock or

(A) Providing power to the microcomputer

What is the worst-case time complexity of Binary Search for an

The minimum number of edges in a spanning tree of a connected

Which property of dynamic programming is particularly useful for

(A) Optimal substructure

The Floyd-Warshall algorithm is a popular method for solving the

What is the time complexity of the Divide and Conquer algorithm

In multistage graphs, what is the property of optimality?

Which of the following is not a common example of an abstract

Which traversal technique is used to visit each node of a linked

(A) Preorder traversal

In pointer implementation of linked lists, which operation can be

(A) Inserting at the beginning

Which representation is best suited for matrices with a small

(A) Triplet representation

Which of the following representations is most suitable for

(A) Triplet representation

In computer graphics, arrays can be used to store pixel values for

(A) 1-D array

For a 2-D array represented in row-major order, the index

The Banker's algorithm is an example of a deadlock: