IOE PapersTU
PYQs & Syllabus Archive
ENCT 101Bachelor in Industrial Engineering · Semester 11 Paper Available

Computer Programming

Past examination question papers and complete curriculum syllabus for Computer Programming (ENCT 101), Bachelor in Industrial Engineering Semester 1 under Institute of Engineering (IOE), Tribhuvan University.

Past Question Papers (PDF)

Switch tabs to view different exam papers

1st-sem_Computer Programming.pdf

IOE Past Examination Paper

Download PDF
Served via fast CDN. Read in full view or download for offline study.
Drive Mirror ↗Direct Download ↓

Document information: This past examination paper is identified as an IOE/TU academic document and was cataloged from a public Google Drive archive. This independent website did not create the examination paper and is not affiliated with TU or IOE.

Rights holders can request correction or removal by emailing subeshgaming@gmail.com with this page URL and supporting details.

Most Frequently Asked Questions

Top recurring IOE board exam questions for Computer Programming with verified mark schemes, formula notation, and recurrence frequency.

Showing 30 of 30 top repeated questions

Introduction to Computer Programming

6 Questions
#1Asked in 14 Exam Sessions[8 Marks]Introduction to Computer Programming
Explain the basic structure of a FORTRAN program. What are the fundamental data types in FORTRAN? Write a FORTRAN program to read and sort 10 integers entered by the user in ascending order.
Appeared in:2082 Shrawan2082 Baishakh2081 Bhadra2080 Bhadra2079 Bhadra2076 Chaitra2076 Ashwin2074 Ashwin2073 Shrawan2073 Chaitra2071 Chaitra2070 Ashad2069 Ashad2068 Shrawan
#2Asked in 7 Exam Sessions[4 Marks]Introduction to Computer Programming
Explain in brief the steps involved during the compilation process in C along with a suitable block diagram showing the roles of the preprocessor, compiler, assembler, and linker.
Appeared in:2081 Baishakh2080 Baishakh2078 Bhadra2076 Chaitra2076 Ashwin2073 Shrawan2071 Chaitra
#3Repeated 5 Times[6 Marks]Introduction to Computer Programming
Write a program in FORTRAN to read a positive integer from the user and check whether it is a prime number or not using a DO loop and IF condition.
Appeared in:2080 Baishakh2078 Bhadra2076 Chaitra2072 Kartik2070 Ashad
#4Repeated 2 Times[6 Marks]Introduction to Computer Programming
What is an algorithm and a flowchart? Draw a flowchart and write an algorithm to find the largest of three numbers entered by the user.
Appeared in:2081 Bhadra2079 Baishakh
#5Repeated 2 Times[6 Marks]Introduction to Computer Programming
Differentiate between compiler, interpreter, and assembler. Explain the steps of the program compilation process in C.
Appeared in:2082 Baishakh2078 Bhadra
#6Repeated 2 Times[8 Marks]Introduction to Computer Programming
Explain how Arithmetic IF and Logical IF statements work in FORTRAN. Write a FORTRAN program to find the roots of a quadratic equation $ax^2 + bx + c = 0$.
Appeared in:2081 Bhadra2082 Baishakh

Operators and Expressions

3 Questions
#1Repeated 5 Times[6 Marks]Operators and Expressions
Define precedence and associativity of operators with examples. Differentiate between formatted and unformatted input/output functions (printf/scanf vs gets/puts/getchar/putchar) in C.
Appeared in:2082 Baishakh2080 Bhadra2079 Bhadra2074 Ashwin2072 Kartik
#2Repeated 2 Times[6 Marks]Operators and Expressions
Explain formatted and unformatted I/O functions in C with examples. Differentiate between `getch()`, `getche()`, and `getchar()`.
Appeared in:2082 Baishakh2079 Bhadra
#3Repeated 2 Times[6 Marks]Operators and Expressions
Explain operator precedence and associativity in C. What is type casting? Explain implicit and explicit type casting with suitable code snippets.
Appeared in:2082 Shrawan2078 Chaitra

Control Structures

5 Questions
#1Asked in 12 Exam Sessions[4 Marks]Control Structures
Write a program in C to check whether a number entered by the user is prime or composite. Also draw a flowchart for the algorithm.
Appeared in:2082 Shrawan2082 Baishakh2081 Bhadra2081 Baishakh2080 Bhadra2078 Bhadra2076 Chaitra2076 Ashwin2074 Ashwin2073 Shrawan2071 Chaitra2068 Shrawan
#2Repeated 6 Times[4 Marks]Control Structures
Compare nested if with else if ladder structure along with their flowcharts. Write a program to determine the largest among three numbers using nested if-else.
Appeared in:2082 Shrawan2081 Baishakh2076 Chaitra2076 Ashwin2074 Ashwin2071 Chaitra
#3Repeated 5 Times[5 Marks]Control Structures
Write a program to check whether a given N-digit positive integer is an Armstrong number or not. (Hint: A number equal to the sum of its own digits each raised to the power of the number of digits, e.g. 1634 = 1^4 + 6^4 + 3^4 + 4^4).
Appeared in:2080 Baishakh2079 Bhadra2076 Ashwin2073 Chaitra2071 Chaitra
#4Repeated 2 Times[8 Marks]Control Structures
Differentiate between `while` and `do-while` loops in C. Write a program to check whether a given integer number is an Armstrong number or not.
Appeared in:2081 Bhadra2082 Shrawan
#5Repeated 2 Times[8 Marks]Control Structures
Explain the `switch-case` statement with syntax and flow diagram. Write a menu-driven C program to perform basic calculator operations (+, -, *, /) using switch-case.
Appeared in:2082 Baishakh2080 Bhadra

Array and Pointer

6 Questions
#1Asked in 9 Exam Sessions[8 Marks]Array and Pointer
Define pointer. List down the importance of pointer in C programming. Describe the relationship between 1D array and pointer with a suitable code example.
Appeared in:2082 Baishakh2081 Bhadra2080 Baishakh2078 Bhadra2076 Ashwin2074 Ashwin2071 Chaitra2070 Ashad2068 Shrawan
#2Asked in 7 Exam Sessions[8 Marks]Array and Pointer
Define 1D and 2D arrays. Write a program in C to read an m x n matrix from the user, pass it to a user-defined function, and calculate and display the transpose of the matrix.
Appeared in:2082 Baishakh2081 Baishakh2080 Baishakh2076 Ashwin2074 Ashwin2069 Ashad2068 Shrawan
#3Repeated 5 Times[4 Marks]Array and Pointer
Write a program in C to reverse a string without using any string handling library function (e.g. strrev()). Also explain how to find the length of a string without using strlen().
Appeared in:2082 Shrawan2082 Baishakh2081 Bhadra2080 Baishakh2076 Ashwin
#4Repeated 2 Times[8 Marks]Array and Pointer
Explain how a 2D array can be passed to a function. Write a C program to multiply two $3 \times 3$ matrices using user-defined functions.
Appeared in:2081 Bhadra2079 Baishakh
#5Repeated 2 Times[8 Marks]Array and Pointer
What is pointer arithmetic? Write a program in C to illustrate the concept of pointer arithmetic and swap two variables using pointers (call by reference).
Appeared in:2081 Bhadra2082 Baishakh
#6Repeated 2 Times[8 Marks]Array and Pointer
Explain dynamic memory allocation functions in C (`malloc()`, `calloc()`, `realloc()`, and `free()`). Write a program to dynamically allocate memory for $N$ integers, sort them in ascending order, and free the memory.
Appeared in:2082 Shrawan2078 Bhadra

User-defined Functions

4 Questions
#1Asked in 8 Exam Sessions[6 Marks]User-defined Functions
Write a program in C to display the nth term of a Fibonacci sequence using a recursive function. The value of n is entered by the user.
Appeared in:2082 Baishakh2081 Bhadra2079 Bhadra2076 Ashwin2074 Ashwin2072 Kartik2071 Chaitra2068 Shrawan
#2Asked in 7 Exam Sessions[4 Marks]User-defined Functions
What do you mean by 'call by value and call by reference'? Explain the differences with suitable examples and memory diagrams.
Appeared in:2082 Shrawan2081 Bhadra2080 Bhadra2076 Ashwin2070 Ashad2069 Ashad2068 Shrawan
#3Repeated 4 Times[4 Marks]User-defined Functions
Write a program to calculate the factorial of an integer entered by the user using the concept of a recursive function. Explain how memory is allocated on the call stack during recursive execution.
Appeared in:2082 Shrawan2081 Baishakh2078 Bhadra2073 Shrawan
#4Repeated 2 Times[6 Marks]User-defined Functions
What is function prototyping and function recursion? Write a recursive C program to calculate the factorial of a given positive integer.
Appeared in:2081 Bhadra2080 Baishakh

Structures

4 Questions
#1Repeated 6 Times[6 Marks]Structures
Write a program to define a structure named 'person' with members Name, Address, Salary, and Phone Number. Input details of 100 persons and display the entered information in descending order of salary.
Appeared in:2080 Baishakh2078 Bhadra2076 Chaitra2073 Shrawan2071 Chaitra2069 Ashad
#2Repeated 5 Times[8 Marks]Structures
What is a structure? Why is it necessary? Write a program to add two distances given in feet and inches using a user-defined structure.
Appeared in:2082 Shrawan2081 Bhadra2079 Bhadra2074 Ashwin2072 Kartik
#3Repeated 2 Times[8 Marks]Structures
What do you mean by nested structure? Write a C program to input roll, name, and address (city, street, ward) of 50 students using nested structures and display them.
Appeared in:2082 Baishakh2081 Bhadra
#4Repeated 2 Times[6 Marks]Structures
Differentiate between structure and union with memory layout diagrams. Write a program to demonstrate the size difference between a structure and a union containing identical members.
Appeared in:2082 Shrawan2079 Bhadra

File Management

2 Questions
#1Asked in 8 Exam Sessions[8 Marks]File Management
How is a binary file different from a text file? Write the syntax and use of fseek() and rewind() functions in C. Write a C program to write records of N students (Name, Roll, Marks) into a data file and display students scoring above 40.
Appeared in:2082 Shrawan2081 Bhadra2080 Baishakh2079 Bhadra2076 Ashwin2074 Ashwin2072 Kartik2071 Chaitra
#2Repeated 2 Times[8 Marks]File Management
Differentiate between text and binary files. Write a C program to write student records (roll, name, marks) into a binary file `student.dat` and read them back to display students who scored greater than 60 marks.
Appeared in:2081 Bhadra2082 Baishakh

Curriculum Syllabus & Course Topics

Sourced from TU curriculum portal
Full Syllabus (PDF)
Chapter-wise Units & Micro-Syllabus Topics (10 Units)

  1. 1. Introduction to Computer Programming

    • 1.1Definition of a computer program and programming language
    • 1.2Types and generations of programming languages
    • 1.3Problem-solving using a computer
    • 1.3.1Problem analysis
    • 1.3.2Algorithm and flowchart
    • 1.3.3Programming
    • 1.3.4Compilation, linking and execution
    • 1.3.5Debugging and testing
    • 1.3.6Documentation

  2. 2. Overview of C Programming

    • 2.1Introduction to C programming
    • 2.2History and importance of C
    • 2.3C headers and library functions
    • 2.4Basic structure of a C program
    • 2.5Preprocessor directives
    • 2.6Tokens in C (Character set, keywords and identifiers)
    • 2.7Type casting (Implicit and explicit)
    • 2.8Data types, variables and constants
    • 2.9Compiler and IDE for C programming

  3. 3. Operators and Expressions

    • 3.1Introduction to operators and expressions
    • 3.2Arithmetic, relational and logical operators
    • 3.3Assignment, increment and decrement operators
    • 3.4Conditional, bitwise and special operators
    • 3.5Comma operator, size of operator
    • 3.6Evaluation and type conversion in expressions
    • 3.7Operator precedence and associativity

  4. 4. Input and Output

    • 4.1Introduction to data I/O in C
    • 4.2Unformatted I/O
    • 4.2.1Character I/O
    • 4.2.2String I/O
    • 4.3Formatted I/O
    • 4.3.1Control string (Flags, field width, precision, and specifier)
    • 4.3.2Formatted I/O (scanf(), printf())

  5. 5. Control Structures

    • 5.1Introduction to simple and compound statement
    • 5.2Sequential statement
    • 5.3Branching statement
    • 5.3.1Simple if statement
    • 5.3.2if-else statement
    • 5.3.3Nested if-else statement
    • 5.3.4else-if ladder
    • 5.3.5switch statement
    • 5.3.6go to statement
    • 5.4Looping statement
    • 5.4.1for loop
    • 5.4.2while loop
    • 5.4.3do while
    • 5.4.4Nested loop
    • 5.5Loop interruption
    • 5.5.1break
    • 5.5.2continue

  6. 6. Array and Pointer

    • 6.1Introduction to an array
    • 6.2One-dimensional array
    • 6.3Two-dimensional array
    • 6.4Multidimensional array
    • 6.5Introduction to string
    • 6.6String handling functions
    • 6.7Definition of a pointer
    • 6.8Pointer declaration
    • 6.9Pointer arithmetic
    • 6.10Relationship between pointer and arrays

  7. 7. User-defined Functions

    • 7.1Introduction to function
    • 7.2Advantages of function
    • 7.3Elements of user-defined function
    • 7.3.1Function definition
    • 7.3.2Function prototype
    • 7.3.3Function parameters
    • 7.4Storage class
    • 7.5Scope rules
    • 7.6Category of functions
    • 7.6.1Functions with no arguments and no return values
    • 7.6.2Functions with arguments and no return values
    • 7.6.3Functions with arguments and return values
    • 7.6.4Functions with no arguments and return values
    • 7.7Recursive functions
    • 7.8Function call by values and reference
    • 7.9Passing array and string to function

  8. 8. Structures

    • 8.1Defining a structure
    • 8.2Declaring and accessing structure elements
    • 8.3Initializing structure
    • 8.4Array of structure
    • 8.5Array as member to structure
    • 8.6Pointer as member to structure
    • 8.7Structure as a member to structure
    • 8.8Passing and returning structures to/from function

  9. 9. File Management

    • 9.1Introduction
    • 9.2Binary and text file in C
    • 9.3File opening modes
    • 9.4Defining, opening and closing file
    • 9.5Input-output operations on files
    • 9.5.1Character I/O (fputc(), fgetc())
    • 9.5.2String I/O (fgets(), fputs())
    • 9.5.3Formatted I/O (fscanf(), fprintf())
    • 9.5.4Record I/O (fwrite(), fread())
    • 9.6Overview of random file access
    • 9.7Error handling

  10. 10. Recent Trends in Programming

    • 10.1Introduction to object oriented programming (OOP)
    • 10.2Definitions of class, method and object in OOP
    • 10.3Difference between procedure oriented and OOP
    • 10.4Overview of other high level programming languages Practic al , (45 hours) 1. Lab 1: Introduction and demonstrations of projects written in C 2. Lab 2: Formatted and unformatted Input/output in C 3. Lab 3: Branching in control structure 4. Lab 4: Looping in control structure 5. Lab 5: Array in C 6. Lab 6: String in C 7. Lab 7: Pointers in C 8. Lab 8: User defined functions in C 9. Lab 9: Structure in C 10. Lab 10: File handling in C 11. Group project on C maximum 4 students in a group at the end of the course. Reference 1. Lafore, R. (1993). The Waite Group's C programming using Turbo C++ (1st ed.). SAMS Publishing. 2. Balagurusamy, E. (2019). Programming in ANSI C (8th ed.). McGraw Hill Education. 3. Gottfried, B. S. (2010). Programming with C (3rd ed.). McGraw Hill Education.

Examination Scheme & Marks Distribution

Evaluation Structure

  • Final Board Theory Exam: 60 Marks (Pass mark: 24)
  • Internal Assessment: 40 Marks (Pass mark: 16)
  • Practical / Lab Exam: 25 or 50 Marks (Continuous lab evaluation + viva, where applicable)

* This is the general current IOE 60/40 scheme; verify course-specific details in the syllabus above.

Exam Preparation Guidelines

  • Review the available past examination paper to understand question styling, typical derivation topics, and marks allocation.
  • Practice writing clean algorithms and code implementations, tracing dry runs with sample inputs, and explaining complexity trade-offs.
  • Structure answers with labeled diagrams, concise bullet points, and highlight final answers in numerical solutions.

Frequently Asked Questions (Computer Programming)

Q: How can I download Computer Programming past question papers?

You can preview or download the Computer Programming question papers (PDF) directly using the built-in viewer on this page with zero redirects or paywalls.

Q: What is the pass mark for Computer Programming?

The general current scheme is a 60-mark final theory exam and a 40-mark internal assessment, with pass marks of 24 and 16. Verify the course-specific syllabus above.

Q: Where can I find the complete syllabus for this subject?

The available chapter-wise syllabus and topic breakdown is indexed in the Syllabus section above, with links to the curriculum PDF source.

Authentic IOE Past Papers
Free Direct PDF Download
Curriculum Syllabus & Marking Scheme