Btech Notes Place for all Btech Engineering Notes
Related Articles
Entrance Computer Science Question Papers|Gateway CSE Question Paper
GATEWAY CSE Question Paper
< img course=" alignnone size-full wp-image-7221 aligncenter" src=" https://www.smartzworld.com/notes/wp-content/uploads/2018/03/GATE-CS-Question-Papers-Key-Papers-1.png" alt="" size=
” 500 “elevation= “350”/ > Link: GATE CS 2017 Question Paper
S1 ENTRANCE CS 2017 Key Paper Set 1
ENTRANCE CS 2017 Question Paper S2
ENTRANCE CS 2017 Key Paper Set 2
GATEWAY CS 2016 Question Paper Set 1
ENTRANCE CS 2016 Key Paper Set 1
ENTRANCE CS 2016 Question Paper Set 2
GATEWAY CS 2016 Key Paper Set 2
GATEWAY CS 2015 Question Paper Set 1
ENTRANCE CS 2015 Key Paper Set 1
GATEWAY CS 2015 Question Paper Set 2
ENTRANCE CS 2015 Key Paper Set 2
ENTRANCE CS 2015 Question Paper Set 3
ENTRANCE CS 2015 Key Paper Set 3
Couple of Same concerns from previous Gate CSIT concern documents are listed here:
1. In a RSA cryptosystm, an individual An utilizes 2 prime numbers p= 13 q= 17 to gererate her public and personal tricks. The exclusive trick of A is __________ if the public secret of A is 35.
2. After Rajendra Chola returned from his trip to Indonesia, he __________ to see the holy place in Thanjavur.
( A) was desiring.
( B) is wanting.
( C) desired.
( D) had actually desired.
3. The optimum variety of IPv4 router addresses that can be provided in the document path (RR) alternative area of an IPv4 header is.
The memory is byte address able. The minimal number of times the DMA controller requires to obtain the control of the system bus from the cpu to move the file from the disk to major memory is.
For a host maker that utilizes the token pail formula for blockage control, the token pail has an ability of 1 huge byte and the optimal outcome price is 20 huge bytes per secondly. Symbols show up at a price to maintain outcome at a price of 10 huge bytes per secondly.
Take into consideration a cpu with 64 signs up and a direction collection of dimension twelve. If a program has 100 directions, the quantity of memory (in bytes) taken in by the program message is.
7. Choose procedure in SQL amounts.
( A) the option procedure in relational algebra.
( B) the choice procedure in relational algebra, other than that SELECT in SQL maintains matches (C) the estimate procedure in relational algebra.
( D) the forecast procedure in relational algebra, other than that SELECT in SQL preserves matches.
A fifty percent adder is carried out with XOR and AND entrances. A complete adder is carried out with 2 fifty percent adders and one OR gateway. The proliferation hold-up of an XOR entrance is two times that of an AND/OR entrance.
Think about 6 memory dividings of dimensions 200 KB, 400 KB, 600 KB, 500 KB, 300 KB and 250 KB, where KB refers to kilobyte. These dividings require to be allocated to 4 procedures of dimensions 357 KB, 210 KB, 468 KB and 491 KB in that order.
( A) 200 KB and 300 KB.
( B) 200 KB and 250 KB.
( C) 250 KB and 300 KB.
( D) 300 KB and 400 KB.
10. Take into consideration a software application task with the complying with info domain name attributes for computation of feature factor statistics.
Variety of exterior inputs (I) = 30 Number of outside results (O) = 60 Number of outside questions (E) = 23 Number of documents (F) = 08 Number of exterior user interfaces (N) = 02.
It is considered that the intricacy weighting variables for I, O, N, f and e are 4, 5, 4, 10 and 7, specifically. It is likewise considered that, out of fourteen worth change aspects that affect the advancement initiative, 4 variables are not appropriate, each of the various other 4 aspects have worth 3, and each of the staying elements have worth 4. The calculated worth of feature factor metric is _____________.
Please do not hesitate to comment listed below for any type of inquiries from Smart globe Team.
A fifty percent adder is carried out with XOR and AND gateways. A complete adder is applied with 2 fifty percent adders and one OR entrance. The breeding hold-up of an XOR entrance is two times that of an AND/OR entrance. The proliferation hold-up of an AND/OR entrance is 1.2 split seconds. Think about 6 memory dividings of dimensions 200 KB, 400 KB, 600 KB, 500 KB, 300 KB and 250 KB, where KB refers to kilobyte.
