Screening Test for recruitment to the post of ASSISTANT SYSTEM ENGINEER IN THE OFFICE OF THE DTE OF HR & TECHNICAL EDUATION — question paper

Source note: KSLC indexes previous-year papers for practice and revision. Copyright and official exam ownership remain with the respective examination authorities. When a record uses an official public source, use that authority's notice as final.

Historical paper · reviewed structured rendering

Screening Test for recruitment to the post of ASSISTANT SYSTEM ENGINEER IN THE OFFICE OF THE DTE OF HR & TECHNICAL EDUATION

Paper #3113 · 21-09-2019 · 123 reviewed questions · Showing 81–120 of 123

Close paper

Accuracy note: This is a reviewed structured rendering of an official previous-year paper and may cover only part of it. Where available, explanatory notes describe unresolved source or answer issues without supplying a scoring answer. Official examination authority notices remain final.

Complete original Series II question PDF, including its original figures and options. KSLC numbered study explanations cover all 150 positions in 6 source-reference sections. Independently worked KSLC answers, not an official key or student-suggested answers. 146 positions have a worked answer; 4 unresolved printed-choice items have explanations for later review. Best-effort source searches did not establish a matching official key. These sections accompany the original PDF and are not new individually auto-scoring MCQ cards. Examination: 21 September 2019 in the official source filename; recruitment cycle: not independently established from the booklet cover.

  1. Given the C declarations int a = 4; int b = 6;, what value does a == b produce when printed using %d?
    1. Prints 0
    2. Prints 1
    3. Compilation error
    4. No output
  2. In C, consider:
    typedef char x[10];
    x myarray[5];
    Assuming each char occupies one byte, what value does sizeof(myarray) return?
    1. 15 bytes
    2. 10 bytes
    3. 50 bytes
    4. 30 bytes
  3. Evaluate this C integer expression using standard precedence and left-to-right associativity for *, /, and %:
    4 + 6 / 3 * 2 - 2 + 7 % 3
    1. 3
    2. 4
    3. 6
    4. 7
  4. Consider the following declarations and assignments in standard C. Which statement correctly identifies the invalid assignments?
    char *a, *b, c[10], d[10];
    a = b;
    b = c;
    c = d;
    d = a;
    1. Only a = b is invalid
    2. Only b = c is invalid
    3. Both c = d and d = a are invalid
    4. All four assignments are valid
  5. In standard C, what is the result of this statement?
    printf("%d", ++5);
    1. It prints 5
    2. It prints 6
    3. It violates a language constraint; a diagnostic is required
    4. It has undefined behavior only when executed
  6. In Java, how many bytes does a value of the primitive type double occupy?
    1. 4 bytes
    2. 8 bytes
    3. 16 bytes
    4. The size varies by JVM or operating system
  7. Let Root be a class and Branch a subclass of Root. If thisBranch refers to a Branch object, what is the value of the Java expression thisBranch instanceof Root?
    1. True
    2. False
    3. It is a compile-time error
    4. It throws an exception
  8. Which Java package contains the StringTokenizer class?
    1. java.io
    2. java.util
    3. java.lang
    4. java.net
  9. In Java, which method may be invoked by the garbage collector before reclaiming an object if the class overrides it? (Legacy finalization is deprecated and invocation is not guaranteed.)
    1. A destructor method
    2. A constructor
    3. The finally block
    4. finalize()
  10. In process synchronization, what is a critical section (critical region)?
    1. The code segment in which a process accesses shared data or a shared resource
    2. An operating-system routine executed only during system startup
    3. A block of main memory reserved exclusively for one process
    4. A queue of processes waiting to be scheduled
  11. Which set lists all four necessary conditions for deadlock (the Coffman conditions) in a resource-allocation system?
    1. Mutual exclusion, hold-and-wait, no preemption, and circular wait
    2. Mutual exclusion, preemption, circular wait, and starvation
    3. Hold-and-wait, paging, no preemption, and circular wait
    4. Mutual exclusion, hold-and-wait, deadlock prevention, and circular wait
  12. What decision does a disk-scheduling algorithm make?
    1. The order in which pending disk I/O requests are serviced
    2. The order in which CPU processes are executed
    3. The physical disk locations where files are stored
    4. The directories in which files are organized
  13. In virtual-memory management, what does the dirty bit for a page indicate?
    1. The page contains corrupted data
    2. The page is the wrong page for the process
    3. The page has been modified since it was loaded from backing storage
    4. The page is the least recently accessed page
  14. In a typical process-state model, a process is blocked while waiting for an I/O operation. When the I/O completes, which state does it enter next?
    1. Ready
    2. Running
    3. Suspended
    4. Terminated
  15. Which page-replacement policy can exhibit Belady’s anomaly, in which increasing the number of page frames can increase the number of page faults?
    1. FIFO (First-In, First-Out)
    2. Optimal replacement
    3. LRU (Least Recently Used)
    4. LFU (Least Frequently Used)
  16. Which CPU-scheduling policy is commonly suited to interactive, time-sharing systems because it gives each ready process a turn for a fixed time quantum?
    1. Round robin
    2. First-come, first-served
    3. Shortest job first
    4. Non-preemptive priority scheduling
  17. In Unix-like command-line usage, which command is not generally a filter that reads input data and produces transformed or selected output?
    1. date
    2. sort
    3. cat
    4. grep
  18. Assuming the referenced parent directories exist, what does the command cd ../../.. do in a Unix-like shell?
    1. Changes to the directory three levels above the current directory
    2. Changes to the parent directory only
    3. Leaves the current directory unchanged
    4. It is invalid because cd accepts only one dot
  19. In finite-state machines, how does output generation in a Moore machine differ from that in a Mealy machine?
    1. A Moore machine’s output depends only on its current state; a Mealy machine’s output depends on its current state and current input
    2. A Moore machine’s output depends on state and input; a Mealy machine’s output depends only on state
    3. Both machines’ outputs depend only on the current state
    4. A Moore machine’s output depends only on input; a Mealy machine’s output depends only on state
  20. Which class of formal languages can a finite-state machine recognize?
    1. Regular languages
    2. Context-free languages only
    3. Context-sensitive languages only
    4. All recursively enumerable languages
  21. The pumping lemma for regular languages is commonly used to prove that a language is:
    1. Regular
    2. Not regular
    3. Context-free
    4. Equivalent to a particular regular expression
  22. Consider the context-free grammar
    S → aB | bA
    A → a | aS | bAA
    B → b | bS | aBB
    Which property holds for every terminal string generated from S?
    1. It contains equal numbers of a and b
    2. It contains exactly one more a than b
    3. It contains exactly one more b than a
    4. It always has odd length
  23. Which grammar generates a language that no finite-state machine can recognize?
    1. S → Sa | a
    2. S → abX; X → cY; Y → d | aX
    3. S → aSb | ab
    4. S → a | b
  24. Which operation is context-free languages (CFLs) not closed under? Here, “not closed” means that applying the operation to CFLs can produce a language that is not context-free.
    1. Union
    2. Kleene star
    3. Complementation
    4. Concatenation
  25. A pushdown automaton with how many unbounded stacks can simulate a Turing machine?
    1. No stack
    2. One stack
    3. Two stacks
    4. Three or more stacks are required
  26. Can any Turing machine decide, for every possible program and input, whether that program eventually halts on that input?
    1. Yes, by simulating the program until it halts or repeats
    2. No; the general halting problem is undecidable
    3. It is an open problem in computer science
    4. It depends only on the programming language
  27. Using the POSIX expr utility in a Unix-like shell, which command reports an error because it attempts division by zero?
    1. expr 4 + 5
    2. expr 9 - 3
    3. expr 2 \* 3
    4. expr 7 / 0
  28. Assume each logged-in terminal appears as one line in who output. If 7 terminals are logged in, what does this shell command display?
    date; who | wc -l
    1. The current date/time, followed by 7
    2. The current date/time, followed by 8
    3. The current date/time, followed by 1
    4. An error message
  29. When mv renames a file within the same filesystem, what does it primarily change?
    1. The directory entry (name/path); the file’s inode and contents remain the same
    2. The file’s contents and inode number
    3. Only the inode number, without changing the directory entry
    4. Only the file’s permission bits
  30. A relation is in 1NF, and every non-prime attribute is fully functionally dependent on each candidate key (there is no partial dependency on a proper subset of a candidate key). What is the highest normal form guaranteed by this condition?
    1. First normal form (1NF)
    2. Second normal form (2NF)
    3. Third normal form (3NF)
    4. Boyce–Codd normal form (BCNF)
  31. In the Chen notation for an entity–relationship (E–R) diagram, what do ellipses (ovals) represent?
    1. Entity sets
    2. Relationships
    3. Attributes
    4. Connections between diagram symbols
  32. A data model is a collection of concepts used to describe which aspects of a database?
    1. Data and data relationships only
    2. Data semantics and consistency constraints only
    3. Data, data relationships, data semantics, and consistency constraints
    4. None of the above
  33. In conceptual database design, entity–relationship (E–R) modeling is generally considered which approach?
    1. Top-down
    2. Bottom-up
    3. Left-to-right
    4. None of the above
  34. When a foreign key in a child table references the primary key of a parent table, what relationship does this establish?
    1. A referential parent–child link, typically supporting a one-to-many relationship
    2. A many-to-many relationship without an intermediate table
    3. A network-model connection between the tables
    4. A relationship that prevents the parent row from having multiple children
  35. A weak entity is identified using the key of an owner entity together with its own partial key. What is the usual cardinality from the owner entity to the weak entity?
    1. One-to-one
    2. One-to-many
    3. Many-to-many
    4. No identifying relationship is required
  36. Under a standard shared/exclusive locking protocol, assume no conflicting lock request is queued. Transaction A holds a shared lock S(R). Transaction B requests S(R). What happens?
    1. B is granted the shared lock immediately because shared locks are compatible
    2. B is rejected because R is already locked
    3. B must wait until A releases its shared lock
    4. The two transactions enter a deadlock
  37. In Oracle SQL, what result set does this query return?
    SELECT 'Hi' FROM DUAL WHERE 1 = NULL;
    1. One row containing Hi
    2. One row containing FALSE
    3. One row containing TRUE
    4. An empty result set
  38. Which join matches rows from two tables using an equality condition between their columns?
    1. Non-equijoin
    2. Self-join
    3. Equijoin
    4. Outer join
  39. Under standard SQL logical-operator precedence, in what order are NOT, AND, and OR evaluated when parentheses do not override it?
    1. NOT first, then AND, then OR
    2. NOT first, then OR, then AND
    3. AND first, then OR, then NOT
    4. In the order the operators appear
  40. Consider the grammar over {a, b}:
    S → aSa | bSb | a | b
    Which language does it generate?
    1. All palindromes over {a, b}, of both odd and even lengths
    2. All odd-length palindromes over {a, b}
    3. All strings whose first and last symbols are equal
    4. All even-length palindromes over {a, b}

Browse all previous-year papers