Scribd
Upload
37 views

Computer and Programming I

This document provides information about a computer programming course for civil engineering students at Pokhara University. It outlines the course details including the semester, program, course name and code, year, maximum marks, duration of exam, and instructions for candidates. The document then lists 5 questions to be answered as part of the exam. The questions cover topics like defining digital computers and their components, booting and system software, data processing vs word processing, computer generations and their characteristics, C programming operators and gates, algorithms vs flowcharts, K-maps and logic circuits, number conversions between bases, programming exercises involving variables, loops, and prime number testing.

Uploaded by

Hrishikesh Tiwary
Copyright
© © All Rights Reserved
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
37 views

Computer and Programming I

This document provides information about a computer programming course for civil engineering students at Pokhara University. It outlines the course details including the semester, program, course name and code, year, maximum marks, duration of exam, and instructions for candidates. The document then lists 5 questions to be answered as part of the exam. The questions cover topics like defining digital computers and their components, booting and system software, data processing vs word processing, computer generations and their characteristics, C programming operators and gates, algorithms vs flowcharts, K-maps and logic circuits, number conversions between bases, programming exercises involving variables, loops, and prime number testing.

Uploaded by

Hrishikesh Tiwary
Copyright
© © All Rights Reserved
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
You are on page 1/ 2

POKHARA UNIVERSITY

Level: Bachelor
Semester Fall
Programme: BE Civil (Diploma Holder)
Course: Computer and Programming I

Year
: 2009
Full Marks : 100
Time
: 3hrs.

Candidates are required to give their answers in their own words as far
as practicable.
The figures in the margin indicate full marks.
Attempt all the questions.
1. a.

What do you mean by digital computer? Define various functional


components with help of block diagram.
What do you mean booting? Define the role of system software.

10

Define the following terms with supporting function (Any Two)


i.
Napier Bone
ii.
ABACUS
iii.
Herman Hollerith machine
b. How does data processor vary with word processor? Define
characters and function os MS Word and MS Excel.
c. What is computer generation? Define the 3 rd and 4th generation of
computer with their characteristic features.

a. Define the common operators of C programming with their


examples.
b. What is Universal Gate? Realize the NAND gate into basic gates.

a. How does an algorithm contrast with flowchart? Write an algorithm


to print first 20 odd numbers.
b. Solves by using K map then realize the result in circuit diagram.

b.
2. a.

3.

4.

A BCD ABC D AC BCD ACD ABC D

5.

c. Convert the followings:


(1111101)2 = (?)8 = (?)16
i.
(7122)8 = (?)10 = (?)16
ii.
a. Find out the final value of a, b, c, x and z:
Void main()
{
Int a=1, b=1, c=10;
x+ =++a+b--+--c;
y* = a+++--b+--c+15;
a- = ++x+--y+10 }
1

5
5

5
5
5

b.

Trace the output of the following program code:


#include<stdi.h>
#include<conio.h>
void main()
{
int I,j;
clrscr();
for (i=1;i<=5;i++)
{
for (j=1;j<=5;j++)
printf ("*\t");
printf("\n");
}
getch();
}
c. Write a program to read 3 digit's number then detect whether it is
Armstrong or not.

a. With support of Algorithm write a program to read a user's


number then test it is prime or not.
OR
With reference of an algorithm write a program to print the
multiplication table for user's number n.
b. What do you mean by control structure statements? Define
various types of loops with flowchart and source program.
Write
short
notes on (Any Two)
7.
a. CUI and GUI
b. Program execution cycle
c. White box testing and Black box testing
6.

5
7

8
52

You might also like