Examius
🇮🇳 NIMCET · flashcards
NIMCET Computer Awareness Flashcards
60 question-and-answer cards covering Computer Awareness as it is examined in NIMCET. 24 of them are printed below, taken from across the deck — no signup, no paywall on the preview.
24 sample cards from the Computer Awareness deck
Sampled from the end of the deck, so these are different cards from the ones shown on the syllabus page.
What is a queue and which principle does it follow?
A queue is a linear data structure following FIFO (First In, First Out); insertion is at the rear and deletion at the front.
What is a circular queue and what problem does it solve?
A queue where the last position connects to the first, solving the wasted-space problem of a linear queue by reusing freed front slots.
Give one common application each of a stack and a queue.
Stack: function call management / expression evaluation / undo. Queue: CPU/process scheduling / printer spooling / BFS.
What is a linked list?
A linear data structure where elements (nodes) are stored non-contiguously; each node holds data and a pointer to the next node.
Differentiate between a singly linked list and a doubly linked list.
A singly linked list has one pointer (to next node); a doubly linked list has two pointers (to both next and previous nodes).
State one advantage of a linked list over an array.
Dynamic size and efficient O(1) insertion/deletion at known positions without shifting elements.
What is a tree data structure?
A hierarchical, non-linear data structure of nodes with one root and parent-child relationships, having no cycles.
What is the maximum number of nodes in a binary tree of height h (root height = 0)?
2^(h+1) - 1 nodes.
What is a Binary Search Tree (BST)?
A binary tree where each node's left subtree contains smaller values and right subtree contains larger values, enabling O(log n) search.
Name the three depth-first tree traversal methods.
Inorder (Left-Root-Right), Preorder (Root-Left-Right), and Postorder (Left-Right-Root).
What is a graph and how does it differ from a tree?
A graph is a set of vertices connected by edges; unlike a tree it can have cycles, no hierarchy, and multiple paths between nodes.
Differentiate between a directed and an undirected graph.
In a directed graph edges have direction (one-way); in an undirected graph edges are bidirectional (two-way).
What are BFS and DFS in graph traversal?
BFS (Breadth-First Search) explores level by level using a queue; DFS (Depth-First Search) explores as deep as possible using a stack/recursion.
What is an operating system?
System software that manages hardware and software resources and acts as an interface between the user and the computer.
Name common types of operating systems by processing mode.
Batch, Time-sharing (multitasking), Real-time, Distributed, Network, and Multiprocessing operating systems.
What is a real-time operating system (RTOS)?
An OS that processes data and responds within strict time constraints (deadlines), used in embedded/control systems like medical and avionics devices.
What is the difference between multiprogramming and multitasking?
Multiprogramming keeps multiple programs in memory to maximize CPU use; multitasking (time-sharing) rapidly switches the CPU among tasks to serve multiple users/programs interactively.
What is virtual memory?
A memory-management technique that uses disk space as an extension of RAM, allowing execution of programs larger than physical memory.
What is paging in memory management?
A technique that divides logical memory into fixed-size pages and physical memory into frames, eliminating external fragmentation.
Differentiate between internal and external fragmentation.
Internal fragmentation is unused space within an allocated block; external fragmentation is unused space scattered between allocated blocks.
What is thrashing in an operating system?
A condition where excessive paging (page faults) causes the system to spend more time swapping pages than executing processes, sharply reducing performance.
Define the term 'process' in an operating system.
A process is a program in execution, including its code, current activity, and associated resources (registers, stack, data).
Differentiate between preemptive and non-preemptive scheduling.
In preemptive scheduling the CPU can be taken from a running process (e.g., Round Robin); in non-preemptive a process keeps the CPU until it finishes or blocks (e.g., FCFS).
Name four common CPU scheduling algorithms.
First-Come First-Served (FCFS), Shortest Job First (SJF), Priority Scheduling, and Round Robin (RR).
What this deck covers
The Computer Awareness deck follows the NIMCET Computer Awareness syllabus — 4 chapters and 14 topics — so questions land on material that is genuinely examinable rather than trivia around it. That works out to roughly 15.0 cards per chapter.
Answers are written to be recallable, not just readable — averaging about 124 characters, which is long enough to carry the reasoning and short enough to say out loud.
A deck like this earns its keep on the second and third pass. Read the syllabus first so you know the shape of the subject, then use the cards to find the specific facts that have not stuck.
Computer Awareness flashcards FAQ
How many Computer Awareness flashcards are in this NIMCET deck?
60 cards. This page previews 24 of them, sampled evenly across the deck so you can judge the difficulty before installing anything.
Are these NIMCET flashcards free?
Yes. The preview here is free to read with no signup, and the full 60-card deck is free inside the Examius app.
What do the Computer Awareness cards cover?
They follow the NIMCET Computer Awareness syllabus — 4 chapters and 14 topics — so the questions track what is actually examinable.
How should I use these flashcards?
Read the syllabus first so you know the shape of the subject, then drill the deck. Examius schedules each card with spaced repetition, so cards you keep missing come back sooner and ones you know drift further apart.