PDF Gate 2020 Computer Science and Information Technology 8Th Edition Trishna Knowledge Systems Ebook Full Chapter

GATE 2020 Computer Science and
Information Technology 8th Edition

Trishna Knowledge Systems
Visit to download the full and correct content document:
https://textbookfull.com/product/gate-2020-computer-science-and-information-technol
ogy-8th-edition-trishna-knowledge-systems/
More products digital (pdf, epub, mobi) instant
download maybe you interests ...
Systems Analysis and Synthesis Bridging Computer

Science and Information Technology 1st Edition Barry
Dwyer
https://textbookfull.com/product/systems-analysis-and-synthesis-
bridging-computer-science-and-information-technology-1st-edition-
barry-dwyer/
Chemistry (Class 9) 3rd Edition Trishna Knowledge

Systems
https://textbookfull.com/product/chemistry-class-9-3rd-edition-
trishna-knowledge-systems/
Chemistry Class 10 6th Edition Trishna Knowledge

Systems
https://textbookfull.com/product/chemistry-class-10-6th-edition-
Physics (Class 9) 2nd Edition Trishna Knowledge Systems
https://textbookfull.com/product/physics-class-9-2nd-edition-
Pearson IIT Foundation Series Chemistry Class 7 5th
Edition Trishna Knowledge Systems
https://textbookfull.com/product/pearson-iit-foundation-series-
chemistry-class-7-5th-edition-trishna-knowledge-systems/



Pearson IIT Foundation Series - Chemistry Class 9 7th

C ra c k th e
COMPUTER SCIENCE
tr
Also Helpful for GAIL, BARC, HPCL, BHEL, ONGC, SAIL, DRDO & Other PSU’s
C rac k t he
AND INFORMATION
ish
TECHNOLOGY
na
G R AD UAT E A PT I T UD E T E S T I N E NG I N EE R I N G
SERIES
SERIES 2020
’s
This book has been prepared by a group of faculty who are highly experienced in training GATE
SERIES
candidates and are also subject matter experts. As a result, this book will serve as a one-stop solution for
any GATE aspirant looking to crack the examination.
Coverage is as per the syllabus prescribed for GATE and topics are handled comprehensively; beginning
COMPUTER SCIENCE
TECHNOLOGY
AND INFORMATION
from the basics and progressing step – by – step, supported by an ample number of solved and unsolved
problems. Extra care has been taken to present the content in a modular and systematic manner to facilitate
easy understanding of all topics.
WHAT THE FACULTIES SAY ABOUT THIS BOOK...

Topics are well defined and language is very good. The book is well written and will be very useful for engineering
students preparing for GATE exam and faculty of UG/ PG courses.
Prof (Dr.) V.R. Singh, Director, PDM Educational Institutions, Bahadurgarh
The book is very useful for students preparing for GATE as it contains all the material required for GATE exam as
per latest syllabus. Content is modular, ample solved and unsolved problems are given, previous years’ GATE
questions are given topic-wise.
Dr. Manoj Kumar, Associate Professor, Computer Engineering Department, DTU COMPUTER SCIENCE
This book focuses on requirements of students preparing for GATE and would be useful for faculties also. The book
covers all the topics in detail along with adequate problems as per latest examination pattern.
AND INFORMATION
Gurpreet Kour, Assistant Professor, LPU
TECHNOLOGY
crack the gate series
2020
2020
Cover Image: Blackboard.shutterstock.com
C rac k th e
HIGHLIGHTS
Maximum Coverage/Explanations/Illustrations as per Latest Syllabus
770+ Solved Problems and 2550+ Practice Questions
Elaborated Question Bank Covering Previous 12 Years' GATE Question Papers
trishna’s
Unit -wise Time -bound Tests
2019 GATE Online Papers with Topic -wise Analysis
Solution Manual available in online resources
Online resources available at MRP Inclusive
www.pearsoned.co.in/GATE-CSIT of all Taxes `799.00
in.pearson.com CD CONTAINS
AVAILABLE
SOLUTIONS
AS e-book
FOR EXERCISES
AVAILABLE
Includes Max. Free Online Mock TestsAS
-5e-book
Papers
Log on to: https://goo.gl/4mXjwZ
Size: 203x254mm Spine: 26mm ISBN: 9789353433949 Title Sub Title Edition Authors / Editors Name With CD Red Band Territory line URL Price mQuest
About Pearson
Pearson is the world’s learning company, with presence across 70 countries
worldwide. Our unique insights and world-class expertise comes from a long
history of working closely with renowned teachers, authors and thought
leaders, as a result of which, we have emerged as the preferred choice for
millions of teachers and learners across the world.
We believe learning opens up opportunities, creates fulfilling careers and
hence better lives. We hence collaborate with the best of minds to deliver you
class-leading products, spread across the Higher Education and K12 spectrum.
Superior learning experience and improved outcomes are at the heart of
everything we do. This product is the result of one such effort.
Your feedback plays a critical role in the evolution of our products and you
can contact us at reachus@pearson.com. We look forward to it.
This page is intentionally left blank
GATE
(Graduate Aptitude Test in Engineering)
Computer Science
and
Information Technology
Trishna Knowledge Systems

Copyright © 2019 Pearson India Education Services Pvt. Ltd
Published by Pearson India Education Services Pvt. Ltd, CIN: U72200TN2005PTC057128.
No part of this eBook may be used or reproduced in any manner whatsoever without the publisher’s
prior written consent.
This eBook may or may not include all assets that were part of the print version. The publisher
reserves the right to remove any material in this eBook at any time.
ISBN 978-93-534-3394-9
eISBN:
Head Office: A-8(A), 7th Floor, Knowledge Boulevard, Sector 62, Noida 201 309, Uttar Pradesh, India.
Registered Office: The HIVE, 3rd Floor, Metro Zone, No.44, Pillayar Koil Street, Jawaharlal Nehru Road, Anna Nagar,
Chennai 600 040, Tamil Nadu, India.
Phone: 044-66540100
Website: in.pearson.com, Email: companysecretary.india@pearson.com
Contents
Preface viii
Key Pedagogical Features ix
Syllabus: Computer Science and Information Technology xi
Chapter-wise Analysis of GATE Previous Years’ Papers xii
General Information about Gate xiii
Solved Papers 2019 xv
UNIT 1 Digital Logic 1.1

Chapter 1 Number Systems 1.3
Chapter 2 Boolean Algebra and Minimization of Functions 1.14
Chapter 3 Combinational Circuits 1.35
Chapter 4 Sequential Circuits 1.56
UNIT II Computer Organization and Architecture 2.1

Chapter 1 Machine Instructions, Addressing Modes 2.3
Chapter 2 ALU and Data Path, CPU Control Design 2.16
Chapter 3 Memory Interface, I/O Interface 2.33
Chapter 4 Instruction Pipelining 2.47
Chapter 5 Cache and Main Memory, Secondary Storage 2.60
UNIT III Programming and Data Structures 3.1

PART A Programming and Data Structures
Chapter 1 Programming in C 3.3
Chapter 2 Functions 3.14
Chapter 3 Arrays, Pointers and Structures 3.30
Chapter 4 Linked Lists, Stacks and Queues 3.47
Chapter 5 Trees 3.60
PART B Algorithms
Chapter 1 Asymptotic Analysis 3.81
Chapter 2 Sorting Algorithms 3.98
Chapter 3 Divide-and-conquer 3.107
Chapter 4 Greedy Approach 3.116
Chapter 5 Dynamic Programming 3.135

vi | Contents
UNIT 1V Databases 4.1

Chapter 1 ER Model and Relational Model 4.3
Chapter 2 Structured Query Language 4.21
Chapter 3 Normalization 4.49
Chapter 4 Transaction and Concurrency 4.65
Chapter 5 File Management 4.82
UNIT V Theory of Computation 5.1

Chapter 1 Finite Automata and Regular Languages 5.3
Chapter 2 Context Free Languages and Push Down Automata 5.24
Chapter 3 Recursively Enumerable Sets and Turing Machines, Decidability 5.37
UNIT V1 Compiler Design 6.1

Chapter 1 Lexical Analysis and Parsing 6.3
Chapter 2 Syntax Directed Translation 6.27
Chapter 3 Intermediate Code Generation 6.36
Chapter 4 Code Optimization 6.56
UNIT VII Operating System 7.1

Chapter 1 Processes and Threads 7.3
Chapter 2 Interprocess Communication, Concurrency and Synchronization 7.17
Chapter 3 Deadlock and CPU Scheduling 7.35
Chapter 4 Memory Management and Virtual Memory 7.54
Chapter 5 File Systems, I/O Systems, Protection and Security 7.74
UNIT VIII Networks, Information Systems, Software

Engineering and Web Technology 8.1
Part A Network
Chapter 1 OSI Layers 8.3
Chapter 2 Routing Algorithms 8.24
Chapter 3 TCP/UDP 8.36
Chapter 4 IP(v4) 8.52
Chapter 5 Network Security 8.66
Contents | vii
Part B Information Systems

Chapter 1 Process Life Cycle 8.79
Chapter 2 Project Management and Maintenance 8.89
Part C Software Engineering and Web Technology

Chapter 1 Markup Languages 8.111
Preface
Graduate Aptitude Test in Engineering (GATE) is one of the preliminary tests for undergraduate subjects in Engineering/
Technology/Architecture and postgraduate subjects in Science stream only.
Apart from giving the aspirant a chance to pursue an M.Tech. from institutions like the IITs /NITs, a good GATE
score can be highly instrumental in landing the candidate a plush public sector job, as many PSUs are recruiting gradu-
ate engineers on the basis of their performance in GATE. The GATE examination pattern has undergone several changes
over the years—sometimes apparent and sometimes subtle. It is bound to continue to do so with changing technological
environment.
GATE Computer Science and Information Technology, as a complete resource helps the aspirants be ready with con-
ceptual understanding, and enables them to apply these concepts in various applications, rather than just proficiency with
questions type. Topics are handled in a comprehensive manner, beginning with the basics and progressing in a step-by-step
manner along with a bottom-up approach. This allows the student to better understand the concept and to practice applica-
tive techniques in a focused manner. The content has been systematically organized to facilitate easy understanding of all
topics. The given examples will not only help the students to understand the concepts involved in the problems but also help
to get a good idea about the different models of problems on that particular topic. Due care has also been taken to cover a
very wide range of problems including questions that have been appearing over the last few years in GATE examination.
The practice exercises in every chapter, contain questions ranging simple to moderate to difficult level. These exercises are
meant to hone the examination readiness over a period of time. At the end of each unit, practice tests have been placed. These tests
will help the student assess their level of learning on a regular interval.
This book has been prepared by a group of faculty who are highly experienced in training GATE preparations and
are also subject matter experts. As a result, this book would serve as an effective tool for GATE aspirant to crack the
examination.
Salient Features
1. Elaborate question bank covering previous 16 years’ GATE question papers
2. 5 free online mock tests for practice
3. Detailed coverage of key topics
4. Complete set of solved 2019 GATE online papers with chapter-wise analysis
5. Exhaustive pedagogy:
(a) More than 770+ Solved Examples
(b) More than 2550+ Practice Questions
(c) Unit-wise time-bound tests
(d) Modular approach for easy understanding
We would like to thank the below mentioned reviewers for their valuable feedback and suggestions which has helped in
shaping this book.
R. Marudhachalam Professor (Sr. Grade), Kumaraguru College of Technology Coimbatore, Tamil Nadu
Daya Gupta Professor, Delhi Technological University, Main Bawana Road, Delhi
Manoj Kumar Gupta Associate Professor, Delhi Technological University Main Bawana Road, Delhi
Gurpreet Kour Lecturer, Lovely Professional University Phagwara, Punjab
Pinaki Chakraborty Assistant Professor, Netaji Subhas Institute of Technology Dwarka, Delhi
Gunit Kaur Lecturer, Lovely Professional University Phagwara, Punjab
Despite of our best efforts, some errors may have inadvertently crept into the book. Constructive comments and suggestions
to further improve the book are welcome and shall be acknowledged gratefully.
Wishing you all the very best..!!!
—Trishna Knowledge Systems

Chapter 1
Key Pedagogical Features
Number Systems 1.10 | Unit 1 • Digital Logic
BCD addition Excess-3 (XS-3) code

• BCD addition is performed by individually adding the Excess-3 code is a non-weighted BCD code, where each
corresponding digits of the decimal number expressed in digit binary code word is the corresponding 8421 code word
Learning Objectives 4-bit binary groups
LEARNING starting from the LSB.
OBJECTIVES plus 0011.
• If there is no carry and the sum term is not an illegal code, Find the XS-3 code of
List of important top-  noDigital
correction is needed.
circuits Numeric

Example 47: codes
(3)10 → (0011)BCD = (0110)xS3
ics which are covered in • IfNumber
 there is asystem
carry out
withofdifferent
one group to the next group or if
base Chapter

48:2 (16)Boolean
Weighted
Example → (0001 Algebra
0110)BCD and
and non-weighted codes Minimization of Functions | 29
 the sum term ofis an illegalsystems
code, the (6)10 is added to the 10
chapter. Conversion number
sum term of that group, and the resulting carry is added
 Error detection and correction
→ (0100 1001)code
xS3
 Complements  Sequential, reflective and cyclic codes
to the next group. Gray code
 Subtraction with complement  Self complementing code
Each gray code Y = ( Adiffers
number ⋅ B ⋅from ) =preceding
ABthe ( A + Bnumber
) (A+ B)  ( A ⋅ B = A + B)
= {A ⊕43:B44⊕+ B12 ⊕ C } ⊕ {A ⊕ C ⊕ B ⊕ A}
Solution: fExample by a single bit.
0100 0100 (44 in BCD)
= {A ⊕ 0 ⊕ C} ⊕
0001 0010 ⊕inCBCD)
{0(12 ⊕ B} = ( A + BGray
Decimal ) + (Code
A + B) = A ⋅ B + A ⋅ B
0 0000
0101 0110 (56 in BCD)
=A⊕C⊕C⊕B=A⊕0⊕B=A⊕B = 1A ⋅ B + A0001
⋅ B = A⊕ B
Example 44: 76.9+ 56.6 2 0011
DiGital CirCuits 0111 0110 . 1001 Example

Example 5: 23
(658)8 = 6 × 84:+ 5Simplify
0010
× 81 + 8 × 80 the Boolean function A ⊕ A B ⊕ A
Solved
0101 0110 . 0110
Examples
Computers work with binary numbers, which (all use are
onlyillegal
the digits Solved 4
Example
0110
= 384 + 40 + 8 = (432)10
Chapter 51 • Number 0111 Systems | 1.11
‘0’ and ‘1’. Since all the1100
digital1100 . 1111 are based
components on binary Solution: ⊕ A Bgiven
Asystem ⊕ A topic-wise
0110 0110 . 0110 codes)
operations, it is convenient to use binary numbers when analyzing Hexadecimal
Binary to Solved
gray number
conversionproblems
Example
(A) 11001001 1: Simplify the
or designing digital circuits.(B) Boolean
0010 10011100 function,
0010 . 0101 x y + x′z +
code. y
Stepz
For example,
I: Shift
In hexadecimal to the the system,
binary
learn
number basetois-6
number number
one
apply
there 35 will
areposition
16the
numbers 0be
to the
concepts rep-
toright,
9, and
(C) 11010101 (D) +1 10101101 +1 +1 (propagate carry)resented LSB of
digits bytheits
from shifted
10 to 15 number
BCH code
are
Associativity
discarded.
011101.
represented by A to F, respectively. The
Solution:Number x y + x′Systems z+ y z 0001 with 0011Different0011 .Base0101 Inbase ofII:
Stepthis learned
hexadecimal
Exclusive
numbering number in a
system particular
bits of isthe
or the system, 16.the
binaryBCH section
number code withas
4. Let r denotes number system’s1radix.
By using consensus
Decimal number propertysystem 3 The3only . value(s)
5 those of the per exam
binary number pattern. =
shifted. 1 ⊕ AB = A B
3 (1331) = (11) is/are
001001101011
Example 6: (1A5C) corresponds
16
= 1 × 16 to3
+ Athe × 16following
2
+ 5 × 16 + C
1
number
× 16 0
of r that satisfy thenumbers equation Example 49: Convert = 1(1001)

× 4096 to gray
2 = A+ B
code+ 5(
× 256 × 16 + 12 × 1
xy + x′z +Decimal
yzBCD = xy + x′z
subtractionare usual
BCDnumbers
subtraction
r which r we use in our day-to-
is performed by sub- in base -6 system. + 10
= 4096 + 2560 + 80 + 12 = (6748)10 .
De Morgan’s)
(A) 10 daytracting
life. Thethebase
digits (B)
of the 11 4-bit
ofdecimal
each numbergroupsystem is 10.
of the There are Binary
subtrahend(A) 4651 → 1010 (B) 4562
Y(C)= xy + x′z
ten
10 and 11 numbers 0 to 9.
from the corresponding (D) any r >group
4-bit 3 of the minuend in Shifted
Table 1 Binary
Different →
number 101 ⊕
systems
The value of the nth digit of the number from the right side (C) Gray1153
DecimalExample 1111 5: Octal
→Binary
(D)AB1353Hexadecimal
binary starting from the LSB.
5. Example 2:nth The
X is 16-bit =signed × output
digitnumber.
(base)n–1The of 2’s
thecomplement
given circuit is equal
repre- to Gray 00 010of 11 1010
11. The signed 0 2’s complement
to binary 000
conversion CD
representation
0 (-589)
sentation ofExample
X is (F76A)
Example 1: 45:
(99)1042.→The × 10
90100 9 × 10(042 in BCD
2’s1 +complement
0010 repre-
) in 1
(a) Take
Hexadecimal the MSB 001
number of thesystem
binary00 1
number
is is same1
as1MSB1of
A 8 × X is
16
= 90 + 9 = 99 0 0
sentation of −12 −0001 0010 (12 IN BCD) (A) (F24D)
2
gray 010
code number. 2
(B)3 (FDB3)16 3
2
BExample 2: (332)10 →(B) 3 × 102 + 3 × 10 + 2 × 100 01 0 ×significant

× 1bit
1 3 16 011
(A) (1460) 30 0011(D643) 0000 16(No borrow, so this is (C) (b) X-OR
(F42D) the MSB of the binary to the
(D)4 (F3BD)16 4 next
16 = 300 + 30 + 2 the correct difference) 4 100
(C) (4460)16 (D) (BB50) of the16gray code. × ×5 1 ×
Example 3: (1024)10 → 1 × 103 + 0 ×16102 + 2 × 101 + × 10012. The base 5
(c) X-OR
101
thenumber
2nd bit of binary for
11
5
to the 3rd bit of following
Gray code
Example 46: of the system which the
6. The HEX number (CD.EF)16 in = 1000
octal + 0number = 1024 is
+ 20 + 4 system 6 110
so10
6
on. 1
6
(Borrow to get 3rd bit binary and 66 0 1 1
(A) (315.736) 247.7 0010 0100 0111 . 0111
(B) (513.637)8 are operation
7 is to be correct
(d) Continue
111
this till all the gray = 137 7
bits are exhausted.
ABinary 8 number
−
system 8 1000 5 10 8
(C) (135.673) 156 . 9 0001
(D) there 0101
(531.367) 0110 . 1001
6 9 The
present,(A) Example minimized
50: Convert,
1001 gray code
expression
(B)11 1010
7 to binary for the given K–map is
BIn binary number system, are only
8 8 two digits ‘0’ and ‘1’. 9
90.8 0000 0111 ⋅0000 . 1110 subtract(C) Gray 8 10 1010 1 0(D) 12 19 0 A
Since there are
7. 8-bit 2’s complement only two numbers,
representation its base is 2.
a decimal number 0110)
Example 4: (1101)in = 1 × 23 + 1 ×−01001
22 + 0 × −210110
+ 1 × 20 11 1010
Solution: 1011
AB13 B
is 10000000. The number 2 decimal is 13. The solution to the 1100 ⇓
quadratic ⊕ || ⊕ || ⊕ x||2 - 11x 13 = 0
Corrected CD equation1400 01 C11 +10
(A) +256 A  B = AB +(B)
Solution: = 8 +
AB04 + 1 =
1001 (13) 000 ⋅ 1000 12
10
difference(in number 1100
system with 1 1
radix r)
15 0
0are x0 = 2 and 1 x = 4.
13
= (1100)
1101
00 0 D1
(C) -128 Octal number system (D) -256 (90.8) Then base 14 of the2 number 1110 system 16 is (r) = E
A Octal number system has eight numbers 0 to 7. The base of the × F×
8. The range of signed decimal 1 numbers that can be rep- (A) 7 15 1111 01(B)17 0 6 1
Exercises B number system is 8. The number (8)10 is represented by (10)8.Exercises
resented by 7-bit 1’s complement representation is (C) 5 11(D) ×
4 × (Continued )×
1
Practice problems for (A) stu-
-64 to +Practice
63 Problems (B) -63 1 to + 63 3 14.y The 16’s2. Ifcomplement
(84)x (in base xofnumber BADA10 system)
is1 is0equal1to (64) 1 y (in
(C) -127 to Directions
+ 128 for questions (D) -128 to +127 base y number system), then possible values of x and y
dents to master the concepts 1 to 15: Select the correct alterna- (A) 4525
are
(B) 4526
tive from the given choices.
Decimal A
studied in chapter. 9.Exercises 54 in hexadecimal and BCD number system is (C) ADAB (A) 12, = 9A + B C
(D)(B) 2141 6, 8
2
1. Assuming all the numbers are in 2’s X OR gate
complement rep-
consist of two levels of prob-B
respectively
resentation, which of the following is divisible by
15. (11A1B) (C)
8
= 9, 12
(12CD) 16
, in the above (D) 12, 18
expression A and B
(A)
lems “Practice Problem I” 63, 10000111 11110110? (B) 36,01010100 represent AExample
3. Letpositive = 1111 digits
1011in 6:
and In
octal the
0000 figure
B = number 1011system
be twoshown,
and8-bitC y , y , y will be 1s
2 1 0
(C) 66, 01010100 (A) 11101010(D) 36, 00110110 (B) 11100010 and D have signed their original meaning
2’s complement
complement numbers.
of x x in Their
xHexadecimal,
if =
product
z ? in the
2’s
and “Practice Problem II” (C) 11111010A  B = AB + (D) AB11100111 values of A and B are?
complement representation is 2 1 0
10.diffi
based on increasing A culty
new binary-coded hextary (BCH) number system
is proposed in which everycircuit
digit ofisa ‘0’. base As -6 number (A) 2, 5 (B) 2, 3
level. So the output of above two inputs are same
(C) 3, 2 (D)x03, 5
system is represented by its corresponding 3-bit binary y0
at third gate.
Output of XOR gate with two equal inputs is zero.
x1
Practice Problems 2 \y=0 6. Signed 2’s complement representation of (–15)10 is y1
(A) 11111 (B) 10001
Directions
Examplefor questions to 20: Select
3: The 1circuit shown theincorrect alterna-is functionally
the figure (C) 01111 (D) 10000
tive from the given choices. x2
equivalent to y2
1. The hexadecimal representation of (567)8 is 7. (0.25)10 in binary number system is?
(A) (A) (0.01) (B) (0.11)
A 1AF (B) D77
(C) 177 (D) 133 (C) 0.001 (D) 0.101 z = ?
B
2. (2326)8 is equivalent to 8. The equivalent of (25)6 in number system with base 7
(A)
A (14D6)16 (B) (103112)4 is? Solution: We are using X-OR gate
(C) (1283)10 (D) (09AC)16 (A) 22 ∴ XOR out-put (B) is
23 complement of input only when other
B (C) 24 (D) 26
3. (0.46) equivalent in decimal is?
8 input is high.
(A) 0.59375 (B) 0.3534 9. The operation Z =+ 126 = 63 is true in number system
∴ 35
(C) 0.57395
Solution: (D) 0.3435 with radix
4. The 15’s complement of (CAFA)16 is (A) 7 Example 7: The
(B) output
8 y of the circuit shown is the figure is
A (C) 9 (D) 11
A
(A) (2051)16 (B) (2050)16A · B A
(C) (3506)16 (D) (3505)16 (A + B )
10. The hexadecimal
B equivalent of largest binary number
B y=A⊕B
(C) 2’s complement (D) All of these
18. Perform the subtraction in XS-3 code 57.6 - 27.8
14. For the binary number 101101111 the equivalent hexa-
(A) 0101 1100.1011 (B) 0010 1001.1100
decimal number is
(C) 00011101.1100 (D) 1010 1110.1011
(A) 14E (B) 9E
(C) B78 (D) 16F 19. The 2’s complement representation of -17 is
15. Subtract 1001 from 1110 (A) 101110 (B) 111110
(A) 0010 (B) 0101 (C) 101111 (D) 110001
(C) 1011 (D) 1010
20. The decimal 398 is represented in 2421 code by
16. Which of the following is a positively weighted code? (A) 110000001000 (B) 001110011000
(A) 8421 (B) 84-2-1 (C) 001111111110 (D) 010110110010
x | (C)
Key Pedagogical (D)
EXS-3 Features
74-2-1
previous Years’ Questions Previous Years’

1. (1217)8 is equivalent to
(A) (1217)16 (B) (028F)16
[2009] 1, 2, 3. Define another random variable Y = X1 X2 ⊕
X3, where ⊕ denotes XOR. Then
Questions
(C) (2297)10 (D) (0B17)16
Pr[Y = 0|X3 = 0] = ______ [2015] Contains previous 10
2. P is a 16-bit signed integer. The 2’s complement rep- years GATE Questions
resentation of P is (F87B)16. The 2’s complement rep- 8. The 16-bit 2’s complement representation of an inte-
resentation of 8*P is [2010] ger is 1111 1111 1111 0101; its decimal representa- at end of every chapter
(A) (C3D8)16 (B) (187B)16 tion is ___ . [2016]
9. Consider an eight - bit ripple - carry adder for com-
which help students to get
(C) (F878)16 (D) (987B)16
3. The smallest integer that can be represented by an puting the sum of A and B, where A and B are integers an idea about the type of
8-bit number in 2’s complement form is [2013] represented in 2’s complement form. If the decimal problems asked in GATE
(A) –256 (B) –128 value of A is one, the decimal value of B that leads to
(C) –127 (D) 0 the longest latency for the sum to stabilize is _____ . and prepare accordingly.
4. The base (or radix) of the number system such that the [2016]
312 10. Let x1 ⊕x2 ⊕x3 ⊕x4 = 0 where x1 ,x2 ,x3 ,x4 are Boolean
following equation holds is ––––– = 13.1 [2014]
20 variables, and ⊕ is the XOR operator. Which one of
5. Consider the equation (123)5 = (x8)y with x and y as the following must always be TRUE? [2016]
unknown. The number of possible solutions is –––––––. (A) x1 x2 x3 x4 = 0
[2014] (B) x1 x3 + x2 = 0
6. Consider the equation (43)x = (y3)8 where x and y (C) x1 ⊕ x3 = x3 ⊕ x4
are unknown. The number of possible solutions is (D) x1 + x2 + x3 + x4 = 0
_______ [2015] 11. Consider a quadratic equation x2 - 13x + 36 = 0 with
7. Suppose Xi for i = 1, 2, 3 are independent and identi- coefficients in a base b. The solutions of this equa-
cally distributed random variables whose probability tion in the same base b are x = 5 and x = 6. Then b =
mass functions are Pr[Xi = 0] = Pr[Xi = 1] = ½ for i = __________. [2017]
38 | Digital Logic
Hints/solutions Hints/Solutions
This section gives complete
Practice Problems 1 Then Z = A + B
Hence, the correct option is (B).
solutions of all the unsolved
1.
A
0 A y=1 8. Error → transmits odd number of one’s, for both cases. questions given in the chapter.
A A Hence, the correct option is (A). The Hints/Solutions are
9. ∑(0, 1, 2, 4, 6) P should contain minterms of each func- included in the CD accompa-
X-OR of two equal inputs will give you result as zero. tion of x as well as y
nying the book.
2. Positive level OR means negative level AND vice versa 10. AB + ACD + AC
Hence, the correct option is (D). = AB(C + C )( D + D) + A( B + B )CD + A( B + B )C ( D + D)
3. AB⋅CD ⋅ EF ⋅ GH = AB (CD + CD + CD + C D) + ABCD + ABCD +
(De Morgan’s law) = AC ( BD + BD + BD + BD)
= ( A + B ) (C + D ) ( E + F ) (G + ( H )) ABCD + ABCD + ABCD + ABC D + ABCD +
ABCD + ABCD + ABCD + ABCD
4. AB
A Hence, the correct option is (A).
B 1.80 | Unit 1 • Digital Logic
AB · B = AB + B (AB + B ) · B = A + B 11. ABCD + ABCD + ABCD + ABCD
Practice Tests = ABC + ABC Test
y
Time-bound Test provided at = BC
end of each unit for assessment Digital logic Hence, the correct option is (C). Time: 60 min.
C 12. YZ
of topics leaned in the(ABunit.
+ B ) · C = AC + BC
Directions for questions
WX
30: Select
1 to 01
00 11 10the correct alterna- 9. The number of product terms in the minimized SOP
tive from the given choices. from is
00 1 1
= ( A + B ) + AC + BC 1. What is the range of signed decimal numbers that can 1 0 0 1
01 1 1 1 1
be represented by 4-bit 1’s complement notation? 0 D 0 0
= ( A + C + B ) = ABC (A) –7 to + 7 11 1 (B) –161 to +16 0 0 D 1
Hence, the correct option is (C). (C) –7 to +8 10 1 (D) –151 to +16 1 0 0 1
5. The output should be high when at least two outputs 2. Which

are of the 1 octet + 1 quad
following signed representation have a (A) 2 (B) 4
high y = ABC + ABC + ABC + ABC unique representation
= z + wx of 0? (C) 5 (D) 3
(A) Sign-magnitude (B) 1’s complement
The minimized output Hence, the correct option is (D). 10. The minimum number of 2 input NAND gates needed
(C) 0’s complement (D) 2’s complement
y = AB + AC + BC 13. A AB to implement Z = XY + VW is
3. Find the oddBone out among the following (A) 2 (B) 3
Hence, the correct option is (A). (A) EBCDIC (B) GRAY P = AB (C) 4 (D) 5
6. f1(x, y, z) x (C) Hamming (D)
A ASCII
x + f3 11. The operation a ⊕ b represents
f2(x, y, z) 4.z)Gray code for number 8 is
f (x, y, Y
(A) 1100 (B) 1111 A + B (A) C ab + a b (B) ab + ab
(C) 1000 (D)
B 1101 (C) ab + ab (D) a − b
f3(x, y, z)
5. Find the equivalent
C = ABlogical
⋅(A + Bexpression
) for z = x + xy 12. Find the dual of X + [Y + XZ] + U
x consists of all min terms, so x = 0, and f = f3 (A) z = x y (B) Z = xy (A) X + [Y(X + Z)] + U (B) X(Y + XZ)U
(C) Z = x + y = ( A + B ) ( A + B )
(D) Z = x + y
f3 (x1 y1 z) = (1, 4, 5) (C) X + [Y(X + Z)]U (D) X [Y(X + Z)]U
AB + AB
6. The number of=distinct Boolean expression of 3 vari-
Hence, the correct option is (A). 13. The simplified form of given function AB + BC + AC is
ables is Hence, the correct option is (A). equal to
7. I J
(A) 256 (B) 16
14. AB (A) AB + AC (B) AC + BC
A (C) 1024 C (D) 65536 (C) AC + BC (D) AB + AC
Z Boolean expression
7. The 0 0 0 for0the 0truth table shown is
14. Simplify the following
1 0 1 0 0
X Y Z F YZ
Traal and error method ⇒ 0 B( A0+ C ) 0( A + C0). WX
1 1 0 1
I = 1, J = B 0
Hence, 0 correct
the 1 option
0 is (A). 1 1 0 1
0 1 0 0
0 0 1 1
0 1 1 1
1 0 0 0 0 0 0 0
1 0 1 0
Syllabus: Computer Science
and Information Technology
Computer Science and Information Technology
Digital Logic: Boolean algebra. Combinational and sequential circuits. Minimization. Number representations and com-
puter arithmetic (fixed and floating point).
Computer Organization and Architecture: Machine instructions and addressing modes. ALU, data-path and control
unit. Instruction pipelining. Memory hierarchy: cache, main memory and secondary storage; I/O interface (interrupt and
DMA mode).
Programming and Data Structures: Programming in C. Recursion. Arrays, stacks, queues, linked lists, trees, binary
search trees, binary heaps, graphs.
Algorithms: Searching, sorting, hashing. Asymptotic worst case time and space complexity. Algorithm design tech-
niques: greedy, dynamic programming and divide-and-conquer. Graph search, minimum spanning trees, shortest paths.
Theory of Computation: Regular expressions and finite automata. Context-free grammars and push-down automata.
Regular and contex-free languages, pumping lemma. Turing machines and undecidability.
Compiler Design: Lexical analysis, parsing, syntax-directed translation. Runtime environments. Intermediate code
generation.
Operating System: Processes, threads, inter1process communication, concurrency and synchronization. Deadlock. CPU
scheduling. Memory management and virtual memory. File systems.
Databases: ER1model. Relational model: relational algebra, tuple calculus, SQL. Integrity constraints, normal forms.
File organization, indexing (e.g., B and B+ trees). Transactions and concurrency control.
Computer Networks: Concept of layering. LAN technologies (Ethernet). Flow and error control techniques, switch-
ing. IPv4/IPv6, routers and routing algorithms (distance vector, link state). TCP/UDP and sockets, congestion control.
Application layer protocols (DNS, SMTP, POP, FTP, HTTP). Basics of Wi-Fi. Network security: authentication, basics of
public key and private key cryptography, digital signatures and certificates, firewalls.
Chapter-wise Analysis of GATE
Previous Years’ Papers
Subject 2005 2006 2007 2008 2009 2010 2011 2012 2013 2014 2015 2016 2017 2018 2019
Theory of Computation
1 Mark 0 2 2 3 4 1 3 4 1 5 1 3 2 2 2
2 Marks 7 6 5 6 3 3 3 1 2 6 3 3 4 3 3
Total Marks 14 14 12 15 10 7 9 6 5 17 7 9 10 8 8
Digital Logic
1 Mark 4 1 3 4 2 3 3 2 3 3 1 2 2 2 3
2 Marks 5 5 5 1 0 2 3 2 1 5 2 1 2 1 2
Total Marks 14 11 13 6 2 7 9 6 5 13 5 4 6 4 7
Computer Organization and Architecture
1 Mark 4 0 2 0 2 1 3 2 1 2 1 2 3 3 3
2 Marks 9 7 6 12 4 4 2 4 7 2 2 2 4 4 1
Total Marks 22 14 14 24 10 9 7 10 15 6 5 6 11 11 5
Programming and Data Structures
1 Mark 5 0 1 1 1 3 4 2 2 0 5 2 4 3 2
2 Marks 3 6 3 3 3 5 7 6 5 2 3 5 4 3 5
Total Marks 11 12 7 7 7 13 18 14 12 4 11 12 12 9 12
Algorithm
1 Mark 2 8 3 2 3 1 1 4 5 1 4 4 2 1 2
2 Marks 10 7 12 15 6 3 0 2 3 2 4 5 2 5 3
Total Marks 22 22 27 32 15 7 1 8 11 5 12 14 6 11 8
Compiler Design
1 Mark 1 1 1 2 1 2 1 1 2 1 2 1 2 1 2
2 Marks 5 5 5 2 0 1 0 3 2 2 1 1 1 2 2
Total Marks 11 11 11 6 1 4 1 7 6 5 4 3 4 5 6
Operating System
1 Mark 0 1 2 2 2 3 3 1 1 0 2 1 2 2 2
2 Marks 2 8 6 5 5 2 2 3 1 2 2 4 2 3 4
Total Marks 4 17 14 12 12 7 7 7 3 4 6 9 6 8 10
Database
1 Mark 3 1 0 1 0 3 0 3 1 3 1 3 2 2 2
2 Marks 4 4 6 5 5 2 3 3 4 2 2 1 3 2 3
Total Marks 11 9 12 11 5 7 6 9 9 7 5 5 8 6 8
Computer Networks
1 Mark 5 1 2 1 0 2 5 3 4 4 2 2 2 3 1
2 Marks 2 5 6 4 5 3 2 3 2 2 3 4 3 2 4
Total Marks 9 11 14 9 5 8 9 9 8 8 8 10 8 7 9
Software Engineering
1 Mark 1 0 1 0 0 1 1
2 Marks 0 0 0 0 1 0 1
Total Marks 1 0 1 0 2 1 3
Web Technology
1 Mark 1 0 1 0 0 0 1
2 Marks 0 0 0 0 0 0 1
Total Marks 1 0 1 0 0 0 3
General Information about GATE
Structure of GATE
The GATE examination consists of a single online paper of 3-hour duration, in which there will be a total of 65 questions
carrying 100 marks out of which 10 questions carrying a total of 15 marks are in General Aptitude (GA).
Section Weightage and Marks

70% of the total marks is given to the technical section while 15% weightage is given to General Aptitude and Engineering
Mathematics each.
Weightage Questions (Total 65)
Respective 70 Marks 25—1 mark questions
Engineering Branch 30—2 mark questions
Engineering Maths 15 Marks
General Aptitude 15 Marks 5—1 mark questions
5—2 mark questions
Particulars
For 1-mark multiple-choice questions, 1/3 marks will be deducted for a wrong answer. Likewise, for 2-mark multiple-choice
questions, 2/3 marks will be deducted for a wrong answer. There is no negative marking for numerical answer type questions.
Question Types
1. Multiple Choice Questions (MCQ) carrying 1 or 2 marks each in all papers and sections. These questions are
objective in nature, and each will have a choice of four answers, out of which the candidate has to mark the correct
answer.
2. Numerical Answer carrying 1 or 2 marks each in all papers and sections. For numerical answer questions, choices
will not be given. For these questions the answer is a real number, to be entered by the candidate using the virtual
keypad. No choices will be shown for this type of questions.
Design of Questions
The fill in the blank questions usually consist of 35%– 40% of the total weightage.
The questions in a paper may be designed to test the following abilities:
1. Recall: These are based on facts, principles, formulae or laws of the discipline of the paper. The candidate is expected
to be able to obtain the answer either from his/her memory of the subject or at most from a one-line computation.
2. Comprehension: These questions will test the candidate’s understanding of the basics of his/her field, by requiring
him/her to draw simple conclusions from fundamental ideas.
3. Application: In these questions, the candidate is expected to apply his/her knowledge either through computation or
by logical reasoning.
4. Analysis and Synthesis: In these questions, the candidate is presented with data, diagrams, images etc. that require
analysis before a question can be answered. A Synthesis question might require the candidate to compare two or
more pieces of information. Questions in this category could, for example, involve candidates in recognising unstated
assumptions, or separating useful information from irrelevant information.
About Online Pattern

The examination for all the papers will be carried out in an ONLINE Computer Based Test (CBT) mode where the candi-
dates will be shown the questions in a random sequence on a computer screen. The candidates are required to either select
the answer (for MCQ type) or enter the answer for numerical answer-type question using a mouse on a virtual keyboard
(keyboard of the computer will be disabled). The candidates will also be allowed to use a calculator with which the online
portal is equipped with.
xiv | General Information about GATE
Important Tips for GATE

The followings are some important tips which would be helpful for students to prepare for GATE exam
1. Go through the pattern (using previous year GATE paper) and syllabus of the exam and start preparing accordingly.
2. Preparation time for GATE depends on many factors, such as, individual’s aptitude, attitude, fundamentals,
concentration level etc., Generally rigorous preparation for 4 to 6 months is considered good but it may vary from
student to student.
3. Make a list of books which cover complete syllabus, contains solved previous year questions and mock tests for
practice based on latest GATE pattern. Purchase these books and start your preparation.
4. Make a list of topics which needs to be studied and make priority list for study of every topic based upon the marks
for which that particular topic is asked in GATE exam. Find out the topics which fetch more marks and give more
importance to those topics. Make a timetable for study of topics and follow the timetable strictly.
5. An effective way to brush up your knowledge about technical topics is group study with your friends. During group
study you can explore new techniques and procedures.
6. While preparing any subject highlight important points (key definitions, equations, derivations, theorems and laws)
which can be revised during last minute preparation.
7. Pay equal attention to both theory and numerical problems. Solve questions (numerical) based on latest exam pattern
as much as possible, keeping weightage of that topic in mind. Whatever topics you decide to study, make sure that
you know everything about it.
8. Try to use short-cut methods to solve problems instead of traditional lengthy and time consuming methods.
9. Go through previous year papers (say last ten years), to check your knowledge and note the distribution of different
topics. Also analyze the topics in which you are weak and concentrate more on those topics. Always try to solve
papers in given time, to obtain an idea how many questions you are able to solve in the given time limit.
10. Finish the detail study of topics one and a half month before your exam. During last month revise all the topics once
again and clear leftover doubts.
GATE 2019 Solved Paper
CS: Computer Science and Information Technology
Number of Questions: 46 Total Marks: 67

Wrong answer for MCQ will result in negative marks, (-1/3) for 1 Mark Questions and (-2/3) for 2 Marks Question.
Q.1–Q.25 carry one mark each. Question Number: 3 Question Type: MCQ
Question Number: 1 Question Type: MCQ For ∑ = {a, b}, let us consider the regular language
L = {x | x = a2 + 3k or x = b10 + 12k, k ≥ 0}. Which one of the
Consider Z = X – Y, where X, Y and Z are all in sign-magni-
following can be a pumping length (the constant guaranteed
tude form. X and Y are each represented in n bits. To avoid
by the pumping lemma) for L?
overflow, the representation of Z would require a minimum
of: (A) 5 (B) 3
(C) 24 (D) 9
(A) n bits (B) n + 2 bits
(C) n + 1 bits (D) n – 1 bits Solution: If L is a regular language, then there is a number
Solution: Z = X - Y P (the pumping length) such that S is any string in L of
X is n-bit sign magnitude number length P or more can be written as S = xyz, satisfying the
Y is n-bit sign magnitude number following conditions.
for each i ≥ 0, xyi z ∊ L,
To avoid overflow, the representation of Z would require a
minimum of n + 1 bits |y| > 0 and |xy| ≤ P
Hence, the correct option is (C). So we need to find the minimum length string s = xyz ∊ L
Question Number: 2 Question Type: MCQ such that xyiz should also be L.
The chip select logic for a certain DRAM chip in a memory L = {a2, a5, a8, a11…….}
system design is shown below. Assume that the memory Here we can take pumping length as 3.
system has 16 address lines denoted by A15 to A0. What is OR
the range of addresses (in hexadecimal) of the memory sys- 10 22 34
tem that can get enabled by the chip select (CS) signal? L = {b , b , b …….}
Here, the pumping length can be 12.
A15
A14 If we take pumping length as 24, in every repetition we will
A13 CS get multiple of 3 and 12.
A12
A11 Hence, the correct option is (C).
(A) CA00 to CAFF (B) C800 to CFFF Question Number: 4 Question Type: MCQ
(C) C800 to C8FF (D) DA00 to DFFF Which one of the following is NOT a valid identity?
Solution: (A) x ⊕ y = x + y, if xy = 0
A15 (B) (x ⊕ y) ⊕ z = x ⊕ (y ⊕ z)
A14
A13 CS (C) (x + y) ⊕ z = x ⊕ (y + z)
A12 (D) x ⊕ y = (xy + x′y′)′
A11
Solution: (x + y) ⊕ z = x ⊕ (y + z) is not a valid statement.
A15 A14 A13 A12 A11 - A4 A3 A2 A1 A0
Hence, the correct option is (C).
1 1 0 0 1 - 0 0 0 0 0 C800H
. Question Number: 5 Question Type: MCQ
. Which one of the following kinds of derivation is used by
. LR parsers?
(A) Leftmost in reverse
1 1 0 0 1 1 1 1 1 1 CFFFH (B) Leftmost
Hence, the correct option is (B). (C) Rightmost in reverse
(D) Rightmost
xvi | GATE 2019 Solved Paper CS
Solution: LR parser is a bottom up parser. Bottom up pars- Question Number: 9 Question Type: NAT
er uses reverse of right most derivation. Consider the following C program:
#include <stdio.h>
Question Number: 6 Question Type: NAT int jumble (int x. int y) {
Consider a sequence of 14 elements; A = [–5 , –10, 6, 3, –1, x = 2 *x + y;
–2, 13, 4, –9, –1, 4, 12, –3, 0]. The subsequence sum s(i, j), return x;
where 0 ≤ i ≤ j < 14. (Divide and conquer approach may be
}
used.)
int main ( ) {
Solution: A[–5, –10, 6, 3, –1, –2, 13, 4, –9, –1, 4, 12, –3, 0] int x = 2, y = 5;
∑
11
Max (S(i, j)) = S(2, 11) = A[k ] = 29 y = jumble (y, x);
k =2
Hence, the correct answer is (29). x = jumble (y, x);

printf(“%d \n”, x);
Question Number: 7 Question Type: NAT return 0;
Consider the following C program: }
#include <stdio.h>
int main( ) { The value printed by the program is _____.

int arr [ ] = {1, 2, 3, 4, 5, 6, 7, Solution:
8, 9, 0, 1, 2, 5}, *ip = arr + 4;
x 2 y 5
printf(“%d\n”, ip[1];
return 0; 26 12
main
}
x 5 y 2
The number that will be displayed on execution of the pro-
gram is _____. 12
y gets updated jumble

Solution:
0 1 2 3 4 5 6 7 8 9 10 11 12 x 12 y 2 jumble
arr 1 2 3 4 5 6 7 8 9 0 1 2 5
x gets updated
100 100 *
ip • Hence, the correct answer is (26).
Hence, the correct answer is (6). Question Number: 10 Question Type: MCQ
Question Number: 8 Question Type: MCQ A certain processor uses a fully associative cache of
size 16 kB. The cache block size 16 bytes. Assume that
Consider the following two statements about database trans-
the main memory is byte addressable and uses a 32-bit
action schedules:
address. How many bits are required for the Tag and the
I. Strict two-phase locking protocol generates conflict Index fields respectively in the addresses generated by the
serializable schedules that are also recoverable. processor?
II. Timestamp-ordering concurrency control protocol with (A) 28 bits and 4 bits (B) 28 bits and 0 bits
Thomas’ Write Rule can generate view serializable
(C) 24 bits and 4 bits (D) 24 bits and 0 bits
schedules that are not conflict serializable.
(A) II only (B) I only Solution: Cache block size = 16 Bytes
(C) Both I and II (D) Neither I nor II = 24 B ⇒ Block offset = 4 bits
Fully associative cache size = 16 kB
Solution: The strict two-phase locking protocol guarantees
TAG Byte offset
strict schedules (strict schedules are conflict serializable.)
The Timestamp-ordering concurrency control with Thomas, 28 bits 4 bits
Write Rule does not enforce conflict serializability. In fully associative cache, there is no any index.
The given both statements are true. Indexing requires 0 bits and Tag bits = 28.
Hence, the correct option is (C). Hence, the correct option is (B).
GATE 2019 Solved Paper CS | xvii
Question Number: 11 Question Type: NAT P1 P2 P3

51
The value of 3 mod 5 is _____. : : :
: :
Solution: We have to find 351 mod 5 :
D = D + 20 D = D + 10
D = D – 50
31 mod 5 = 3 : :
:
32 mod 5 = 4 : : :
33 mod 5 = 2 The processes are executed on a uniprocessor system run-
34 mod 5 = 1 ning a time-shared operating system. If the minimum and
35 mod 5 = 3 maximum possible values of D after the three processes
have completed execution are X and Y respectively, then the
36 mod 5 = 4 value of Y – X is _____.
37 mod 5 = 2
Solution: Assembly code of the three process are
38 mod 5 = 1
Process P1:
In general 34m mod5 = 1 for m∈z+
(1) Load R1, M[D]
∴ 351 mod 5 = 34 × 12 + 3 mod 5
(2) ADD R1, #20
= 33 mod 5 = 2
(3) STORE M[D], R1
Hence, the correct answer is (2).
Process P2:
Question Number: 12 Question Type: MCQ (A) Load R2, M[D]
Which one of the following statements is NOT correct (B) SUB R2, #50
about the B+ tree data structure used for creating an index (C) STORE M[D], R2
of a relational database table? Process P3:
(A) Non-leaf nodes have pointers to data records (X) Load R3, M[D]
(B) Key values in each node are kept in sorted order (Y) ADD R3, #10
(C) B+ Tree is a height-balanced tree (Z) STORE M[D], R3
(D) Each leaf node has a pointer to the next leaf node
Minimum value of D
Solution: In a B+ tree, data pointers are stored only at the Process P2executes (A), (B) instructions and got preempted,
leaf nodes of the tree. i.e., it did not store the value 50 to ‘D’. Now, process P1 and
Hence, the correct option is (A). P2 executes their instructions, i.e., (1), (2), (3) and (X), (Y),
(Z). The value of D will be 130 and now, the instruction (C)
Question Number: 13 Question Type: MCQ is executed, it stores the value 50 to D.
If L is a regular language over ∑ = {a, b}, which one of the
Maximum value of D
following language in NOT regular?
Process P1 first completed its execution, its value will be
(A) Suffix (L) = {y ∈ ∑* | ∃x∈∑* such that xy ∈ L} 120.
(B) {wwR | w ∈ L} Process P3 executes (X), (Y) and get preempted, P2 com-
(C) L. LR = {xy | x ∈ L, yR ∈ L} pletes its execution. Now, process P3 completes (Z) instruc-
(D) Prefix (L) = {x ∈ ∑* | ∃y ∈ ∑* such that xy ∈ L} tion the value will be 130.
Therefore, value of (Y – X) will be 80.
Solution: The regular languages are closed under reversal
and concatenation.
So, L.LR is regular WWR needs a memory (stack), therefore Question Number: 15 Question Type: NAT
the language is not regular. An array of 25 distinct elements is to be sorted using quick-
prefix (x) and suffix (x) is also regular. sort. Assume that the pivot element is chosen uniformly at
random. The probability that the pivot element gets placed
Hence, the correct option is (B). in the worst possible location in the first round of partition-
ing (rounded off to 2 decimal place) is _____.
Question Number: 14 Question Type: NAT
Consider three concurrent processes P1, P2 and P3 as shown Solution: For a quick sort, worst case is when array is sort-
below, which access a shared variable D that has been ini- ed. Let us consider the first element is considered as a pivot
tialized to 100. element
xviii | GATE 2019 Solved Paper CS
Solution:
16 28
Pivot ele 1– c
24 ele
(28)10 = (1C)16 = (00011100)2
Or + 2810 : 0000 0000 0001 1100
The last element is considered as a pivot – 2810 : 1111 1111 1110 0100
Hence, the correct option is (D).
Consider the grammar given below:
Pivot
24 elements S → Aa
Except first and last position all are either average case or A → BD
best case, as list will get divided in to 2 sublists. B → b|∈
2 D → d|∈
Probability = = 0.08.
25 Let a, b, d, and $ be indexed as follows:
Hence, the correct answer is (0.08).
Question Number: 16 Question Type: MCQ a b d $
Which of the following protocol pairs can be used to send 3 2 1 0
and retrieve e- mails (in that order)? Compute the FOLLOW set of the non-terminal B and write
(A) IMAP, SMTP (B) SMTP, MIME the index values for the symbols in the FOLLOW set in the
(C) SMTP, POP3 (D) IMAM, POP3 descending order. (For example, if the FOLLOW set is {a,
Solution: Mails can be sent using SMTP and to retrieve b, d, $}, then the answer should be 3210)
emails POP3 is used. Solution: Follow (B) = First (D) U
Hence, the correct option is (C). Follow (A) – {∈}
Question Number: 17 Question Type: NAT = {a, d}
The following C program is executed on a Unix/Linux It is indexed as 31.
system Hence, the correct answer is (31).
#include <unistd.h> Q.26–Q.55 carry two marks each.
int main( )
{
Let ∑ be the set of all bijections from {1, …..5} to {1, …..,
int i; 5}, where id denotes the identity function, i.e. id(j) = j, ∀j.
for (i = 0 ; i + +) Let ° denotes composition on functions. For a string x = x1,
if (i % 2 = = 0 ) fork( ): x2, ….xn ∈ ∑n, n ≥ 0, let π(x) = x1 ° x2 °….°xn. Consider the
return 0; language L = {x ∈ ∑* | π(x) = id}. The minimum number of
} states in any DFA accepting L is _____.
The total number of child processes created is ______. Solution: For a set of 5 elements number of bijections pos-
sible with itself are 5!= 120.
Solution: Number of times fork() get executed is 5 times Minimum number of states required for the language given
i.e for i = 0, 2, 4, 6, 8. in the question are 120.
Number of child process created for ‘n’ fork() calls are Hence, the correct answer is (120).
2n – 1
Consider the following relations P(X,Y,Z) Q(X,Y,T) and
Question Number: 18 Question Type: MCQ R(Y,V).
In 16-bit 2’s complement representation, the decimal num-
ber – 28 is: P Q R
(A) 1000 0000 1110 0100 X Y Z X Y T Y V
(B) 1111 1111 0001 1100 X1 Y1 Z1 X2 Y1 2 Y1 V1
(C) 0000 0000 1110 0100 X1 Y1 Z2 X1 Y2 5 Y3 V2
(D) 1111 1111 1110 0100
GATE 2019 Solved Paper CS | xix
X2 Y2 Z2 X1 Y1 6 Y2 V3 Solution: Y = PR and Z = QRS

Y ∩ Z = R (Key)
X2 Y4 Z4 X3 Y3 1 Y2 V2
As FD R → P is present, R is key.
How many tuples will be returned by the following rela- The given relation is lossless.
tional algebra query? The relation Y is in BCNF but relation Z is not in BCNF as
Πx ( ( P.Y = R.Y ∧ R.V = V 2) (P × R )) − Π x ( ( Q.Y = R.Y ∧ Q.T > 2) (Q × R )) in S → Q S is not a superkey.
Hence, the correct option is (A).
Solution:
Question Number: 23 Question Type: NAR
P×R
Let T be a full binary tree with 8 leaves. (A full binary
X Y Z Y V tree has every level full.) Suppose two leaves a and b of
X1 Y1 Z1 Y1 V1 T are chosen uniformly and independently at random. The
X1 Y1 Z1 Y3 V2 expected value of the distance between a and b in T (i.e.,
X1 Y1 Z1 V2 V3 the number of edges in the unique path between a and b) is
X1 Y1 Z1 Y2 V2 (rounded off to 2 decimal places) _____.
X1 Y1 Z2 Y1 V1 Solution:
X1 Y1 Y2 Y3 V2 Full binary tree with 8 leaf nodes
X1 Y1 Z2 Y2 V3
X1 Y1 Z2 Y2 V2
X2 Y2 Z2 Y1 V1
X2 Y2 Z2 Y3 V2
X2 Y2 Z2 Y2 V3
X2 Y2 Z2 Y2 V2 1 2 3 4 5 6 7 8
X2 Y4 Z4 Y1 V1 Expected value of the distance between a and b = 0
X2 Y4 Z4 Y3 V2 8 8 16 32
0× 2× +4× +6×
X2 Y4 Z4 Y2 V3 64 64 64 64
X2 Y4 Z4 Y2 V2 272
= = 4.25
πx (σ (P.Y = R.Y ∧ R.V = V2)(P × R)) 28
Out of 8 leaf nodes any 2 nodes can be chosen 8P2 + 8 (selec-
X tion of nodes with distance ‘0’) = 64.
X2 For length ‘2’ between a and b will have ‘8’ possibilities
πx (σ(Q.Y = R.Y ∧ Q.T > 2)(Q × R)) (i.g. (1) → (2) and (2) → (1) are two different paths)
X
X1 1 2 3 4 5 6 7 8
X2 – X1 = X2 Hence, the correct answer is (4.25 to 4.25).
Question Number: 22 Question Type: MCQ In a RSA cryptosystem, the value of the public modulus
parameter n is 3007. If it is also known that ϕ (n) = 2880,
Let the set of functional dependencies F = {QR → S, R →
where ϕ() denotes Euler’s Totient function, then the prime
P, S → Q} hold on a relation schema X = (PQRS). X is not
factor of n which is greater than 50 is _____.
in BCNF. Suppose X is decomposed into two schemas Y and
Z, where Y = (PR) and Z = (QRS). Solution: Let p, q be prime numbers.
Consider the two statements given below. Given
I. Both Y and Z are in BCNF. p * q = 3007
II. Decomposition of X and Y and Z is dependency pre- and
serving and lossless. (p – 1)(q – 1) = 2880
Which of the above statements is/are correct? pq – p – q + 1 = 2880
(A) II only (B) Both I and II 3007 – p – q + 1 = 2880
(C) I only (D) Neither I nor II (p + q) = 128
xx | GATE 2019 Solved Paper CS
3007 Then there is no prime number w in S1 such that w > x

p+ = 128 ∴ S1 does not satisfy ϕ
p
p2 + 3007 = 128 p Clearly, S2 and S3 satisfy ϕ.
p2 – 128 p + 3007 = 0 Hence, the correct option is (D).
On solving Question Number: 27 Question Type: NAT
p = 97, 31 A relational database contains two tables Students and
Hence, the correct answer is (97). Performance as shown below:
Question Number: 25 Question Type: MCQ Student Performance
Assume that in a certain computer, the virtual addresses are Roll_No Student Roll_No Subject _code Marks
64 bits long and the physical addresses are 48 bits long. name
The memory is word addressable. The page size is 8kB and 1 Amit 1 A 86
the word size is 4 bytes. The translation Look-aside Buffer 2 Priya 1 B 95
(TLB) in the address translation path has 128 valid entries.
3 Vinit 1 C 90
At most how many distinct virtual addresses can be trans-
4 Rohan 2 A 89
lated without any TLB miss?
5 Smita 2 C 92
(A) 8 × 220 (B) 16 × 210
(C) 4 × 220
(D) 256 × 210 3 C 80
Solution: Logical address = 64 bits The primary key of the Student table is Roll_no. For the
Physical address = 48 bits Performance table, the columns Roll_no and Subject_code
Page size = 8KB together form the primary key. Consider the SQL query
given below:
Word size = 4B
SELECT S.Student name, sum(P.Marks)
TLB entries = 128
8KB FROM Student S, Performance P
Number of entries in page = = 2k WHERE P.Marks > 84
4B
As the number of entries in TLB are 128. 128 entries trans- GROUP BY S. Student_name;
lates 128 page numbers into frame numbers. The number of rows returned by the above SQL query is
Distinct virtual addresses can be translated with TLB miss _____.
is Solution:
128 × 211 Student_name Sum (P.marks)
256 × 210 Amit 452
Hence, the correct option is (D). Priya 452
Question Number: 26 Question Type: MCQ Rohan 452
Consider the first order predicate formula ϕ : Smita 452
∀x [(∀z z|x ⇒ ((z = x) ∨ (z = 1))) ⇒ ∃w (w > x) ∧ (∀z z|w Vinit 452
⇒((w = z) ∨ (z = 1)))] Here ‘a|b’ denotes that ‘a divides b’,
where a and b are integers. Consider the following sets:
S1. {1, 2, 3,…….,100} Question Number: 28 Question Type: MCQ
S2. Set of all positive integers There are n unsorted arrays: A1. A2, ….., An Assume that n
S3. Set of all integers is odd. Each of A1. A2, ….., An contains n distinct elements.
There are no common elements between any two arrays.
Which of the above sets satisfy ϕ?
The worst-case time complexity of computing the median
(A) S1, S2 and S3 (B) S1 and S3 of A1. A2, ….., An is
(C) S1 and S2 (D) S2 and S3
(A) O(n)
Solution: Given (B) O(n log n)
ϕ : ∀ x [(∀ z z | x ⇒ ((z = x) ∨ (z = 1))) ⇒ ∃ w (w > x) ∧ (∀ (C) Ω(n2 log n)
z z | w ⇒ (w = z ) ∨ (z = 1)))] (D) O(n2)
Means, for every prime number, x, we can find another
Solution: To compute the median of unsorted array of n
prime number w such that w > x.
elements, it takes O(n) time. To find the medians of median,
Consider S1: {1, 2, 3, …,100} it will take O(n2) time.
Take x = 97 Hence, the correct option is (D).
GATE 2019 Solved Paper CS | xxi
Question Number: 29 Question Type: NAT Machine N and P belong to the same subnet.
Consider the following four processes with arrival times (in Hence, the correct option is (B).
milliseconds) and their length of CPU bursts (in millisec-
Question Number: 31 Question Type: MCQ
onds) as shown below:
Consider three 4-variable functions f1, f2, and f3, which are
Process P1 P2 P3 P4 expressed in sum-of-minterms as
Arrival time 0 1 3 4 f1 = ∑(0, 2, 5, 8, 14),
CPU burst time 3 1 3 Z f2 = ∑(2, 3, 6, 8, 14, 15),
These processes are run on a single processor using preemp- f3 = ∑(2, 7, 11, 14)
tive Shortest Remaining Time First scheduling algorithm. If For the following circuit with one AND gate and one XOR
the average waiting time of the processes is 1 millisecond, gate, the output function f can be expressed as:
then the value of Z is _____.
Solution: f1
AND
Process P1 P2 P3 P4 f2 XOR f
Arrival time 0 1 3 4
f3
Burse time 3 1 3 Z
Gannt chart (A) ∑ (0, 2, 3, 5, 6, 7, 8, 11, 14, 15)

(B) ∑(7, 8, 11)
P1 P2 P3 P4
(C) ∑(2, 7, 8, 11, 14)
0 1 2 3 4 (D) ∑(2, 14)
at t = 4
Solution:
Process P1 and P2 completes its execution. Waiting time of
f4
process P1 and P2 will be 1 and 0. Process P3 waiting time is f1
1. If Process P4 burst time can’t be 3, then the average wait- f2 f
ing time (AWS) exceeds 1 ms. It should be either 1 or 2. If it f3
is 1, then AWS will be less than 1. So, process P2 burst time
will be 2. Then AWS will be 1. f1 = Σm (0, 2, 5, 8, 14)
Hence, the correct answer is (2). f2 = Σm (2,3,6,8,14,15)
Question Number: 30 Question Type: MCQ f4 = Σm (2, 8, 14)
Consider three machines M, N and P with IP addresses f3 = Σm (2, 7, 11, 14)
100.10.5.2, 100.10.5.5 and 100.10.5.6 respectively. The f = Σm (7, 8, 11)
subnet mask is set to 255.255.255.252 for all the three Hence, the correct option is (B).
machines. Which one of the following is true?
(A) Only M and N belong to the same subnet Question Number: 32 Question Type: NAT
(B) Only N and P belong to the same subnet Consider the augmented grammar given below:
(C) M, N and P belong to three different subnets S′ → S
(D) M, N and P all belong to the same subnet S → (L) | id
Solution: Subnet mask = 255.255.255.252 L → L, S| S
Machine M Let I0 = CLOSURE ({[S′ → ⋅S]}). The number of items in
100.10. 5. 00000010 the set GOTO (I0, () is: _____.
255.255. 255. 1 1 1 1 1 1 0 0
Solution:
100.10. 5. 0
I0 S 1
Machine N 1
S Æ .S
S Æ .S
100.10. 5. 00000101 S Æ .(L)
255.255. 255. 1 1 1 1 1 1 0 0 S Æ .id
( I1
100.10. 5. 4
id S Æ (.L)
Machine P
L Æ . L, S
100.10. 5. 00000110
S Æid. L Æ. S
255.255. 255. 1 1 1 1 1 1 0 0 S Æ . (L)
100.10. 5. 4 S Æ . id
xxii | GATE 2019 Solved Paper CS
Number of items in I1 are 5. two processes p and q such that Yp = Yq = 0. Which one of
Hence, the correct answer is (5). the following conditions guarantees that no other process
apart from p and q can complete execution?
(A) Min (Xp, Xq) ≤ Max {Yk | 1 ≤ k ≤ n, k ≠ p, k ≠ q}
Suppose that in a IP-over-Ethernet network, a machine X
wishes to find the MAC address of another machine Y in its (B) Xp + Xq < Max {Yk | 1 ≤ k ≤ n, k ≠ p, k ≠ q}
subnet. Which one of the following techniques can be used (C) Xp + Xq < Min {Yk | 1 ≤ k ≤ n, k ≠ p, k ≠ q}
for this? (D) Min (Xp, Xq) ≥ Min {Yk | 1 ≤ k ≤ n, k ≠ p, k ≠ q}
(A) X send an ARP request packet to the local gate- Solution: Given
way’s IP address which then finds the MAC ad- Xi → Holding resources for process pi
dress of Y and sends to X.
Yi → Additional resources for process pi
(B) X send an ARP request packet to the local gate-
As process p and q doesn’t require any additional resources,
way’s MAC address which then finds the MAC ad-
it completes its execution and available resources are
dress of Y and sends to X.
(Xp + Xq)
(C) X sends an ARP request packet with broadcast IP
There are (n – 2) process pi (1 < i < n, i ≠ p, q) with their
address in its local subnet.
requirements as Yi (1 < i < n, i ≠ p, q). In order to not execute
(D) X sends an ARP request packet with broadcast process pi, no instance of Yi should be satisfied with (Xp
MAC address in its local subnet. + Xq) resources, i.e., minimum of Yi instances should be
Solution: In IP over Ethernet network, If machine X wants greater than (Xp + Xq).
to find MAC address of another machine Y in its subnet, Hence, the correct option is (C).
then X sends an ARP request packet with broadcast MAC Question Number: 36 Question Type: NAT
address in its local subnet.
Consider the following C program:
Hence, the correct option is (D).
# include < stdio. h>
Question Number: 34 Question Type: NAT int main ( )
The index node (inode) of Unix-like file system has 12 {
direct, one single – indirect and one double – indirect point-
Int a [ ] = {2, 4, 6, 8, 10}
ers. The disk block size is 4 kB, and the disk block address is
32 – bits long. The maximum possible file size is (rounded int i, sum = 0, *b = a + 4;
off to 1 decimal place) _____GB. for (i = 0; i < 5; i + +)
sum = sum + (*b – i) – *(b – i);
Solution: Maximum file size
printf(“%d\n”, sum);
  Disk block size   return 0;
 Number of direct pointers +  Disk block addresss  
=  }
  Disk block size  
 +   The output of the above C program is ___
 disk block address  
Solution:
∗ (Disk Block size) 0 1 2 3 4
a 2 4 6 8 10
 4 KB  4 KB  
2
= 12 + +   4 KB *
 4B  4B  
b
= [12 + 4K + 1M] ∗ 4KB
= 48KB + 16MB + 4GB i=0
sum = 0 + 10 – 10 = 0
≅ 4GB
i=1
Hence, the correct answer is (3.7 to 3.8 or 4.0 to 4.1).
sum = 0 + 9 – 8 = 1
Question Number: 35 Question Type: MCQ i=2
Consider the following snapshot of a system running n con- sum = 1 + 8 – 6 = 3
current processes. Processes i is holding Xi instances of a i=3
resource R, 1 ≤ i ≤ n. Assume that all instances of R are cur- sum = 3 + 7 – 4 = 6
rently in use. Further, for all i, process i can place a request i=4
for at most Yi additional instances of R while holding the Xi sum = 6 + 6 – 2 = 10
instances it already has. Of the n processes, there are exactly Hence, the correct answer is (10).
GATE 2019 Solved Paper CS | xxiii
Question Number: 37 Question Type: MCQ Solution:

Consider the following C function.
void convert (int n) {

if (n < 0)
printf (“%d”, n);
else {
convert (n/2);
printf(“%d”, n %2);
}
} F = I + II = B D + BD
Which one of the following will happen when the function

convert is called with any positive integer n as argument?
(A) It will print the binary representation of n and ter-
minate.
(B) It will print the binary representation of n but will
not terminate.
F = BD + BD = B ⊙ D
(C) It will not print anything and will not terminate.
Hence, to implement the given function in sum of minterms
(D) It will print the binary representation of n in the form, we need to take four 2-input NOR gates.
reverse order and terminate.
Solution: Let, n = 5 Question Number: 40 Question Type: NAT
Convert (5) A certain processor deploys a single-level cache. The cache
block size is 8 words and the word size is 4 bytes. The mem-
Convert (2) print (1) ory system uses a 60-MHz clock. To service a cache miss,
Convert (1) print (0) the memory controller first takes 1 cycle to accept the start-
ing address of the block, it then takes 3 cycles to fetch all
Convert (0) print (1) the eight words of the block, and finally transmits the words
|
of the requested block at the rate of 1 word per cycle. The
As the program will terminate for negative value and if we maximum bandwidth for the memory system when the pro-
divide zero by 2, it will give infinite value. The program will gram running on the processor issues a series of read opera-
not terminate and doesn’t print anything. tions is ___ × 106bytes/sec.
Hence, the correct option is (C). Solution: Block is 8 words
words is 4 bytes
Question Number: 38 Question Type: NAT Block size = 8 × 4
Consider that 15 machines need to be connected in a LAN = 32 Bytes
using 8 – port Ethernet switches, assume that these switches To transfer a block from memory
do not have any separate uplink ports. The minimum num- = (1 + 3 + 8) = 12 clocks
ber of switches needed is __________
In 12 clocks, it transfers 32 bytes
Solution: In an 8-port Ethernet switch, one port is used for 12 clocks → 32 Bytes
networks connection and one port for the other switch, total 60 × 106 → ?
6 ports are used for connecting machines. For 15 machines,
60 × 106 × 32
it requires 3 switches. =
12
= 160 bytes/sec
Question Number: 39 Question Type: NAT Hence, the correct answer is (160).
What is the minimum number 2-input NOR gates required Question Number: 41 Question Type: MCQ
to implement a 4-variable function expressed in sum-of- Consider the following statements;
minterms form as F = ∑(0, 2, 5, 7, 8, 10, 13, 15)?. Assume I. The smallest element in a max-heap is always at a leaf
that all the inputs and their complements are available. node.
xxiv | GATE 2019 Solved Paper CS
II. The second largest element in a max-heap is always a

num 4 3
child of the root node.
r() // condition
III. A max-heap can be constructed from a binary search
tree in θ(n) time. num 3 2
IV. A binary search tree can be constructed from a max- As non-zero value is returned by function r(), print state-
heap in θ(n) time. ment will get executed.
Which of the above statements are TRUE? print (r()) num 2 1
(A) I, II and III Value ‘2’ will get printed first.
(B) I, III and IV r()// increment/decrement
(C) II, III and IV
(D) I, II and IV num 1 0
r() // condition
Solution: I. The smallest element in a max-heap is always
present at a leaf node, it takes θ(n) time to find smallest num 0 -1
element. As ‘zero’ is returned, the loop terminates,
II. The largest element in a max-heap is root element The value printed is 52.’
whereas second largest is either left child or right child.
III. Construction of max-heap from binary search tree will
take θ(n) time. Question Number: 43 Question Type: NAT
ΙV. A binary search tree can not be constructed from a Consider the following C program:
max-heap in θ(n) time. #include <stdio.h>
Hence, the correct option is (A). int main( ) {
Question Number: 42 Question Type: MCQ float sum = 0.0, j = 1.0, i = 2.0;
Consider the following C program: while (i/j >0.0625) {
j = j + j;
#include <stdio.h>
sum = sum + i/j;
int r( ) {
printf(“%f\n”, sum);
static int num = 7;
}
return num --;
return 0;
}
}
int main( ) {
The number of times the variable sum will be printed, when
for (r ( ); r ( ); r ( )) the above program is executed, is _____.
printf(“%d”, r( ));
return 0; Solution:
} Sum 0.0 j 1.0 i 2.0
2.0 > 0.0625
Which one of the following values will be displayed on j = 2.0
execution of the programs?
Sum = 0 + 1.0
(A) 63 (B) 52
Print (1.0)//1
(C) 41 (D) 630
2.0/2.0 > 0.0625
Solution: r() // initialization j = 4.0
num 7 6 sum = 1.0 + 0.5 = 1.5
As post – decrement is present first the values ‘7’ is returned print (1.5)//2
and then it will get decremented. 4.0/2.0 > 0.0625
r()// condition j = 8.0
sum = 1.5 + 0.25 = 1.75
num 6 5
print (1.75)//3
print (r()) num 5 4 8.0/2.0 > 0.0625
Here ‘5’ will be printed first then it will be decremented. j = 16.0
r() // increment / decrement sum = 1.75 + 0.125 = 1.875
GATE 2019 Solved Paper CS | xxv
print (1.875)//4 T → float T.type = float

16.0/2.0 > 0.0625 X3.type = X4 type
L → L1, id
j = 32.0 add Type (id entry, X5.type)
sum = 1.875 + 0.0625 = 1.9375 L → id Add Type (id.entry, X6.type)
print (1.9375)//5
Which one of the following are the appropriate choice for
The sum get printed 5 times. X1, X2, X3¸and X4?
(A) X1 = T, X2 = L, X3 = L1, X4 =T
Question Number: 44 Question Type: MCQ (B) X1 = L, X2 = T, X3 = L1, X4 = L
Consider the following sets: (C) X1 = T, X2 = L, X3 = T, X4=L1
S1. Set of all recursively enumerable languages over the (D) X1 = L, X2 = L1, X3 = L1, X4 = T
alphabet {0, 1}
S2. Set of all syntactically valid C programs Solution: Given, inherited attributes are evaluated by bot-
tom up evaluation.
S3. Set of all languages over the alphabet {0, 1}
For production
S4. Set of all non-regular languages over the alphabet {0,
D → TL
1}
Which of the above sets are uncountable? The semantic action will be
(A) S2 and S3 (B) S1 and S2 L. type = T. type
(C) S3 and S4 (D) S1 and S4 As the L. type is decided by the T. type Similarly, L1. Type
is decided by L. type, for the production
Solution: Recursively enumerable languages are count-
able. L → L1, id
Syntactically valid C program can be represented with CFG. ∴ the values of X1, X2, X3 and X4 are
CFG generates CFL, CFL is countable. L, T, L1 and L
All languages over {0, 1} may not be countable. Hence, the correct option is (B).
Set of regular languages are countable, non-regular lan-
guages may not be countable.
Which one of the following languages over ∑ = {a, b} is
NOT context-free?
(A) {wwR |w ∈ {a, b }*}
Consider the following grammar and the semantic actions
(B) {wan bnwR | w ∈ {a, b}*, n ≥ 0}
to support the inherited type declaration attributes. Let X1,
X2, X3, X4, X5 and X6 be the placeholders for the non-ter- (C) {wan wR bn | w ∈ {a, b}*, n ≥ 0}
minals D, T, L or L1 in the following table: (D) {an bi| i ∈ {n, 3n, 5n}, n ≥ 0}
Production rule Semantic action Solution: It is not possible to draw a PDA for language
L = {wan wR bn | w ∊ {a, b}*, n ≥ 0}
D → TL X1. type = X2 type
T → int T. type = int
Digital Logic
U
Chapter 1: Number Systems
Chapter 2: Boolean Algebra and
Minimization of Functions
Chapter 3: Combinational Circuits
1.3
1.14
1.35
n
i
Chapter 4: Sequential Circuits 1.56
t
1
Another random document with
no related content on Scribd:
„Wat nu gedaan?
„Een bitje gewacht! Maar ’t en beterde niet met Mijnheer Pastor, en de

menschen wierden ongeduldig!
„De pastor kreeg een gedacht. Koster! riep hij, ’k en kan [75]ik volstrekt in
de kerke niet gaan, ge zult gij moeten de kruiskes geven.
„De koster, die zijnen pastor gewend was, verstond dat nog al wel.
„Zegt de pastor toen:
„Ge weet wat ge moet zeggen, binst dat ge de kruiskes geeft: Memento,
homo! quia pulvis es et in pulverum reverteris (Herinner, mensch! dat gij
stof zijt en in stof zult wederkeeren).
„Wat belieft er u? zei de koster.
„De pastor herhaalde ’t latijn, maar de koster en verstond het nog niet.
„Na drie of vier keeren wierd de pastor ongeduldig:
„Ge zijt ezel geboren, schreeuwde de pastor, en ge zult ezel sterven!
„Ja, Mijnheer Pastor, zei de koster, en hij trok de kerke binnen, peinzende
in zijn eigen dat ze toch aardige dingen zeggen aan de menschen in ’t
latijn.
„En hij begon maar kruiskes te geven en te herhalen dat hij schuimde:
„Ge zijt ezel geboren, en ge zult ezel sterven!
„De menschen keken wat aardig en dat wierd beklapt en besproken als zij
buiten de kerke kwamen.
„En de historie en bleef in de prochie niet; ze wierd wijd en breed

verspreid in ’t omliggende en verder, en zoo kwam het dat de lieden van
Cuerne den name van ezels kregen.
„Onverdiend!”
Hier voren (op bladzijde 70) heb ik reeds met een enkel woord
vermeld de verzen van eenen Vlaming uit den ouden tijd, waarin al
de spotnamen van Vlaamsche steden en dorpen zijn opgenoemd.
Op dat hoogst merkwaardige stuk wil ik hier nader terug komen.
In het midden der zestiende eeuw leefde te Brugge een procureur,

namens Eduwaert de Dene, Lymans zone; die „Factor” was van de
rederijkerskamer „De drie Sanctinnen” aldaar. Deze man bracht de
Vlaamsche spotnamen in rijm te zamen, en smeedde daar lange
verzen van, die hij den naam gaf van Den langhen Adieu (het lange
Vaarwel). Eduwaert de Dene stelt [76]het voor alsof hij allen
Vlamingen, de inwoners van allerlei Vlaamsche steden en dorpen,
die hij allen afzonderlijk bij hunne spotnamen noemt, vaarwel zegt,
eer hij sterven gaat. Immers zóó moet men den telkens herhaalden
slotregel der verzen verstaan: „Adieu, eer ick reyse naer Adams
moer.” Adam, de eerste mensch, was uit de aarde voortgekomen;
„Ende de H E E R E Godt hadde den mensche geformeert uyt het
stof der aerden”, zoo lezen we in den Bijbel. Dus, in
overdrachtelijken zin genomen, was de aarde de moeder van Adam.
Zoo iemand gestorven is, wordt zijn doode lichaam in de aarde
begraven. Men kan hiervan zeggen: hij reist naar (of in) de aarde;
met andere woorden: hij reist maar de moeder van Adam, naar
„Adams moer.”
De bedoelde verzen nu luiden als volgt:
Den langhen Adieu

Niet oudgestich
In tjaer ghemaect nieu
1500 ende tzestich.
Adieu, P o o r t e r s van Brugge, adieu H e e r e n van
Ghendt,
Adieu, K i n d r e n van Ipre, wijdt verre bekent,
Adieu, D a r y n c b a r n e r s van den Vryen mede,
Adieu, S c h o t t e r s van Douay, ende daer omtrent,
Adieu, S p e e r e b r e k e r s der Rysselsche stede,
N o t e c r a e c k e r s van Orchies, naer doude zede,
L e d i c h g h a n g h e r s van Oudenaerde ghepresen.
Adieu insghelijcx, oock zoo ick dandere dede,
P a s t e y e t e r s van Curtrijcke mits desen;
Adieu, C u p e r s van Damme: adieu, moet wesen,
W i t v o e t e n van Aelst, B e e n h a u w e r s van Male,
H u d e v e t t e r s van Gheerdsberghe hooghe geresen,
V o o r v e c h t e r s van Cassele int speciale,
V a c h t p l u c k e r s van Poperynghe tprincipale:
S l a e p e r s van Vuerne, hebt oock huwen toer.
R a e p e t e r s van Waes, elck end int generale,
Adieu, eer ick reyse naer Adams moer.
Adieu, van Dermonde M a c k e l e t e r s daer,

P e l s n a e y e r s van Nieneven openbaar,
D r y n c k e r s van Winnoxberghe, Z o u t z i e d e r s van
Biervliedt,
R o c h e t e r s van Muenickeree der naer.
Adieu, M o s t a e r t e t e r s die men t’ Oosthende ziet,
B u e t e r e t e r s van Dixmude en vergheet ick niet;
Adieu, metten C o n ĳ n e t e r s van Dunkercke goet; [77]
Adieu, D r a p e n i e r s van Comene, mijn jonste biedt;
Adieu, oock an de V u l d e r s van Caprijcke vroedt,
En den S c h i p g a e r n e m a e c k e r s van Oudenburgh, tmoet
Oock adieu gheseyt sijn, ken cans my bedwynghen,
C a b e l j a u e t e r s van Nieupoort, zijt oock ghegroet!
S a e y w e v e r s van Hondscote, Ghistelsche
Hovelynghen,
D r o o g h a e r t s van Werveke int ommerynghen,
C a e r d e m a e c k e r s van Deynse op heurlieder vloer;
Ghy, S a u d e n i e r s van Grevelynghe, laet hu niet
besprynghen
Adieu, eer ick reyse naar Adams moer.
Adieu oock, G r o o t s p r e k e r s van Thorout, ghy

L u e g h e n a e r s van Ardenburch, den W i l t j a g h e r s by
Van Maldeghem, C a n d e e l e t e r s van Meenen voort,
K e t e l b o e t e r s van Middelburch; adieu van my
C r u d e n i e r s van Oostburch; insghelijcx adieu (hoort!)
L ĳ n w a d i e r s van Thielt, twelck menich oorboort;
Oock mede R o o t b i e r d r y n c k e r s van Haerlebeke:
Ghy P e p e r l o o c k e t e r s van Eecloo verstoort;
K e e r m e s h o u d e r s van Ruusselare meniche weke,
C a p p o e n e t e r s van Meessene, waert nood ’tbleke
Met menich smetsere ende goet gheselle:
An de W y n z u p e r s van Hulst ick adieu spreke,
S n o u c k e t e r s van Acxele, C a e s e m a e c k e r s van
Belle,
De Te g h e l b a c k e r s van Stekene oock mede telle;
R o o m e t e r s van Moerbeke, ghy sonder poer,
Ende W a e r m o e s e t e r s van Coolkercke snelle,
Adieu, eer ick reyse naer Adams moer.
Adieu, H o p p e w i n d e r s van Okeghem sterck,

Adieu, O v e r m o e d i g h e van Ronsse int werck,
P a p e t e r s van Denterghem, daer in onverzaet,
G a n s s e d r ĳ v e r s van Laerne, scherp int bemerck;
Te Zele daer vyndt men de V l a s b o o t e r s , jaet;
Adieu, S t i e r m a n s van Wendune, elck met zijn maet.
Ende ghy, M u s s e l e t e r s van Bouchoute reyn,
V i s s c h e r s van Blanckeberghe oock adieu ontfaet;
Adieu, P u t o o r e t e r s van Waestene int pleyn,
Adieu, D i e n a e r s van Sint Anna ter Mude certeyn,
V e r z e y l d e r s van Heyst ten Zeeusschen gronde.
C o k e r m a e c k e r s van Ruurle, van V l a e t e r s tgreyn;
Die van Sint Jans Steene oock adieu tallen stonde,
C o m p o o s t e t e r s van Loo, T h o o l n a e r s van
Reppelmonde,
Adieu, Eillynghen tsaemen met den Ackerboer,
Adieu, dus namelicke Vlaandren int ronde,
Adieu, eer ick reyse naer Adams moer. [78]
Adieu, voorts noch, ende wederom oorlof, adieu,
Al dat oud was, en zichtens 14 gheworden nieu!
Ook al deze oude Vlaamsche spotnamen vertoonen weêr ten

duidelijksten de bijzondere kenmerken van zulke Nederlandsche
namen in ’t algemeen. Ook dezen zijn grootendeels meer bijnamen
in schertsenden zin, dan smaad- of hoonnamen en scheldnamen
van krenkenden aard. Zoo treffen we hier weêr de namen aan die
ontleend zijn aan allerlei nering en bedrijf in ’t bijzonder eigen aan
deze of gene plaats; b.v. H u d e v e t t e r s van Geeraartsberge en
de P e l s n a a i e r s van Ninove, de S a e y w e v e r s van
Hondschoten en de C r u d e n i e r s van Oostburg, de
K a a s m a k e r s van Belle en de S t u u r l i e d e n van Wenduine.
Verder ook de namen ontleend aan de eene of andere spijze of
lekkernij, die hier of daar bijzonder gaarne of bijzonder menigvuldig
door de lieden werd gegeten; b.v. de P a s t e i - e t e r s van Kortrijk
en de R a a p - e t e r s van Waas, de R o g - e t e r s van
Munnikereede en de K o n ĳ n - e t e r s van Duinkerke, de
K a b e l j a u w - e t e r s van Nieuwpoort en de S n o e k - e t e r s van
Aksel. Als rechtstreeksche spotnamen merken we op de
L e d i g g a n g e r s van Oudenaarden, de W i t v o e t e n van Aalst,
de V o o r v e c h t e r s van Kassel en de S l a p e r s van Veurne; de
G r o o t s p r e k e r s van Thorhout en de K e r m i s h o u d e r s van
Rousselare. Onder deze laatste soort van namen zijn er zeker velen,
die aan het een of ander geschiedkundig voorval hunnen oorsprong
te danken hebben.
Toen deze verzen berijmd werden was Vlaanderen nog in zijn

geheel, nog één en onverdeeld. Sedert is de westelijkste gouw van
Vlaanderen bij Frankrijk gevoegd, en de noordelijkste bij Noord-
Nederland. Maar Eduwaert de Dene noemt, zeer te recht zoo wel
de spotnamen op van de inwoners van Biervliet, Aardenburg,
Oostburg, Hulst, Aksel, Sint-Anna-ter-Muiden en Sint-Jans-Steen
(allen thans tot Noord-Nederland behoorende—Zeeuwsch
Vlaanderen), als die van Douay, Rijssel, Orchies, Kassei, Sint-
Winoks-Bergen, Duinkerke, Hondschoten, Grevelingen, Belle,
tegenwoordig deel uitmakende van Frankrijk—Fransch-Vlaanderen.
Ja, in één versregel vinden we de S n o e k e t e r s van [79]Aksel
vermeld naast de K a a s m a k e r s van Belle; die van Aksel zoo wel
als die van Belle zijn oorspronkelijk goede Vlamingen, maar thans,
en reeds sedert twee of drie eeuwen als Noord-Nederlanders en als
Franschen geheel van elkanderen vervreemd.
Sommigen van deze oude namen leven nog heden in den mond des
volks. De H e e r e n van Gent, de K i n d e r e n van Yperen, de
P a s t e i - e t e r s van Kortrijk, de M a k e l - e t e r s van
Dendermonde, de W i t v o e t e n van Aalst, en anderen zijn nog
heden ten dage zoo goed bekend als tijdens Eduwaert den Dene.
Daarentegen zijn de rijke en machtige P o o r t e r s van Brugge uit
de zestiende eeuw in onze negentiende eeuw tot Z o t t e n
vernederd, zijn de oude L e d i g g a n g e r s van Oudenaarde thans
B o o n e n k n o o p e r s , de H u i d e v e t t e r s van Geeraartsbergen
thans B e r g k r u i p e r s , de K a n d e e l e t e r s van Meenen thans
Ta a r t e b a k k e r s , de R o o m e t e r s van Moerbeke thans
S m e e r k o e k e t e r s (de hedendaagsche lieden van Meenen en
van Moerbeke zijn toch liefhebbers van lekkernij gebleven, zoo als
hunne oud-eeuwsche voorvaders reeds waren); de
V a c h t p l u k k e r s van Poperinge heeten thans K e i k o p p e n , de
O v e r m o e d i g e n van Ronse zijn tot Z o t t e n ,
V l i e g e n v a n g e r s en S l e k k e n t r e k k e r s geworden, en de
zestiende-eeuwsche B u e t e r - e t e r s van Diksmude thans, min
hoffelijk, tot B o t e r - k o p p e n .
Uit een taalkundig oogpunt zijn eenigen van deze namen zeer
merkwaardig; b.v. de D a r y n c b a r n e r s van ’t Land van den Vrijen
van Brugge (eene gouw in ’t Noorden van West-Vlaanderen), die in ’t
hedendaagsche Hollandsche Nederduitsch T u r f b r a n d e r s
zouden moeten genoemd worden. Darync, Darink, Daring,
hedendaags in West-Vlaanderen als dèring of derring uitgesproken,
is de oorspronkelijke vorm van ons hedendaagsch Noord-
Nederlandsche woord derrie.—Verder de H u d e v e t t e r s
(Lederbereiders) van Geeraartsbergen, de D r o o g h a e r t s
(Droogscheerders) van Werveke, de T h o o l n a e r s (Tollenaars of,
zoo als de verbasterde Hollanders zeggen, „Douanen”) van
Rupelmonde, enz.
Merkwaardig is het ook dat Eduwaert de Dene in zijne verzen

almede de „R o c h - e t e r s van Muenickeree” noemt. Muenickeree,
[80]Munnikeree (Monnikereede in hedendaagschen taalvorm) was in
de middeleeuwen een bloeiend stedeke aan het Zwin, tusschen
Sluis, Damme en Brugge in Vlaanderland. In de zestiende eeuw
verviel het plaatsje, in vervolg van tijd verviel het al meer en meer,
eindelijk ook geheel en al, en in deze negentiende eeuw verdween
het geheel van den aardbodem, om ter nauwer nood de heugenis
van zijn bestaan achter te laten. Door het verloopen, het verslijken
en verzanden, en door het inpolderen van den zeearm het Zwin is
zelfs de plaats waar Munnikereede lag niet meer nauwkeurig aan te
wijzen. Maar al is het stadje te niet gegaan, er zijn toch nog
Munnikereeders over gebleven, lieden wier voorouders te
Munnikereede woonden, lieden die dus van daar oorspronkelijk
herkomstig zijn. Een man uit Munnikereede (misschien ook wel een
geheel gezin) heeft oudtijds, om de eene of andere reden, zijne
woonplaats verlaten, en zich in Holland gevestigd, evenals in de
zestiende eeuw zoo vele andere Vlamingen met hem. Die man
noemde zich in zijne nieuwe woonplaats, ter onderscheiding van
anderen, met den als voor de hand liggenden toenaam „Van
Muenickeree” of „Van Munnikeree” of „Van Munnikreede” (de spelling
van den naam doet er niet toe). En eene maagschap van dien naam,
te weten: „v a n M u n n e k r e d e ”, ’s mans nakomelingschap,
bestaat nog heden, en komt of kwam nog in de laatste helft dezer
eeuw voor te Delft, Rotterdam, Haarlem, Heemskerk. De
geslachtsnaam heeft dus in dit geval den plaatsnaam, de oud-
ingezetene van Munnikereede heeft, in zijne nakomelingen, het
stedeke zelf overleefd. En zelfs de spotnaam waarmede de oude
Munnikereeders in de middeleeuwen door andere Vlamingen
werden genoemd, is ons nog overgeleverd geworden en bewaard
gebleven.
Daar zijn nog oudere Vlaamsche spotnamen bekend, dan dezen van
1560. In de Anzeiger für Kunde der Teutschen Vorzeit, jaargang
1835, bladzijde 299 vindt men een lijstje van die namen
medegedeeld, ’t welk volgens de meening van sommige geleerden
tusschen de jaren 1347 en 1414 moet zijn opgesteld. Deze
middeleeuwsche spotnamen zijn in hoofdzaak de zelfden als die
men in „den langhen Adieu” vindt opgesomd. Sommigen echter
wijken in meerdere of mindere mate af van de namen in dat [81]rijm
voorkomende. Zoo heeten in dit middeleeuwsche lijstje de
ingezetenen van Poperingen V a c h t p l o t e r s , terwijl Eduwaert
de Dene ze V a c h t p l u c k e r s noemt; die van Meenen
P e l s m a k e r s , tegenover de C a n d e e l e t e r s van de Dene; die
van Werveke V e r w a t e n l i e d e n , tegenover de
D r o o g h a e r t s van de Dene; die van Deinse G a r e n c o e p e r s
tegenover de C a e r d e m a e c k e r s van de Dene. En er worden in
het oude lijstje ook eenigen genoemd, die de Dene niet heeft; bij
voorbeeld de W a f e l e t e r s van Bethune, de U t r e c h t s c h e
V l a m i n g e n van de Vier-Ambachten, de P l a t t e G e s e l l e n
van Sleedingen (hedendaags Sleidinge), de D a n s e r s van
Everghem, de S c i p h e e r e n van der Sluus, de T u u s c h e r s van
Theemsche (hedendaags Temseke), en anderen.
Ook in dit lijstje vinden de taalgeleerde en de geschiedkundige veel

van hunne gading, ter verklaring; zoo als de T u u s c h e r s (Ruilers,
in ’t hedendaagsche Friesch nog túskers, tyskers) van Temseke en
de S c i p h e e r e n van der Sluus. Deze laatste naam dagteekent uit
den middeleeuwschen tijd, toen het hedendaagsche stille en
vervallene stedeke Sluis, thans tot het Zeeuwsche deel van
Vlaanderen, dus tot Noord-Nederland behoorende, eene bloeiende
Vlaamsche handelsstad was, de mededingster van het naburige
Brugge. Vele rijke reeders (S c i p h e e r e n ) woonden toen daar.
En dan de U t r e c h t s e V l a m i n g e n van de Vier-Ambachten, die

nog herinneren aan den overouden tijd toen de noordelijkste gouw
van Vlaanderland, in de middeleeuwen de Vier-Ambachten
genoemd, en thans Zeeuwsch-Vlaanderen, soms ook nog Staatsch-
Vlaanderen geheeten, in het kerkelijke niet tot een Vlaamsch bisdom
(Gent of Brugge) behoorden, maar tot het aartsbisdom van Utrecht.
In deze gouw toch was de bevolking in de vroege middeleeuwen
hoofdzakelijk van Frieschen bloede, en de Friezen bewesten
Lauwers en bewesten Flie behoorden, sedert ze Christenen waren,
tot dat aartsbisdom. Van daar dat de Vlamingen van Hulst en Aksel,
van Biervliet en Aardenburg hier U t r e c h t s c h e V l a m i n g e n
worden geheeten. Men zie over deze zaak mijn werk Oud
Nederland, de aanteekeningen op bladzijden 109 en 110.
De ingezetenen van Duinkerke worden in den Langhen Adieu [82]en
eveneens in dit oude lijstje C o n y n e t e r s genoemd, en deze naam
is voor lieden die midden in het duin, midden in die meest geliefde
verblijfplaats der konijnen wonen, en die aan die ligging in de duinen
zelfs den naam hunner stad ontleend hebben, zeker zeer
eigenaardig en gepast. Ik zelf echter, eenige jaren geleden een en
ander maal te Duinkerke vertoevende, en daar den luiden vragende
naar hunnen spotnaam, en naar die van andere Fransch-Vlamingen,
kreeg telkens ten antwoord: K e u n e t e r s van Duunkerke. 15 Hieruit
blijkt dat keun de Vlaamsche benaming is van konijn; en in der daad
vinden we ook in De Bo’s Westvlaamsch Idioticon het woord keun
voor konijn aangegeven. De ingezetenen van het dorp Heist op Zee,
bij Brugge, en dat ook midden in het duin aan zee gelegen is (als
Zandvoort), dragen heden ten dage almede den spotnaam van
K e u n s (Konijnen). Door onze taalgeleerden wordt ons
hedendaagsch algemeen Nederlandsch woord konijn voorgesteld
als afgeleid of herkomstig van het Latijnsche woord cuniculus. Het is
toch opmerkelijk, ja, het komt mij zonderling voor, zelfs ongelooflijk,
dat zulk een algemeen bekend inlandsch dier als het konijn is, dat bij
duizendtallen in onze zeeduinen, en ook binnen ’s lands op
heidevelden en in woeste, zandige streken leeft, niet eenen
oorspronkelijk Nederlandschen, oorspronkelijk Dietschen, niet eenen
echt Germaanschen naam zoude hebben. Is misschien dit
Westvlaamsche keun de eigenlijke, de oorspronkelijk Dietsche naam
van het konijn? En moet men ons hedendaagsch woord konijn dan
als een oude verkleinvorm van keun (koon, kone) beschouwen?
Heeft ons woord konijn dan misschien niets met het Latijnsche
woord cuniculus te maken? En hebben dan, juist andersom, de
Romeinen hun woord cuniculus misschien afgeleid van ons woord
keun? Allemaal vragen, die ik niet beantwoorden kan, maar die den
taalvorscher zeker belangstelling zullen inboezemen. [83]
De ingezetenen van sommige gewesten, landstreken en eilanden in
hun geheel, ja sommige volken hebben ook wel hunne spotnamen.
Ook hierop wil ik nog kortelijk wijzen. Zoo heeten de Friezen
S t ĳ f k o p p e n , Noord-Bevelanders bij de andere Zeeuwen
P e e v r e t e r s , en de Zuid-Bevelanders P a d d e l a n d e r s .
(Peeën, dat is Zeeuwsch voor wortelen—de gewone als spijs
gebruikte wortelen van Daucus carota, en beetwortelen). De
opgezetenen van ’t eiland Walcheren in ’t bijzonder, op welk eiland,
naar men zegt, geen kikvorschen en geen padden voorkomen,
noemen dus het eiland Zuid-Beveland, waar deze amphibiën wel
gevonden worden, smadelijk ’t P a d d e l a n d . Die van Texel heeten
K w a l l e n , en die van Wieringen S k e p e n (Schapen), ’t is op bl.
62 en 63 reeds vermeld.
De Engelschman J o h n B u l l , de Franschman J e a n
P o t a g e e n zijn wijf M a r i a n n e , J a n t j e - K a a s de Hollander
(door Vlamingen en Brabanders zoo genoemd) en de Duitsche
M i c h e l of H a n s - M i c h e l zijn overbekend. Overbekend is ook in
onze dagen de spotnaam R o o i n e k en R o o i b a a i t j i e , dien
onze Zuid-Afrikaansche stamgenooten den Engelschman geven. De
Hollanders in ’t bijzonder hebben ook nog eenen bijzonderen
spotnaam voor den Duitscher, dien ze M o f noemen. Naar den
oorsprong van dezen naam is door velen vruchteloos gezocht.
Opmerkelijk is het dat de Duitschers, die langs onze oostelijke
grenzen wonen, dien spotnaam M o f (zij zeggen M u f ) wederkeerig
op de Nederlanders toepassen, en ons H o l l a n d e r - M u f
noemen; zie Ten Doornkaat Koolman, Wörterbuch der
Ostfriesischen Sprache, waar almede eene verklaring van dit woord
Muf of Mof te vinden is. De Nederlanders noemen geheel
Duitschland wel M o f f r i k a , maar de Duitschers zelven geven dien
naam M u f f r i k a in ’t bijzonder aan eene kleine gouw, langs onze
grenzen zich uitstrekkende, aan het zoogenoemde Nedersticht van
Munster, tusschen Oost-Friesland en Bentheim gelegen, en de
stadjes Meppen en Lingen met omstreken omvattende.
De Friezen hebben nog eenen bijzonderen spotnaam voor de

Duitschers in ’t algemeen; zij noemen dezen P o e p e n . Dit woord
poep is een bijzonder, een raadselachtig woord. Dat het niet het
woord poep is, in de gewone algemeen Nederlandsche volks- vooral
kinderspreektaal van bekende beteekenis, blijkt hieruit dat de
Friezen beide woorden nauwkeurig in uitspraak onderscheiden.
[84]Zij, met hun fijn en nauwkeurig onderscheidend taalgehoor,
spreken in den spotnaam P o e p dit woord uit met den zeer duidelijk
hoorbaren t w e e klank oe; terwijl ze, waar dit woord de andere
beteekenis heeft, slechts eenen enkelvoudigen klank laten hooren,
de u der Duitschers, de ou der Franschen. Uit nauwkeurige, en
steeds strikt volgehoudene onderscheid in uitspraak tusschen den
enkelvoudigen en den twee-klank oe, dat zoowel den Friezen als
den West- en Zee-Vlamingen thans nog bijzonder eigen is, maar
oudtijds algemeen Dietsch moet geweest zijn, verbiedt om aan te
nemen dat dit woord poep in beide beteekenissen van een en den
zelfden oorsprong zoude zijn. Maar wat het woord poep als
spotnaam dan wel zijn mag, van oorsprongswegen, het is mij niet
gelukt dit uit te vorschen.
De Friezen geven den naam P o e p wel aan de Duitschers in het

algemeen, maar in ’t bijzonder aan den Westfaalschen grasmaaier
en aan den Westfaalschen koopman in kleedingstoffen en
kleedingstukken, die met een groot pak van zijn koopwaar op den
rug, het Friesche platteland afreist, en die, ter onderscheiding van
zijnen landsman den grasmaaier, door de Friezen
F y n d o e k s p o e p genoemd wordt.
Overdrachtelijk noemt men in de Friesche gewesten (immers

Groningerland doet hierin mede, volgens Molema’s Woordenboek
der Groningsche volkstaal) een paard of eene koe van Duitsch,
gewoonlijk Oldenburgsch, zoogenoemd Bovenlandsch ras, ook
p o e p ; en zelfs eene bijzondere soort van aardappelen, ook van
Duitsche herkomst, en die anders wel „Munsterlanders” heeten,
noemt de Friesche boer p o e p e n . Ja, onze Friesche zeeman geeft
zelfs aan een schip (kof of tjalk), dat in Oost-Friesche en Weser-
Friesche havens thuis behoort, en dit door geringe afwijkingen in
bouw en tuig bemerkbaar doet zijn, den naam van p o e p .
Ook in noordelijk Noord-Holland, almede oorspronkelijk eene

Friesche gouw, is de spotnaam P o e p , G r a s p o e p , G r o e n e
P o e p voor den Duitschen Grasmaaier in gebruik, volgens Dr. G. J.
Boekenoogen’s werk De Zaansche Volkstaal, en volgens J.
Bouman’s werk De Volkstaal in Noord-Holland.
De echte Friezen in ’t land tusschen Flie en Lauwers beperken

hunnen spotnaam P o e p niet enkel tot de Duitschers. Ook de
Groningerlanders en de Drenten noemen ze P o e p e n , en [85]zelfs
de ingezetenen van de Friesche dorpen Kollum en Burum (in
uitspraak Boerum), die, ofschoon nog bewesten Lauwers wonende,
toch niet de zuivere Friesche taal spreken, maar eenen gemengden
tongval, een overgang van het Stad-Friesch tot het
Groningerlandsch—zelfs dezen moeten zich den spotnaam
P o e p e n laten welgevallen, alsof ze, door hunnen afwijkenden
tongval, reeds halve Groningerlanders, en alsof de
Groningerlanders, met hun Friso-Sassisch bloed en met hunne
Friso-Sassische gouwspraak reeds halve Duitschers waren.
Opmerkelijk is het, dat men dit woord P o e p als spotnaam ook hier
en daar elders in de Nederlanden terug vindt. De ingezetenen van
Deventer toch dragen bij de andere Overijsselaars en bij de
Gelderschen in hunne nabuurschap ook dezen naam. En ook de
Zeeuwen noemen hunne Vlaamsche en Brabantsche naburen
P o e p e n . Zoo hoorde ik in 1869 door een paar burgers van Goes
zeggen, van een gezelschap boeren en boerinnen uit de polders van
Zandvliet bij Antwerpen, die door ’t stadje Goes ronddwaalden: „’t
zijn maar P o e p e n ,” eenigszins minachtender wijze, juist zoo als
de Friezen spreken van de Duitschers. Volgens van Dale (zelf een
Zeeuwsche Vlaming), Nieuw Woordenboek der Nederlandsche taal,
is p o e p een scheldnaam dien de bewoners van Zuid-Beveland aan
de bewoners van Zeeuwsch-Vlaanderen geven. En volgens De Bo’s
Westvlaamsch Idioticon noemt men in West-Vlaanderen „iemand die
weinig verstand of weinig moed heeft,” een „dwazerik” dus, of een
„lafaard”, een „p o e p g a a i .”
De oorsprong en de verspreiding van dezen raadselachtigen

spotnaam P o e p uit te vorschen, zal zeker wel de moeite loonen.
Als eene bijzondere uiting van volkseigenaard en van speelsch

volksvernuft, dienen ten slotte nog vermeld te worden eenige
rijmkes, die van sommige gouwen en eilanden, van sommige steden
en dorpen, ook van groepen van nabij elkanderen gelegene
plaatsen, bij het volk bekend zijn, en die als ter kenschetsing dienen
van sommige bijzonderheden, aan die gouwen en plaatsen eigen.
Deze rijmkes zijn uit de zelfde bron gevloeid, waaruit ook de
spotnamen ontstaan zijn; zij komen er in aard en strekking,
veelvuldig ook in oorsprong en in eigenaardig wezen mede overeen,
ja, zijn eigenlijk slechts als eene uitbreiding [86]daarvan te
beschouwen. Ik wil slechts enkele van die rijmkes hier mededeelen,
om de aandacht daarop te vestigen van navorschers, van allen die
belang stellen in volkseigene zaken, en die zulke zaken nog in tijds
behouden willen, eer de nieuwe tijd ze uit het geheugen der
menschen zal hebben doen verdwijnen.
Over al de Nederlanden zijn deze rijmkes verspreid, en, even als de
spotnamen, ook over Oost-Friesland en andere nabij gelegene
gouwen van naburige landen, waar de bevolking met die van onze
eigene gewesten zoo menig punt van overeenkomst heeft, of
daarmede oorspronkelijk eenzelvig is. Een enkel van die
Oostfriesche rijmkes, de stad Aurik betreffende, is reeds op bladzijde
58 hiervoren medegedeeld. Anderen uit de Friesche gewesten
beoosten Eems kan men vinden in Kern en Willms, Ostfriesland
wie es denkt und spricht (Norden, 1869). Een paar rijmkes van ’t
Ameland vindt men op bladzijden 27 en 28 hiervoren vermeld. Een
paar andere uit Friesland zijn nog:
Oostergoo het land,

Westergoo het geld.
De Wouden het verstand,
De Steden het geweld.
Hier wordt op geestige wijze het kenmerkende van de drie gouwen,

Oostergoo, Westergoo en de Zevenwouden, waarin Friesland
tusschen Flie en Lauwers van ouds her verdeeld is, met de elf
steden, uiteengezet.
Dokkum is een oude stad,

Een oude stad boven maten;
Daar verkoopt men anders niet
Als taai en ook garnaten.
In der daad, de stad Dokkum dagteekent reeds uit zeer ouden tijd;
reeds ten jare 754 verkondigde Sint-Bonifacius daar het Evangelie.
Het Dokkumer taai, eene soort van grof Sint-Nicolaasgebak, is in
geheel Friesland vermaard. En wat de Dokkumer garnaten
(garnalen) aangaat, daar moet men maar niet te luide van spreken,
als er Dokkumers bij zijn (zie bladzijde 21 en vervolgens). [87]
Zeer aardig kenschetsend zijn deze twee rijmkes, van een
Utrechtsch en van een Noordbrabantsch dorp:
Neêr-Langbroek,
Die schrale hoek!
Daar wonen niets dan edellui
En bedellui,
Ridders
En broodbidders;
Daar staan anders niet als kasteelen en nesten,
Sterkenburg is het beste.
Loon-op-Zand,
Licht volk, licht land;
Ze schooien den kost.
En ze stelen den brand. 16
Tamelijk onbeduidend daarentegen is het volgende rijmke van drie

Zeeuwsch-Vlaamsche dorpen Breskens, Schoondijke en de Groede:
De Bressianen
Zijn hanen,
Maar voor Schoondijke
Moeten ze wijken,
En komen die van de Groe,
Dan houden ze beter hun deuren maar toe!
Veelal heerscht in deze rijmkes een schimpende, smalende toon

tegenover andere naburige plaatsen, afgewisseld met lof voor de
eigene woonplaats. Bij voorbeeld uit Drente:
Koevorden is een fraaie stad,

Dalen is een moddergat,
Wachtum is een eendepoel,
Hesselen is een koningsstoel.
Of uit Overijssel en Gelderland:
Deventer is een koopstad,

Zutfen is een loopstad,
Lochem is nog wat,
Maar Borkeloo is een hondegat.
[88]
Van groote ingenomenheid met zich zelven getuigt het volgende rijm
van sommige Noordhollandsche steden, dat bij de
Monnikendammers in zwang is:
Amsterdam ligt aan het IJ,

Monnikendam daar wonen wij;
Edam is een nest,
Hoorn doet zijn best,
Enkhuizen staat op tonnen.
Medemblik heeft het gewonnen.
Aardig is het rijmke van Kootwijk, een zeer nederig dorpke op de

Veluwe:
Kootwijk is een zoetendal,

En die er is die blijft er al.
Zoetendal, ten Sueten dale—dat klinkt zoo middeleeuwsch liefelijk!

Wie weet hoe oud dit rijm al is!
Ten slotte kan ik nog een zeer bijzonder rijm hier mede deelen, dat
betrekking heeft op de Friesche eilandenreeks die zich uitstrekt
tusschen de Weser en het Marsdiep, en dat door mij is
opgeschreven uit den mond van eenen Frieschen schipperszoon,
die met de tjalk van zijnen vader wel oostwaarts naar Emden,
Bremen en Hamburg, en wel zuidwaarts naar Amsterdam,
Rotterdam, Dordrecht en Antwerpen voer. Het rijm is niet in de
eigenlijke Friesche taal opgesteld, maar in het zoogenoemde Stad-
Friesch of „Stêdsk”, dat is Oud-Dietsch met Friesche woorden en
woordvormen vermengd, en met eenen Frieschen mond
uitgesproken.
Wrangero de skoone,
Spikeroog de krone,
Langeroog is ’n butterfat
En Baltrum is ’n sangat.
En de Norderneyers frete har mar half sat
Juust dat is ’n rooverland;
En Borkum is ’n tooverland;
Rottumeroog is ’n klein land,
Mar Skiermonnikoog is sterk bemand:
De Amelander skalken
Hewwe stolen drie balken,
Avons in ’e maneskijn,
Daarom sal ’t har wapen sijn. [89]
Skilingen het ’n hooge toren,
Flielan het siin naam ferloren,
Tessel is mar ’n seegat,
De Helderse T r a a n b o k k e n segge dat.
Eenige opmerkingen mogen dit rijm nader toelichten.
Wrangero (ook de visscherlieden van Urk, die ter uitoefening van

hun bedrijf op de Noordzee wel tot bij dit eiland komen, spreken
dezen naam nog op deze Oud-Friesche wijze uit)—Wrangero is een
oude en zeer goede, oorspronkelijk Friesche naamsvorm, ouder en
beter dan Wangeroog of Wangerooge, zoo als dit eiland thans in ’t
geijkte Nederlandsch en Hoogduitsch heet. Oudtijds woonde aan
den vasten wal, aan de Noordzeekust waar dit eiland tegenover ligt,
westelijk van den Wesermond, een Friesche volksstam, Wranger-
Friezen genoemd. (Hunne rechtstreeksche nakomelingen wonen
daar nog heden in het thans zoo genoemde Jeverland en
Butjadingerland). Toenmaals noemde men het land dier Wranger-
Friezen Wrangerland, en het eiland daarnevens in de Noordzee:
Wrangero, Wranger-o. De woordvormen o, oe (eu) ei (in ons woord
eiland nog bestaande en in den eilandsnaam Nordernei eveneens)
zijn oorspronkelijk eenzelvig met het hedendaagsche oog, in
Süderoog (Noord-Friesland), Wangeroog, (Weser-Friesland),
Langeroog (Oost-Friesland), Schiermonnikoog (Friesland tusschen
Flie en Lauwers), Valkoog (West-Friesland of Noord-Holland), enz.
Skilingen is de Friesche naamsvorm voor ’t eiland ter Schelling,

beter Schellingerland, dat in het dorp Wester-Schelling in der daad
eenen zeer hoogen toren heeft, de vuurtoren of Brandaris, die het
geheele zeegat van ’t Flie verlicht.
Flieland heeft althans voor de helft zijnen naam verloren. De

westelijke helft van dit eiland, met het aldaar gelegene dorp West-
Flieland is in de 17de eeuw ten deele, maar in de vorige eeuw
volkomen door de zee vernield en weggeslagen. Er is daar nog maar
eene zandplaat van over, die nu de Hors heet. Inderdaad, „Flieland
heeft zijn naam verloren.”
Dit is het einde van mijn opstel over spotnamen, spotrijmen, enz.
Mogen anderen hierin aanleiding vinden dit belangrijke onderwerp
nog eens beter en uitvoeriger te behandelen. [90]
[Inhoud]
BRONNEN EN LITTERATUUR OVER

SPOTNAMEN, ENZ.
Het tijdschrift De Navorscher (Amsterdam, 1851 en vervolgens), in

verschillende jaargangen. Men zie de Algemeene Registers, op
„Namen (Nederlandsche Spot- en Scheldnamen).”
Ons Volksleven. Tijdschrift voor taal-, volks- en oudheidkunde, onder

leiding van Jos. Cornelissen en J. B. Vervliet. Brecht (bij
Braeckmans, 1889 en vervolgens) in verschillende jaargangen.
A. Mertens, Iets over de spotnamen onzer Belgische steden.

Antwerpen, 1847.
Friesland en de Friezen (Plaatselijke schimpnamen). Leeuwarden,

1877.
Dr. E. Laurillard, Vlechtwerk. Amsterdam, 1880. Idem,

Sprokkelhout. Amsterdam, 1887. Idem, Op uw’ stoel door uw land.
Amsterdam, 1891. [91]
1 Vermoedelijk komen soortgelijke spotnamen als de Nederlandsche, wel in alle

landen en bij alle volken voor. Eenigen van die namen uit Duitschland vindt men
vermeld in het Korrespondenzblatt des Vereins für Niederdeutsche
Sprachforschung, VIII, 47; en anderen uit Frankrijk in De Navorscher, XV, 318. En
wat Engeland aan gaat, de spotnaam van de Londenaars, Cockneys, is daar
algemeen bekend. ↑
2 De Dokkumer kleermaker spreekt hier natuurlijk ook de dagelijksche spreektaal
van Dokkum—dat is: gewoon stad-Friesch, met enkele bijzonderheden. Bij
voorbeeld: Luwarden en sil, waar de Leeuwarders Leewarden en sal zeggen. Ook
brengt de Dokkumer tongval meê, dat de lange a eenigermate naar den aai klank
zweemende wordt uitgesproken. Van daar dat andere Friesche stedelingen de

PDF Gate 2020 Computer Science and Information Technology 8Th Edition Trishna Knowledge Systems Ebook Full Chapter

Uploaded by

Copyright:

Available Formats

You might also like

PDF Gate 2020 Computer Science and Information Technology 8Th Edition Trishna Knowledge Systems Ebook Full Chapter

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

PDF Gate 2020 Computer Science and Information Technology 8Th Edition Trishna Knowledge Systems Ebook Full Chapter

Uploaded by

Copyright:

Available Formats

GATE 2020 Computer Science and

Information Technology 8th Edition

Systems Analysis and Synthesis Bridging Computer

Chemistry (Class 9) 3rd Edition Trishna Knowledge

Chemistry Class 10 6th Edition Trishna Knowledge

Physics (Class 9) 2nd Edition Trishna Knowledge Systems

Pearson IIT Foundation Series Chemistry Class 7 6th

Pearson IIT Foundation Series Chemistry Class 8 7th

Pearson IIT Foundation Series Chemistry Class 9 6th

Pearson IIT Foundation Series - Chemistry Class 9 7th

WHAT THE FACULTIES SAY ABOUT THIS BOOK...

Trishna Knowledge Systems

Published by Pearson India Education Services Pvt. Ltd, CIN: U72200TN2005PTC057128.

UNIT 1 Digital Logic 1.1

UNIT II Computer Organization and Architecture 2.1

UNIT III Programming and Data Structures 3.1

Chapter 2 Sorting Algorithms 3.98

Chapter 3 Divide-and-conquer 3.107

Chapter 4 Greedy Approach 3.116

Chapter 5 Dynamic Programming 3.135

UNIT 1V Databases 4.1

Chapter 2 Structured Query Language 4.21

Chapter 3 Normalization 4.49

Chapter 4 Transaction and Concurrency 4.65

Chapter 5 File Management 4.82

UNIT V Theory of Computation 5.1

Chapter 2 Context Free Languages and Push Down Automata 5.24

Chapter 3 Recursively Enumerable Sets and Turing Machines, Decidability 5.37

UNIT V1 Compiler Design 6.1

Chapter 2 Syntax Directed Translation 6.27

Chapter 3 Intermediate Code Generation 6.36

Chapter 4 Code Optimization 6.56

UNIT VII Operating System 7.1

Chapter 2 Interprocess Communication, Concurrency and Synchronization  7.17

Chapter 3 Deadlock and CPU Scheduling 7.35

Chapter 4 Memory Management and Virtual Memory 7.54

Chapter 5 File Systems, I/O Systems, Protection and Security 7.74

UNIT VIII Networks, Information Systems, Software

Part B Information Systems

Part C Software Engineering and Web Technology

—Trishna Knowledge Systems

BCD addition Excess-3 (XS-3) code

DiGital CirCuits 0111 0110 . 1001 Example

of r that satisfy thenumbers equation Example 49: Convert = 1(1001)

BExample 2: (332)10 →(B) 3 × 102 + 3 × 10 + 2 × 100 01 0 ×significant

previous Years’ Questions Previous Years’

5. The output should be high when at least two outputs 2. Which

Section Weightage and Marks

About Online Pattern

Important Tips for GATE

Number of Questions: 46 Total Marks: 67

Hence, the correct answer is (29). x = jumble (y, x);

y gets updated jumble

Question Number: 11 Question Type: NAT P1 P2 P3

X2 Y2 Z2 X1 Y1 6 Y2 V3 Solution: Y = PR and Z = QRS

3007 Then there is no prime number w in S1 such that w > x

Gannt chart (A) ∑ (0, 2, 3, 5, 6, 7, 8, 11, 14, 15)

Question Number: 37 Question Type: MCQ Solution:

UNIT 1 Digital Logic 1.1

UNIT II Computer Organization and Architecture 2.1

UNIT III Programming and Data Structures 3.1

Chapter 2 Sorting Algorithms 3.98

Chapter 3 Divide-and-conquer 3.107

Chapter 4 Greedy Approach 3.116

Chapter 5 Dynamic Programming 3.135

UNIT 1V Databases 4.1

Chapter 2 Structured Query Language 4.21

Chapter 3 Normalization 4.49

Chapter 4 Transaction and Concurrency 4.65

Chapter 5 File Management 4.82

UNIT V Theory of Computation 5.1

Chapter 2 Context Free Languages and Push Down Automata 5.24

Chapter 3 Recursively Enumerable Sets and Turing Machines, Decidability 5.37

UNIT V1 Compiler Design 6.1

Chapter 2 Syntax Directed Translation 6.27

Chapter 3 Intermediate Code Generation 6.36

Chapter 4 Code Optimization 6.56

UNIT VII Operating System 7.1

Chapter 2 Interprocess Communication, Concurrency and Synchronization 7.17

Chapter 3 Deadlock and CPU Scheduling 7.35

Chapter 4 Memory Management and Virtual Memory 7.54

Chapter 5 File Systems, I/O Systems, Protection and Security 7.74

UNIT VIII Networks, Information Systems, Software

Number of Questions: 46 Total Marks: 67

Question Number: 11 Question Type: NAT P1 P2 P3

Question Number: 37 Question Type: MCQ Solution:

II. The second largest element in a max-heap is always a