I85PREP
⌘ K
TU BSc CSIT Entrance study materials
TU BSc CSIT Entrance study resources

TU BSc CSIT Entrance practice questions

One question at a time. Build your TU BSc CSIT Entrance understanding.

First 50 of 200 questions. Each one lists the choices, the correct answer, and an explanation. The checker at the top of this page saves progress in this browser when it is available.

Continue in the practice tool above to load more questions, 50 at a time.

Question 1B.Sc.CSIT Entrance (subject domains not enumerated in source)

In a number system, the base (radix) of a positional numeral system determines which property?

  1. The speed at which the processor executes arithmetic instructions
  2. The maximum value a single byte can hold
  3. The number of bits needed to store one character in ASCII
  4. The number of distinct digit symbols used before a carry to the next position Correct answer.

Explanation

The radix of a positional system equals the count of distinct digit symbols available in each position; once a position reaches the radix value it carries one place to the left. Binary has radix 2, decimal radix 10, and hexadecimal radix 16. Storage size and processor speed are unrelated hardware concerns.

Question 2B.Sc.CSIT Entrance (subject domains not enumerated in source)

A C program declares int x = 7; and computes x / 2 where x is an int and 2 is an int literal. What value is stored?

  1. 3.5
  2. 3.0
  3. 4
  4. 3 Correct answer.

Explanation

When both operands of the division operator are integers, C performs integer division and truncates the fractional part toward zero. Thus 7/2 yields 3, and the result type remains int, so no decimal point appears. Floating-point division would require at least one operand of type float or double.

Question 3B.Sc.CSIT Entrance (subject domains not enumerated in source)

Which logic gate produces a HIGH output only when all of its inputs are HIGH?

  1. NOR gate
  2. OR gate
  3. XOR gate
  4. AND gate Correct answer.

Explanation

An AND gate outputs 1 only for the input combination in which every input is 1; any 0 input forces the output to 0. An OR gate outputs 1 when at least one input is 1, and XOR outputs 1 only when inputs differ. NOR is the complement of OR.

Question 4B.Sc.CSIT Entrance (subject domains not enumerated in source)

Which data structure follows the Last-In-First-Out (LIFO) discipline for insertion and deletion?

  1. Queue
  2. Linked list
  3. Stack Correct answer.
  4. Binary search tree

Explanation

A stack inserts and removes elements at the same end, called the top, so the most recently pushed element is the first popped, which is LIFO. A queue removes from the front and inserts at the rear, giving FIFO behaviour. Linked lists and trees permit access at many positions and are not defined by LIFO ordering.

Question 5B.Sc.CSIT Entrance (subject domains not enumerated in source)

In the relational model, which key uniquely identifies each tuple of a relation and cannot contain a null value?

  1. Superkey
  2. Primary key Correct answer.
  3. Foreign key
  4. Candidate key

Explanation

A primary key is the candidate key chosen to identify tuples and is defined to be unique and non-null. A candidate key is also unique but the chosen primary key is the one enforced with the NOT NULL constraint. A foreign key references another relation and may repeat values, while a superkey need not be minimal.

Question 6B.Sc.CSIT Entrance (subject domains not enumerated in source)

Which protocol translates human-readable domain names such as example.edu.np into IP addresses?

  1. ARP
  2. FTP
  3. DHCP
  4. DNS Correct answer.

Explanation

The Domain Name System resolves domain names into IP addresses so that applications can reach hosts without knowing numeric addresses. DHCP assigns IP configuration to hosts, FTP transfers files, and ARP maps IP addresses to MAC addresses on a local network.

Question 7B.Sc.CSIT Entrance (subject domains not enumerated in source)

What is the binary representation of the decimal number 45?

  1. 101101 Correct answer.
  2. 100111
  3. 101011
  4. 110101

Explanation

Converting 45 by repeated division by 2 gives remainders 1,0,1,1,0,1 read upward, producing 101101. Checking the place values: 32 + 8 + 4 + 1 = 45. The other bit patterns sum to different decimal values.

Question 8B.Sc.CSIT Entrance (subject domains not enumerated in source)

Which of the following is an example of system software rather than application software?

  1. An operating system that manages hardware resources Correct answer.
  2. A spreadsheet used for accounting
  3. A word processor used to draft a report
  4. A web browser used for research

Explanation

System software manages hardware and provides a platform on which other programs run; the operating system is the canonical example. Word processors, browsers, and spreadsheets are application software written to perform user-oriented tasks on top of the system software.

Question 9B.Sc.CSIT Entrance (subject domains not enumerated in source)

Simplify the Boolean expression F = A + A·B using the laws of Boolean algebra.

  1. A Correct answer.
  2. A·B
  3. A + B
  4. B

Explanation

The absorption law states that A + A·B = A, because if A is 1 the whole expression is 1 regardless of B, and if A is 0 both terms vanish. This is confirmed by factoring: A(1 + B) = A·1 = A. The variable B therefore has no effect on the output.

Question 10B.Sc.CSIT Entrance (subject domains not enumerated in source)

A two-dimensional array int a[4][5] is stored in row-major order with 4 bytes per integer and base address 1000. What is the address of a[2][3]?

  1. 1060
  2. 1052 Correct answer.
  3. 1048
  4. 1044

Explanation

In row-major order the offset is (row × number of columns + column) × element size, giving (2 × 5 + 3) × 4 = 13 × 4 = 52. Adding the base address 1000 yields 1052. Row-major storage fills all five columns of a row before moving to the next row.

Question 11B.Sc.CSIT Entrance (subject domains not enumerated in source)

What is the time complexity of binary search on a sorted array of n elements?

  1. O(log n) Correct answer.
  2. O(1)
  3. O(n log n)
  4. O(n)

Explanation

Binary search halves the search interval on each comparison, so the number of steps is proportional to log₂n, giving O(log n). Linear search on an unsorted array would be O(n), and sorting first would add O(n log n). Constant time is impossible because the interval must shrink repeatedly.

Question 12B.Sc.CSIT Entrance (subject domains not enumerated in source)

In an SQL table Student(roll, name, marks), which query returns names of students whose marks exceed the average marks of all students?

  1. SELECT name, AVG(marks) FROM Student WHERE marks > AVG(marks);
  2. SELECT name FROM Student HAVING marks > AVG(marks);
  3. SELECT name FROM Student WHERE marks > (SELECT AVG(marks) FROM Student); Correct answer.
  4. SELECT name FROM Student WHERE marks > AVG(marks);

Explanation

Aggregate functions cannot appear directly in a WHERE clause, so the average must be computed in a subquery that returns a single scalar value. The outer query then compares each row's marks against that value. This produces exactly the students above the overall average.

Question 13B.Sc.CSIT Entrance (subject domains not enumerated in source)

Which normal form eliminates partial dependency of a non-prime attribute on part of a composite primary key?

  1. Boyce-Codd Normal Form
  2. Third Normal Form
  3. First Normal Form
  4. Second Normal Form Correct answer.

Explanation

Second Normal Form requires that the relation already be in 1NF and that every non-prime attribute depend fully on the whole candidate key, removing partial dependencies. Third Normal Form goes further by removing transitive dependencies on non-prime attributes. BCNF tightens the condition for every determinant.

Question 14B.Sc.CSIT Entrance (subject domains not enumerated in source)

A process is in the running state and its time quantum expires while other processes of equal priority are waiting. What transition occurs under preemptive round-robin scheduling?

  1. Running to waiting
  2. Running to ready Correct answer.
  3. Waiting to ready
  4. Ready to running

Explanation

When a time quantum expires the process is still able to run but loses the CPU, so it moves from running to the ready queue. Running to waiting occurs when a process blocks for I/O, and ready to running occurs when the dispatcher selects a process. Waiting to ready happens when an I/O operation completes.

Question 15B.Sc.CSIT Entrance (subject domains not enumerated in source)

What is the decimal value of the hexadecimal number 2F?

  1. 31
  2. 63
  3. 47 Correct answer.
  4. 45

Explanation

In hexadecimal, 2F means 2 × 16 + 15, since F represents 15. That gives 32 + 15 = 47. Each hex digit is weighted by a power of 16 from right to left.

Question 16B.Sc.CSIT Entrance (subject domains not enumerated in source)

In an operating system, which of the following best describes thrashing?

  1. Excessive page faults caused by too small a degree of multiprogramming
  2. Excessive page faults caused by too many processes competing for too few frames Correct answer.
  3. A process repeatedly requesting the same I/O device
  4. A deadlock in which two processes wait for each other's resources

Explanation

Thrashing occurs when the combined working sets of active processes exceed available physical frames, so each process keeps faulting pages in and out and the CPU spends most time on paging. The usual remedy is to reduce the degree of multiprogramming or allocate more frames. It is a memory-management pathology, not a deadlock or an I/O contention issue.

Question 17B.Sc.CSIT Entrance (subject domains not enumerated in source)

In the OSI reference model, at which layer does a router primarily operate when forwarding packets between networks?

  1. Physical layer
  2. Data link layer
  3. Network layer Correct answer.
  4. Transport layer

Explanation

Routers forward packets based on logical network addresses such as IP addresses, which is the function of the network layer (layer 3). Switches operate mainly at the data link layer using MAC addresses, and hubs at the physical layer. Transport-layer functions such as port-based multiplexing belong to end hosts.

Question 18B.Sc.CSIT Entrance (subject domains not enumerated in source)

What is the output of the following C code? int i = 0; while (i < 5) { i++; if (i == 3) continue; printf("%d", i); }

  1. 12345
  2. 124
  3. 1245 Correct answer.
  4. 1234

Explanation

The loop increments i before the test, so values 1 through 5 are considered. When i equals 3 the continue statement skips the remaining body, so 3 is never printed, and the loop then prints 1, 2, 4, and 5. The loop ends when i reaches 5 and the condition fails.

Question 19B.Sc.CSIT Entrance (subject domains not enumerated in source)

Which of the following best describes the purpose of a constructor in an object-oriented language such as Java?

  1. To allow a subclass to inherit methods from a superclass
  2. To initialize the state of an object when it is created Correct answer.
  3. To destroy an object and release its memory
  4. To create a new class at runtime

Explanation

A constructor is invoked when an object is instantiated and is used to initialize its instance variables or establish invariants. It has the same name as the class and no return type. Object destruction is handled by garbage collection or destructors, and inheritance is a separate class relationship.

Question 20B.Sc.CSIT Entrance (subject domains not enumerated in source)

A relation R(A, B, C) has functional dependencies A → B and B → C. Which statement about R is correct?

  1. R is in BCNF because A is a superkey
  2. R cannot be normalized because B is not a key
  3. R is in 3NF because every attribute is prime
  4. R is in 2NF but not in 3NF because of the transitive dependency A → B → C Correct answer.

Explanation

Since A determines B and B determines C, C is transitively dependent on the key A through the non-prime attribute B. That transitive dependency violates Third Normal Form, though the relation is in 2NF because the only candidate key is A and there are no partial dependencies. Decomposition into R1(A, B) and R2(B, C) removes the violation.

Question 21B.Sc.CSIT Entrance (subject domains not enumerated in source)

Which scheduling algorithm can lead to starvation of long jobs because it always selects the job with the smallest estimated run time?

  1. First Come First Serve
  2. Round Robin
  3. First-In-First-Out with a fixed quantum
  4. Shortest Job First Correct answer.

Explanation

Shortest Job First always chooses the process with the smallest burst time, so a long process may be repeatedly overtaken by newly arriving short processes and never run. FCFS and round robin order processes by arrival or by a rotating queue, which bounds waiting time. Round robin additionally guarantees each process a quantum.

Question 22B.Sc.CSIT Entrance (subject domains not enumerated in source)

In C, what does the expression *p++ do when p is a pointer to int?

  1. Dereferences p and increments the pointed-to value
  2. Increments p twice and then dereferences it
  3. Dereferences p and then increments the pointer to the next int Correct answer.
  4. Increments the value pointed to by p, then dereferences it

Explanation

The postfix ++ binds tighter than the unary *, so the expression is parsed as *(p++). The value of p is used for dereferencing and then p is advanced to the next element, with the increment scaled by sizeof(int). To increment the pointed-to value one would write (*p)++.

Question 23B.Sc.CSIT Entrance (subject domains not enumerated in source)

A subnet uses the address 192.168.10.0 with mask 255.255.255.224. How many usable host addresses does each subnet provide?

  1. 62
  2. 30 Correct answer.
  3. 32
  4. 14

Explanation

The mask 255.255.255.224 has 27 network bits, leaving 5 host bits, so each subnet contains 2⁵ = 32 addresses. Subtracting the network and broadcast addresses leaves 30 usable host addresses. A /26 mask would give 62 usable hosts and a /28 mask 14.

Question 24B.Sc.CSIT Entrance (subject domains not enumerated in source)

A binary search tree is built by inserting the keys 50, 30, 70, 20, 40, 60, 80 in that order. Which traversal lists the keys in ascending order?

  1. Preorder traversal
  2. Postorder traversal
  3. Inorder traversal Correct answer.
  4. Level-order traversal

Explanation

An inorder traversal of a binary search tree visits the left subtree, then the root, then the right subtree, which yields keys in sorted order: 20, 30, 40, 50, 60, 70, 80. Preorder and postorder place the root before or after its subtrees and do not produce sorted output. Level-order visits nodes by depth.

Question 25B.Sc.CSIT Entrance (subject domains not enumerated in source)

Consider a paging system with a 32-bit logical address space, page size 4 KB, and a page table entry of 4 bytes. What is the size of a single-level page table for one process?

  1. 1 MB
  2. 4 KB
  3. 4 MB Correct answer.
  4. 16 MB

Explanation

A 4 KB page means 12 bits of offset, leaving 20 bits for the page number, so there are 2²⁰ = 1,048,576 pages. With 4 bytes per entry the table occupies 2²⁰ × 4 = 2²² bytes, which is 4 MB. The large size of such tables motivates multilevel paging.

Question 26B.Sc.CSIT Entrance (subject domains not enumerated in source)

In the context of the B.Sc.CSIT entrance examination, which of the following best defines an algorithm?

  1. A finite sequence of unambiguous steps that solves a problem in a finite number of operations. Correct answer.
  2. A programming language with strict syntax rules enforced at compile time.
  3. A data structure that stores elements in contiguous memory locations.
  4. A hardware component that executes arithmetic and logical instructions.

Explanation

An algorithm is an abstract, finite procedure: it must terminate, be unambiguous, and produce a result for valid inputs. It is not tied to a specific language, hardware, or data structure, though it may use them.

Question 27B.Sc.CSIT Entrance (subject domains not enumerated in source)

What is the decimal equivalent of the binary number 101101₂?

  1. 43
  2. 44
  3. 46
  4. 45 Correct answer.

Explanation

Evaluate the binary number by summing the place values where bits are 1: 32 + 8 + 4 + 1 = 45. The positions 5, 3, 2, and 0 have value 1, giving 2⁵ + 2³ + 2² + 2⁰.

Question 28B.Sc.CSIT Entrance (subject domains not enumerated in source)

In a relational database, which key is chosen from the candidate keys to uniquely identify each tuple in a relation?

  1. Superkey
  2. Primary key Correct answer.
  3. Foreign key
  4. Alternate key

Explanation

A primary key is a candidate key selected by the database designer to be the principal unique identifier for tuples in a relation. It must be unique and not null, and only one primary key can be chosen per relation.

Question 29B.Sc.CSIT Entrance (subject domains not enumerated in source)

Which of the following is an example of a volatile memory used in a computer system?

  1. RAM Correct answer.
  2. Hard disk
  3. Flash memory
  4. ROM

Explanation

Volatile memory loses its stored data when power is removed. RAM is the classic example, whereas ROM, hard disks, and flash memory retain data without power.

Question 30B.Sc.CSIT Entrance (subject domains not enumerated in source)

In the OSI reference model, which layer is responsible for end-to-end reliable delivery, flow control, and error recovery between processes?

  1. Data link layer
  2. Network layer
  3. Session layer
  4. Transport layer Correct answer.

Explanation

The transport layer provides process-to-process communication, and protocols such as TCP add reliability, flow control, and error recovery. The network layer handles host-to-host routing, while the data link layer handles hop-to-hop delivery.

Question 31B.Sc.CSIT Entrance (subject domains not enumerated in source)

What is the value of the expression 5 + 2 * 3 in most programming languages that follow standard operator precedence?

  1. 16
  2. 11 Correct answer.
  3. 10
  4. 21

Explanation

Multiplication has higher precedence than addition, so 2 * 3 is evaluated first to give 6, and then 5 + 6 yields 11. Parentheses would be needed to force addition first.

Question 32B.Sc.CSIT Entrance (subject domains not enumerated in source)

Which of the following is the binary representation of the decimal number 25?

  1. 10101
  2. 11010
  3. 10011
  4. 11001 Correct answer.

Explanation

Divide 25 repeatedly by 2: remainders from last to first give 1, 1, 0, 0, 1, so the binary form is 11001₂. Checking place values: 16 + 8 + 1 = 25.

Question 33B.Sc.CSIT Entrance (subject domains not enumerated in source)

In a spreadsheet or database, which of the following best describes a primary key?

  1. A field that links two tables together.
  2. A field that can contain duplicate values across records.
  3. A field that stores only numeric data.
  4. A field that uniquely identifies each record in a table. Correct answer.

Explanation

A primary key is a column or set of columns whose values are unique for every row, ensuring each record can be identified. It may be of any data type and is not defined by linking tables.

Question 34B.Sc.CSIT Entrance (subject domains not enumerated in source)

What is the output of the following C code? int a = 10, b = 3; printf("%d", a / b);

  1. 3 Correct answer.
  2. 3.33
  3. 0
  4. 4

Explanation

In C, division of two int operands performs integer division, truncating the fractional part. Therefore 10 / 3 evaluates to 3, and the %d format prints an integer.

Question 35B.Sc.CSIT Entrance (subject domains not enumerated in source)

A relation R(A, B, C) has functional dependencies A → B and B → C. Which of the following is true?

  1. A is a candidate key for R. Correct answer.
  2. R is in third normal form.
  3. C is a candidate key for R.
  4. B is a candidate key for R.

Explanation

From A → B and B → C, transitivity gives A → C, so A determines all attributes and is a candidate key. B determines only B and C, not A, so B is not a key; C determines nothing.

Question 36B.Sc.CSIT Entrance (subject domains not enumerated in source)

In a binary search tree, which traversal visits nodes in ascending order of their keys?

  1. Preorder
  2. Postorder
  3. Inorder Correct answer.
  4. Level order

Explanation

An inorder traversal of a binary search tree processes the left subtree, then the root, then the right subtree. Because of the BST ordering property, this yields keys in non-decreasing order.

Question 37B.Sc.CSIT Entrance (subject domains not enumerated in source)

In a paging system with a 32-bit logical address and a page size of 4 KB, how many bits are used for the page offset?

  1. 32
  2. 10
  3. 12 Correct answer.
  4. 20

Explanation

A page size of 4 KB equals 2¹² bytes, so the offset within a page requires 12 bits. The remaining 20 bits of the 32-bit logical address form the page number.

Question 38B.Sc.CSIT Entrance (subject domains not enumerated in source)

Which of the following is a characteristic of a relational database management system (RDBMS)?

  1. It stores data as a hierarchical tree with no cross-links.
  2. It stores all data in a single flat file without structure.
  3. It stores data as key-value pairs without a schema.
  4. It stores data in tables with rows and columns and enforces relationships through keys. Correct answer.

Explanation

An RDBMS organizes data into relations (tables) of tuples (rows) and attributes (columns), using keys to enforce relationships and constraints. Hierarchical, flat-file, and key-value stores are different data models.

Question 39B.Sc.CSIT Entrance (subject domains not enumerated in source)

What is the output of the following C code? int x = 5; printf("%d", x++); printf("%d", x);

  1. 56 Correct answer.
  2. 55
  3. 65
  4. 66

Explanation

The postfix increment x++ yields the current value 5 and then increments x to 6. Thus the first printf prints 5 and the second prints 6, giving 56.

Question 40B.Sc.CSIT Entrance (subject domains not enumerated in source)

Which of the following is the primary function of the Address Resolution Protocol (ARP)?

  1. To route packets between different networks.
  2. To map an IP address to a MAC address on a local network. Correct answer.
  3. To map a domain name to an IP address.
  4. To assign IP addresses dynamically to hosts.

Explanation

ARP resolves a known IPv4 address to the corresponding hardware (MAC) address on a local link by broadcasting a request. DNS resolves names, DHCP assigns addresses, and routing forwards packets between networks.

Question 41B.Sc.CSIT Entrance (subject domains not enumerated in source)

In an operating system, which of the following best describes a deadlock?

  1. A set of processes each waiting for a resource held by another in the set. Correct answer.
  2. A situation where the CPU is idle because no process is ready.
  3. A process repeatedly accessing the same memory page.
  4. A process that has finished execution but remains in the process table.

Explanation

Deadlock occurs when a cycle of processes exists, each holding a resource and waiting for another held by a process in the cycle. This matches the classic circular-wait condition.

Question 42B.Sc.CSIT Entrance (subject domains not enumerated in source)

What is the time complexity of inserting an element at the beginning of a singly linked list with n elements, assuming a pointer to the head is available?

  1. O(1) Correct answer.
  2. O(n)
  3. O(n log n)
  4. O(log n)

Explanation

Inserting at the head of a singly linked list requires creating a new node and updating two pointers, regardless of n. Thus the operation takes constant time, O(1).

Question 43B.Sc.CSIT Entrance (subject domains not enumerated in source)

A subnet uses the address 192.168.1.0 with mask 255.255.255.192. How many usable host addresses does each subnet provide?

  1. 64
  2. 30
  3. 62 Correct answer.
  4. 126

Explanation

The mask 255.255.255.192 has 26 network bits and 6 host bits, giving 2⁶ = 64 addresses per subnet. Subtracting the network and broadcast addresses leaves 62 usable host addresses.

Question 44B.Sc.CSIT Entrance (subject domains not enumerated in source)

Which of the following statements about the TCP three-way handshake is correct?

  1. The client sends SYN, the server replies ACK, and the client sends SYN-ACK.
  2. The client sends SYN, the server replies SYN-ACK, and the client sends ACK. Correct answer.
  3. The client sends SYN-ACK, the server replies SYN, and the client sends ACK.
  4. The client sends ACK, the server replies SYN, and the client sends SYN-ACK.

Explanation

TCP connection establishment uses SYN from the initiator, SYN-ACK from the responder, and a final ACK from the initiator. This synchronizes sequence numbers and confirms both directions are reachable.

Question 45B.Sc.CSIT Entrance (subject domains not enumerated in source)

In a class-based object-oriented language, what is the effect of declaring a method as static?

  1. The method belongs to the class and can be called without an instance. Correct answer.
  2. The method can be called only on objects created with new.
  3. The method is automatically overridden in subclasses.
  4. The method can access instance variables directly.

Explanation

A static method is associated with the class itself rather than with any object, so it can be invoked using the class name. It cannot directly access instance fields because no instance is bound.

Question 46B.Sc.CSIT Entrance (subject domains not enumerated in source)

Consider the Boolean expression F = (A + B)·(A + C). Which of the following is equivalent to F?

  1. A + B·C Correct answer.
  2. A·B·C
  3. A·B + C
  4. A + B + C

Explanation

Applying the distributive law in reverse, (A + B)(A + C) = A + B·C. This is a standard Boolean identity, sometimes called the consensus or distributive law.

Question 47B.Sc.CSIT Entrance (subject domains not enumerated in source)

In a paging system, a 32-bit logical address space uses a page size of 4 KB and a page table entry of 4 bytes. What is the size of the page table for a single process?

  1. 4 KB
  2. 4 MB Correct answer.
  3. 1 MB
  4. 16 MB

Explanation

With 4 KB pages, the 32-bit address has 12 offset bits and 20 page-number bits, giving 2²⁰ pages. Each entry is 4 bytes, so the table size is 2²⁰ × 4 bytes = 4 MB.

Question 48B.Sc.CSIT Entrance (subject domains not enumerated in source)

In a relational database, which of the following sets of functional dependencies violates Boyce-Codd Normal Form (BCNF)?

  1. AB → C, where AB is the only candidate key.
  2. A → B and A → C, where A is the only candidate key.
  3. A → B and C → D, where AC is the only candidate key.
  4. A → B and B → C, where A is the only candidate key. Correct answer.

Explanation

BCNF requires that every determinant be a superkey. In A → B and B → C, B is a determinant but not a superkey (since A is the only candidate key), so BCNF is violated. The other options have determinants that are superkeys.

Question 49B.Sc.CSIT Entrance (subject domains not enumerated in source)

A process uses 4 pages and is allocated 3 frames in memory. Using the FIFO page replacement algorithm, the reference string is 1, 2, 3, 4, 1, 2, 5, 1, 2, 3, 4, 5. How many page faults occur?

  1. 9 Correct answer.
  2. 7
  3. 10
  4. 8

Explanation

Simulate FIFO with 3 frames: faults at 1,2,3 (3 faults), 4 replaces 1 (4), 1 replaces 2 (5), 2 replaces 3 (6), 5 replaces 4 (7), 1 hits, 2 hits, 3 replaces 1 (8), 4 replaces 2 (9), 5 hits. Total 9 faults.

Question 50B.Sc.CSIT Entrance (subject domains not enumerated in source)

In the context of the C programming language, what is the output of the following code? int a[3] = {1, 2, 3}; int *p = a; printf("%d", *(p + 2));

  1. 3 Correct answer.
  2. 2
  3. 1
  4. Garbage value

Explanation

The array name decays to a pointer to its first element, so p points to a[0]. Pointer arithmetic p + 2 points to a[2], and dereferencing yields 3.