COMPUTER SCIENCE 2005 Paper
 

[FONT=Verdana][B]NOTE[/B][/FONT][FONT=Verdana]: Attempt [B]FIVE[/B] questions in all, including Question no 8 which is compulsory.
[/FONT] [FONT=Verdana]Select at least [B]ONE [/B]question from each section. All question carry equal marks.


[/FONT] [CENTER][CENTER][FONT=Verdana][B]SECTION-I[/B][/FONT][/CENTER]
[/CENTER]
[FONT=Verdana][B]1.[/B][/FONT][FONT=Verdana] a) What is decentralized processing? Also explain distributed data processing.
[/FONT] [FONT=Verdana] b) How would shared memory be used to communicate data between two processes?
[/FONT] [FONT=Verdana] [B]2. [/B]a) Explain different methods for processing of data files?
[/FONT] [FONT=Verdana] b) What are network protocols? Explain any two common LAN protocols?
[/FONT] [FONT=Verdana] [B]3. [/B]a) Explain any three widely used media for wireless communication.
[/FONT] [FONT=Verdana] b) What is pipelining? Hence also explain the strategy of parallel processing.

[/FONT] [CENTER][CENTER][FONT=Verdana][B]SECTION-II[/B][/FONT][/CENTER]
[/CENTER]
[FONT=Verdana]
[B]4.[/B][/FONT] [FONT=Verdana]a) Explain the term Information Hiding. Also differentiate between Top-down design and Bottom-up design.
[/FONT] [FONT=Verdana]b) Discuss briefly the main characteristics of object oriented programming.

[B] 5[/B][/FONT] [FONT=Verdana]. a) Show that by removing at most O(lg n) edges, we can partition the vertices of any n-vertex tree into two sets A and B such that |A|=[n/2] and |B|=[n/2].
[/FONT] [FONT=Verdana] b) Give an efficient algorithm to determine if an undirected graph is bipartite.

[/FONT] [CENTER][CENTER][FONT=Verdana][B]SECTION-III[/B][/FONT][/CENTER]
[/CENTER]
[FONT=Verdana]
[B]6.[/B][/FONT] [FONT=Verdana] a) Differentiate between an operational database and a warehouse. What types of applications does each serve?
[/FONT] [FONT=Verdana]b) What is the difference between a data entity in second normal form (2NF) and third normal form (3NF)? Give an example of an entity in 2NF and show its conversion to 3NF.

[B] 7.[/B][/FONT] [FONT=Verdana] a) What is client side programming?
[/FONT] [FONT=Verdana] b) What are the tools to develop website fast and viewable?

[/FONT] [CENTER][CENTER][FONT=Verdana][B]COMPULSORY QUESTION[/B][/FONT][/CENTER]
[/CENTER]
[FONT=Verdana]
[B]8. (A)[/B][/FONT] [FONT=Verdana] For whom the following abbreviations stand for
[/FONT] [FONT=Verdana](i) DNS
[/FONT] [FONT=Verdana] (ii) CMOS
[/FONT] [FONT=Verdana] (iii) OSI
[/FONT] [FONT=Verdana] (iv) CASE
[/FONT] [FONT=Verdana] (v) DDE
[B](B)[/B][/FONT] [FONT=Verdana] Fill in the blanks with the most suitable options for the following statements:
[/FONT] [FONT=Verdana] (i) A data path to transfer data is called…………………
[/FONT] [FONT=Verdana] (ii) What is combination of I-time and E-time called.............................
[/FONT] [FONT=Verdana] (iii) The process of applying a formula to a key is called……………….
[/FONT] [FONT=Verdana] (iv) Distortion in the received signals is called………………………
[/FONT] [FONT=Verdana] (v) DMA is a technique to transfer data between memory and ……………..

[B](C)[/B][/FONT] [FONT=Verdana] Write “TRUE” or “FALSE”
[/FONT] [FONT=Verdana] (i) RISC technology used fewer instructions then traditional computers.
[/FONT] [FONT=Verdana] (ii) Direct file organization is combination of sequential and indexed file organization.
[/FONT] [FONT=Verdana] (iii) Fax is a connection of similar networks.
[/FONT] [FONT=Verdana] (iv) Let G=(V,E) be an undirected graph when G is a free tree.
[/FONT] [FONT=Verdana] (v) An entity instance is a single occurrence of an entity

[B](D)[/B][/FONT] [FONT=Verdana] Write short answers to the following
[/FONT] [FONT=Verdana] (i) Prototyping.
[/FONT] [FONT=Verdana] (ii) FAT
[/FONT] [FONT=Verdana] (iii) Virtual memory
[/FONT] [FONT=Verdana] (iv) Deadlock
[/FONT] [FONT=Verdana] (v) Abstraction
[/FONT]

CS 2005 Paper, Part: 1-A (Solution)
 

[CENTER][B][FONT=Arial Narrow][SIZE=6]SECTION-I[/SIZE][/FONT][/B][/CENTER]

[B][FONT=Arial][COLOR=red]1 a) What is decentralized processing? Also explain distributed data processing.[/COLOR][/FONT][/B]


[B][U][FONT=Arial][COLOR=blue]Decentralized Processing[/COLOR][/FONT][/U][/B]
[FONT=Arial]Computer systems in different locations. Although data may be transmitted between the computers periodically, it implies limited daily communications. Contrast with [B][COLOR=windowtext]distributed computing[/COLOR][/B] and [B][COLOR=windowtext]centralized processing[/COLOR][/B]. [/FONT]


[B][U][FONT=Arial][COLOR=blue]Distributed Data Processing (DDP)[/COLOR][/FONT][/U][/B]


[B][U][FONT=Arial][COLOR=blue]Definition[/COLOR][/FONT][/U][/B]
[FONT=Arial]The processing of information in separate locations equipped with independent computers. Even though the computers are connected by a network, the processing is geographically dispersed.[/FONT]


[B][U][FONT=Arial][COLOR=blue]Explanation[/COLOR][/FONT][/U][/B]
[FONT=Arial]There are numerous ways to describe Distributed Data Processing (DDP) structures and their associated characteristics of functional distribution components and user advantages and disadvantages. However, the bulk of the literature concerning DDP deals with its evolutionary impact and excludes consideration of the key generic characteristics of DDP and how these characteristics relate to user complexity, responsiveness, and user productivity.[/FONT]

[FONT=Arial]Therefore, this study was undertaken to analyze generic Distributed Data Processing structures and their advantages and disadvantages. In addition, it described the homogeneous and heterogeneous characteristics of representative DDP environments. During this process, a range of expected DDP models were developed and test case assessments between these hypothesized DDP models and real environments were matched.[/FONT]

[FONT=Arial]For this study a comprehensive examination of related readings, professional interviews, case studies, and DDP experiments conducted by the writer were integrated to provide an insight into DDP structures and the changing business environment caused by this new DDP technology.[/FONT]

[FONT=Arial]The study's principal conclusion is that Distributed Data Processing may be defined in multiple forms (models) of structural configuration and user functional characteristics. Further, these multiple forms are not homogeneous, that is, a more powerful DDP form is not a natural or logical multiplier of a simpler form. The forms are heterogeneous and may be distinguished from each other by their unique user advantages and disadvantages.[/FONT]

[FONT=Arial]Finally, the study concluded that DDP represents an important business opportunity, and is here to stay as a meaningful and effective data processing option. Further, DDP will introduce a new spectrum of user data processing function, but will also introduce unanticipated system complexity as a consequence for users. Moreover, the study determined that, in some cases, DDP was wrought with inefficiency and complications because it was used with abandon. Therefore, data processing executives and professionals should be cognizant to recognize the characteristics of DDP models and their respective options, and then, determine, very specifically, the appropriate environment and associated model that best suits their organization's objectives.[/FONT]

[B][FONT=Arial][COLOR=red]1b) How would shared memory be used to communicate data between two [/COLOR][COLOR=red]processes?[/COLOR][/FONT][/B]


[FONT=Arial]Inter-Process Communication (IPC) is a set of techniques for the exchange of data between two or more [COLOR=windowtext]threads[/COLOR] in one or more [COLOR=windowtext]processes[/COLOR]. Processes may be running on one computer or on two or more computers connected by a [COLOR=windowtext]network[/COLOR]. IPC techniques are divided into methods for [COLOR=windowtext]message passing[/COLOR], [COLOR=windowtext]synchronization[/COLOR], [COLOR=windowtext]shared memory[/COLOR], and [COLOR=windowtext]remote procedure calls[/COLOR] (RPC). The method of IPC used may vary based on the bandwidth and latency of communication between the threads, and the type of data being communicated.[/FONT]