Computer Science Engineering (CSE) Exam > Computer Science Engineering (CSE) Questions > Which of the following is/are not true?a)Most...
Start Learning for Free
Which of the following is/are not true?
- a)Most frequent operation on symbol table is insert operation.
- b)Symbol table data is filled by the lexical analyzer and syntax analyzer.
- c)Efficient implementation of symbol table among, an ordered list, unordered list, and binary search tree is ordered list.
- d)None of these
Correct answer is option 'A,C'. Can you explain this answer?
| FREE This question is part of | Download PDF Attempt this Test |
Most Upvoted Answer
Which of the following is/are not true?a)Most frequent operation on sy...
Option (A): Most frequent operation on the symbol table is insert operation.
This is not a true statement. Since the most frequent operation on the symbol table is the lookup operation.
Option (B): Symbol table data is filled by the lexical analyzer and syntax analyzer.
This is a true statement since symbol table data is filled by the lexical analyzer and syntax analyzer.
Option (C): Efficient implementation of symbol table among, an ordered list, unordered list, and binary search tree is ordered list.
This is not a true statement since the efficient implementation of a symbol table among, an ordered list (insert - O(n), lookup- O(log n)), unordered list (insert -O(1), look up - O(n)), and binary search tree (insert-O(log n), lookup - O(log n)) is a binary search tree.
Hence, the correct options are (A) and (C).
Free Test
FREE
| Start Free Test |
Community Answer
Which of the following is/are not true?a)Most frequent operation on sy...
Heading: Understanding the statements
To determine the correct answer, let's analyze each statement one by one and understand whether it is true or not.
Statement a) Most frequent operation on symbol table is insert operation
The statement is true. In a symbol table, the most frequent operation is the insertion of new symbols or identifiers. This is because as a program is being parsed or compiled, new symbols are encountered, and they need to be added to the symbol table for future reference. Other operations like searching, updating, and deleting are also performed on the symbol table but not as frequently as insertion.
Statement b) Symbol table data is filled by the lexical analyzer and syntax analyzer
The statement is true. The lexical analyzer and the syntax analyzer are responsible for generating the symbol table during the compilation process. The lexical analyzer scans the source code and breaks it into tokens, identifying the symbols and their corresponding lexemes. The syntax analyzer then uses these tokens to build the parse tree and perform syntactic analysis. During this process, the symbol table is populated with the necessary information about the symbols, such as their names, types, scope, and memory locations.
Statement c) Efficient implementation of symbol table among, an ordered list, unordered list, and binary search tree is ordered list
The statement is false. An ordered list is not the most efficient implementation of a symbol table. The most efficient implementation is a binary search tree (BST). A binary search tree allows for efficient searching, insertion, deletion, and traversal operations. In a BST, the symbols are stored in a sorted order based on their keys, which allows for faster search operations using the binary search algorithm. On the other hand, an ordered list requires linear search for each operation, resulting in slower performance compared to a binary search tree.
Statement d) None of these
The statement is false. As explained above, statements a) and c) are not true, so the correct answer cannot be "None of these." The correct answer is indeed option 'A,C', as stated.
Summary:
- The most frequent operation on a symbol table is the insert operation.
- The symbol table data is filled by the lexical analyzer and syntax analyzer.
- An ordered list is not the most efficient implementation of a symbol table; a binary search tree is more efficient.
To determine the correct answer, let's analyze each statement one by one and understand whether it is true or not.
Statement a) Most frequent operation on symbol table is insert operation
The statement is true. In a symbol table, the most frequent operation is the insertion of new symbols or identifiers. This is because as a program is being parsed or compiled, new symbols are encountered, and they need to be added to the symbol table for future reference. Other operations like searching, updating, and deleting are also performed on the symbol table but not as frequently as insertion.
Statement b) Symbol table data is filled by the lexical analyzer and syntax analyzer
The statement is true. The lexical analyzer and the syntax analyzer are responsible for generating the symbol table during the compilation process. The lexical analyzer scans the source code and breaks it into tokens, identifying the symbols and their corresponding lexemes. The syntax analyzer then uses these tokens to build the parse tree and perform syntactic analysis. During this process, the symbol table is populated with the necessary information about the symbols, such as their names, types, scope, and memory locations.
Statement c) Efficient implementation of symbol table among, an ordered list, unordered list, and binary search tree is ordered list
The statement is false. An ordered list is not the most efficient implementation of a symbol table. The most efficient implementation is a binary search tree (BST). A binary search tree allows for efficient searching, insertion, deletion, and traversal operations. In a BST, the symbols are stored in a sorted order based on their keys, which allows for faster search operations using the binary search algorithm. On the other hand, an ordered list requires linear search for each operation, resulting in slower performance compared to a binary search tree.
Statement d) None of these
The statement is false. As explained above, statements a) and c) are not true, so the correct answer cannot be "None of these." The correct answer is indeed option 'A,C', as stated.
Summary:
- The most frequent operation on a symbol table is the insert operation.
- The symbol table data is filled by the lexical analyzer and syntax analyzer.
- An ordered list is not the most efficient implementation of a symbol table; a binary search tree is more efficient.
Attention Computer Science Engineering (CSE) Students!
To make sure you are not studying endlessly, EduRev has designed Computer Science Engineering (CSE) study material, with Structured Courses, Videos, & Test Series. Plus get personalized analysis, doubt solving and improvement plans to achieve a great score in Computer Science Engineering (CSE).
|
Explore Courses for Computer Science Engineering (CSE) exam
|
|
Similar Computer Science Engineering (CSE) Doubts
Top Courses for Computer Science Engineering (CSE)View all
Which of the following is/are not true?a)Most frequent operation on symbol table is insert operation.b)Symbol table data is filled by the lexical analyzer and syntax analyzer.c)Efficient implementation of symbol table among, an ordered list, unordered list, and binary search tree is ordered list.d)None of theseCorrect answer is option 'A,C'. Can you explain this answer?
Question Description
Which of the following is/are not true?a)Most frequent operation on symbol table is insert operation.b)Symbol table data is filled by the lexical analyzer and syntax analyzer.c)Efficient implementation of symbol table among, an ordered list, unordered list, and binary search tree is ordered list.d)None of theseCorrect answer is option 'A,C'. Can you explain this answer? for Computer Science Engineering (CSE) 2024 is part of Computer Science Engineering (CSE) preparation. The Question and answers have been prepared according to the Computer Science Engineering (CSE) exam syllabus. Information about Which of the following is/are not true?a)Most frequent operation on symbol table is insert operation.b)Symbol table data is filled by the lexical analyzer and syntax analyzer.c)Efficient implementation of symbol table among, an ordered list, unordered list, and binary search tree is ordered list.d)None of theseCorrect answer is option 'A,C'. Can you explain this answer? covers all topics & solutions for Computer Science Engineering (CSE) 2024 Exam. Find important definitions, questions, meanings, examples, exercises and tests below for Which of the following is/are not true?a)Most frequent operation on symbol table is insert operation.b)Symbol table data is filled by the lexical analyzer and syntax analyzer.c)Efficient implementation of symbol table among, an ordered list, unordered list, and binary search tree is ordered list.d)None of theseCorrect answer is option 'A,C'. Can you explain this answer?.
Which of the following is/are not true?a)Most frequent operation on symbol table is insert operation.b)Symbol table data is filled by the lexical analyzer and syntax analyzer.c)Efficient implementation of symbol table among, an ordered list, unordered list, and binary search tree is ordered list.d)None of theseCorrect answer is option 'A,C'. Can you explain this answer? for Computer Science Engineering (CSE) 2024 is part of Computer Science Engineering (CSE) preparation. The Question and answers have been prepared according to the Computer Science Engineering (CSE) exam syllabus. Information about Which of the following is/are not true?a)Most frequent operation on symbol table is insert operation.b)Symbol table data is filled by the lexical analyzer and syntax analyzer.c)Efficient implementation of symbol table among, an ordered list, unordered list, and binary search tree is ordered list.d)None of theseCorrect answer is option 'A,C'. Can you explain this answer? covers all topics & solutions for Computer Science Engineering (CSE) 2024 Exam. Find important definitions, questions, meanings, examples, exercises and tests below for Which of the following is/are not true?a)Most frequent operation on symbol table is insert operation.b)Symbol table data is filled by the lexical analyzer and syntax analyzer.c)Efficient implementation of symbol table among, an ordered list, unordered list, and binary search tree is ordered list.d)None of theseCorrect answer is option 'A,C'. Can you explain this answer?.
Solutions for Which of the following is/are not true?a)Most frequent operation on symbol table is insert operation.b)Symbol table data is filled by the lexical analyzer and syntax analyzer.c)Efficient implementation of symbol table among, an ordered list, unordered list, and binary search tree is ordered list.d)None of theseCorrect answer is option 'A,C'. Can you explain this answer? in English & in Hindi are available as part of our courses for Computer Science Engineering (CSE).
Download more important topics, notes, lectures and mock test series for Computer Science Engineering (CSE) Exam by signing up for free.
Here you can find the meaning of Which of the following is/are not true?a)Most frequent operation on symbol table is insert operation.b)Symbol table data is filled by the lexical analyzer and syntax analyzer.c)Efficient implementation of symbol table among, an ordered list, unordered list, and binary search tree is ordered list.d)None of theseCorrect answer is option 'A,C'. Can you explain this answer? defined & explained in the simplest way possible. Besides giving the explanation of
Which of the following is/are not true?a)Most frequent operation on symbol table is insert operation.b)Symbol table data is filled by the lexical analyzer and syntax analyzer.c)Efficient implementation of symbol table among, an ordered list, unordered list, and binary search tree is ordered list.d)None of theseCorrect answer is option 'A,C'. Can you explain this answer?, a detailed solution for Which of the following is/are not true?a)Most frequent operation on symbol table is insert operation.b)Symbol table data is filled by the lexical analyzer and syntax analyzer.c)Efficient implementation of symbol table among, an ordered list, unordered list, and binary search tree is ordered list.d)None of theseCorrect answer is option 'A,C'. Can you explain this answer? has been provided alongside types of Which of the following is/are not true?a)Most frequent operation on symbol table is insert operation.b)Symbol table data is filled by the lexical analyzer and syntax analyzer.c)Efficient implementation of symbol table among, an ordered list, unordered list, and binary search tree is ordered list.d)None of theseCorrect answer is option 'A,C'. Can you explain this answer? theory, EduRev gives you an
ample number of questions to practice Which of the following is/are not true?a)Most frequent operation on symbol table is insert operation.b)Symbol table data is filled by the lexical analyzer and syntax analyzer.c)Efficient implementation of symbol table among, an ordered list, unordered list, and binary search tree is ordered list.d)None of theseCorrect answer is option 'A,C'. Can you explain this answer? tests, examples and also practice Computer Science Engineering (CSE) tests.
|
|
Explore Courses for Computer Science Engineering (CSE) exam
|
|
Suggested Free Tests
Signup for Free!
Signup to see your scores go up within 7 days! Learn & Practice with 1000+ FREE Notes, Videos & Tests.
|
© EduRev
|
Education Revolution
|
Follow Us
|
Signup to see your scores
go up within 7 days!
Access 1000+ FREE Docs, Videos and Tests
Takes less than 10 seconds to signup