Placement Papers: CSC Paper Pattern

Get top class preparation for CTET/Paper-2 right from your home: get questions, notes, tests, video lectures and more- for all subjects of CTET/Paper-2.

  1. purpose of PC (program counter) in a microprocessor is________
    1. To store address of TOS (top of stack)
    2. To store address of next instructions to be executed
    3. count the number of instructions
    4. to store the base address of the stack.
  2. conditional results after execution of an instruction in a microprocess is stored in
    1. register
    2. accumulator
    3. flag register
    4. flag register part of PSW (program status word)
  3. The OR gate can be converted to the NAND function by adding________gate (s) to the input of the OR gate.
    1. NOT
    2. AND
    3. NOR
    4. XOR
  4. In 8051microcontroller, ________has a dual function.
    1. port 3
    2. port 2
    3. port 1
    4. port 0
  5. An 8085 based microprocessor with 2MHz clock frequency, will execute the following chunk of code with how much delay? MVI B, 38H HAPPY: MVI C, FFH SADDY: DCR C JNZ SADDY DCR B JNC HAPPY
    1. 102.3
    2. 114.5
    3. 100.5
    4. 120
  6. In 8085 MPU what will be the status of the flag after the execution of the following chunk of code. MVI B, FFH MOV A, B CMA HLT
    1. S = 1, Z = 0, CY = 1
    2. S = 0, Z = 1, CY = 0
    3. S = 1, Z = 0, CY = 0
    4. S = 1, Z = 1, CY = 1
  7. A positive going pulse which is always generated when 8085 MPU begins the machine cycle.
    1. RD
    2. ALE
    3. WR
    4. HOLD
  8. when a________instruction of 8085 MPU is fetched, its second and third bytes are placed in the W and Z registers.
    1. JMP
    2. STA
    3. CALL
    4. XCHG
  9. what is defined as one subdivision of the operation performed in one clock period.
    1. T-State
    2. Instruction Cycle
    3. Machine Cycle
    4. All of the above
  10. At the end of the following code, what is the status of the flags. LXI B, AEC4H MOV A, C ADD B HLT
    1. S = 1, CY = 0, P = 0, AC = 1
    2. S = 0, CY = 1, P = 0, AC = 1
    3. S = 0, CY = 1, P = 0, AC = 1
    4. S = 0, CY = 1, P = 1, AC = 1
  11. Let A and B be nodes of a heap, such that B is a child of A. The heap must then satisfy the following conditions
    1. key (A) >= key (B)
    2. key (A)
    3. key (A) = key (B)
    4. none
  12. String, List, Stack, queue are examples of________
    1. primitive data type
    2. simple data type
    3. Abstract data type
    4. none
  13. which of the following is not true for LinkedLists?
    1. The simplest kind of linked list is a single linked list, which has one link per node. This link points to the next node in the list, or to a null value or emptylist if it is the last node.
    2. a more sophisticated kind of linked list is a double linkedlist or two way linkedlist. Each node has two links, one to the previous node and one to the next node.
    3. in a circleLinkedList, the first and last nodes are linked together. This can be done only for double linked list.
    4. to traverse a circular linkedlist, u begin at any node and follow the list in either direction until u return to the original node.
  14. sentinel node at the beginning and/or at the end of the linkedlist is not used to store the data
    1. true
    2. false
  15. Input: A is non-empty list of numbers L X? -infinity For each item in the list L, do If the item > x, then X? the item Return X X represents:
    1. largest number
    2. smallest number
    3. smallest negative number
    4. none
  16. The repeated execution of a loop of code while waiting for an event to occur is called________. The cpu is not engaged in any real productive activity during this period, and the process doesn? t progress towards completion.
    1. dead lock
    2. busy waiting
    3. trap door
    4. none.
  17. Transparent DBMS is defined as
    1. A DBMS in which there are no program or user access languages.
    2. A DBMS which has no cross file capabilities but is user friendly and provides user interface management.
    3. A DBMS which keeps its physical structure hidden from user
    4. none.
  18. Either all actions are carried out or none are. Users should not have to worry about the effect of incomplete transctions. DBMS ensures this by undoing the actions of incomplete transctions. This property is known as
    1. Aggregation
    2. atomicity
    3. association
    4. data integrity.
  19. ________algorithms determines where in available to load a program. Common methods are first fit, next fit, best fit … algorithm are used when memory is full, and one process (or part of a process) needs to be swaped out to accommodate a new program. The … algorithm determines which are the partions to be swaped out:
    1. placement, placement, replacement
    2. replacement, placement, placement
    3. replacement, placement, replacement
    4. placement, replacement, replacement
  20. Trap door is a secret undocumented entry point into a program used to grant access without normal methods of access authentication. A trap is a software interrupt, usually the result of an error condition.
    1. true
    2. false.
  21. which one of the following is the recursive travel technique.
    1. depth first search
    2. preorder
    3. breadth first search
    4. none.
  22. in recursive implementations which of the following is true for saving the state of the steps
    1. as full state on the stack
    2. as reversible action on the stack
    3. both a and b
    4. none
  23. which of the following involves context switch
    1. previliged instruction
    2. floating point exception
    3. system calls
    4. all
    5. none
  24. piggy backing is a technique for
    1. acknowledge
    2. sequence
    3. flow control
    4. retransmission
  25. a functional dependency XY is ________dependency if removal of any attribute A from X means that the dependency does not hold any more
    1. full functional
    2. multi valued
    3. single valued
    4. none
  26. a relation schema R is in BCNF if it is in ________and satisfies an additional constraints that for every functional dependency XY, X must be a candidate key
    1. 1 NF
    2. 2 NF
    3. 3 NF
    4. 5 NF
  27. a ________sub query can be easily identified if it contains any references to the parent sub query columns in the ________ clause
    1. correlated, WHERE
    2. nested, SELECT
    3. correlated, SELECT
    4. none
  28. hybrid devise that combines the features of both bridge and router is known as
    1. router
    2. bridge
    3. hub
    4. brouter
  29. which of the following is the most crucial phase of SDLC
    1. testing
    2. code generation
    3. analysys and design
    4. implementation
  30. to send a data packet using datagram, connection will be established
    1. no connection is required
    2. connection is not established before data transmission
    3. before data transmission
    4. none
  31. a software that allows a personal computer to pretend as as computer terminal is
    1. terminal adapter
    2. terminal emulation
    3. modem
    4. none
  32. super key is
    1. same as primary key
    2. primary key and attribute
    3. same as foreign key
    4. foreign key and attribute
  33. In binary search tree which traversal is used for ascending order values
    1. Inorder
    2. preorder
    3. post order
    4. none
  34. You are creating an index on ROLLNO colume in the STUDENT table. Which statement will you use?
    1. CREATE INDEX roll_idx ON student, rollno
    2. CREATE INDEX roll_idx FOR student, rollno
    3. CREATE INDEX roll_idx ON student (rollno)
    4. CREATE INDEX roll_idx INDEX ON student (rollno)
  35. A________class is a class that represents a data structure that stores a number of data objects
    1. container
    2. component
    3. base
    4. derived
  36. Which one of the following phases belongs to the compiler Back-end.
    1. Lexical Analysis
    2. Syntax Analysis
    3. Optimization
    4. Intermediate Representation.
  37. Every context _sensitive language is context_free
    1. true
    2. false

Developed by: