IGNOU MCA IGNOU BCA IGNOU MBA IGNOU CIC Courses
June 2003
June 2002
June 2001
|
|
||
Related pages
June 2001
Question Paper of CS 08 Numerical & Statistical Computing of June 2001 from IGNOU Time: 2 hours Max. Marks: 75 Note: Note: Calculator is allowed in this examination. Question number 1 is compulsory. Attempt any three more questions from questions numbered 2 to 6. 1. a. Write, which of the following variable names, .....
TEE - June, 2001
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 : [5] a. Looping statements b. Switch statements (2) Write an algorithm for converting a decimal number .....
JUNE 2001
Question Paper of CS-13 - Operating Systems of June 2001 from IGNOU 1. (i) Write an algorithm for bounded buffer producer/consumer problem using monitor. Also describe the problem and algorithm in detail. (ii) Discuss in detail the distribution of control and the degree o functional specification of the individual processing .....
JUNE 2001
Question Paper of CS-12 - Computer Architecture of June 2001 from IGNOU Note : Question one is compulsory. Answer any three from the rest. 1. (i) Consider a catche (M1) and memory(M2) hierarchy with the following characteristics : M1 : 16 K words, 50 ns access time M2 : 1 M .....
Bachelor of Art (BA)
Bachelor of Art (BA) Eligibility: 10+2 or its equivalent or BPP from IGNOU Age: No bar Min. Duration: 3 years Max. Duration: 6 years Course Fee: Rs. 1200/- per annum Medium: English, Hindi Last date for submission of application for the July session will be 31st of July. Applications can be had .....
June 2001
Question Paper of CS-09 - Data Communication & Network of June 2001 from IGNOU Time: 2 hours Max. Marks: 75 Note: Question No 1 is compulsory. Attempt three more questions from questions numbered as 2 to 6. 1. i. Suppose transmission channels become virtually error free. Is the data link layer still necessary? .....
June 2001
Question Paper of CS-09 - Data Communication & Network of June 2001 from IGNOU Time: 2 hours Max. Marks: 75 Note: Question No 1 is compulsory. Attempt three more questions from questions numbered as 2 to 6. 1. i. Suppose transmission channels become virtually error free. Is the data link layer still necessary? .....
June 2001
Question Paper of CS - 03 File Structure & Programming in COBOL of June 2001 from IGNOU Time : 2 Hours Maximum Marks : 60 1 (a) What is the purpose of LABEL RECORD clause in COBOL? What are the options available with this cluase? In which division of COBOL is .....
JUN 2001
Question Paper of CS-54 - Finance & Accounting On Computers of June 2001 from IGNOU Note : There are 6 questions in the paper. Question no. 1 is compulsory and carries 35 marks. From the remaining attempt any two questions. Each of these carries 20 marks. 1. (a) Explain the following .....
JUN 2001
Question Paper of CS-54 - Finance & Accounting On Computers of June 2001 from IGNOU Time : 3 Hours Max. Marks : 75 Note : There are 6 questions in the paper. Question no. 1 is compulsory and carries 35 marks. From the remaining attempt any two questions. Each of these carries .....
Recently Visited Pages
- IGNOU: Karnal Regional Study Centres
IGNOU: Karnal Regional Study Centres SL. NO. PLACE OF STUDY CENTRE SC (.....) - MS-63 Product Management
Syllabus of MS-63 Product Management From IGNOU MS-63 Product Management Comment for MS-63 Product Management ----------------------------------------------------------------------------------------- MBA hi sir/madam (.....) - DEC 1997
Question Paper of CS-54 - Finance & Accounting On Computers of Dec 1997 from IGNOU Time : 3 Hours Max. Marks : 75 Note : There (.....) - TEE-DEC. 1995
Question Paper of CS-02 Introduction to Software of Dec 1995 from IGNOU Note : Question 1 is compulsory. Attempt any three from the (.....) - DEC 1996
Question Paper of CS-54 - Finance & Accounting On Computers of Dec -1996 from IGNOU Time : 3 Hours Max. Marks : 75 Note : There (.....) - June 1998
Question Paper of CS-09 - Data Communication & Network of June 1998 from IGNOU 1 (a)(i)Which of the following access control methods is probabilistic? [8] (.....) - Seychelles - 7101
International Partner Institutions of IGNOU in Indian Ocean Island Countries - Seychelles - 7101 Seychelles - 7101 Programme Launched In Collaboration With Rajiv Gandhi Foundation (.....) - MCA CS-12 PROJECT Computer Architecture
MCA CS-12 PROJECT Computer Architecture Course Code : CS-12 Course Title : Computer Architecture Assignment Number : MCA (5)-12/Project/05 Maximum Marks : 15 Last Date of Submission : 30th April, 2005 This is a Project Assignment. Answer all the following questions. (.....) - JUNE 2000
Question Paper of CS-13 - Operating Systems of June 2000 from IGNOU Time : 3 Hours Max. Marks : 75 Note: Question 1 is compulsory. Answer any (.....) - IGNOU - NAVY Recognized Regional Centres - NEW DELHI
IGNOU - NAVY Recognized Regional Centres - NEW DELHI Code - 71 CAPTAIN VS BABELAY REGIONAL DIRECTOR IGNOU - NAVY RECOG. REGIONAL CENTRE NAVAL HEADQUARTERS R.K. PURAM NEW DELHI - 110066 DELHI PH.OFF: 011-26194686 (.....) - December 2001
Question Paper of CS 08 Numerical & Statistical Computing of Dec 2001 from IGNOU Time: 3 hours Maximum Marks: 75 Note: Question 1 is compulsory. Attempt (.....) - Post Graduate Diploma in Library Automation and Networking (PGDLAN)
Post Graduate Diploma in Library Automation and Networking (PGDLAN) In keeping with the demand for skill development in Library and Information Science with the application of (.....) - IGNOU Regional Centres - Ranchi
IGNOU Regional Centres - Ranchi Region Code - 32 Dr. V.P. Rupam Regional Director (I/c) IGNOU Regional Centre 457/A, Ashok Nagar Ranchi - 834002 Jharkhand. Ph.Off 0651-2244677 / 2244688 / 2244699 Fax 0651-2244400 Email ignouranchi@yahoo.com (.....) - Dec 1995
Question Paper of CS - 03 File Structure & Programming in COBOL of Dec 1995 from IGNOU Time : 2 Hours Maximum Marks : 60 1 (.....) - December 2002
Question Paper of CS-13 - Operating Systems of December 2002 from IGNOU 1. (a) Write and explain one of the deadlock detection algorithms and (.....)