CS-60: Question Paper - June 2010

BACHELOR IN COMPUTER APPLICATIONSTerm-End ExaminationJune, 2010CS-60: FOUNDATION COURSE INMATHEMATICS IN COMPUTINGTime : 3 hours                                                               Maximum Marks : 75Note: Question No. 1 is compulsory. Attempt any three questions from questions No. 2 to 6. Use of calculator is permitted.1.    ...

Read More

CS-64: Introduction Computer Organisation June 2011 Question paper

BACHELOR IN COMPUTER APPLICATIONSTerm-End ExaminationJune, 2011 CS-64: INTRODUCTION TO COMPUTER ORGANISATION Time : 3 HoursMax. Marks : 75Note : Question one is compulsory. Answer any three questions from the rest.1. (a) List the basic key features of a von-Neuman machine. Also draw structure of von-Neuman machine.(b) What is a combinational circuit? Draw a combinational circuit for Boolean expression(c) Explain need of multiplexer. Also explain how a 4 X 1 multiplexer works.(d) What is a bus? Explain the working of a shared bus system with an example.(e) Explain the need of error detection and correction. What is a parity...

Read More

CS-62: 'C' Programming & Data Structure June 2011 Question Paper

BACHELOR IN COMPUTER APPLICATIONSTerm-End ExaminationJune, 2011CS-62: 'C' PROGRAMMING & DATA STRUCTURETime : 2 HoursMax. Marks : 60Note : Question number 1 is compulsory. Answer any three questions from the rest. All algorithms should be written nearer to 'C' language.1. (a) What are Arrays? How are Two-dimensional arrays stored in memory? Write a program to multiply two 2-dimensional arrays.(b) Write the algorithm for Binary search. Also apply this algorithm on the following data.22, 44, 11, 88, 33, 55, 77, 66Show all possible steps.(c) Define the following terms using suitable examples.(i) Degree of Tree(ii) Height of Thee(iii)...

Read More

QUESTION PAPER » CS-06 DATA BASE MANAGEMENT SYSTEM Dec 1999

BACHELOR IN COMPUTER APPLICATIONSTerm-End ExaminationDecember, 1999CS-06:DATABASE MANAGEMENT SYSTEMTime : 3 HoursMax. Marks : 75Note : Question one is compulsory. Answer any three from the rest.Q.1(a). Construct an E-R diagram for a car insurance company that has a set of customers, each of whom owns one or more cars. Each car has associated with it zero or any number of accidents.(b)Consider the Relational databaseEmployee (empname, street, city)Works (empname, companyname, salary)Company (companyname, city)Manages (empname, managerjname)Give expressions in SQL for the following:(i) Find the names of all employees who work for First Bank Corporation(ii) Find all employees in the database who live in the same cities as the companies for which they work.(iii) Find all employees...

Read More

Hall Ticket for Term-end Practical Examination, January 2009 (MCA/BCA/CIT Programmes)

Indira Gandhi National Open University (IGNOU) have announced January 2009 Term-End Practical Exam Hall Ticket. Student who did not receive the Hall Ticket in time, can Enter Nine Numerical Digit Enrolment Number into the following text box and can Downloaded, print their Online Practical Hall Ticket and produced along with valid IGNOU Identity Card at the Exam Centre.The batch allotted to you for each course is also mentioned. To know the batch timings and the address of the Examination Centre allotted to you, click here.Enter Enrolment No for Delhi-1 Regional Center ::::::Enter Enrolment No for Delhi-2 Regional Center ::::::Enter Enrolment No for Pune Regional Center ::::::...

Read More

CIT, BCA and MCA Practical Date Sheet for Term-End Practical Examination June-2011

After the end of written examinations CIT, BCA and MCA etc. students are required to appear for their practical examination. Just like written examinations and assignment submission students need to successfully clear their practical examination to be eligible to get their degree. Therefore, IGNOU has announced CIT, BCA and MCA Practical Date Sheet for Term-End Practical Examination for June 2011. To download your Practical Date Sheet please click here >>>http://www.ignou.ac.in/upload/Announcement/bcamcadatesheet....

Read More

Secondary School Examination Board(Matric) 2011 - Annual Result

table width="350 Secondary School Examination Board(Matric) 2011 - Annual ResultRoll CodeRoll Number Note:- Please enter your five digit Roll Code & four digit Roll No in provided space above and press Enter Key to get your result. ...

Read More

Hall Ticket June-2011 Term End Examination (TEE)

Indira Gandhi National Open University (IGNOU) has issued the Hall Ticket for its June 2011 Term End Examination (TEE) for all the courses Enter Enrolment Number: Select Program: --Select-- ACFSACPDMACSMADACMADAOMASSOBAADMBACTBAFCBAFDBAFMPBBARBBARSBCABCOMAFBCOMCAABCOMFCABDPBEDBEDSEBLSBMITBMLTBMRHITBNSBPPBRTTBSCFMRMBSCFTBSCHOTBSCLGADBSCNBSWBTAEBTCLEVIBTCMBTCSVIBTECVIBTELVIBTMEBTMEVIBTSBTWRECAFECAHTCALCARHCBSCCDPCCEANMCCLBLCCPCCPDCCRCCSSCDCWCDMCELLCESCESECPCESEMRCETMCFECFLCFNCFSTYCGLCHBCPCHCWMCHRCIBCICCIFCIGCIHLCISCITCJLCLGMCMCHCCNCCCNGOMCNICCNMCOFCPABNCPATHACPECPFCPLTCRDCRFFCSICSMCSUSCSWCJSCTECTPMCTSCULCVAACVAPCVASCWHMDAFEDBPOFADCEDCLEDCLE(G)DCLEVIDCSVIDCYPDDTDECEDECVIDELVIDEMEDFSDFSTYMDHHMDIPPDIRDMCHDMEDMEVIDMISHEDMLTDMTDNADNHEDPEDPVCPODSMDTSDVAPFVDWEDEXMBAMADEMAEDUMAFRMMAHMAPCMAPDMAPYMARDMBAAVBMMBACNMBACTMBANIMMBARSMBATEXMMCAMCOMMCOMBPCGMCOMFTMCOMIDTMCOMMAFSMECMEDMEDSEHIMEDSEMRMEDSEVIMEGMHDMLSMPMPAMPSMSCCDMSCCFTMSCFMRMMSCFTMSCLGADMSCVMCDMSDFSMMSMACSMSOMSWMTMPGCAPPGCBHTPGCCLPGCEPGCEDSPGCMHTPGCOIPGCPPPGCSOPGDACPGDACPPGDAEPGDAPPPGDBPPGDCCPGDCJPGDDEPGDDHMPGDDMPGDEDSPGDENLWPGDESDPGDETPGDFCSPGDFMPPGDFSQMPGDFTPGDGBLPGDGMPGDHEPGDIBOPGDICGPGDIPRPGDLANPGDLPOPGDMDPGDMISHPGDMRRPGDPMPGDPSMPGDRDPGDRPPGDSLMPGDSOPGDSWPGDTPGDTRMPGJMCPGPCSEHIPGPCSEMRPGPCSEVIPGPDSEHIPGPDSEMRPGPDSEVI...

Read More

Hall Ticket for May-2011 TEE-BHM/MHA/BAIHA/FCED Program

IGNOU has issued hall ticket for may-2011 term end examination (TEE) for BA in International Hospitality Administration (BAIHA), Bachelor of Science (Hospitality and Hotel Administration) (BHM), National Centre for Disability Studies (NCDS) and Master of Science (Hospitality Administration) (MHA) programs. Enter Nine Digit Enrolment Number: Select Program: BAIHA BHM FCED MHA ...

Read More

Q. Create a tree from following traversing sequence of a tree.

Pre-order – 1 2 3 4 5 6 7In-order – 4 2 5 1 6 3 7Post-order – 4 5 2 6 7 3 1Answer: To create a tree form traversing sequence we compare pre-order and in-order or post-order and in-order.First take one item form pre-order (1), make it root (in in-order traverse 1st item is always is root)Choose 2nd item (2), check this item in in-order traverse where it is; left or right side, make child of root as its position in in-order.Now take next item (3), again check its position in in-order traverse, put in tree as its positi...

Read More

Q. Create a tree from following traversing sequence of a tree.

Pre-order – 1 2 3 4 5 6 7In-order – 4 2 5 1 6 3 7Post-order – 4 5 2 6 7 3 1Answer: To create a tree form traversing sequence we compare pre-order and in-order or post-order and in-order.First take one item form pre-order (1), make it root (in in-order traverse 1st item is always is root)Choose 2nd item (2), check this item in in-order traverse where it is; left or right side, make child of root as its position in in-order.Now take next item (3), again check its position in in-order traverse, put in tree as its positi...

Read More

Height Balanced Tree (AVL Tree)

Height balanced BST (AVL Tree):It is a special type of BST that remains balanced tree even if the input to the tree is sorted. Each node in an AVL tree maintain balance factor which is calculated as BAL = (height of left sub-tree) – (height of right sub-tree)A node is said balanced if its balanced factor is (0, -1, 1).BAL =   0-1   1  →balanced    Otherwise node is unbalanced.If a node is become unbalanced, it is made balanced by rotating the unbalanced node in opposite direction of unbalanced.NB - When the sign of balance factor is negative (-ve) then node...

Read More