-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathjavascript.html
More file actions
711 lines (637 loc) · 39.8 KB
/
javascript.html
File metadata and controls
711 lines (637 loc) · 39.8 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
<!DOCTYPE html>
<html lang="en">
<head>
<meta charset="UTF-8">
<meta http-equiv="X-UA-Compatible" content="IE=edge">
<meta name="viewport" content="width=device-width, initial-scale=1.0">
<title>Get FAQ</title>
<link rel="stylesheet" href="style.css">
<link rel="stylesheet" href="https://cdnjs.cloudflare.com/ajax/libs/font-awesome/5.15.3/css/all.min.css">
<link rel="stylesheet"
href="https://fonts.googleapis.com/css2?family=Poppins:wght@100;200;300;400;600;700&display=swap">
<link rel="stylesheet" href="https://cdn.jsdelivr.net/npm/bootstrap@4.0.0/dist/css/bootstrap.min.css" integrity="sha384-Gn5384xqQ1aoWXA+058RXPxPg6fy4IWvTNh0E263XmFcJlSAwiGgFAW/dAiS6JXm" crossorigin="anonymous">
</head>
<body>
<section class="Sub-header">
<nav class="navbar navbar-expand-lg navbar-light">
<div class="container">
<a href="index.html" class="logo">
<img src="img/logo.svg" alt="logo" />
</a>
<button class="navbar-toggler" type="button" data-toggle="collapse" data-target="#navbarSupportedContent" aria-controls="navbarSupportedContent" aria-expanded="false" aria-label="Toggle navigation">
<span class="navbar-toggler-icon"></span>
</button>
<div class="nav-links" id="navLinks">
<ul>
<li><a href="index.html" class="btn btn btn-secondary ">Home</a></li>
<li>
<div class="dropdown">
<button class="btn btn-secondary dropdown-toggle btn" type="button" id="dropdownMenuButton" data-toggle="dropdown" aria-haspopup="true" aria-expanded="false">
LANGUAGES
</button>
<div class="dropdown-menu" aria-labelledby="dropdownMenuButton">
<a class="dropdown-item" href="python.html">Python</a>
<a class="dropdown-item" href="c++.html">C++</a>
<a class="dropdown-item" href="java.html">Java</a>
<a class="dropdown-item" href="javascript.html">Data Structure</a>
<a class="dropdown-item" href="OS.html">Operating System</a>
<a class="dropdown-item" href="sql.html">SQL</a>
</div>
</div>
</li>
<li><a href="about copy.html" class="btn btn btn-secondary ">About Us</a></li>
<li><a href="contact.html" class="btn btn btn-secondary ">Contact Us</a></li>
</ul>
</div>
</div>
</nav>
<div class="inner_text">
<h1>Data Structure</h1>
</div>
</section>
<!-- course start -->
<section class="course">
<h1>QUESTIONS BASED ON DATA STRUCTURES</h1>
<div class= "faq">
<div class = "question">
<h4>Describe the types of Data Structures?</h4>
<svg width="15" height="10" viewbox = "0 0 42 25">
<path d="M3 3L21 21L39 3" stroke="white" stroke-width="7" stroke-linecap="round"/>
</svg>
</div>
<div class = "answer">
<p>
The following are the types of data structures:
<br>• Lists: A collection of related things linked to the previous or/and following data items.
<br>• Records: A collection of fields, each of which contains data from a single data type.
<br>• Trees: A data structure that organizes data in a hierarchical framework. This form of data structure follows the ordered order of data item insertion, deletion, and modification.
<br>• Tables: The data is saved in the form of rows and columns. These are comparable to records in that the outcome or alteration of data is mirrored across the whole table.
</p>
</div>
</div>
<div class= "faq">
<div class = "question">
<h4>What are some applications of Data Structures? </h4>
<svg width="15" height="10" viewbox = "0 0 42 25">
<path d="M3 3L21 21L39 3" stroke="white" stroke-width="7" stroke-linecap="round"/>
</svg>
</div>
<div class = "answer">
<p>
Numerical analysis, operating system, AI, compiler design, database management, graphics, statistical analysis, and simulation.
</p>
</div>
</div>
<div class= "faq">
<div class = "question">
<h4>What is the difference between file structure and storage structure?</h4>
<svg width="15" height="10" viewbox = "0 0 42 25">
<path d="M3 3L21 21L39 3" stroke="white" stroke-width="7" stroke-linecap="round"/>
</svg>
</div>
<div class = "answer">
<p>
The difference lies in the memory area accessed. Storage structure refers to the data structure in the memory of the computer system, whereas file structure represents the storage structure in the auxiliary memory.
</p>
</div>
</div>
<div class= "faq">
<div class = "question">
<h4>What is a multidimensional array?</h4>
<svg width="15" height="10" viewbox = "0 0 42 25">
<path d="M3 3L21 21L39 3" stroke="white" stroke-width="7" stroke-linecap="round"/>
</svg>
</div>
<div class = "answer">
<p>
A multidimensional array is a multidimensional array with more than one dimension. It is an array of arrays or an array with numerous layers. The 2D array, or two-dimensional array, is the most basic multidimensional array. As you'll see in the code, it's technically an array of arrays. A 2D array is also referred to as a matrix or a table with rows and columns. Declaring a multidimensional array is the same as saying a one-dimensional array. We need to notify C that we have two dimensions for a two-dimensional array.
</p>
</div>
</div>
<div class= "faq">
<div class = "question">
<h4>Are linked lists considered linear or non-linear Data Structures?</h4>
<svg width="15" height="10" viewbox = "0 0 42 25">
<path d="M3 3L21 21L39 3" stroke="white" stroke-width="7" stroke-linecap="round"/>
</svg>
</div>
<div class = "answer">
<p>
Linked lists are considered both linear and non-linear data structures depending upon the application they are used for. When used for access strategies, it is considered as a linear data-structure. When used for data storage, it is considered a non-linear data structure.
</p>
</div>
</div>
<div class= "faq">
<div class = "question">
<h4>What is a stack?</h4>
<svg width="15" height="10" viewbox = "0 0 42 25">
<path d="M3 3L21 21L39 3" stroke="white" stroke-width="7" stroke-linecap="round"/>
</svg>
</div>
<div class = "answer">
<p>
A stack is an abstract data type that specifies a linear data structure, as in a real physical stack or piles where you can only take the top item off the stack in order to remove things. Thus, insertion (push) and deletion (pop) of items take place only at one end called top of the stack, with a particular order: LIFO (Last In First Out) or FILO (First In Last Out).
</p>
</div>
</div>
<div class= "faq">
<div class = "question">
<h4>What is a queue Data Structure? </h4>
<svg width="15" height="10" viewbox = "0 0 42 25">
<path d="M3 3L21 21L39 3" stroke="white" stroke-width="7" stroke-linecap="round"/>
</svg>
</div>
<div class = "answer">
<p>
In this data structure interview question, you can also discuss your experience and situations using queue. A queue is an abstract data type that specifies a linear data structure or an ordered list, using the First In First Out (FIFO) operation to access elements. Insert operations can be performed only at one end called REAR and delete operations can be performed only at the other end called FRONT.
</p>
</div>
</div>
<div class= "faq">
<div class = "question">
<h4>What is a Dequeue?</h4>
<svg width="15" height="10" viewbox = "0 0 42 25">
<path d="M3 3L21 21L39 3" stroke="white" stroke-width="7" stroke-linecap="round"/>
</svg>
</div>
<div class = "answer">
<p>
It is a double-ended queue, or a data structure, where the elements can be inserted or deleted at both ends (FRONT and REAR).
</p>
</div>
</div>
<div class= "faq">
<div class = "question">
<h4>WWhat is an asymptotic analysis of an algorithm?</h4>
<svg width="15" height="10" viewbox = "0 0 42 25">
<path d="M3 3L21 21L39 3" stroke="white" stroke-width="7" stroke-linecap="round"/>
</svg>
</div>
<div class = "answer">
<p>
Asymptotic analysis is the technique of determining an algorithm's running time in mathematical units to determine the program's limits, also known as "run-time performance." The purpose is to identify the best case, worst case, and average-case times for completing a particular activity. While not a deep learning training technique, Asymptotic analysis is an essential diagnostic tool for programmers to analyze an algorithm's efficiency rather than its correctness.
</p>
</div>
</div>
<div class= "faq">
<div class = "question">
<h4>What are asymptotic notations? </h4>
<svg width="15" height="10" viewbox = "0 0 42 25">
<path d="M3 3L21 21L39 3" stroke="white" stroke-width="7" stroke-linecap="round"/>
</svg>
</div>
<div class = "answer">
<p>
Asymptotic Notation represents an algorithm's running time - how long an algorithm takes with a given input, n. Big O, large Theta (), and big Omega () are the three distinct notations. When the running time is the same in all circumstances, big- is used, big-O for the worst-case running time, and big- for the best case running time.
</p>
</div>
</div>
<div class= "faq">
<div class = "question">
<h4>What are some examples of divide and conquer algorithms?</h4>
<svg width="15" height="10" viewbox = "0 0 42 25">
<path d="M3 3L21 21L39 3" stroke="white" stroke-width="7" stroke-linecap="round"/>
</svg>
</div>
<div class = "answer">
<p>
Quicksort is the name of a sorting algorithm. The method selects a pivot element and rearranges the array elements so that all items less than the pivot chosen element go to the left side of the pivot and all elements more significant than the pivot element move to the right side.
Merge Sort is a sorting algorithm as well. The algorithm divides the array into two halves, sorts them recursively, and then combines the two sorted halves. The goal of points that are closest together is to identify the nearest pair of points in an x-y plane collection of points. The issue may be solved in O(n2) time by computing the distances between each pair of locations and comparing them to determine the shortest distance.
</p>
</div>
</div>
<div class= "faq">
<div class = "question">
<h4>Define the graph Data Structure?</h4>
<svg width="15" height="10" viewbox = "0 0 42 25">
<path d="M3 3L21 21L39 3" stroke="white" stroke-width="7" stroke-linecap="round"/>
</svg>
</div>
<div class = "answer">
<p>
It is a type of non-linear data structure that consists of vertices or nodes connected by edges or arcs to enable storage or retrieval of data. Edges may be directed or undirected.
</p>
</div>
</div>
<div class= "faq">
<div class = "question">
<h4>What is an AVL tree?</h4>
<svg width="15" height="10" viewbox = "0 0 42 25">
<path d="M3 3L21 21L39 3" stroke="white" stroke-width="7" stroke-linecap="round"/>
</svg>
</div>
<div class = "answer">
<p>
An AVL (Adelson, Velskii, and Landi) tree is a height balancing binary search tree in which the difference of heights of the left and right subtrees of any node is less than or equal to one. This controls the height of the binary search tree by not letting it get skewed. This is used when working with a large data set, with continual pruning through insertion and deletion of data.
</p>
</div>
</div>
<div class= "faq">
<div class = "question">
<h4>Differentiate NULL and VOID?</h4>
<svg width="15" height="10" viewbox = "0 0 42 25">
<path d="M3 3L21 21L39 3" stroke="white" stroke-width="7" stroke-linecap="round"/>
</svg>
</div>
<div class = "answer">
<p>
Null is a value, whereas Void is a data type identifier
Null indicates an empty value for a variable, whereas void indicates pointers that have no initial size
Null means it never existed; Void means it existed but is not in effect
</p>
</div>
</div>
<div class= "faq">
<div class = "question">
<h4>Do dynamic memory allocations help in managing data? How?</h4>
<svg width="15" height="10" viewbox = "0 0 42 25">
<path d="M3 3L21 21L39 3" stroke="white" stroke-width="7" stroke-linecap="round"/>
</svg>
</div>
<div class = "answer">
<p>
Dynamic memory allocation stores simple structured data types at runtime. It has the ability to combine separately allocated structured blocks to form composite structures that expand and contract as needed, thus helping manage data of data blocks of arbitrary size, in arbitrary order.
</p>
</div>
</div>
<div class= "faq">
<div class = "question">
<h4>Explain the jagged array.</h4>
<svg width="15" height="10" viewbox = "0 0 42 25">
<path d="M3 3L21 21L39 3" stroke="white" stroke-width="7" stroke-linecap="round"/>
</svg>
</div>
<div class = "answer">
<p>
It is an array whose elements themselves are arrays and may be of different dimensions and sizes.
</p>
</div>
</div>
<div class= "faq">
<div class = "question">
<h4>Explain the max heap Data Structure.</h4>
<svg width="15" height="10" viewbox = "0 0 42 25">
<path d="M3 3L21 21L39 3" stroke="white" stroke-width="7" stroke-linecap="round"/>
</svg>
</div>
<div class = "answer">
<p>
It is a type of heap data structure where the value of the root node is greater than or equal to either of its child nodes.
</p>
</div>
</div>
<div class= "faq">
<div class = "question">
<h4>How do you find the height of a node in a tree?</h4>
<svg width="15" height="10" viewbox = "0 0 42 25">
<path d="M3 3L21 21L39 3" stroke="white" stroke-width="7" stroke-linecap="round"/>
</svg>
</div>
<div class = "answer">
<p>
The height of the node equals the number of edges in the longest path to the leaf from the node, where the depth of a leaf node is 0.
</p>
</div>
</div>
<div class= "faq">
<div class = "question">
<h4>What is the difference between a PUSH and a POP?</h4>
<svg width="15" height="10" viewbox = "0 0 42 25">
<path d="M3 3L21 21L39 3" stroke="white" stroke-width="7" stroke-linecap="round"/>
</svg>
</div>
<div class = "answer">
<p>
Pushing and popping applies to the way data is stored and retrieved in a stack. A push denotes data being added to it, meaning data is being “pushed” into the stack.
<br> On the other hand, a pop denotes data retrieval, and in particular, refers to the topmost data being accessed.
</p>
</div>
</div>
<div class= "faq">
<div class = "question">
<h4>How does variable declaration affect memory allocation?</h4>
<svg width="15" height="10" viewbox = "0 0 42 25">
<path d="M3 3L21 21L39 3" stroke="white" stroke-width="7" stroke-linecap="round"/>
</svg>
</div>
<div class = "answer">
<p>
The amount of memory to be allocated or reserved would depend on the data type of the variable being declared. For example, if a variable is declared to be of integer type, then 32 bits of memory storage will be reserved for that variable.
</p>
</div>
</div>
<div class= "faq">
<div class = "question">
<h4>What is hashmap in data structure?</h4>
<svg width="15" height="10" viewbox = "0 0 42 25">
<path d="M3 3L21 21L39 3" stroke="white" stroke-width="7" stroke-linecap="round"/>
</svg>
</div>
<div class = "answer">
<p>
Hashmap is a data structure that uses implementation of hash table data structure which allows access of data in constant time (O(1)) complexity if you have the key.
</p>
</div>
</div>
<div class= "faq">
<div class = "question">
<h4>What is the time complexity of basic operations get() and put() in HashMap class?</h4>
<svg width="15" height="10" viewbox = "0 0 42 25">
<path d="M3 3L21 21L39 3" stroke="white" stroke-width="7" stroke-linecap="round"/>
</svg>
</div>
<div class = "answer">
<p>
The time complexity is O(1) assuming that the hash function used in hash map distributes elements uniformly among the buckets.
</p>
</div>
</div>
<div class= "faq">
<div class = "question">
<h4>What is a priority queue?</h4>
<svg width="15" height="10" viewbox = "0 0 42 25">
<path d="M3 3L21 21L39 3" stroke="white" stroke-width="7" stroke-linecap="round"/>
</svg>
</div>
<div class = "answer">
<p>
• A priority queue is an abstract data type that is like a normal queue but has priority assigned to elements.
<br>• Elements with higher priority are processed before the elements with a lower priority.
<br>• In order to implement this, a minimum of two queues are required - one for the data and the other to store the priority.
</p>
</div>
</div>
<div class= "faq">
<div class = "question">
<h4>Can we store a duplicate key in HashMap?</h4>
<svg width="15" height="10" viewbox = "0 0 42 25">
<path d="M3 3L21 21L39 3" stroke="white" stroke-width="7" stroke-linecap="round"/>
</svg>
</div>
<div class = "answer">
<p>
• No, duplicate keys cannot be inserted in HashMap. If you try to insert any entry with an existing key, then the old value would be overridden with the new value. Doing this will not change the size of HashMap.
<br> • This is why the keySet() method returns all keys as a SET in Java since it doesn't allow duplicates.
</p>
</div>
</div>
<div class= "faq">
<div class = "question">
<h4>What is the difference between tree and graph data structure?</h4>
<svg width="15" height="10" viewbox = "0 0 42 25">
<path d="M3 3L21 21L39 3" stroke="white" stroke-width="7" stroke-linecap="round"/>
</svg>
</div>
<div class = "answer">
<p>
• Tree and graph are differentiated by the fact that a tree structure must be connected and can never have loops whereas in the graph there are no restrictions.
<br> • Tree provides insights on relationship between nodes in a hierarchical manner and graph follows a network model.
</p>
</div>
</div>
<div class= "faq">
<div class = "question">
<h4>What is a postfix expression?</h4>
<svg width="15" height="10" viewbox = "0 0 42 25">
<path d="M3 3L21 21L39 3" stroke="white" stroke-width="7" stroke-linecap="round"/>
</svg>
</div>
<div class = "answer">
<p>
A postfix expression is made up of operators and operands, with the operator coming after the operands. That is, in a postfix expression, the operator comes after the operands. Likewise, what is the proper postfix form? The correct postfix phrase is A B + C *.
</p>
</div>
</div>
<div class= "faq">
<div class = "question">
<h4>What is a queue Data Structure? </h4>
<svg width="15" height="10" viewbox = "0 0 42 25">
<path d="M3 3L21 21L39 3" stroke="white" stroke-width="7" stroke-linecap="round"/>
</svg>
</div>
<div class = "answer">
<p>
In this data structure interview question, you can also discuss your experience and situations using queue. A queue is an abstract data type that specifies a linear data structure or an ordered list, using the First In First Out (FIFO) operation to access elements. Insert operations can be performed only at one end called REAR and delete operations can be performed only at the other end called FRONT.
</p>
</div>
</div>
<div class= "faq">
<div class = "question">
<h4>What is a Dequeue?</h4>
<svg width="15" height="10" viewbox = "0 0 42 25">
<path d="M3 3L21 21L39 3" stroke="white" stroke-width="7" stroke-linecap="round"/>
</svg>
</div>
<div class = "answer">
<p>
It is a double-ended queue, or a data structure, where the elements can be inserted or deleted at both ends (FRONT and REAR).
</p>
</div>
</div>
<div class= "faq">
<div class = "question">
<h4>What is the merge sort? How does it work?</h4>
<svg width="15" height="10" viewbox = "0 0 42 25">
<path d="M3 3L21 21L39 3" stroke="white" stroke-width="7" stroke-linecap="round"/>
</svg>
</div>
<div class = "answer">
<p>
Merge sort is a divide-and-conquer algorithm for sorting the data. It works by merging and sorting adjacent data to create bigger sorted lists, which are then merged recursively to form even bigger sorted lists until you have one single sorted list.
</p>
</div>
</div>
<div class= "faq">
<div class = "question">
<h4>What is an asymptotic analysis of an algorithm?</h4>
<svg width="15" height="10" viewbox = "0 0 42 25">
<path d="M3 3L21 21L39 3" stroke="white" stroke-width="7" stroke-linecap="round"/>
</svg>
</div>
<div class = "answer">
<p>
Asymptotic analysis is the technique of determining an algorithm's running time in mathematical units to determine the program's limits, also known as "run-time performance." The purpose is to identify the best case, worst case, and average-case times for completing a particular activity. While not a deep learning training technique, Asymptotic analysis is an essential diagnostic tool for programmers to analyze an algorithm's efficiency rather than its correctness.
</p>
</div>
</div>
<div class= "faq">
<div class = "question">
<h4>What are asymptotic notations?</h4>
<svg width="15" height="10" viewbox = "0 0 42 25">
<path d="M3 3L21 21L39 3" stroke="white" stroke-width="7" stroke-linecap="round"/>
</svg>
</div>
<div class = "answer">
<p>
Asymptotic Notation represents an algorithm's running time - how long an algorithm takes with a given input, n. Big O, large Theta (), and big Omega () are the three distinct notations. When the running time is the same in all circumstances, big- is used, big-O for the worst-case running time, and big- for the best case running time.
</p>
</div>
</div>
<div class= "faq">
<div class = "question">
<h4>Define the graph Data Structure?</h4>
<svg width="15" height="10" viewbox = "0 0 42 25">
<path d="M3 3L21 21L39 3" stroke="white" stroke-width="7" stroke-linecap="round"/>
</svg>
</div>
<div class = "answer">
<p>
It is a type of non-linear data structure that consists of vertices or nodes connected by edges or arcs to enable storage or retrieval of data. Edges may be directed or undirected.
</p>
</div>
</div>
<div class= "faq">
<div class = "question">
<h4>What is the minimum number of nodes that a binary tree can have?</h4>
<svg width="15" height="10" viewbox = "0 0 42 25">
<path d="M3 3L21 21L39 3" stroke="white" stroke-width="7" stroke-linecap="round"/>
</svg>
</div>
<div class = "answer">
<p>
A binary tree can have a minimum of zero nodes, which occurs when the nodes have NULL values. Furthermore, a binary tree can also have 1 or 2 nodes.
</p>
</div>
</div>
<div class= "faq">
<div class = "question">
<h4>How do signed and unsigned numbers affect memory?</h4>
<svg width="15" height="10" viewbox = "0 0 42 25">
<path d="M3 3L21 21L39 3" stroke="white" stroke-width="7" stroke-linecap="round"/>
</svg>
</div>
<div class = "answer">
<p>
In the case of signed numbers, the first bit is used to indicate whether positive or negative, which leaves you with one bit short. With unsigned numbers, you have all bits available for that number. The effect is best seen in the number range (an unsigned 8-bit number has a range 0-255, while the 8-bit signed number has a range -128 to +127.
</p>
</div>
</div>
<div class= "faq">
<div class = "question">
<h4>How do you insert a new item in a binary search tree?</h4>
<svg width="15" height="10" viewbox = "0 0 42 25">
<path d="M3 3L21 21L39 3" stroke="white" stroke-width="7" stroke-linecap="round"/>
</svg>
</div>
<div class = "answer">
<p>
Assuming that the data to be inserted is a unique value (that is, not an existing entry in the tree), check first if the tree is empty. If it’s empty, just insert the new item in the root node. If it’s not empty, refer to the new item’s key. If it’s smaller than the root’s key, insert it into the root’s left subtree, otherwise, insert it into the root’s right subtree.
</p>
</div>
</div>
<div class= "faq">
<div class = "question">
<h4>What is a postfix expression?</h4>
<svg width="15" height="10" viewbox = "0 0 42 25">
<path d="M3 3L21 21L39 3" stroke="white" stroke-width="7" stroke-linecap="round"/>
</svg>
</div>
<div class = "answer">
<p>
A postfix expression is an expression in which each operator follows its operands. The advantage of this form is that there is no need to group sub-expressions in parentheses or to consider operator precedence.
</p>
</div>
</div>
<div class= "faq">
<div class = "question">
<h4>What is the advantage of the heap over a stack?</h4>
<svg width="15" height="10" viewbox = "0 0 42 25">
<path d="M3 3L21 21L39 3" stroke="white" stroke-width="7" stroke-linecap="round"/>
</svg>
</div>
<div class = "answer">
<p>
The heap is more flexible than the stack. That’s because memory space for the heap can be dynamically allocated and de-allocated as needed. However, the memory of the heap can at times be slower when compared to that stack.
</p>
</div>
</div>
<div class= "faq">
<div class = "question">
<h4>How does variable declaration affect memory allocation?</h4>
<svg width="15" height="10" viewbox = "0 0 42 25">
<path d="M3 3L21 21L39 3" stroke="white" stroke-width="7" stroke-linecap="round"/>
</svg>
</div>
<div class = "answer">
<p>
The amount of memory to be allocated or reserved would depend on the data type of the variable being declared. For example, if a variable is declared to be of integer type, then 32 bits of memory storage will be reserved for that variable.
</p>
</div>
</div>
<div class= "faq">
<div class = "question">
<h4>Do all declaration statements result in a fixed reservation in memory?</h4>
<svg width="15" height="10" viewbox = "0 0 42 25">
<path d="M3 3L21 21L39 3" stroke="white" stroke-width="7" stroke-linecap="round"/>
</svg>
</div>
<div class = "answer">
<p>
Most declarations do, with the exemption of pointers. Pointer declaration does not allocate memory for data, but for the address of the pointer variable. Actual memory allocation for the data comes during run-time.
</p>
</div>
</div>
<div class= "faq">
<div class = "question">
<h4> Differentiate STACK from ARRAY.</h4>
<svg width="15" height="10" viewbox = "0 0 42 25">
<path d="M3 3L21 21L39 3" stroke="white" stroke-width="7" stroke-linecap="round"/>
</svg>
</div>
<div class = "answer">
<p>Stack follows a LIFO pattern. It means that data access follows a sequence wherein the last data to be stored when the first one to be extracted. Arrays, on the other hand, does not follow a particular order and instead can be accessed by referring to the indexed element within the array.Most declarations do, with the exemption of pointers. Pointer declaration does not allocate memory for data, but for the address of the pointer variable. Actual memory allocation for the data comes during run-time.
</p>
</div>
</div>
</section>
<!-- course end -->
<!-- best course start -->
<section class="facilities">
<h1>Top 5 Things to Remember in an Interview</h1>
<p>You worked hard on your resume and job application, and now you are called in for an in-person job interview. You are one step closer to your dream job.
It’s time to understand how to succeed in the job interview, so that you can actually land the job. Here are the most important things you have to remember.</p>
<div class="row">
<div class="faq">
<h1>1. Dress appropriately</h1>
<h6>Plan out an outfit that fits the culture of the company you are applying for. If the company does not have a dress code, it’s a good idea to wear business casual.
Leave your shorts and tank top at home, and put on a shirt and a pair of long pants. It’s always better to be overdressed than under. Try on your outfit before the interview to make sure that it fits and looks smart.
</h6>
<h1>2. Arrive on time </h1>
<h6>Don’t ever arrive at a job interview late! It’s best to arrive 15 minutes before the scheduled time in case you have to fill in some paperwork. This also allows you to settle down and check out the dynamics of the office.
If you are not familiar with the area in which the company is located, do a test run a week or two before to make sure that you won’t get lost. If you are driving, make a note on where you can park your car.
</h6>
<h1>3. Mind your manner</h1>
<h6>Be polite and greet everyone you meet, including people you meet in the elevator. When you enter the interview, offer the interviewer a warm greeting. These first few seconds can make or break your interview. At the end of the interview, don’t forget to thank the interviewer for giving you the opportunity for the meeting. When you leave the company, say goodbye to the receptionist.
</h6>
<h1>4. Pay attention to your body language<h1>
<h6> Poor body language, such as playing with a pen, chewing gum, slouching, and even brushing back hair, can be a distraction. If you notice you have a tendency to do any of these, train yourself to avoid these bad habits. You can replace them with positive body language that include nodding, eye contact, smiling, and solid posture.
</h6>
<h1>5. Ask insightful questions</h1>
<h6>Most interviewers end an interview by allowing the candidate to ask questions. Regardless of how well you know the company and how thorough the interviewer in telling you about the job, you must ask a few questions. The more insightful your questions are, the more you will impress your interviewer.
What do you do in an interview? Let us know in the comments below!
</h6>
</div>
</div>
<!-- Footer start -->
<section class="footer">
<hr>
<a href="about copy.html" class="foot_btn">ABOUT US</a>
<a href="contact.html" class="foot_btn">CONTACT US</a>
<div class="icons">
<i class="fab fa-facebook-f"></i>
<i class="fab fa-instagram"></i>
<i class="fab fa-twitter"></i>
<i class="fab fa-linkedin"></i>
</div>
<p>Made with <i class="fas fa-heart"></i> by Shruti </p>
<p>Copyright © 2022 <a href="index.html">Get FAQ</a>. All Rights Reserved.</p>
</section>
<!-- Footer end -->
<script src="script.js"></script>
<script src="https://code.jquery.com/jquery-3.2.1.slim.min.js" integrity="sha384-KJ3o2DKtIkvYIK3UENzmM7KCkRr/rE9/Qpg6aAZGJwFDMVNA/GpGFF93hXpG5KkN" crossorigin="anonymous"></script>
<script src="https://cdn.jsdelivr.net/npm/popper.js@1.12.9/dist/umd/popper.min.js" integrity="sha384-ApNbgh9B+Y1QKtv3Rn7W3mgPxhU9K/ScQsAP7hUibX39j7fakFPskvXusvfa0b4Q" crossorigin="anonymous"></script>
<script src="https://cdn.jsdelivr.net/npm/bootstrap@4.0.0/dist/js/bootstrap.min.js" integrity="sha384-JZR6Spejh4U02d8jOt6vLEHfe/JQGiRRSQQxSfFWpi1MquVdAyjUar5+76PVCmYl" crossorigin="anonymous"></script>
<script type="module" src="https://unpkg.com/ionicons@5.5.2/dist/ionicons/ionicons.esm.js"></script>
<script nomodule src="https://unpkg.com/ionicons@5.5.2/dist/ionicons/ionicons.js"></script>
</body>
</html>