Archive

Archive for the ‘CS-02 Introduction to Software’ Category

TEE – Dec. 2002

Comments off

Question Paper of CS-02 Introduction to Software of Dec 2002 from IGNOU

Note: Question one is compulsory. Answer any three from the rest.

1. (a) Design an algorithm to multiply two matrices and verify the correctness by tracing.
(b) Write a shell program to search for a number in the given list of numbers.
(c) Explain how the GUI is supported in X-WINDOWS. How does it vary from other GUIs? Read more…

Categories: CS-02 Introduction to Software Tags:

TEE – Dec. 2002

Comments off

Question Paper of CS-02 Introduction to Software of Dec 2002 from IGNOU

Note: Question one is compulsory. Answer any three from the rest.

1. (a) Design an algorithm to multiply two matrices and verify the correctness by tracing.
(b) Write a shell program to search for a number in the given list of numbers.
(c) Explain how the GUI is supported in X-WINDOWS. How does it vary from other GUIs? Read more…

Categories: CS-02 Introduction to Software Tags:

TEE -JANUARY 2001

Comments off

Question Paper of CS-02 Introduction to Software of Jan 2001 from IGNOU

Note: Question one is compulsory. Answer any three from the rest. All algorithms should be nearer to C-programming language notation.

1. Design a context free grammar for the following :

(i) Switch statement in C-language.

(ii) An arithmetic expression in C-language. Read more…

Categories: CS-02 Introduction to Software Tags:

TEE – June, 2001

Comments off

Question Paper of CS-02 Introduction to Software of June 2001 from IGNOU

Note : Question one is compulsory. Answer any three from the remaining.
1. (1) Write a BNF grammar for the following C-language syntax :
a. Looping statements
b. Switch statements
(2) Write an algorithm for converting a decimal number to binary code
(3) Write a shell program to convert older version of a file with the current one Read more…

Categories: CS-02 Introduction to Software Tags:

TEE – DEC. 2000

Comments off

Question Paper of CS-02 Introduction to Software of Dec 2000 from IGNOU

Note:question 1 is compulsory. Answer any three from te rest.

1. (a) Write an algorithm/program that reads a list of numbers and makes a count of the number of negative and positive numbers in it.

(b) Write a shell program to compute 1/n!

(c) Construct context-free grammar for
(i) Conditional expression in �C� language Read more…

Categories: CS-02 Introduction to Software Tags:

TEE JUNE 2000

Comments off

Question Paper of CS-02 Introduction to Software of June 2000 from IGNOU

Note : Question 1 is compulsory. Answer any three from the rest.

1. (a) Write a shell program to find the square root of a number.

(b) Write an algorithm/program to reverse and sum the digits of a 4-digit integer. Read more…

Categories: CS-02 Introduction to Software Tags:

TEE-DEC. 1999

Comments off

Question Paper of CS-02 Introduction to Software of Dec 1999 from IGNOU

Note : Question 1 is compulsory. Answer any three from the rest.

1. (a) Construct context free grammar for
(i) do……………while loop in �C� language
(ii) an arithmetic expression in �C� language
(b) Write a shell program to find Greatest common Divisor (GCD) for the two given numbers. Read more…

Categories: CS-02 Introduction to Software Tags:

TEE-DEC. 1997

Comments off

Question Paper of CS-02 Introduction to Software of Dec 1997 from IGNOU

Note : Question 1 is compulsory. Answer any three from the rest.

1. (a) Write a regular grammar for the following :

(i) Set of strings of a� s, b� s and c� s
For example (aaa, aab,��� ccc)

(ii) Looping statements of Pascal. Read more…

Categories: CS-02 Introduction to Software Tags:

TEE-JUNE 1996

Comments off

Question Paper of CS-02 Introduction to Software of June 1996 from IGNOU

Note :Question 1 is compulsory. Attempt any three from the rest.

1. (a) Construct context free grammars of roman numerals.
(b) Given two positive non-zero integers N and M. Design an algorithm for finding their greatest common divisor.

(c) Which of the following are reasonable long term scheduling algorithms and which are reasonable short term scheduling algorithms? Read more…

Categories: CS-02 Introduction to Software Tags:

TEE-DEC. 1995

Comments off

Question Paper of CS-02 Introduction to Software of Dec 1995 from IGNOU

Note : Question 1 is compulsory. Attempt any three from the rest.
1. (a) Design an algorithm that accepts an input a decimal number and converts it into BCD (binary coded decimal) representation.
(b) How can you develop a compiler of any language say C-language through the same language? Give the name of this process and also explain it.
(c) Write a grammar for an English language statement and draw a parse tree for the statement �The tall boy went to school�. Read more…

Categories: CS-02 Introduction to Software Tags:
Pages: 1 2 Next